Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 1.40(b): GGG is the deck transformation group of Y→Y/GY\to Y/GY→Y/G when YYY is path-connected

Proved
Hatcher.deckGroup_orbitProj

by korbonits · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologycovering-spacesfundamental-grouphatcher

Let a group GGG act on a space YYY by homeomorphisms satisfying Hatcher's condition (∗)(\ast)(∗) (p. 72), and let p:Y→Y/Gp:Y\to Y/Gp:Y→Y/G be the quotient map onto the orbit space.

Proposition 1.40(b). If YYY is path-connected, then GGG is the group of deck transformations of the covering space Y→Y/GY\to Y/GY→Y/G: the map sending g∈Gg\in Gg∈G to the homeomorphism y↦gyy\mapsto gyy↦gy is a group isomorphism from GGG onto the deck transformation group of ppp.

Hatcher: each ggg is a deck transformation, and a deck transformation fff of a path-connected covering space is determined by f(y)f(y)f(y) for one yyy, which lies in the orbit GyGyGy.

Formalization Note The statement asserts the existence of a group isomorphism φ:G≅G(Y)\varphi:G\cong G(Y)φ:G≅G(Y) with φ(g)(y)=gy\varphi(g)(y)=gyφ(g)(y)=gy for all g,yg,yg,y; this prescribes φ\varphiφ completely. The group law on deck transformations is composition, (f * g) y = f (g y), matching (g1g2)y=g1(g2y)(g_1g_2)y=g_1(g_2y)(g1​g2​)y=g1​(g2​y).

Preamble
import Definitions.Def_Hatcher_Covering
import Mathlib

open Hatcher unitInterval
Formal statement
namespace Hatcher
theorem deckGroup_orbitProj {G Y : Type*} [Group G] [TopologicalSpace Y] [MulAction G Y]
    [PathConnectedSpace Y] (hGY : IsCoveringSpaceAction G Y) :
    ∃ φ : G ≃* deckGroup (orbitProj G Y), ∀ (g : G) (y : Y), (φ g : Y ≃ₜ Y) y = g • y := by sorry
end Hatcher
Source
A. Hatcher, Algebraic Topology, Cambridge University Press 2002, https://pi.math.cornell.edu/~hatcher/AT/AT.pdf, Section 1.3, p. 72, Proposition 1.40(b)
Read-back

What the Lean code literally says, in plain math · claude-fable-5-1

Read-back of Hatcher.deckGroup_orbitProj.

Setting and binders

  • G Y : Type* — independent, arbitrary universes.
  • [Group G], [TopologicalSpace Y], [MulAction G Y] — a group GGG acting on the left on a topological space YYY: 1⋅y=y1\cdot y=y1⋅y=y, (gh)⋅y=g⋅(h⋅y)(gh)\cdot y=g\cdot(h\cdot y)(gh)⋅y=g⋅(h⋅y). Continuity is not part of MulAction.
  • [PathConnectedSpace Y] — YYY is nonempty and any two points are joined by a path.
  • (hGY : IsCoveringSpaceAction G Y) — (1) each y↦g⋅yy\mapsto g\cdot yy↦g⋅y is continuous (hence a homeomorphism with inverse g−1⋅−g^{-1}\cdot-g−1⋅−); (2) every yyy has a neighbourhood U∈N(y)U\in\mathcal N(y)U∈N(y) with (g⋅U)∩U≠∅⇒g=1(g\cdot U)\cap U\neq\emptyset\Rightarrow g=1(g⋅U)∩U=∅⇒g=1 for all ggg. Condition (2) implies the action is free.

Definitions used:

  • OrbitSpace G Y — the quotient Y/GY/GY/G of YYY by a∼b  ⟺  a∈G⋅ba\sim b\iff a\in G\cdot ba∼b⟺a∈G⋅b, with the quotient (coinduced) topology.
  • orbitProj G Y : Y → Y/G — the canonical projection π(y)=[y]\pi(y)=[y]π(y)=[y].
  • deckGroup (orbitProj G Y) : Subgroup (Y ≃ₜ Y) — Deck(π)={f∈Homeo(Y)∣∀y, π(fy)=π(y)}\mathrm{Deck}(\pi)=\{f\in\mathrm{Homeo}(Y)\mid\forall y,\ \pi(f y)=\pi(y)\}Deck(π)={f∈Homeo(Y)∣∀y, π(fy)=π(y)}, i.e. homeomorphisms fff of YYY such that f(y)f(y)f(y) lies in the orbit of yyy for every yyy. Group law: (fg)(y)=f(g(y))(fg)(y)=f(g(y))(fg)(y)=f(g(y)), 1=id1=\mathrm{id}1=id, f−1=f^{-1}=f−1= inverse homeomorphism. Coerced to a type with the induced group structure; its elements are pairs ⟨f,proof⟩\langle f, \text{proof}\rangle⟨f,proof⟩ and (φ g : Y ≃ₜ Y) extracts the homeomorphism fff.
  • G ≃* deckGroup (orbitProj G Y) — a MulEquiv: a bijection G→Deck(π)G\to\mathrm{Deck}(\pi)G→Deck(π) preserving multiplication, i.e. a group isomorphism.

Hypotheses

YYY nonempty and path-connected; GGG acts on YYY by homeomorphisms as a covering space action. No local path-connectedness, Hausdorffness, or assumption on GGG.

Conclusion

There exists a group isomorphism φ:G→ ∼ Deck(π)\varphi : G\xrightarrow{\ \sim\ }\mathrm{Deck}(\pi)φ:G ∼ ​Deck(π) such that for every g∈Gg\in Gg∈G and y∈Yy\in Yy∈Y,

φ(g)(y)=g⋅y.\varphi(g)(y) = g\cdot y .φ(g)(y)=g⋅y.

Since the equation determines φ(g)\varphi(g)φ(g) as a homeomorphism (and hence as an element of the subgroup, membership proofs being irrelevant), the statement is equivalent to the conjunction of:

  1. for every ggg, the translation τg:y↦g⋅y\tau_g : y\mapsto g\cdot yτg​:y↦g⋅y is a homeomorphism of YYY satisfying π∘τg=π\pi\circ\tau_g=\piπ∘τg​=π (so τg∈Deck(π)\tau_g\in\mathrm{Deck}(\pi)τg​∈Deck(π));
  2. g↦τgg\mapsto\tau_gg↦τg​ is a group homomorphism G→Deck(π)G\to\mathrm{Deck}(\pi)G→Deck(π) — automatic from the action axioms and the composition convention (fg)(y)=f(g(y))(fg)(y)=f(g(y))(fg)(y)=f(g(y)), since τgh(y)=g⋅(h⋅y)=τg(τh(y))\tau_{gh}(y)=g\cdot(h\cdot y)=\tau_g(\tau_h(y))τgh​(y)=g⋅(h⋅y)=τg​(τh​(y));
  3. g↦τgg\mapsto\tau_gg↦τg​ is injective (the action is faithful: τg=id⇒g=1\tau_g=\mathrm{id}\Rightarrow g=1τg​=id⇒g=1);
  4. g↦τgg\mapsto\tau_gg↦τg​ is surjective: every homeomorphism fff of YYY with f(y)∈G⋅yf(y)\in G\cdot yf(y)∈G⋅y for all yyy is of the form f=τgf=\tau_gf=τg​ for a single g∈Gg\in Gg∈G.

Remarks

  • Matches Hatcher, Prop. 1.40(b): "GGG is the group of deck transformations of the covering space Y→Y/GY\to Y/GY→Y/G if YYY is path-connected." Hatcher's proof identifies GGG with the deck group via g↦τgg\mapsto\tau_gg↦τg​, exactly the map pinned down here.
  • Unlike the theorems about π1\pi_1π1​, the isomorphism here is explicit: the statement is not merely "G≅Deck(π)G\cong\mathrm{Deck}(\pi)G≅Deck(π) abstractly" but "the natural map g↦(y↦g⋅y)g\mapsto(y\mapsto g\cdot y)g↦(y↦g⋅y) is an isomorphism". This is stronger than an abstract Nonempty (G ≃* …) and is the textbook content.
  • GGG vs. GopG^{\mathrm{op}}Gop. Because Mathlib's Homeomorph group has (fg)=f∘g(fg)=f\circ g(fg)=f∘g and MulAction is a left action, g↦τgg\mapsto\tau_gg↦τg​ is a genuine homomorphism from GGG (not from GopG^{\mathrm{op}}Gop). Had the group law on Y ≃ₜ Y been g∘fg\circ fg∘f, this statement would be false in general (it would need GopG^{\mathrm{op}}Gop). The conventions are consistent.
  • Path-connectedness is essential for item 4, and it is present. Without it the statement fails: e.g. Y={a,b}Y=\{a,b\}Y={a,b} discrete, G=1G=1G=1; then Deck(π)=Homeo(Y)≅Z/2≇G\mathrm{Deck}(\pi)=\mathrm{Homeo}(Y)\cong\mathbb Z/2\not\cong GDeck(π)=Homeo(Y)≅Z/2≅G.
  • Edge cases. GGG trivial, YYY path-connected: π\piπ is a homeomorphism, Deck(π)={f∣f(y)=y ∀y}={id}\mathrm{Deck}(\pi)=\{f\mid f(y)=y\ \forall y\}=\{\mathrm{id}\}Deck(π)={f∣f(y)=y ∀y}={id}, and φ\varphiφ is the trivial isomorphism — true. YYY empty is excluded by PathConnectedSpace Y. Item 3 (injectivity) is guaranteed by hGY (freeness); if hGY were dropped, a non-faithful action would make the statement false, so the hypothesis is doing work.
  • The deck group is defined from the function π\piπ only; the topology on Y/GY/GY/G plays no role in the statement (it does in the neighbouring orbitProj_isCoveringMap).
  • No claim is made here that π\piπ is a covering map; that is a separate theorem. This statement is purely about which orbit-preserving homeomorphisms exist.
  • Universe-polymorphic in G, Y independently.
Human review
  • Endorsed by Shuze Chen · Sep 8, 2026

  • Endorsed by korbonits · Sep 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me