Professional Documents
Culture Documents
Contents
Contents
2 Banach Spaces
15
3 Hilbert Spaces
27
3.1
Hilbert spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27
3.2
Weak convergence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
45
4.1
4.2
Linear Functionals . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
5 Fundamental Theorems
73
87
7 Compact Operators
99
113
131
143
1
www.MATHVN.com
CONTENTS
Notations:
B(X, Y ): the space of all bounded (continuous) linear operators from X to Y .
Image (T ) Ran(T ): the image of a mapping T : X Y .
w
xn
x: xn converges weakly to x.
X : the space of all bounded (continuous) linear functionals on X.
F or K: the scalar field, which is R or C.
Re, Im: the real and imaginary parts of a complex number.
www.MATHVN.com
Chapter 1
Normed and Inner Product Spaces
Problem 1.
Prove that any ball in a normed space X is convex.
Solution.
Let B(x0 ; r) be any ball of radius r > 0 centered at x0 X, and x, y B(x0 ; r).
Then
kx x0 k < r and ky x0 k < r.
For every a [0, 1] we have
kax + (1 a)y x0 k = k(x x0 )a + (1 a)(y x0 )k
akx x0 k + (1 a)ky x0 k
< ar + (1 a)r = r.
So ax + (1 a)y B(x0 ; r). .
Problem 2.
Consider the linear space C[0, 1] equipped with the norm
Z 1
kf k1 =
|f (x)|dx.
0
Prove that there is no inner product on C[0, 1] agreed with this norm.
3
www.MATHVN.com
Solution.
We show that the norm k.k1 does not satisfy the parallelogram law. Let
f (x) = 1 and g(x) = 2x.
Then
kf k1 =
0
while
kf gk1 =
0
1.dx = 1, kgk1 =
|2x|dx = 1,
0
1
|1 2x|dx = , kf + gk1 =
2
Thus,
kf gk21 + kf + gk21 =
|1 + 2x|dx = 2.
0
17
6= 2(kf k21 + kgk21 ) = 4.
4
Problem 3.
Consider the linear space C[0, 1] equipped with the norm
kf k = max |f (t)|.
t[0,1]
Prove that there is no inner product on C[0, 1] agreed with this norm.
Solution.
We show that the parallelogram law with respect to the given norm does not hold
for two elements in C[0, 1].
Let f (t) = t, g(t) = 1 t, t [0, 1]. Then f, g C[0, 1] and
kf k = max t = 1, kgk = max (1 t) = 1,
t[0,1]
t[0,1]
and
kf + gk = max 1 = 1, and kf gk = max | 1 + 2t| = 1.
t[0,1]
t[0,1]
Thus,
kf gk21 + kf + gk21 = 2 6= 2(kf k21 + kgk21 ) = 4.
Problem 4.
Prove that:
If the unit sphere of a normed space X contains a line segment [x, y] where x, y
X and x 6= y , then x and y are linearly independent and kx + yk = kxk + kyk .
www.MATHVN.com
Solution.
Since equivalence of norms is an equivalence relation, it suffices to show that an
arbitrary norm k.k on X is equivalent to the Euclidian norm P
k.k2 . Let {e1 , ..., en } be
a basis for X. Every x X can be written uniquely as x = nk=1 ck ek . Therefore,
!1/2
!1/2 n
n
n
X
X
X
kek k2
Akxk2 ,
|ck |2
|ek |kek k
kxk
k=1
k=1
k=1
P
1/2
where A = ( nk=1 |ek |2 ) is a non-zero constant. This shows that the map x 7 kxk
is continuous w.r.t. the Euclidian norm. Now consider S = {x : kxk2 = 1}. This is
just the unit sphere in (X, k.k2 ), which is compact. The map
S R defined by x 7 kxk
is continuous, so it attains a minimum m and a maximum M on S. Note that m > 0
because S 6= . Thus, for all x S, we have
m kxk M.
Now, for x X, x 6= 0,
x
kxk2
S, so
m
kxk
M.
kxk2
www.MATHVN.com
That is
mkxk2 kxk M kxk2 .
Hence, the two norms are equivalent.
Problem 6.
Let X be a normed space.
(a) Find all subspaces of X which are contained in some ball B(a; r) of X.
(b) Find all subspaces of X which contain some ball B(x0 ; ) of X.
Solution.
(a) Let Y be a subspace of X which is contained in some ball B(a; r) of X. Note
first that the ball B(a; r) must contain the vector zero of X (and so of Y ); otherwise,
the question is impossible. For any number A > 0 and any x Y , we have Ax Y
since Y is a linear space. By hypothesis Y B(a; r), so we have Ax B(a; r). This
implies that kAxk < r + kak. Finally
kxk <
r + kak
.
A
A > 0 being arbitrary, it follows that kxk = 0, so x = 0. Thus, there is only one
subspace of X, namely, Y = {0}, which is contained in some ball B(a; r) of X.
(b) Let Z be a subspace of X which contain some ball B(x0 ; ) of X. Take any
x B(0; ). Then x + x0 B(x0 ; ) and so x + x0 Z since Z B(x0 ; ). Now,
since x0 Z, x + x0 Z and Z is a linear space, we must have x Z. Hence
B(0; ) Z.
x
Now for any nonzero x X, we have 2kxk
B(0; ) Z. Hence x Z. We can
conclude that Z = X. In other words, the only subspace of X which contains some
ball B(x0 ; ) of X is X itself.
Problem 7.
Prove that any finite dimensional normed space :
(a) is complete (a Banach space),
(b) is reflexive.
Solution.
Let X be a finite dimensional normed space. Suppose dim X = d.
www.MATHVN.com
k=1
P
(n)
Let (x(n) ) be a Cauchy sequence in X. If for each n, x(n) = dk=1 ak ek then
!1/2
d
X (n)
(m)
0 as n, m .
kx(n) x(m) k =
|ak ak |2
k=1
(m)
|ak ak | 0 as n, m .
(n)
(0)
ak ak
Let a =
Pd
k=1
(0)
ak ek then x(n) a X.
k=1
k=1
d
X
fk (x)k , i.e., f =
Hence,
X ] d.
Pdim
d
Let
f = 0. Then, for any x X,
Pd k=1 k k
k ek , we obtain fk (x) =
k , and
x = k=1
k=1
k fk (x) =
k fk .
k=1
k=1
d
X
d
X
d
X
Pd
k=1
|k |2 = 0.
k=1
Hence, k = 0 for all k = 1, ..., d and thus, dim X ] = d. For the space X we have
X X ] , so dim X = n d and dim(X )] = n. From the relation X (X )
(X )] we conclude that d n. Thus, n = d, and so X = (X ) .
www.MATHVN.com
Solution.
(a) For the real field case, the polarization identity is
1
hx, yi = (kx + yk2 kx yk2 ). ()
4
We use the symmetry of the inner product and compute the right hand side of ():
1
1
(kx + yk2 kx yk2 ) =
hx + y, x + yi hx y, x yi
4
4
1
=
hx, yi + hy, xi
2
= hx, yi.
For the complex field case, we again expand the right hand side, using the relation
we just established:
i
1h
2
2
2
2
(kx + yk kx yk ) i(kx + iyk kx iyk )
4
i
1
= hx, yi + hy, xi hx, iyi + hiy, xi
2
2
1
1
i2
i2
= hx, yi + hy, xi hx, yi + hy, xi
2
2
2
2
= hx, yi.
(b) If the norm comes from an inner product, then we have
kx + yk2 + kx yk2 = hx + y, x + yi + hx y, x yi
= 2hx, xi + 2hy, yi + hx, yi + hy, xi hx, yi hy, xi
= 2(kxk2 + kyk2 ).
www.MATHVN.com
y+z yz
y+z yz
+
, x+z =x+
,
2
2
2
2
and we have
hx, yi + hx, zi =
+
=
1
kx + yk2 + kx yk2 kx yk2 kx zk2
4
i
kx + iyk2 + kx + izk2 kx iyk2 kx izk2
4
2
!
y + z 2
y z 2
y
+
z
y
+
z
1
x +
+
2 x 2 2
2
2
2
!
y + z 2
y z 2
i
y
+
z
y
+
z
x + i
+ i
2 x i 2 i 2
2
2
2 !
y + z 2 y z 2
1
y
+
z
y
+
z
x +
+
x
2
2
2
2
2
2 !
y + z 2 y z 2
i
y
+
z
y
+
z
x + i
+ i
i
x i
2
2
2
2
2
1
kx + y + zk2 + kxk2 kx (y + z)k2 kxk2
4
i
kx + i(y + z)k2 + kxk2 kx i(y + z)k2 kxk2
4
hx, y + zi.
1
kx + iyk2 kx iyk2 kx yk2 kx + yk2
4
4
= ihx, yi.
hx, iyi =
www.MATHVN.com
1
i
hx, xi = (k2xk2 ) |1 + i|kxk2 |1 i|2 kxk2 = kxk2 .
4
4
So this shows that the norm is induced by h., .i and that it is also positive definite,
and thus it is an inner product.
cn xn
x
n=1
Solution.
For every x X, we write
x=
N
X
n=1
N
X
hxn , xihxn , xk i
k=1
= hxn , xi hxn , xi = 0.
Therefore zxn . Then due to () we can write
x
N
X
n=1
c n xn =
N
X
|n=1
hxn , xi cn xn +z.
{z
zN
www.MATHVN.com
()
2
N
c
x
= kzN k2 + kzk2
n n
n=1
N
X
hxn , xi cn 2 + kzk2 ,
=
n=1
mM
mM
Problem 10.
Let X be a normed space and M a closed subspace of X. Let : X X/M
be the canonical map. Show that the topology induced by the standard norm on
X/M is the usual quotient topology, i.e. that O X/M is open in X/M if and
only if 1 (O) is open in X.
www.MATHVN.com
Solution.
If O is open in X/M , then 1 (O) is open in X since is continuous.
Now suppose that O X/M and that 1 (O) is open in X. We show that O is
open in X/M . Consider an open ball B(0; r), r > 0 in X. Let x B(0; r). Then
kxk < r, and so
k[x]k kxk < r.
On the other hand, if k[x]k < r, then there is an y M such that kx + yk < r.
Hence x + y B(0; r), and so
[x] = (x + y) B(0; r) .
If [x0 ] O, then x0 1 (O). Since 1 (O) is open in X, there is an r > 0 such
that
B(x0 ; r) 1 (O).
This implies that
Problem 11.
Let X = C[0, 1], M = {f C[0, 1] : f (0) = 0}. Show that X/M = C.
Solution.
Given [f ] X/M , let ([f ]) = f (0). Then the map : X/M C is well-defined.
Indeed, if [f ] = [g], then (f g)(0) = 0 so f (0) = g(0). It is clearly linear.
If f X, then g = f f (0) M , and so f g = f (0) is constant, which tells us
that
k[f ]k = |f (0)| = |([f ])|,
so is an isometry (and thus injective and continuous). Finally, constants are in
X = C[0, 1], so is surjective and thus an isometric isomorphism.
Problem 12.
P
If 0 < p < 1 then `p is a vector space but kxkp = ( n |xn |p )1/p is not a norm for
`p .
www.MATHVN.com
Problem 13.
Suppose that X is a linear space with inner product h., .i. If xn x and yn y
as n , prove that
hxn , yn i hx, yi as n .
Solution.
Using the Cauchy-Schwarz and triangle inequalities, we have
|hxn , yn i hx, yi|
www.MATHVN.com
Problem 14.
Prove that if M is a closed subspace and N is a finite dimensional subspace of a
normed space X, then M + N := {m + n : m M, n N } is closed.
Solution.
Assume dim N = 1, say N = Span{x}. The case x M is trivial. Suppose x
/ M.
Consider the sequence zk := k x + mk , where mk M, k C, and suppose
zk M + N y as k . We want to show y M + N . The sequence (k )
is bounded; otherwise, there exists a subsequence (k0 ) such that 0 < |k0 | as
k 0 . Then
zk 0
mk 0
and
0 as k 0 ,
k0
k0
so x must be 0, which is in M . This is a contradiction. Consequently, (k ) is bounded
and therefore it has a subsequence (k0 ) which is converging to some C. Thus
mk0 = zk0 k0 x y x as k 0 .
Hence, y x is in M since M is closed. Thus y M + N .
The solution now follows by induction.
www.MATHVN.com
Chapter 2
Banach Spaces
Problem 15.
Let
if the series
PX be a normed space. Prove that X is a Banach space if andPonly
Solution.
P
Suppose that
Pn X is complete. Let (an ) be a sequence in X such that n=1 kan k < .
Let Sn = i=1 ai be the partial sum. Then for m > n,
m
m
X
X
kSm Sn k =
ai
kai k.
i=n+1
i=n+1
P
Pm
By hypothesis, the series
n=1 kan k converges, so
i=n+1 kai k 0 as n .
Therefore, (Sn ) is P
a Cauchy sequence in the Banach space X. Thus, (Sn ) converges,
that is, the series
n=1
P an converges.
P
Conversely, suppose
n=1 an converges in X whenever
n=1 kan k < . We show
that X is complete. Let (yn ) be a Cauchy sequence in X. Then
1
whenever m > n1 ,
2
1
ym k < 2 whenever m > n2 > n1 .
2
n1 N : kyn1 ym k <
n2 N : kyn2
Continuing in this way, we see that there is a sequence (nk ) strictly increasing such
that
1
kynk ym k < k whenever m > nk .
2
15
www.MATHVN.com
In particular, we have
kynk+1 ynk k <
1
for all k N.
2k
kxk k =
k=1
n
X
k=1
n
X
1
.
k
2
k=1
It
k=1 kxk k < . By hypothesis, there is an x X such that
Pmfollows that
k=1 xk x as m . But we have
m
X
k=1
xk =
m
X
(ynk+1 ynk )
k=1
= ynm+1 yn1 .
Hence ynm x + yn1 in X as m . Thus, the sequence (yn ) has a convergent
subsequence and so must itself converges.
Problem 16.
Let X be a Banach space. Prove that the closed unit ball B(0; 1) X is compact
if and only if X is finite dimensional.
Solution.
Suppose dim X = n. Then X is isomorphic to Rn (with the standard topology).
The result then follows from the Heine-Borel theorem.
Suppose that X is not finite dimensional. We want to show that B(0; 1) is not
compact. To do this, we construct a sequence in B(0; 1) which have no convergent
subsequence.
We will use the following fact usually known as Rieszs Lemma: (See the proof below)
Let M be a closed subspace of a Banach space X. Given any r (0, 1), there exists an x X such
that
kxk = 1 and d(x, M ) r.
Pick x1 X such that kx1 k = 1. Let S1 := Span {x1 }. Then S1 is closed. According
to Rieszs Lemma, there exists x2 X such that
1
kx2 k = 1 and d(x2 , S1 ) .
2
www.MATHVN.com
x1 m1
kx1 m1 k .
1
x1 (m1 + kx1 m1 km)
{z
}
|
kx1 m1 k
M
d
d+
inf mM kx1 mk
d
.
kx1 m1 k
d+
Problem 17.
Let X be a Banach space and M a closed subspace of X. Prove that the quotient
space X/M is also a Banach space under the quotient norm.
Solution.
We use criterion established above (in problem 15). Suppose that ([xn ]) is any
www.MATHVN.com
P
n=1
[x] X/M :
k
X
[xn ] [x] as k .
n=1
For each n, k[xn ]k = inf zM kxn + zk, and therefore there is zn M such that
kxn + zn k k[xn ]k +
1
2n
kxn + zn k
n=1
X
n=1
k[xn ]k +
1
< .
2n
X
(xn + zn ) = x for some x X.
n=1
Then we have
k
[x
]
[x]
=
[x
x]
n
n
n=1
n=1
k
X
= inf (xn x + z)
zE
n=1
k
X
(xn x) + zn
n=1
k
X
= (xn + zn ) x 0 as k .
n=1
Hence
Pk
n=1 [xn ]
[x] as k .
www.MATHVN.com
SPACE `p
(Only properties concerning to norms and completeness will be considered. Other
properties such as duality will be discussed later.)
Problem 18.
Show that `p , 1 p < equipped with the norm k.kp is a Banach space.
Solution.
(i)
(i)
Let x(i) = (x1 , ..., xk , ...) for i = 1, 2, ... be a Cauchy sequence in `p . Then
kx(i) x(j) kp 0 as i, j .
(i)
(j)
(j)
k=1
k=1
()
! p1
(i)
|xk xk |p
< .
k=1
By Minkowskis inequality,
M
M
! p1 M
! p1
! p1
X
X (N )
X (N )
+
|xk |p
|xk xk |p
|xk |p
k=1
k=1
M
X
(N )
|xk
x k |p
k=1
< +
k=1
! p1
k=1
! p1
(N )
|xk |p
k=1
www.MATHVN.com
! p1
(N )
|xk |p
! p1
X
kxkp =
< .
|xk |p
k=1
! p1
X (i)
< .
kx(i) xkp =
|xk xk |p
k=1
Problem 19.
(a) Show that ` equipped with the norm k.k is a Banach space.
(b) Let c0 be the space of sequences converging to 0. Show that c0 is a closed
subspace of ` .
Solution.
(a) We need to show that ` is complete. Assume that the sequence (x(n) ) is Cauchy
in ` . That is, for all > 0, there exists N N such that
(1) n, m N kx(n) x(m) k < .
(n)
(n)
(m)
So, for a fixed j, the sequence (xj ) is Cauchy, and therefore convergent in C.
Denote
(n)
xj := lim xj , and x := (x1 , x2 , ...).
n
(m)
(n)
www.MATHVN.com
kx(N ) xk < .
2
(N
)
(N
)
(N
)
Since x(N ) = (x1 , x2 , ...) c0 we have xj 0 as j . Therefore, choose
J N such that
(N )
j J |xj | < .
2
Then, for j J,
(N )
(N )
(N )
|xj | |xj xj | + |xj | kx x(N ) k + |xj | < + = .
2 2
Therefore, x = (x1 , x2 , ...) c0
Problem 20.
(a) Let c00 be the space of sequences such that if x = (xn )nN c00 then xn = 0
for all n n0 , where n0 is some integer number. Show that c00 with the norm
k.k is NOT a Banach space.
(b) What is the closure of c00 in ` ?
Solution.
We observe that c00 c0 ` .
(a) Consider the sequence x(n) defined by
1 1
1
x(n) = 1, , , ..., , 0, 0, ... c00 .
2 3
n
Then, for n, m N ,
(
1
if n m,
kx(n) x(m) k = m+1
1
if n m.
n+1
In both cases we have for any N > 0
kx(n) x(m) k
1
for n, m N.
N +1
1 1
1
1
1
,
, ... ` .
x = 1, , , ..., ,
2 3
n n+1 n+2
www.MATHVN.com
This tells us that there is a Cauchy sequence in c00 which does not converge to
something in c00 . Therefore, c00 equipped with the k.k norm is not a Banach
space.
(b) We claim that c00 = c0 (closure taken in ` ).
According to Problem 19, c0 is closed, so we have c00 c0 . We show the inverse
inclusion. Take an arbitrary sequence x = (x1 , x2 , ...) c0 . We build a sequence a(n)
from x as follows:
a(n) = (x1 , x2 , .., xn , 0, 0....).
It is clear that a(n) c00 . Now since the sequence x converges to 0, given any > 0,
there exists N N such that
|xi | < for i N.
Then
ka(n) xk = sup |xi | .
iN
Problem 21.
Prove that:
(a) If 1 S
p < q < , then `p `q and kxkq kxkp .
(b) If x 1p< `p then kxkp kxk as p .
Solution.
(a) Let x = (x1 , x2 , ...) `p . Then, for n large enough, we have |xn | < 1 and hence
|xn |q |xn |p since 1 p < q < . That implies x `q . Now we want to show
X
Let an = |xn |p and =
q
p
|xn |q
1/q
|xn |p
1/p
an
an
www.MATHVN.com
1
an (max an )
an
an
an =
an .
(b) Let x = (x1 , x2 , ...) `p0 for some p0 . Clearly, kxkp maxn |xn | = kxk for any
finite p. On the other hand,
!1/p
!1/p
pp0
p0
X
X
p
p
p
p0
0
kxkp =
|xn |p
kxkpp
|x
|
=
kxk
kxk
kxk .
p
n
0
Problem 22.
Prove that:
(a) If 1 p < then `p is separable.
(b) ` is not separable.
Solution.
p
(a) First we show that E := {x
P ` : xn = 0, n N for some N } is dense
p
p
in ` . Indeed, if x ` , x = k=1 xk ek , where ek is the sequence such that the
k-component is 1 and the others are zero, then
!1/p
n
X
X
xk ek =
|xk |p
0 as n .
x
k=1
Pn
k=n+1
www.MATHVN.com
Solution.
(a) Let (fn ) be a Cauchy sequence in C[0, 1] with respect to the uniform norm. Then
for any > 0, there exists N N such that
kfm fn k < for m, n N.
Therefore
()
This shows that for every x [0, 1], the sequence fn (x) is a Cauchy sequence of
numbers and therefore converges to a number which depends on x, say, f (x). In
(), fix n and let m , we have
()
x[0,1]
www.MATHVN.com
www.MATHVN.com
www.MATHVN.com
Chapter 3
Hilbert Spaces
3.1
Hilbert spaces
Problem 24.
Let M be a closed subspace of a Hilbert space H. Prove that:
(a) (M ) = M.
(b) If codim M := dim H/M = 1 then dim M = 1.
Solution.
(a) In general, if M is a subset of H then M (M ) . Indeed,
M := {x X : xM }.
So we have
x M xM x (M ) .
Now suppose M is a closed subspace of H and x (M ) . Since x H = M M ,
we have
x = u + v, u M, v M .
Since M (M ) we have
x = u + v, u (M ) , v M .
Since x u (M ) and v M and v = x u we obtain
v M (M ) ,
27
www.MATHVN.com
Problem 25.
Let T : H1 H2 be an isometry of two Hilbert spaces H1 and H2 , i.e., kT xk =
kxk for every x H1 . Prove that
hT x, T yi = hx, yi for every x, y H1 .
Solution.
By hypothesis, we have
kT (x + y)k2 = kx + yk2 for every x, y H1 .
By opening up the norm using the inner product, we obtain
RehT x, T yi = Rehx, yi.
Similarly, kT (x + iy)k2 = kx + iyk2 gives that
ImhT x, T yi = Imhx, yi.
Hence,
hT x, T yi = hx, yi.
Problem 26.
Let C be a closed convex set in a Hilbert space H. Show that C contains a unique
element of minimal norm.
Solution.
Let = inf zC kzk.
www.MATHVN.com
29
2 kzj k2 + kzk k2 4 2 4 2 4 2 = 0 as j, k .
Thus the sequence (zj ) is Cauchy, so converges to some z H. Since C is closed,
z C. The norm function is continuous, so kzk = . This shows that C contains
an element of minimal norm.
Assume that there are two elements a1 , a2 C such that ka1 k = ka2 k = . By the
above we have
ka1 + a2 k2 4 2 .
By the parallelogram law we have
Problem 27.
Let 1 p < . Prove that `p is a Hilbert space if and only if p = 2.
Solution.
Suppose p = 2. In the space `2 the inner product is defined by
hx, yi =
i=1
www.MATHVN.com
hx, xi =
! 12
|xi |2
i=1
Problem 28.
Consider the Hilbert space H = L2 [1, 1] equipped with the usual scalar product:
Z 1
hx, yi =
x(t)y(t)dt, x, y H.
1
R1
Let M = {x H : 1 x(t)dt = 0}.
(a) Show that M is closed in H. Find M .
(b) Calculate the distance from y to M for y(t) = t2 .
Solution.
(a) Let 1 H be the function 1(t) = 1, t [1, 1]. Define the map T : H C
by
x 7 h1, xi.
www.MATHVN.com
31
Z 1
|T x| =
1(t)x(t)dt
|1(t)| |x(t)|dt
1
21 Z
1dt
|x2 (t)|2 dt
12
2kxk2 .
Problem 29.
Consider the Hilbert space H = L2 [1, 1] equipped with the usual scalar product:
Z 1
f (t)g(t)dt, f, g H.
hf, gi =
1
Solution.
(a) Define f(t) := f (t). Define the map
S : H H defined by Sf = f.
Clearly, S is linear. S is bounded, so continuous. Indeed,
Z
kSf k2 = kfk2 =
1
1
|f(t)|2 dt
12
|f (t)| dt
1
www.MATHVN.com
21
= kf k2 .
(t)(t)dt = 0,
so that .
1 t
2
2
t
dist(h, E)
=
2 (e e )
Z
1 1 t
=
|e et |2 dt
4 1
1 2
=
(e e2 4).
4
Thus,
dist(h, E) =
1 2
e e2 4.
2
Problem 30.
Let H be a Hilbert space and M be a closed subspace of H. Denoting by P :
H M the orthogonal projection of H onto M, prove that, for any x, y H,
hP x, yi = hx, P yi.
(This is telling us that P is self-adjoint).
Solution.
We know that if M is a closed subspace of H, then
www.MATHVN.com
33
y = yM + yM
P y = yM .
Problem 31.
Let H be a Hilbert space and A H a closed convex non-empty set. Prove that
PA : H H is non-expansive, i.e.,
kPA (x) PA (y)k kx yk, x, y H.
(PA is the orthogonal projection on A).
Solution.
We claim:
()
D
E
Re x PA (x), PA (x) a 0, x H, a A.
www.MATHVN.com
Hence () is proved.
Replacing a with PA (y) in (), we obtain
D
E
(3.1)
Re x PA (x), PA (x) PA (y) 0.
Analogously,
And therefore,
(3.2)
D
E
Re y PA (y), PA (y) PA (x) 0.
D
E
Re PA (y) y, PA (x) PA (y) 0.
Problem 32.
Let X be a Hibert space, and G1 G2 ... Gn ... be a sequence of closed
linear subspaces of X. Let
G = Span
!
Gn .
nN
www.MATHVN.com
35
Solution.
(a) Let
A = Span
!
Gn
nN
Then we have
= d(x, A).
d(x, G) = d(x, A)
S
nN
S
Gn , we can find 1 , ..., k K and x1 , ..., xk nN Gn such
a = 1 x1 + ... + k xk .
Then there are n1 , ..., nk N such that x1 Gn1 , ..., xk Gnk . Let n = max{n1 , ..., nk }.
By hypothesis, the sequence (Gn ) is increasing , so we have Gn1 , ..., Gnk Gn , so
x1 , ..., xk Gn . And since Gn is a linear space,
a = 1 x1 + ... + k xk Gn .
That is,
()
d(x, G) d(x, Gn ), n N.
www.MATHVN.com
Hence,
d(x, G) = inf d(x, Gn ).
nN
From Gn Gn+1 , it follows that d(x, Gn+1 ) d(x, Gn ). The sequence of real
numbers d(x, Gn ) , which is decreasing and bounded below, must converge to its
infimum. Thus
lim d(x, Gn ) = d(x, G).
n
Problem 33.
Let H be a Hilbert space.
(a) Prove that for any two subspaces M, N of H we have
(M + N ) = M N .
(b) Prove that for any two closed subspaces E, F of H we have
(E F ) = E + F .
Solution.
(a) If x (M + N ) , then for every m M and n N we have
hm + n, xi = 0
since m + n M + N . For n = 0 we have hm, xi = 0. This holds for all m M , so
x M . Similarly x N . Thus x M N , and hence (M + N ) M N .
If x M N , then we have
hm, xi = 0 and hn, xi = 0, m M, n N.
www.MATHVN.com
37
Hence
hm + n, xi = 0.
This means that x (M + N ) . Hence M N (M + N ) .
(b) From part (a) it follows that
M + N = (M N ) .
Setting E in the place of M and F in the place of N , we obtain
E + F = (E F ) .
Problem 34.
A system
Pn {xi }iN in a normed space X is called a complete system if
Span { i=1 i xi : n N, i F} is dense on X.
If {xi }iN is a complete system in a Hilbert space H and xxi for every i, show
that x = 0.
Solution.
P
P
Given x X, if xxi for every i, then x Span { ni=1 i xi }. Let D := Span { ni=1 i xi }.
By definition, D = X. Then there exists a sequence (xn ) in D converging to x and
xxn for every n. Hence
0 = hx, xn i hx, xi = kxk2 as n .
Thus x = 0.
Problem 35.
Let H be a Hilbert space and {i }
i=1 an orthonormal system in H. Show that
kn m k = 2 for m 6= n.
Solution.
Using orthogonality and the fact that kk k = 1, k N, we get for n 6= m,
kn m k2 = hn m , n m i
= hn , n i hn , m i hm , n i + hm , m i
= kn k2 + km k2 = 2.
www.MATHVN.com
Problem 36.
Let {ei }iN be an orthonormal set in a Hilbert space H. Prove that
i=1
Solution.
Using the Cauchy-Schwarz inequality for `2 and the Bessel inequality for H, we have
|hx, ei ihy, ei i|
i=1
|hx, ei i|2
! 12
X
i=1
! 21
|hx, ei i|2
i=1
1
1
kxk 2 kyk2 2 = kxk kyk.
2
Problem 37.
Let H be a Hilbert space and A and B be any two subsets of H. Show that
(a) A is a closed subspace of H.
(b) A (A ) := A .
(c) A B B A .
(d) A = A = A .
Solution.
(a) Let x, y A and , F. Then for any a A,
hx + y, ai = hx, ai + hy, ai
= hx, ai + hy, ai = 0.
Hence x + y A , so A is a subspace of H.
We show now that A is closed. Suppose that the sequence (xn ) in A converges
to some x H. Since hxn , ai = 0 for all a A, by continuity of the inner product,
we have
hx, ai = h lim xn , ai = lim hxn , ai = 0.
n
So x A , and A is closed.
www.MATHVN.com
39
A A .
(i)
A A = A A .
(i) and (ii) complete the proof.
(ii)
Problem 38.
Solution.
(a) Take any x = (xn ), y = (yn ) M . It is clear that for any scalars , ,
(x + y)2n = x2n + y2n = 0.
That gives that x + y M . Hence M is a linear subspace of `2 .
(k)
Let us prove that it is closed. Take x M . There exists a sequence x(k) = (xn ) M
(k)
converging to x as k . Since x2n = 0, we obtain
(k)
www.MATHVN.com
X
X
n=0
z2n+1 = 0, n = 0, 1, 2, ...
Therefore
M = {z = (zn ) `2 : z2n+1 = 0, n = 0, 1, 2, ...}.
Problem 39.
Let V be a subspace of a Hilbert space.
Solution.
(a) From Problem 37d we get (a).
(b) If V is dense, then V = H. Hence
V =V
= H = {0}.
= V = {0}.
3.2
Weak convergence
Problem 40.
Prove that in any finite dimensional vector space, strong convergence and weak
convergence are equivalent.
www.MATHVN.com
41
Solution.
Consider first the case that X = Fd under the Euclidian norm k.k2 . Suppose that
the sequence (xn ) converges weakly to x in Fd . Then for each standard basis vector
ek , k = 1, 1, .., d, we have
hxn , ek i hx, ek i as n .
That is, weak convergence implies componentwise convergence. But since there are
only finitely many components, this implies norm convergence, since
kxn xk22 =
d
X
k=1
For the general case, choose any basis {e1 , e2 , ..., ed } for X, and then use the fact that
all norms on X are equivalent to define an isomorphism between X and Fd .
Problem 41.
Show that if the sequence (xn ) in a normed space X is weakly convergent to
x0 X, then
lim inf kxn k kx0 k.
n
Solution.
If x0 = 0 then kx0 k = 0 and the statement is obviously true. Now assume kx0 k 6= 0.
By a well known theorem 1 , there is some f X such that
kf k = 1,
f (x0 ) = kx0 k.
But
f (xn ) |f (xn )| kf k kxn k = kxn k.
1
(Kreyszig, p 223) Let X be a normed space and x0 6= 0 be an element in X. Then there exists
a bounded linear functional f X such that
kf k = 1,
f (x0 ) = kx0 k.
www.MATHVN.com
Hence,
lim inf kxn k lim f (xn ) = kx0 k.
n
Note.
If X = H is a Hilbert space, using the definition of weak convergence we can have
different solution.
kx0 k2 = hx0 , x0 i = lim hx0 , xn i.
n
Thus
kx0 k lim inf kxn k.
n
Problem 42.
Let X and Y be normed spaces, T B(X, Y ) and (xn ) a sequence in X. Show
w
w
that if xn
x, then T xn
Tx
Solution.
Recall: Definition of weak convergence in a normed space:
w
xn
x f (xn ) f (x), f X .
We must show that
(T xn ) (T x), Y .
That is,
( T )xn ( T )x, Y .
w
Problem 43.
w
x. Show
Let H be a Hilbert space and (xn ) be a sequence in H. Suppose xn
that
lim kxn xk = 0 kxk lim sup kxn k
(1).
n
www.MATHVN.com
43
Solution.
By Problem 41 we have
kxk lim inf kxn k.
n
So the right hand side of (1) is equivalent to kxk = limn kxn k. Now note that
(i) kxn xk2 = kxn k2 2Rehxn , xi + kxk2
www.MATHVN.com
www.MATHVN.com
Chapter 4
Linear Operators - Linear
Functionals
4.1
Problem 44.
Let (X, k.k1 ) and (Y, k.k2 ) be norm spaces, and T B(X, Y ). We define kT k as
kT k := inf {M : kT xk2 M kxk1 }.
xX
kxk1 1
kT xk2
.
x6=0 kxk1
sup
xX,
Solution.
(a) We have
kT xk2
M, for all x 6= 0, x X.
kxk1
45
www.MATHVN.com
By definition,
kT k := inf {M : kT xk2 M kxk1 } =
xX
Now, let y =
x
kxk1
kT xk2
x6=0 kxk1
sup
xX,
(i).
kT xk2
kxk
y
1
= sup kT yk2 = sup kT xk2
kT k = sup
= sup
T
kxk1 2 kyk=1
xX, x6=0 kxk1
kxk=1
kyk=1
(ii).
kxk1 1
kT xk2
kT xk2
sup
= kT k.
xX, x6=0 kxk1
kxk1 1 kxk1
sup
xX,
Thus,
kT k = sup kT xk2 .
kxk1 1
(b) Let
B := {x X : kxk1 1} and B o := {x X : kxk1 < 1}.
Since kT k = supxB kT xk2 , there exists a sequence (xn ) in B such that
kT k = lim kT xn k2 .
n
Consider the sequence (yn ) defined by yn = (1 21n )xn . It is clear that yn B o for
all n N. Moreover,
1
1
xB o
xB o
xB
www.MATHVN.com
47
Problem 46.
Let H = `2 be the well known Hilbert space. Consider the left shift defined by
L : `2 `2 , x = (x1 , x2 , x3 , ...) 7 Lx = (x2 , x3 , ...).
(a) Show that L is a linear bounded operator. Find kLk.
(b) Define the right shift and answer the same question as in part (a).
Solution.
We answer only the first part.
It is easy to check the linearity of L.
For any x = (x1 , x2 , x3 , ...) `2 , we have
2
|xn |2
n=2
|xn |2 = kxk2 .
n=1
Hence
kLxk kxk, x `2 .
This implies that T is bounded, and
kLk 1.
()
()
kxk=1
Problem 47.
Let X = C[0, 1] with the max-norm (the uniform norm). We define the integral
operator
Z x
K : X X by Kf (x) =
f (y)dy.
0
www.MATHVN.com
Solution.
The operator K is bounded. Indeed,
Z x
Z
kKf k sup
|f (y)|dy
x[0,1]
|f (y)|dy kf k.
0
Hence kKk 1.
In fact, kKk = 1, since 1 X, K1 = x and so kK1k = kxk = 1.
**Problem 48.
Let X = L2 [0, 1] with the norm k.k2 . We define the integral operator
Z x
A : X X by Af (x) =
f (y)dy.
0
Solution.
Warning: Its completely different from the previous problem!!!
First solution: Using Cauchy-Schwarz inequality, we get
2
2
Z 1 Z t
Z 1 Z t r
s
f
(s)
f (s)ds dt =
p
cos
.
ds
kAf k22 =
dt
2
cos
0
0
0
0
2
Z t
Z 1 Z t
|f (s)|2
s
cos ds
s ds dt
2
0 cos 2
0
0
Z Z t
t |f (s)|2
2 1
sin .
=
ds dt
0
2 cos s
0
2
Z Z 1
2 t
t |f (s)|2
sin
=
dt ds
0
2 cos s
0
2
Z Z 1
t
|f (s)|2
2 t
sin dt
ds
=
0
2
cos s
0
2
2 Z t
2
|f (s)|2
=
s ds.
0 cos 2
Equality holds for f (s) = cos s
. Thus
2
kAk =
2
.
www.MATHVN.com
49
p
Second solution: We find the norm of T = A A, then kAk = kT k.
Since A is compact (we will see this somewhere later) and A A is self adjoint, we
have that T is a compact, normal operator. Hence, its spectrum is countable with
0 as the only possible cluster point and kT k is equal to the spectral radius of T .
These two facts together imply that
f (y)dy.
A f (x) =
x
Hence
Z
()
T f (x) =
f (z)dz dy.
x
d2
d2
2 f (x) = 2
dx
dx
1
x
y
0
d
f (z)dz dy =
dx
f (z)dz
= f (x), C \ {0}.
By a theorem from differential equations, we know that there are only two linearly
independent solutions to the above differential equation over C, namely, eix and
eix , where 2 = , , 6= 0. Hence the general solution to the above equation is
www.MATHVN.com
ix
+ e
ix
) =
=
=
=
=
Zx 1 0 iz
e
eiz y
dy
i
i
0
x
Z 1 iy
iy
e
e
dy
i
i
i i
x
iy
eiy
1
y
2
2
i i
x
i
i
e
e
2
2
i i
ix
ix
e
2
2
i i
ix
ix
(e + e
)+
x
2
i i
i
ei
.
2
2
i i
ei
= 0, x [0, 1],
i i
2
2
i i
which implies = . Hence
eix + eix = 2 cos x.
Moreover, we must have that T f (1) = 0 for any eigenvector f by (), so 2 cos = 0.
Since 6= 0, we must have that
=
(2n + 1)
, n Z.
2
4
(take n = 0, 1).
2
www.MATHVN.com
51
4
2
and kAk = .
2
Problem 49.
Let a, b be real numbers such that a < b. Consider the Hilbert space L2 [a, b] over
R and the operator T : L2 [a, b] R defined by
Z
Tf =
Solution.
(a) By Holders inequality, we have
Z b
|T f | =
f (x)dx
a
Z b
|1.f (x)|dx
1/2 Z
1 dx
1/2
|f (x)|
b a kf kL2 .
kT k(L2 ) b a.
1
Now consider the function h(x) = ba
, x (a, b). It is obviously that h L2 (a, b)
and
Z b
Z b
1/2
1
1
dx = b a.
khkL2 =
(b a)
= 1 and |T h| =
ba
a
a
Hence,
www.MATHVN.com
Therefore,
kT k(L2 ) =
b a.
(b) By the Rieszs Theorem, there exists a function g L2 [a, b] such that T f =
hf, gi for all f L2 [a, b]. Here, functions are real-valued, so we can write
Z b
Z b
T f = hf, gi
f (x)dx =
f (x)g(x)dx.
a
It is evident that the above equation is satisfied for all f L2 [a, b] if we choose
g(x) = 1 on [a, b]. By the uniqueness of this representation guaranteed by Rieszs
Theorem, we can definitely conclude that
g(x) = 1, x [a, b].
Also, we can verify that
Z
1/2
1 dx
kgkL2 =
b a = kT k(L2 ) .
Problem 50.
Let X, Y be normed spaces and T B(X, Y ). Consider the following statement:
T is an isometry kT k = 1.
Do you agree with it? Why?
Solution.
The direct way () is correct. Indeed, suppose that T is an isometry; then
kT kB(X,Y ) =
=
sup kT xkY
xX
kxkX =1
sup kxkX
xX
kxkX =1
= 1.
The other way () is false. The left shift on `2 is a counter-example (see Problem
40).
www.MATHVN.com
53
Problem 51.
Define T : C[0, 1] C[0, 1] by
Z
(T x)(t) = t
x(s)ds.
0
Solution.
(a) For all x1 , x2 C[0, 1] and all 1 , 2 R and all t [0, 1] we have
Z
T (1 x1 + 2 x2 )(t) = t
(1 x1 + 2 x2 )(s)ds
Z t
Z t
x2 (s)ds
x1 (s)ds + 2 t
= 1 t
0
Z t
kT xk = max t
x(s)ds max |t|
|x(s)|ds
t[0,1]
t[0,1]
0
0
Z t
max t
kxkds = max t2 kxk = kxk.
t[0,1]
t[0,1]
Hence T is a bounded
with kT k 1. Moreover, if x(t) = 1, t [0, 1] then kxk = 1
Rt
and (T x)(t) = t 0 ds = t2 , therefore, kT xk = maxt[0,1] t2 = 1. Thus,
1 = kT xk kT kkxk and so kT k 1.
Hence we have proved that kT k 1 and kT k 1, so kT k = 1.
(b) Suppose that x C[0, 1] satisfies
Z
T x = 0, i.e., t
www.MATHVN.com
Rt
It follows that 0 x(s)ds = 0, t (0, 1]. By differentiation w.r.t. t we get x(t) =
0, t (0, 1]. Since x(t) is continuous, we then also have x(0) = 0. Hence, x = 0.
We have thus proved
x C[0, 1], T (x) = 0 x = 0.
Hence, T 1 exists.
Now we show that T 1 is not bounded. Given any n N, we let xn (t) = tn . Then
xn C[0, 1] and kxn k = max |tn | = 1.
t[0,1]
We let
yn (t) = T xn (t) = t
0
Then
sn ds =
1
tn+2 .
n+1
1
n+2
kyn k = max
t =
.
t[0,1] n + 1
n+1
Problem 53.
Let 1 < p < and q be its exponent conjugate. For f Lp (0, ), let
Z
Z 1
1 x
(T f )(x) =
f (t)dt =
f (tx)dt.
x 0
0
Show that
(a) T f is well-defined on (0, ), and that T f is continuous with respect to x.
(b) T f Lp (0, ).
(c) T is a bounded linear operator from Lp (0, ) to itself. Calculate its norm.
(Hint: Use fn = x1/p {1xn} .)
www.MATHVN.com
55
Solution.
Rx
(a) For f Lp (0, ), we need to show : x 7 0 f (t)dt is well-defined and
continuous w.r.t. x. By Holders inequality we have
Z x
|f (t)|dt |x|1/q kf kp < ,
0
|f (t)|dt |x y|1/q kf kp .
f (t)dt
(x) (y)| =
x
(0,)
0
1
=
(0,)
0
1
kf kp
1
|f (x)||g(x/t)|dtdx
t
kg(./t)kq
0
But
dt
.
t
1/q
Z
q
|g(x/t)| dx
kg(./t)kq =
= t1/q kgkq .
(0,)
Thus,
Z
Hence, T f Lp (0, ).
(c) By the last inequality we have
kT f kp qkf kp .
www.MATHVN.com
1/p p
x
dx = ln n.
min{x,n}
t1/p dt = q
min{x, n}1/q 1
.
x
1
[(T fn )(x)] dx = q
dx + (n1/q 1)p
(1 x
)
x
(0,)
1
1
p
p
q ln n +
q p1
p
1
p
p
q kfn kp +
.
q p1
p
1/q p
x dx
n
Problem 54.
2
Let (cj )
j=1 be a sequence of complex numbers. Define an operator D on ` by
Dx = (c1 x1 , c2 x2 , ...) for x = (x1 , x2 , ...) `2 .
Prove that D is bounded if and only if (cj )
j=1 is bounded, and in this case kDk =
supj |cj |.
Solution.
www.MATHVN.com
57
Suppose (cj )
j=1 is bounded. Let M = supj |cj | < . Then
!1/2
!1/2
X
X
|cj |2 |xj |2
kDxk =
|cj xj |2
=
j=1
j=1
!1/2
M 2 |xj |2
=M
j=1
!1/2
|xj |2
j=1
= M kxk.
Hence, D is bounded and kDk M .
Suppose D is bounded. We want to show that (cj )
j=1 is bounded. Consider the
vector ej = (0, 0, .., 0, 1, 0, ...) where the number 1 appears at the j-th coordinate.
Clearly kej k = 1 and kDej k = |cj | for all j = 1, 2, .. Since D is bounded,
|cj | = kDej k kDk for any j = 1, 2, ...
Hence (cj )
j=1 is bounded and M = supj |cj | kDk. Finally
kDk = M.
Problem 55.
Prove that B(F, Y ) is not a Banach space if Y is not complete.
Hint: Take a Cauchy sequence (yn ) in Y which does not converge and consider the sequence
of operators (Bn ) defined by :
Bn := yn ; F.
Solution.
We follow the suggestion above. It is easy to see that
Bn B(F, Y ) and kBn k = kyn k, n N.
Since (Bn Bm ) = (yn ym ), we have
kBn Bm k = kyn ym k, n N.
Therefore (Bn ) is a Cauchy sequence in B(F, Y ). Suppose there exists B B(F, Y )
such that kBn Bk 0 as n . Let y := B1 Y , where 1 is the unit element
in F. Then
kyn yk = kBn 1 B1k kBn Bk 0 as n ,
www.MATHVN.com
i.e., the sequence (yn ) converges to y. This contradiction proves that (Bn ) cannot
be convergent. Hence, B(F, Y ) is not a Banach space.
Problem 56.
Let T1 , T2 , ... be the following bounded linear operators `1 ` :
T1 (x1 , x2 , x3 , ...) = (x1 , x1 , x1 , x1 , ...)
T2 (x1 , x2 , x3 , ...) = (x1 , x2 , x2 , x2 , ...)
T3 (x1 , x2 , x3 , ...) = (x1 , x2 , x3 , x3 , ...)...etc
Prove that the sequence (Tn ) is strongly operator convergent. Also prove that
(Tn ) is not uniformly operator convergent.
Solution.
Let T : `1 ` be the bounded linear operator given by
T (x1 , x2 , x3 , ...) = (x1 , x2 , x3 , ...).
T is obviously linear. It is bounded with norm kT k 1. Indeed, if x = (x1 , x2 , x3 , ...)
`1 then
X
|xk | = kxk1 < , so |xk | kxk1 , k = 1, 2, ...
k=1
Hence,
kxk kxk1 .
We claim that (Tn ) strongly operator converges to T .
For any x = (x1 , x2 , x3 , ...) `1 ,
kTn x T xk = k(0, ..0, xn xn+1 , xn xn+2 , ...)k
= sup |xn xn+j |.
j1
P
Since x = (x1 , x2 , x3 , ...) `1 ,
k=1 |xk | < , so we have limk |xk | = 0. Hence,
given any > 0, there is some K N such that
|xk | , for all k K.
Then if n K we have
n + j K, j N.
www.MATHVN.com
59
Hence,
|xn xn+j | |xn | + |xn+j | 2.
Thus, for n K,
kTn x T xk = sup |xn xn+j | 2.
j1
In other words,
lim kTn x T xk = 0.
This is true for every x `1 . Hence, the sequence (Tn ) is strongly operator convergent to T .
It follows from this that if (Tn ) would be uniformly operator convergent, then the
limit must be equal to T . We show that this is not true. Now we have
(Tn T )(x) = (0, .., 0, xn xn+1 , xn xn+2 , ...).
In particular, if x = (0, .., 0, 1, 0, ..) with 1 at the n-th position, then
(Tn T )(x) = (0, .., 0, 1, 1, ...).
Here kxk1 = 1 and k(0, .., 0, 1, 1, ...)k = 1. Hence,
kTn T k 1, for all n.
Thus, (Tn ) is not uniformly operator convergent.
Problem 57.
Let H1 and H2 be two Hilbert spaces. Let {a1 , ..., an } be an orthonormal system of
H1 and {b1 , ...,n } be an orthonormal system of H2 , and 1 , ..., n K. Consider
the operator
X
i bi hx, ai i.
U : H1 H2 defined by U (x) =
i=1
Calculate kU k.
Solution.
www.MATHVN.com
n
X
i=1
n
X
|i |2 |hx, ai i|2
i=1
n
X
i=1
Problem 58.
(a) Let X be a Hilbert space. Let a, b H be two non-zero orthogonal elements.
Consider the operator
U : H H, U (x) = ahx, bi + bhx, ai.
Calculate kU k.
(b) Consider the operator T : L2 [0, ] L2 [0, ] defined by
Z
Z
(T f )(x) = sin x
f (t) cos tdt + cos x
f (t) sin tdt.
0
Calculate kT k.
Solution.
(a) Note that ahx, bi and bhx, ai are two orthogonal vectors. Using the Pythagoras
theorem we have
kU (x)k2 = kak2 |hx, bi|2 + kbk2 |hx, ai|2 .
www.MATHVN.com
61
2
2 !
b
a
+ x,
kak2 kbk2 kxk2 .
kU (x)k2 = kak2 kbk2 x,
kbk
kak
Hence, kU k kak kbk.
But
U (a) = aha, bi + bha, ai = kak2 b.
Therefore,
kU (a)k = kak2 kbk kU k kak.
Hence, kU k kak kbk. Thus,
kU k = kak kbk.
(b) Let H = L2 [0, ]. Then H, with the usual inner product, is a Hilbert space.
The two vectors a = sin x and b = cos x are orthogonal. Indeed,
Z
ha, bi = hsin x, cos xi =
sin x cos xdx = 0.
0
By (a) we get
kT k = k sin xk k cos xk.
But
k sin xk =
0
Thus,
kT k =
.
2
(cos x)2 dx =
.
2
Problem 59.
(a) Let H be a Hilbert space and {e1 , e2 } H an orthonormal system. Let
a b
A=
c d
be scalar square matrix. Consider the operators U, V : H H defined by
U (x) = ahx, e1 ie1 + bhx, e2 ie2 ,
V (x) = chx, e1 ie1 + dhx, e2 ie2 .
www.MATHVN.com
Prove that
kU + V k2 + kU V k2 = 2(kU k2 + kV k2 )
if and only if
(max{|a+c|,|b+d|})2 +(max{|ac|,|bd|})2 =2(max{|a|,|b|}2 +max{|c|,|d|}2 ).
Solution.
(a) Using Problem 57 we have
kU k = max{|a|, |b|}; kV k = max{|c|, |d|}.
kU + V k = max{|a + c|, |b + d|}; kU V k = max{|a c|, |b d|}.
From here we obtain the statement.
(b) Since dim H 2 we can find x, y H, two linearly independent vectors. Using
the Gram-Schmidt procedure on {x, y} we can construct an orthonormal system
{e1 , e2 } H. Now construct U, V using the matrix
2 1
A=
.
0 2
That is U, V : H H defined by
U (x) = 2hx, e1 ie1 + hx, e2 ie2 , V (x) = 2hx, e2 ie2 .
If B(H) were a Hilbert space, then by the parallelogram law we must have
kU + V k2 + kU V k2 = 2(kU k2 + kV k2 ),
i,e., by (a)
www.MATHVN.com
4.2
63
Linear Functionals
Review:
www.MATHVN.com
1
.
Problem 60.
The dual space of `1 is ` , that is, (`1 ) = ` .
Solution.
Let (ek ) be the standard basis for `1 , where ek = kj . Every x `1 has unique
representation
X
x=
k ek .
k=1
1
Norms on ` and on `
are respectively:
kxk1 =
|k |, kxk = sup |k |.
kN
k=1
X
X
k k where k = f (ek ).
k ek =
f (x) = f
k=1
k=1
sup |k | kf k.
kN
k k where x = (k ) `1 .
k=1
X
k=1
|k k | sup |k |
kN
X
k=1
|k | = sup |k | kxk1 .
kN
www.MATHVN.com
65
Hence g (`1 ) .
We finally show that the norm of f is the norm on ` . We have
|f (x)| =
k k sup |k |
|k | = kxk sup |k |.
kN
kN
k=1
k=1
Problem 61.
The dual space of `p is `q , that is, (`p ) = `q , here 1 < p < and
1
p
1
q
= 1.
Solution.
The basis for `p is (ek ), where ek = kj as in the previous problem. Every x `p
has unique representation
X
k ek .
x=
k=1
p
f (x) =
k k where k = f (ek ).
k=1
(n)
X
k=1
(n)
k k =
n
X
|k |q .
k=1
www.MATHVN.com
We also have
n
X
f (xn ) kf k kxn k = kf k
! p1
(n)
|k |p
k=1
n
X
= kf k
! p1
|k |(q1)p
k=1
n
X
= kf k
! p1
|k |q
k=1
Together,
n
X
f (xn ) =
n
X
|k |q kf k
k=1
1
p
!1 p1
|k |q
|k |q
k=1
! p1
1
,
q
we get
n
X
! 1q
|k |q
kf k.
k=1
k=1
! 1q
|k |q
kf k.
k=1
Conversely, for any b = (k ) `q we can get a corresponding bounded linear functional g on `p . In fact, we may define g on `p by setting
g(x) =
k k where x = (k ) `p .
k=1
Then g is linear. The boundedness follows from the Holder inequality. Hence g
(`p ) . We finally prove that the norm of f is the norm of (k ) in `q . From (1) and
the Holder inequality we have
! p1
! 1q
X
X
X
|k |p
k k
|f (x)|
|k |q
k=1
k=1
k=1
! 1q
X
= kxk
|k |q
.
k=1
www.MATHVN.com
67
Hence
kf k
! 1q
|k |q
k=1
! 1q
|k |q
k=1
Problem 62.
The dual space of c0 is `1 , that is, (c0 ) = `1 .
Solution.
Recall that c0 ` , and if x = (n ) c0 the norm of x in c0 is kxk = supnN |n |.
Let x = (n ) c0 and (ek ), where ek = kj , be the basis for ` as in preceding
examples. Then x has unique representation
x=
k ek , and
k=1
lim k = 0.
k k where k = f (ek ).
k=1
(0)
N
X
|f (ek )| kf k kxN
0 k = kf k < .
k=1
www.MATHVN.com
Since N is arbitrary,
|f (ek )| =
k=1
|k | = kf k < .
k=1
k=1
k=1
It follows that
(ii)
k k .
k=1
|k | = kxk
k=1
|k | < .
k=1
Problem 63.
Let X be a normed space and f, g are nonzero linear functionals on X. Show
that
ker(f ) = ker(g) f = cg for some nonzero scalar c.
www.MATHVN.com
69
Solution.
The reverse way () is trivial.
We show the direct way. Suppose ker(f ) = ker(g). Since f 6= 0, there exists some
x0 X such that f (x0 ) 6= 0, and by rescaling, we can assume that f (x0 ) = 1. Since
x0
/ ker(f ) = ker(g), we have g(x0 ) 6= 0. Given any y X, we have
Problem 64.
Let X be a normed space and f are nonzero linear functional on X. Show that
f is continuous if and only if ker(f ) is closed.
Solution.
Suppose that f is continuous. Since ker(f ) = f 1 ({0}), so ker(f ) is closed.
Conversely, suppose that ker(f ) is closed. Pick an x0 X such that f (x0 ) = 1.
Assume that f is not continuous, that is, f is not bounded. Then there exists a
sequence (xn ) in X such that
kxn k = 1 and f (xn ) n, n N.
Define yn = x0
xn
.
f (xn )
Then
lim yn = x0 .
Problem 65
Let Z be a subspace of a normed space X, and y X. Let d = d(y, Z). Prove
that there exists X such that kk 1, (y) = d and (z) = 0 for all
z Z.
www.MATHVN.com
Solution.
If y Z, then d = 0 and so the zero functional works, so we may assume that y
/ Z.
Consider the subspace Y = Cy + Z X. Since y
/ Z, so for every x Y , there is
a unique C and z Z such that x = y + z. Define
(x) = d.
We observe that (z) = 0 since
x = z y = 0
= 0 (otherwise y = 0 so y Z).
Also we have (y) = d since y = 1.y + 0. It is clearly that is linear in x and
kxk = ||ky +
1
zk d = |(x)|.
Problem 66
Let X be a normed space and (xn ) be a sequence in X. Set V := Span {x1 , x2 , ...}.
Let W be the set of all continuous f X such that f (xn ) = 0, n N. Prove
that
V = {x X : f (x) = 0, f W }.
Solution.
Let Y := {x X : f (x) = 0, f W }.
We show that V Y . Take any x0 V . There exists a sequence (uk ) in V such
that uk x0 as k . Since V := Span {x1 , x2 , ...}, for each k N, there are
P k (k)
(k)
(k)
cn xn . By linearity of f and by definition
scalars c1 , ..., cnk such that uk = nn=1
of W , we have
nk
X
f (uk ) =
c(k)
n f (xn ) = 0, f W.
n=1
By continuity of f , we have
f (x0 ) = 0, f W.
www.MATHVN.com
71
Hence x0 Y , and so V Y .
Now given any x0 Y , we want to show x0 V . Assume that x0
/ V . Then
d(x0 , V ) = d > 0. Using the result in Problem 65, there is an F X such that
F (x0 ) = d and F (x) = 0, x V .
It follows that
F (x0 ) = d and F (xn ) = 0, n N.
Hence F W but F (x0 ) 6= 0. It means that x0
/ Y : a contradiction. Thus x0 V ,
and so Y V .
The proof is complete.
Problem 67.
Let X be a normed space and {x1 , ..., xn } X a linearly independent system.
Prove that for any 1 , ..., n K there exists x X such that
x (xi ) = i , i {1, ..., n}.
Solution.
Let Y = Span{x1 , ..., xn }. Since the system {x1 , ..., xn } X a linearly independent,
it follows that {x1 , ..., xn } is an algebraic basis for Y . Define f : Y K linear with
f (xi ) = i , i {1, ..., n}. Since Y is of finite dimension, f is continuous. By the
Hahn-Banach theorem there is an extension x X for f . Then
x (xi ) = f (xi ) = i , i {1, ..., n}.
Problem 68.
Let X be a normed space and Y X a linear subspace. For x0 X \ Y we
define
f : Span{Y, x0 } K, f (y + x0 ) = , y Y, K.
(a) Prove that f is well defined and linear.
(b) Prove that f is continuous
if and only if x0
/ Y.
T
www.MATHVN.com
Solution.
(a) Let us first observe that
Span{Y, x0 } = {y + x0 : y Y, K}.
To show that f is well defined, we show that
(y + x0 = y 0 + 0 x0 ) (y = y 0 , = 0 ).
Assume that 6= 0 . Then
y y0
Y
0
since y, y 0 Y and Y is a linear subspace. This is a contradiction. Thus, = 0
implies that y = y 0 . The linearity of f is obvious.
(b) Suppose that f is continuous. We will prove that x0
/ Y . Assume, for a
contradiction, that x0 Y . Then there is a sequence (yn ) Y such that yn x0 .
Since yn , x0 Y , yn x0 and f is continuous, f (yn ) f (x0 ). By definition of
f, f (yn ) = 0, n N. It follows that f (x0 ) = 0, which is false, since by definition
of f , we have f (x0 ) = 1.
Suppose now that that x0
/ Y , i.e., x0 (Y )c , which is open. Then
x0 =
> 0 : B(x0 ; ) (Y )c .
The inclusion is equivalent to Y B(x0 ; ) = . Let x = y + x0 Span{Y, x0 }. If
= 0, then
kxk
() |f (x)| = 0
.
y
y
Y so
y
x0 k || = |f (x)|.
www.MATHVN.com
Chapter 5
Fundamental Theorems
Review some main points:
1. The Baire category theorem:
Definition 3 Let X be a metric space and E be a subset of X.
(a) E is called a set of the first category if E is a countable union of nowhere dense (non-dense)
sets in X.
(b) If E is not a set of the first category, then E is called a set of the second category.
Theorem 5 (Baire category theorem - form I)
If X is a complete metric space, then X is a set of the second category.
Let X be a complete metric space. The Baire category theorem tells us that if X =
some of the set An must have non-empty interior.
S
n=1
An , then
73
www.MATHVN.com
Problem 69.
(a) If X is a normed space, prove that any proper closed linear subspace of X is
a nowhere dense set.
(b) Prove that c0 is a nowhere dense set of c.
Solution.
(a) Let A be a proper closed linear subspace of X. If A is not nowhere dense, then
= A
6= since A is closed. Therefore, A contain an open ball B(a; ). Take
A
x B(0; ) then we have
kxk < a + x B(a; ) A.
Since a, a + x A and A is a linear space, x must be in A. Therefore B(0; ) A.
Now take any y X with y 6= 0, then we have
y B(0; ).
2kyk
www.MATHVN.com
Problem 70.
Show that L2 [0, 1] is a subset of the first category in L1 [0, 1].
Solution.
For short, we write L1 := L1 [0, 1] and L2 := L2 [0, 1]. We know that L2 L1 . For
each n N, let
An = {f : kf k2 n}.
Every function in L2 will be in some An , Thus
[
L2 =
An .
nN
We first prove that An is closed. Fix n. Let (fk ) be a sequence in An such that
kfk f k1 0. We show that f An . Since kfk f k1 0, (fk ) converges
in measure to f . Hence there exists a subsequence (fkj ) converging to f almost
everywhere. By definition of An we have
Z 1
fk2j (t)dt n2 for j = 1, 2, ...
0
f (t)dt n2 .
1
0
h(t)dt = ,
2
so that
h L1 and khk1 = .
2
2
Let g = f + h. Then g
/ L so g
/ An , and
kf gk1 = khk1 = .
2
www.MATHVN.com
Problem 71.
Let X 6= {0} be a normed space, and A X which is not nowhere dense. We
denote by A0 the derivative set of A, i.e., the set of all accumulation points of
A. Prove that
x X and > 0 such that B(x; ) A0 .
(Note: A = A A0 ).
Solution.
6= ,
Since A
( ky xk) + ky xk
2
1
( + ky xk) < .
=
2
Hence z B(x; ).
Obviously, B(y; ) B(y; r). So
B(y; ) (A \ {y}) B(y; r) (A \ {y}) = .
so y A,
from whence
That is B(y; ) A {y}. Since y B(x; ) A,
B(y; ) A 6= , and therefore
B(y; ) A = {y}.
www.MATHVN.com
b B(y; ) = {y},
2
which implies that b = 0 : a contradiction).
y+
Problem 72.
Let X is a Banach space and A X a dense set. Can we find a function
f : X R such that, for every x A, we have limtx |f (t)| = ?
Solution.
Suppose that such a function exists. Since f takes finite values, for every x X,
there is k N such that |f (x)| k, i.e.,
[
Ak where Ak = {x X : |f (x)| k}.
X=
kN
Problem 73.
Show that Q is a subset of the first category of R.
Solution.
Since Q is countable, we have
[
Q=
{xn } and ({xn })0 = ({xn })0 = .
nN
www.MATHVN.com
Problem 74.
Show that the set of piecewise linear functions on R is of the first category.
Solution.
Let P denote the set of piecewise linear functions on R. Let Pn be the set of piecewise
linear functions having n intervals of linearity. We have
P =
Pn .
n=1
We need to prove that Pn is nowhere dense for every n. Fix an arbitrary n. Let
f Pn . Consider the ball Br (f ), r > 0. Let
g(t) =
r
sin(24nt) + f (t).
2
Then
r
|f (t) g(t)| = | sin(24nt)|.
2
Hence d(f, g) = 2r , and so g Br (f ). We claim that the ball B r2 (g) contains no
element from Pn . Pick h Br (f ) Pn and suppose d(g, h) < 2r . Then
r
r
www.MATHVN.com
kT xk kT k kxk = bkxk, x X.
1
kxk = kT 1 (T x)k kT 1 k kT xk = kT xk, x X.
a
Problem 76. Let X = C 1 [0, 1] be the space of continuously differentiable functions on [0, 1] and Y = C[0, 1] . The norm on C[0, 1] and C 1 [0, 1] is the supnorm. Consider the map
T : C 1 [0, 1] C[0, 1] defined by T x(t) =
dx(t)
, t [0, 1].
dt
Show that the the graph of T is closed but T is not bounded. Does this contradict
the closed graph theorem ?
Solution.
It is clear that T is linear.
We show that (T ) is closed. Suppose xn x in X = C 1 [0, 1] and T xn y in
Y = C[0, 1]. We must show that y = T x. For any t [0, 1], we have
Z t
Z t
dxn
y(s)ds =
lim
ds, y C[0, 1]
0
0 n ds
Z t
dxn
ds (uniform convergence)
= lim
n 0 ds
x(t) = x(0) +
y(s)ds,
t [0, 1].
www.MATHVN.com
Hence
x C 1 [0, 1] and
dx
= y on [0, 1].
ds
Solution.
(1) (2)
Assume that (1) is true . Then the first part of (2) is automatically true. We
have only to show that {kxn k} is bounded. Consider, for each n, the functional
fn (x) = hx, xn i. This is a bounded functional by Schwarz inequality, and, because
fn (x) 0 for each x, we have that the set {kfn (x)k : n N} is bounded. The
principle of uniform boundedness then gives us that the set {kfn k} is bounded. But
kfn k = kxn k, so {kxn k} is bounded.
(2) (1)
Assume
P that (2) holds. Let B be the bound of {kxn k} and let x X. We write
x = n hen , xien . For every > 0, let K be such that
X
m>K
.
B
www.MATHVN.com
hem , xihem , xn i
|hx, yi| =
m=1
K
X
hem , xihem , xn i
|hem , xi| +
K
|he
,
xi|
r
m=1
m>K
!1/2
!1/2
X
X
+
+
|hem , xi|2
|hem , xn i|2
m>K
+
kxn k 2.
B
m>K
Solution.
Since H is a complete space and T is a linear operator, it is sufficient to prove that
T is a closed graph operator. Let (xn ) be a sequence in H such that xn x H
and T xn y H. We will show that y = T x .
By hypothesis, we have
hT (xn x), yi = hxn x, T yi, y H.
Hence
hT (xn x), yi 0, y H.
That is
T (xn x)
0, or, equivalently T xn
T x.
w
www.MATHVN.com
Solution.
For every n N, consider the operator
Un : c0 c0 defined by Un (x) = Un (x1 , x2 , ...) = (a1 x1 , a2 x2 , ..., an xn , 0, ...).
Then Un is linear, and
kUn (x1 , x2 , ...)k = k(a1 x1 , a2 x2 , ..., an xn , 0, ...)k
= max(|a1 x1 |, ..., |an xn |)
kxk max(|a1 |, ..., |an |), x c0 .
So Un is continuous, and kUn k max(|a1 |, ..., |an |).
For 1 k n, we have
kUn k kUn (ek )k = k(0, ..., 0, ak , 0, ...)k = |ak |,
where ek = (0, .., 0, 1, 0, ...) c0 . Therefore max(|a1 |, ..., |an |) kUn k. Hence,
| {z }
k1
Now from the Banach-Steinhaus theorem we get that supnN kUn k < , i.e., supnN |an | <
. In other words, a ` .
Let
P x = (x1 , x2 , ...) = (xi )i=1 be a sequence of scalars such that1 the series
i=1 xi yi is convergent for all y = (y1 , y2 , ...) c0 . Prove that x ` .
www.MATHVN.com
Tn : c0 C, Tn (y) =
xi y i .
i=1
Then we have
|Tn (y)|
n
X
|xi yi |
i=1
n
X
!
|xi | kyk .
i=1
n
X
|xi |.
i=1
By hypothesis,
x
y
<
,
the
sequence
T
(y)
i
i
n
i=1
nN
(n) (n)
(n)
Now let x(n) = x1 , x2 , ..., xn , 0, 0, ... be a truncated version of x (so that x(n)
`1 ). Let
n
X
(n)
Tn (y) =
xi yi , y = (y1 , y2 , ...) c0 .
i=1
(n)
(n)
Then
|Tn (y
(n)
)| =
(n)
xk
=
n
X
(n)
|xk |
(n)
if xk 6= 0,
(n)
if xk = 0.
(n)
k=1
Hence
kTn k kx(n) k1 ,
which in turn implies that
kx(n) k1 M, n N.
www.MATHVN.com
But it is clear from the definition of x(n) that kx(n) k1 is an increasing sequence of
real numbers. Being bounded above by M , it must converge. Hence
|xi | < ,
i=1
and so x `1 .
Solution.
We will show that the graph (T ) is closed. Then by the closed graph theorem, this
implies
that T is bounded (continuous).
Let (xn , yn ) nN be a convergent sequence in X Y , that is,
xn x in X, yn y in Y and T xn = yn .
Since J and JT are continuous,
yn y Jyn Jy
and
xn x JT xn JT x .
Since T xn = yn , we have Jyn JT x. Since the limit is unique, this gives that
Jy = JT x. But by hypothesis J is injective, so we have
Jy = JT x y = T x.
This shows that (x, y) (T ), and (T ) is closed.
www.MATHVN.com
Solution.
The linearity of these two maps are easy to check. Let us prove that they are
bounded by using the closed graph theorem. Denote the graph of PE by E . We
can write
E = {(x, y) X E : x y F }.
Let (xn , yn ) E for every n N. Suppose (xn , yn ) (x, y) as n . Since
xn yn F for every n N, and F is a closed subspace of X, limn (xn yn ) =
x y F . It follows that (x, y) E . Thus, E is closed, and so PE is bounded.
The proof for PF is the same.
Solution.
Consider the identity map
id : (X, k.k1 ) (X, k.k2 ),
id(x) = x.
It is clear that the identity map is linear and bijective. It is continuous since by
hypothesis we have
()
By the inverse mapping theorem, the inverse map id1 exists and continuous. That
is
()
C 0 0 : kxk1 C 0 kxk2 , x X.
www.MATHVN.com
www.MATHVN.com
Chapter 6
Linear Operators on Hilbert
Spaces
Review.
1. Definition and elementary properties
Let T : H K be a linear operator between Hilbert spaces H and K.
The following statements are equivalent:
1. T is continuous at 0,
2. T is continuous,
3. T is bounded on H.
An isomorphism between H and K is a linear surjection U : H K such that
hU x, U yi = hx, yi, x, y H.
An isomorphism is an isometry and so preserves completeness, but an isometry need not to be an
isomorphism.
Proposition 1 Two Hilbert spaces are isomorphic if and only if they have the same dimension.
2. Adjoint of an Operator
Let A B(H). Then A is called the adjoint operator of A if
hAx, xi = hx, A xi, x H.
Proposition 2 If A, B B(H) and F, then
(a) (A + B) =
A + B .
(b) (AB) = B A .
(c) A := (A ) = A.
(d) If A is invertible in B(H) and A1 is its inverse, then A is invertible and (A )1 = (A1 ) .
87
www.MATHVN.com
A A.
www.MATHVN.com
Solution.
If x H and P x 6= 0, then the use of the Cauchy-Schwarz inequality implies that
hP x, P xi
kP xk
hx, P 2 xi
=
(since P = P )
kP xk
hx, P xi
kxk kP xk
=
kP xk
kP xk
kxk.
kP xk =
Therefore kP k 1.
Now, if P 6= 0, then there is an x0 H such that
P x0 6= 0 and kP (P x0 )k = kP x0 k.
This implies that kP k 1. Thus kP k = 1.
Solution.
First, in order for P to be a well-defined operator acting on L2 [0, 1], the function
f needs to be in L2 [0, 1] for all f L2 [0, 1]. In particular f is measurable, and
taking f 1, it follows that is a measurable function on [0, 1].
Secondly, P is an orthogonal projection if and only if P = P and P 2 = P . The
last equality is equivalent to 2 (x)f (x) = (x)f (x), f L2 [0, 1]. Again by taking
f 1, we have a2 (x) = a(x) for almost every x [0, 1]. Thus
a(x) = 0 or a(x) = 1 for almost all x [0, 1].
www.MATHVN.com
= hf, P gi,
which proves that P is self-adjoint. Since 0 (x) 1 for a.e. on [0, 1], we have
that
Z 1
21 Z 1
12
2
2
2
kP f kL2 =
(x) |f (x)| dx
|f (x)| dx
= kf kL2 .
0
Thus, P is bounded.
In conclusion, the necessary and sufficient conditions for P to be an orthogonal
projection is a measurable satisfying (x) = 0 or (x) = 1 for almost all x
[0, 1].
Solution.
For (n ) = (1 , 2 , ...) and (n ) = (1 , 2 , ...) in `2 ,
S (n ), (n ) = (n ), S(n )
= h(1 , 2 , ...), (0, 1 , 2 , ...)i
= 2 1 + 3 2 + ...
= h(2 , 3 , ...), (1 , 2 , ...)i.
Thus
S (1 , 2 , ...) = (2 , 3 , ...).
Hence, the adjoint of the right-shift is the left-shift.
www.MATHVN.com
A.
Solution.
With similar argument as the previous problem, we can show that A is linear. We
have
X
X
kAxk2 =
|xk |2
|xk |2 = kxk2 , x = (x1 , x2 , x3 , ...) `2 .
k=3
k=1
Therefore,
kAxk kxk, x `2 .
This shows that A is continuous. Also, for all x, y `2 ,
X
xk yk = hx, Ayi.
hAx, yi =
k=3
|xk |2 0, x `2 .
k=3
A : `2 `2 . We have
www.MATHVN.com
Solution.
(a) The linearity of the operator M is evident. We show that M is bounded and
calculate its norm.
By definition, kk is the infimum of all c > 0 such that |(x)| c a.e. [], and so
|(x)| kk a.e. []. Thus we can assume that is a bounded measurable and
|(x)| kk for all x. If f L2 (), then
Z
Z
2
2
|f | d kk |f |2 d.
That is,
M B L2 () and kM k kk
().
()
, then we have
f L2 () and kf k2 = 1.
So
1
kM k kf k =
()
2
||2 d (kk )2 .
().
f M g d
Z
=
f (g)d
Z
)
(f
g d
= hMf, gi.
This shows that
M = M.
(c) Every multiplication operator M is normal. Indeed,
M M = M M = MM = M M .
www.MATHVN.com
Solution.
(a) Take any x Image A. Then there is a y H such that x = Ay. For any
z ker A , we have
hx, zi = hAy, zi = hy, A zi = hy, 0i = 0.
hence x (ker A ) . This proves that Image A (ker A ) . Since (ker A ) is
closed, it follows that
(i)
Image A (ker A ) .
On the other hand, if x (Image A) , then for all y H, we have
0 = hAy, xi = hy, A xi.
Therefore A x = 0, that is, x ker A . This prove that (Image A) ker A .
Taking orthogonal complements both sides, we obtain
(ii)
www.MATHVN.com
Solution.
R
(a) Linearity of K comes from linearity of the integral . It suffices to show that K
is bounded. Actually it must be shown first that Kf L2 (), but this will follow
from the argument that demonstrates the boundedness of K. If f L2 (),
Z
|Kf (x)|
|k(x, y)| |f (y)|d(y)
Z
=
|k(x, y)|1/2 |k(x, y)|1/2 |f (y)|d(y)
1/2
Z
1/2 Z
2
|k(x, y)| |f (y)| d(y)
|k(x, y)|d(y)
Z
c1
1/2
|k(x, y)| |f (y)| d(y)
.
2
Hence
Z
Z Z
2
c1 c2 kf k2 .
www.MATHVN.com
f (y)k(x, y)g(y)d(y)
Z
k(x, y)g(y)d(y).
0
iA
B=
iA 0
Prove that kAk = kBk and that B is self-adjoint.
Solution.
For any x =
x1
x2
y1
, y=
with x1 , x2 , y1 , y2 H we have
y2
0
iA
x1
y1
,
hBx, yi =
x2
y2
iA 0
= hiAx2 , y1 i + hiA x1 , y2 i
= hx2 , iA y1 i + hx1 , iAy2 i
0
iA
y1
x1
,
=
y2
x2
iA 0
= hx, Byi.
Moreover,
kBxk2 = kiAx2 k2 + k iA x1 k2
(max{kAk, kA k})2 kxk2
= kAk2 kxk2 .
www.MATHVN.com
0
x2
and obtain
kB xk = kAx2 k kBkk
xk = kBkkx2 k.
Therefore, kAk kBk. Finally, we obtain kAk kBk.
Remark:
Note that norm on H H is
k(a, b)k = kak + kbk, a, b H.
Solution.
For kxk = 1 we have
|hT x, xi| kT xkkxk = kT xk kT k.
Therefore
(i)
p
1
T z where = kT zk.
=
=
T (z), u
1
T (z + u), z + u T (z u), z u
4
kz + uk2 + kz uk2
4
kzk2 + kuk2
2
www.MATHVN.com
Problem 95
Let H be a Hilbert space and A a positive self-adjoint operator on H. Prove that
the following assertions are equivalent:
(i) A(H) is dense in H.
(ii) Ker A = {0}.
(iii) A is positive definite, i.e., hAx, xi > 0, x H \ {0}.
Solution.
(i) (ii)
Suppose Ax = 0. Then, for any y H,
hAx, yi =
(ii) (iii)
www.MATHVN.com
Problem 96
Let H be a Hilbert space. If A, B : H H are self-adjoint operators with
0 A B and B is compact, prove that A is compact.
Solution.
Let (xn ) be a sequence in the closed unit ball BH . Since B is compact, there is a
subsequence (xnk ) such that (Bxnk ) converges. From the Cauchy-Schwarz inequality
we have
hBx, xi kBxk kxk, x H.
It follows that
hBxnk Bxmk , xmk xnk i kBxmk Bxnk k kxmk xnk k
kBxmk Bxnk k (kxmk k + kxnk k)
2kBxmk Bxnk k.
From 0 A B we get
hA(xnk xmk ), xmk xnk i hB(xnk xmk ), xmk xnk i
2kBxmk Bxnk k.
On the other hand, we get
Hence
From this we see that the sequence ( Axnk ) is Cauchy, hence converges. The
2
operator A is compact. And so is the operator A = A .
www.MATHVN.com
Chapter 7
Compact Operators
In this chapter we study general properties of compact operators on Banach and Hilbert spaces.
Spectral properties of these operators will be discussed later.
Definition 7 Let X and Y be Banach spaces. An operator T B(X, Y ) is called compact operator if the image of every bounded set in X has compact closure in Y (relatively compact set).
Equivalently, T B(X, Y ) is compact if and only if for every bounded sequence (xn ) in X, (T xn )
has a convergent subsequence in Y .
The set of all compact operators is denoted by B0 (X, Y ).
Proposition 7 Let X and Y be Banach spaces. Then B0 (X, Y ) is a closed subspace of B(X, Y ).
That is, if (Tn ) is a sequence of compact operators and T B(X, Y ) such that kTn T k 0, then
T B0 (X, Y ).
Definition 8 (Finite rank operators)
An operator T : X Y has finite rank if Image T := T (X) is finite dimensional.
Proposition 8 Let X and Y be Banach spaces. Every finite rank operator from X to Y is
compact.
w
99
www.MATHVN.com
Solution.
Suppose (xn ) is a sequence in H such that kxn k 1 for every n N. Since T is
continuous,
kT xn k kT k kxn k kT k, n N.
If we set yn = TkTxnk , and then we have kyn k 1 for every n N. Since A is compact,
the sequence (Ayn ) has a convergent subsequence. Now we have
kT kAyn =
kT kAT xn
= AT xn , n N.
kT k
It follows that the sequence (AT xn ) also has a convergent subsequence. Thus AT is
compact. The similar argument for T A
Problem 98.
(a) Let X be a Banach space. Show that the identity I : X X is compact if
and only if X has finite dimensional.
(b) Let X, Y be Banach spaces and A B(X, Y ). Suppose that A has the
property:
c > 0 : kAxk ckxk, x X,
Find condition(s) for X so that A can be a compact operator.
Solution.
(a) See Problem 16.
(b) First we note that A is injective. Indeed,
Ax = 0 cx = 0 x = 0.
Let Z = A(X), then U : X Z defined by U (x) = A(x) is bijective. Let us
consider U 1 : Z X. Clearly U 1 is linear. we claim:
1
() kU 1 (y)k kyk, y Z
c
www.MATHVN.com
Problem 99.
Let H and K be Hilbert spaces and A B(H, K). Show that A is compact if
and only if A A is compact.
Solution.
Suppose A B(H, K) is compact. Let (xn ) be a sequence in X converging weakly
to 0. We have
kA Axn k kA k kAxn k.
Since A is compact, Axn 0 (strongly) in Y . Thus A Axn 0, and so A A is
compact.
w
Problem 100.
Let X be c0 or `p , 1 p . Consider the operator
U : X X, U (x) = U (x1 , x2 , ...) = (0, x1 , 0, x3 , 0, x5 , ...).
Prove that U is not compact but U 2 is compact.
www.MATHVN.com
Solution.
We first note that c0 and `p , 1 p (with appropriate norms) are Banach
spaces (see Problems 18,19). We have
U 2 (x) = U (U (x)) = U (0, x1 , 0, x3 , 0, x5 , ...) = (0, 0, ...).
Thus, U 2 = 0, therefore U 2 is compact.
On the other hand, if
en = (0, ..., 0, 1, 0, ...) X
| {z }
n
then
U (e2n1 ) = e2n , n N.
Now, we have explicitly
e2n = (0, ..., 0, 1, 0, ...), e2(n+k) = (0, ..., 0, 0, ..., 0, 1, 0, ...),
| {z }
| {z } | {z }
2n
2n
2k
so that
e2(n+k) e2n = (0, ..., 0, 1, 0, ..., 0, 1, 0, ...).
| {z } | {z }
2n
For X = c0 or X = `
2k
we have
ke2(n+k) e2n k = 1.
It follows that, in both cases, the sequence U (e2n1 ) cannot have any convergent
subsequence. Thus, U is not a compact operator.
Problem 101
Let 1 p < , and = (n )nN K with supnN |n | < . We define the
multiplication operator
M : `p `p , M (x) = (1 x1 , 2 x2 , ...), x = (x1 , x2 , ...) `p .
Prove that:
(a) M is continuous and kM k = supnN |n |.
(b) M is a compact operator if and only if c0 .
www.MATHVN.com
P
p
Since
n=1 |xn | converges and kk < by hypothesis, the series
P the series
p
n=1 |n xn | converges. Moreover,
!1/p
X
kM (x)k =
|n xn |p
n=1
kk
!1/p
|xn |p
n=1
= kk kxk, x `p .
This shows that M is continuous and kM k kk . Also, for any n N,
|n | = |M (en )| kM k ken k = kM k.
Here en = (0, ..., 0, 1, 0, ...) `p . Therefore, kk = supnN |n | kM k. Thus,
| {z }
n1
kM k = supnN |n |.
(b) Suppose M is a compact operator. i.e., M (B`p ) is relatively compact (B`p the
closed unit ball in `p ). Then
> 0, n N :
|M (x)|p p , x B`p .
k=n
|M (en )|p p ,
k=n
that is
n n |n | < .
So n 0, that is, c0 .
Conversely, if n 0, then
> 0, n N : n n |n | < .
Let x = (x1 , x2 , ...) B`p , then
X
k=n
|M (x)| =
X
k=n
|k xk |
|xk |
k=n
www.MATHVN.com
X
k=1
|xk |p p .
Problem 102
Consider the linear operator defined by
T : ` ` , x = (1 , 2 , 3 , ...) 7 T x =
1 2 3
, , , ... .
1 2 3
Solution.
It is clear that T is linear. To show that it is compact, we will show that it is the
norm limit of a sequence of compact operators. Let
n
1 2
2
2
Tn : ` ` , T n x =
, , ..., , 0, 0, ... .
1 2
n
Then Tn is linear, bounded, and of finite rank so compact. Furthermore,
k(T Tn )xk
X
1 2
|i |
=
i2
i=n+1
X
1
|i |2
2
(n + 1) i=1
kxk2
.
(n + 1)2
1
.
n+1
Problem 103
2
Let (cj )
j=1 be a sequence of complex numbers. Define an operator D on ` by
Dx = (c1 x1 , c2 x2 , ...), x = (x1 , x2 , ...) `2 .
Prove that D is compact if and only if limj cj = 0.
www.MATHVN.com
Since each Dn has finite rank and hence is compact, the operator D is compact.
Assume that (cj ) does not converge to zero as j . Then, for a given > 0,
there exists a subsequence (cjk ) such that |cjk | . Consider the sequence of vectors
(ej ) of the standard basis. We have kejk k = 1 and for any indices m, k we have
kDejm Dejk k2 = kcjm ejm cjk ejk k2 = |cjm |2 + |cjk |2 22 > 0.
We conclude that the sequence (Dejk ) does not contain a convergent subsequence
and thus the operator D is not compact.
Trick used in problems 102 and 103 is called cut off method: From the sequence x = (x1 , x2 , ...)
we get the sequence (x1 , ..., xn , 0, 0, ...) by cutting off the tail of x.
Problem 104
Let g C[0, 1] be a fixed function. Consider the operator A B(C[0, 1]) defined
by
(Au)(s) := g(s)u(s),
i.e., the operator of multiplication by g. Is this operator compact?
Solution.
Note first that C[0, 1], equipped with the sup-norm, is a Banach space.
It is clear that if g 0 then A is compact. Let us prove that if g is not identically
zero then A is not compact. Indeed, since g is not identically zero, there exists a
subinterval [a, b] [0, 1] such that
m := min |g(s)| > 0.
s[a,b]
www.MATHVN.com
a
un C[0, 1]; un (s) := sin 2
; s [0, 1], n N.
ba
ns
It is clear that (un ) is a bounded sequence. On the other hand, (Aun ) does not have
Cauchy subsequences. Indeed, take arbitrary k, n N with k > n. Let
1
sn := a +
2n+1
(b a)
Problem 105
Given k L2 ([0, 1] [0, 1]), define the operator A : L2 ([0, 1]) L2 ([0, 1]) by
Z 1
(Af )(x) =
k(x, y)f (y)dy.
0
Solution.
(Look at Problem 92! They are different!)
(a) We estimate kAk to see A is bounded.
2
Z 1 Z 1
2
dx
k(x,
y)f
(y)dy
kAf k =
0
0
Z 1 Z 1
Z 1
2
www.MATHVN.com
(Cauchy-Schwarz)
1/2
kAk
< .
Thus A is bounded.
(b) We have
Z
(Af )(x) =
0
1
(A g)(x) =
k(x, y)g(y)dy.
0
Therefore,
Z
hAf, gi =
Z
f (y)
= hf, A gi.
Hence, A is self-adjoint if
k(x, y) = k(y, x).
2
(c) Let (uj )
j=1 be an orthonormal basis in L [0, 1]. Then
k(x, y) =
j=1
for almost all y. Due to the Parseval identity, we have, for almost all y
Z
|k(x, y)|2 dx =
and
X
j=1
(1)
|kj (y)|2 ,
Z
X
j=1
www.MATHVN.com
where kN (x, y) =
PN
k(A kN )f k2
dx
=
(k(x,
y)
k
(x,
y))f
(y)dy
N
0Z 1 Z0 1
Z 1
2
2
|k(x, y) kN (x, y)| dxdy
|f (y)| dy .
0
0
0
Z 1 Z 1
2
2
kf k
|k(x, y) kN (x, y)| dxdy .
j=1
Thus by using that the right hand side in (1) is absolutely convergent, we find
Z 1Z 1
2
k(A kN )k
|k(x, y) kN (x, y)|2 dxdy
Z
0
1
0
1
k(x, y)
0
1
N
X
N Z
X
j=1
N
X
j=1
kj (y)uj (x)dxdy +
j=1
1
k(x, y)
0
N
X
|kj (y)|2 dy
|kj (y)|2 dy 0 as N .
j=1
Problem 106
Part I
Consider the operator
n
!
X tk
k=0
k!
www.MATHVN.com
Solution.
Part I
Rx
From Calculus we know that if C[0, 1] then x 7 0 (t)dt is continuous.
P Hence,
tn
U, Un take their values in C[0, 1]. Using the Taylor expansion et =
n=0 n! we
obtain
!
Z x X
k
t
(U f Un f )(x) =
f (t)dt, x [0, 1].
k!
0
k=n+1
Then
!
X
tk
|(U f Un f )(x)|
|f (t)|dt
k!
0
k=n+1
!
Z 1 X
tk
kf k
dt, x [0, 1].
k!
0
k=n+1
Z
Thus,
Z
X
tk
kUn U k kf k
k!
0
k=n+1
!
Z 1 X
tk
dt.
k!
0
k=n+1
But if un (t) =
tk
k=n+1 k!
!
dt, f C[0, 1],
X
1
0,
|un (t)|
k!
k=n+1
R1
0
un (t)dt 0 as n . Thus,
lim kUn U k = 0.
www.MATHVN.com
Part II
1. For all x, y [0, 1] with x < y, and all f M , we have
Z y
0
|f (x) f (y)| =
|f (x)| dt
x
Z y
1/2 Z y
1/2
0
2
|f (x)| dt
1dt
x
1/2
0
2
|f (x)| dt
yx
x
p
k2 y x.
This shows that M is qui-continuous.
Now for all x M , and all f M , we have
It follows that the set of all functions g is uniformly Lipschitz. We also have
Z 1
Z 1
|g(0)| =
f (t)dt
|f (t)|dt kf k 1, g.
0
Arzela-Ascoli Theorem: Let (X, d) be a compact metric space and A C(X). Then the
following assertions are equivalent:
1. A is relatively compact.
2. A is uniformly bounded and equi-continuous,
3. Any sequence (fn ) A contains a uniformly convergent subsequence.
www.MATHVN.com
Problem 107
(a) Let X be an infinite dimensional Banach space, and A be a compact operator
on X. Prove that there is y X such that the equation A(x) = y has no solution,
i.e., A is not surjective.
(b) Let 1 p < , and the operator
x x
2
3
p
p
U : ` ` , U (x) = x1 , , , ... , x = (x1 , x2 , ...) `p .
2 3
Find an element y `p for which the equation U (x) = y has no solution.
(c) Consider the operator
x x
2
3
A : c00 c00 defined by A(x) = A(x1 , x2 , ...) = x1 , , , ... .
2 3
Prove that A is compact and bijective. On c00 we have the ` - norm.
Solution.
(a) Let us suppose, for a contradiction, that A is surjective. From the open mapping
theorem it follows that A is an open operator, in particular A(B(0; 1)) X is an
open set, i.e.,
> 0 : B(0; ) = B(0; 1) A(B(0; 1)),
where B(0; 1) = {x X : kxk < 1}. Since A is compact it follows that A(B(0; 1))
is relatively compact. Hence, B(0; ) is relatively compact, from whence B(0; 1) is
relatively compact, therefore compact. But if B(0; 1) is compact, then, by Problem
16, X must be finite dimensional, which is a contradiction. Thus, A is not surjective.
1
n1
, n N.
www.MATHVN.com
P
1
2
Since x = (x1 , x2 , ...) `p , the generalized harmonic series
n=1 n(1)p converges ,
1
therefore, ( 1)p > 1 > 1 + p . From here, it follows that for
y=
1,
,
1 ,
1 , ...
2 p+1 3 p+1
xn
2
An : c00 c00 , An (x) = An (x1 , x2 , ...) = x1 , , .., , 0, ... .
2
n
Then
1
, n N.
n+1
Therefore An A in norm. Since every An is a finite rank operator, so An is
compact. The sequence of compact operators (An ) converges to A in norm, so A
must be compact. The fact that A is bijective is obvious from the expression which
defines A.
kA An k =
1
n=1 np
p > 1 >
1
.
p
www.MATHVN.com
Chapter 8
Bounded Operators on Banach
Spaces and Their Spectra
Review:
1. Definitions
Let X be a Banach space and T B(X), C.
Resolvent and spectrum of T :
Set T = T I. The set (T ) of all such that T has an inverse R (T ) = (T I)1 is called
the resolvent of T . The set (T ) = C \ (T ) is called the spectrum of T .
Eigenvalues and eigenvectors of T :
An x 6= 0 which satisfies T x = x for some is called an eigenvector of T . The corresponding
is an eigenvalue of T . It is evident that (T ).
2. Basic properties
Theorem 12 (Spectrum)
If T is a bounded linear operator on a Banach space X, then its spectrum (T ) is compact and lies
in the disk given by
|| kT k.
Theorem 13 (Resolvent equation)
Let T B(X, X) where X is a Banach space. Then
1. The resolvent R (T ) satisfies the following equation called the resolvent equation
R R = ( )R R for , (T ).
2. R commutes with any S B(X, X) which commutes with T .
3. We have
R R = R R for , (T ).
113
www.MATHVN.com
p
n
kT n k.
www.MATHVN.com
Problem 108
Let X be a Banach space. Suppose that A B(X) is an invertible operator.
Show that
(A1 ) = {1 : =
6 0, (A)}.
Solution.
For 6= 0, we can write
A1 1 I = (I A)1 A1 .
From this equality we conclude that A1 1 I is invertible if and only if A I
is invertible. Hence, we have
(A1 ) = {1 : (A)}.
Problem 109
Let X be a Banach space, let A B(X) and C. Assume that there exists a
sequence (xn ) in X such that
kxn k = 1, n N and Axn xn 0 as n .
Prove that (A).
Solution.
Assume that A I is invertible. Then, there exists a number c > 0 such that (see
problem 75)
k(A I)xk ckxk, x X.
Replace x by xn with kxn k = 1 for all n, we have
kAxn xn k = k(A I)xn k ckxn k = c.
This contradicts the condition in the statement of the problem.
www.MATHVN.com
Problem 110
Let (an ) and (bn ) be complex sequences such that
(n)
(n)
Solution.
(a) Let the sequence of operators Tn : `2 `2 , n = 1, 2, ... be defined by for any
x `2 :
(
(T x)j if 1 j n
(Tn x)j =
0
if j > n.
All the Tn s are operators of finite rank and hence compact. Moreover, we have
kTn x T xk (|an+1 | + |bn |)kxk,
which implies that
kTn T k 0 as n .
But a uniform limit of a sequence of compact operators is compact. Hence, T is
compact.
(b) Suppose C is an eigenvalue of T and that x 6= 0 is the corresponding
eigenvector. Then
0 = T x x = (a1 )x1 , (a2 )x2 + b1 x1 , ..., (an )xn + bn1 xn1 , ... .
If coincides with none of the an s, then x = 0: impossible. So it is necessary that
= an for some n. In this case, xn can be chosen arbitrary, and x1 = ... = xn1 = 0,
and for k = 1, 2, ... we have 0 = (an+k )xn+k +bn+k1 xn+k1 . If we choose xn = 1
then we get
xn+k =
bn+k2
bn
bn+k1
...
, k = 1, 2, ...
an+k an+k1 an+1
www.MATHVN.com
Problem 111
Let X be a Banach space and let A B(X) such that An = 0 for some n N
(A is nilpotent). Find (A).
Solution.
The spectral mapping theorem implies
{n : (A)} = (An ) = (0) = {0}.
Therefore,
(A) n = 0 = 0.
Thus, (A) = {0}.
Problem 112
Let P B(X) be a projection, i.e., a linear operator on X such that P 2 = P .
Construct the resolvent R(P ; ) of P
Solution.
If P = 0, then obviously
P I = I; (P ) = {0}; R(P ; ) := (P I)1 = 1 I.
If P = I, then
P I = (1 )I; (P ) = {1}; R(P ; ) := (P I)1 = (1 )1 I.
Suppose P is non- trivial, i.e., P 6= 0, I. Take any 6= 0, 1. Then using the equalities
P 2 = P ; Q2 = Q and QP = P Q where Q = I P , we obtain
(1 )1 P 1 Q (P I) = (1 )1 P 1 Q ((1 )P Q)
= P + Q = I.
Similarly, we have
Thus,
(P I) (1 )1 P 1 Q = I.
R(P ; ) = (1 )1 P 1 Q = 1 (1 )1 P I .
www.MATHVN.com
Problem 113
Let CR be the space of all continuous and bounded functions x(t) on R with norm
kxk = supR |x(t)|. On the space CR we define the operator A by
(Ax)(t) = x(t + c),
where c R is a constant. Prove that
(A) = { C : || = 1}.
Solution.
Notice that
kAxk = sup |x(t + c)| = sup |x( )| = kxk.
tR
It follows that kAk = 1 and therefore all of the point of { C : || > 1} are
regular points of A. The operator A is invertible since the operator defined by
(A1 x)(t) = x(t c)
is bounded and is the inverse of A. Next kA1 k = 1 and hence all of the point of
{ C : || > 1} are regular points of A1 . From Problem 65 we deduce that all
of the points { C : || < 1} are regular points of A.
Consider || = 1. This means that
= ei , 0 2.
Set a =
i
c
Problem 114
(a) Let H be a Hilbert space and a, b H. Consider the rank-one operator
U : H H, U (x) = hx, aib, x H.
www.MATHVN.com
Solution.
(a) We have
kU (x)k = |hx, ai| kbk kak kbk kxk, x H.
Hence, kU k kak kbk. We also have
kU k kak kU (a)k = |ha, ai| kbk = kak2 kbk.
Therefore, kU k kak kbk. Thus,
kU k = kak kbk.
For x H, let y = U (x). Then
U 2 (x) = U (y) = hy, aib, where hy, ai = hU x, ai = hx, aiha, bi.
Denoting = ha, bi, we have
U 2 (x) = hx, aib = U (x), x H.
Therefore
U 2 = U.
From here, by induction, we get
U n = n1 U, n N.
Now
||
n1
n
kU k n
www.MATHVN.com
= || = |ha, bi|.
kV k
kxk
kyk
kV k
kyk
kV k kx k kyk.
kx k
Thus,
kV k = kx k kyk.
To calculate r(V ) we use the same procedure as in (a). For x H, let z = V (x).
Then
V 2 (x) = V (z) = x (z)y
z = V (x) = x (x)y,
x (z) = x (x)x (y).
Therefore,
V 2 (x) = x (y)x (x)y = x (x)y, = x (y).
Thus, V 2 = V . And from here, by induction, we get
V n = n1 V, n N.
And as above we obtain
r(V ) = || = |x (y)|.
Problem 115
Let k C([0, 1] [0, 1]) be a given function. Consider the operator
Z s
B B(C[0, 1]) defined by (Bu)(s) =
k(s, t)u(t)dt.
0
www.MATHVN.com
|(B n u)(s)|
Mn n
s kuk , s [0, 1], n {0, 1, 2, ...}
n!
where
M :=
(s,t)[0,1]2
For n = 0, then B 0 = I, and (*) is trivial. Suppose (*) holds for n = k. Then for
n = k + 1 we have
Z s
k+1
k
(B u)(s) =
k(s, t)(B u)(t)dt
Z 0s
M
Z0 s
M
0
k+1
(B u)(t) dt
Mk k
t kuk dt
k!
Z s
kuk
tk dt
M
k!
0
k+1
M
sk+1 kuk , s [0, 1].
=
(k + 1)!
=
Mn
kuk , u C[0, 1],
n!
Mn
, n {0, 1, 2, ...}.
n!
Therefore
r(B) = lim kB n k1/n lim
n
M
= 0.
(n!)1/n
Since r(B) = 0, (B) cannot contain nonzero elements. Taking into account that
(B) is nonempty, we conclude that (B) = {0}.
www.MATHVN.com
Problem 116
Let X be a Banach space and A, B B(X). Suppose AB = BA. Prove that
r(A + B) r(A) + r(B),
where r(T ) is the spectral radius of an operator T B(X).
Solution.
Recall
r(T ) := sup{|| : (T )} and r(T ) = lim kT n k1/n .
n
n
kAn k r(A) + , kB n k r(B) +
for sufficiently large n N. Therefore there exists a constant M 1 such that
n
kAn k M r(A) + , kB n k M r(B) + , n N.
Since AB = BA, we have
n
(A + B) =
n
X
k=0
n!
Ank B k .
k!(n k)!
Hence
n
X
k(A + B) k
k=0
n!
kAnk k kB k k
k!(n k)!
n
X
k
n!
r(A) + )nk (r(B) +
k!(n k)!
k=0
n
= M 2 r(A) + r(B) + 2 , n N.
Consequently,
r(A + B) = lim k(A + B)n k1/n r(A) + r(B) + 2, > 0.
n
www.MATHVN.com
Problem 117
Let K C be an arbitrary non-empty compact set. Construct an operator
B B(`p ), 1 p , such that (B) = K.
Solution.
Let {k }kN be a dense subset of K. (Recall that every metric compact space is
separable, that is, it contains a countable dense subset.) Consider the operator
B : `p `p defined by
Bx = (1 x1 , 2 x2 , ...), x = (x1 , x2 , ...) `p .
Then B is a bounded operator and k s are its eigenvalues. Consequently,
{k }kN (B).
Since (B) is closed and {k }kN is dense in K,
K (B).
On the other hand, let C \ K. Then d := inf kN |k | > 0 and B I has a
bounded inverse (B I)1 : `p `p defined by
(B I) x =
1
1
x1 , ...,
xk , ... , x = (x1 , x2 , ...) `p .
1
k
Hence,
/ (B). Therefore, (B) K. Finally,
(B) = K.
Problem 118
Let g C[0, 1] be a fixed function and A B(C[0, 1]) be defined by
(Af )(t) = g(t)f (t), t [0, 1].
Find (A) and construct effectively the resolvent R(A; ). Find the eigenvalues
and eigenvectors of A.
www.MATHVN.com
Problem 119
Let X be a Banach space and A, B B(X). Show that for any (A) (B),
R(B; ) R(A; ) = R(B; )(A B)R(A; ).
www.MATHVN.com
R(B; ) (A I) (B I) R(A; )
Problem 120
Let k C([0, 1] [0, 1]) be given. Consider the operator B B(C[0, 1]) defined
by
Z s
k(s, t)u(t)dt.
(Bu)(s) =
0
Solution.
Let us first prove by induction that
|(B n u)(s)|
Mn n
s kuk , s [0, 1], n N,
n!
(1)
where
M :=
(s,t)[0,1]2
|(Bu)(s)| M
|u(t)|dt M kuk
0
dt =
0
www.MATHVN.com
M1 1
s kuk .
1!
k+1
k
|(B u)(s)| =
k(s, t)(B u)(t)dt
Z 0s
Solution.
We have shown that kRk = kLk = 1 (problem 46). It follows that
{ C : || > 1} (R) and { C : || > 1} (L).
www.MATHVN.com
X
X
1
2
2
kxk =
|xn | =
.
2
||
n=1
n=1
(R I)x = e1 xn =
1
||2
1.
X
n=0
|x1 | ||
2n
|x1 |2 .
n=0
This sum cannot be finite since x1 6= 0, but this is impossible. So x must be zero,
and hence L I injective.
www.MATHVN.com
X
kxk =
(||2 )n .
n=0
The series is convergent since || < 1, so x `2 is nonzero and satisfies the equation
(L I)x = 0. Thus L I is not injective.
Conclusion:
Claims (1) and (2) show that
(R) = { C : || 1}.
= {0}.
Recall that Image(R I) is dense if and only if ker(R I) = ker(L I)
= ||, claims (3) and (4) show that Image(R I) is dense if and only if
Since ||
|| = 1. Therefore
c (R) = { C : || = 1} and r (R) = { C : || < 1}.
Also from the above results we get
p (R) = .
Note that claim (4) shows us that
p (L) = { C : || < 1}.
Since (L) is a closed set, we get
(L) = { C : || 1}.
(As from the above we know that || > 1 implies that (L).)
= {0} by claim (1). Hence
For || = 1 we know that ker(L I) = ker(R I)
Image(L I) is dense. Therefore
c (L) = { C : || = 1} and r (L) = .
www.MATHVN.com
It is clear that kRk = kLk = 1. So, every C with || > 1 is a regular point for
both of the operators R and L. Concerning the eigenvalues of these operators, we
obtain the following:
Lx = x (x 6= 0) x2 = x1 ; x3 = x2 ; ...
x = (1, , 2 , 3 , ...)x1 .
Such a vector belongs to `2 iff || < 1. Hence,
p (L) = { C : || < 1}.
From the above result we also have dim ker(L I) = 1.
For R we have
Rx = x (x 6= 0) 0 = x1 ; x1 = x2 ; x2 = x3 ; ...
x1 = x2 = x3 = ... = 0...
x = 0 : a contradiction.
Hence, p (R) = .
Next, since L = R and R = L, we obtain
(1)
(2)
www.MATHVN.com
|| 1}
|| < 1}
|| < 1}
|| = 1}.
www.MATHVN.com
Chapter 9
Compact Operators and Their
Spectra
As bounded linear operators, compact operators share spectral properties of bounded linear operators. Besides, compact operators have some more particular spectral properties.
Let T B(X) be a compact operator on a Banach space X. Suppose dim X = .
1. 0 (T ). Every spectral value 6= 0 is an eigenvalue.
2. For 6= 0, dim ker(T ) dim ker(T I) < .
3. For 6= 0, the range of T T I is closed.
4. The set of eigenvalues of T , namely p (T ), is at most countable. The value = 0 is the only
possible point of accumulation of that set.
Problem 122
Let T B(X) be a compact operator on a Banach space X. Suppose dim X = .
Show that
(a)
(b)
Solution.
Since T is linear, T 0 = 0. By induction we get
Tn x = 0 Tn+1 x = 0, n N,
131
www.MATHVN.com
= (T I)
n
X
n
k=0
k
n
T k ()nk
= () I + T
n
X
n
|k=1
T k1 ()nk .
{z
Problem 123
Let T B(X) be a compact operator on a Banach space X. Suppose dim X = .
Show that
0 (T ).
Solution.
If 0
/ (T ) then T is invertible, and we have T T 1 = I. But T and T 1 are compact,
so I is compact. This requires that the dimension of X is finite (problems 16, 98):
a contradiction. Thus 0 (T ).
Problem 124
Let T : X X be a compact operator on a normed space X and let 6= 0. Then
there exists a smallest integer r (depending on ) such that from n = r on, the
kernels ker(Tn ) are equal, and if r > 0, the inclusions
ker(T0 ) ker(T1 ) ... ker(Tr )
are all proper (strict).
www.MATHVN.com
1
x Nn1 .
2
We show that
1
kT yn T ym k || for m < n,
2
so that the sequence (T yn ) has no convergence subsequences. This contradicts the
compactness of T .
From T = T I we have T = T + I and
()
T yn T ym = yn x where x = T ym + ym T yn .
Let m < n. We show that x Nn1 . Since m n 1, we clearly have ym Nm
Nn1 . Also ym Nm implies
0 = Tm ym = Tm1 (T ym ),
that is, T ym Nm1 Nn1 . Similarly, yn Nn implies T yn Nn1 . Together,
x Nn1 . Also x = 1 x Nn1 . Hence
1
kyn xk = || kyn xk ||.
2
Thus we have (). Therefore, we must have Nm = Nm+1 for some m.
We now prove that
()
Assume that this does not hold. Then Nn is a proper subspace of Nn+1 for some
n > m. We consider an x Nn+1 \ Nn . By definition,
Tn+1 x = 0 but Tn x 6= 0.
Set z = Tnm x. Then
Tm+1 z = Tn+1 x = 0 but Tm z = Tn x 6= 0.
Hence
z Nm+1 but z
/ Nm .
So Nm is a proper subspace of Nm+1 . This contradicts (). The first statement is
proved, where r is the smallest n such that Nn = Nn+1 . Consequently, if r > 0, the
inclusions in the theorem are strict.
www.MATHVN.com
Problem 125
Let T : X X be a compact operator on a Banach space X and let 6= 0.
Then there exists a smallest integer q (depending on ) such that from n = q
on, the ranges Tn (X) are equal, and if q > 0, the inclusions
T0 (X) T1 (X) ... Tq (X)
are all proper (strict).
Solution.
For simplicity, we let Rn := Tn (X). Suppose that Rs = Rs+1 for no s. Then Rn+1 is
a proper subspace of Rn for every n. Since these ranges are closed, by Riesz lemma,
there is a sequence (xn ) in Rn such that
kxn k = 1 and kxn xk
1
x Rn+1 .
2
T xm T xn = xm (T xm + T xn + xn ).
1
kT xm T xn k = || kxm xk ||.
2
This contradicts the fact that (T xn ) has a convergent subsequence since (xn ) is
bounded and T is compact. Thus, Rs = Rs+1 for some s. Let q be the smallest s
such that Rs = Rs+1 . Then, if q > 0, the inclusions in the theorem are proper. Furthermore, Rq+1 = Rq means that T maps Rq onto itself. Hence repeated application
of T gives Rn+1 = Rn for every n > q.
Problem 126
Let A be an invertible operator, and let K be a compact operator in a Banach
space. Prove that
(a) dim(ker(A + K)) < .
(b) codim(Image(A + K)) < .
www.MATHVN.com
www.MATHVN.com
Problem 127
Consider the operator K : L2 ([0, 1]) L2 ([0, 1]) defined by
Z 1
(Kf )(t) =
k(t, s)f (s)ds
0
Solution.
(a) Since k(t, s) = k(s, t) and k(t, s) is a continuous function, the operator is selfadjoint and compact (see Problem 105).
(b) Since K is compact and self-adjoint, the spectrum of K consists of zero and real
eigenvalues1 . Assume that y = Ky. This means that
Z t
Z 1
(1) y(t) =
min{t, s}y(s)ds +
min{t, s}y(s)ds
0
t
Z t
Z 1
=
sy(s)ds +
ty(s)ds
0
t
Z 1
Z t
y(s)ds.
sy(s)ds + t
=
t
y(s)ds ty(t) =
y(s)ds
t
y 00 (t) = y(t).
Clearly, 6= 0; otherwise, y = 0 so ker(K) = 0. We have the differential equation
(3) y 00 + y = 0 with b.v.c. y 0 (0) = y(0) = 0
because of (1). Let us prove that > 0, which means that the operator K is positive.
Multiplying (3) by y and integrating we obtain
Z
y 00 (t)
y (t)dt + kyk2 = 0.
0
1
If T B(H) is self adjoint, all its eigenvalues are real. (We will see this in the next chapter.)
www.MATHVN.com
Z
0 1
y y|0
The b.v.c. yield
0 2
|y | dt + kyk2 = 0.
|y 0 |2 dt + kyk2 = 0.
Hence > 0.
The solution of the differential equation is
t
t
y = C1 cos + C2 sin .
C2
From the b.v.c. it follows that C1 = 0 and
cos 1 = 0. Therefore, the eigenvalues
of K are
4
k = 2
, k = 1, 2, ...
(2k 1)2
Since K is seft-adjoint, we obtain
kKk = max |k | = |1 | =
kN
4
.
2
(Kf )(t) =
Problem 129
Let S be the operator defined on C[0, 1] by
Z x
(Sf )(x) =
f (y)dy.
0
www.MATHVN.com
Solution.
(a) First we show that S is continuous. For f, g C[0, 1] we have
Z x
|f (y) g(y)|dy
0
Z x
sup
|f (y) g(y)|dy
x[0,1]
|(Sf )(x)|
|f (t)|dt kf kx = kf k
0
x1
, x [0, 1].
1!
By induction
Z
|(S
n+1
|S n f (t)|dt
Z x n
t
kf k
dt
0 n!
xn+1
= kf k
, x [0, 1], n = 1, 2, ...
(n + 1)!
f )(x)|
Thus,
kS n f k kf k
So
n 1/n
kS k
1
n!
1
,
n!
n = 1, 2, ...
1/n
0 as n .
www.MATHVN.com
Problem 130
Set
1x
(T f )(x) =
(a) Prove that T is a linear bounded and compact operator on C[0, 1].
(b) Calculate (T ) and the eigenvalues of T .
Solution.
(a)
Linearity of T : trivial.
Boundedness of T :
Z
|(T f )(x)| =
1x
0
f (y)dy kf k,
www.MATHVN.com
Thus,
|(T fn )(x) (T fn )(y)| < n N provided |x y| <
.
M
g(x)
, x [0, 1] and g(1) = g 0 (0) = 0.
Hence
g(x) = A cos(x/) with g(1) = 0.
This gives that
k =
1
, k Z.
+ k
= k [sin(t/k )]1x
h 0
i
= k sin
+ k (1 x)
2
= k (1)k gk (x).
Hence, = 2l , l Z are the eigenvalues of T , i.e.,
p (T ) = {2l , l Z}.
We know that (T ) is closed and (T ) \ {0} p (T ). This yields
(T ) = {0} p (T ).
www.MATHVN.com
Problem 131
Let T be a compact operator on a Hilbert space H and (n ) be a sequence of
complex numbers. Suppose there exists a nested sequence of distinct subspaces
(Mn ) such that for all n N
(i)
(ii)
Mn ( Mn+1
(T n I)Mn+1 Mn .
Solution.
Since Mn is a subspace of Mn+1 , we can write Mn+1 = Mn (Mn )M , where (Mn )M is
the orthogonal complement of Mn in Mn+1 . For short we write (Mn )M = Mn+1 Mn .
Let {en } be a sequence of unit vectors defined by
e1 M1 , en+1 Mn+1 Mn , n N.
Clearly, that is an orthonormal system. Moreover,
Problem 132
Let T be a compact operator on a Hilbert space H and any C > 0. Prove
that there is a finite number of linearly independent eigenvectors x1 , ..., xn of T
corresponding to eigenvalues 1 , ..., n such that i > C for all i = 1, ..., n.
Solution.
We can rescale to get kxi k = 1 for all i = 1, ..., n. Suppose to the contrary that
www.MATHVN.com
n
X
c i xi
i=1
n
X
ci (T n I)xi
i=1
=
=
n
X
i=1
n
X
ci (T xi n xi )
ci (i n )xi Mn1 .
i=1
Note: Argument in problems 130, 131 is the proof of Proposition 4 in the review at the beginning
of this chapter.
www.MATHVN.com
Chapter 10
Bounded Self Adjoint Operators
and Their Spectra
Review some main points.
Bounded self adjoint operators on Hilbert spaces were defined and considered before. This chapter
is devoted to their spectral properties.
Definition:
Let T B(H) where H is a complex Hilbert space. The adjoint operator of T is the operator
T : H H defined by
hT x, yi = hx, T yi, x, y H.
T is said to be self adjoint if T = T . We can say that T is self adjoint if and only if
hT x, yi = hx, T yi, x, y H.
Another equivalent condition is:
T is self adjoint if and only if hT x, xi is real for all x H.
Let T B(H) be a bounded self adjoint operator on the complex Hilbert space H.
Proposition 12 (Eigenvalues and eigenvectors)
1. All eigenvalues of T (if they exist) are real.
2. Eigenvectors corresponding to different eigenvalues of T are orthogonal.
Proposition 13 (Spectrum)
1. (T ) R.
2. (T ) [m, M ] where m = inf kxk=1 hT x, xi and M = supkxk=1 hT x, xi.
3. m, M (T ).
Proposition 14 (Norm)
kT k = max{|m|, |M |} = supkxk=1 |hT x, xi|.
143
www.MATHVN.com
Problem 133
Let T : H H be a bounded self-adjoint linear operator on a complex Hilbert
space H. Prove that the residual spectrum of T is empty, that is,
r (T ) = .
Solution.
Assume that r (T ) 6= . Take r (T ). By the definition of r (T ), T1 exists but
its domain is not dense in H. Hence, by the projection theorem, there is a y 6= 0 in
H such that y is perpendicular to the domain D(T1 ) of T1 . But D(T1 ) is the
range of T , hence
hT x, yi = 0, x H.
Since is real and T is self-adjoint, we obtain
hx, T yi = 0, x H.
Taking x = T y, we get kT yk2 = 0, so that
T y = T y y = 0.
Since y =
6 0, this shows that is an eigenvalue of T . But this contradicts
r (T ).
Second solution:
By Problem 91, noting that T is self adjoint, for any C we have
= ker(T I).
Image(T I) = ker(T I)
is an eigenvalue of T . Since T is self
And hence, if Image(T I) 6= H, then
is an eigenvalue of T . Therefore does not belong to
adjoint, is real. Thus =
the residual spectrum of T.
Problem 134
Let T : H H be a bounded self-adjoint linear operator on a complex Hilbert
space H. Prove that
()
(T ) c > 0 : x H, kT xk ckxk.
www.MATHVN.com
1
.
k
0 i.
hx, T x0 i = hx, x0 i = hx, x
0 . So x0 = 0 since otherwise,
= would be an eigenvalue of T ,
Thus T x0 = x
and T x0 = 0, which would imply
0 = kT x0 k ckx0 k > 0 : a contradiction.
1
A bounded linear operator T from a Banach space X onto a Banach space Y is an open
mapping. Hence if T is bijective, then T is continuous and thus bounded.
2
If Y is a closed subspace of H, then H = Y Y .
www.MATHVN.com
Problem 135
(a) Let A B(X) where X is a Banach space. Suppose there exists m > 0 such
that
kAxk mkxk, x X.
Show that Image A is closed in X.
(b) Let A B(H) be self adjoint, where H is a Hilbert space. Let C such
that Im 6= 0. Prove that
kAx xk |Im| kxk, x H.
Prove that is a regular point of A.
Solution.
(a) Let (xn ) be a sequence in X. Suppose Axn y as n . From the hypothesis
we get
kAxn Axm k mkxn xm k for n 6= m.
Since (Axn ) is a Cauchy sequence in X, it follows that (xn ) is also a Cauchy sequence
in X. Hence x x as n . But A is continuous, so Axn Ax as n . By
uniqueness of the limit, we obtain y = Ax. This shows that Image A is closed.
(b) Let = a + ib with a, b R and b = Im 6= 0. We have for all x H
kAx xk2 = hAx (a + ib)x, Ax (a + ib)xi
= h(A aI)x ibx, (A aI)x ibxi
= k(A aI)xk2 + b2 kxk2 ,
www.MATHVN.com
Problem 136
Let A B(H) be self adjoint, where H is a Hilbert space.
(a) Prove that
|hAx, xi|
kAk = sup
.
kxk2
x6=0
(b) Prove that at least one of kAk or kAk is an element of (A).
Solution.
(a) Using the Cauchy-Schwarz inequality, we have
|hAx, xi| kAxk kxk kAk kxk2 , x H.
Hence
sup
x6=0
|hAx, xi|
kAk.
kxk2
(i)
Now we establish the reverse. Notice first that for all x, y H we have
|hAx,xi|
,
kxk2
= C kxk2 + kyk2 .
()
Ax
Now let x be any vector with kxk = 1 and let y = kAxk
( the case Ax = 0 does not
give the supremum, hence we may assume that Ax 6= 0). Then kyk = 1. From ()
we get
www.MATHVN.com
(ii)
|hAx, xi|
.
kxk2
()
kxk=1
To close this chapter, we introduce a well known theorem relative to compact self adjoint operators
on Hilbert spaces:
The spectral theorem for compact self adjoint operators on Hilbert spaces.
Problem 137
Let T B(H) be a compact self adjoint operator on a Hilbert space H.
(a) There exists a system (finite or infinite) of orthonormal eigenvectors
{e1 , e2 , ...} of T and corresponding eigenvalues {1 , 2 , ...} of T such that |1 |
|2 | .... If the system is infinite then n 0 as n .
(b) Eigenvectors and eigenvalues mentioned above satisfy the following equation:
Tx =
k hx, ek iek , x H.
k=1
Solution.
(a) We use Proposition 13-3 (that we proved in Problem 136b) repeatedly for constructing eigenvalues and eigenvectors.
www.MATHVN.com
www.MATHVN.com
n
n
X
X
0 = T n xn = T x
hx, ek iTk ek =
k hx, ek iek .
k=1
That is,
Tx =
n
X
k=1
k hx, ek iek =
k=1
k hx, ek iek , x H.
k=1
k=1
= |n | kxn k 0 as n .
Hence
Tx =
k hx, ek iek , x H.
k=1
www.MATHVN.com
Bibliography
[1] Conway, J.B. A course in Functional Analysis. Second edition. Springer. New
York, 1990.
[2] Kreyszig. E. Introductory Functional Analysis with Applications. John Wiley
and Son. New York, 1989.
[3] Reed, M.; Simon, B. Methods of modern Mathematics Physics. I. Functional
Analysis. Second edition. Academic Press, Inc. New York, 1980.
[4] Royden. H.L. Real Analysis. Third edition. Prentice Hall. NJ, 1988.
[5] Rudin. W Functional Analysis. McGraw-Hill, Inc. New York, 1991.
[6] Yeh, J. Real Analysis. Theory of measure and integration. Second edition. World
Scientific. NJ, 2006.
151
www.MATHVN.com