Jones polynomial of a connected sum 2026-10-14
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.
Jones polynomial of a mirror 2026-10-14
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.
Jones polynomial of a split union 2026-10-14
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.
Jones polynomial skein relation 2026-10-14
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.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 19 1 a Solution Created 2026-10-03 Updated 2026-10-14
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
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 19 1 c Solution Created 2026-10-03 Updated 2026-10-14
False as written for arbitrary links. The two-component unlink has a diagram with no crossings butThe 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.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 19 1 Solution 2026-10-14
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 givewhere 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 , andFor type III, and the analogous reversed relation giveHence 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 thereforeThe 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 . ConsequentlySubstituting givesThe other smoothing has cancelled, so the identity applies with exactly the oriented local convention in the PDF.
Past exam of the mathematics course of the University of Cambridge 2002 iii Paper 19 3 Solution Created 2026-10-03 Updated 2026-10-14
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 isThe 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 satisfyIndeed 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, containsThe 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. Consequentlywhere 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 givesThus the Wirtinger presentation relations are , with indices modulo ten. Their Fox derivatives after abelianization give row relationsDelete 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 asThe two remaining rows, at undercrossings two and seven, are the matrixIts determinant is , differing from the original cofactor only by a Laurent unit. ConsequentlyThe 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 isNumber these visits . The oriented smoothing permutation of a Gauss code has cyclesThere 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 givesAs 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.
Past exam of the mathematics course of the University of Cambridge 2012 iii Paper 16 8 Solution Created 2026-10-03 Updated 2026-10-07
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 iswhere 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 toConsequentlywhich 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 isThus 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 bracketis 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, givingThus 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.
Past exam of the mathematics course of the University of Cambridge 2022 iii Paper 112 2 a Solution 2026-09-28
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
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 .
Writhe 2026-10-14
For an oriented closed curve, geometric writhe is the signed crossing number averaged over generic viewing directions. For an individual link diagram, writhe of a link diagram is its signed crossing sum. Both depend on geometry or projection rather than only the link isotopy class.
