Adequate link diagram 2026-10-14
Bracket smoothing state 2026-10-07
A bracket smoothing state chooses one of the two unoriented smoothings at every crossing of a link diagram. Its weight is in the reduced Kauffman bracket, where count the smoothing types and counts resulting circles. The all- and all- states choose the same smoothing type at every crossing.
Close a three-strand planar tangle and evaluate its reduced Kauffman bracket. The basis has the displayed trace values, with the last value also valid for . Writing braid generators as turns knot-polynomial computations into a five-dimensional algebra calculation.
Jones polynomial Created 2026-09-28 Updated 2026-10-07
The Jones polynomial is obtained from the Kauffman bracket of an oriented diagram by the writhe normalization
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.
Reflecting a link diagram interchanges its two bracket smoothings and negates its writhe of a link diagram. This replaces by in the normalized Kauffman bracket, hence by . A knot whose Jones polynomial differs from its reciprocal cannot be an amphichiral knot.
Placing the two link diagrams in disjoint disks keeps all state circles separate. The reduced Kauffman bracket therefore acquires one extra loop factor . Correcting writhe of a link diagram and setting gives the displayed formula. It concerns a split link, not an arbitrary union of linked components.
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.
False. The zero polynomial is already a counterexample. The Jones polynomial evaluation at one of a nonempty link with components is
To prove this, specialize the Jones polynomial skein relation at : switching a crossing preserves the value. Switch crossings until the diagram is an unlink without changing its component count. The Kauffman bracket loop rule, equivalently the Jones polynomial of a split union, gives the displayed evaluation. Hence arbitrary Laurent polynomials cannot occur.
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 .
Use the standard closed three-strand braid , a four-crossing diagram of the figure-eight knot. The diagram has two positive and two negative crossings, so .
Figure 1.
Four-crossing closed braid for the figure-eight knot, with three starting meridians
. Details.
We calculate its Kauffman bracket, making the inversion symmetry explicit rather than merely asserting amphichirality.
In the Temperley-Lieb diagram algebra on three strands put , . The relations are , , , . The bracket image of one two-crossing block is
Closing planar diagrams gives the bracket trace on the three-strand Temperley-Lieb algebra:
These values follow because the closures have respectively three, two and one circles. Expanding and reducing gives
Taking its trace and substituting yields
There is no writhe correction, so
The equality is immediate from the five displayed coefficients. The same braid model supplies the meridians used in part (d).
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 Kauffman bracket skein relation to every crossing in the two-string tangle . Each complete smoothing is a collection of closed circles together with one of the two crossingless pairings of the four boundary points. Rotation through about the indicated vertical axis preserves both crossingless pairings and the number of closed circles. Gluing the unchanged tangle to corresponding smoothings therefore gives equal terms, including equal loop factors, so .
Choose an orientation of , and transport the induced orientations of the four ends of through the rotation to orient . Crossing signs inside the rotated tangle and outside it then have the same total, so the writhe of a link diagram satisfies . Applying the writhe normalization of the Jones polynomial gives
The relative skein module fixes finitely many framed endpoints on the boundary of a 3-manifold and uses properly embedded framed tangles with those endpoints. Local Kauffman bracket relations are imposed away from the boundary. Gluing compatible endpoint sets composes tangles; a rectangle cylinder with n endpoints on each horizontal side gives the Temperley-Lieb diagram algebra.
Unreduced Jones polynomial Created 2026-10-07 Updated 2026-10-14
Use the Kauffman bracket assigning the empty diagram value and a disjoint circle factor . Correct by the writhe of a link diagram and substitute . Relative to the Jones polynomial normalized to be on the unknot, this unreduced invariant has an additional factor . For a nonempty -component link, its value at is .