Basic Analysis – Gently Done Topological Vector Spaces
Basic Analysis – Gently Done Topological Vector Spaces
Basic Analysis – Gently Done Topological Vector Spaces
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
48 <strong>Basic</strong> <strong>Analysis</strong><br />
NextweconsiderthefirstofseveralversionsoftheHahn-Banachtheorem. This<br />
one is for real vector spaces and uses the order structure in R. Some terminology<br />
is needed.<br />
Definition 5.19 We say that a map p : X → R on a real vector space X is<br />
subadditive if<br />
and that p is positively homogeneous if<br />
p(x+y) ≤ p(x)+p(y), for x,y ∈ X<br />
p(tx) = tp(x), for any x ∈ X and t > 0.<br />
Note that if p is positively homogeneous, then, with x = 0 and t = 2, we see<br />
that p(0) = 2p(0) so that p(0) = 0. Hence p(tx) = tp(x) for all t ≥ 0. If p is<br />
also subadditive, then, setting y = −x, we get 0 = p(0) ≤ p(x)+p(−x), that is,<br />
−p(−x) ≤ p(x), for x ∈ X.<br />
Theorem 5.20 (Hahn-Banach) Let X be a real vector space and suppose that<br />
f : M → R is a linear mapping defined on a linear subspace M of X such that<br />
f(y) ≤ p(y), for all y ∈ M, for some subadditive and positively homogeneous map<br />
p : X → R. Then there is a linear functional Λ : X → R such that Λ(x) = f(x)<br />
for x ∈ M and<br />
−p(−x) ≤ Λ(x) ≤ p(x) for x ∈ X.<br />
(In other words, f can be extended to X whilst retaining the same bound.)<br />
Proof Wefirstshow howwecanextendthedefinitionoff byoneextradimension.<br />
If M �= X, let x 1 ∈ X with x 1 /∈ M. Define M 1 = {x + tx 1 : x ∈ M, t ∈ R}.<br />
Then M 1 is a linear subspace of X—the subspace of X spanned by {x 1 }∪M. Any<br />
z ∈ M 1 can be written uniquely as z = x+tx 1 for x ∈ M and t ∈ R. Indeed, if<br />
x+tx 1 = x ′ +t ′ x 1 for x,x ′ ∈ M and t,t ′ ∈ R, then 0 = (x−x ′ )+(t−t ′ )x 1 . Since<br />
x 1 /∈ M, this implies that t = t ′ and therefore x = x ′ .<br />
The implications of the existence of a suitable extension to f will provide the<br />
idea of how to actually construct such an extension. So suppose for the moment<br />
that f 1 is an extension of f to M 1 , satisfying the stated bound in terms of p. Let<br />
x+tx 1 ∈ M 1 , x ∈ M, t ∈ R. Then f 1 (x+tx 1 ) = f(x)+tf 1 (x 1 ) = f(x)+tµ, where<br />
we have set µ = f 1 (x 1 ). The given bound demands that f(x)+tµ ≤ p(x+tx 1 )<br />
for all t ∈ R and x ∈ M. For t = 0, this is nothing other than the hypothesis on<br />
f. Replacing x by tx, we get f(tx)+tµ ≤ p(tx+tx 1 ). Setting t = 1 and t = −1,<br />
we obtain<br />
f(x)+µ ≤ p(x+x 1 ) for x ∈ M (taking t = 1)<br />
Department of Mathematics King’s College, London