Assignment I

FUNCTIONAL ANALYSIS


May 30, 2016

Submitted to

Dr. Shiferaw Feyissa

Name
1.
2.
3.
4.
5.

Abener Tewodros .
Hana Endiris . . .
Habtamu Meressa
Miliyon Tilahun . .
Sisai Bekele . . . .

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

.
.
.
.
.

ID No
. GSR/1417/08
. GSR/1419/08
. GSR/1399/08
. GSR/1401/08
. GSR/1426/08

Functional Analysis Problems

Exercise 1.1. Show that the dual space of Rn is Rn .

Solution. Rn is a finite dimensional normed space with the Euclidean norm.
We know that for a finite dimensional normed space every linear operator is bounded. Thus Rn0 = Rn .
Every f Rn has a representation:
f (x) =

n
X

i i ,

i = f (ei )

i=1

By the Cauchy-Schwarz inequality,

|f (x)|

n
X
i=1

|i i |

X
n

i2

1/2 X
n

i=1

i2

1/2

X
1/2
n
i2
= ||x||

i=1

i=1

Taking the supremum over all x of norm 1 we obtain

||f (x)||

X
n

i2

1/2

i=1

However, since for x = (1 , . . . , n ) equality is achieved in the Cauchy Schwarz

inequality, we must in fact have
||f (x)|| =

X
n

i2

1/2

i=1

This proves that the norm of f is the Euclidean norm, and ||f || = ||c||, where
c = (k ) Rn .
Hence the mapping of Rn0 onto Rn defined by f 7 c = (k ), k = f (ek ), is
norm preserving and, since it is linear and bijective, it is an isomorphism.
Exercise 1.2. Show that the dual space of `p for 1 < p < and
is `q .

1
p

1
q

=1

Solution. A Schauder basis for `p is (ek ), where ek = (kj ) has 1 in the kth
place and zeros otherwise. Then every x `p has a unique representation
x=

X
k=1

k ek

We consider any f `p0 , where `p0 is the dual space of `p . Since f is linear
and bounded,
f (x) =

k k ,

where k = f (ek ).

(1)

k=1
(n)

Let q be the conjugate of p i.e. 1/p + 1/q = 1 and consider xn = (k ) with

(
|k |q /k
if k n and k 6= 0,
(n)
k =
(2)
0
if k > n or k = 0.
By substituting this into (1) we obtain
f (xn ) =

(n)
k k

|k |q .

k=1

k=1

We also have, using (2) and (q 1)p = q,

1/p
X
n
(n)
|k |p
f (xn ) kf kkxn k = kf k
k=1

1/p
X
n
(q1)p
|k |
= kf k
k=1

X
1/p
n
= kf k
|k |q
k=1

Thus
f (xn ) =

n
X

X
1/p
n
|k |q kf k
|k |q
k=1

k=1

Dividing by the last factor and using 1 1/p = 1/q, we get

X
n

|k |

11/p
=

X
n

k=1

|k |

1/q
kf k

k=1

Since n is arbitrary, letting n , we obtain

X

|k |q

1/q

k=1

Hence (k ) `q .
3

kf k

(3)

Conversely, for any b = (k ) `q we can get a corresponding bounded

linear functional g on `p . In fact, we may define g on `p by setting
g(x) =

k k

k=1

where x = (k ) `p . Then g is linear, and boundedness follows from the

Holders inequality. Hence g `p0 .
We finally prove that the norm of f is the norm on the space `q .
From (1) and the Holders inequality we have
X
 X
1/q
1/q
X
1/p X



|k |q
|k |q
= kxk
|k |p
k k 
|f (x)| = 
k=1

k=1

k=1

k=1

Hence by taking the supremum over all x of norm 1 we obtain

kf k

X

1/q

|k |

(4)

k=1

From (3) and (4) we see that the equality sign must hold, that is,
kf k =

X

|k |q

1/q
(5)

k=1

This can be written kf k = kckq , where c = (k ) `q and k = f (ek ). The

mapping of `p0 onto `q defined by f 7 c is linear and bijective, and from (5)
we see that it is norm preserving, so that it is an isomorphism.