proof of Riesz’ Lemma
Let’s consider x∈E-S and let r=d(x,S). Recall that r is the distance between x and S: d(x,S)=inf{d(x,s) such that s∈S}. Now, r>0 because S is closed. Next, we consider b∈S such that
∥x-b∥<rα |
This vector b exists: as 0<α<1 then
rα>r |
But then the definition of infimum implies there is b∈S such that
∥x-b∥<rα |
Now, define
xα=x-b∥x-b∥ |
Trivially,
∥xα∥=1 |
Notice that xα∈E-S, because if xα∈S then x-b∈S, and so (x-b)+b=x∈S, an absurd. Plus, for every s∈S we have
∥s-xα∥=∥s-x-b∥x-b∥∥=1∥x-b∥⋅∥∥x-b∥⋅s+b-x∥≥r∥x-b∥ |
because
∥x-b∥⋅s+b∈S |
But
r∥x-b∥>αr⋅r=α |
QED.
Title | proof of Riesz’ Lemma |
---|---|
Canonical name | ProofOfRieszLemma |
Date of creation | 2013-03-22 14:56:14 |
Last modified on | 2013-03-22 14:56:14 |
Owner | gumau (3545) |
Last modified by | gumau (3545) |
Numerical id | 6 |
Author | gumau (3545) |
Entry type | Proof |
Classification | msc 54E35 |
Classification | msc 15A03 |