3.6.E: Problems on Normed Linear Spaces (Exercises)
( \newcommand{\kernel}{\mathrm{null}\,}\)
Show that distances in normed spaces obey the laws stated in Theorem 5 of §§1-3.
Complete the proof of assertions made in Example (C) and Note 2.
Define |x|=x1 for x=(x1,…,xn) in Cn or En. Is this a norm? Which (if any) of the laws (i) - (iii) does it obey? How about formula (2)?
Do Problem 3 in §§4-6 for a general normed space E, with lines defined as in En (see also Problem 7 in §9). Also, show that contracting sequences of line segments in E are f-images of contracting sequences of intervals in E1. Using this fact, deduce from Problem 11 in Chapter 2 §§8-9, an analogue for line segments in E, namely, if
L[an,bn]⊇L[an+1,bn+1],n=1,2,…
then
∞⋂n=1L[an,bn]≠∅.
Take for granted the lemma that
a1/pb1/q≤ap+bq
if a,b,p,q∈E1 with a,b≥0 and p,q>0, and
1p+1q=1.
(A proof will be suggested in Chapter 5, §6, Problem 11.) Use it to prove Hölder's inequality, namely, if p>1 and 1p+1q=1, then
n∑k=1|xkyk|≤(n∑k=1|xk|p)1p(n∑k=1|yk|q)1q for any xk,yk∈C.
[Hint: Let
A=(n∑k=1|xk|p)1p and B=(n∑k=1|yk|q)1q.
If A=0 or B=0, then all xk or all yk vanish, and the required inequality is trivial. Thus assume A≠0 and B≠0. Then, setting
a=|xk|pAp and b=|yk|qBq
in the lemma, obtain
|xkyk|AB≤|xk|ppAp+|yk|qqBq,k=1,2,…,n.
Now add up these n inequalities, substitute the values of A and B, and simplify. ]
Prove the Minkowski inequality,
(n∑k=1|xk+yk|p)1p≤(n∑k=1|xk|p)1p+(n∑k=1|yk|p)1p
for any real p≥1 and xk,yk∈C.
[Hint: If p=1, this follows by the triangle inequality in C. If p>1, let
A=n∑k=1|xk+yk|p≠0.
(If A=0, all is trivial.) Then verify (writing "∑" for "∑nk=1" for simplicity)
A=∑|xk+yk||xk+yk|p−1≤∑|xk||xk+yk|p−1+∑|yk||xk+yk|p−1
Now apply Hölder's inequality (Problem 5) to each of the last two sums, with q= p/(p−1), so that (p−1)q=p and 1/p=1−1/q. Thus obtain
A≤(∑|xk|p)1p(∑|xk+yk|p)1q+(∑|yk|p)1p(∑|xk+yk|p)1q.
Then divide by A1q=(∑|xk+yk|p)1q and simplify. ]
Show that Example (B) indeed yields a norm for Cn and En.
[Hint: For the triangle inequality, use Problem 6. The rest is easy. ]
A sequence {xm} of vectors in a normed space E( e.g. , in En or Cn) is said to be bounded iff
(∃c∈E1)(∀m)|xm|<c,
i.e., iff supm|xm| is finite.
Denote such sequences by single letters, x={xm},y={ym}, etc. and define
x+y={xm+ym}, and ax={axm} for any scalar a.
Also let
|x|=supm|xm|.
Show that, with these definitions, the set M of all bounded infinite sequences in E becomes a normed space (in which every such sequence is to be treated as a single vector, and the scalar field is the same as that of E ).