Académique Documents
Professionnel Documents
Culture Documents
Solutions to Exercises
James C. Robinson
Contents
1 Examples I page 1
2 Examples II 5
3 Examples III 9
4 Examples IV 15
iii
1
Examples I
1. Suppose that
n
X m
X
v= αj ej and v= βk fk .
j=1 k=1
with the understanding that the first sum is zero if n0 = 0, and the second
zero if n0 = m.
It follows that
n n 0 m
X X X
αj e j − βk ek − βk fk = 0,
j=1 k=1 k=n0 +1
or
n0 n m
X X X
(αj − βj )ej − αj ej + βk fk = 0.
j=1 k=n0 +1 k=n0 +1
1
2 1 Examples I
3. Write
kxkp`p =
X X
|xj |p = |xj |p−α |xj |α .
j j
kxkp`p ≤
X X
|xj |(p−α)a |xj |αb
j j
= kxkp−α
`(p−α)a
kxkα`αb .
so that the factors on the right are powers of kxk`q and kxk`r . Thus
b = r/α; since a, b are conjugate it follows that a = r/(r − α), and then
the condition that (p − α)a = q gives
then
1 1
kxk2 ≤ kxk1 ≤ kxk2 ,
b a
while
(ii) if
akxk1 ≤ kxk2 ≤ bkxk1
and
αkxk2 ≤ kxk3 ≤ βkxk2
then
aαkxk1 ≤ kxk3 ≤ bβkxk1 .
We have
2
n
X n
X n
X
|xj |2 ≤ |xj | ≤ n |xj |2 ,
j=1 j=1 j=1
√
which gives kxk2 ≤ kxk1 ≤ n kxk2 , and
n
X
max |xj | ≤ |xj | ≤ n max |xj |,
j=1,...,n j=1,...,n
j=1
f −1 (K) = {x ∈ X : f (x) ∈ K}
is closed. (In fact this is in the proof of Corollary 3.12 in the notes.)
Take xn ∈ f −1 (K), and suppose that xn → x; since f is continuous,
f (xn ) → f (x). But f (xn ) ∈ K, and K is closed, so f (x) ∈ K. It follows
that x ∈ f −1 (K), and so f −1 (K) is closed.
Now suppose that whenever K is closed, f −1 (K) is closed. Take xn ∈ X
with xn → x, and suppose that f (xn ) 6→ f (x). Then for some subsequence
xnj , we must have
|f (xnj ) − f (x)| > .
clearly a contradiction.
7. Let Y be closed subset of the compact set K. If yn ∈ Y then yn ∈ K,
so there is a subsequence ynj such that ynj → y ∈ K. Since Y is closed,
y ∈ Y , and so Y is compact.
8. If {un } is a Cauchy sequence in U then, since U ⊂ V and the norm on U
is simply the restriction of the map u 7→ kukV to U , it follows that {un }
is also a Cauchy sequence in V . Since V is complete, un → u for some
u ∈ V . But since U is closed, we know that if un → u then u ∈ U . So U
is complete.
4 1 Examples I
In particular {xkj }∞
k=1 is a Cauchy sequence in K for every fixed j. Since
K is complete (recall K = R or C) it follows that for each k ∈ N
xkj → ak
for some ak ∈ R.
Set a = (a1 , a2 , · · · ). We want to show that a ∈ `∞ and also that
kxk − ak`∞ → 0 as k → ∞. First, since {xk } is Cauchy we have from (1.1)
that kxn − xm k`∞ < for all n, m ≥ N , and so
sup |xnj − xm
j | ≤ .
j
Letting m → ∞ we obtain
sup |xnj − aj | ≤ ,
j
Examples II
So
∞
X
kx − (x1 , x2 , . . . , xn , 0, 0, . . .)k2`2 = |xj |2 → 0
j=n+1
{y ∈ B : ky − xk < } ⊂ X ∩ Y,
and so X ∩ Y is open.
Now, given z ∈ B and > 0, since X is dense there exists an x ∈ X
such that kx − zk < /2. Since X is open, there is a δ < /2 such that
5
6 2 Examples II
(j) P∞
and j,k |Ik | < j=n+1 2−j = 2−n .
P
(iv) Follows from the same properties for step functions, along similar
lines to the above.
7. For x ∈ [n, n + 1) we have
x n x n−1
(−1)j (−1)n
Z Z Z X
= f (r) dr + f (r) dr = + (x − n) ,
0 1 n j n
j=1
and so
x ∞
(−1)j
Z X
lim f (x) dx = < ∞.
x→∞ 0 j!
j=1
Since f ≥ φn ,
Z Z Z
|f − φn | = f− φn ,
R
which tends to zero as n → ∞ by the definition of f.
Now take a step function
n
X
φ(x) = cj χIj (x)
j=1
then Z
|φ (x) − φ(x)| dx < .
Z Z X n
n
2 n
!2 ∞
!2
X
X X
gn = ( |fk |)2 =
|fk |
≤ kfk kL2 ≤ kfk kL2
k=1 k=1 L2 k=1 k=1
using the definition of the L2 norm and the triangle inequality. It follows
that gn → g almost everywhere for some g ∈ L1 . It follows that ∞
P
k=1 fk
is absolutely convergent almost everywhere to some f ∈ L . 2
Examples III
2. Write
Z t 2 Z t 2
−1/2 1/2
|f (r)| dt = r |f (r)| dr
r
s s
Z t Z t
−1 2
≤ r dr r|f (r)| dr
s s
1/2
≤ K(log t − log s)
for some αj ∈ K and ej ∈ E. Then taking the inner product of both sides
with ek (with k = 1, . . . , n) gives
Xn
( αj ej , ek ) = 0 ⇒ αk = 0,
j=1
9
10 3 Examples III
and so
r
7
e4 = (5x3 − 3x).
8
3x 1 7(5x3 − 3x) 1 3
Z Z
f3 (x) = t sin t dt + (5t − 3t) sin t dt.
2 −1 8 −1
Now,
Z 1 Z 1
t sin t dt = [−t cos t]1−1 + cos t dt = [sin t]1−1 = 2 sin 1
−1 −1
12 3 Examples III
and
Z 1 1
Z 1
t sin t dt = −t3 cos t −1 +
3
3t2 cos t dt
−1 −1
1
Z 1
= 3t2 sin t −1 − 6
t sin t dt
−1
= −6 sin 1,
giving
Z 1
(5t3 − 3t) sin t dt = −36 sin 1;
−1
it follows that
7(27x − 45x3 ) 195x − 315x3
f3 (x) = sin 1 3x + = sin 1 .
2 2
11. First way: given orthonormal polynomials ẽj (x) on [−1, 1] put
√
ej (x) = 2 ẽj (2x − 1),
since then
Z 1 Z 1 Z 1
ej (x)ek (x) dx = 2 ẽj (2x − 1)ẽk (2x − 1) dx = ẽj (y)ẽk (y) dy.
0 0 −1
Examples IV
1. If kxkX ≤ 1 then
x
x
kAxkY = kxkX
A
≤ A
,
kxkX
kxkX
and so since k(x/kxkX )kX = 1 we have
sup kAxkY ≤ sup kAzkY ≤ sup kAzkY .
kxkX ≤1 kzkX =1 kzkX ≤1
2. Given x ∈ `2 , we have
X |xj |2 X
kT xk2`2 = ≤ |xj |2 ,
j2
j j
15
16 4 Examples IV
of this would be the sequence consisting all of 1s, which is not an element
of `2 . So the range of T is not closed.
3. Clearly fφ is linear. Given u ∈ C 0 ([a, b]) we have
Z b
|fφ (u)| = φ(t)u(t) dt
a
Z b
≤ max |u(t)| |φ(t)| dt
t∈[a,b] a
Z b
= kuk∞ |φ(t)| dt, (4.1)
a
Rb
and so kfφ k ≤ a |φ(t)| dt. Now since φ is continuous we can find a
sequence of continuous functions un that approximate the sign of φ (+1
if φ > 0, −1 if φ < 0) increasingly closely in the L2 norm: if φ(s) 6= 0
then there is an interval around s on which φ has the same sign. Since
this interval has non-zero length, and the union of these intervals lies
within [a, b], there are at most a countable number, {Ij }∞ j=1 . Let un be
the continuous function defined on Ij = (lj , rj ) as
(t − lj )/δj,n lj ≤ t ≤ lj + δj,n
un (t) = sign(φ(t)) × 1 lj + δj,n < t < rj − δj,n
(rj − t)/δj,n rj − δj,n ≤ t ≤ rj
where δj,n = min(2−(n+j) , (rj − lj )/2), and zero when φ(t) = 0. Then
Z b ∞
X
|un (t) − sign(φ(t))|2 dt ≤ 2−(n+j) = 2−(n−1) ,
a j=1
Since φ ∈ C 0 ([a, b]) we know that kφkL2 < ∞, and we have just shown
Examples IV 17
i.e.
(x, T z) = 0 for all z ∈ H.
kT ∗ xk2 = (T ∗ x, T ∗ x) = (T T ∗ x, x) ≤ kT T ∗ xkkxk.
kT T ∗ xn − T T ∗ xm k = kT T ∗ (xn − xm )k ≤ .
kT ∗ xn − T ∗ xm k2 ≤ M for all n, m ≥ N.
u 7→ (T u, z).
and it is bounded,
|(T u, z)| ≤ kT ukkzk ≤ kT kop kzk kuk.
(T u, z) = f (u) = (u, y)
Since
Z b
ki (x) = K(x, y)φi (y) dy,
a
20 4 Examples IV
we have
Z b Z b Z b 2
2
|ki (x)| dx =
K(x, y)φi (y) dy dx
a a a
Z b Z b Z b
2 2
≤ |K(x, y)| dy |φi (y)| dy dx
a a a
Z b Z bZ b
= |φi (y)|2 dy × |K(x, y)|2 dy dx,
a a a
Then
Z b
n
(T x)(t) = K(t, s)(T n−1 x)(s) ds
a
Z b Z b
= K(t, s) Kn−1 (s, r)x(r) dr ds
a a
Z bZ b
= K(t, s)Kn−1 (s, r)x(r) dr ds
a a
Z b Z b
= K(t, s)Kn−1 (s, r) ds x(r) dr,
a a
i.e.
Z b
n
(T x)(t) = Kn (t, r)x(r) dr.
a
with
Z b
Kn (t, r) = K(t, s)Kn−1 (r, s) ds
a
as claimed.
11. We have
X∞ ∞
X
(T u, v) = λj (u, ej )ej , v = λj (u, ej )(ej , v)
j=1 j=1
∞
X ∞
X
= u, λj (ej , v)ej = u, λj (v, ej )ej
j=1 j=1
= (u, T v)
and so T is self-adjoint. Now consider Tn u defined by
n
X
Tn u = λj (u, ej )ej .
j=1
we have from the fact that λn → 0 that given any > 0 there exists an
N such that for all n ≥ N we have |λj | < , and hence
∞
X ∞
X
2 2 2 2
kTn u − T uk ≤ |(u, ej )| ≤ |(u, ej )|2 = 2 kuk2 ,
j=n+1 j=1
i.e.
kTn − T kop ≤ ,
and so T ek = λk ek .
To show that these are the only eigenvalues and eigenvectors, if u ∈
L (a, b) with u = w + ∞
2
P
k=1 (u, ek )ek and T u = λu then, since w ⊥ ej for
all j,
∞
X
Tu = Tw + (u, ek )T ek
k=1
∞ Z
X b
= λj ej (x)ej (y)(u, ek )ek (y) dy
j,k=1 a
X∞
= λj (u, ej )ej (x)
j=1
and
∞
X
λu = λ(u, ej )ej (x).
j=1
λ(u, ek ) = λk (u, ek ),
so either (u, ek ) = 0 or λ = λk .
Examples IV 23
(i) Let (a, b) = (−π, π) and consider K(t, s) = cos(t−s). Then K is clearly
symmetric, so the corresponding T is self-adjoint. We have
recall that cos t and sin t are orthogonal in L2 (−π, π). We have
Z π
T (sin t) = K(t, s) sin s ds
−π
Z π
= cos t cos s sin s − sin t sin2 s ds
−π
= −2π sin t
and
Z π
T (cos t) = K(t, s) cos s ds
Z−π
π
= cos t cos2 s − sin t sin s cos s ds
−π
= 2π cos t.
Then in fact
r ! r ! r ! r !
3 3 8 5 2 5 2
K(t, s) = 4 t s + (3t − 1) (3s − 1) ,
2 2 5 8 8
q q
and so, since { 32 t, 58 (3t2 −1)} are orthonormal (they are some of the
Legendre polynomials from Chapter 6) the integral operator associated
with K(t, s) has
8
T (t) = 4t and T (3t2 − 1) = (3t2 − 1).
5
13. This equation is the equation in Theorem 14.2 with p = 1 and q = 0. So
it suffices to show that (i) u1 (x) = x satisfies the equation −d2 u/dx2 = 0
with u(0) = 0 (which is clear), (ii) that u2 (x) = (1 − x) satisfies the same
equation with u(1) = 0 (which is also clear), and (iii) that Wp (u1 , u2 ) = 1:
Or one could follow the proof of Theorem 4.12 with this particular choice
of G to show that u(x) as defined does indeed satisfy −d2 u/dx2 = f .
24 4 Examples IV
14.(i) If x 6= 0 then kxk > 0, from which it follows that kT xk > 0, and so
x ∈/ Ker(T ). So Ker(T ) = {0} and T −1 exists for all y ∈ range(T ).
Then we have
kT (T −1 x)k2 ≥ αkT −1 xk2 ,
and so
continuous, so
n
X
l(x) = l lim xj ej
n→∞
j=1
n
X
= lim l xj ej
n→∞
j=1
n
X
= lim xj l(ej )
n→∞
j=1
∞
X
= xj l(ej )
j=1
X∞
= x j yj ,
j=1
Also
n n
(n)
X |yj |q X
l(x )= yj = |yj |q .
yj
j=1 j=1
Since this holds for every n, we must have y ∈ `q with kykq ≤ klkp∗ .