Covering space
Named by 18 essays across one field — each of them below, with the objects they name alongside it.
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.
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.
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.
Two sheets over a one-sided surface
Above every one-sided surface sits a two-sided one, exactly twice as large, and the map between them forgets which of the two senses of turning a point was carrying. Building it turns a question about sides into a question about covers.
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.
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.
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.
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.
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.
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.
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.
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.
Two copies of the polygon, cross-matched
The two-sided surface that lies over a one-sided one can be built from the gluing word alone: take two copies of the polygon, one read each way round, glue a letter within the copies when it is used once each way, and across them when it is used twice the same way. The recipe works for every surface at once, doubles every count, and shows that a sphere with k cross-caps is covered by the surface with k − 1 handles — and that among all its connected double covers, exactly one is two-sided.
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.
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.
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.
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.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
Fundamental groupSubgroupFree groupEuler characteristicMonodromyPermutationGenusHomotopyIndexWinding numberDeck transformationGraph