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

Quotient Maps and Identification Spaces

Graduate Depth 79 in the knowledge graph ☐ I know this ☆ Set as goal
2topics build on this
370prerequisites beneath it
See this on the map →
Quotient TopologyOpen and Closed Maps→→Classification of Compact SurfacesQuotient Maps and Quotient Topologies
quotient-maps identification-spaces gluing

Core Idea

A quotient map q: X → Y is a surjective function where Y carries the quotient topology relative to q—a set is open iff its preimage is open. Quotient maps formalize the process of identifying points or gluing spaces together. Understanding when quotient maps are homeomorphisms and when they preserve properties like compactness is essential for constructing new spaces.

Explainer

From quotient topology you know how to build a new space X/~ by declaring an equivalence relation ~ on X and giving the resulting set of equivalence classes the finest topology making the canonical projection q: X → X/~ continuous. A quotient map is a generalization of this projection: any surjective map q: X → Y where Y carries exactly the topology induced by q — meaning a subset V ⊆ Y is open if and only if q⁻¹(V) is open in X. The quotient topology is the finest topology on Y making q continuous, and quotient maps are precisely the continuous surjections that realize this fine topology.

The geometric intuition is *identification* or *gluing*. Start with a square [0,1] × [0,1]. Identify the left and right edges by declaring (0, y) ~ (1, y) for all y. The quotient space is a cylinder. Now additionally identify the top and bottom edges: (x, 0) ~ (x, 1). The quotient is a torus. Quotient maps make these constructions rigorous — the resulting topology on the cylinder or torus is exactly what "feels right" geometrically, because a set is open in the quotient precisely when its preimage (a tube around the identified edge, say) is open in the square. The same pattern builds the Möbius band, projective plane, and Klein bottle by choosing which edges to identify and in which orientation.

Not every surjective continuous map is a quotient map. A continuous bijection that is *not* a homeomorphism provides a counterexample: the map is continuous but its inverse is not, so the topology on the codomain is coarser than the quotient topology. Quotient maps are exactly the surjections that "push forward" the full open structure of X to Y. Crucially, any surjective continuous map from a compact space to a Hausdorff space is automatically a quotient map — and a homeomorphism if it is also injective. This theorem is why so many constructions in topology work: when you have compactness on the domain and Hausdorff separation on the codomain, continuous surjections are automatically well-behaved.

The central challenge with quotient maps is that they can fail to preserve useful properties. Quotients of Hausdorff spaces need not be Hausdorff (collapsing a closed subspace can create "stuck-together" points). Quotients of compact spaces are compact (continuous images of compact sets are compact). These preservation and failure results govern which spaces can be built by identification. Understanding quotient maps is the prerequisite for Van Kampen's theorem (computing fundamental groups of spaces built by gluing) and the classification of compact surfaces — both of which construct complicated spaces as quotients of simple ones, then analyze the result using the topology of the quotient.

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 → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets → Open Sets in Topological Spaces → Basis for a Topology → Neighborhoods and Local Properties → Continuity in Topological Spaces → Open and Closed Maps → Quotient Maps and Identification Spaces

Longest path: 80 steps · 370 total prerequisite topics

Prerequisites (2)

Leads To (2)