The Conway polynomial is normalized by for the unknot, zero for a split unlink with more than one component, and the skein relation . For a knot, the symmetric Alexander polynomial with value one at is . This fixes the Laurent-unit ambiguity of the Seifert-matrix presentation of the Alexander module.
This asks whether the Jones polynomial equal to one characterizes the unknot among knots. A zero breadth of a Laurent polynomial makes a monomial; the identities and then force that monomial to be one. Thus using Jones breadth as a strictly positive complexity for nontrivial knots requires this detection property. To prove the derivative identity, differentiate the Jones polynomial skein relation at one for a crossing change in a knot. Both crossed diagrams have value one, while the smoothed two-component link has value minus two by Jones polynomial evaluation at one, so . Crossing changes reduce to the unknot, whose derivative is zero. The corresponding Alexander polynomial detection property is false, as nontrivial untwisted Whitehead doubles demonstrate. The Jones question is discussed in research on closed four-strand braids.
To form the connected sum of knots , remove a short unknotted arc from each oriented knot in two disjoint balls and join the remaining endpoints by a pair of parallel arcs respecting the orientations. Equivalently, a sphere meeting a knot in two points cuts it into two one-string tangles; close each by an arc in the sphere to recover its summands. Sliding the small joining balls along the knots shows that the isotopy type does not depend on these choices. The unknot is the identity for this operation. A prime knot is a nontrivial knot such that every expression has an unknot summand.
The Seifert algorithm supplies a Seifert surface for every oriented knot: smooth the crossings in their oriented directions, span the resulting Seifert circles by disks at different heights, and restore each crossing with a half-twisted band. If needed, join components by tubes away from the boundary. Thus the set of surface genera is a nonempty subset of the nonnegative integers and has a minimum, so exists.
We first prove additivity of Seifert genus, which also supplies a terminating measure for decomposition. Joining minimal Seifert surfaces along their boundary arcs gives . For the reverse inequality, let be a minimal-genus Seifert surface for the sum and a splitting sphere of a knot. Arrange transverse intersection so that consists of one arc joining the two boundary-intersection points and some circles, with the number of circles minimal among genus-minimizing surfaces.
Each circle separates the sphere into two disks; since it is disjoint from the intersection arc, one disk contains neither marked endpoint. Choose an innermost such circle and its disk , whose interior misses . If its boundary were essential in , compressing along would lower the genus of its component with boundary K: for a nonseparating curve genus drops by one, and for a separating essential curve the removed boundaryless side has positive genus. This contradicts minimal genus. Its boundary therefore bounds a disk in . Replace that disk by a small push-off of , removing the intersection circle without changing genus or boundary, again contradicting minimal intersection. Thus no circles remain.
Cutting along its single intersection arc gives two connected surfaces with boundaries the two summand knots after the closing arcs are added. Euler characteristic shows that their genera add to . Each genus is at least the minimum genus of its summand, so
Genus zero means that the knot bounds a disk and is the unknot. Every nontrivial knot therefore has positive genus. Induct on this nonnegative integer: a nontrivial nonprime knot splits into two nontrivial summands, each with strictly smaller genus by the equality above, and induction decomposes both into primes. This proves every knot is a finite connected sum of prime knots, with the unknot the empty sum.
The same induction does not follow from the three suggested replacements. For crossing number of a knot, joining minimal diagrams gives only subadditivity; a reverse inequality giving strict descent for every nontrivial summand is not provided by this argument. The Jones polynomial of a connected sum does make its breadth of a Laurent polynomial additive, but the needed implication that zero breadth forces the unknot is the Jones unknot detection problem. For the Alexander polynomial, even this implication is false: nontrivial untwisted Whitehead doubles have Alexander polynomial one and hence breadth zero. The decisive genus property is both additivity and the exact characterization if and only if is the unknot.
For uniqueness use complete decomposing sphere systems for a knot. Cut each system and cap the marked boundary spheres with straight arcs; the resulting oriented factors are prime knots. Compare two systems in transverse position, and use the prime-ball exchange lemma to simplify their intersection. Choose an innermost intersection circle bounding a disk in a sphere of one system and lying in a prime-factor ball of the other. If the disk misses the knotted arc it cuts off an empty ball. If it meets the arc once it cuts the prime factor into two knots, so one is an unknot. Replace the old ball by the side carrying the same prime factor, perturb its boundary slightly, and remove that intersection circle. This preserves the unordered factors: the discarded empty or trivial ball merely changes the joining arc, and any intervening capped boundaries still carry their original factors. If the chosen disk contains both marked points, take another innermost disk without marked points, or the complementary disk when the intersection circle is the only one.
Iteration yields an innermost prime-factor ball disjoint from both systems. Its arc has no nontrivial further decomposition, so it represents one factor in each. The boundary can be included in both systems using the same ball exchange; replace its arc by a straight boundary arc and remove this common factor. Induction on the number of factors matches the remaining factors. When the systems already have no intersections, start directly with an innermost ball and the same removal step. All replacements preserve the arc orientation, so the match is of oriented knots, not only unoriented types. Hence the prime decomposition of knots is unique up to reordering and oriented link isotopy.
Let be an oriented Seifert surface of genus for , and choose a basis of . Push a representative curve slightly in the positive normal direction to obtain . The Seifert matrix in our row convention is
The difference is the intersection form of F, up to the convention for its orientation; in a symplectic basis it is a direct sum of unimodular two-by-two skew blocks.
Write for the knot exterior. Linking number with K gives the epimorphism sending a positive meridian to one. Let be the associated infinite cyclic cover, with deck transformation t. The Alexander module of a knot is , regarded as a module over the Laurent polynomial ring . Its order, the greatest common divisor of the maximal presentation minors, is the Alexander polynomial of a knot, defined up to . Equivalently these minors generate its zeroth Fitting ideal; we will obtain a square presentation, so its determinant gives the order. No assertion that is a principal ideal domain is needed.
Here is the Seifert-matrix presentation of the Alexander module with its topological justification. Cut X along F, obtaining a connected manifold Y with two boundary copies and . Up to collars this is the complement of a thickening of F in . Alexander duality gives and the perfect linking pairing with . Choose generators satisfying . This homology statement does not require Y to be a handlebody. The two inclusions satisfy
Indeed the first coefficients are the defining positive linking numbers; for the second, moving the two curves to opposite sides and using symmetry of linking gives .
Stack copies of Y, identifying the positive copy of F in one layer with the negative copy in the next. This is . The Mayer–Vietoris sequence, with all translates collected into Laurent modules, contains
The last map is injective because is an integral domain. Thus the entire Alexander module is presented by the row relations (transpose the matrix if using column vectors). At its determinant is , so the determinant is nonzero and the module is a torsion module. Consequently
where denotes equality up to a Laurent unit. The second conclusion follows because a determinant of size with entries linear in t has breadth at most ; minimize over Seifert surfaces.
For the displayed diagram, start on the outer lower arc near the lower left undercrossing and follow the arc through the lower outer loop toward the upper right undercrossing. Number successive undercrossings , and let label the incoming arc at crossing . Reading the overpassing arcs and the conjugation exponents in a consistent meridian convention gives
Thus the Wirtinger presentation relations are , with indices modulo ten. Their Fox derivatives after abelianization give row relations
Delete the redundant last relation and the last column, setting . This is a nine-generator presentation of the Alexander module. The cofactor determinant is ; here is a smaller elimination check. Retain . Seven relations solve the other generators as
The two remaining rows, at undercrossings two and seven, are the matrix
Its determinant is , differing from the original cofactor only by a Laurent unit. Consequently
The factor has value one at and is reciprocal, as required. Its Conway-normalized Alexander polynomial is , and its knot determinant is three.
For the genus upper bound, the over/under Gauss code from the same traversal is
Number these visits . The oriented smoothing permutation of a Gauss code has cycles
There are seven Seifert circles, so the Seifert algorithm gives ten bands and seven disks: , hence . The Alexander breadth bound on Seifert genus supplies the matching lower bound from breadth four. Therefore .
Modulo two, the primitive Alexander polynomial becomes . It has neither zero nor one as a root, and it is not , the only possible product of irreducible monic quadratics over . It is therefore irreducible over , hence over and by Gauss lemma for polynomials. The full-degree irreducible Alexander polynomial implies a prime knot criterion now applies, since its breadth is exactly twice the genus. Thus the knot is prime. The full-degree condition is needed to rule out a nontrivial summand with unit Alexander polynomial.
To test reflection, calculate the Jones polynomial from the same crossing data. The diagram has nine positive crossings and one negative crossing, so its writhe of a link diagram is eight. Enumerate the bracket smoothing states, join their smoothed ends, and weight each state by . Correct by and put . This gives
As checks, and . The Jones polynomial of a mirror is , which differs from this polynomial. Therefore the knot is not equivalent to its reflection. Reversing all crossing conventions reciprocates the displayed Jones polynomial and leaves the conclusion unchanged.
For an integral domain , the breadth of a Laurent polynomial adds under multiplication. If two Laurent polynomials multiply to one, both therefore have breadth zero: they are monomials, and their coefficients must be units of . Conversely every displayed monomial is invertible. For the units are precisely , explaining the normalization ambiguity of an Alexander polynomial.