Find your next learning step
Two disjoint closed sets can be topologically separate without a visible numerical distance. In a normal space, they have disjoint open neighbourhoods. Urysohn’s lemma strengthens that separation into a continuous function that is zero on one closed set and one on the other. The proof matters because it builds numerical structure from open sets alone, while its limits show exactly where separation assumptions enter.
Open the chapter contents · Topology root · Gold Standard of Education · How X Works
Chapter contents
Choose the route closest to the decision, or read from Chapter 1. The chapters remain open; these grouped routes are a navigable index.
Route 1 · Define the decision
Route 2 · Work the ledgers
Route 3 · Transfer the method
Route 4 · Check limits and evidence
Route 5 · Ask and continue
CHAPTER 1 OF 12 · DEFINE THE DECISION
1. State the separation problem
Let A and B be disjoint closed subsets of a topological space X. We want a continuous function f:X→[0,1] with f=0 on A and f=1 on B.
Such a function does more than label the sets. Continuity provides intermediate open regions and lets topological separation feed later extension and metrisation arguments.
CHAPTER 2 OF 12 · DEFINE THE DECISION
2. Define normality with the convention visible
A space is normal when every pair of disjoint closed sets can be contained in disjoint open neighbourhoods. Some texts include the T1 axiom in the word “normal”; others call that combination T4.
State the convention before transferring a theorem. The neighbourhood-separation property is the ingredient used in Urysohn’s construction.
CHAPTER 3 OF 12 · WORK THE LEDGERS
3. Build the metric-space formula
In a metric space, define d(x,A) as the infimum of distances from x to points of A. For disjoint closed A and B, the function f(x)=d(x,A)/(d(x,A)+d(x,B)) has the desired endpoint values.
| Location x | d(x,A) | d(x,B) | f(x) |
|---|---|---|---|
| x in A | 0 | positive | 0 |
| x in B | positive | 0 | 1 |
| Between the sets | positive | positive | strictly between 0 and 1 |
| Outside both | nonnegative | nonnegative | determined by relative distance |
Distance functions are continuous, so the quotient is continuous where its denominator is nonzero. This short proof uses the metric; the general lemma must work without one.
CHAPTER 4 OF 12 · WORK THE LEDGERS
4. Work an explicit real-line separator
Take X=R, A=(−∞,0] and B=[2,∞). The distance formula produces a clipped linear ramp: zero through A, x/2 between 0 and 2, and one through B.
| x | d(x,A) | d(x,B) | f(x) |
|---|---|---|---|
| −1 | 0 | 3 | 0 |
| 0.5 | 0.5 | 1.5 | 0.25 |
| 1 | 1 | 1 | 0.50 |
| 1.5 | 1.5 | 0.5 | 0.75 |
| 3 | 3 | 0 | 1 |
Changing B to [3,∞) changes the ramp to x/3 on [0,3]. The topology did not supply a unique separator; it guaranteed that at least one exists.
CHAPTER 5 OF 12 · WORK THE LEDGERS
5. Replace distance with nested open sets
In a general normal space, construct open sets Ur indexed by dyadic rationals r in [0,1]. Arrange A⊆U0 and ensure closure(Ur)⊆Us whenever r Normality supplies each intermediate open set. The nested closure condition is the key: it prevents neighbouring levels from tangling and later makes the level function continuous.
CHAPTER 6 OF 12 · TRANSFER THE METHOD
6. Define the Urysohn function from levels
For each point x, define f(x) as the infimum of dyadic levels r for which x belongs to Ur, using one for points that never enter an earlier level.
The closure nesting shows that inverse images of intervals can be expressed through unions of the Ur and their complements. That is the step that proves continuity rather than merely assigning endpoint labels.
CHAPTER 7 OF 12 · TRANSFER THE METHOD
7. Changed-context transfer: separate a point and a closed set
If X is normal under a convention that also supplies T1, then a point x outside a closed set F forms the disjoint closed pair {x} and F.
Urysohn’s lemma yields a continuous function with value zero at x and one on F. The transfer depends on {x} being closed; without the relevant separation axiom, that step cannot be smuggled in.
CHAPTER 8 OF 12 · TRANSFER THE METHOD
8. Connect sequence limits and compactness carefully
The guide to when sequences miss closure and continuity concerns convergence tests, not separation of closed sets. Read coordinatewise convergence in infinite products for another limit mechanism.
Use cofinite spaces and non-unique limits to see why compactness alone does not supply the normal-Hausdorff behaviour often familiar from metric spaces.
CHAPTER 9 OF 12 · CHECK LIMITS AND EVIDENCE
9. Limits and common misconceptions
Disjoint closed sets need not have positive metric distance in every metric space, yet the ratio formula can still work because no point has zero distance to both closed sets.
Urysohn’s lemma does not claim every topological space is normal, does not make the separator unique and does not by itself produce a metric. Metrisation theorems require additional countability and separation hypotheses.
CHAPTER 10 OF 12 · CHECK LIMITS AND EVIDENCE
10. Practical proof and checking routine
Write the exact normality convention, verify A and B are closed and disjoint, and name the codomain [0,1]. In a metric proof, check continuity and the positive denominator.
In the general proof, audit the dyadic index order, every closure inclusion, the endpoint sets and the preimages used for continuity. A family of open sets without closure control is not yet the lemma.
CHAPTER 11 OF 12 · ASK AND CONTINUE
11. Frequently asked questions
Why separate closed sets instead of points?
Closed-set separation is strong enough to build continuous functions that remain fixed over whole regions.
Is the Urysohn function unique?
No. Even on the real line, many continuous ramps have the same endpoint values.
Are all metric spaces normal?
Yes. The distance-to-set construction supplies disjoint neighbourhoods and a Urysohn function.
CHAPTER 12 OF 12 · ASK AND CONTINUE
12. Sources and next reading
MIT OpenCourseWare’s Urysohn lemma notes present the normal-space construction, while the companion metrisation notes place continuous separation inside a wider theorem. The distance ratio and real-line ledger are original teaching examples.
Continue through the Topology root, the Gold Standard of Education and How X Works.
Top · Contents · Previous · How X Works