Past exam of the mathematics course of the University of Cambridge 2004 iii Paper 17 1 Solution Created 2026-10-03 Updated 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, 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 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.
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 isFor 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.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 24 3 b Solution Created 2026-10-03 Updated 2026-10-14
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 , andThus the second Reidemeister move preserves the bracket. Expanding three crossings givesso 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. DefineThe 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.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 24 3 c Solution Created 2026-10-03 Updated 2026-10-14
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 .
Four-crossing closed braid for the figure-eight knot, with three starting meridians
. Details. In the Temperley-Lieb diagram algebra on three strands put , . The relations are , , , . The bracket image of one two-crossing block isClosing 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 givesTaking its trace and substituting yieldsThere is no writhe correction, soThe equality is immediate from the five displayed coefficients. The same braid model supplies the meridians used in part (d).
Tait conjectures 2026-10-14
The Tait conjectures concern reduced alternating knot diagrams: they minimize the crossing number of a knot, have an invariant diagram writhe, and are related by flypes. These formerly conjectural assertions are now theorems; the first is the Tait crossing-number theorem.
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.
Writhe of a link diagram Created 2026-09-28 Updated 2026-10-14
The writhe is the sum of the signs of all crossings in an oriented link diagram. It changes under the first Reidemeister move and is unchanged under the second and third moves.
