Scribd
Upload
67 views2 pages

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

This document contains solutions to homework problems from a functional analysis course. It addresses several problems involving linear operators and normed vector spaces. The key points are: 1) It proves properties of seminorms on vector spaces, including that the elements with seminorm 0 form a subspace, and a quotient space can be formed. 2) It shows an operator from l^∞ to l^∞ defined by dividing coordinates by their index is linear and bounded. 3) It finds the range and inverse of an operator on C[0,1] defined by integration, and shows the inverse is linear but unbounded.

Uploaded by

antoniocalvojhon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
67 views2 pages

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

This document contains solutions to homework problems from a functional analysis course. It addresses several problems involving linear operators and normed vector spaces. The key points are: 1) It proves properties of seminorms on vector spaces, including that the elements with seminorm 0 form a subspace, and a quotient space can be formed. 2) It shows an operator from l^∞ to l^∞ defined by dividing coordinates by their index is linear and bounded. 3) It finds the range and inverse of an operator on C[0,1] defined by integration, and shows the inverse is linear but unbounded.

Uploaded by

antoniocalvojhon
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MATH 4010 (2014-15) Functional Analysis CUHK

Suggested Solution to Homework 2


Yu Mei†

P71, 12. A seminorm on a vector space X is a mapping p : X → R satisfying (N1), (N3), (N4) in Sec. 2.2.
Show that
p(0) = 0,
|p(x) − p(y)| ≤ p(x, y).
(Hence if p(x) = 0 implies x = 0, then p is a norm.)
Proof. The property (N3) yields that, for any α ∈ R,
p(0) = p(α0) = |α|p(0)
So, p(0) = 0.
It follows from the property (N4) that, for any x, y ∈ X,
p(y) = p(y − x + x) ≤ p(y − x) + p(x).
Similarly,
p(x) ≤ p(x − y) + p(y)
Hence, |p(x) − p(y)| ≤ p(x − y), where (N3) has been used. 

P71, 13. Show that in Prob. 12, the elements x ∈ X such that p(x) = 0 form a subspace N of X and a norm
on X/N (c.f. Prob. 14, Sec. 2.1) is defined by kx̂k0 = p(x), where x ∈ x̂ and x̂ ∈ X/N .
Proof.
(1) For any x, y ∈ N (i.e.p(x) = p(y) = 0), it follows from (N1), (N4) and (N3) that
0 ≤ p(αx + βy) ≤ p(αx) + p(βy) = |α|p(x) + |β|p(y) = 0, α, β ∈ R.
So, αx + βy ∈ N which implies that N is a subspace of X.
(2) First, for any x1 , x2 ∈ x̂, there exist n1 , n2 ∈ X such that x1 = x + n1 , x2 = x + n2 . Then,
|p(x1 ) − p(x2 )| ≤ |p(x1 − x2 )| = |p(n1 − n2 )| = 0,
since N is a subspace. So, p(x1 ) = p(x2 ), i.e. kx̂k0 = p(x) is well-defined, which is independent of the
choice of represent element x. Now, we verify that k · k0 satisfies (N1)-(N4):
(N1) Since p(x) ≥ 0, kx̂k0 ≥ 0.
(N2) If kx̂k0 = 0, then p(x) = 0, so that x ∈ N . Hence x̂ = N , i.e. x̂ = 0̂ ∈ X/N.
(N3) Since αx̂ = αx + N , it holds that, for some n ∈ N ,
kαx̂k0 = p(αx + n) = p(α(x + n/α)) = |α|p(x + n/α) = |α|kx̂k0 , f or α 6= 0.
It is clear that, for α = 0,
k0x̂k0 = 0 = 0kx̂k0 .
(N4) For any x̂ = x + N, ŷ = y + N , x̂ + ŷ = x + y + N . Then,
kx̂ + ŷk0 = p(x + y) ≤ p(x) + p(y) = kx̂k0 + kŷk0 .

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

1
MATH 4010 (2014-15) Functional Analysis CUHK

P101, 5. Show that the operator T : `∞ → `∞ defined by y = (ηj ) = T x, ηj = ξj /j, x = (ξj ), is linear and
bounded.
Proof. For any x1 = (ξj1 ), x2 = (ξj2 ),

T (αx1 + βx2 ) = ((αξj1 + βξj2 )/j) = (αξj1 /j) + (βξj2 /j) = αT x + βT y, f or α, β ∈ R.

So, T is linear.
On the other hand, since ξj /j ≤ ξj for any j ∈ N+ ,

kT xk`∞ = sup |ξj /j| ≤ sup |ξj | = kxk`∞ .


j≥1 j≥1

So, T is bounded. 

P101, 9. Let T : C[0, 1] → C[0, 1] be defined by


Z t
y(t) = x(τ )dτ.
0

Find R(T ) and T −1 : R(T ) → C[0, 1]. Is T −1 linear and bounded?


Proof. By the Fundamental Theorem of Calculus, one has

R(T ) = {y(t)|y(t) ∈ C 1 [0, 1], y(0) = 0} ⊂ C[0, 1].

and T −1 : R(T ) → C[0, 1] is


T −1 y(t) = y 0 (t).
Since the differentiation is linear, so is T −1 . But T −1 is unbounded. Indeed, for yn (t) = tn , t ∈ [0, 1], n ∈ N+ ,
it is clear that
yn (t) ∈ R(T ) ⊂ C[0, 1], and kyn (t)kC0 = 1, for any n ∈ N+ ,
where kf (t)kC0 := sup |f (t)| for any f (t) ∈ C[0, 1]. However,
t∈[0,1]

kT −1 (yn )kC0 = kyn0 (t)kC0 = kntn−1 kC0 = n → +∞, as n → +∞.

Hence, T −1 is not bounded. 

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