Series

Homotopy — the series

14 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. 3 loops in one ring, and the number that separates them. Loops drawn in an annulus, each labelled with how many times it goes round the hole. Loops with different counts cannot be deformed into one another without leaving the ring.

    A loop that cannot be pulled tight

    A hole is a strange thing to point at, because it is precisely where the surface is not. What can be pointed at is a loop of string lying on the surface — and the hole announces itself by refusing to let that loop be pulled in to a point.

    part 1 · topology
  2. The same loop, seen from two places. An annulus with two marked points and a loop based at the first. Two paths join the points, differing by a full turn round the hole, and each carries the loop to a loop based at the second point.

    The group a space has at a point

    The loops of a space form a group once a starting point is fixed, and the fixing looks like an arbitrary choice that ought to be removable. It is removable, but only up to conjugation, and the residue is exactly what makes a non-commutative fundamental group harder to state than to compute.

    part 2 · topology
  3. 3 sheets, and the subgroup they name. A circle with its 3-sheeted cover drawn as a spiral above it, beside a table of the winding classes and whether each lifts to a closed loop. The ones that do are exactly the multiples of 3.

    Every cover is a subgroup

    A space can be unrolled, and the ways of unrolling it are not arbitrary. They correspond exactly to the subgroups of its fundamental group — index equals sheets, normality equals symmetry — so a question about a group becomes a question about a picture and back again.

    part 3 · topology
  4. Three spaces, cut into pieces. 3 panels, drawn from: a sphere split into two caps meeting along a circle, two circles joined at a point, and a square whose opposite edges are glued into a torus. Each carries the fundamental group that van Kampen's theorem computes for it.

    Cutting a space to find its group

    A space assembled from two pieces has a fundamental group assembled from theirs, and the recipe is exact — take everything both groups offer and impose the relations the overlap forces. Almost every fundamental group anybody knows is computed this way, including all of the surfaces.

    part 4 · topology
  5. Sliding one square past another. 4 stages of a slide in which two labelled squares inside a larger one exchange positions without ever overlapping. The larger square's boundary is the base point throughout, and the exchange is what makes the composition commutative.

    Why the second group commutes

    Replace loops by spheres and the same construction gives a second homotopy group. It is always commutative, and the reason is not a fact about spheres or about any space — it is a two-line argument about any set carrying two compatible operations.

    part 5 · topology
  6. Loops on a torus that never cross themselves. Squares with opposite edges glued, each carrying one straight loop of a different slope, each labelled with its two crossing counts.

    The loops on a torus that never cross themselves

    Every loop on a torus is classified by two whole numbers: how often it goes round one way and how often the other. Some classes can be drawn without the loop ever crossing itself and some cannot, and the rule is the oldest in arithmetic — the two numbers must have no common factor. The same two numbers say how often any two loops must meet.

    part 6 · topology
  7. A twist along the horizontal loop, done once. Squares with opposite edges glued and a shaded horizontal band, showing one loop before and after the torus is twisted along the band.

    A twist that carries one loop to another

    Cut a torus along a loop, turn one side of the cut once round, and glue it back. Nothing is torn, so every loop that did not cross itself still does not — but a loop of class (0, 1) is now a loop of class (1, 1). Two such twists reach every loop that never crosses itself, by Euclid's algorithm, and the symmetries they generate are exactly the whole-number matrices of determinant one.

    part 7 · topology
  8. A loop that cannot be undone, and the surface it bounds. The loop aba⁻¹b⁻¹ on the figure eight, which cannot be pulled tight, beside a square whose boundary reads the same word, showing that the loop bounds a surface.

    What homology forgets about a loop

    Let the letters of a loop commute and the loop group of a space becomes its first homology group: a loop now records only how often it went round each hole. What is thrown away is exactly the loops that bound a surface. On the figure eight that is nearly everything — of the loops of sixty letters that homology calls nought, about one in 6,700 is a loop that actually shrinks.

    part 8 · topology
  9. A random walk winding round a puncture. Lattice walk of 4000 steps around (½, ½); final winding -4.861 turns; box -12..26 × -29..22.

    How a random path winds round a point

    A path in the plane with one point removed has a class in the punctured plane's fundamental group: how many times it has wound round the point. For a random path the class grows like the logarithm of time, and its spread has a law. Brownian motion follows Spitzer's Cauchy law, so heavy-tailed that the mean winding does not exist; a walk on a grid follows the hyperbolic secant law instead, with tails that fall exponentially. The difference is made entirely by close passes, which a grid forbids. With two points removed the class becomes a word, and some loops wind round neither point and still cannot be shrunk.

    part 9 · topology
  10. How many times the tangent turns. circle: 1; figure-eight: 0; limaçon with a loop: 2; two inner loops: 3; three inner loops: 4; three-lobed star: -2.

    The turns a tangent makes

    Drive once round a closed track and count how many full turns the steering has made. A circle is one turn, a figure-eight is nought, and every loop adds one. Whitney and Graustein proved that this one number decides when one track can be bent into another without ever stopping — and it can be read off the crossings of a drawing without following the curve at all.

    part 10 · topology
  11. Every closed curve with three crossings. Six sphere curves with 3 crossings; plane counts 2, 3, 3, 3, 4, 5 (total 20); symmetries 12, 6, 4, 4, 2, 2.

    How many ways a curve can cross itself

    A closed curve that crosses itself three times can be drawn in exactly six essentially different ways on a sphere, and twenty in the plane. Four crossings give nineteen and eighty-two; six give 376 and 2,645. Every one of them is a word — the order in which the crossings are met — and a choice of direction at each crossing, and the whole census comes from asking which of those choices close up on a sphere.

    part 11 · topology
  12. A curve that crosses a line twelve times. n=6: upper 9,8,7,6,5,4,3,2,1,0,11,10; lower 3,2,1,0,7,6,5,4,11,10,9,8; meanders 1828 of 17424.

    Curves that cross a line and close

    Draw a closed curve that crosses a straight line 2n times and never crosses itself. Above the line it is a set of nested arches, below it another, and every such curve is a pair of the Catalan number's arch systems that happen to close into one loop. There are 1, 2, 8, 42, 262, 1,828 of them, and every count computed so far grows by a factor creeping towards 12.26 — a number nobody can prove, with an exponent conjectured from the physics of random surfaces.

    part 12 · topology
  13. One loop that outlasts the noise. 44 noisy points round a circle joined at scale 1.09, and the scales at which each loop appears and is filled: the longest from 0.588 to 1.588, the next 0.025 long.

    A hole that lasts across scales

    A cloud of points sampled from a circle has no hole at all, and joined at the right scale it has exactly one — but nobody knows the right scale in advance. Persistent homology joins the points at every scale at once and records how long each hole survives. The circle's hole lasts; accidental holes vanish almost at once; and moving every point by δ moves every survival time by at most 2δ.

    part 13 · topology
  14. A picture hung on 2 nails: a b a′ b′. word a b a′ b′ of length 4 on 2 nails; solves the puzzle: true.

    A picture that falls when any nail is pulled

    Hang a picture on two nails so that it stays up, but falls the moment either nail is pulled out. The string has to go round the nails in a pattern that is a commutator — once round each, then back round each in the same order — and the reason is that a loop in a plane with holes in it is a word in a group in which order matters. With more nails the commutators nest, and an exhaustive search finds the shortest strings for two, three and four nails: 4, 10 and 16 passes.

    part 14 · topology

All series