MAT 771 FUNCTIONAL ANALYSIS

HOMEWORK 5

(1) Show that the functional defined on C [a, b] by

∫ b
f (x) = x(t) y0 (t)d t,
a

where y0 ∈ C [a, b] is fixed, is linear and bounded.

Solution: It follows from the linearity of integral that
the functional f is linear. Since y0 (t) is continuous on the
closed interval [a, b], it is bounded i.e. there exists a real
number M > 0 such that | y0 (t)| ≤ M . So,
∫ 
 b 
 
| f (x)| =  x(t) y0 (t)d t 
 a 
∫ b
≤ |x(t)|| y0 (t)|d t
a
≤ M (b − a) max |x(t)|
t∈[a,b]

= M (b − a)||x(t)||.
Therefore, the functional f is bounded.
(2) The null space N (M ∗ ) of a set M ∗ ⊂ X ∗ is defined to be the
set of all x ∈ X such that f (x) = 0 for all f ∈ M ∗ . Show
that N (M ∗ ) is a vector space.
Solution: Let x, y ∈ N (M ∗ ) and α, β be scalars. Then
for all f ∈ M ∗ ,
f (αx + β y) = α f (x) + β f ( y) ( f is linear)
= 0.
Hence, N (M ∗ ) is a subspace of X .
(3) Let f ̸= 0 be any linear functional on a vector space X and
x 0 any fixed element of X − N ( f ), where N ( f ) is the null
1
2 MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 5

space of f . Show that any x ∈ X has a unique representa-

tion x = αx 0 + y, where y ∈ N ( f ).
Solution: Let x ∈ X . Then f (x), f (x 0 ) ∈ R. So, there
exists a real number a such that f (x) = a f (x 0 ) i.e. f (x −
ax 0 ) = 0. This means that x −a x 0 ∈ N ( f ) and so x −ax 0 =
y ∈ N ( f ) or x = ax 0 + y, where y ∈ N ( f ).
(4) Determine the null space of the operator T : R3 −→ R2
represented by
 
1 3 2
.
−2 1 0
 
x
 
Solution: Let  y  ∈ N (T ). Then
z
   
x   x
  1 3 2  
T  y =
−2 1 0  
y
z z
 
x + 3 y + 2z
=
−2x + y
 
0
= .
0
Hence, we obatin a system of linear equations
x + 3 y + 2z = 0,
−2x + y = 0.
The solutions of this system are linearly dependent. A solu-
tion of this system is (2, 4, −7) and so the rest of the solu-
tions are constant multiples of (2, 4, −7). Therefore,
N (T ) = {a(2, 4, −7) : a ∈ R}.
(5) Let T : R3 −→ R3 be defined by
(ξ1 , ξ2 , ξ3 ) 7−→ (ξ1 , ξ2 , −ξ1 − ξ2 ).
Find R(T ), N (T ) and a matrix which represents T .
 MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 5 3
 
1 0 0
 
Solution:  0 1 0 is the matrix which represents
−1 −1 0
T . That is,
      
ξ 1 0 0 ξ1 ξ1
 1     
T  ξ2  =  0 1 0 ξ2  =  ξ2  .
ξ3 −1 −1 0 ξ3 ξ1 − ξ2

Recall that a linear map T maps a basis to a basis.

      
1 1 0 0 1 1
      
T 0 =  0 1 0 0 =  0  ,
0 −1 −1 0 0 −1
      
0 1 0 0 0 0
      
T 1 =  0 1 0 1 =  1  ,
0 −1 −1 0 0 −1
      
0 1 0 0 0 0
      
T 0 =  0 1 0 0 = 0 .
1 −1 −1 0 1 0

The range of T , R(T ) is the plane spanned by two linearly

independent vectors
   
1 0
   
 ,  1  :
0
−1 −1
     
 1 0
  
R(T ) = a  0  + b  1  : a, b ∈ R .
 
−1 −1

To find the null space N (T ), let

     
ξ1 ξ1 0
     
T ξ2  =  ξ2  = 0 .
ξ3 ξ1 − ξ 2 0
4 MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 5

Then we have ξ1 = ξ2 = 0. Hence, N (T ) is spanned by the

vector (0, 0, 1):
N (T ) = {a(0, 0, 1) : a ∈ R}.
(6) Find the dual basis of the basis {(1, 0, 0), (0, 1, 0), (0, 0, 1)}
for R3 .
Solution: Let e1 = (1, 0, 0), e2 = (0, 1, 0), and e3 =
(0, 0, 1). For each i = 1, 2, 3, define f i : R3 −→ R by
f i (x) = ei · x
for x ∈ R3 . Then each f i is linear and f i (e j ) = δi j . So
{ f i : i = 1, 2, 3} is the dual basis of
{(1, 0, 0), (0, 1, 0), (0, 0, 1)}.
(7) Let { f1 , f2 , f3 } be the dual basis of {e1 , e2 , e3 } for R3 , where
e1 = (1, 1, 1), e2 = (1, 1, −1), e3 = (1, −1, −1). Find f1 (x),
f2 (x), f3 (x), where x = (1, 0, 0).
Solution: First, we write x = (1, 0, 0) in terms of e1 , e2 ,
e3 :
a(1, 1, 1) + b(1, 1, −1)+c(1, −1, −1)
= (a + b + c, a + b − c, a − b − c)
= (1, 0, 0).
The system of linear equations:
a + b + c = 1,
a + b − c = 0,
a−b−c =0
has the solution a = c = 12 and b = 0. So, x = 21 e1 + 12 e3 .
Now,
 
1 1
f1 (x) = f1 e1 + e3
2 2
1 1
= f1 (e1 ) + f1 (e3 )
2 2
1
= .
2
 MAT 771 FUNCTIONAL ANALYSIS HOMEWORK 5 5

Similarly, we obtain f2 (x) = 0 and f3 (x) = 12 .

(8) Let X and Y be normed spaces and Tn : X −→ Y (n =
1, 2, · · · ) bounded linear operators. Show that convergence
Tn → T implies that for every ε > 0 there is an N such that
for all n > N and all x in any given closed ball we have
||Tn x − T x|| < ε.
Solution: Suppose that Tn → T . Let x 0 ∈ X be a fixed
vector and let us consider the closed ball B(x 0 , δ) = {x ∈
X : ||x − x 0 || ≤ δ}. Then for each x ∈ B(x 0 , δ), ||x|| ≤
||x 0 || + δ. Let ε > 0 be given. Then there exists a positive
integer N such that ||Tn − T || < ||x ε||+δ for all n > N . For all
0

x ̸= O ∈ B(x 0 , δ), we have

||Tn x − T x||
≤ ||Tn − T ||.
||x||
So for all x ∈ B(x 0 , δ), we have
||Tn x − T x|| ≤ ||Tn − T ||||x||
≤ ||Tn − T ||(||x 0 || + δ)
ε
< (||x 0 || + δ)
||x 0 || + δ
=ε
for all n > N .