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.
Resolve the two crossings in a skein relation using the Kauffman bracket, then correct by the writhe of a link diagram. The other smoothing cancels, leaving the displayed coefficient of the oriented smoothing. This relation and the value one on the unknot determine the Jones polynomial: crossing changes give descending diagrams, which are unlinks, while the smoothing terms have fewer crossings.
Number the visits along an oriented knot diagram, and let exchange the two visits to each crossing. At an oriented smoothing, an incoming strand follows the outgoing strand of the other visit. Thus the cycles of the displayed permutation are exactly the Seifert circles. Their count gives the Seifert algorithm genus without requiring a separate drawing of the smoothed diagram.
True with the stated Conway normalization. Fix at . The Jones polynomial skein relation becomes
The Conway polynomial satisfies . Put . An oriented smoothing changes the number of components by one, so these quantities satisfy precisely . Both and are one on the unknot and zero on every multi-component unlink: for , the split-union factor vanishes at this substitution.
These skein relations and unlink values determine the invariants uniquely. Switching a first undesired crossing gives a diagram closer to a descending diagram, while the smoothing term has fewer crossings; induction first on crossing count and then on undesired crossings reduces everything to unlinks. Thus . For a knot there is one component and the Conway-normalized Alexander polynomial gives
This is the signed Jones evaluation at minus one. Replacing by an arbitrary Laurent unit multiple would destroy the signed conclusion.
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.
There are two common normalizations. I will define both explicitly, because the numerical conclusion in the question uses the unreduced one.
Set . The reduced Kauffman bracket of a nonempty link diagram is
where runs over all bracket smoothings, count - and -smoothings, and is the number of resulting circles. Locally,
Fix the usual Kauffman bracket convention in which the -smoothing at a positive braid crossing is its oriented smoothing; reflecting a crossing exchanges and . The unknot has reduced bracket , and adjoining another circle multiplies the bracket by . The unreduced Kauffman bracket uses instead and assigns the empty diagram . Thus for a nonempty diagram
For completeness, the bracket calculations for all three Reidemeister moves can be carried out in the Temperley-Lieb diagram algebra. Let be the identity two-strand tangle, and let be the cap-cup tangle. Composition gives . The two crossings correspond to
Consequently
which proves invariance under the second Reidemeister move. On three strands, the cap-cup diagrams satisfy , , and . Expand the two sides of the third move. Their difference is
Thus the third Reidemeister move also preserves either bracket normalization. Reflected forms of these moves follow by replacing with .
A positive curl contributes , and a negative curl contributes . The writhe of a link diagram changes by or in exactly these cases. Therefore the corrected bracket
is invariant under the first Reidemeister move as well; the second and third moves leave the writhe of a link diagram unchanged. Substituting defines a Jones polynomial. For multiple components half-integer powers of may occur. The reduced version has , and the Unreduced Jones polynomial is
At , switching a crossing does not change the bracket: both smoothing coefficients are . It changes the writhe of a link diagram by , so the correction factor is unchanged. Hence either Jones polynomial at is unchanged by a crossing change. By switching crossings, any -component link can be made an unlink. Its crossing-free diagram has circles and zero writhe of a link diagram, giving
Thus the printed conclusion holds for the unreduced normalization. For the reduced Jones polynomial, the correct conclusion is ; the unknot alone already rules out in that convention.
Apply the given skein relation to a positive and a negative kink in a diagram of the unknot. Both crossed link diagrams represent the unknot, whereas the oriented smoothing represents the two-component unlink. Thus
Factor the left-hand side and cancel the nonzero factor in the Laurent polynomial ring:
The positive sign follows from the skein relation as printed in this paper. It differs from the frequently used Jones polynomial convention whose two-component unlink has value . With the printed convention, an -component link has invariant times that convention's Jones polynomial.
Insert a kink on any component of an oriented link diagram for . Switching the kink's crossing gives another link diagram of ; its oriented smoothing separates off a small unknot in a ball disjoint from the rest of . The skein relation therefore gives
Cancel the nonzero factor in the Laurent polynomial ring to obtain
Reflection through the projection plane reverses the orientation of and exchanges the overpassing and underpassing strands at every crossing. Thus switching all crossings gives the mirror of a link, with the component orientations transported by the reflection.
Define . Reflection exchanges with and preserves the oriented smoothing. Apply the printed skein relation to the reflected triple at parameter :
Multiplication by gives the original skein relation for . Also . The stated uniqueness of the Jones polynomial now gives , hence
Let be the positively oriented Hopf link obtained by closing a two-strand braid with two positive crossings. Switching one crossing gives the two-component unlink; the oriented smoothing gives the unknot. The printed skein relation gives
Represent the right-handed trefoil knot by the closure of the two-strand braid with three positive crossings. Switching one crossing gives the unknot, while its oriented smoothing gives . Consequently
so the two Jones polynomials are
The second expression follows from the mirror of a link identity. They are unequal Laurent polynomials, so invariance under link isotopy proves that the right-handed and left-handed trefoils are not isotopic.
Seifert algorithm 2026-10-07
Apply the oriented smoothing to every crossing of an oriented knot diagram, fill the resulting Seifert circles by disjoint disks at suitable heights, and reconnect them by twisted bands at the original crossings. The boundary is the original knot. If the connected surface has disks and bands, its Euler characteristic is and its genus is .
Seifert circle 2026-10-07
A Seifert circle is a component of the crossing-free diagram obtained by oriented smoothing at every crossing. These circles bound the disks used in the Seifert algorithm.