Assignment #1

Quintos, Jc Justine G.
2008-09038

1. Let L be the mapping

L : R3 → P1
(a, b, c) 7→ (a − b)x − c

(a) Show that L is a linear transformation.

Solution: We take two vectors ~v1 = (a1 , b1 , c1 ) and ~v2 = (a2 , b2 , c2 )

and apply the transformation to the the sum ~v1 + ~v2 :

~v1 + ~v2 = (a1 + a2 , b1 + b2 , c1 + c2 )

L(~v1 + ~v2 ) = [(a1 + a2 ) − (b1 + b2 )]x − (c1 + c2 )
= [(a1 − b1 ) + (a2 − b2 )]x − (c1 + c2 )
= (a1 − b1 )x + (a2 − b2 )x − (c1 + c2 )
= [(a1 − b1 )x − c1 ] + [(a2 − b2 )x − c2 ]
= L(~v1 ) + L(~v2 )

Moreover, applying the transformation to k · ~v where k ∈ R and

1
 v ∈ R3 .

k · ~v = (ka, kb, kc)

L(k · ~v ) = (ka − kb)x − kc
= k(a − b)x − kc
= k[(a − b)x − c]
= kL(~v )

Since both conditions for linearity are satisfied, L is therefore a linear

transformation.

(b) Find a basis for ker L and L(R3 ). Indicate the rank and nullity of L.

Solution: From the transformation rule, we obtain the transforma-

tion matrix,  
1 −1 0
 
0 0 1

ker L and im L is the null and column space of the matrix respectively.
Luckily, the transformation matrix is already in RREF. Solving,

(Kernel). We have only one free variable (second column). Using the
technique for constructing the basis of a null space, we have:
 


 1 

 

1
 

 

 0 
 

Hence, η(L) = 1.

(Image). The first and third columns are the leading entries and

Page 2
 therefore correspond to the bases of the column space:
   
 1 0 
 , 
 0 1 

or in monomial form, {x, 1}. From this we have ρ(L) = 2.

(c) Let B1 = {(1, 0, 0), (0, 1, 0), (0, 0, 1)} and B2 = {(1, −1, 0), (0, 1, 0), (1, 2, 1)}
be ordered bases for R3 , and B3 = {x + 1, −2} be an ordered basis for
P1 . Compute [L]B
B2 and change of basis matrix
3
B2 PB1 .

Solution:
 
1
 
L −1 = 2x
 
 
0
= 2 · (x + 1) + 1 · (−2)
 
0
 
L
1
 
= −x
 
0
= (−1) · (x + 1) + (− 12 ) · (−2)
 
1
 
L 2 = −x + 1
 
 
1
= (−1) · (x + 1) + (−1) · (−2)
 
2 −1 −1
=⇒ [L]B
B2 =
3 
1

1 − 2 −1

Page 3
 We can easily compute
 
1 0 1
 
B1 PB2 = −1 1 2
 
 
0 0 1

Then using the theorem, (B1 PB2 )−1 =B2 PB1 . We use the Laplace
expansion to find the inverse.

det(B1 PB2 ) = 1
 
1 1 0
 
C=
 0 1 0

 
−1 −3 1
 
1 0 −1
 
adj C = 
1 1 −3

 
0 0 1

= (B1 PB2 )−1

2. Let  
4 1 −1
 
A= 1 4 1
 
 
−1 1 4
with characteristic polynomial pA (λ) = −(λ − 5)2 (λ − 2).

(a) Find all its eigenvalues and its corresponding eigenspace.

Solution: Eigenvalues are the zeroes of the characteristic polynomial.

Page 4
Solving,

− (λ − 5)2 (λ − 2) = 0
=⇒ (λ − 5)2 = 0 ∨ (λ − 2) = 0
=⇒ λ = 5 ∨ λ = 2

The eigenspace corresponding to an eigenvalue is the union of the zero

vector and null space of the matrix: A − λI3

For λ = 5,
   
4 1 −1 5 0 0
   
A − λI3 =  1 4 1 − 0 5 0
   
   
−1 1 4 0 0 5
 
−1 1 −1
 
= 1 −1 1 ;
 

 
−1 1 −1

Reducing (row echelon form) we have

   
−1 1 −1 1 −1 1
   

 1 −1 1

∼
0 0 0

   
−1 1 −1 0 0 0

   
1 −1
   
The vectors 1 and  0  form the basis for the null space. Therefore
   
   
0 1
   


 1 −1 

   

the eigenspace for λ = 5 is span 1 ,  0 
   
    

 0

1 


Page 5
 For λ = 2
   
4 1 −1 2 0 0
   
A − λI3 = 
 1 4 1 − 0 2 0
 

   
−1 1 4 0 0 2
 
2 1 −1
 
= 
 1 2 1

;
 
−1 1 2

(RREF)
   
2 1 −1 1 0 −1
   
1 2 1 ∼ 0 1 1
   

   
−1 1 2 0 0 0
   
2 1 −1 

 1 

   

=⇒ null 
 1

2 1=

span −1
 
  
 

−1 1 2  1 
 
 


 1 

 

=⇒ EA (2) = span −1
 

 

 1 
 

(b) Show that A is diagonalisable by computing diagonal matrix D and a

nonsingular matrix P such that P D = AP , where D is a diagonal matrix.

Solution: Since we have 3 eigenbases, the theorem holds and the

matrix is diagonalisable. Moreover,
 
5 0 0
 
D = 0 5 0
 
 
0 0 2

Page 6
and  
1 −1 1
 
P = 1 0 −1
 
 
0 1 1

Verifying,
     
1 −1 1 5 0 0 4 1 −1 1 −1 1
     
 ? 
1 0 −1 0 5 0 =  1 4 1 1 0 −1
   
     
0 1 1 0 0 2 −1 1 4 0 1 1
   
5 −5 2 5 −5 2
   
5

0 −2

= 5

0 −2

   
0 5 2 0 5 2

Page 7