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

Functional Analysis

Final Exam - Version 2


L. Pedro Poitevin
June 27, 2007

Definition 1. Let X be a vector space equipped with two norms. Denote X1 = (X, k · k1 )
and X2 = (X, k · k2 ). The norms k · k1 and k · k2 are said to be equivalent if the identity
mapping IX : X → X defined by IX (x) = x is an isomorphism between the spaces X1
and X2 , that is to say, if there exist constants c, C > 0 such that
ckxk2 ≤ kxk1 ≤ Ckxk2

for every x ∈ X.

1. Let (xn ) be a sequence in a vector space X and let x ∈ X. Show that if k · k1 and
k · k2 are equivalent norms on X, then kxn − xk1 → 0 if and only if kxn − xk2 → 0.
(20 points)
2. Let C[0, 1] denote the Banach space of all continuous functions from [0, 1] into R
equipped with the supremum norm k · k∞ defined by kf k∞ = supx∈[0,1] |f (x)|. Let
g ∈ C[0, 1] be fixed. Define T : C[0, 1] → C[0, 1] by
Z x
T (f )(x) = g(t) dt.
0

(a) Prove that T is a linear operator. (5 points)

(b) Let Im(T ) = {T (f ) | f ∈ C[0, 1]}. Show that Im(T ) 6= C[0, 1]. (5 points)

2
(c) Let T −1 : Im(T ) → C[0, 1] be the inverse operator. Identify T −1 . (5 points)

(d) Is T −1 a bounded linear operator? (Prove or disprove.) (5 points)

3
3. Let H = l2 and let F denote the subspace of H consisting of vectors in H having finite
support. (Recall that the support of a sequence (xn ) ∈ l2 , denoted by supp((xn )), is
defined by supp((xn )) = {n ∈ N | xn 6= 0}.) Show that F + F ⊥ 6= H. (Hint: first
identify F ⊥ , of course.) (20 points)

4
4. Let X = l∞ be equipped with the norm k·k∞ , and let (xi )ni=1 be a linearly independent
set of normalized vectors in X. Let (αi )ni=1 be a finite set of set of real numbers with
|αi | ≤ 1 for all i = 1, . . . , n. Show that there is f ∈ X ∗ such that f (xi ) = αi for
i = 1, . . . , n. (20 points)

5
5. Let C be an open convex subset of a Banach space X that contains a neighborhood of
0. Prove that C = {x ∈ X | µC (x) < 1}, where µC denotes the Minkowski functional
associated with C. (20 points)

6
R
6. Assume that |f |p dm < ∞ for every p ∈ [1, ∞). Prove that the map J : [1, ∞) → R
defined by µZ ¶
p
J(p) = log |f | dm

is a convex function. (20 points)

You might also like