Urysohn's lemma
In topology, Urysohn's lemma is a lemma that states that a topological space is normal if and only if any two disjoint closed subsets can be separated by a continuous function.[1]
Urysohn's lemma is commonly used to construct continuous functions with various properties on normal spaces. It is widely applicable since all metric spaces and all compact Hausdorff spaces are normal. The lemma is generalized by (and usually used in the proof of) the Tietze extension theorem.
The lemma is named after the mathematician Pavel Samuilovich Urysohn.
Formal statement
Two subsets A and B of a topological space X are said to be separated by neighbourhoods if there are neighbourhoods U of A and V of B that are disjoint. In particular A and B are necessarily disjoint.
Two plain subsets A and B are said to be separated by a function if there exists a continuous function f from X into the unit interval [0,1] such that f(a) = 0 for all a in A and f(b) = 1 for all b in B. Any such function is called a Urysohn function for A and B. In particular A and B are necessarily disjoint.
It follows that if two subsets A and B are separated by a function then so are their closures.
Also it follows that if two subsets A and B are separated by a function then A and B are separated by neighbourhoods.
A normal space is a topological space in which any two disjoint closed sets can be separated by neighbourhoods. Urysohn's lemma states that a topological space is normal if and only if any two disjoint closed sets can be separated by a continuous function.
The sets A and B need not be precisely separated by f, i.e., we do not, and in general cannot, require that f(x) ≠ 0 and ≠ 1 for x outside of A and B. The spaces in which this property holds are the perfectly normal spaces.
Urysohn's lemma has led to the formulation of other topological properties such as the 'Tychonoff property' and 'completely Hausdorff spaces'. For example, a corollary of the lemma is that normal T1 spaces are Tychonoff.
Sketch of proof
The procedure is an entirely straightforward application of the definition of normality (once one draws some figures representing the first few steps in the induction described below to see what is going on), beginning with two disjoint closed sets. The clever part of the proof is the indexing of the open sets thus constructed by dyadic fractions.
For every dyadic fraction r ∈ (0,1), we are going to construct an open subset U(r) of X such that:
- U(r) contains A and is disjoint from B for all r,
- For r < s, the closure of U(r) is contained in U(s).
Once we have these sets, we define f(x) = 1 if x ∉ U(r) for any r; otherwise f(x) = inf{ r : x ∈ U(r) } for every x ∈ X. Using the fact that the dyadic rationals are dense, it is then not too hard to show that f is continuous and has the property f(A) ⊆ {0} and f(B) ⊆ {1}.
In order to construct the sets U(r), we actually do a little bit more: we construct sets U(r) and V(r) such that
- A ⊆ U(r) and B ⊆ V(r) for all r,
- U(r) and V(r) are open and disjoint for all r,
- For r < s, V(s) is contained in the complement of U(r) and the complement of V(r) is contained in U(s).
Since the complement of V(r) is closed and contains U(r), the latter condition then implies condition (2) from above.
This construction proceeds by mathematical induction. First define U(1) = X \ B and V(0) = X \ A. Since X is normal, we can find two disjoint open sets U(1/2) and V(1/2) which contain A and B, respectively. Now assume that n ≥ 1 and the sets U(k / 2n) and V(k / 2n) have already been constructed for k = 1, ..., 2n−1. Since X is normal, for any a ∈ { 0, 1, ..., 2n−1 }, we can find two disjoint open sets which contain X \ V(a / 2n) and X \ U((a+1) / 2n), respectively. Call these two open sets U((2a+1) / 2n+1) and V((2a+1) / 2n+1), and verify the above three conditions.
The Mizar project has completely formalized and automatically checked a proof of Urysohn's lemma in the URYSOHN3 file.
See also
Notes
- ^ Willard 1970 Section 15.
References
- Willard, Stephen (1970). General Topology. Dover Publications. ISBN 0-486-43479-6.
{{cite book}}: Invalid|ref=harv(help)