Crossing change Created 2026-10-07 Updated 2026-10-14
A crossing change exchanges the overpassing and underpassing strands at one crossing of a knot diagram. It generally changes the knot; unlike a Reidemeister move, it is not an isotopy. Two oriented band moves realize a crossing change as a genus-one knot cobordism.
Kauffman bracket 2026-09-28
The Kauffman bracket is the unoriented diagram invariant determined by resolving each crossing into its two smoothings and replacing every additional disjoint circle by the loop factor . It is invariant under the second and third Reidemeister moves.
Knot diagram Created 2026-09-28 Updated 2026-10-14
A knot diagram is a generic projection of a knot to a Euclidean plane together with overcrossing and undercrossing information at every double point. Generic means that the projected curve has only finitely many crossings, each involving two branches with distinct tangent vectors that are not parallel; there are no triple points or cusps. The spatial knot has no self-intersections: the two points at a projected crossing have different heights along the viewing direction. A gap in the lower strand records which one passes underneath.
Forgetting the over/under information leaves a knot shadow. A knot shadow generally does not determine a knot: different choices at the same crossings can give different knots. Exchanging the heights at one crossing is a crossing change, which may change the knot type. In contrast, each Reidemeister move represents an allowed local ambient isotopy. Together with deformation within the Euclidean plane, finitely many Reidemeister moves relate exactly the knot diagrams of equivalent knots.
For a concrete computed example, project the torus knot above onto the Euclidean plane with coordinates , retaining as height. Since , equal projected points require their longitudinal angles to agree, so distinct parameter values differ by or . Equating the radii then gives exactly four unordered pairs, with all parameters in units of :
At each pair, the two heights are opposite and have absolute value ; the projected tangent vectors are not parallel. Thus these are verified crossings of a knot diagram, and the positive-height branch passes over the negative-height branch when viewed from positive .
Figure 1.
One trefoil projection: a shadow and its four crossings with verified over/under gaps
. Details.
If denotes the number of crossings in a knot diagram of , then is the crossing number of a knot. The illustrated trefoil knot has but ; the unknot can have arbitrarily large while . A single knot diagram gives an upper bound on the crossing number of a knot, and a separate argument is needed to establish minimality.
Knot theory Created 2026-09-24 Updated 2026-10-18
Knot theory studies closed curves in three-dimensional Euclidean space that cannot intersect themselves, and asks which can be deformed into one another without cutting or passing one strand through another. Its basic object is a knot: a smooth embedding of a circle, considered up to ambient isotopy. Several disjoint knots form a link. More generally, knot theory studies such embeddings in other manifolds and in higher dimensions.
The central surprise is that a flexible circle can carry permanent information about how it sits in space. A trefoil knot and an unknot each consist of just one circle, but no ambient isotopy turns one into the other. A knot diagram translates this spatial question into a finite drawing; Reidemeister moves describe the changes of drawing that preserve the knot. Knot invariants translate it into computations: unequal Alexander polynomials of a knot, Jones polynomials, or knot groups certify different knots. Equal values of a particular knot invariant generally leave the question open; even an isomorphism of knot groups alone is not a complete classification.
An early foundation for working with knot diagrams is Kurt Reidemeister's 1927 paper Elementare Begründung der Knotentheorie, published in volume 5 of Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, pages 24–32.[ref] Marc Lackenby's authored notes Elementary knot theory, Section 2.4, explain the Reidemeister move theorem and its role in searching for a certificate that two knot diagrams represent the same knot.[ref]
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.
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 .
The tangle category has objects finite words in the two orientations , including the empty word. A morphism is an oriented compact one-dimensional manifold, embedded in a three-dimensional slab, whose boundary is the prescribed ordered set of top and bottom endpoints. Closed components are allowed. Two such embeddings represent the same morphism when they are ambient-isotopic relative to the boundary.
Read diagrams from top to bottom here, matching the maps drawn in part (d). Composition stacks diagrams with exactly matching intermediate boundary words; horizontal juxtaposition is the tensor product. The empty word is its unit, and straight oriented strands are identities. Crossings, the two oriented evaluations and the two oriented coevaluations generate all morphisms: place an embedding in generic position and slice between its crossings and local extrema. The Reidemeister moves and the cup/cap isotopies describe changes of diagrams without changing the underlying tangle. This is the ordinary unframed version; a framed tangle category instead retains framing data and has a modified first-move rule.
In this reading convention an arch is a coevaluation morphism , and a valley is an evaluation morphism . An overleft arrow reverses these strand orientations. We use for the crossing whose upper-left-to-lower-right strand passes over the other, and for its inverse; this geometric specification avoids ambiguity in sign conventions.
Let be the supplied coevaluation morphism, , and let be the supplied evaluation morphism with diagonal coefficients . The tangle obtained by inserting the given crossing between the created strand and a through strand, then evaluating, is a removable curl. The first Reidemeister move gives the identity
We calculate this map on both basis vectors. The crossing matrix gives
For input , applying , then , then gives
For input , the off-diagonal evaluation vanishes and the result is . Therefore the removable-curl identity requires
Solve the first equation to obtain ; substitution in the second gives . Hence
Finally the closed identity strand is represented by . Its value is , so the quantum dimension is
It is a weighted categorical contraction, rather than the ordinary vector space dimension . Using a framed category without imposing the removable-curl identity would require additional twist data; the ordinary tangle category and the specified crossing normalization determine these coefficients.
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.