Suggested Solutions To Test: Email Address: Ymei@math - Cuhk.edu - Hk. (Any Questions Are Welcome!)

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

MATH 4010 (2015-16) Functional Analysis CUHK

Suggested Solutions to Test


Yu Mei†

1. (5 points) Let X be the space of all continous real valued functions defined on [a, b]. Suppose the X is
Rb
endowed with the sup-norm, that is kf k := sup{|f (x)| : x ∈ [a, b]}. Define T : X → R by T (f ) = a f (x)dx for
f ∈ X. Show that T ∈ X ∗ and find kT k.
Proof. Since for any α, β ∈ R and f, g ∈ X
Z t Z t Z t
T (αf + βg) = αf (x) + βg(x)dx = α f (x)dx + β g(x)dx = αT f + βT g,
0 0 0

T is linear. Moreover, note that


Z b
|T f | = | f (x)dx| ≤ kf k(b − a),
a
Then T is bounded and kT k ≤ b − a.
Taking f ≡ 1, then
Z b
|T f | = | 1dx| = b − a,
a
which implies kT k ≥ b − a.
Therefore, T ∈ X ∗ and kT k = b − a.

2.Let X be a normed space. Supporse that there is a countable set D := {xn : kxn k = 1; n = 1, 2, · · · } dense in
the closed unit sphere of X.
For each f and g in BX ∗ := {f ∈ X ∗ : kf k ≤ 1}, define

X 1
d(f, g) := |f (xn ) − g(xn )|.
2n
n=1

(a) (5 points) Show that d is a metric on BX ∗ .

(b) (10 points) Let f ∈ BX ∗ . Show that for any ε > 0, we can find some elements x1 , · · · , xN in D and δ > 0
such that
d(f, g) < ε
whenever g ∈ BX ∗ with |f (xi ) − g(xi )| < δ for all i = 1, · · · , N .

Proof. Note that for any f, g ∈ BX ∗ ,


∞ ∞ ∞
X 1 X 1 X 1
d(f, g) := |f (x n ) − g(x n )| ≤ (kf k + kgk)kx n k ≤ < +∞.
2n 2n 2n−1
n=1 n=1 n=1

So. d is well defined.


† Email address: ymei@math.cuhk.edu.hk. (Any questions are welcome!)

1
MATH 4010 (2015-16) Functional Analysis CUHK

(a) It is easy to certify that d satisfy that d(f, g) ≥ 0, d(f, g) = d(g, f ) and d(f, g) ≤ d(f, h) + d(h, g).
Now we claim that d(f, g) = 0 if and only if f = g.
Indeed, if d(f, g) = 0, then |f (xn ) − g(xn )| = 0 i.e. f (xn ) = g(xn ). Since D is dense in the closed unit
sphere S of X, then for any x ∈ S, there exist a sequence {xnk } in D such that lim xnk = x. By the
k→∞
continuity of f and g, one has

f (x) = lim f (xnk ) = lim g(xnk ) = g(x).


k→∞ k→∞

x
Finally, for any x ∈ X − {0}, ∈ S, then it follows from the linearity of f and g that
kxk
x x
f (x) = kxkf ( ) = kxkg( ) = g(x).
kxk kxk

It is clear that f (0) = g(0). Therefore, f = g. On the other hand, it is obvious that d(f, g) = 0 when
f = g.

(b) Given any ε > 0, choosing N = 1 + [log2 ε], then


∞ ∞
X 1 X 1 1 ε
n
|f (xn ) − g(xn )| ≤ n−1
= N +1 <
2 2 2 2
n=N +1 n=N +1

ε
Let δ = , then
2
N −1 N −1
X 1 X 1 ε
n
|f (xn ) − g(xn )| ≤ n
δ<δ=
2 2 2
n=1 n=1

Therefore, d(f, g) < ε.

3. Let M be a closed subspace of a normed space X. Let Q : X → X/M be the quotient map. For each x ∈ X,
the distance between x and M is defined by d(x, M ) := inf{kx − mk : m ∈ M }.

(a) (5 points) Show that if F̄ ∈ (X/M )∗ , then kF̄ k = kF̄ ◦ Qk.


1
/ M , show that there is f ∈ X ∗ such that f (M ) ≡ 0; f (a) = 1 and kf k =
(b) (10 points) If a ∈ .
d(a, M )
Proof.

(a) Let F̄ ∈ (X/M )∗ . For any x ∈ X, set x̄ = Q(x). Then, by the definition of norm on quotient space
X/M
kx̄kX/M = inf kx − mk ≤ kx − 0k = kxk.
m∈M

Thus, kF̄ ◦ Q(x)k = kF̄ (x̄)k ≤ kF̄ kkx̄kX/M ≤ kF̄ kkxk.


Therefore, F̄ ◦ Q is bounded and kF̄ ◦ Qk ≤ kF̄ k.
On the other hand, for any x̄ ∈ X/M , there exists a m0 ∈ M such that kx − m0 k ≤ kx̄kX/M + ε.
Then,

kF̄ (x̄)k = kF̄ (Qx)k = kF̄ (Q(x−m0 ))k = kF̄ ◦Q(x−m0 )k ≤ kF̄ ◦Qkkx−m0 k ≤ kF̄ ◦Qk(kx̄kX/M +ε).

Since ε is arbitary, kF̄ k ≤ kF̄ ◦ Qk.

2
MATH 4010 (2015-16) Functional Analysis CUHK

(b) Let a ∈ / M . Then kākX/M = d(a, M ) > 0. Set X0 = {αā} and define F̄0 on X0 by F̄0 (αā) = α. Then
F̄0 is linear and F̄0 (ā) = 1. Since
1 1
|F̄0 (αā)| = |α| ≤ kαāk = kαāk.
kāk d(a, M )

F0 is bounded. Then
|α| = |F̄0 (αā)| ≤ kF0 kkαāk ≤ kF0 kkāk|α|
1
which implies that kF0 k ≥ . So, F0 is a linear bounded functional on X0 . By Hahn-Banach
d(a, M )
Theorem, there exists a bounded linear functional F̄ on X/M such that
1
F̄ (ā) = F̄0 (ā) = 1, and kF̄ k = kF̄0 k = .
d(a, M )

Set f = F̄ ◦ Q, then f (a) = F̄ ◦ Q(a) = F̄ (ā) = 1, f (M ) = F̄ (Q(M )) = F̄ (0) = 0. Moreover, by (a),


1
kf k = kF̄ k = .
d(a, M )

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy