Series

Knots — the series

10 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. the trefoil. the trefoil, drawn as a closed curve with 3 crossings. At each crossing the strand passing underneath is broken, which is the only information the flat picture carries that the curve alone does not.

    Three moves, and what they cannot undo

    A knot is a closed loop of string, and two knots are the same if one can be wiggled into the other. Reidemeister reduced all possible wiggling to three local pictures — which is what makes it possible to prove that a knot is knotted.

    part 1 · topology
  2. How many colourings each knot allows. Three knots, and the number of ways their arcs can be coloured with three, five and seven colours under the crossing rule, beside the determinant computed separately from the same crossings.

    Colours that count more than three

    Three colours prove the trefoil is knotted and say nothing at all about the figure-eight, which refuses them exactly as an unknotted loop does. The repair is to stop colouring and start counting — with five colours, or seven, and with the arithmetic done modulo the number of them.

    part 2 · topology
  3. The Alexander matrix of the trefoil. The trefoil with its 3 arcs numbered and its 3 crossings lettered, beside the 3 by 3 matrix they give. A minor of the matrix is the Alexander polynomial t − 1 + t⁻¹, whose value at −1 is the determinant 3.

    A polynomial behind the colourings

    The figure-eight knot and the cinquefoil both have determinant five, so they admit exactly the same colourings, and every counting argument treats them as one. Put a variable where the colouring rule has a two and the determinant becomes a polynomial — and the two knots come apart.

    part 3 · topology
  4. The Seifert circles of the trefoil. The trefoil with an orientation, cut at each of its 3 crossings and reconnected the way the orientation allows. The 6 segments form 2 circles, and the surface built from them has genus 1.

    The surface a knot bounds

    Every knot is the edge of a surface with two sides, and Seifert found a way to build one from any diagram: smooth the crossings, fill the circles that result with discs, and join them with twisted bands. Counting the handles gives an upper bound on how complicated the knot is, the Alexander polynomial gives a lower one, and for the simplest knots the two meet.

    part 4 · topology
  5. The trefoil and its mirror image. The trefoil beside its reflection, with writhe 3 and −3. The Jones polynomials are t + t³ − t⁴ and −t⁻⁴ + t⁻³ + t⁻¹; the Alexander polynomial of both is t − 1 + t⁻¹.

    A polynomial that tells left from right

    The trefoil and its mirror image have the same colourings, the same determinant and the same Alexander polynomial, and the first proof that they differ was a hard argument about groups. Smooth every crossing both ways, count the circles in each of the resulting pictures, and add up the counts with the right weights: the total changes when the knot is reflected.

    part 5 · topology
  6. The two extreme states of the figure-eight knot. The figure-eight knot, then the state with every crossing smoothed the A way (3 circles) and the state with every crossing smoothed the B way (3 circles). The bracket spans 16 powers of A against 16 for four times the crossings.

    The crossings an alternating knot cannot lose

    Peter Guthrie Tait drew knots for years and believed, without proof, that a diagram whose crossings alternate over and under, and which has no twist that can be undone, is already drawn with the fewest crossings the knot allows. The proof took a century, and when it came it needed only the two most extreme ways of smoothing the diagram and Euler's count of the regions of a map.

    part 6 · topology
  7. Signature against unknotting, for every knot to seven crossings. A table of the fourteen prime knots with up to seven crossings, listing determinant, signature, the lower bound on crossing changes it gives, the number of changes found by search, and whether the two agree.

    How many changes undo a knot

    Cut the string at a crossing, pass it through the other strand and join it up again, and any knot can be undone by doing that often enough. The fewest changes needed is the unknotting number, and proving that fewer will not do needs a number that each change can move only a little. The signature moves by at most two per change — enough to settle thirteen of the fourteen knots up to seven crossings, and not the fourteenth.

    part 7 · topology
  8. A trefoil knot made of six straight sticks. Hexagon with corners (6, 2, 3), (7, 7, 10), (1, 6, 4), (2, 1, 7), (8, 10, 5), (0, 9, 9); three crossings from above, determinant 3, Alexander polynomial t² − t + 1.

    Six sticks tie a trefoil, and five cannot

    Build a knot from straight sticks joined end to end and ask for the fewest. A trefoil takes six, and the six corners can be whole-number points in a box ten units wide. Five sticks can cross one another five times in a picture, as often as a cinquefoil needs, and still tie nothing — the five crossings always twist three one way and two the other. The fewest sticks is a measure of how knotted a knot is that no diagram shows directly.

    part 8 · topology
  9. How often a closed random polygon is certainly knotted, by length. 10: 0.8% (mean crossings 2.8); 20: 1.5% (mean crossings 7.9); 40: 6.3% (mean crossings 21.2); 60: 10.5% (mean crossings 35.1); 80: 20.8% (mean crossings 51.3); 100: 22.0% (mean crossings 66.9); 130: 32.3% (mean crossings 94.9); 160: 45.7% (mean crossings 122.6); 200: 47.0% (mean crossings 154.5); 250: 51.7% (mean crossings 205.5).

    Almost every long loop is knotted

    Close a random walk into a loop and ask whether it is knotted. With ten steps almost never; with a hundred, more than one time in five it can be proved knotted by a single number; with two hundred and fifty, more than half. The chance of staying unknotted falls exponentially with length — Frisch, Wasserman and Delbrück guessed it for polymer rings around 1961, and it was proved in 1988 — because a knot needs only one small tangle somewhere, and a long loop has room for many.

    part 9 · topology
  10. A trefoil, and how far its tangent turns. The (2, 3) torus knot with tube radius 0.45; total curvature 16.8556 = 5.3653π.

    A knot must turn twice, and a little more

    Follow a closed curve and add up how far its direction turns. Any closed curve turns through at least one full circle; a knotted one turns through more than two. The proof is a count of hilltops — the total turning equals 2π times the number of highest points the curve has, averaged over every direction to look from — and a curve with a single hilltop in any direction cannot be knotted.

    part 10 · topology

All series