Number the seven crossings from top to bottom. Orient the strand entering the top-left arch downward. With the usual positive braid crossing convention, the crossing signs are
To make the diagram calculation reproducible, its oriented Gauss code is
Subscripts record overpassing and underpassing. In this convention a positive trefoil knot has knot signature .
Label the seven Wirtinger generators successively between undercrossings, beginning just before the encounter . The Alexander matrix, with rows ordered by crossing number, is
At a positive crossing the Fox derivative entries at the overpassing, incoming and outgoing arcs are ; at a negative crossing a unit multiple of the row has entries . Deleting the last row and column gives determinant . Hence a symmetric normalization of the Alexander polynomial of a knot is
In particular, in this displayed normalization; multiplying by gives normalization and does not change any conclusion.
The Seifert algorithm produces four Seifert circles and seven bands. Its connected Seifert surface has Euler characteristic , and so genus . Conversely, the Alexander breadth bound on Seifert genus gives . Therefore
For the knot signature, use the alternating diagram signature formula: for a reduced alternating knot diagram,
where counts circles in the all- bracket smoothing and counts positive crossings. Here the all- smoothing has four circles, the all- smoothing has five, and . Thus
The opposite global knot signature convention gives instead.
For the slice genus, the Levine-Tristram signature bound on the slice genus at gives . There is also an explicit unknotting crossing: switch crossing . A type III Reidemeister move across the triangle formed by crossings makes crossing a removable kink. Next cancel pairs and by type II Reidemeister moves; crossings and then become removable kinks. This leaves the unknot. One crossing change gives a genus-one knot cobordism to the unknot: its movie consists of two oriented band moves, and capping the final unknot by a disk in gives a surface of genus one. Consequently
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.
Unknotting crossing 2026-10-07
An unknotting crossing is a crossing whose crossing change converts a knot into the unknot. It gives a genus-one knot cobordism to the unknot, and hence slice genus at most one after capping with a disk in .