A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Covering Spaces

Research Depth 83 in the knowledge graph ☐ I know this ☆ Set as goal
5topics build on this
409prerequisites beneath it
See this on the map →
The Fundamental GroupQuotient Topology+1 more→→Homotopy Exact Sequence of a Fibrationvan Kampen's Theorem
covering-spaces deck-transformations universal-covers

Core Idea

A covering space of X is a space X̃ with a local homeomorphism p: X̃ → X such that every point has an evenly covered neighborhood. Covering spaces provide a way to 'unwind' a space and relate its fundamental group to the structure of covering space. The universal cover is the simply connected covering space containing all others.

Explainer

A covering space provides a systematic way to "unfold" a space that has complicated loops. You already know the fundamental group π₁(X, x₀) captures the essentially different loops in X. Covering spaces are the geometric objects that correspond to subgroups of this group — each covering space reveals a different partial unfolding of X, making hidden loop structure visible.

The formal definition: a covering space is a space X̃ together with a map p: X̃ → X (the covering map) such that every point x ∈ X has an evenly covered open neighborhood U — meaning p⁻¹(U) is a disjoint union of open sets in X̃, each mapped homeomorphically onto U by p. Think of p as a projection from multiple "sheets" of X̃ down to X. The canonical example is p: ℝ → S¹ defined by p(t) = e2πit — the real line wraps around the circle infinitely many times. Over each small arc of S¹ there are infinitely many disjoint intervals in ℝ, each mapping homeomorphically onto that arc.

The deep structure is the correspondence between covering spaces and subgroups of π₁(X). Given a connected covering space X̃ of X, the induced map p*: π₁(X̃, x̃₀) → π₁(X, x₀) is injective, and its image is a subgroup of π₁(X, x₀). Different covering spaces correspond to different subgroups — the more of the fundamental group that "lifts" to a loop in X̃ (rather than becoming contractible), the larger the subgroup. The universal cover X̃ corresponds to the trivial subgroup: it is simply connected (π₁ = 0) and is covered by all other covering spaces. For S¹, the universal cover is ℝ, consistent with π₁(S¹) ≅ ℤ.

The deck transformations — homeomorphisms X̃ → X̃ that commute with p — form a group that acts freely on each fiber p⁻¹(x). For a universal cover, this group is isomorphic to π₁(X) itself. The topology of X is recovered as the quotient X̃ / π₁(X). This correspondence between the geometry of covering spaces, the algebra of subgroups, and the action of deck transformations is one of the clearest examples of the interplay between algebraic and topological thinking, and it is the prototype for the broader theory of fiber bundles and principal G-bundles.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Neighborhood Bases → Continuity in Topological Spaces → Homotopy of Continuous Maps → Homotopy of Paths → Path Connectedness → Homotopy of Paths → The Fundamental Group → Simply Connected Spaces → Covering Spaces

Longest path: 84 steps · 409 total prerequisite topics

Prerequisites (3)

Leads To (2)