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

Hausdorff Spaces

Graduate Depth 79 in the knowledge graph ☐ I know this ☆ Set as goal
100topics build on this
372prerequisites beneath it
See this on the map →
Separation Axioms: T₀, T₁, and T₂ (Hausdorff)Separation Axioms (T0 through T4)→→Compactness in Hausdorff SpacesIntroduction to Topological Manifolds+1 more
hausdorff t2-axiom separated

Core Idea

A Hausdorff space (T₂ space) requires any two distinct points to have disjoint open neighborhoods. This is the most commonly studied separation axiom and appears throughout analysis and topology. In Hausdorff spaces, sequences have unique limits, singleton sets are closed, and compact subsets are closed.

Explainer

From your study of separation axioms, you know there is a hierarchy of ways a topological space can "separate" its points: T₀ asks that for any two distinct points, at least one has a neighborhood not containing the other; T₁ asks that each point can be separated from every other point by some open set; T₂ — the Hausdorff condition — asks for something stronger: any two distinct points have *disjoint* open neighborhoods. This is the condition that makes topology behave like the geometry you already know from analysis on ℝ.

The Hausdorff condition can be stated visually: if x ≠ y, you can "separate" them with open sets — find U ∋ x and V ∋ y such that U ∩ V = ∅. Every metric space is Hausdorff: given distinct points x and y at distance d > 0, take open balls of radius d/2 around each. These balls are disjoint by the triangle inequality. So all of the spaces from analysis — ℝⁿ, function spaces with norms, manifolds — are automatically Hausdorff. The Hausdorff condition is interesting precisely for spaces that might fail it, such as certain spaces in algebraic geometry or the quotient topologies that arise when you identify points together carelessly.

The most important consequence of the Hausdorff condition in analysis is uniqueness of limits. In a non-Hausdorff space, a sequence can converge to two different points simultaneously — because there is no way to isolate the two limit points from each other. In a Hausdorff space, this cannot happen: if x_n → x and x_n → y, then x = y. The proof uses the Hausdorff condition directly: if x ≠ y, take disjoint neighborhoods U of x and V of y; eventually the sequence must lie entirely in U (by convergence to x) and eventually entirely in V (by convergence to y), but U ∩ V = ∅, a contradiction. From this it follows that singletons {x} are closed in any T₁ space, and in particular in any Hausdorff space.

A crucial theorem linking Hausdorff spaces to compactness is: in a Hausdorff space, every compact subset is closed. The proof constructs, for any point y outside a compact set K, a neighborhood of y disjoint from K — using the Hausdorff condition to separate y from each point of K, then using compactness to extract a finite subcover. This interplay between Hausdorff and compactness is one of the central engines of topology: it explains why compact Hausdorff spaces have such clean and complete theory, and it sets up the study of compactification and metrization theorems you will encounter next.

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 → Limit Points and Convergence → Separation Axioms: T₀, T₁, and T₂ (Hausdorff) → Hausdorff Spaces

Longest path: 80 steps · 372 total prerequisite topics

Prerequisites (2)

Leads To (3)