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.
Crossing number of a knot Created 2026-09-28 Updated 2026-10-14
Dehn presentation Heegaard diagram Created 2026-10-05 Updated 2026-10-06
Thicken the planar graph underlying a knot diagram. Its boundary supports a Heegaard diagram with face disks on one side and crossing-tunnel disks on the other. The face generators and crossing curves give a Dehn presentation of a knot group.
Dehn presentation of a knot group Created 2026-09-28 Updated 2026-10-14
Give every region of a knot diagram a generator and set the generator of the unbounded region to the identity. At a crossing, reading the four incident regions cyclically gives a relation , with the cyclic order reversed if the opposite convention is chosen. These relations form the Dehn presentation of the knot group.
Gauss code 2026-10-07
A Gauss code records the successive crossings encountered when traversing an oriented knot diagram. Each crossing label occurs twice; overpassing/underpassing data and crossing signs make the code sufficient to recover its Wirtinger presentation and smoothing counts. Labels are arbitrary and cyclic starting points represent the same traversal.
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 .
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 shadow 2026-10-14
A knot shadow is the curve in the Euclidean plane underlying a knot diagram after its overcrossing and undercrossing information has been erased. At a crossing the two local branches still continue across one another; the drawing does not specify which lies higher in space.
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]
Number the visits along an oriented knot diagram, and let exchange the two visits to each crossing. At an oriented smoothing, an incoming strand follows the outgoing strand of the other visit. Thus the cycles of the displayed permutation are exactly the Seifert circles. Their count gives the Seifert algorithm genus without requiring a separate drawing of the smoothed diagram.
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 2005 iii Paper 19 1 Solution Created 2026-10-03 Updated 2026-10-14
We use . To obtain a Wirtinger presentation, choose an oriented regular knot diagram, cut its strands at undercrossings, and give each resulting arc a positively oriented meridian of a knot. The complement of the arcs above the projection plane has a free fundamental group on these meridians. At a crossing, pushing an understrand meridian past the overstrand conjugates it by the overstrand meridian. Thus, if is the overstrand generator and are the incoming and outgoing understrand generators, the relation is , where is determined by the crossing orientation. Applying the Seifert-van Kampen theorem while adjoining the crossing neighborhoods gives one such relation per crossing. The remaining three-dimensional region adds no fundamental-group relation. For a connected diagram one crossing relation is redundant. This derives a group presentation from any tame knot diagram, rather than just specifying a recipe without its topological justification.
For the Borromean rings, choose three meridians and call the other three arc meridians . Base paths and orientations can be chosen so the six crossing relations readEliminate the primed generators with the first row. The second row says respectively that commutes with , that commutes with , and that commutes with . The last relation is redundant, just as one crossing relation is redundant in the Wirtinger presentation. Alternatively the Hall-Witt identity, after conjugating its three factors, shows that any two of these cyclic relations imply the third. Hence the Borromean link group isBoth relators have zero exponent sum in each generator. Passing from the free group to its abelianization therefore imposes no relations beyond commutation, andEquivalently the three linking-number maps to independently detect the three meridians.
Here is an explicit representation, followed by a faithfulness argument:Each determinant is one. Direct multiplication verifies the two relators. For example , which commutes with . Merely checking those relators would not prove faithfulness, so we identify the image's complete group presentation.
Write , the Gaussian Bianchi group, and use its four generators from the allowed presentation. In the three proposed generators areThe last equality is in , so an overall minus sign in matrix multiplication is immaterial. Reduce matrices modulo in , and then quotient by . The finite image has order : the residue field is , has order six, and each of the three subsequent local-ring layers has a kernel of order , before the final quotient by . Elementary elimination over this local ring shows that the images of generate it. The subgroup has order , as multiplication in this finite ring verifies. Let be its inverse image in ; then .
For completeness the following gives the coset computation needed to check the subgroup presentation explicitly. Cosets are right cosets ; columns record right multiplication by . Representatives are words in the allowed generators.Apply the Reidemeister–Schreier theorem: for a transition , use generator , omitting the 23 tree transitions. Rewrite each of the eight allowed ambient relators starting at each of the 24 rows. There are 73 remaining Schreier generators. Adjoin the names , , and eliminate the Schreier generators using relations in which they occur once. The remaining relations, with an uppercase letter denoting the inverse of the corresponding lowercase one, are the wordsThis table and the rewriting rule determine every relation without an appeal to a guessed presentation. In this notation cyclically reduced versions of the two desired relators are and . Elementary substitutions of relator segments, with cyclic reduction at each step, giveusing ; conversely using . These substitutions show equality of the two normal closures. For example the first substitution replaces in the cyclic rotation of by , as allowed by , and then the initial is replaced by using . Thus has exactly the presentation of , with represented by . In particular these three matrices generate , and
To identify the actual link complement as a hyperbolic three-manifold, rather than only on a manifold with an isomorphic group, cut along the projection-plane regions, making the usual small crossing detours above and below. The octahedral projection graph has eight triangular regions. The upper and lower pieces are ideal octahedra; corresponding faces are matched with one-third-turn corner permutations, with opposite directions on adjacent checkerboard faces. Reversing these cuts reconstructs the link complement. Give both pieces the regular ideal hyperbolic space octahedron metric. All triangular face maps are isometries and each edge cycle has four dihedral angles , so the metric has no edge singularity. Equal horospherical truncations match in Euclidean squares and assemble into three flat tori, giving complete torus cusps. The compact truncated remainder and these cusps show completeness and finite volume. Thus the Borromean complement is a complete finite-volume hyperbolic three-manifold. This also supplies a geometric discrete faithful holonomy, independently of the subgroup calculation.
Past exam of the mathematics course of the University of Cambridge 2022 iii Paper 112 4 Solution 2026-09-28
A Wirtinger presentation from a connected knot diagram has one generator per arc and one relator per crossing, with one relator redundant. Its presentation complex is a finite two-dimensional CW complex with one zero-cell, one-cells, and two-cells, and the usual diagrammatic construction gives a homotopy equivalence .
The abelianization of the knot group is , generated by a meridian of a knot. Every homomorphism to the cyclic group factors through this abelianization, and reduction modulo two is its unique surjection. Thus the requested map is unique.
Its kernel determines a two-sheeted covering space . The nontrivial deck transformation acts on cellular chains and homology, giving them module structures over the group ringLift one copy of every cell of ; its two deck translates form a free -basis. Hence , , and . If is the infinite cyclic cover, its cellular chains are free over , and imposing gives
For an odd prime , the two idempotents and split the group algebraThe plus summand is the cellular chain complex of with coefficients, while the minus summand is . Therefore
On the minus summand, the boundary becomes multiplication by , which is invertible in , so . After the corresponding cancellation, the remaining square boundary matrix is an Alexander matrix specialized at . It is singular over exactly whenor equivalently when divides the knot determinant . Thus is nonzero exactly in that case.
Finally, is a nonzero odd integer, so the minus complex is acyclic over . Since a knot exterior has the rational homology of a circle,
Seifert algorithm 2026-10-07
Apply the oriented smoothing to every crossing of an oriented knot diagram, fill the resulting Seifert circles by disjoint disks at suitable heights, and reconnect them by twisted bands at the original crossings. The boundary is the original knot. If the connected surface has disks and bands, its Euler characteristic is and its genus is .
Trefoil knot Created 2026-09-28 Updated 2026-10-14
The trefoil is the torus knot . It is the simplest nontrivial knot by crossing number of a knot: . A standard three-crossing alternating knot diagram is reduced, so the Tait crossing-number theorem establishes minimality. The four-crossing knot diagram shown below also represents the trefoil knot, illustrating that a particular projection need not achieve that minimum. Its Seifert genus is one.
Here is a small algebraic certificate that a trefoil knot cannot be deformed into an unknot. One Seifert matrix for a trefoil knot isTaking the determinant gives the Alexander polynomial of a knotwhere allows multiplication by a Laurent unit in the Laurent polynomial ring. No such multiplication turns this three-term Alexander polynomial of a knot into the unknot's value . Since the Alexander polynomial of a knot is a knot invariant, this computation rules out every possible ambient isotopy between the two knots; it does not merely rule out the deformations we happened to try.
The knot group supplies another certificate. The presentation maps onto the symmetric group by and , since both sides of the relation map to the identity. These images generate a non-abelian group, so the knot group cannot be the unknot's infinite cyclic group. However, a trefoil knot and its mirror of a link have isomorphic knot groups: the abstract knot group alone does not distinguish all knots.
Unknot Created 2026-09-24 Updated 2026-10-14
The unknot is the knot type represented by the planar circleEquivalently, an unknot is a knot that bounds a smoothly embedded disk in the three-sphere. The disk must itself be embedded; merely filling a loop with a map that is allowed to intersect itself does not establish that the knot is an unknot. Flattening a neighborhood of an embedded spanning disk explains why this criterion recovers the planar circle.
A complicated drawing can still represent an unknot. Starting with a crossing-free knot diagram of , insert a small kink by a type I Reidemeister move. The resulting knot diagram has one crossing, but removing the kink exhibits the same unknot. Repeating in separate small regions gives knot diagrams of the unknot with arbitrarily many crossings, although the crossing number of a knot is . A drawing's apparent complexity is therefore not a certificate of knotting.
The normalized Alexander polynomial of a knot and Jones polynomial of the unknot are both , and its knot group is the infinite cyclic group , because the knot exterior is a solid torus. These are useful comparison values. In particular, a nonconstant Alexander polynomial of a knot certifies that a knot is not an unknot, but the converse fails: nontrivial untwisted Whitehead doubles also have Alexander polynomial of a knot .
