Model Answer Mid2-Mth462 - 2023-2024

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

FUNCTIONAL ANALYSIS MTH462- MIDTERM EXAMINATION -II-

- MODEL ANSWER-
 
QUESTION 1: 5marks=3+2

(1) We need to show x = (xk )k 7−→ kxk∞ = supk∈N |xk | is an norm on l∞ (C).
• We have from the definition that kxk∞ ≥ 0 for all x = (xk )k ∈ l∞ (C).

kxk∞ = 0 ⇐⇒ sup |xk | = 0 ⇐⇒ |xk | = 0 ∀ k ∈ N ⇐⇒ x = 0.
k∈N

kλ xk∞ = sup |λ xk | = |λ | sup |xk |, ∀ x ∈ l∞ (C), λ ∈ C.
k∈N k∈N
• For all x = (xk )k and y = (yk )k ∈ l∞ (C) we have
kx + yk∞ = sup |xk + yk |
k∈N
 
≤ sup |xk | + |yk |
k∈N
≤ sup |xk | + sup |yk |
k∈N k∈N
= kxk∞ + kyk∞ .
(2) Since we are given that this space is a normed vector space, the only thing left to
verify is that l∞ (C), k.k∞ ) is complete. We need to show that a Cauchy sequence in
l∞ (C), k.k∞ ) converges.
Let (X n )n be a Cauchy sequence in l∞ (C). Then
∀ ε > 0 : ∃ n0 ∈ N : ∀ n, m > n0 : kX n − X m k∞ < ε.
We observe that
 
|xkn − xkm | n m
≤ sup |xk − xk |
k∈N
= kX − X m k∞
n

< ε , ∀ n, m > n0 .
Hence for each k, (xkn )n is a Cauchy sequence in C, |.| . Now since C, |.| is a
 
Banach space, it follows that (xkn )n is convergent. Define the limit
xk = lim xkn .
n→∞

Set X = (xk )k and we need to show that kX n − Xk∞ → 0 as n → ∞ and X ∈ l∞ (C) . In


fact, Choose an ε > 0 , by replacing ε with ε/2 in the previous discussion, we can find
an n0 > 0 such that
ε
|xkn − xkm | ≤ ∀ k and ∀ n > n0 .
2
1
2

Taking limits as m → ∞ , we obtain


ε
|xkn − xk | ≤ / ∀ k and ∀ n, m > n0 .
2
Taking supremum in k, we obtain
ε
sup |xkn − xk | ≤ , ∀ n > n0 .
k∈N 2
Thus shows that kX n − Xk∞ < ε
2 < ε. Therefore X n converges to X. On other hand
kXk∞ ≤ kX n − Xk∞ + kX n k∞ .
 
QUESTION 2: 6marks=1+5

(i) Let x, y ∈ B(0, 1) we have


kt.x + (1 − t)ykX ≤ ktxkX + k(1 − t)ykX = tkxkX + (1 − t)kykX ≤ t + 1 − t = 1.
Therefore, tx + (1 − t)y ∈ B(0, 1). Thus, B(0, 1) is convex set.
(ii) (a) For all x, y ∈ X we have
kxk = kx − y + yk ≤ kx − yk + kyk =⇒ kxk − kyk ≤ kx − yk.
Similarly,
kyk = ky − x + xk ≤ ky − xk + kxk =⇒ kyk − kxk ≤ ky − xk = kx − yk

=⇒ − kxk − kyk ≤ kx − yk
=⇒ kxk − kyk ≥ −kx − yk.

−kx − yk ≤ kxk − kyk ≤ kx − yk =⇒ |kxk − kyk| ≤ kx − yk.


(b) Assume that xn −→ x and xn −→ y as n −→ ∞. We get
kx − yk = kx − xn + xn − yk ≤ kx − xn k + kxn − yk −→ 0 as n −→ ∞.
Hence, kx − yk = 0 which gives x = y.
(c)
If xn −→ x as n −→ ∞, it follows from the statement (i) that
|kxn k − kxk| ≤ kxn − xk −→ 0 as n −→ ∞.

(d) Since xn −→ x and yn −→ y as n −→ ∞, it follows that


k(xn + yn ) − (x + y)k = kxn − x + yn − yk ≤ kxn − xk + kyn − yk −→ 0 as n −→ ∞.
Therefore, xn + yn −→ x + y as n −→ ∞ as required.
(e) Since λn −→ λ as n −→ ∞, there exists M > 0 such that
|λn | ≤ M ∀ n ≥ 1.
3

kλn xn − λ xk = kλn xn − λn x + λn x − λ xk
= kλn (xn − x) + (λn − λ )xk
≤ |λn |kxn − xk + |λn − λ |kxk
≤ Mkxn − xk + |λn − λ |kxk −→ 0 as n −→ ∞.
 
QUESTION 3: 4marks=2+2

xk 
T : l∞ (C) −→ l∞ (C) : T (x) = T ((xk )k ) = .
k
(i) Let x, y ∈ l∞ (C) and α, β ∈ C we have
 
αxk + β yk
T (αx + β y) =
k
   
xk yk
= α +β
k k
= αT (x) + β T (y).
So, T is a linear operator.
On the other hand
xk  xk
kT (x)k∞ = k k∞ = sup | | ≤ sup |xk | = kxk∞ .
k k∈N k k∈N
Hence , T is bounded.
(ii) Compute kT k.
From the statement (i) we have kT (x)k∞ ≤ kxk∞ for all x ∈ l∞ (C). From which we
deduce that kT k ≤ 1. par
Set x0 = (1, 0, · · · , 0 · · · ). We have x0 ∈ l∞ (C) with kx0 k∞ = 1 and T (x0 ) = (1, 0, · · · , · · · ).
Moreover
kT x0 k∞ = 1 ≤ kT kkx0 k∞ = kT k ≤ 1.
Consequently, kT k = 1.

You might also like