Assignment 4 for MATH301

Sam van Betuw

22 April

1. (a) We need to show that ∞ 2

P
n=1 |T xn | < ∞.
Fix x ∈ `2 . Now consider,

∞
X
|T xn |2 = (x21 + x23 + x25 + ...) + (9x22 + 9x23 + ...)
n=1
= (x21 + x23 + x25 + ...) + 9(x22 + x23 + ...)
X∞ X ∞
2
= |x2n−1 | + 9 |x2n |2
n=1 n=1
X∞ ∞
X
≤ |xn |2 + 9 |xn |2
n=1 n=1
∞
X
= 10 |xn |2
n=1
<∞

P∞
Thus n=1 |T xn |2 < ∞.
(b) We need to show that for all x, y ∈ `2 and c ∈ C, that T (x + y) = T (x) + T (y)
and T (ax) = aT (x).
So, fix x, y ∈ `2 . Then
x + y = {xn } + {yn } = {xn + yn }. Thus
T (x + y) = ((x + y)1 , 3(x + y)2 , (x + y)3 , 3(x + y)4 , ...)
= (x1 + y1 , 3x2 + 3y2 , x3 + y3 , 3x4 + 3y4 , ...)
= (x1 , 3x2 , x3 , 3x4 , ...) + (y1 , 3y2 , y3 , 3y4 , ...)
= T (x) + T (y)
Now, fix x ∈ `2 and c ∈ C.
So ax = a{xn } = {axn }. Then
T (ax) = (ax1 , 3ax2 , ax3 , 3ax4 , ...)
= a(x1 , 3x2 , x3 , 3x4 , ...)
= aT (x).

1
 Thus T is linear.
(c) Fix x ∈ `2 . Consider,

kT xk2 = k(x1 , 3x2 , x3 , 3x4 , ...)k2

= (|x1 |2 + 9|x2 |2 + |x3 |2 + 9|x4 |2 + ...)
≤ (9|x1 |2 + 9|x2 |2 + 9|x3 |2 + 9|x4 |2 + ...)
= 9(|x1 |2 + |x2 |2 + |x3 |2 + |x4 |2 + ...)
= 9kxk2

So kT xk ≤ 3kxk for all x ∈ `2 .

Since kT kop = inf{C : kT xk ≤ Ckxk ∀ x ∈ `2 }, and we have shown that
kT xk ≤ 3kxk, kT kop ≤ 3.
(d) Now we have to show that kT kop ≥ 3.
Take x ∈ `2 , x = (0, 1, 0, 0, ...). So kxk = 1.
So T x = (0, 3, 0, 0, ...) =⇒ kT xk2 = k(0, 3, 0, 0, ...)k2 = 9 =⇒ kT xk = 3.
Now, since kT kop = sup{kT xk : x ∈ `2 , kxk = 1}, kT kop ≥ 3.
Because we know from (c) that kT kop ≤ 3, and we know that
kT kop ≥ 3, kT kop = 3 as required.

2. (a)

kpn k2 = (p | p)
Z 1
= pn (x)pn (x) dx
0
Z 1
= xn xn dx
Z0 1
= x2n dx
0
 2n+1 1
x
=
2n + 1 0
1 0
= −
2n + 1 2n + 1
1
=
2n + 1

2
 kDpn k2 = (Dpn | Dpn )
Z 1
= (Dpn )(x)(Dpn )(x) dx
0
Z 1
= p0n p0n dx
0
Z 1
nxn−1 nxn−1 dx



=
Z0 1
= n2 x2n−2 dx
0
Z 1
2
=n x2n−2 dx
0
 2n−1 1
x
= n2
2n − 1 0
 
2 1
=n −0
2n − 1
n2
=
2n − 1

(b) We will prove that D is not bounded on V by contradiction.

Suppose that D is bounded on V . Then there exists a constant C such that
kDpn k ≤ Ckpn k for all pn ∈ V , thus for all n.
n2 1
So kDpn k2 ≤ C 2 kpn k2 =⇒ 2n−1 ≤ C 2 2n+1 =⇒ n2 (2n + 1) ≤ C 2 (2n − 1) for all
n.
But consider n ≥ C =⇒ n2 ≥ C 2 . Then n2 (2n + 1) ≥ C 2 (2n + 1) ≥ C 2 (2n − 1).
Thus if n ≥ C, n2 (2n + 1) ≥ C 2 (2n − 1), contradicting that n2 (2n + 1) ≤
C 2 (2n − 1) for all n.
Thus there exists no constant C such that kDpn k ≤ Ckpn k for all pn ∈ V , and
so D is not bounded on V .