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 Quotient Topologies

Graduate Depth 80 in the knowledge graph I know this Set as goal
376prerequisites beneath it
See this on the map →
Continuity in Topological SpacesHomeomorphisms and Topological Equivalence+2 more
quotient-maps identification

Core Idea

A surjection q: X → Y is a quotient map if U ⊆ Y is open iff q⁻¹(U) is open. The quotient topology on Y is the finest making q continuous. Quotient maps formalize identification and gluing: the torus is ℝ² with 'opposite edges identified,' projective space ℝPn is Sn with antipodal points identified.

Explainer

From continuity of topological spaces, you know that a map f: X → Y is continuous when preimages of open sets are open: U open in Y implies f⁻¹(U) open in X. This is the "weak" condition — continuity only flows one way. A quotient map q: X → Y strengthens this to a biconditional: U ⊆ Y is open *if and only if* q⁻¹(U) is open in X. The topology on Y is completely determined by q — Y has exactly the open sets that q "lets through." This makes q the most topologically faithful type of surjection: the topology of Y is not just compatible with q but is entirely defined by it.

The canonical motivation is gluing. Take a square [0,1] × [0,1] and identify the left and right edges: declare that (0, t) and (1, t) are "the same point" for every t ∈ [0, 1]. The result is a cylinder. Then identify top and bottom edges of the cylinder: (s, 0) and (s, 1) become the same. The result is a torus. The quotient map q sends each point of the square to its equivalence class under these identifications, and the quotient topology on the torus is precisely: a set U in the torus is open iff its preimage in the square is open. This construction is completely precise — you do not need to embed the torus in ℝ³ or describe its geometry. The topology is entirely determined by the identification rule and the continuity condition.

The quotient topology on Y is the finest (largest) topology making q continuous. "Finest" means as many open sets as possible: since q is continuous iff preimages of opens are open, we put in every set whose preimage is open. Any coarser topology would declare some set U closed even though q⁻¹(U) is open — discarding topological information. The quotient topology keeps everything the map allows. A useful consequence: a map f: Y → Z out of a quotient space Y is continuous iff the composition f ∘ q: X → Z is continuous. This is the universal property of quotient maps, and it means you can check continuity of maps *out of* quotient spaces by working upstairs in X, where life is often simpler.

The power of quotient maps in practice is that they generate all the important non-trivial topological spaces from simple ones. The projective plane ℝP² is S² with antipodal points identified — q: S² → ℝP² collapses each pair {x, −x} to a single point. The Möbius band is a rectangle with one pair of opposite edges identified with a flip. These are not merely metaphors or embeddings in 3-space: they are precisely defined topological spaces, and their topology (which sets are open) is given by the quotient map definition. Whenever you see a description like "X with these points identified" or "X modulo the equivalence relation ∼," you are seeing a quotient space, and the quotient map is the projection sending each point to its equivalence class. The biconditional in the definition — not just preimages of opens are open, but conversely — is what ensures the quotient space captures the full topological content of the identification.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesDe Morgan's LawsNegation of Quantified StatementsProof by ContradictionTopological Spaces: Definition and ExamplesOpen Sets in Topological SpacesNeighborhoods and Open SetsOpen Sets in Topological SpacesBasis for a TopologyNeighborhoods and Local PropertiesContinuity in Topological SpacesOpen and Closed MapsQuotient Maps and Identification SpacesQuotient Maps and Quotient Topologies

Longest path: 81 steps · 376 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.