SVKM’s Narsee Monjee Institute of Management Studies

Mukesh Patel School of Technology Management & Engineering

Unit II
Linear Transformations and Eigenvalues

Detailed Syllabus:
2.1 Linear transformations
2.2 Matrix associated with a linear map
2.3 Composition of linear maps
2.4 Kernel and Range of a linear map, Rank-nullity theorem
2.5 Inverse of a linear transformation
2.6 Cayley-Hamilton Theorem
2.7 Eigenvalues and eigenvectors:
Symmetric, Skew-symmetric, Hermitian, and Skew-Hermitian matrices
2.8 Diagonalization of matrices

2.1 Linear transformations (maps)

Definition of Linear Transformation:

A Linear Transformation from a vector space V to vector space W is a mapping T : V → W such

that, for all v1 and v2 in V and for all scalars c ( c ∈ R ),

1. T ( v1 + v2 ) = T ( v1 ) + T ( v2 )

2. T ( cv1 ) = cT ( v1 )

This definition is equivalent to the following:

T ( c1v1 + c2v2 + ..... + ck vk ) = c1T (v1 ) + c2T (v2 ) + ....... + ck T (vk )

Examples of linear transformations:

1. T : R → R , T ( x ) = 4 x .

2. T : R 2 → R, T ( x, y ) = 2 x + 3 y .

3. T : R 2 → R 2 , T ( x, y ) = ( 3x + y, x − 2 y ) .

4. T : R3 → R 2 , T ( x, y, z ) = ( 2 x + z , x − 3 y ) .

5. T : R3 → R3 , T ( x, y, z ) = ( x, y,0 ) .

6. T : R3 → R3 , T ( x, y, z ) = ( x + 2 y − 3z , 2 x − y + z , − x + 2 y + z ) .

1
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

Standard Linear Transformations on R 2 and R3 :

1. Reflection about the x-axis T (x, y) = (x, -y)

2. Reflection about the y-axis T (x, y) = (-x, y)

3. Reflection about the line y=x T (x, y) = (y, x)

4. Reflection about the xy plane T (x, y, z) = (x, y, -z)

5. Reflection about the xz plane T (x, y, z) = (x, -y, z)

6. Reflection about the yz plane T (x, y, z) = (-x, y, z)

7. Orthogonal projection onto the x-axis T (x, y) = (x, 0)

8. Orthogonal projection onto the y-axis T (x, y) = (0, y)

9. Orthogonal projection onto the xy-plane T (x, y, z) = (x, y, 0)

10. Orthogonal projection onto the xz-plane T (x, y, z) = (x, 0, z)

11. Orthogonal projection onto the yz-plane T (x, y, z) = (0, y, z)

12. Counterclockwise rotation about the origin through an angle θ

T ( x, y ) = ( x cos θ − y sin θ , x sin θ + y cos θ )

13. Counterclockwise rotation about the positive x-axis through an angle θ

T ( x, y, z ) = ( x, y cos θ − z sin θ , y sin θ + z cos θ )

14. Counterclockwise rotation about the positive y-axis through an angle θ

T ( x, y, z ) = ( x cos θ + z sin θ , y, − x sin θ + z cos θ )

15. Counterclockwise rotation about the positive z-axis through an angle θ

T ( x, y, z ) = ( x cos θ − y sin θ , x sin θ + y cos θ , z )

16. Contraction/Dilation with factor k, T (x, y) = (kx, ky) in
2

2
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

17. Contraction/Dilation with factor k, T (x, y, z) = (kx, ky, kz) in
3

18. Compression/expansion in the x-direction with factor k in
2 T (x, y) = (kx, y)

19. Compression/expansion in the y-direction with factor k in
2 T (x, y) = (x, ky)

20. Shear in the x-direction by a factor k in
2 T (x, y) = (x + ky, y).

21. Shear in the y-direction by a factor k in
2 T (x, y) = (x, y+kx).

Remark:

If T : V → W is a linear transformation, then

i. T (0) = 0

ii. T ( − v1 ) = −T ( v1 )

iii. T ( v1 − v2 ) = T (v1 ) − T ( v2 )

Remark:

Let V and W be vector spaces and let {v1 , v2 ,....., vn } be a basis of V . Recall for every x ∈V ,

x = c1v1 + c2 v2 + .....cn vn

for some scalars c1 , c2 ,....cn . Let T : V → W be any linear transformation. Since,

T ( x) = c1T ( v1 ) + c2T ( v2 ) + ....... + cnT ( vn )

we can see that any linear transformation T is completely determined by its action on a basis of
V.

2.2 Matrix associated with a linear map.

Matrix associated with Linear Transformation:

Pre-requisites:

Linear transformation, knowledge of matrices

Let V and W be vector spaces of dimension n and m respectively. Let {v1 , v2 ,....., vn } be a basis
of V and {w1 , w2 ,....wm } be a basis of W . Let T : V → W be a linear map. As
T ( v1 ) , T ( v2 ) ,.....T ( vn ) are elements of W , we have

3
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

T ( v1 ) = a11w1 + a21w2 + ..... + am1wm

T ( v2 ) = a12 w1 + a22 w2 + ..... + am 2 wm
   
T ( vn ) = a1n w1 + a2 n w2 + ..... + amn wm

where aij are scalars.

 a11 … a1n 
 
The matrix A =      is called the matrix associated with T with respect to the basis
a 
 m1  amn 
{v1 , v2 ,....., vn } and {w1 , w2 ,....wm } .

 x1   y1 
   
x2 y2
Remark: For every vector x in V , A ×   =   where xi ,1 ≤ i ≤ n are the co-ordinates of
    
   
 xn   ym 
x with respect to the basis {v1 , v2 ,....., vn } and y j ,1 ≤ j ≤ m are the co-ordinates of y = T ( x ) with
respect to the basis {w1 , w2 ,....wm } .

2.3 Composition of linear maps

Pre-requisites: Fundamental knowledge of functions.

Composition of Linear Transformation:

Let U , V and W be vector spaces of dimension n , m and r respectively. Let T : U → V and

S : V → W be linear maps. Then, S  T : U → W is also a linear map.

Matrix associated with the composite linear transformation:

Let U , V and W be a vector spaces with bases B1 = {u1 , u2 ,....., un } , B2 = {v1 , v2 ,....., vm } and
B3 = {w1 , w2 ,....wr } respectively. Let T : U → V and S : V → W be linear maps. Let us denote the
matrix associated with the linear map, T : U → V with respect to the bases B1 and B2 as [ A]B ← B ;
2 1

and the matrix associate with S : V → W with respect to the bases B2 and B3 as
[ B ]B ← B respectively. Then, the matrix associated with the linear map
3 2
S  T : U → W , denoted
by [C ]B ← B satisfies
3 1

(0.1)

4
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

[ C ] B ← B = [ B ]B ← B [ A ]B ← B
3 1 3 2 2 1
.

(Right hand side of the above equation is the product of two matrices.)

2.4 Range and kernel of a linear map, Rank-nullity theorem

Range and Kernel of a Linear Transformation:

Pre-requisites: Fundamental knowledge of functions, Vector space and Linear transformations.

Let V and W be vector spaces. Let T : V → W be any linear transformation. The Kernel of T ,
denoted as ker( T ), is the set of all vectors in V , that are mapped by T to 0 in W . That is

ker (T ) = {v ∈V : T (v) = 0}

The range of T , denoted as range( T ), is the set of all vectors in W that are images of vectors in
V under T . That is

range(T ) = {T (v) : v ∈ V }
= {w ∈ W : w = T (v) for some v ∈ V }

Note: The kernel of a linear transformation T , ( ker( T )) is a subspace of V ; and the range of T ,
(range( T )) is a subspace of W .

Rank and Nullity:

Let T : V → W be any linear transformation. The rank of T is the dimension of the range of T ,
and is denoted by rank( T ). The nullity of T is the dimension of the kernel of T , and is denoted
by nullity( T ).

Rank Nullity theorem:

Let V and W be vector spaces. Let T : V → W be any linear transformation. Then

dim V = Rank (T ) + Nullity(T )

2.5 Inverse of a linear transformation

Definition: Let U and V be vector spaces and T : U → V be a linear map. A linear map
T −1 : V → U is the inverse of T if T  T −1 = T −1  T = I .

Note: T −1 : V → U is also linear.

Definition: A linear map T : U → V which has inverse is called invertible or nonsingular

transformation or an isomorphism.

5
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

A linear transformation is said to be invertible if the map T : U → V is one- one and onto.

Matrix associated with inverse of a linear transformation

Let U and V be vector spaces with bases B1 = {u1 , u2 ,....., un } , B2 = {v1 , v2 ,....., vm } and let
T : U → V be a linear map. The matrix of T −1 : V → U with respect to given bases is the inverse
of matrix of a linear map T : U → V with respect to the same bases.

2.6 Cayley-Hamilton Theorem

Every square matrix satisfies its own characteristic equation; i.e. if the characteristic equation
for the nth order square matrix A is
n
A − λ I = ( −1) λ n + k1λ n −1 + ..... + kn = 0 then

n
( −1) An + k1 An −1 + ..... + kn I = 0 …..(i)

Note: To find A−1 multiply A−1 both sides of (i) and simplify we get,
1
A−1 = − ( −1) An −1 + k1 An − 2 + ..... + kn −1 I 
n

kn  

2.7 Eigenvalues and Eigenvectors:

In this section we will consider only square matrices.

1. Prerequisite to the topic
Basic knowledge of matrices and its elementary transformations, Solving system of Linear
system of equations.

Definitions, Formulae and Theory

Eigenvalues & Eigenvectors

Let A be a n × n matrix. Suppose the linear transformation Y = AX transforms X into a

scalar multiple of itself i.e. AX = Y = λ X where X is an invariant vector.
Then the unknown scalar λ is known as an eigenvalue of the matrix A and the
corresponding non-zero vector X is known as eigenvector.
∴ AX = λ X for any X ≠ 0
∴ AX − λ IX = 0
∴( A − λ I ) X = 0
This represent a system of n homogeneous equations in the n variables.

6
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

It has a non-trivial solution if the coefficient matrix ( A − λ I ) is singular.

i.e. A − λ I = 0
This is known as the characteristic equation of A .
Expansion of the determinant gives a nth degree polynomial known as characteristic
polynomial of A .
Thus eigenvalues of matrix A are the roots of the characteristic equation. Hence A can have
at least one and at most n eigenvalues.
The eigenvector X corresponding to an eigenvalue λ is obtained by solving the
homogeneous system i.e. ( A − λ I ) X = 0 with this known eigenvalue λ .

Note 1: If all the n eigenvalues of A are distinct, then there correspond n distinct linearly
independent eigenvectors.
Note 2: For an eigenvalue of A , repeated (twice or more), there may correspond one or
several linearly independent eigenvectors. Thus the set of eigenvectors may or may not form a
set of n linearly independent vectors.
Note 3: Algebraic multiplicity of an eigenvalue λ is the order of the eigenvalue as a root of
the characteristic polynomial. (i.e. If λ is a double root then algebraic multiplicity is 2).
Note 4: Geometric multiplicity of λ is the number of linearly independent eigenvectors
corresponding to λ .
Note 5: Formula for finding characteristic equation of a 3 × 3 matrix
λ 3 − trace ( A) λ 2 + ( A11 + A22 + A33 ) λ − det ( A) = 0

Note:
1. The eigenvalues of a real symmetric matrix are real. The eigenvalues of a real skew
symmetric matrix are purely imaginary or zero.
2. The eigenvalues of an orthogonal matrix are real or complex conjugates in pairs and have
absolute value 1.
Theorems on Eigen Values and Eigen Vectors
1. The eigen vectors corresponding to distinct eigen values of a real symmetric matrix are
orthogonal.
1 1 1
2. If λ1 , λ2 ,......, λn are eigen values of A , then , ,......, are eigen values of A−1 .
λ1 λ2 λn
A
3. If λ is eigen value of non-singular matrix A , then is eigen value of adjoint of A .
λ
4. If A is upper and lower triangular matrix, diagonal elements are eigen values of it.
5. If f ( x ) is an algebraic polynomial in x and λ is an eigen value and X is an corresponding
eigen vector of a matrix A then f ( λ ) is an eigen value and X is an corresponding eigen
vector of a matrix f ( A) .

7
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

2.8 Diagonalization of matrices

Similar Matrices
If A and B are two square matrices of order n then B is said to be a similar to A if there
exists a non-singular matrix M such that B = M −1 AM .
A square matrix A is said to be diagonalisable if it is similar to a diagonal matrix.

If λ1 is an eigen value of the characteristic equation A − λ I = 0 repeated t times then t is

called algebraic multiplicity of λ1 . If s is the number of linearly independent eigen vectors
corresponding to the eigen value λ1 then s is called geometric multiplicity of λ1 .
Note:
1. The necessary and sufficient condition of a square matrix to be similar to a diagonal
matrix is that the geometric multiplicity of each of its eigen values coincides with the
algebraic multiplicity.
2. Every matrix whose eigen values are distinct is similar to a diagonal matrix.
3. A square nonsingular matrix A whose eigen values are all distinct can be diagonalised by
a similarity transformation D = M −1 AM where M is the matrix whose columns are the
eigen vectors of A and D is the diagonal matrix whose diagonal elements are the eigen
values of A.

Classwork Problems

2.1 Linear transformations (maps)

Show that the following maps are not linear:

1. T : R → R, T ( x) = x 2 .

2. T : R 2 → R, T ( x, y) = xy .

Problems on Linear maps:

1. Draw the image of the unit square with corners (0, 0), (1, 0), (1,1) and (0,1) under the
following linear maps and explain the geometric effect of T on the rectangle mentioned
above.
a) T ( x, y ) = (3 x, y )
b) T ( x, y ) = ( x, − y )
c) T ( x, y ) = ( x + 2 y, y )
2. Let T : R 2 → R 2 be a linear map such that T (1, 0) = (1,1) , T (0,1) = ( −1, 2 ) . Let S be a
square whose corners are at (0,0),(1, 0), (1,1) and (0,1) . Show that the image of S under
T is a parallelogram.

8
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

2.2 Matrix associated with a linear map

1. Let T : R 2 → R 2 , T ( x, y) = ( x + y, x − y ) . Find the matrix associated with T with respect to
the standard basis.

1 1 
Ans : 
1 −1

2. Let T : R3 → R 2 , T ( x, y, z ) = ( x + 2 z ,3x − z ) . Find the matrix associated with T with

respect to the standard basis.

1 0 2 
Ans : 
 3 0 −1

3. Let T : R 2 → R3 , T ( x, y) = ( x, x + y, y ) . Find the matrix associated with T with respect to

the basis : {(1,1), (0,1)} of R 2 and the standard basis of R3 .

1 0
 
Ans : 2 1 
1 1
 

4. Let T : R3 → R 2 , T ( x, y, z ) = ( x − 2 y, x + y − 3z ) . Let B = {e1 , e2 , e3} and C = {e2 , e1} be

basis for R3 and R 2 respectively. Find the matrix M with respect to B and C . Verify that
1
  1 1 −3 
M  3  = T (1,3, −2 ) . Ans : ,
 −2   1 −2 0 
 
T (1,3, −2 ) = (−5,10)

π
5. Find the matrix associated with T , where T is rotation by .
4

 1 −1 
 
2 2
Ans :
 1 1 
 
 2 2
6. For the following matrices given below, write the corresponding linear
transformations T : R 2 → R 2 . Also draw the image of the rectangle with corner points (0,0),
(2,0), (2,1) and (0,1). In each case explain the geometric effect of T on this rectangle.
 1 3
a)  
 0 1

9
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

3 0
b)  
0 3

2.3 Composition of linear maps

1. Let T : R 2 → R 2 be defined by T ( x, y ) = ( x + y, x − y ) and S : R 2 → R be defined by
S ( a, b) = a + b . Find S  T ( x, y ) . Ans : S  T ( x, y ) = 2 x

2. Let T : R3 → R 2 , T ( x, y, z ) = ( x + 2 z ,3x − z ) ; and S : R 2 → R3 , S ( x, y ) = ( x, x + y, y ) . Find

S  T and T  S . Write the matrices of T , S , S  T and T  S with respect to the standard
basis. Verify the result stated by eqution (1.1).

Ans : S  T ( x, y, z ) = ( x + 2 z , 4 x + z ,3x − z ) , T  S ( x, y ) = ( x + 2 y,3x − y )

1 0 1 0 2 
1 0 2  1 2 
MT =   M S =  1 1  M S T =  4 0 1  M T S =  
 3 0 −1  0 1  3 0 −1  3 −1 
   

a +b b 
3. Define linear transformations S : R 2 → M 22 and T : R 2 → R 2 by S ( a, b ) =  
 0 a −b
and T ( c, d ) = ( 2c + d , − d ) . Compute ( S  T ) ( x, y ) .

 2x −y 
Ans : ( S  T ) ( x, y ) =  
 0 2x + 2 y 
4. Use matrix method and verify the answer in example 1.

1 1 
Ans : M T =   M S = (1 1) M S M T = ( 2 0)
 1 −1

5. Let T1 and T2 represent linear maps on R 2 . If T1 represents reflection about y- axis and T2
represents expansion in the direction of y-axis by a factor of 2, write the linear
transformation T1  T2 and T2  T1 .

6. Draw the image of the unit square with corner points (0,0), (1,0), (1,1) and (0,1) under the
map T = T1  T2 where T1 is reflection about the line x = y and T2 is expansion in the
direction of y-axis by a factor of 3.
2.4 Range and kernel of a linear map, rank-nullity theorem
1. Find the range and kernel of T : R 3 → R defined by T ( x, y, z ) = 3x − 2 y + z .

Ans : Ker T = {( x, y, 2 y − 3x ) | x, y ∈R} , Range = R

2. Find the range and kernel of T : R 2 → R 3 defined by T ( x, y ) = ( x, x + y, y ) .

10
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

Ans : Ker T = {( 0, 0 )} , Range = {( r , s, s − r ) | r , s ∈ R}

3. Find the range and kernel of T : R 3 → R 3 defined by

T ( x, y , z ) = ( x + z , x + y + 2 z , 2 x + y + 3 z ) .

Ans : Ker T = {( − z, − z, z ) | z ∈ R} , Range = {( r , s, s + r ) | r , s ∈ R}

4. Find the range and kernel of T : R 3 → R 3 defined by

T ( x, y , z ) = ( x − y + z , y − z , 2 x − 5 y + 5 z ) .

Ans : Ker T = {( 0, y, y ) | y ∈ R} , Range = {( r , s, 2r − 3s ) | r , s ∈ R}

5. Find the range and kernel of T : R 3 → R 3 defined by T (e1 ) = e1 + e3 , T (e2 ) = e2 + e3 and

T (e3 ) = −e3 .

Ans : Ker T = {( 0, 0, 0 )} , Range = R3

6. Find rank and nullity of the linear transformations given in problem 1 to 5.

Nullity Rank
1 2 1
2 0 2
3 1 2
4 1 2
5 0 3
7. Verify Rank- nullity theorem for the linear transformations given in problem 1 to 5.

2.5 Inverse of a linear transformation

1. Let F : R 3 → R 3 be defined by F ( x, y , z ) = ( x + y − 2 z , x + 2 y + z , 2 x + 2 y − 3 z ) Find if F is
nonsingular.
2. Find the linear map T : R 2 → R 2 for which T (1, 2) = (2,3) and T (0,1) = (1, 4) . Find a formula
for T ( x, y ). Is T invertible? If so, find T −1 .

 4u − v 
Ans: T ( x, y ) = ( y , 4 y − 5 x ). T is invertible. T −1 ( u , v ) =  ,u 
 5 

3. Let T : R 3 → R 3 be defined by T( x, y , z ) = ( x + y + z , x + 2 y − z , 3 x + 5 y − z ) .Find if T is

nonsingular. If not, find u ≠ 0, u in R 3 such that Tu = 0 .

Ans: T is singular. If u= (-3, 2, 1), then Tu=0.

11
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

4. Show that T : R 2 → R 2 be defined by T( x, y ) = (2 x + y , 3 x − 5 y ) is invertible. Find T −1 .

 5u + v 3u − 2v 
Ans: T −1 ( u , v ) =  , 
 13 13 

5. Show that T : R 3 → R 3 be defined by

is invertible. Find the matrix associated with T −1 , with respect to the basis
.

Ans:

2.6 Cayley-Hamilton Theorem

1. Find the characteristic equation of the matrix given below and verify that it satisfies Cayley-
1 1 3 7 −1 3 
Hamilton theorem: i) A = 1 0 −3 , ii) A =  6
  1 4 
  
 −2 1 0   2 4 8 
2. Verify Cayley-Hamilton theorem for the matrix A and hence find A−1 , where
 1 2 −2  3 2 6

A =  −1 3 0   Ans. A − 5 A + 9 A − I = 0, A =  1 1
3 2 −1
2  .

 0 −2 1   2 2 5 

3. Find the characteristic equation of the matrix A. Show that the matrix A satisfies the
characteristic equation and hence find A−1 and A4 .

1 2 3   −3 5 11   248 101 218

i) A =  2 −1 4 
1 
 
Ans. A =−1
14 −10 2  , A =  272 109 50 
 4

40 
 3 1 −1  5 5 −5 104 98 204 

 1 2 1  3 −3 6   46 20 10 
ii) A =  −1 0 3
1 
 
Ans. A =−1
 7 −1 −4  , A =  −10 36 30 
 4

18
 2 −1 1  1 5 2   20 −10 46 

4. Find the characteristic equation of the matrix A given below and hence, find the matrix
1 4 
represented by A5 − 4 A4 − 7 A3 + 11A2 − A − 10I in terms of A , where A =   .
2 3
[Ans. A + 5 I ]
5. Find the characteristic equation of the matrix A given below and hence, find the matrix

12
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

2 1 1
represented by A − 5 A + 7 A − 3 A + A − 5 A + 8 A − 2 A + I , where A =  0 1 0  .
8 7 6 5 4 3 2
 
 1 1 2 
8 5 5 
[Ans. 0 3 0  ]
 
5 5 8 
6. Find Characteristic equation of matrix A and hence find the matrix represented
1 3 7 
by A − 4 A − 20 A − 34 A − 4 A − 20 A − 33 A + I where A =  4 2 3  .
7 6 5 4 3 2
 
1 2 1 
 3 6 14 
[Ans. 8 5 6  ]
 
 2 4 3 

2.7 Eigenvalues and eigenvectors: Symmetric, skew-symmetric and orthogonal matrices

1 0 −1
1. Find eigenvalues and eigenvectors of A = 1 2 1  .
 2 2 3 
Solution: Characteristic equation of A is given by det ( A − λ I ) = 0
1− λ 0 −1
1 2−λ 1 =0
2 2 3− λ
λ 3 − 6λ 2 + 11λ − 6 = 0
( λ − 1)( λ − 2 )( λ − 3) = 0
∴ λ = 1, 2, 3.
These are the three distinct eigenvalues of A .
Now finding corresponding eigenvectors,
For λ = 1 ,
( A − λI ) X = 0
0 0 −1  x1 
1 1 1   x  = 0
  2
 2 2 2   x3 
R1 ↔ R2
1 1 1   x1 
0 0 −1  x  = 0
  2
 2 2 2   x3 

13
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

R3 − 2 R1
1 1 1   x1 
0 0 −1  x  = 0
  2
0 0 0   x3 
∴ x3 = 0
And x1 + x2 + x3 = 0
i.e. x1 + x2 = 0
Let x1 = k1
∴ x2 = − k1
1
Hence, eigenvector is X 1 = k1  −1 .
 0 
Alternate method: (Applicable only for distinct eigenvalue)
For λ = 1 ,
( A − λI ) X = 0
0 0 −1  x1 
1 1 1   x  = 0
  2
 2 2 2   x3 
∴− x3 = 0
x1 + x2 + x3 = 0
2 x1 + 2 x2 + 2 x3 = 0
Consider two distinct equations,
x1 + x2 + x3 = 0
− x3 = 0
Now by using modified Cramer’s rule, we get
x1 − x2 x
= = 3
1 1 1 1 1 1
0 −1 0 −1 0 0
x1 − x2 x3
= =
−1 −1 0
x x x
Let 1 = 2 = 3 = k1
−1 1 0
1
Hence, eigenvector is X 1 = −k1  −1 .
 0 
For λ = 2 ,

14
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

( A − λI ) X = 0
 −1 0 −1  x1 
 1 0 1  x  = 0
  2
 2 2 1   x3 
2
On solving, we get eigenvector X 2 = k2  −1
 −2
For λ = 3 ,
( A − λI ) X = 0
 −2 0 −1  x1 
 1 −1 1   x  = 0
  2
 2 2 0   x3 
1
On solving, we get eigenvector X 3 = k3  1  .
 −2

[Link] the eigenvalues and eigenvectors of

[Ans. and ]

3. Find the eigenvalues and eigenvectors of

[Ans. and for ; for ]

4. Find the eigenvalues and eigenvectors of

[Ans. and ]

2 4 −1 3
5. If A =   then find eigen values of 6 A + A + 2I . [Ans. 31, 13]
 0 3 
1 2 3 −2 
0 2 4 6 
6. Find eigen values of adj ( A ) if A =   [Ans. 48, 24, 12, 8]
 0 0 4 −5 
 
0 0 0 6 

15
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

 1 8 2
7. If A =   find Eigen values and Eigen vectors of A + 2 A + I . [Ans. 36, 4]
 2 1 

8. If If A= , find the eigen values for the following matrices

(i) A, (ii) AT , (iii) A-1, (iv) 4A-1, (v) A2, (vi) A2-2A+I, (vii) A3 +2I.

9. Find the eigenvalues and eigenvectors of

[Ans. and ]

10. Obtain the eigenvalues and corresponding orthogonal eigenvectors of the symmetric matrix

[Ans. and ]

11. Obtain the eigenvalues and corresponding orthogonal eigenvectors of the symmetric matrix
 6 −2 2  1   2   1 

A =  −2 3 −1   [Ans: 2,2,8 and  2  ,  −1 ,  0  ]
     
 2 −1 3 
   0   1   −2 
12. Obtain the eigenvalues and corresponding orthogonal eigenvectors of the symmetric matrix
1 2 2  1   1  1

A = 2 1 2  [Ans: -1,-1,5 and  −1 ,  0  , 1 ]
    
2 2 1  0   −1 1
 
13. Find Eigen values and Eigen vectors for the following matrices:
 0 1 1  −1
a.   [Ans. λ = i, −i and   ,   ]
 −1 0  i   i 
 2 −1  i   −i 
b.   [Ans. λ = 2 + i, 2 − i and   ,   ]
1 2  1  1 

14. Find the eigenvalues of the following matrices:

 0 −6 −12   0 2 −6 

a.  6 0 −12   b.  −2 0 −9  [Ans. a. λ = 0,18i, −18i ; b. λ = 0,11i, −11i ]
12 12 0   6 9 0 
15. Find Eigen values and Eigen vectors for the following orthogonal matrix

16
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

0 1  1  1 
1 0  [Ans. λ = 1, −1 and   ,   ]
  1  −1

 4 8 1 
9 9 9 
 
−7 4 −4 
16. Find the eigenvalue of the given orthogonal matrix A = 
9 9 9 
 
 −4 1 8 
 9 9 9 
7 5 11 7 5 11
[Ans. λ = 1, + i, − i ]
18 18 18 18

2.8 Diagonalization of matrices

1. Find the algebraic multiplicity and geometric multiplicity of each eigen value of the
4 6 6

matrix 1 3 2  .

 −1 −5 −2 

[Ans. λ = 1, 2, 2 for λ = 1, a.m. = g.m. = 1& λ = 2, a.m. = 2, g.m. = 1 ]

2. Show that the following matrix is diagonalizable. Also find the diagonal matrix and
 6 −2 2 
diagonalising matrix, A =  −2 3 −1 .
 
 2 −1 3 
 6 −2 2 
Answer: Given A =  −2 3 −1
 
 2 −1 3 
Trace of A = 12
Sum of minors of diagonal elements of A = 36
A = 32
∴ characteristic equation is λ 3 − 12λ 2 + 36λ − 32 = 0 .
∴ λ = 8, 2, 2
For λ = 2
Consider AX = λ X  [ A − λ I ] X = 0
 4 −2 2   x   0   4 −2 2   x   0 
 −2 1 −1  y  =  0  →2 R2 + R1     
      2 R3 − R1  0 0 0   y  =  0 
 2 −1 1   z   0   0 0 0   z   0 
Rank of coefficient matrix=1
Number of Variables=3
Number of independent solution= Number of Variables - Rank of
coefficient matrix=3-1=2
17
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

Considering above matrix form in equation form,

2x − y + z = 0  z = y − 2x
Put x = s, y = t then z = t − 2s
Solution is {( s, t , t − 2s ) / s, t ∈ R − {0}}
'
Linearly independent solution is (0,1,1)' and (1, 0, −2 ) .
Arithmetic mean=2=Geometric mean
For λ = 8
Consider AX = λ X  [ A − λ I ] X = 0
 −2 −2 2   x   0 
 −2 −5 −1  y  =  0 
    
 2 −1 −5   z   0 
By Crammers Rule,
x −y z x −y z
= =  = =
−2 2 −2 2 −2 −2 12 6 6
−5 −1 −2 −1 −2 −5
'
Solution is ( 2 , −1,1)
Arithmetic mean=1=Geometric mean
Matrix A is diagonalizable.
2 0 0 0 1 2
−1
D = M AM where D =  0 2 0  , M = 1 0 −1 .
  
 0 0 8  1 −2 1 

 8 −6 2 
3. Show that the matrix A =  −6 7 −4  is diagonalizable. Find the transforming matrix and
 
 2 −4 3 
the diagonal matrix.

1 2 2 0 0 0 
[Ans. M = 2 1 −2 , D =  0 3 0  ]
 
   
 2 −2 1   0 0 15 

 −9 4 4 
4. Show that the matrix A =  −8 3 4  is diagonalizable. Find the transforming matrix M
 
 −16 8 7 
and the diagonal matrix D.

1 1 1   −1 0 0 
[Ans. M = 0 2 1 , D =  0 −1 0  ]
 
   
 2 0 2   0 0 3 

18
 SVKM’s Narsee Monjee Institute of Management Studies
Mukesh Patel School of Technology Management & Engineering

 1 −6 −4 
5. Show that the matrix A =  0 4 2  is diagonalizable. Find the transforming matrix M

 0 −6 −3
and the diagonal matrix D.

2 1 2 0 0 0
[Ans. M = −1 −2 −2 , D =  0 1 0  ]
 
   
 2 3 3   0 0 1 

 2 −1 1 
6. Check whether the following matrix is similar to diagonal matrix: A =  2 2 −1 .
 
 1 2 −1
[Ans. No]
2 3 4 
7. Show that the matrix A =  0 2 −1 is not similar to diagonal matrix.
 0 0 1 

19