What is the key construction used in the proof of Urysohn's Lemma to build the separating function f: X → [0,1]?
AFor each rational r ∈ [0,1], define U(r) = {x : d(x, F) < r} using the metric structure of the space
BUse the axiom of choice to select a point between F and G in each open set, then define f by interpolation
CFor each dyadic rational r ∈ [0,1], construct a nested family of open sets U(r) using normality at each step, then define f(x) = inf{r : x ∈ U(r)}
DDefine f(x) = 0 on F and f(x) = 1 on G, then extend continuously using the Tietze Extension Theorem
The proof doesn't use a metric (the space need not be metrizable) and doesn't assume the Tietze Extension Theorem (which Urysohn's Lemma implies, not the other way around). The key construction is a dyadic family: for each k/2ⁿ ∈ [0,1], use normality to insert an open set U(k/2ⁿ) between previously constructed sets, building a nested family indexed by a dense set. The function f(x) = inf{r : x ∈ U(r)} is then continuous because the nested structure provides enough 'checkpoints' to force continuity everywhere.
Question 2 Multiple Choice
Urysohn's Lemma concludes that in a normal space, disjoint closed sets can be separated by a continuous function. Why is this stronger than the definition of normality itself?
AIt is not stronger — normal spaces are defined precisely by the existence of such separating functions
BIt is stronger because normality only guarantees disjoint open neighborhoods around the closed sets, while Urysohn's Lemma constructs a globally continuous function that interpolates between them throughout the entire space
CIt is stronger because Urysohn's Lemma applies to all topological spaces, while normality is a special axiom
DIt is stronger because continuous functions are harder to construct than open sets in metric spaces
Normality is defined as: for any two disjoint closed sets, there exist disjoint open sets containing them. This is a purely set-theoretic separation condition — it gives you two open sets that don't overlap. Urysohn's Lemma goes further: it builds a continuous function that equals 0 on one closed set and 1 on the other, varying continuously throughout the entire space. Building a globally continuous function with prescribed values requires coordinating the topology across the whole space, not just finding two disjoint open sets. The lemma reveals that normality is strong enough to support this function-theoretic construction.
Question 3 True / False
Urysohn's Lemma applies to most Hausdorff spaces, since normal spaces are simply Hausdorff spaces with an additional separation property.
TTrue
FFalse
Answer: False
Not all Hausdorff spaces are normal. Hausdorff (T₂) requires that any two distinct points can be separated by disjoint open sets. Normal spaces additionally require that any two disjoint closed sets can be separated by disjoint open sets — a strictly stronger condition. There exist Hausdorff spaces that are not normal (the Sorgenfrey plane is a classic example), and Urysohn's Lemma does not apply to them. Normal spaces form a proper subclass of Hausdorff spaces.
Question 4 True / False
In the proof of Urysohn's Lemma, the dyadic rationals are used because they are dense in [0,1], and this density is what guarantees the function f(x) = inf{r : x ∈ U(r)} is continuous.
TTrue
FFalse
Answer: True
Continuity of f requires that preimages of open sets are open. The nested family U(r) provides open sets indexed by dyadic rationals, which are dense in [0,1]. For any point x and any open interval (a,b) containing f(x), the density of dyadic rationals ensures there exist dyadic rationals r₁ < f(x) < r₂ with (r₁, r₂) ⊂ (a,b), and the sets U(r) then provide the open neighborhood of x whose image lands in (a,b). Without density, there would be gaps in the family where continuity could break down.
Question 5 Short Answer
Urysohn's Lemma can be paraphrased as: 'In a normal space, closed sets can be separated by a continuous function.' Why is this stronger than the mere fact that normal spaces have disjoint separating open sets?
Think about your answer, then reveal below.
Model answer: Separating open sets give two disjoint open neighborhoods — one around each closed set — but say nothing about what happens in between. A continuous separating function must coordinate the topology of the entire space: it must assign values in [0,1] to every point such that the assignment varies continuously everywhere, equaling 0 on one closed set and 1 on the other. Continuity is a global condition (preimages of all open sets must be open), not just a local one. The fact that normality — a condition about separating two closed sets with two open sets — is sufficient to build such a globally continuous function is the non-obvious content of the lemma.
This is why Urysohn's Lemma is described as showing that normality is the 'right' condition for doing analysis in a topological setting: it is exactly strong enough to support function-theoretic arguments. Spaces that are not normal cannot always support such functions, which limits what analysis can be done on them. The lemma also unlocks major consequences: the Tietze Extension Theorem and Urysohn's Metrization Theorem both follow from it.