THE CHINESE UNIVERSITY OF HONG KONG

Department of Mathematics
Math4010 Functional Analysis
Assignment 4 Suggested Solution
Please email to tutor if there are mistakes .

P141 5 , 8 , 9

5 kxn xk2 = kxn k2 + kxk2 - hxn , xi - hx, xn i kxk2 + kxk2 - hx, xi - hx, xi = kxk2 + kxk2 hx, xi - hx, xi =0 as n + .

8 ) part , if x y , then for all in F , kx + yk2 = kxk2 + hx, yi + hy, xi + ||2 kyk2 =
kxk2 + ||2 kyk2 ( as hx, yi = 0 = hy, xi ) kxk2 .
) part , if kx + yk kxk , for all in F , first consider the case when is real , define a real valued
function function on by () = kx + yk2 = kxk2 + 2Re(hx, yi) + 2 kyk2 with = 0 be a local
minimum , so 0 = 0 (0) = 2Re(hx, yi) , replace y by iy , we have 0 = Re(hx, iyi) = Re(ihx, yi) =
Im(hx, yi) , therefore hx, yi = 0 , x y

9 it suffices to show that if xn and x are in C[a,b] s.t xn x in k.k ,then xn x in k.k2 ,
Rb
Rb
Rb
kxn xk22 = hxn x, xn xi = a (xn (t) x(t))(xn (t) x(t))dt = a |xn (t) x(t)|2 dt a kxn xk2 dt
p
= (b a)kxn xk2 , 0 kxn xk2 (b a)kxn xk . By squeeze theorem if kxn xk 0
as n + , then xn x in k.k2 .

P150 10

10 note M = (M ) is a closed subspace containing M (see question 7 of P150) , so it contains

the smallest closed subspace of H containing M . Now let Y be an arbitrary closed subspace of H that
contains M , show that Y M , By question 7 of P150 , with Y M we have M Y , apply
arguement once again , Y = Y M where Y = Y follows from lemma 3.3-6 of P149 , so we
have M is the smallest closed subspace of H containing M .

P159 6 , 7 , 10
Pn
Pn
2
2
6 let i = hx, ei i , z =
i=1 i ei and y =
i=1 i ei . ) part kx yk = kx z + z yk =
2
2
2
2
2
2
kx zk + hx z, z P
yi + hz y, x zi
kz yk = kx zk + kz
kx yk , ( as
P+
Pn yk kx zk P
n
n
n
hx z, z yi = hx, i=1 (i i )ei i - i,j=1 j (i i )hej , ei i = i=1 i (i i ) - i=1 i (i i )
= 0 ) so we get all the inequality hold and kz yk2 = 0 , then z = y and result follows from linearly
independence of ei .
) part , it suffices to show z minimize the distance and assume y is an arbitrary element in span{ei , i =
1, 2, ..n} , by the proof of ) part , we have kx yk2 = kx z + z yk2 = kx zk2 + hx z, z yi
+ hz y, x zi + kz yk2 = kx zk2 + kz yk2 kx zk2 , we know z minimize kx yk whenever
y is in span{ei , i = 1, 2, ..n} .
qP
qP
P+
+
+
2
2
|hx,
e
i|
7 By Cauchy Schwartz inequality , k=1 |hx, ek ihy, ek i|
k
k=1
k=1 |hy, ek i| kxkkyk
By Bessel inequality (p157 of the text) .
R1
10 we apply Gram Schmidt process to the 3 linearly independent vectors , hx1 , x1 i = 1 t4 dt = 25 .
q
q R
5 2
5 1 3
t
,
w
=
x

hx
,
v
iv
,
hx
,
v
i
=
Take v1 = kxx11 k =
2
2
2
1
1
2
1
2
2 1 t dt = 0 , we have w2 = x2 .
1

q
R1
hw2 , w2 i = hx2 , x2 i = 1 t2 dt = 23 , Take v2 = kxx11 k = 32 t . w3 = x3 hx3 , v1 iv1 hx3 , v2 iv2 , hx3 , v1 i
q R
q R

R1
10
5 1 2
3 1
5 2
5 2 2
=
t
dt
=
,
hx
,
v
i
=
3
2
2 1
3
2 1 tdt = 0 . w3 = 1 3 t . hw3 , w3 i = 1 (1 3 t ) dt =
t

10 3
9 t

+ 59 t5 |11 =

8
9

, take v3 =

w3
kw3 k

3
8

5 t2
8

. {v1 , v2 , v3 } is a required set .