Monodromy
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
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.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
Covering spaceEuler characteristicFundamental groupGenusSubgroupFree groupGroup actionIndexLiftingPermutation