MATH414 FUNCTIONAL ANALYSIS

HOMEWORK 2

Hw 2: 4/70 7/71 10/71 14/71 15/71

Problem (4/70)

(Continuity of vector space operations) Show that in a normed space

X, vector addition and multiplication by scalars are continuous operations with
respect to norm; that is, the mapping defined by (x, y) 7→ x + y and (α, x) 7→ αx
are continuous.

Solution

To show continuity of vector addition we have to show that if xn 7→ x and

yn 7→ y then xn + yn 7→ x + y. But this follows from

||xn + yn − x − y|| ≤ ||xn − x|| + ||yn − y|| 7→ 0 + 0 as n 7→ ∞.

Similarly to show continuity of scalar multiplication we must show αn 7→ α and

xn 7→ x implies αn xn 7→ αx. This follows from

||αn xn − αx|| = ||αn xn − αn x + αn x − αx||

≤ ||αn xn − αn x|| + ||αn x − αx||
= |αn | ||xn − x|| + |αn − α| ||x|| 7→ 0 + 0.
|{z}
bdd

Remark: If (X, d) and (Y, ρ) are metric spaces then X × Y , with product topol-
ogy on it, is also a metric space with metric D given by

D((x, y), (x0 , y 0 )) = d(x, x0 ) + ρ(y, y 0 ).

So this means that (xn , yn ) 7→ (x, y) iff xn 7→ x and yn 7→ y.

Problem (7/71)

(Absolute convergence) Show that convergence of ||y1 || + ||y2 || + ||y3 || + · · ·

may not imply convergence of y1 + y2 + y3 · · · .
∞ ∞
Solution Let F = {(ξn )n=1 ∈ l∞ | only finitely many terms of (ξn )n=1 is non-zero}.
Clearly F is a linear subspace of of l∞ , and so F is a normed space with sup
norm. Consider yn ∈ F defined by yn = (0, 0, ...0, n12 , 0, ...) where n12 is nth com-
ponent of yn . Since ||yn || = n12 , ||y1 || + ||y2 || + ||y3 || + · · · converges. However
∞
y1 + y2 + y3 · · · converges to ( n12 )n=1 in l∞ which is not in F . By uniqueness of
limit we obtain y1 + y2 + y3 · · · doesn’t converge in F .

Remark: This is because F is not complete. In fact in a Banach space you

1
can’t find such an example but in an incomplete normed space it is always pos-
sible to find a sequence as above, so this is a characterization of normed spaces.
Try to prove this fact.

Problem (10/71)

(Schauder basis) Show that if a normed space has a Schauder basis, it is

separable.
∞
Solution Let normed space X has a Schauder basis {en }n=1 . Lets define M ⊂ X
as follows
N
X
M ={ βn en : N ∈ N and β1 , β2 , ...βN ∈ Q + iQ }.
n=1

It is not hard to show M is countable, in fact it is countable union of countable

sets.
∞
M is dense in X. To see this lets fix arbitrary x ∈ X. By definition ∃! (αn )n=1
P ∞
in K such that n=1
αn en = x. Lets fix arbitrary  > 0. By definition of
convergence ∃N ∈ N such that
N
X 
|| αn en − x|| < .
n=1
2

Lets for n = 1, 2, ..., N choose βn ∈ Q + iQ such that


|βn − αn | < .
||en ||N (N + 1)
PN
Clearly n=1
βn en is in M and we have

N
X N
X N
X N
X
|| βn en − x|| ≤ || βn en − αn en || + || αn en − x||
n=1 n=1 n=1 n=1
N
X 
< |βn − αn |||en || +
n=1
2
N
X    
< ||en || + = + = .
n=1
||en ||N (N + 1) 2 2 2

So we can approximate x by the elements of M . Hence M is dense in X.

Remark: The converse of this question is not true, that is, there exists sep-
arable Banach space with no Schauder basis on it.

2
Problem (14/71)

(Quotient space) Let Y be a closed subspace of a normed space (X, ||.||).

Show that ||.||0 on X/Y is defined by

||x̂||0 = inf ||x||

x∈x̂

where x̂ ∈ X/Y , that is, x̂ is any coset of Y .

Solution

(N1) Clearly ||x̂||0 is a non-negative real number for any coset x̂.

(N2) x̂ = 0̂ implies 0 ∈ x̂, so ||x̂||0 = 0. Conversely let ||x̂||0 = 0. Then

there is a sequence {xn } in x̂ such that ||xn || 7→ 0. But Y is closed so any coset
of Y must be closed. Hence 0 ∈ x̂. This means that x̂ = 0̂.

(N3) Notice that ||0x̂||0 = ||0x||

c 0 = ||0̂||0 = 0 = 0||x̂||0 . And for any non-
zero α in K,
x
c 0 = inf ||x|| = xinf ||x|| = |α| xinf || || = |α|||x̂||0 .
||αx̂||0 = ||αx||
x∈αx
c α ∈x̂ α ∈x̂ α

(N4)

||x̂ + ŷ||0 = ||x[

+ y||0 = inf ||z||
z∈x
[+y
= inf ||z||
z∈x̂+ŷ
= inf ||u + v||
u∈x̂, v∈ŷ
≤ inf ||u|| + ||v||
u∈x̂, v∈ŷ
= inf ||u|| + inf ||y|| = ||x̂||0 + ||ŷ||0
u∈x̂ v∈ŷ

(Product of normed spaces) If (X1 , ||.||1 ) and (X2 , ||.||2 ) are normed spaces,
show that the product vector space X = X1 × X2 becomes a normed space if
we define
||x|| = max(||x1 ||1 , ||x2 ||2 ) [x = (x1 , x2 )].
Solution In fact all axioms are easy to verify. Lets, for example, show (N4).

||(x1 , x2 ) + (y1 , y2 )|| = ||(x1 + y1 , y2 + y2 )||

= max(||x1 + y1 ||1 , ||x2 + y2 ||2 )
≤ max(||x1 ||1 + ||y1 ||1 , ||x2 ||2 + ||y2 ||2 )
≤ max(||x1 ||1 , ||x2 ||2 ) + max(||y1 ||1 , ||y2 ||2 )
= ||(x1 , x2 )|| + ||(y1 , y2 )||.