THE CHINESE UNIVERSITY OF HONG KONG

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

P101 10, 14
10 By direct computation, we have
1

Z
S T x(s) = s

tx(t)dt,
0

and
2

T Sx(s) = s

x(t)dt.
0

Z
Therefore S and T do not commute. kSxk = maxt[0,1] |Sx(t)| = |

Z
x(u)du|

kxk du = kxk
0

with equality holds when x 1, so kSk = 1.

Similarly, kT xk = maxt[0,1] |T x(t)| = maxt[0,1] |tx(t)| maxt[0,1] |x(t)| = kxk with equality holds
when x 1, so kT k = 1.
Z 1
Z 1
Z 1
1
kS T xk = maxs[0,1] |s
tx(t)dt| = |
tx(t)dt|
tdtkxk = kxk with equality hold when
2
0
0
0
x 1, so kS T k = 21 .
Z 1
Z 1
kT Sxk = maxs[0,1] |s2
x(t)dt| = |
x(t)dt| kxk with equality holds when x 1, so
kT Sk = 1.

Pn
Pn
Pn
Pn
14 If we define kAk = maxk j=1 |jk | , x in X , s.t x 6= 0 , kAxk2 = j=1 |(Ax)j | = j=1 | k=1 jk k |
Pn Pn
Pn
Pn
Pn
Pn
Pn
j=1 k=1 |jk k | = k=1 |k | j=1 |jk | k=1 |k |(maxl j=1 |jl |) = kxk1 maxl j=1 |jl | =
kAk kxk1 , we have the compatibility .
2
. Again the j th entry of Ax is
We find the formula if the norm of A is defined by supxX,x6=0 kAxk
Pn
Pn
Pn
Pn
Pnkxk1Pn
Pn
Pn
, so kAxk2 = j=1 |(Ax)j | = j=1 | k=1 jk k | j=1 k=1 |jk k | = k=1 |k | j=1 |jk |
k=1
Pn jk k
Pn
Pn
Pn
k=1 |k |(maxl j=1 |jl |) = kxk1 maxl j=1 |jl | , therefore kAk maxk j=1 |jk | . We show
Pn
Pn
that they are in fact equal , let r be an integer such that s.t j=1 |jr | = maxk j=1 |jk | . Let x in F n
Pn
Pn
Pn
s.t = 0 for j 6= r , r = 1 obviously kxk1 = 1 , kAk kAxk2 = j=1 | k=1 jk k | = j=1 |jr r | =
Pn j
Pn
j=1 |jr | = maxk
j=1 |jk | , we have the equality .
P110 3 , 9 , 10 , 14
R0
R1
R0
R1
3 x C[-1,1] , |f (x)| | 1 x(t)dt| + | 0 x(t)dt| 1 kxk dt + 0 kxk dt = 2kxk , kf k
2. We are to going to show kf k = 2 . Consider a sequence of xn in C[-1,1] , xn (t) = -1 for t ( n1 , 1],
1
1
1
-nt for t [ 1
n , n ] , 1 for t [1, n ) , note kxn k = 1 , n . f(x) = 2 - n 2 as n + , so kf k
2 , with above result we have kf k = 2 .
9 Uniquness: If x = x0 + y0 =x0 + y1 where , F , yi N(f), then ( )x0 = y1 - y0
( )f(x0 ) = f(y1 - y0 ) =0 , f(x0 ) 6= 0 = and y1 = y0 , we have proved the uniqueness part .
(x)
Existence: Let x X , and z = x - ff(x
x0 , where f(x0 ) is nonzero , z is in N(f) as by linearity of f ,
0)
(x)
f(z)= f(x) - f( ff(x
x0 ) = f(x) 0)
proved the existence part .

f (x)
f (x0 ) f(x0 )

= 0 . x =

f (x)
f (x0 ) x0

+ z ,with taken to be

f (x)
f (x0 )

, we have

10 part) , if x
c1 = x
c2 in X/N(f) , then x1 = x2 + z , z in N(f) . then f(x1 ) = f(x2 ) + f(z) =
f(x2 ) .
part) if N(f) = X , we are done . If not ,we may suppose x0 not in N(f) , by question 9 let x1 = 1 x0
+ y1 , x2 = 2 x0 + y2 ,where i F, yi N(f) . Then f(x1 ) = 1 f(x0 ) = f(x2 ) = 2 f(x0 ) , f(x0 ) 6= 0
1

1 = 2 ,and x1 - x2 = y1 - y2 is in N(f) ,i.e x1 and x2 are in same element of X/N(f) . As in question 9

\
(x)
(x)
(x)
(x)
, x = ff(x
x0 + z , z in N(f) , x - ff(x
x0 is in N(f) , so x
b = ff(x
x0 = ff(x
x
c0 in X/N(f) , and X/N(f)
0)
0)
0)
0)
is spanned by the element x
c0 which is non trivial , so codim N(f) = dim(X/N(f)) = 1 .
14 Note f 6= 0 , H1 is non empty , de is a real number and > 0 , if it is 0 then there is sequence of
xn in H1 s.t kxn k 0 but f (xn ) = 1 9 0 , contradicting to the boundedness of f . To show kf k 1e ,

d
|f (x)|
|f (x)|
1
1
1
x

,
case
2
f
(x)
=
6
0
,
=

as
f
(
x
kxk
kxk
k f (x) k
f (x) )
de
de
1
1
= 1 , now take supremum over x 6= 0 , kf k e . To show kf k e , pick a sequence xn in H1 s.t the
d
d
e k 1 , therefore kf k 1 . With
e k de|f (xn )| = de 1 1 as n + , dkf
norm of xn tend to de , dkf
kxn k
kxn k
de
above result , kf k = 1e .
d

x in X , case 1 f (x) = 0 ,we must have

P116 6 , 11
6 By observation , f((1,0,1)) = 1 + 0 - 1 = 0 , and f((0,1,1)) = 0 + 1 - 1 = 0 , they are in N(f)
and are linearly independent . f(x) = 0 1 + 2 3 = 0 x = (1 , 2 , 1 + 2 ) x = 1 (1, 0, 1) +
2 (0, 1, 1) , so the 2 vectors span the null space of f , (1,0,1),(0,1,1) is a basis of the null space of f .
11 If x 6= y , let v = x - y 6= 0 , extend it to a basis ei , i=1,2,...n of X s.t e1 = v . Consider the
dual basis fi of the basis ei , i=1,2,...n (Please refer to textbook P114) , we have f1 (x) f1 (y) = f1 (v)
= 1 6= 0 , ie f1 (x) 6= f1 (y) .

P124 8
0

8 We define a mapping from c0 to l1 and show that it is an isometry . Let ei be element which
0
is 1 in the ith entry but zero otherwise , ei i= 1,2,3,.... is a schauder basis of c0 , f in c0 , define (f ) by
(f (e1 ), f (e2 ), f (e3 ), ...., f (ej ), f (ej+1 ), ....) , show that it is well defined , ie (f (e1 ), f (e2 ), f (e3 ), ...., f (ej ), f (ej+1 ), ....)
|f (e )|
is in l1 , under this f , consider a sequence xn in c0 , for j n , xn(j) = f (ejj ) if f (ej ) 6= 0 , xn(j) = 0
Pn
otherwise . for j > n , xn(j) = 0 , obviously , xn is in c0 and for nonzero f , kxn k = 1 , j=1 |f (ej )|
P+
= f (xn ) kf kkxn k = kf k < + , let n go to ,
j=1 |f (ej )| kf k < +........(*) (note the
inequality is also true for f = 0) , therefore (f (e1 ), f (e2 ), f (e3 ), ...., f (ej ), f (ej+1 ), ....) is in l1 . x
P+
P
c0 , unique sequence xi in F , s.t x = i=1 xi ei , by boundedness of f , |f (x)| = | i=1 xi f (ei )|
P+
P+
i=1 |xi f (ei )| (
i=1 |f (ei )|)kxk = k(f )k1 kxk , with (*) k(f )k1 = kf k . Obviously is linear
1
and now P
norm preserving , so is injective
P+, for surjectivity
P+ , if (a1 , a2 , a3 , ....) is in l , for x in c0 , let
+
fa (x) = i=1 ai xi , well defined as i=1 |ai xi | ( i=1 |ai |)kxk = kak1 kxk , also fa is a bound
0
linear functional on c0 with fa (ei ) = ai , so (fa ) = a , is surjective and is an isometry , c0 = l1 .