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

Separation Axioms (T0 through T4)

College Depth 73 in the knowledge graph ☐ I know this ☆ Set as goal
106topics build on this
343prerequisites beneath it
See this on the map →
Open Sets in Topological Spaces→→Hausdorff SpacesNormal Spaces (T4 Spaces)+1 more
separation axioms

Core Idea

Separation axioms measure how well a topology distinguishes points and sets. T₀ through T₄ range from weak separation (different neighborhoods) to strong separation (disjoint closed sets).

Explainer

When you first encountered open sets, the examples were mostly familiar spaces — ℝ, intervals, metric spaces — where distinct points have plenty of room between them. But a topology can in principle put any collection of sets on a space and call them open, including pathological ones where distinct points are topologically indistinguishable. The separation axioms are a hierarchy of conditions that progressively rule out these pathologies by requiring that the topology can separate points or sets from one another using open sets.

T₀ (Kolmogorov) is the weakest: for any two distinct points x and y, there exists an open set containing one but not the other. This rules out the trivial topology where the only open sets are ∅ and X — in that topology, every point looks identical. T₁ (Fréchet) strengthens this: for any two distinct points x and y, there exist open sets separating *each* from the other — one containing x but not y, and one containing y but not x. In T₁ spaces, every singleton {x} is a closed set, because its complement is the intersection of all open sets containing each other point, which is open. Finite spaces with discrete topology are T₁; in fact T₁ is often described as "points are closed."

T₂ (Hausdorff) is the most commonly invoked axiom in analysis and geometry: for any two distinct points x and y, there exist *disjoint* open sets U containing x and V containing y. Hausdorff means points can be *simultaneously* separated — they each have their own private open neighborhood with no overlap. Every metric space is Hausdorff (just take balls of radius half the distance between the points). Most spaces mathematicians work with day-to-day are Hausdorff, which is why limits of sequences are unique in these spaces: if xₙ → x and xₙ → y with x ≠ y in a Hausdorff space, the disjoint open sets around x and y eventually exclude the sequence, giving a contradiction.

T₃ (Regular) and T₄ (Normal) push the separation from points to closed sets. T₃ (usually required in combination with T₁, giving "regular Hausdorff" spaces, also called T₃ spaces) separates a point from a closed set not containing it by disjoint open sets. T₄ (normal, combined with T₁) separates any two disjoint closed sets by disjoint open sets. The landmark theorem here is Urysohn's lemma: a space is T₄ if and only if any two disjoint closed sets can be separated by a continuous real-valued function — a function that equals 0 on one closed set and 1 on the other. This connects the purely topological separation axiom to the existence of continuous functions, which is why normality (T₄) is essential for results like Tietze's extension theorem and the construction of partitions of unity in differential geometry.

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 → Separation Axioms (T0 through T4)

Longest path: 74 steps · 343 total prerequisite topics

Prerequisites (1)

Leads To (3)