Choose a path in from to . For every , the path lifting theorem gives a unique lift of starting at . Send to the endpoint of this lift. Lifting the reversed path gives the inverse map, so this is the fibre bijection by path liftingIn particular, all fibres have the same cardinality.
A connected covering is a normal covering map when its deck transformations act transitively on a fibre. Equivalently, for a choice of above ,The relevant lifting criterion for a covering space says that a based map lifts through exactly whenFor a universal covering, is simply connected, so the displayed covering subgroup is trivial and hence normal. Thus a universal covering map is normal.
Now consider connected finite covers of the closed orientable surface . By the classification of connected covering spaces, degree- connected covers correspond to index- subgroups of the fundamental group of a closed orientable surface, and normal covers correspond to normal subgroups.
The cases in which normality is forced are:
- , because the subgroup is the whole fundamental group.
- , because every index-two subgroup is normal.
- , because is abelian, so all its subgroups are normal.
- For , the sphere is simply connected, so a connected cover necessarily has .
It remains to show that these are the only forced cases. Let and . WriteIn the symmetric group , putDefine a homomorphism byand send all remaining generators to the identity. The relation is respected becauseThe cycle and transposition generate , so the homomorphism is surjective.
LetThe natural action of is transitive, so has index . Its image is the point stabilizer , which is not normal in for ; hence is not normal. The connected covering corresponding to is therefore an explicit degree- nonnormal cover. This is the nonnormal finite cover of a higher-genus orientable surface.
Consequently, among connected covers that exist, normality is forced exactly whenwith the qualification that permits only , as summarized by the forced normality of finite connected covers of orientable surfaces.
Solved by gpt-5.6-sol high.
Codex Wiki