Alternating diagram signature formula Created 2026-10-07 Updated 2026-10-14
For a reduced connected alternating knot diagram, its knot signature is , where counts circles in the all- bracket smoothing state and counts positive crossings. The convention is that the -smoothing at a positive braid crossing is the oriented smoothing, and a positive trefoil knot has knot signature . Reversing the global knot signature convention negates the formula.
For knots, matching bracket smoothing states across a connected sum of knots joins one state circle from each side. Their total circle count is therefore the sum of the two counts minus one. The reduced Kauffman bracket state weights multiply, and writhe of a link diagram adds, proving the formula.
True. In a connected sum of knots, a bracket smoothing state from each summand contributes a state of the joined diagram. Joining the two distinguished state circles reduces their total count by one, so the factors multiply. The smoothing weights also multiply and the writhe of a link diagram adds. Thus the Jones polynomial of a connected sum is
False as written for arbitrary links. The two-component unlink has a diagram with no crossings but
The correct connected-diagram statement does hold, in particular for every knot diagram. If count the all- and all- bracket smoothing state circles, changing smoothings increases the circle count by at most . The maximum and minimum exponents therefore lie between and . This gives the Kauffman bracket breadth bound . For a connected projection, the Turaev surface has Euler characteristic , so the bound is . Writhe of a link diagram normalization changes only a monomial, and divides the breadth by four, giving .
For a diagram with projection components, sum the same Euler characteristic inequality over the components. Then and the Jones polynomial breadth bound for a disconnected diagram is . The extra is indispensable, as the unlink shows.
Put . The reduced Kauffman bracket is the Laurent polynomial determined by , , and the crossing expansion . Fix the A smoothing so that a positive curl has multiplier ; rotating the local crossing interchanges the smoothing descriptions. Equivalently, its bracket smoothing states give
where and count its A and B smoothings and is the number of state circles. Resolving all crossings proves that the recursive rules define the same polynomial independently of the order of expansion.
Under a positive Reidemeister move of type I, the two resolutions give times the straight strand; the negative curl gives . Thus the bracket itself is not an unframed link invariant. For type II, use the adjacent cap-cup generator of the Temperley-Lieb algebra, with . The crossing and its inverse are and , and
For type III, and the analogous reversed relation give
Hence the bracket is invariant under types II and III.
For an oriented diagram, let be its writhe of a link diagram, the sum of its signed crossings. Types II and III preserve writhe of a link diagram, while a positive or negative curl changes it by one or minus one. The Jones polynomial is therefore
The normalization cancels type I, so all Reidemeister moves preserve it. It is a Laurent polynomial in ; its breadth means the largest occurring t exponent minus the smallest, including half-integral exponents for links.
The Jones polynomial skein relation follows directly from the same normalization. Write for the bracket of the oriented smoothing and for the other smoothing. The local expansions are and , while . Consequently
Substituting gives
The other smoothing has cancelled, so the identity applies with exactly the oriented local convention in the PDF.
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.
Put . The reduced Kauffman bracket is the Laurent polynomial determined by , , and the crossing expansion . Fix the A smoothing so that a positive curl has multiplier ; rotating the local crossing interchanges the smoothing descriptions. Equivalently, its bracket smoothing states give
where and count its A and B smoothings and is the number of state circles. Resolving all crossings proves that the recursive rules define the same polynomial independently of the order of expansion.
Under a positive Reidemeister move of type I, the two resolutions give times the straight strand; the negative curl gives . Thus the bracket itself is not an unframed link invariant. For type II, use the adjacent cap-cup generator of the Temperley-Lieb algebra, with . The crossing and its inverse are and , and
For type III, and the analogous reversed relation give
Hence the bracket is invariant under types II and III.
For an oriented diagram, let be its writhe, the sum of its signed crossings. Types II and III preserve writhe, while a positive or negative curl changes it by one or minus one. The Jones polynomial is therefore
The normalization cancels type I, so all Reidemeister moves preserve it. It is a Laurent polynomial in ; its breadth means the largest occurring t exponent minus the smallest, including half-integral exponents for links.
Write for the all-A and all-B circle counts of a diagram with crossings. A state obtained from the all-A state by smoothing changes has at most circles, because each change either joins two circles or splits one. Its largest A exponent is consequently at most . The symmetric argument from the all-B state bounds every exponent below by . Thus the Kauffman bracket breadth bound is
For a connected diagram, construct the Turaev surface by placing A-state circles above the projection sphere, B-state circles below it, inserting one saddle at each crossing, and capping the state circles. This is a connected embedded closed orientable surface; its disks and saddles give . Since , . Writhe normalization changes only a monomial, and divides breadth by four. Therefore
For a connected reduced alternating diagram, checkerboard color its complementary regions. Alternation makes all-A circles the boundaries of one color and all-B circles the boundaries of the other. Euler's formula for the connected four-valent projection graph gives . Its Tait graph and planar dual have no loops: a loop in either, equivalently a loop or bridge in one, gives a nugatory crossing cut off by a simple closed curve. Reducedness excludes precisely such crossings. Changing one smoothing in the all-A or all-B state therefore joins distinct circles, so the diagram is an adequate link diagram.
This also proves that the extreme coefficients cannot cancel. If smoothings are changed from the all-A state, the first change lowers its circle count by one and the remaining changes increase it by at most . The largest exponent of that state is at most , four below the all-A extreme , whose coefficient is . The all-B extreme is uniquely attained for the same reason. Consequently
For each alternating knot , remove nugatory crossings from an alternating diagram. The equality just proved, together with the general breadth bound for any knot diagram, shows that its reduced crossing count is minimal: . Joining two knot diagrams by an orientation-compatible connected sum of knots gives . Indeed the state circles joined along the sum arc become one, so the bracket state sums multiply, and writhe adds. Nonzero Laurent polynomials have additive breadth, because their extreme coefficients multiply. Hence every diagram of the sum has at least crossings, while joining the two minimal alternating diagrams achieves that count. Thus
Finally suppose that the two-component link is split. Its Jones polynomial satisfies , by the disjoint-union bracket rule, so . If the given alternating diagram were connected, its Tait graph would be connected. Evaluate the bracket at , where and . Only one-circle states survive. These are exactly the spanning trees of : a regular neighborhood of a chosen spanning subgraph has one boundary circle exactly when it is connected and has no cycle. All spanning trees use the same number of black-joining smoothings, . Since the crossing-to-checkerboard smoothing choice is uniform in an alternating diagram, all surviving state weights are the same nonzero power of . Therefore is that power times the positive number of spanning trees, and , a contradiction.
The diagram is thus disconnected. Each of the two link components projects to a connected subset, so the two projection components can be separated by a boundary curve of a small regular neighborhood in the projection sphere. Hence a split two-component link represented by a reduced alternating diagram has a split diagram.
Write . Normalize the reduced Kauffman bracket by and . At a positive braid crossing choose the smoothing rule , where is the two parallel strands and joins the adjacent top endpoints and adjacent bottom endpoints. At its mirror crossing the coefficients are interchanged. This convention fixes the two smoothing labels. Equivalently, for a nonempty diagram,
where each bracket smoothing state chooses one smoothing at each crossing, count the choices, and counts the resulting circles. It is a Laurent polynomial in and is independent of the order in which crossings are resolved.
We prove the local invariance needed for the Jones polynomial. In the Temperley-Lieb diagram algebra, stacking the smoothing tangles gives , and its reflected version. These identities follow just by following the planar strands; only the first removes an extra circle. The inverse crossing is , and
Thus the second Reidemeister move preserves the bracket. Expanding three crossings gives
so the third Reidemeister move does too; inverse versions follow by multiplying by inverse crossings. A positive curl resolves to times the straight strand, and a negative curl gives . Thus the first move changes the bracket by the indicated factor.
Orient the diagram and let be its writhe, the sum of the signed crossings. Define
The first move changes by or , exactly cancelling the bracket's curl factor. The other two moves leave writhe unchanged. Planar isotopy leaves both quantities unchanged. The Reidemeister theorem states that diagrams of ambient-isotopic tame oriented links are related by planar isotopy and these three local moves; therefore depends only on the oriented link.
This substitution really lies in . If there are crossings, each state exponent has parity , and also has parity . Expanding each power of adds only even exponents, so every exponent of the normalized bracket has parity . Every even power of is an integral power of . The normalization gives .