Math 2.0

statement lemma

Urysohn's lemma

Statement

Let XX be a normal space and let A,B⊆XA, B \subseteq X be disjoint closed sets. Then there is a continuous map f ⁣:X→[0,1]f \colon X \to [0, 1] with f(a)=0f(a) = 0 for all a∈Aa \in A and f(b)=1f(b) = 1 for all b∈Bb \in B.

Remarks

The converse also holds: if such a function exists for all disjoint closed AA and BB, then XX is normal. Take U=f−1([0,1/2))U = f^{-1}([0, 1/2)) and V=f−1((1/2,1])V = f^{-1}((1/2, 1]). The proof builds open sets UrU_r for the dyadic rationals r∈[0,1]r \in [0, 1], nested by the order of rr. Then f(x)f(x) is the infimum of the rr with x∈Urx \in U_r. In a metric space, the function f(x)=d(x,A)/(d(x,A)+d(x,B))f(x) = d(x, A) / (d(x, A) + d(x, B)) works. The Tietze extension theorem extends this result to all continuous functions on closed sets.

Explanations

L1 human

In a normal space, a continuous function can separate two disjoint closed sets: it is 00 on one set and 11 on the other. So normal spaces have many continuous real functions.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Urysohn%27s_lemma, Formal statement