You are on page 1of 1

MATH 6310

ASSIGNMENT 4
Due on Wednesday, Nov 18, 2020

Name M.U.N. Number


1. This project is used to understand some properties of a sequence (xj )∞
j=1 in a given Banach
space (X, k · kX ) over F:
(1a) Suppose f ∈ X ∗ and supj∈N |f (xj )| < ∞. Prove that (xj )∞
j=1 is bounded.

(1b) Suppose f ∈ X ∗ and ∞ j=1 |f (xj )| < ∞. Prove that there is a constant M > 0 such
P
Pk
that supk∈N k j=1 j xj kX ≤ M for any sequence (j )∞
j=1 (j = ±1).

(1c) Prove that ∞ ∗


j=1 |f (xj )| < ∞ for all f ∈ X if and only if there is a constant M > 0
P
P∞
such that j=1 |f (xj )| ≤ M kf k for all f ∈ X ∗ .

2. This project is used to understand the uniform boundedness principle:


(2a) Find an example to show that the completeness of (X, k·kX ) in the uniform boundedness
principle cannot be dropped.
P∞
(2b) Suppose y = (yj )∞
j=1 is a sequence of complex numbers. Prove that if the series j=1 yj x¯j
is convergent for any sequence x = (xj )∞j=1 ∈ c0 (N, C) then y ∈ `1 (N, C).

(2c) Suppose f is a real-valued Lebesgue measurable function on [0, 1], p ∈ [1, ∞), and f g
p
is Lebesgue integrable on [0, 1] for any function g ∈ Lp ([0, 1], R). Prove f ∈ L p−1 ([0, 1], R).

3. This project is used to understand the inverse operator theorem:


(3a) Use the closed graph theorem to prove the inverse operator theorem.
(3b) Suppose (X, k · k1 ) and (X, k · k2 ) are Banach spaces over F. Prove that if kxj k1 → 0
implies kxj k2 → 0 then there are two constants c1 , c2 > 0 such that c1 kxk1 ≤ kxk2 ≤ c2 kxk1
for all x ∈ X.

4. This project is used to understand weak and weak-star convergences in a separable Banach
space X over F:
(4a) Prove that if E is a bounded subset of X ∗ then every sequence in E contains a weak-star
convergent subsequence.
(4b) Suppose X = C([0, 1], F) is equipped with the sup-norm. Prove that (fj )∞ j=1 converges
weakly to f0 in X if and only if supj∈N kfj k∞ and limj→∞ fj (t) = f0 (t) for any t ∈ [0, 1].
(j)
(4c) For p > 1 let X = `p (N, F) be equipped with p-norm. Prove that xj = (xk )∞ k=1
(k)
converges weakly to x = (x(k) )∞
k=1 in X if and only if supj∈N kx k
j p < ∞ and limk→∞ j =
x
(k)
x for each k ∈ N.

You might also like