Subgroup
Named by 6 essays across 2 fields — each of them below, with the objects they name alongside it.
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.
The lattice that runs the other way
The symmetries of a polynomial's roots form a group, and the fields between the bottom and the top form a lattice. The two are the same picture, one of them turned over — a bigger group of symmetries fixes less, so it names a smaller field.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
Covering spaceIndexFree groupFundamental groupGraphLiftingRankSpanning treeAutomorphismDecision procedureDeck transformationDegree