Unit.

2 Linear Transformation
1. Define Linear transformation from a vector space V to another vector space W .
Let V and W be vector spaces over a field F . A function T : V → W is said to be
a linear transformation from V to W if for all x, y  V and c  F , we have
a) T ( x + y ) = T ( x ) + T ( y )
b) T ( cx ) = cT ( x ) .

Note: The above two properties are combined into a single property namely
Linear property T ( x +  y ) = T ( x ) +  T ( y ) or T ( x + y ) = T ( x ) + T ( y ) ,
x, y V and  ,   F .
2. Show that T : R 2 → R 2 defined by T ( a1 , a2 ) = ( 2a1 + a2 , a1 ) is linear.
we know that T is linear if T ( x +  y ) = T ( x ) +  T ( y )
Let x, y  R 2 and  ,   R , where x = ( b1 , b2 ) , y = ( d1 , d 2 )
 x +  y =  ( b1 , b2 ) +  ( d1 , d2 ) = ( b1 +  d1 ,  b2 +  d 2 )
T ( x +  y ) = T ( b1 +  d1 ,  b2 +  d 2 )
= ( 2 ( b1 +  d1 ) +  b2 +  d 2 ,  b1 +  d1 )
= ( 2 b1 + 2 d1 +  b2 +  d 2 ,  b1 +  d1 )
 T ( x ) +  T ( y ) = T ( x ) +  T ( y ) = T ( b1 , b2 ) +  T ( d1 , d 2 )
=  ( 2b1 + b2 , b1 ) +  ( 2d1 + d 2 , d1 )
= ( 2 b1 + 2 d1 +  b2 +  d 2 ,  b1 +  d1 )
T ( x +  y ) = T ( x ) +  T ( y )
 T is linear.
3. Show that T : R3 → R 2 defined by T ( x, y, z ) = ( x , y + z ) is not linear.
we know that T is linear if T ( x +  y ) = T ( x ) +  T ( y )
Let x, y  R3 and  ,   R , where x = ( a1 , a2 , a3 ) , y = ( b1 , b2 , b3 )
 x +  y =  ( a1 , a2 , a3 ) +  ( b1 , b2 , b3 ) = ( a1 +  b1 ,  a2 +  b2 ,  a3 +  b3 )
T ( x +  y ) = T ( a1 +  b1 ,  a2 +  b2 ,  a3 +  b3 )
= (  a1 +  b1 ,  a2 +  b2 +  a3 +  b3 )
T ( x ) +  T ( y ) = T ( a1 , a2 , a3 ) +  T ( b1 , b2 , b3 )
=  ( a1 , a2 + a3 ) +  ( b1 , b2 + b3 )

= ( a1 +  b1 ,  a2 +  a3 +  b2 +  b3 )
T ( x +  y )  T ( x ) +  T ( y ) is not linear.
4. Verify that T : R3 → R and T ( u ) = u is a linear transformation or not.
 T ( u + v ) = u + v  u + v By Triangle inequality
But T ( u + v )  T ( u ) + T ( v )
So, it is not a linear transformation.
5. Obtain the matrix representing the linear transformation T : V3 ( R ) → V3 ( R )
given by T ( a, b, c ) = ( 3a, a − b, 2a + b + c ) with respect to the standard basis
e1 , e2 , e3  .
The standard basis of V3 ( R ) is e1 , e2 , e3  = (1, 0, 0 ) , ( 0,1, 0 ) , ( 0, 0,1) .
T ( e1 ) = T (1, 0, 0 ) = ( 3,1, 2 ) = 3e1 + e2 + 2e3
T ( e2 ) = T ( 0,1, 0 ) = ( 0, −1,1) = 0e1 − e2 + e3
T ( e3 ) = T ( 0, 0,1) = ( 0, 0,1) = 0e1 + 0e2 + e3
 3 0 0
 
The matrix representing T is  1 −1 0  .
2 1 1
 
6. Let T : P3 ( R ) → P2 ( R ) be a linear transformation defined by T ( f ( x ) ) = f  ( x ) .
Let B1 and B2 be the standard bases for P3 ( R ) and P2 ( R ) respectively. Then
find T  .
The usual basis of P3 ( R ) is 1, x, x 2 , x 3 
T ( f ( x )) = f  ( x )
T (1) = 0 = 0.1 + 0.x + 0.x 2
T ( x ) = 1 = 1.1 + 0.x + 0.x 2
T ( x 2 ) = 2 x = 0.1 + 2.x + 0.x 2
T ( x3 ) = 3x 2 = 0.1 + 0.x + 3.x 2
0 1 0 0
The matrix representing T B = 0 0 2 0 
B2
1 .
0 0 0 3
7. For the following linear operator T on a vector space V and ordered basis 
compute T  , V = R 2 , T ( a, b ) = (10a − 6b,17a − 10b ) and  = (1, 2 ) , ( 2,3) .

T (1, 2 ) = ( −2, −3)

Let ( −2, −3) = a (1, 2 ) + b ( 2,3)
( −2, −3) = ( a + 2b, 2a + 3b )
−2 = a + 2b, −3 = 2a + 3b
By solving a = 0, b = −1
Thus T (1, 2 ) = ( −2, −3) = 0 (1, 2 ) − 1( 2,3)
T ( 2,3) = ( 2, 4 )
 ( 2, 4 ) = c (1, 2 ) + d ( 2,3)
( 2, 4 ) = ( c + 2d , 2c + 3d )
2 = c + 2d , 4 = 2c + 3d
By solving d = 0, c = 2
T ( 2,3) = ( 2, 4 ) = 2 (1, 2 ) + 0 ( 2,3)
0 2
T  =  −1 0 
.

8. Find the linear transformation T : V3 ( R ) → V3 ( R ) determined by the matrix
 1 2 1
 0 1 1  with respect to the standard basis e , e , e .
   1 2 3
 −1 3 4 
The standard basis is e1 , e2 , e3 
T ( e1 ) = e1 + 2e2 + e3 = (1, 2,1)
T ( e2 ) = 0e1 + e2 + e3 = ( 0,1,1)
T ( e3 ) = −e1 + 3e2 + 4e3 = ( −1,3, 4 )
Now ( a, b, c ) = a (1,0,0 ) + b ( 0,1,0 ) + c ( 0,0,1)
( a, b, c ) = ae1 + be2 + ce3
T ( a, b, c ) = T ( ae1 + be2 + ce3 )
= aT ( e1 ) + bT ( e2 ) + cT ( e3 )
= a (1, 2,1) + b ( 0,1,1) + c ( −1,3, 4 )
T ( a, b, c ) = ( a − c, 2a + b + 3c, a + b + 4c )
This is the required linear transformation.
9. Consider the basis S = v1 , v2 , v3  for R 3 , where v1 = (1,1,1) , v2 = (1,1,0 ) , v3 = (1,0,0 )
. Let T : R3 → R 2 be the linear transformation such that T ( v1 ) = (1,0 ) ,
T ( v2 ) = ( 2, −1) and T ( v3 ) = ( 4,3) . Find the formulae for T ( x1 , x2 , x3 ) , then use this
formulae to compute T ( 2, −3,5) .
We first express x = ( x1 , x2 , x3 ) as a linear combination of v1 , v2 and v3 .
If we write ( x1 , x2 , x3 ) = av1 + bv2 + cv3
( x1 , x2 , x3 ) = a (1,1,1) + b (1,1, 0 ) + c (1, 0, 0 )
( x1 , x2 , x3 ) = ( a + b + c, a + b, a )
Then on equating corresponding components
a + b + c = x1 , a + b = x2 , a = x3
By solving a = x3 , b = x2 − x3 , c = x1 − x2 .
( x1 , x2 , x3 ) = x3 (1,1,1) + ( x2 − x3 )(1,1,0 ) + ( x1 − x2 )(1,0,0 )
 = x3 v2 + ( x2 − x3 ) v2 + ( x1 − x2 ) v3
Thus T ( x1 , x2 , x3 ) = x3T (1,1,1) + ( x2 − x3 ) T (1,1,0 ) + ( x1 − x2 ) T (1,0,0 )
= x3 (1, 0 ) + ( x2 − x3 )( 2, −1) + ( x1 − x2 )( 4,3)
T ( x1 , x2 , x3 ) = ( 4 x1 − 2 x2 − x3 ,3x1 − 4 x2 + x3 )
From this we obtain T ( 2, −3,5) = ( 9, 2,3) .
10. Define Kernel (Null space) of a linear transformation T .
Let V ( F ) and W ( F ) be two vector spaces and let T : V → W be a linear. We
define the null space or kernel N (T ) of T as N (T ) =  x  V : T ( x ) = 0 .
11. Define Image space (Range space) of a linear transformation T
Let V ( F ) and W ( F ) be two vector spaces and let T : V → W be a linear. We
define the range or image R (T ) of T as Range (T ) = T ( x ) : x  V  .
12. Define Rank.
Let V ( F ) and W ( F ) be two vector spaces and let T : V → W be a linear
transformation then the rank of T is a dimension of the range space of T .
i.e., R (T ) =dimension [Range(T)].
13. Define Nullity.
Let V ( F ) and W ( F ) be two vector spaces and let T : V → W be a linear
transformation then the nullity of T is the dimension of null space of T .
i.e., N (T ) =dimension [Null space of (T)].
14. State and prove Dimension theorem.
Statement: Let V and W be vector spaces, and let T : V → W be linear. If V is
finite-dimensional, then nullity(T) + rank(T) = dim(V).
Proof:
Suppose that dim(V) = n, dim(N(T)) = k, and v1 , v 2 vk  is a basis for N(T).
Then v1 , v 2 vk  is a linearly independent set in V .
Therefore v1 , v 2 vk  can be extended to a basis  = v1 , v2 vn  for V .
We claim that S = T (vk +1 ), T (vk + 2 ), T (vn ) is a basis for R(T).
By known theorem  = v1 , v2 vn  is a basis for V
R(T ) = span(T (v1 ), T (v2 ), T (vn ))
= span T (vk +1 ), T (vk + 2 ), T (vn ) since T ( v1 ) = T ( v2 ) = ... = T ( vk ) = 0
= span( S ) -----(1)
Now we prove that S is linearly independent set.
To prove this let
bk +1T ( vk +1 ) + bk + 2T ( vk + 2 ) + ... + bnT ( vn ) = 0
 T ( bk +1vk +1 + bk + 2vk + 2 + ... + bn vn ) = 0 since T is linear.
 bk +1vk +1 + bk + 2vk + 2 + ... + bn vn  N (T )
  bk +1vk +1 + bk +2vk +2 + ... + bnvn = c1v1 + c2v2 + ... + ck vk
 ( −c1 ) v1 + ( −c2 ) v2 + ... + ( −ck ) vk + bk +1vk +1 + ... + bnvn = 0 ----(2)
Since v1 , v 2 vn  is a linearly independent set
(2)  bi = 0 for all i.
Therefore, S is a linearly independent set ----(3)
(1) and (3) imply that S is a basis for R (T )
Note that T ( vk +1 ) , T ( vk + 2 ) ,..., T ( vn ) are all distinct
Hence dim ( R ( T ) ) = n − k
dim ( R ( T ) ) = dim (V ) − dim ( N ( T ) )
dim ( N ( T ) ) + dim ( R ( T ) ) = dim (V )
Nullity (T ) + Rank (T ) = dim (V )
Hence the proof
15. Let V and W be vector spaces and let T : V → W be linear. Then T is one to one
if and only if N (T ) = 0 .
Assume that T is one-to-one and x  N (T ) .
Since N (T ) is a subspace, 0  N (T ) ----(i)
Let x  N (T ) .
Then T ( x ) = 0 = T ( 0 ) .
Since T is one-to-one, x = 0 .
Therefore, x  0
Hence N (T )  0 ---(ii)
From (i) and (ii)
Hence N (T ) = 0 .
Now assume that N (T ) = 0 , and suppose that T ( x ) = T ( y ) .
Then T ( x − y ) = 0
Therefore x − y  N (T ) = 0
Hence x − y = 0 . i.e., x = y
This means that T is one-to-one.
16. Let V and W be vector spaces of equal (finite) dimension and let T : V → W be
linear. Then the following are equivalent
(i) T is one to one
(ii) T is onto
(iii) Rank(T) = dim(V)
( i )  ( iii )
T is one to one
 N (T ) = 0
 dim ( N (T ) ) = 0
 0 + rank (T ) = dim (V )
  rank (T ) = dim (V )
( iii )  ( ii )
rank (T ) = dim (V )
 rank (T ) = dim (W )
 dim ( R (T ) )
 R (T ) = W
 T is onto
17. Determine whether T : R3 → R 2 defined by T ( a1 , a2 , a3 ) = ( a1 − a2 , 2a3 ) is one to
one or onto.
T is one to one or onto only if N (T ) = 0
N (T ) =  x : T ( x ) = 0
T ( a1 , a2 , a3 ) = 0
( a1 − a2 , 2a3 ) = 0
a1 − a2 = 0, 2a3 = 0
a1 = a2 and a3 = 0
One free variable is there
N (T )  0
Therefore T is not one to one.
18. Let T : R 4 → R3 be the linear mapping defined by
T ( x, y, z, t ) = ( x − y + z + t , x + 2 z − t , x + y + 3z − 3t ) . Find a basis and dimension of
image of T and the kernel of T .
The usual basis of R 4 is (1, 0, 0, 0 ) , ( 0,1, 0, 0 ) , ( 0, 0,1, 0 ) , ( 0, 0, 0,1)
The image of usual basis of R 4 is
T (1, 0, 0, 0 ) = (1,1,1) , T ( 0,1, 0, 0 ) = ( −1, 0,1) ,
T ( 0, 0,1, 0 ) = (1, 2,3) , T ( 0, 0, 0,1) = (1, −1, −3)
The image vectors span Image T .
Hence form the matrix whose rows are these image vectors and row reduce to
echelon form
1 1 1
 −1 0 1 
A= 
1 2 3
 
 1 −1 −3
1 1 1 
0 1 2  R  R + R
  2 2 1

0 1 2  R3  R3 − R1
 
0 −2 −4 R4  R4 − R1
 1 1
1
0 2 
1

0 0  R3  R3 − R2
0
 
0 0  R4  R4 + 2 R2
0
Which is echelon form of matrix
Thus the set of nonzero vectors (1,1,1) , ( 0,1, 2 ) is the basis for Image T .
Hence dim (Image T )=dim ( R (T ) ) =2.
To find the basis and dimension for N (T )
Set T ( v ) = 0 , where v = ( x, y, z, t )
T ( x, y , z , t ) = 0
( x − y + z + t , x + 2 z − t , x + y + 3z − 3t ) = ( 0, 0, 0 )
x − y + z + t = 0

x + 2 z − t = 0  --------(1)
x + y + 3z − 3t = 0 
1 −1 1 1 
Coeffecient matrix = 1 0 2 −1
1 1 3 −3 
1 −1 1 1 
0 1 1 −2  R  R − R
  2 2 1

0 2 2 −4  R3  R3 − R1
1 −1 1 1 
0 1 1 −2 
 
0 0 0 0  R3  R3 − 2 R2
Which is echelon form of matrix
Thus (1) is equivalent to
x− y + z +t = 0
y + z − 2t = 0
The Free variables are z and t . Hence dim (Ker T )=no. of free variables=2
(i) choosing z = −1 , t = 0 we get y = 1, x = 2 .
(ii) choosing z = 0 , t = 1 we get y = 2, x = 1 .
Thus ( 2,1, −1, 0 ) , (1, 2, 0,1) is the basis for Ker T .
19. For the following transformation T : R 2 → R3 defined by
T ( a1 , a2 ) = ( a1 + a2 ,0, 2a1 − a2 ) show that
(i) T is a linear transformation
(ii) Find basis for both N(T) and R(T)
(iii) Compute the nullity and rank(T) and verify the dimension theorem
 (iv) Finally use the appropriate theorems to determine whether T is one to
one or onto.
Consider the transformation T : R 2 → R3 defined by
T ( a1 , a2 ) = ( a1 + a2 ,0, 2a1 − a2 )
Let x = ( a1 , a2 ) and y = ( b1 , b2 )  R 2 and  ,   R .
 x +  y = ( a1 +  b1 ,  a2 +  b2 )
T ( x +  y ) = T ( a1 +  b1 ,  a2 +  b2 )
= ( a1 +  b1 +  a2 +  b2 , 0, 2( a1 +  b1 ) − ( a2 +  b2 ))
 T ( x) +  T ( y ) =  (a1 + a2 , 0, 2a1 − a2 ) +  (b1 + b2 , 0, 2b1 − b2 )
= ( a1 +  a2 +  b1 +  b2 , 0, 2 a1 −  a2 + 2 b1 −  b2 )
= ( a1 +  b1 +  a2 +  b2 , 0, 2( a1 +  b1 ) − ( a2 +  b2 )
T ( x +  y ) =  T ( x) +  T ( y )
Hence T is linear .
The usual basis of R 2 is (1, 0 ) , ( 0,1)
The image of usual basis of R 2 is
T (1, 0 ) = (1, 0, 2 ) , T ( 0,1) = (1, 0, −1)
The image vectors span Image T
Hence form the matrix whose rows are these image vectors and row reduce to
echelon form
1 0 2 
A= 
1 0 −1
1 0 2 
0 0 −3 R2 = R2 − R1
 
Which is echelon form of matrix
Thus the set of nonzero vectors (1, 0, 2 ) , ( 0, 0, −3) is the basis for Image T .
Hence dim (Image T )=dim ( R (T ) ) =2.
To find the basis and dimension for N (T )
Set T ( v ) = 0 , where v = ( x, y )
N (T ) =  x  R 2 : T ( x) = 0
T (a1 , a2 ) = 0
(a1 + a2 ,0, 2a1 − a2 ) = (0,0,0)
 a1 + a2 = 0 & 2a1 − a2 = 0
 a2 = −a1 & a2 = 2a1
This is possible only when a1 = a2 = 0
 N (T) = 0
 Hence the basis for N (T ) = 
Nullity = dim( N (T )) = 0.
dim(V ) = dim( R2 ) = 2
nullity(T ) + rank(T) = dim(V).
N(T) = 0 if and only if T is one to one.
R(T )  R 3
 it is not onto
20. Prove that the transformation T : M 23 ( F ) → M 22 ( F ) defined by

a a a13   2a11 − a12 a13 + 2a12 

T  11 12 =  
 a 21 a22 a 23   0 0 
(i). T is linear.
(ii). Find bases for N(T) and R(T).
(iii). Compute the nullity and rank (T) and verify the dimension theorem.
(iv). Use appropriate theorems to determine whether T is one to one or onto.
 a11 a12 a13   2a11 − a12 a13 + 2a12 
Given : T  =
 a21 a22 a23   0 0


 a11 a12 a13   b11 b12 b13 
Let , x =   , y =  M 23 ( F ) and  ,   F
 a21 a22 a23   b21 b22 b23 
  a11 +  b11  a12 +  b12  a13 +  b13 
x+ y=  
  a21 +  b21  a22 +  b22  a23 +  b23 
 2 ( a11 +  b11 ) − ( a12 +  b12 ) ( a13 +  b13 ) + 2( a12 +  b12 ) 
T ( x +  y ) =  
 0 0 
 2a − a a + 2a12   2b11 − b12 b13 + 2b12 
Also ,  T ( x ) +  T ( y ) =   11 12 13 +   
 0 0   0 0 
 2 a11 + 2 b11 −  a12 −  b12  a13 +  b13 + 2 a12 + 2 b12 
= 
 0 0 
T ( x +  y ) = T ( x ) +  T ( y )
 T is linear.
(ii) N (T ) =  x  M 23 ( F ); T ( x) = 0
 a11 a12 a13   0 0 
given T  =
 a21 a22 a23   0 0 
 2a11 − a12 a13 + 2a12   0 0 
 = 
 0 0  0 0
2a11 − a12 = 0 ,
−a13
a13 + 2a12 = 0  a12 =
2
The free variables are a13 , a21 , a22 , a23
Therefore dim ( N (T ) ) = 4
Choosing a13 = 4, a21 = 0, a22 = 0, a23 = 0
 −1 −2 4   −2 + 2 4 − 2   0 0
T  =  = 
 0 0 0  0 0  0 0
0 0 0 0 0
a13 = 0, a21 = 1, a22 = 0, a23 = 0  T  =  
1 0 0 0 0
 0 0 0 0 0
a13 = 0, a21 = 0, a22 = 1, a23 = 0  T  =  
 0 1 0 0 0
 0 0 0 0 0
a13 = 0, a21 = 0, a22 = 0, a23 = 1  T  =  
 0 0 1 0 0
 −1 −2 4   0 0 0   0 0 0   0 0 0  
Basis for N(T) =  , , , 
 0 0 0   1 0 0   0 1 0   0 0 1   .
R(T ) = T ( x); x  M 23 ( F )
a a a13   2a11 − a12 a13 + 2a12 
T  11 12 =
 a21 a22 a23   0 0


The usual basis for M 23 ( F ) is e1 , e2 , e3 , e4 , e5 , e6 
 1 0 0   0 1 0   0 0 1   0 0 0   0 0 0   0 0 0  
ie.,  , , , , , 
 0 0 0   0 0 0   0 0 0   1 0 0   0 1 0   0 0 1  
1 0 0  2 0
T ( e1 ) = T  = 
0 0 0  0 0
0 1 0   −1 2
T ( e2 ) = T  = 
0 0 0  0 0
0 0 1 0 1
T ( e3 ) = T  = 
0 0 0 0 0
0 0 0 0 0
T ( e4 ) = T  = 
1 0 0 0 0
0 0 0 0 0
T ( e5 ) = T  = 
0 1 0 0 0
0 0 0 0 0
T ( e6 ) = T  = 
0 0 1 0 0
 2 0 0 0
 −1 2 0 0 

0 1 0 0
A= 
0 0 0 0
0 0 0 0
 
0 0 0 0
2 0 0 0
0 4 0 0 

0 1 0 0
  R3  4 R3 − R2
0 0 0 0
0 0 0 0
 
0 0 0 0
2 0 0 0
0 4 0 0 

0 0 0 0
  R3  4 R3 − R2
0 0 0 0
0 0 0 0
 
0 0 0 0
Which is in row echelon form
 2 0   0 4  
Thus the set of nonzero vectors  ,   is the basis for Image T .
 0 0   0 0  
 1 0   0 1  
ie., Thus the set of nonzero vectors  ,   is the basis for Image T .
 0 0   0 0  
Hence dim (Image T )=dim ( R (T ) ) =2.

(iii) Nullity of T = dim (N(T)) = 4

Rank of T = dim(R(T)) = 2
Dim (M2x3(F)) = 6
Nullity(T) + Rank (T) = dim (M2x3(F))
Dimension theorem is verified.
(iv) Since N(T)  {0} ,by theorem
Let V and W be vector spaces and let T : V → W be linear.
Then T is one to one if and only if N (T ) = 0

T is not one – one and not onto.

21. Define characteristic polynomial of A.
Let A  M nn ( F ) . The polynomial f ( t ) = A −  I is called the characteristic
polynomial of A.
22. Define eigen value.
Let T : V → V be a linear operator on a vector space V over F. Then a scalar
  F is said to be an eigen value if there exists a nonzero vector v V such that
T ( v ) = v .
Eigen values are also known as characteristic values or latent values or proper
values or spectral values.
23. Define eigen vector.
Let T : V → V be a linear operator on a vector space V over F. Then a scalar
  F being the eigen value satisfies T ( v ) =  v where v is a nonzero vector
belongs to V . Any vector satisfying this relation is said to be eigen vector of T
belonging to the eigen value  .
Eigen vectors are also known as characteristic vectors or latent vectors or
proper vectors or spectral vectors.
1 −4
24. Find the characteristic equation and the eigen values of  .
4 2 
The characteristic polynomial is = A −  I
1 −  −4
=
4 2−
= (1 −  )(2 −  ) + 16
The characteristic polynomial is =  2 − 3 + 18
The characteristic equation is A −  I = 0
The characteristic equation is  2 − 3 + 18 = 0
3  9 − 72 3  −63
Eigen values are  = = .
2 2
Since t is complex, A has no real eigen values.
5 −2 6 −1
 
25. Find the characteristic equation of 0 3 −8 0  .
0 0 5 4
 
0 0 0 1
The characteristic polynomial is = A −  I
5 −  −2 6 −1 
 0 3− −8 0 
= 
 0 0 5− 4 
 
 0 0 0 1−  
= (5 −  )(3 −  )(5 −  )(1 −  )
The characteristic polynomial is = t 4 − 14t 3 + 68t 2 − 130t + 75
The characteristic polynomial is A −  I = 0
The characteristic polynomial is t 4 − 14t 3 + 68t 2 − 130t + 75 = 0 .
1 1
26. Find the eigen values and eigen vectors of A =  .
 4 1
The characteristic polynomial is = A −  I
1−  1
=
4 1− 
= (1 −  )2 − 4
=  2 − 2 + 1 − 4
=  2 − 2 − 3
The characteristic polynomial is = (  − 3)(  + 1)
The Characteristic equation is A −  I = 0
The Characteristic equation is (  − 3)(  + 1) = 0
Eigenvalue of A are λ = -1, 3.
To find the Eigen Vector
( A −  I) X = 0
1 −  1   x1   0 
   =  
 4 1 −    x2   0 
(1 −  ) x1 + x2 = 0 
 − − − ( A)
4 x1 + (1 −  ) x2 = 0 
Put  = 3 in (A) equation
−2 x1 + x2 = 0
4 x1 − 2 x2 = 0
 2x1 = x2
x1 x2
 =
1 2
 x  1
X1 =  1  =  
 x2   2 
Put  = −1 in (A) equation
2 x1 + x2 = 0
4 x1 + 2 x2 = 0
 2 x1 = − x2
x1 x2
 =
1 −2
x   1 
X2 =  1  =  
 x2   −2 
1 1
The eigen vectors are X 1 =   , X 2 =  
 2  −2 
27. Let T be the linear operator on P2 ( R ) defined by
T ( f ( x ) ) = f ( x ) + ( x + 1) f ' ( x ) . Let  be the standard ordered basis for P2 ( R )
and let A = T  . Find the eigen values and eigen vector of A .
Let T be the linear operator on P2 ( R ) defined by
T ( f ( x ) ) = f ( x ) + ( x + 1) f ' ( x ) .

Let  = 1, x, x 2  be the standard basis for P2 ( R )

T (1) = 1 + ( x + 1) .0 = 1 = 1.1 + 0.x + 0.x 2
T ( x ) = x + ( x + 1) .1 = 1 + 2 x = 1.1 + 2.x + 0.x 2
T ( x 2 ) = x 2 + ( x + 1) .2 x = 2 x + 3x 2 = 0.1 + 2.x + 3.x 2

1 1 0
 
Let A =  0 2 2 
 0 0 3
 
The Characteristic equation is A −  I = 0
1−  1 0
0 2− 2 =0
0 0 3−
(1 −  )(2 −  )(3 −  ) = 0
Eigenvalue of A are λ = 1, 2, 3.
To find the Eigen Vector
( A −  I) X = 0
1 −  1 0  x1   0 
    
 0 2− 2  x2  =  0 
 0 3 −     
 0  x3   0 
(1 −  ) x1 + x2 + 0 x3 = 0 

0 x1 + ( 2 −  ) x2 + 2 x3 = 0  − − − ( A)

0 x1 + 0 x2 + ( 3 −  ) x3 = 0 
Put  = 1 in (A) equation
0 x1 + x2 + 0 x3 = 0
0 x1 + x2 + 2 x3 = 0
0 x1 + 0 x2 + 2 x3 = 0
Applying cross multiplication method for first and second equation
x1 x x
= 2 = 3
1 0 0 0 0 1
1 2 2 0 0 1
 x1 x2 x3
= =
2 0 0
x x x
 1= 2 = 3
1 0 0
x1 = 1, x2 = 0, x3 = 0
1
 
X1 =  0 
0
 
Put  = 2 in (A) equation
− x1 + x2 + 0 x3 = 0
0 x1 + 0 x2 + 2 x3 = 0
0 x1 + 0 x2 + x3 = 0
Applying cross multiplication method for first and second equation
x1 x2 x3
= =
1 0 0 −1 −1 1
0 2 2 0 0 0
x1 x2 x3
= =
2 2 0
x x x
 1= 2 = 3
1 1 0
1
 
X2 = 1
0
 
Put  = 3 in (A) equation
−2 x1 + x2 + 0 x3 = 0
0 x1 − x2 + 2 x3 = 0
0 x1 + 0 x2 + 0 x3 = 0
Applying cross multiplication method for first and second equation
x1 x2 x3
= =
1 0 0 −2 −2 1
−1 2 2 0 0 −1
x1 x2 x3
= =
2 4 2
x x x
 1= 2 = 3
1 2 1
1
 
 X3 =  2
1
 
 1 1 1
    X =  2
The eigen vectors are X 1 =  0  , X 2 =  1  , 3   .
0 0 1
     
 1 1
28. Test the matrix A =    M 22 ( R ) diagonalizable.
 1 1
The Characteristic Polynomial is
1−  1
A − I = = (1 −  ) − 1 = 1 +  2 − 2 − 1 =  2 − 2
2

1 1− 
The characteristic equation is A −  I = 0
  = 0, 2
Since the Eigen values are distinct the matrix is diagonalizable.
 a1   4a1 + a3 
3   
29. Let T be the linear operator on R defined by T a2 = 2a1 + 3a2 + 2a3  Show
   
a   a1 + 4a3 
 3  
that T is diagonalizable.
The usual basis of R 3 is (1, 0, 0 ) , ( 0,1, 0 ) , ( 0, 0,1)
The image of usual basis of P2 ( R ) is
T (1, 0, 0 ) = ( 4, 2,1)
T ( 0,1, 0 ) = ( 0,3, 0 )
T ( 0, 0,1) = (1, 2, 4 )
4 0 1
 
Let A =  2 3 2 
1 0 4
 
The Characteristic Polynomial is = A −  I
4− 0 1
= 2 3− 2
1 0 4−
= ( 4 −  ) ( 3 −  )( 4 −  ) − 0  + 1 0 − ( 3 −  ) 
= ( 4 −  )( 3 −  )( 4 −  ) − ( 3 −  )

= ( 3 −  ) ( 4 −  ) − 1
2

 
= ( 3 −  )  2 − 8 + 15
The Characteristic Polynomial is = ( 3 −  )(  − 5)(  − 3)
The characteristic equation is A −  I = 0
( 3 −  )(  − 5)(  − 3) = 0
Eigen values of A are  = 3,3,5
To find the Eigen Vector
( A −  I) X = 0
4− 0 1  x1   0 
    
 2 3− 2  x2  =  0 
 1 4 −     
 0  x3   0 
( 4 −  ) x1 + 0 x2 + 1x3 = 0 

2 x1 + ( 3 −  ) x2 + 2 x3 = 0  − − − ( A)

1x1 + 0 x2 + ( 4 −  ) x3 = 0 
Put  = 5 in (A) equation
− x1 + 0 x2 + x3 = 0
2 x1 − 2 x2 + 2 x3 = 0
x1 + 0 x2 − x3 = 0
Applying cross multiplication method for first and second equation
x1 x2 x3
= =
0 1 1 −1 −1 0
−2 2 2 2 2 −2
x1 x2 x3
= =
2 4 2
x x x
 1= 2 = 3
1 2 1
1
 
X1 =  2 
1
 
Put  = 3 in (A) equation
x1 + 0 x2 + x3 = 0
2 x1 + 0 x2 + 2 x3 = 0
x1 + 0 x2 + x3 = 0
Since all the equation are same we cannot apply cross multiplication method
Since the unknown x2 does not appear in this system,

we assign a parametric value, say x2 = s , and x1 = − x3 = t .

The result is the general solution to the system

 x1  0  1 
     
 x2  = s  1  + t  0  , for s, t  R.
x   0   −1
 3    
 0 1
   
X2 = 1, X3 =  0  .
0  −1
   
Since A has three linearly independent eigen vector
Therefore, A is diagonalizable.
30. Test for Diagonalization
Let T be a linear operator on an n-dimensional vector space V. Then T is
diagonalizable if and only if the following two conditions hold
(i) The characteristic polynomial for T splits.
(ii) For each eigen value  of T , the multiplicity of  equals n − rank(T − I).
3 1 0 
31. Test the matrix for A = 0 3 0   M 33 ( R ) for diagonalizability.
 
0 0 4 
The characteristic polynomial is = A −  I
3− 1 0
= 0 3− 0
0 0 4−
The characteristic polynomial is = ( 3 −  )( 3 −  )( 4 −  )
The characteristic equation is A −  I = 0
( 3 −  )( 3 −  )( 4 −  ) = 0
Eigen values of A are  = 3,3, 4
The Characteristic Polynomial of A is = A −  I = ( 3 −  ) ( 4 −  )
2

Which splits diagonalization condition (1) is satisfied.

Also A has the eigenvalues 1 = 3 and 2 = 4 with multiplicities 2 and 1
respectively.
0 1 1
 
When 1 = 3 , n − rank (T − 1 I ) = 3 − rank  0 0 0  = 3 − 2 = 1
0 0 1
 
n − rank (T − 1I )  the multiplicity of 1 = 3
Therefore Condition (2) not satisfied
Hence T is not diagonalizable.
32. Test for diagonalizability of the linear transformation T on P2 ( R ) defined by

( )
T ( f ( x ) ) = f (1) + f ' ( 0 ) x + f ' ( 0 ) + f '' ( 0 ) x 2 and show that it is diagonalizable.

The usual basis of P2 ( R ) is 1, x, x 2 

The image of usual basis of P2 ( R ) is
T (1) = 1 + 0.x + ( 0 + 0 ) .x 2 = 1 = 1.1 + 0.x + 0.x 2
T ( x ) = 1 + 1.x + (1 + 0 ) .x 2 = 1 + x + x 2 = 1.1 + 1.x + 1.x 2
T ( x 2 ) = 1 + 0.x + ( 0 + 2 ) .x 2 = 1 + 2 x 2 = 1.1 + 0.x + 2.x 2

1 1 1
 
Let A =  0 1 0 
0 1 2
 
The characteristic polynomial is = A −  I
1−  1 1
= 0 1−  0
0 1 2−
= (1 −  ) (1 −  )( 2 −  )  − 10 + 10
The characteristic polynomial is = (1 −  )(1 −  )( 2 −  )
The characteristic equation is A −  I = 0
(1 −  )(1 −  )( 2 −  ) = 0
Eigen values of A are  = 1,1, 2
The Characteristic Polynomial of A is = A −  I = (1 −  ) ( 2 −  )
2

Which splits diagonalization condition (1) is satisfied.

Also A has the eigenvalues 1 = 1 and 2 = 2 with multiplicities 2 and 1
respectively.
0 1 1
 
When 1 = 1 , n − rank (T − 1 I ) = 3 − rank  0 0 0 
0 1 1
 
0 1 1
 
n − rank (T − 1 I ) = 3 − rank  0 0 0  R3  R3 − R1 = 3 − 1 = 2
0 0 0
 
 −1 1 1 
 
When 2 = 2 , n − rank (T − 2 I ) = 3 − rank  0 −1 0 
 0 1 0
 
 −1 1 1 
 
n − rank (T − 2 I ) = 3 − rank  0 −1 0  R3  R2 + R3 = 3 − 2 = 1 .
 0 0 0
 
Therefore Condition (2) satisfied
Hence T is diagonalizable.
To find the Eigen Vector
( A −  I) X = 0
1 −  1 1  x1   0 
    
 0 1−  0  x2  =  0 
 0 2 −     
 1  x3   0 
(1 −  ) x1 + 1x2 + 1x3 = 0 

0 x1 + (1 −  ) x2 + 0 x3 = 0  − − − ( A)

0 x1 + 1x2 + ( 2 −  ) x3 = 0
Put  = 2 in (A) equation
− x1 + x2 + x3 = 0
0 x1 − x2 + 0 x3 = 0
0 x1 + x2 + 0 x3 = 0
Applying cross multiplication method for first and second equation
x1 x2 x3
= =
1 1 1 −1 −1 1
−1 0 0 0 0 −1
x1 x2 x3
 = =
1 0 1
1
 
X1 =  0 
1
 
Put  = 1 in (A) equation
0 x1 + x2 + x3 = 0
0 x1 + 0 x2 + 0 x3 = 0
0 x1 + x2 + x3 = 0
Since all the equation are same we cannot apply cross multiplication method
Since the unknown x1 does not appear in this system,

we assign a parametric value, say x1 = s , and x2 = − x3 = t .

The result is the general solution to the system

 x1  1  0 
     
 x2  = s  0  + t  −1 , for s, t  R.
x  0  1 
 3    

1 0
   
X 2 =  0  , X 3 =  −1
0 1
   
Since A has three linearly independent eigen vector
 Therefore, A is diagonalizable.

 2 0 −1 
33. For A =  4 1 −4   M ( F )
  nn
 2 0 −1 
 
(i). Determine all the eigen values of A
(ii). Find the set of eigen vectors corresponding to 
(iii). If possible find a basis for F n consisting of eigen vectors of A. If successful
in finding such a basis determine an invertible matrix Q and a diagonal matrix D
such that Q−1 AQ = D
 2 0 −1 
A =  4 1 −4 
 2 0 −1 
 
The characteristic polynomial is = A −  I
2− 0 −1
= 4 1−  −4
2 0 −1 − 
= (2 −  ) (1 −  )(−1 −  ) − 1(−2(1 −  )
= (2 −  )(−(1 −  2 )) + 2(1 −  )
= −(2 −  )(1 −  )(1 +  ) + 2(1 −  )
= (1 −  )  2 − (2 −  )(1 +  ) 
= (1 −  )  2 − (2 −  2 +  ) 
The characteristic polynomial is = (1 −  )( 2 −  )
The characteristic equation is A −  I = 0
(1 −  )( − 1) = 0
Eigen values of A are  = 0,1,1
To find the Eigen Vector
( A −  I) X = 0
2− 0 −1  x1   0 
    
 4 1−  −4  x2  =  0 
 2 −1 −     
 0  x3   0 
( 2 −  ) x1 + 0 x2 − x3 = 0 

4 x1 + (1 −  ) x2 − 4 x3 = 0  − − − ( A)

2 x1 + 0 x2 + ( −1 −  ) x3 = 0
Put  = 0 in (A) equation
2 x1 + 0 x2 − x3 = 0
4 x1 + x2 − 4 x3 = 0
2 x1 + 0 x2 − x3 = 0
Applying cross multiplication method for first and second equation
x1 x2 x
= = 3
0 −1 −1 2 2 0
1 −4 −4 4 4 1
x1 x2 x3
 = =
1 4 2
1
 
X1 =  4  .
 2
 
Put  = 1 in (A) equation
x1 + 0 x2 − x3 = 0
4 x1 + 0 x2 − 4 x3 = 0
2 x1 + 0 x2 − 2 x3 = 0
Since all the equation are same, we cannot apply cross multiplication method
Since the unknown x2 does not appear in this system,

we assign a parametric value, say x2 = s , and x1 = x3 = t .

The result is the general solution to the system

 x1  0 1
     
 x2  = s  1  + t  0  , for s, t  R.
x  0 1
 3    

0 1
   
X2 = 1, X3 =  0
0 1
   

 1   1  0  
      
Let  =  4  ,  0  ,  1  
 2   1   0  
      

1 1 0
 
Q = 4 0 1
 2 1 0
 
Q = 1(−1) − 1(−2) = −1 + 2 = 1

 −1 2 2 
T

 
AdjQ =  0 0 1 
 1 −1 −3 
 
1
Q −1 = Adj Q
Q
  −1 0 1 
−1  
Q =  2 0 −1 
 2 1 3
 
 −1 0 1  2 0 −1  1 1 0   0 0 0 
     
D = Q −1 AQ =  2 0 −1  4 1 −4  4 1 1  =  0 1 0  .
 2 1 3  2 0 −1  2 1 0   0 0 1 
     