ebooksgratis.com

See also ebooksgratis.com: no banners, no cookies, totally FREE.

CLASSICISTRANIERI HOME PAGE - YOUTUBE CHANNEL
Privacy Policy Cookie Policy Terms and Conditions
Urysohn's lemma - Wikipedia, the free encyclopedia

Urysohn's lemma

From Wikipedia, the free encyclopedia

In topology, Urysohn's lemma, sometimes called "the first non-trivial fact of point set topology", is commonly used to construct continuous functions of 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 Pavel Samuilovich Urysohn. See also Cutoff function.

[edit] Formal statement

Urysohn's lemma states that X is a normal topological space if and only if, whenever A and B are disjoint closed subsets of X, then there exists a continuous function from X into the unit interval [0, 1],

f : X → [0, 1],

such that f(a) = 0 for all a in A and f(b) = 1 for all b in B.

Any such function f is known as an Urysohn function.

Note that in the statement above, we do not, and in general cannot, require that f(x) ≠ 0 and ≠ 1 for x outside of A and B. This is only possible in perfectly normal spaces.

A corollary of the lemma is that normal T1 spaces are Tychonoff.

[edit] Sketch of proof

Illustration of Urysohn's "onion" function.
Illustration of Urysohn's "onion" function.

For every dyadic fraction r ∈ (0,1), we are going to construct an open subset U(r) of X such that:

  1. U(r) contains A and is disjoint from B for all r
  2. for r < s, the closure of U(r) is contained in U(s)

Once we have these sets, we define f(x) = inf { r : xU(r) } for every xX. 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

  • AU(r) and BV(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. 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(a/2n) and V(a/2n) have already been constructed for a = 1,...,2n-1. Since X is normal, we can find two disjoint open sets which contain the complement of V(a/2n) and the complement of 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.

[edit] References


aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -