advanced25 min studyLesson 476 in Mathematics

Classification of connected coverings

Translate pointed covers into subgroups, unpointed covers into conjugacy classes, and sheet counts into subgroup indices.

On this page

What you’ll understand

  • State the pointed and unpointed classifications with the classical base-space hypotheses.
  • Compute covering degree and regularity from a subgroup.
  • Use monodromy to distinguish connectedness from deck-group transitivity.

Covering spaces can be organized without drawing every sheet. A chosen point above a basepoint identifies exactly which loops lift closed, producing a subgroup of the fundamental group. Moving that chosen point changes the subgroup by conjugation, which is why the classification changes when basepoints are forgotten. This correspondence links geometry, subgroup inclusions, permutation actions, and deck symmetries, but those four descriptions must retain their respective choices and hypotheses.

Pointed covers remember an actual subgroup

Let X be path connected, locally path connected, and semilocally simply connected, with chosen x0x_0. Pointed isomorphism classes of path-connected covers (E,e0)→(X,x0)(E,e_0)\to(X,x_0) correspond bijectively to subgroups H≤G=π1(X,x0)H\le G=\pi_1(X,x_0), assigning H=p∗π1(E,e0)H=p_*\pi_1(E,e_0). Isomorphisms must commute with projection and preserve the chosen point. The existence direction uses the universal cover and a quotient by the subgroup action. The uniqueness direction applies the based lifting criterion in both directions and then uses unique lifts to show the resulting maps are inverse.

If the point above x0x_0 is not retained, the classification is by conjugacy classes of subgroups rather than individual subgroups. Paths in the total space between two fiber points project to loops that conjugate the corresponding subgroup. An abstract isomorphism between two subgroups is not enough: their positions inside G matter. Covering isomorphism is also more restrictive than a homeomorphism of total spaces, because the projection must be preserved. Two homeomorphic graphs can cover a wedge of circles in inequivalent ways.

(E,e0)⟷H=p∗π1(E,e0)≤G,unpointed covers⟷conjugacy classes [H](E,e_0)\longleftrightarrow H=p_*\pi_1(E,e_0)\le G,\qquad \text{unpointed covers}\longleftrightarrow\text{conjugacy classes }[H]
The classical correspondence assumes a path-connected, locally path-connected, semilocally simply connected base.↔ Scroll wide equations horizontally.

Indices, normality, and maps between covers

The fiber has cardinality [G:H][G:H], possibly infinite. A connected cover is regular when its deck group acts transitively on the fiber, which is equivalent to H being normal. Its deck group is then G/H; for a nonnormal H the correct formula is NG(H)/HN_G(H)/H. A subgroup can have finite index while its normalizer quotient is much smaller than that index. Finite-sheeted connectedness therefore does not imply a large symmetry group or a regular covering. The trivial subgroup yields the universal cover, while H equal to G yields the identity cover.

A based map between the covers associated to H and K, commuting with the maps to X, exists precisely when H⊆KH\subseteq K. The direction is from the cover with the smaller subgroup to the one with the larger subgroup. This agrees with the universal cover mapping to every other connected cover. If H is contained in K, the number of sheets of that intermediate cover is [K:H][K:H]. When basepoints are omitted the inclusion condition must be adjusted by a conjugation; choosing a convenient representative cannot be suppressed when comparing concrete subgroups.

deg⁡(E→X)=[G:H],Deck⁡(E/X)≅NG(H)/H,H⊴G⇒Deck⁡(E/X)≅G/H\deg(E\to X)=[G:H],\qquad\operatorname{Deck}(E/X)\cong N_G(H)/H,\qquad H\trianglelefteq G\Rightarrow\operatorname{Deck}(E/X)\cong G/H
Subgroup index counts sheets, whereas the normalizer quotient counts deck symmetries.↔ Scroll wide equations horizontally.

Monodromy gives a permutation model

Lifting loops permutes the fiber. With our convention of traversing the first loop before the second, this can be written as a right action, avoiding an unnoticed reversal of function composition. The stabilizer of the selected fiber point is H, and connected covers correspond to transitive actions. More generally, orbits identify path components of a covering over this regular base. A deck transformation commutes with the monodromy action. In a transitive action it is determined by the image of one fiber point, but not every candidate image is compatible with every stabilizer.

For circle covers, G is the abelian group of integers, so every subgroup is normal and every connected cover is regular. This special case should not be generalized to a wedge of circles, whose free fundamental group has many nonnormal subgroups. For a finite graph cover, labeling the permutations of the fibers around the graph's generators gives a concrete construction and a practical connectedness test. The abstract subgroup and the permutation description encode the same lifting information, while the geometry still requires local sheets to be attached compatibly along the graph edges.

A six-sheeted torus cover

In G=Z2=π1(T2)G=\mathbb Z^2=\pi_1(T^2), let H be generated by (2,0)(2,0) and (1,3)(1,3). Find its index, regularity, and deck group.

  1. The generator matrix has columns (2,0)(2,0) and (1,3)(1,3), with determinant six. Its lattice index in Z2\mathbb Z^2 is six, so the corresponding connected cover has six sheets.

  2. Every subgroup of an abelian group is normal. Hence this cover is regular and its deck group is the quotient Z2/H\mathbb Z^2/H.

  3. In the quotient, 2e1=02e_1=0 and e1+3e2=0e_1+3e_2=0. Thus e1=−3e2e_1=-3e_2 and 6e2=06e_2=0. The class of e2e_2 has order exactly six: if (0,k)=a(2,0)+b(1,3)(0,k)=a(2,0)+b(1,3), then k=3bk=3b and 2a+b=02a+b=0, forcing six to divide k.

The result

The cover has six sheets and cyclic deck group Z/6Z; the chosen lattice relations identify a concrete generator.

Explore the model

Interactive lab

Interactive lab · modular

The quotient generator and its subgroup

Pause and Reset; set modulus to 6 and additive step to 1. Predict all six residue classes appear. Reset, set modulus to 6 and step to 3, and predict a two-point orbit. Compare the full quotient generator in the worked example with an element that generates only its order-two subgroup.

The quotient generator and its subgroupAddition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Current readings: Residue r0: 0; Orbit period · m/gcd(m,a): 12; Distinct residues visited: 1 of 12. All parameters are adjustable with the labeled controls below.Repeated addition modulo 12: the current residue is 0, and the orbit period is 12.01234567891011+ 5mod 12An additive orbitn = 0rₙ = 0Period = 12Cycle starts at 0:0 → 5 → 10 → 3 →8 → 1 → 6 → 11 →4 → 9 → 2 → 7 → 0Exact residues · two additions per second
Additive orbitCurrent residue / next edge
Residue r0
0
Orbit period · m/gcd(m,a)
12
Distinct residues visited
1 of 12
t = 0 s

Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forThe cyclic action matches the worked cover's finite quotient group. Other connected covers can have nonabelian monodromy or fewer deck symmetries; this instrument does not classify them automatically.

Check your understanding

After forgetting the selected point above a basepoint, which subgroup data classify connected covers under the stated hypotheses?

Try it yourself

For a wedge of two circles, let the two generator monodromies on three labels be (123)(123) and (12)(12). Is the corresponding cover connected? How many deck transformations does it have?

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Connectedness is transitivity. Deck permutations must commute with both generators; first find the permutations commuting with the three-cycle.

Compare with the solution

The three-cycle already acts transitively, so the cover is connected with three sheets. The centralizer of (123)(123) in S3S_3 is its cyclic subgroup {1,(123),(132)}\{1,(123),(132)\}. Neither nonidentity three-cycle commutes with (12)(12), so the common centralizer is trivial. The deck group therefore has only the identity, and the associated index-three subgroup is not normal.

Take it with you

  • Pointed covers correspond to subgroups; unpointed covers correspond to conjugacy classes.
  • The sheet count is an index, while the deck group is a normalizer quotient.
  • Transitive monodromy gives connectedness without guaranteeing regularity.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.