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

Urysohn Metrization Theorem

Research Depth 82 in the knowledge graph ☐ I know this ☆ Set as goal
402prerequisites beneath it
See this on the map →
Normality and T₄ SpacesMetrization Theorems+2 more→
metrization urysohn

Core Idea

A second-countable normal space is metrizable (its topology comes from a metric). This characterizes when abstract topological spaces are actually metric spaces. The theorem shows such spaces embed into ℓ²(ℕ), a Hilbert space with a natural metric. Provides a powerful criterion for recognizing metric spaces.

Explainer

Start with the problem. A topological space is defined abstractly by its open sets, with no requirement that distances between points exist. Metric spaces are special: they carry a distance function d(x, y) satisfying the triangle inequality, and their topology is generated by open balls. The question is: when does an abstractly defined topological space secretly have an underlying metric? Metrization means finding a metric on the space that generates exactly the given topology — not just any metric, but one that recovers all the open sets you started with.

You know two prerequisites. Normality (the T4 axiom) says that disjoint closed sets can be separated by disjoint open sets. This is a strong separation condition: any two "incompatible" closed pieces of the space can be pushed apart. Second-countability says the topology has a countable base — a countable collection of open sets from which every open set is built by unions. Euclidean spaces are second-countable (rational-radius balls centered at rational points form a countable base). The Urysohn Metrization Theorem says these two conditions together guarantee metrization.

The proof works in two steps, each using the two hypotheses in turn. First, normality gives you Urysohn functions: for any two disjoint closed sets C and D, there exists a continuous function f : X → [0,1] with f = 0 on C and f = 1 on D. Normality is exactly the condition that makes such separator functions exist. Second, second-countability gives you a countable base {U₁, U₂, U₃, …}, and for each pair (Uᵢ, Uj) with cl(Uᵢ) ⊆ Uj, normality produces a Urysohn function fᵢⱼ. Collecting all such functions gives a countable family. This family defines an embedding X → ℓ²(ℕ) by x ↦ (fᵢⱼ(x)), and the metric pulled back from ℓ² is the desired metric on X.

The theorem draws a sharp boundary between abstract topology and metric topology. All metric spaces are normal and, if second-countable, satisfy the theorem's hypotheses. So second-countable normal spaces are exactly those topological spaces that "look like" metric spaces, even when presented abstractly. Spaces that are normal but not second-countable (like the long line) may fail to be metrizable. Spaces that are second-countable but not normal (unusual but possible) also fail. The theorem is an "if and only if" in the second-countable case: for second-countable Hausdorff spaces, normality is equivalent to metrizability. This makes it one of the most satisfying classification results in topology — a clean algebraic-separation condition translating into a geometric distance structure.

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 → Regularity (T₃) and Normal Spaces (T₄) → Tietze Extension Theorem → Urysohn Metrization Theorem

Longest path: 83 steps · 402 total prerequisite topics

Prerequisites (4)

Leads To (0)

No topics depend on this one yet.