Matpic
mathematics, in pictures
Ladder

Covering spaces — the ladder

5 distinct arguments against one idea, from the one that introduces it to the one that assumes the rest.
  1. The line spiralling over the circle. A circle with a helix drawn above it: the helix is the real line, and the map that sends each of its points straight down onto the circle covers the circle once per turn. Above one marked point sits a column of points, one per turn.

    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.

    rung 1 · topology
  2. A wedge of 2 circles. Several circles all passing through one common point, each labelled with a generator, so that a loop is a word in those letters.

    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.

    rung 2 · topology
  3. 3 symmetries over 3 sheets: a regular covering. A 3-sheeted covering of a wedge of 2 circles, with the permutations of its sheets that commute with every generator. There are 3, against 3 sheets.

    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.

    rung 3 · topology
  4. 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.

    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.

    rung 4 · topology
  5. 6 vertices folded to 4, and a graph that decides. The graph built from 3 generator words, folded until no vertex has two edges of one label leaving it. Reading a word from the base vertex decides membership, and 6 words are tested.

    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.

    rung 5 · topology

All ladders