Generator

3 loops in one ring, and the number that separates them

A generator in the topology library, called 149 times across 30 essays. Below: what it draws with nothing chosen and at each mode an essay asks for, what it checks while drawing, and everywhere it is used.

loops is one function. Everything below came out of it during this build, at parameters taken from the essays rather than invented for this page — so a figure here is the same figure a reader meets in an essay, and if the generator changes, this page changes with it.

With nothing chosen

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.

Six lists of cycle shapes, and how many coverings each has

Six lists of cycle shapes, and how many coverings each has. A table of lists of cycle shapes over a sphere, each with the Euler characteristic the Riemann–Hurwitz count gives, the number of lists of permutations with that product, and the number of those that connect all the sheets.

The same count as a sum over the characters of S4

The same count as a sum over the characters of S4. A table of the irreducible characters of the symmetric group on 4 letters, each with its degree, its values at the classes the cycle shapes name, and its contribution to Frobenius's sum.

4 sheets branched over 3 points of a sphere: a surface of genus 0

4 sheets branched over 3 points of a sphere: a surface of genus 0. A 4-sheeted branched covering of the sphere with 3 branch points, drawn as 4 rows of sheets over a centre and the branch points, with the sheets joined where each point's permutation cycles them. Counting cells gives Euler characteristic 2, matching the Riemann–Hurwitz formula, and genus 0.

3 sheets, 8 of 26 words coming back

3 sheets, 8 of 26 words coming back. A table of reduced words in two generators with the sheet each sends the base sheet to. The words returning to it are the covering's subgroup, and the 3 sheets are its cosets.

The rank of every cover of a wedge of 2 circles

The rank of every cover of a wedge of 2 circles. A table of covers of a wedge of circles giving, for each number of sheets, the vertices and edges of the covering graph and the rank of its free group.

What it checks while it draws

Collected by running the family and recording what it asserted, not written here. The count is how many separate times the claim was put to the test while these drawings were made.

Where it is called

Every figure on this list is drawn by the same rule, so a change to the rule changes all of them at once. That is why the list is published.

Topology

A ball whose outside is not one

Alexander's sphere separates space into two pieces, exactly as the theorem promises. Its inside is an ordinary ball. Its outside is not, and the obstruction is a tree of clasped horns whose tips never stop.

Topology

A count that can say zero

The branched count ends on a list of cycle shapes that passes every test and describes no covering. There is an exact formula for how many coverings a list has — a sum over the character table of a symmetric group — and it returns nought without giving any reason why.

Topology

A covering is a permutation

Describing a covering means saying where each loop sends each sheet, which is a permutation for every generator. So a covering of a wedge of circles is nothing but a homomorphism to a symmetric group, and the subgroup it corresponds to is a stabiliser.

Topology

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δ.

Topology

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.

Topology

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.

Topology

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.

Topology

Counting the subgroups of a free group

The free group on two letters has one subgroup of index 1, three of index 2, thirteen of index 3, then 71, 461, 3,447 and nearly thirty-two million of index 10. Each is a covering of a figure-eight with a marked sheet, so counting them is counting pairs of permutations that join every sheet to every other. Marshall Hall did it in 1949 by sorting every pair by how far one sheet can travel, and the recursion that comes out says the count is almost exactly n times n factorial.

Topology

Covering a surface multiplies its count

A covering of a closed surface is a permutation of the sheets for each edge of the surface's one face — with one condition that a covering of a graph never had to meet. When the condition holds, the cells of the cover can be counted directly, and the count is the base's count times the number of sheets. That multiplication decides which surfaces can cover which, before any cover is built.

Topology

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.

Topology

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.

Topology

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.

Topology

Folding a graph until it decides

A subgroup of a free group usually arrives as a list of words, and almost nothing about it is readable from the list. Draw the words as loops, merge every pair of edges with the same label leaving one point, and what is left is a machine that decides membership by reading.

Topology

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.

Topology

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.

Topology

Linked, and no two of them are

Three rings that cannot be pulled apart, in which every pair comes apart the moment the third is removed. Every pairwise linking number is zero, so the number cannot see it — and what does see it is a word in two letters that refuses to cancel.

Topology

One line that halves them both

Two shapes lying anywhere on a page, of any sizes and any shapes at all. There is always a single straight line that cuts both of them into two equal halves at once — and finding it needs no cleverness, only the observation that a quantity which reverses sign has to pass through zero.

Topology

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.

Topology

The lists no covering can have

A covering of the sphere by itself with three branch points is three permutations of the sheets whose product is the identity. The Riemann–Hurwitz count says which lists of cycle shapes might work, and a search through every permutation says which do. Up to thirteen sheets, 150 lists pass the count and fail the search — and not one of them has a prime number of sheets.

Topology

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.

Topology

The same loop, unrolled

Spread a circle out into a line spiralling above it, and a loop that closes downstairs becomes a path that does not — so a question about which loops can be shrunk becomes a question about where a path ends, which is easy.

Topology

The subgroup that is freer than the group

A free group on two letters contains a subgroup of index three that is free on four. Nothing about a group makes that plausible; everything about a graph makes it obvious, and the argument is to stop looking at the group and start looking at the space whose loops it is.

Topology

The subgroups of a surface group

A covering of a surface with n sheets is a choice of permutations for its handles whose commutators multiply to the identity, and counting those choices is a question about the characters of the symmetric group. Only their dimensions are needed — the numbers of ways to fill a Young diagram — and they give the torus σ(n) subgroups of index n, the genus-two surface 15, 220, 5,275, 151,086, and every surface a count that soon becomes 2n times a power of n factorial.

Topology

The symmetries a cover has of its own

A covering space can be shuffled without disturbing anything below it, and how many ways there are is decided by the subgroup it corresponds to. When there are as many symmetries as sheets the covering is called regular, and that is the same statement as the subgroup being normal.

Topology

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.

Topology

Two loops and one number

Give each crossing between two closed curves a sign, add them up, halve — and the answer does not depend on how the curves were drawn, how they are pushed about, or which way the picture was projected.

Topology

What a branch point subtracts

Let the sheets of a covering meet at a few points and the count stops multiplying — but it fails by an amount that can be read off each point's permutation. Cut the sphere into a star, lift the cells, and the Riemann–Hurwitz formula falls out of a subtraction. The same count then turns out to be necessary and not sufficient.

Topology

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.

Topology

Where the fixed point escapes

The theorem asks for a set that is closed, bounded and free of holes. Drop any one of the three and a map appears that moves every single point — and in each case the point that should have stayed still can be seen leaving.

Topology

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.

The whole library · What the figures prove