Homework 4 1. Let X and Y be normed spaces, T B (X, Y ) and {xn } a sequence in X . If xn x weakly, show that T xn T x weakly.

Solution: We need to show that g (Tn x) g (T x) g Y . It suces to do this when g

Y

= 1. Observe that

|g (T xn ) g (T x)| = |g (T xn T x)| g Y T xn T x Y g Y T xn x X = T xn x X . Note that then we have xn x So, let

X

= sup
0=f X

|f (xn x)| f X
X

> 0 be given, and select f X with f xn x

X

= 1 such that 2 T .

< |f (xn x)| +

Since xn x weakly, there exists an integer N such that if n > N we have |f (xn ) f (x)| = |f (xn x)| < This then gives, |g (T xn ) g (T x)| T xn n
X

2 T

|f (xn x)| +

2 T

< .

2. If {xn } is a weakly convergent sequence in a real normed space X with xn x0 . Show that there is a sequence {ym } of linear combinations of elements of {xn } which converge strongly to x0 . Hint: Prove that the weak closure of a convex set is the same as the strong closure.

Solution: Note that if suces to prove that the following statement. If E X is a convex subset of a normed space, then the weak closure of E , denoted by E w is the same as the strong closure of E , denoted by E . Once we have this statement, we can apply it to

E = span{xn } in the following way. We have that x0 E w by hypothesis. But, E w = E by the claim. So we have that x E , which when we unpack the denitions gives the existence of {ym } a sequence of linear combinations of {xn } that converges strongly to x0 . So it suces to prove the claim. Since strong convergence implies weak convergence, we have that E E w . Suppose that x0 E . By your exam, there exists a functional f X such that f (x0 ) < f (x) x E. Consider the set {x : f (x) < }, this is a weak open set of x0 that does not intersect E , and so x0 / E w . Which gives E w E . 3. Let Tn B (X, Y ). Show that Tn T uniformly if and only if for every > 0 there is an N , depending only on such that for all n > N and all x X of norm 1 we have Tn x T x
Y

< .

Solution: Suppose rst that Tn T uniformly. Then we have that for any > 0 there exists N such that Tn T X Y < . Then we clearly have that Tn x T x
Y

Tn T

X Y

= Tn T

X Y

<

when n > N and x X with x X = 1. For the other direction, suppose that > 0 is given, then we need to show that Tn T when n > N ( ). Note that Tn T
X Y X Y

<

= sup
0=xX

Tn x T x x X

But, by the hypothesis, we have that Tn x T x

Y

<

when n > N ( ). This then clearly implies that Tn T which proves the result. 4. If a normed space X is reexive, show that X is reexive.
X Y

= sup
0=xX

Tn x T x x X

Solution: Let h X , then for every g X there is an x X such that g = Cx since X is reexive. Here C is the canonical map identifying X and X . Hence, h(g ) = h(Cx) := f (x) = h, where C : X X is the denes a bounded linear functional f on X , and Cf is surjective and so X is reexive. canonical mapping. Thus, C 5. Let X be a normed space and {fn } a sequence of linear functionals on X . Show (a) If fn f weakly, then fn f weak* too; (b) Show that if X is reexive, then the converse holds.

Solution: Part (a) is immediate since we have that X X where we have used the canonical mapping. Namely, each x X denes a functional x : X C by x (f ) := f (x). So, if we have weak convergence of the sequence of functionals, then we have weak-* convergence as well. If X is reexive, then we have that X = X , and so every linear functional on X can be identied with a functional of the form x . 6. A weak Cauchy sequence in a normed space is a sequence {xn } in X such that for every f X the sequence {f (xn )} is Cauchy. Show that a weak Cauchy sequence is bounded.

Solution: Dene x n : X C by x n (f ) = f (xn ). Since {xn } is a weak Cauchy sequence, then we have that {f (xn )} is a Cauchy sequence in C and hence bounded. Thus, we have that {x n (f )} is a bounded sequence, and since X is a Banach space we can apply the Uniform Boundedness Principle to conclude that sup x n <
n

But, this then gives that supn xn

< , which is what we wanted.

7. A normed space X is said to be weakly complete if each weak Cauchy sequence in X converges weakly in X . If X is reexive, show that X is weakly complete.

Solution: Let {xn } be a weak Cauchy sequence in X . Again, we will identify xn with x n via the canonical mapping. Note that by Problem 6 above, we have that supn xn X < . Since {f (xn )} is Cauchy in C, it has a limit, and we can dene (f ) = lim f (xn ) = lim x n (f )
n n

which exists for each f X . This denes a map : X C. This map is clearly linear since each x n is linear. Also, it is bounded since |x n (f )| = |f (xn )| f Passing to the limit we have |(f )| sup xn
n X

xn

sup xn
n

So we have that X . But, since X is reexive, there exists x X such that x = . But, then we have f (x) = x (f ) = (f ) = lim x n (f ) = lim f (xn )
n n

so that xn x weakly since f (xn ) f (x) for all f X . 8. Put fn (t) = eint , t [, ]. Let Lp = Lp (, ) with respect to Lebesgue measure. If 1 p < , show that fn 0 weakly in Lp , but not strongly.

Solution: Note that if p is a polynomial on [, ] then we clearly have that p, fn

L2

0.

The polynomials are dense in Lp when 1 p < , so for any f Lp , select a polynomial p such that f p Lp < . Then we have that f, fn
L2

= f p, fn

L2

+ p, fn

L2

.
L2 |

The second term goes to zero as n , in particular if n > N we have | p, fn For the rst term, note that we have | f p, fn where
1 p L2 |

< .

f p

fn q = f p

<

1 q

= 1. Thus for n > N we have that | f, fn

L2 |

<2 .

It is immediate that fn does not converge strongly to 0 in Lp when 1 p < since each element has norm 1. 9. A subset of a Banach space X is weakly bounded if for all f X , supxS |f (x)| < . Prove that S is weakly bounded if and only if it is strongly bounded, i.e., supxS x X < .

Solution: It is clear that if the set S is strongly bounded, then it must be weakly bounded since sup |f (x)| sup f
x S xS X

= f

sup x
xS

< .

Suppose now that S is weakly bounded. Then we have that sup |f (x)| <
x S

for all f X . Dene x : X C by x (f ) = f (x). Then, we have that sup |x (f )| = sup |f (x)| < .
xS x S

So, we have that for all x S that x is a uniformly bounded family of operators from X C. Hence by the Uniform Boundedness Principle, we have that sup x
xS X

<

But x

= x

X ,

and so we have the result.

1

10. If {xn } 1 show that j =1 y (j )xn (j ) 0 for every y c0 if and only if supn xn and xn (j ) 0 for all j 1.

<

Solution: Note that we have c 0 = innite sum

. For notational simplicity, let xn , y denote the xn (j )y (j ).

j =1

The easy direction then follows from testing on an obvious element in c0 and the Uniform Boundedness Principle. If we have j =1 y (j )xn (j ) 0 for every y c0 , then taking y = (0, . . . , 0, 1, 0, . . .) with the one occurring in the j th position, we have that

xn (j ) =
n=0

y (j )xn (j ) 0.

Since xn 1 , then it is a bounded linear functional on so we have that | xn , y | xn 1 y . The Uniform Boundedness Principle gives that sup xn
n
1

< .

Conversely, if we have supn xn 1 < and xn (j ) 0 for all j 1, we need to show j =1 y (j )xn (j ) 0. Fix y c0 and note that for any > 0 there exists J such that |y (j )| < .

Now we have that

J 1

y (j )xn (j ) =
j =1 j =1

y (j )xn (j ) +
j =J

y (j )xn (j ).

For the second term, we have that

y (j )xn (j )
j =J j =J

|y (j )| |xn (j )|

xn

sup xn
n

This can be made as small as we wish by choosing appropriately. Now for the rst term, we have that xn (j ) 0 for j = 1, . . . , J 1. Select N so that |xn (j )| J . Then we have that
J 1 J 1

y (j )xn (j ) y
j =1

|xn (j )| y
j =1

Combining these two estimates gives that xn , y 0 as n .