1

2
Please read this disclaimer before proceeding:
This document is confidential and intended solely for the educational purpose of
RMK Group of Educational Institutions. If you have received this document
through email in error, please notify the system manager. This document
contains proprietary information and is intended only to the respective group /
learning community as intended. If you are not the addressee you should not
disseminate, distribute or copy through e-mail. Please notify the sender
immediately by e-mail if you have received this document by mistake and delete
this document from your system. If you are not the intended recipient you are
notified that disclosing, copying, distributing or taking any action in reliance on
the contents of this information is strictly prohibited.

3
24MA201 - Linear Algebra
and Applications
DEPARTMENT CSE, IT, ADS and CSD

BATCH/YEAR 2024-2028/ I

CREATED BY Department of Mathematics

DATE 28.02.2025
Table of Contents
S. NO. TOPICS Page No.

1 Course Objectives 6
2 Pre Requisites 7
3 Syllabus 8
4 Course Outcomes 9
5 CO – PO/PSO Mapping 10
6 Lecture Notes: Unit III- Linear
transformation
Lecture Plan 11
Activity Based Learning 12
4.1 Linear Transform 13
4.2 Null space 17
4.3 Range 17
4.4 Nullity and Rank of T 18
4.5 Dimension Theorem 19
4.6 The Matrix representation of a 29
linear transformation
4.7 Eigen values and Eigen vectors 34
4.8 Properties of Eigen Values and Eigen 37
Vectors
4.9Practice Quiz 59
4.10 Assignment 62
4.11 Part A Questions and Answers 68
4.12 Part B Questions 77
7 Supportive Online Certification Courses 79
8 Real Time Applications 77
9 Content Beyond the Syllabus 80
10 Prescribed Text Books & Reference Books 81
11 Mini-Project 84

5
 COURSE OBJECTIVES

S. No. Course Objectives

The syllabus is designed to:

1 Comprehend the fundamental concepts of matrices.

Illustrate the basic notions associated with vector

2 spaces and its properties.

3 Utilize the Gram-Schmidt ortho normalization process.

4 Understand the components and implications for

vector spaces by rank-nullity dimension theorem.

5 Calculate the eigenvalues and eigenvectors of linear

transformations.

6
 PREREQUISITES

Subject Code: 24MA201

Subject Name: LINEAR ALBEGRA AND APPLICATIONS

PREREQUISITES

TOPICS COURSE NAME WITH CODE

To learn Linear Algebra one has

to be strong in Mathematics Higher Secondary Level
including the basic concepts of
Mat rice s a n d D e t e r m i n a n t s .
Familiarization in functions, set
t h e o r y, r e l a t i o n s a n d linear
equations is mandatory.

7
 SYLLABUS

24MA201 LINEAR ALGEBRA AND APPLICATIONS LTPC

3024
UNIT I Matrices and System of Linear Equations 15
Matrices – Row echelon form – Rank of a matrix – System of linear equations –
Consistency – Gauss elimination method – Gauss Jordan method.
Experiments using C language:
1. Solve the system of equations using Gauss Elimination method.
2. Solve the system of equations using Gauss Jordan method.

UNIT II Vector spaces 15

Real and Complex fields – Vector spaces over Real and Complex fields – Subspace
– Linear space – Linear independence and dependence (Statement only) – Bases
and dimensions.
Experiments using C language:
1. Check whether the given vectors are linearly independent or not.
2. Find the basis and dimension for given vectors.

UNIT III Inner product spaces 15

Inner product space and norms – Properties – Orthogonal, Orthonormal vectors –
Gram- Schmidt ortho normalization process – Least squares approximation.
Experiments using C language:
1. Find the orthogonal vectors using inner product.
2. Find the orthonormal vectors using inner product.
UNIT IV Linear Transformation 15
Linear transformation – Range and null space – Rank and nullity – Rank nullity
Dimension theorem – Matrix representation of linear transformation – Eigenvalues
and eigenvectors of linear transformation.
Experiments using C language:
1. Find the Rank and Nullity of a matrix.
2. Find the eigenvalues and eigenvectors of a matrix.

UNIT V Eigenvalue Problems And Matrix Decomposition 15

Eigenvalue problems – Power method – Jacobi method – Singular value
decomposition – QR decomposition.
Experiments using C language:
1. Solve the system of equations using Jacobi method.
2. Find QR decomposition of a matrix.

TOTAL: 75 PERIODS

8
 Course Outcomes

Highest
Course Outcomes Cognitive
CO’s
Level

After the successful completion of the course, the student will be able to:

CO1 Solve the system of linear equations using Gauss

K2
elimination and Gauss Jordan method.

CO2 Analyze vector spaces to determine their bases and

dimensions.
K2

Apply Gram-Schmidt process to ortho normalize sets of

K2
CO3 vectors.

Apply rank nullity theorem to analyse linear

transformations.
K2
CO4

CO5 Compute the eigenvalues and eigenvectors using

K2
singular value decomposition.

Understand the ideas of least squares approximations K2

CO6
and its applications

9
 CO-PO/PSO Mapping

CO’s PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 - - - - - - - - - 1

CO2 3 2 - - - - - - - - - 1

CO3 3 2 - - 1 - - - - - - -

CO4 3 2 - 1 - - - - - - - -

CO5 3 2 - - 1 - - - - - - -

CO6 3 - 2 - - - - - - - - 1

CO’s PSO1 PSO2 PSO3

CO1 - - -

CO2 - - -

CO3 - - -

CO4 - - -

CO5 - - -

CO6 - - -

10
LECTURE PLAN- UNIT III

Topics to be No. of Purposed Knowledge Mode of

S.No. Actual Date CO
covered periods Date level Delivery
12.3.2025 Board &
1 Linear Transform 1 13.3.2025 CO3 K2 Marker
14.3.2025 Board &
Nullity and Rank of (T)
2 1 CO3 K1 Marker

15.3.2025 Board &

Dimension Theorem
3 1 CO3 K2 Marker

17.3.2025 Board &

4 Problems 1 CO3 K2 Marker

The Matrix 18.3.2025 Board &

5
representation 1 CO3 K2 Marker

19.3.2025 Board &

6 CO3
Problems 1 K2 Marker

20.3.2025 Board &

7 Problems 1 CO3 K2 Marker

21.3.2025 Board &

8 Eigen values and Eigen
1 CO3 K2 Marker
vectors

Properties of Eigen 22.3.2025

Values and Eigen Board &
9 1 CO3 K1
Vectors Marker

Test for 24.03.2025 Board &

11 Diagonalization 1 CO3 K2 Marker

25.3.2025
Board &
12 Problems 1 CO3 K2 Marker

11
 ACTIVITY BASED LEARNING

Activity based learning enhances students’ critical thinking and

collaborative skills. Experiential learning being the core, various activities
such as quiz competitions, group discussion, etc. are conducted for all the
five units to enhance the learning abilities of students. The students are the
center of the activities, where student’s opinions are valued, questions are
encouraged, and discussions are done. These activities empower the
students to explore and learn by themselves.

S.No. TOPICS Activity Link

Linear Quiz and Flash https://quizizz.com/join/quiz/5f476be9602

1
Transformation card c23001b93fbe8/start?studentShare=true

Quiz and Flash https://quizizz.com/join/quiz/5f47d7af32a

2 Eigen vectors
card 121001b6531aa/start?studentShare=true

https://drive.google.com/file/d/1d9hODjw
Linear
3 Assignment fIiH40f3jzhpgze8LWva8JkWI/view?usp=sha
Transformation
ring

12
LECTURE NOTES -UNIT III

View the lecture on YouTube

https://www.youtube.com/watch?v=zvRdbPMEMUI

LINEAR TRANSFORMATION

4.1 Linear Transform:

Let V and W be vector spaces over F, we call a function T :V W a linear
transformation if for all x, y  V and c  F

i) T x  y   T x   T  y 

ii)T cx   cT x 

Properties 1:
1)If T is linear, then T 0   0.

Proof:
Given T is linear
T  x  y   T x   T  y 

T cx   cT x 

T 0   T 0x   0T 0 

T 0   0

2. T is linear , iff T cx  y   cT x  T  y 

Proof:
Given T is linear
T x  y   T x   T  y  & T cx   cT x 

T cx  y   T cx  T  y   cT x  T  y 

Converse Part:

Given T cx  y   cT x   T  y 

Put c 1 , T x  y 1.T x  T  y  T x  T  y

T cx 0  cT xT 0T cx  cT x  Put y  0 ,

T is linear.

13
Examples:

1. Let T : R 2  R 2 defined by T a1, a 2   2a1  a2 , a1  Show that T is linear.

Proof:

Let x, y  R and c  F where x  a1, a 2 , y  b1,b 

2

x  y  a 1 b1 , a2  b2 

T x  y  T a 1b1 , a2  b2  2 a 1b1  a2  b2 , a 1b1 

 2a 1 a2 , a 1   2b1  b2 , b1   T a 1 , a2  T b1 , b2 

T x  y   T x  T  y 

T cx  T c a1 , a2  T ca1, ca2 

 2ca1  ca2 ,ca1   c 2a1  a2 , a1   cT a1 , a2 

T cx   cT x 

T is linear.

2. Let T : R 2  R 2 is defined by T a,b  2a  3b, a  4b . Prove that T is linear.

Proof:

Let x, y  R2 and  F where x  a,b, y  c,d 

x  y  a  c, b  d 

T x  y  T a  c,b  d  2 a  c  3 b  d , a  c  4 b  d 

 2a  3b, a  4b  2c  3d ,c  4d   T a, b  T c, d  T

x  y  T x  T  y
T  x  T  a, b  T  a, b 

 2 a  3 b,  a  4 b    2a  3b, a  4b 

 T a, b   T x  T is linear.

14
3.Prove that the set of all Polynomials of degree  n is a linear transformation.
Thetransformation T is defined by T a 0  a 1x  ...  a nx n
 a , a ,..., a 
0 1 n

Proof:

Let f  a 0a x1 ...a xnn, g b b0 x ...

1 b x
n
n

f  g  a 0  b 0 a 1 b 1 x  ...  a n  bn x n

T  f  g  T a 0  b 0   a 1  b 1 x  ...  a n
 bn  x n 
 a0 b0,a1 b1 ,... an bn   a0,a1...,an  b0, b1,..., bn  T  f

 g  T  f T g

T cf   T c a 0  a1 x  ...  a n x n   T  ca0  ca1 x  ...  can n


x
 ca0,ca1 ,...,can   ca0,a1 ,...,an   cT  f 

 T is linear.

4.Find the linear transformation T :V3 V3 ,determined by the Transpose of the
1 2 1

1 1
matrix  0  with respect to the standard basis e ,1e ,2e 3.
 1 3
 4 

Solution:

Let T e1   e1  2e2  e3,T e2   0e1  e2  e3,T e3   e1  3e2  4e3

a,b,c   a1,0,0b 0,1,0c0,0,1

T a, b,c   aT 1,0,0 bT 0,1,0  cT 0,0,1

= aT e1  bT e2  cT e3 

T a, b,c   a1,2,1b 0,1,1 c1, 3,4

= a c,2a b 3c,a b  4c .

This is the required linear transformation.

15
 2 1 1
5. Find the linear transformation T :V 2 V 3 given by   with respect to
1 1 1 
the standard basis.

Solution:

Let the standard basis be   e1 ,e2 where e1  1,0 ,e2  0,1

T e1   2,1, 1,T e2   1,1, 1

a, b   a1,0   b 0,1

T a, b   aT 1,0   bT 0,1  aT e1   bT e2 

T a, b   a2,1, 1  b 1,1, 1 T

a, b   2a  b,a  b,a  b  .

6. Let T : R 3  R 2 defined as T x, y, z  x,0,0,x, y, z  R .Test T is linear.

Solution:

Given T : R 3  R 2 by T x, y, z   x,0,0 , x, y, z  R

Let u  x1 , y1 , z1 ,v  x2 , y2 , z2 ,   R

T u  v   T x 1 x2 , y1  y2 , z1  z2   x 1 x2 ,0,0 

= x 1 ,0,0   x2 ,0,0 

= T u  T v 

T  u  T  x1 , y1 , z1  T  x 1 ,  y1 ,  z1 

  x 1 ,0,0 

  x 1 ,0,0   T x 1 , y 1 , z 1 

 T is linear.

16
7.Let T : R 2  R 2 defined by T x, y  e x , e y .Test T is linear.

Solution:
Given T : R 2  R 2 , T x, y  e x , e y 

u  x1 , y1 ,v  x2 , y2 ,   R


T u  v   T  x1  x2 , y1  y2   e x 1  x 2  , e y 1 y 2 
= e x 1 , e y 1  e x 2 , e y2 

= T u   T v 

T  u  T  x1 , y1  T  x1 ,  y1 

= e x 1 , e y 1  e e x 1 , e y 1  T u .

 T is not linear.

4.2 NULL SPACE:

Let V and W be the Vector Spaces over the field F and T :V W be a linear
transformation in the null spaces or kernel N T  of T is defined by

Ker T  N T  x V : T x  0.

4.3 RANGE:
Let V and W be the vector spaces over the field F and T :V W be a linear

transformation the range or image R T  is defined by, R T  Tx : x V .

THEOREM:1
Let V and W be the vector spaces and T :V W be linear then,

i) N T  is a sub-space of V
ii)RT  is a sub-space of W .

Proof:
i)By the definition of null space,
N T  x V : T x  0

17
Since T 0   0 N T 

Let x, y  N T  ,then T x   0 ,T  y   0

T  x  y   T x   T  y   0  0  0

x  y N T 

Let x  N T ,then T x   0 ,c  F

T cx   cT  x   c 0   0

cx  N T 

 N T  is a sub-space of V .

ii)By the definition of range, R T  Tx : x V 

since T 0   0  R T 

Let x, y  R T  ,then there exists a vectors u, v V such that T u  x and T v   y

T u  v   T u   T v   x  y  R T 

Let x  R T  and cF then there exists a vector uV such that T u  x

T cu   cT u   cx  R T 

 RT  is a sub-space of W.

4.4 Nullity and Rank of T :

Let V and W be the vector spaces and T :V W be a linear transformation.

The dimension of N T  is called Nullity of T .

The dimension of R T  is called Rank of T .

Theorem:2

Let V and W be vector spaces over F and T :V W be a linear transformation. If

S  v1 , v2 ,..., vn  is a basis for V . Then R T  L T v1 ,T v2 ,...,T vn .

18
View the lecture on YouTube
https://www.youtube.com/watch?v=FL9ANdNTQus

Proof:

Given T :V W be a linear transformation and S  v1 , v2 ,..., vn is a basis for V.

Then T v1 ,T v2 ,...,T vn  R T 

We know R T  is a subspace of W

 R T  contains L T v1 ,T v2 ,...,T vn 

 L T v1 ,T v2 ,...,T vn  R T 

Now let w  R T .Then there exists an element v V such that T v  w and since

v1 , v2 ,..., vn is a basis of V , i  F

v  1v1  2 v2  ...  n vn

 w  T 1v1   2 v2  ...   n vn   1T v1    2T v2   ...   nT vn  ( T is linear)

 w  L T v1 ,T v2 ,...,T vn 

 R T  L T v1 ,T v2 ,...,T vn 

Hence R T  L T v1 ,T v2 ,...,T vn .

4.5 Dimension Theorem:

Let V and W be the vector spaces and T :V W be a linear transformation. If D is

finite dimensional and then, dim V  rank T  nullityT .

Proof:

Let dimV  n and dim N T   k and v1 ,v2 ,..., vk  is a basis for N T  ,then v1 ,v2 ,..., vk 

is a linearly independent set in V .

v1 ,v2 ,..., vk  can be expanded to a basis   v1 , v2 ,..., vn  for V .

19
Now we claim s  T vk 1 ,T vk  2 ,...,T vn  is a basis for R T .

Since   v1 ,v2 ,...,vn  is a basis for V .

R T  span T  

= span T v1 ,T v2 ,...,T vn 

=T vk 1 , T vk  2 , ..., T vn 

= span T vk 1 ,T vk  2 ,...,T vn 

R T   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   T bk  2 vk  2   ...  T bn vn   0

T bk 1vk 1  bk  2 vk  2  ...  bn vn   0

 bk 1vk 1  bk  2 vk  2  ...  bn vn  N T 

Since v1 ,v2 ,...,vk is a basis for N T 

 bk1vk1  bk2vk2 ...  bnvn b1v1  b2v2 ...  bkvk

 b1 v1  b2 v2  ...  bk vk  bk 1vk 1  bk  2 vk  2  ...  bn vn  0

 b1  b2  ...  bn  0  v1 , v2 , ..., vn is linearly independent 

s is linearly independent ………………(2)
From (1) and (2)

s is the basis for R T 

Now dim R T  n  k

dim R T  dimV  dim N T 

dim R T  dim N T  dimV

 dim V  rank T  nullityT .

20
Theorem:3

Let T :V W be a linear transformation. Then T is one to one iff N T   0.

Proof:
Suppose T is one-to-one

Let x  N T , then T x   0

We know that T 0  0 ( since T is linear)

 T x   T 0   x  0, sin ce T is 1 1

 N T   0

Conversely , let N T   0

Suppose T u   T v  then T u   T v   0

 T u  v   0  T is linear 
 u  v  N T   0 u  v  0  u  v

Thus T u   T v   u  v

Hence T is one - to – one.

Theorem: 4 Let V and W be finite dimensional over F and T :V W be linear.

Then
the following are equivalent.
(i) T is one – to – one
(ii)T is onto
(iii)rank T   dimV

Proof:
By dimension theorem, we have rank T  nullityT  dimV ……(1)

T is one – to – one  N T   0 nullity T   0

 rank T  dimV (using (1))  dim RT   dimW (T is 1 – 1 )

21
 RT   W ( RT  W with same rank)

 T is onto. Hence all the three statements are equivalent.

Examples:

1. Verify dimension theorem for T : R3  R2 defined by T a1 , a2 , a3   a1  a2 , 2a3 .

Solution:

Given T : R3  R2 is linear and dim R3   3  dimV  3 …….. (1)

Let   1, 0, 0 ,0,1, 0 ,0, 0,1

R T  span T  

= span 
T 1, 0, 0 ,T 0,1, 0 ,T 0, 0,1

= span 1, 0 ,1, 0 ,0, 2 

= span 1, 0 ,0, 2 

dim R T  2  rank T  2

N T  T x  0, x V 

N T  T a1 , a2 , a3  0, a1 , a2 , a3  R3 

N T  a1  a2 , 2a3  0, 0 , a1 , a2 , a3  R3 

= a1  a2  0, 2a3  0  a1  a2 , a3  0 

= a1 , a1 , 0 , a1  R

dim N T  1 nullity T  1

rank T  nullityT  2  1  3 ………… (2)

From (1) & (2)

dim V  rank T  nullityT .

22
2. Suppose T : R 2  R 2 is linear, T 1,0  1,4 ,T 1,1  2,5. Find T 2,3 and T 2,3

Is T one-to-one? Is T onto?

Solution:

Given T : R 2  R 2 is linear, T 1,0   1, 4 ,T 1,1  2, 5 

Let T : R 2  R 2 is linear, S  1, 0 , 1,1

1 0 1 0
Let T : R 2  R 2 is linear, A    ,A 1 0
1 1  1 1

 The Vectors 1,0,1,1 are linearly independent.

 S is linearly independent.

 
Since dim R 2  2 , S generates R2 .

a , b   R 2 , a , b    1, 0   
……………. (1)
1, 1 
    ,  
    a,   b    a  b

(1)  a, b   a  b 1, 0   b 1,1

T a, b   a  b T 1, 0   bT 1,1

= a  b 1, 4   b 2, 5   a  b, 4a  4b   2b, 5b 

T a, b   a  b, 4a  b 
T 2, 3 2  3, 4 2  3 5,11

T 2, 3   2  3, 4 2   3 1 , 5

W.k.t, T is one-to-one iff N T   0 

N T  a, b : T a, b  0, a, b  R 2

T a, b   0  a  b, 4a  b   0,0 
a  b  0, 4a  b  0  a  0, b  0  N T  0, 0  0

Hence T is one- to-one. dim N T   Nullity T   0

23
 By dimension theorem, rank T  nullityT  dim V  rank T  2  
dim V  dim R 2  2
 
dim R 2  2 and rank T  2 . Hence T is onto.

3. Define the linear transformation T : P2R  M 2 x 2 R by

 f 1  f 2 0 
T  f  x   . Find the RT  and dimension of RT  .
 0 f 0

Solution:

Let   1, x, x 2  is a basis for P2 R 

0 ,T x 2   3 0
 0 0
T 1  
0 1
 1
 ,T x    0 0 
   0 
   0


Now , R T   span T   span T 1,T x ,T x 2 
 0 0  ,  1 0  ,  3 0  
= span      
 0 1   0 0   0 0  

 0 0  ,   1 0  
= span    
 0 1   0 0  

 0 0   1 0   0 0
a   b   ⇒ a  0,  b  0  b  0
 0 1  0 0   0 0 

  0 0 ,1 0

0
generate RT  and 
0 , 1 0
   are linearly independent.
0 1  0 0 0 1  0 0

 dim R T   2 .

4. Let T : R  R defined by T a 1, a 2   a1  a2 , 0, 2a1  a 2 .Find the basis for R T  and

2 3

find its dimension.

Solution:

Given T : R  R , T a 1, a 2   a1  a2 , 0, 2a1  a 2 

2 3

24
 The Standard Basis is   1, 0 , 0,1of R2

R T  span T   span T 1, 0 ,T 0,1

= span 1,0, 2 ,1,0, 1

Here 1, 0, 2  & 1, 0, 1

Basis of R T  is 1,0, 2 ,1,0, 1 dim R T   Rank T   2

T a11 a12 a13   2a11  a12 a13  2a12 

5. Let T : M 23 F   M 22 F  
 a21 a 22 a23   0 0 


Find the basis of R T  and Rank T 

Solution:

Standard basis of M 23 F  is

  1 0 0 ,  0 1 0  ,  0 0 1  ,  0 0 0  ,  0 0 0  ,  0 0 0  
 0 0 0   0 0 0   0 0 0   1 0 0   0 1 0   0 0 1  

R T  span T  

 1 0 0   0 1 0   0 0 1   0 0 0   0 0 0   0 0 0 
= span T  ,T ,T ,T ,T ,T
0 0  0 0  0 0  1 0  0 0  0 
  0   0   0   0   1   0 1 

 2 0  ,  0 1 
= span    
 0 0   0 0  

Since these two matrices are independent, it will be the basis of R T 

 2 0  ,  0 1 
Basis of R T  is   dim R T   Rank T   2 .
0 0   0 0 
  

25
6. Let T : P2R  P3R defined by T f x  xf x f 'x .Find the basis for R T 

and compute Rank T  . Also verify Rank Nullity theorem.

Solution:

Given T : P2R  P3R , T f x  xf x f 'x

Standard basis of P2  R  is   1, x, x 2 


Range space R T   span T   span T 1,T x ,T x 2  
= span x, x 2 1, x 3  2x

To check independency,
1 x   2 x 2 1  x 3 2x  0
3

 2  1  23  x   2 x 2  3 x 3  0

Equating the coefficients, 2  0,1  23  0,3  0  1  0

Here all i  0 ,the vectors are linearly independent

 R T  spanx, x2 1, x3  2x and x,x 2

1, x3  2x form a basis of R T .

 dim R T   Rank T   3 .

7. Find a linear transformation R 3  R 3 whose range space RT is generated by 1, 2,3 

and 4, 5, 6  .

Solution:

Consider the standard basis of R 3,namely e 1  1, 0, 0 , e 2  0,1, 0 , e 3  0, 0,1 

26
The images of e1, e2 , e3 which are the elements of the basis of RTare given by ,
T 1,0,0   1, 2, 3,T 0,1,0   4, 5,6 ,T 0,0,1  0,0,0 

xe1  ye2  ze3  x 1,0,0   y 0,1,0   z 0,0,1  x, y, z  T

x, y, z   T xe1  ye2  ze3 

= xT e1   yT e2   zT e3 

= x1, 2, 3  y 4, 5,6   z 0,0,0 

= x  4 y, 2x  5 y, 3x  6 y .

8. T : R 2
 R 3 is a linear transformation such that T 1,1  1,0,2,T 2,3  1,1,4

(i) Determine T

(ii) T 2, 5,T 8,11

(iii)Rank T 
(iv)Is T one-one ?

(v)Is T onto ?

Solution:

Given T : R 2  R 3 is linear, T 1,1  1,0,2,T 2,3  1,1,4

Let S  1,1,2,3 . Than A   

1 1
, A 1 0
2  3 

∴ 1,1 &2,3 are linearly independent.

 
Since dim R 2  2 , S spans R 2 .

Any element of R2 can be written as a linear combination of elements of S.

Let a, b  R 2 , a, b   x 1,1  y 2, 3 ………. (1)

27
 = x  2 y, x  3y 

a  x  2 y, b  x  3y  x  a  2 y, b  a  2 y  3y  b  a

x  a  2 b  a   3a  2b

(1)  a,b  3a  2b1,1   b  a2,3

T a, b   3a  2b T 1,1 b  a T 2, 3

= 3a  2b 1,0, 2   b  a 1, 1, 4 

T a, b   2a  b, a  b, 2a 

T 2, 5   1, 3, 4 ,T 8,11  5, 3,16 

We know that , T is one-one iff N T   0

N T  a, b ,T a, b  0, a, b  R 2

T a, b   0  2a  b, a  b, 2a   0,0,0 

 2a  b  0, a  b  0, 2a  0  a  0

a b  0  b  0
N T  0, 0  0

 T is one - to – one and Nullity T  dimN T  0

By dimension theorem,
Rank T Nullity T  dim V  Rank T  0  dim R 2  Rank T  2

dim R T  2 & dim R 3  3. Hence T is not onto.

28
4.6. THE MATRIX REPRESENTATION OF A LINEAR TRANSFORMATION

In this section, we embark on one of the most useful

approaches to the analysis of a linear transformation on a finite-
dimensional vector space: the representation of a linear
transformation by a matrix. In fact, we develop a one-to-one
correspondence between matrices and linear transformations that
allows us to utilize properties of one to study properties of the other.
We first need the concept of an ordered basis for a vector space.

Definition:
Let V be a finite-dimensional vector space. An ordered basis for V
is a basis for V endowed with a specific order; that is, an ordered
basis for V is a finite sequence of linearly independent vectors in V
that generates V.

In F ,   e1,e 2,e 3 can be considered an ordered basis.

3

Note:
Also
 e2,e1,e3  is an ordered basis, but    as ordered bases.For

the vector space Fn, we call   e1 , e2, e3, e4,....en  the standard

ordered basis for Fn. Similarly, for the vector space PnF  , we call
1,x, 
x 2 ,., x n the standard ordered basis for Pn  F .
Now that we have the concept of ordered basis, we can identify
abstract vectors in an n-dimensional vector space with n-tuples.
This identification is provided through the use of coordinate
vectors, as introduced next.

Definition:
Let   v1,v2,v3,....vn  be an order basis for a finite dimensional
vector space V. For x V , let a1, a2, a3, ., an be the unique scalar
n
such that x   aivi .We define the coordinate vector of � relative
i1

 a1 
a 
 2
to �,denote x  , by x    
 
 
a 
 n 29
View the lecture on YouTube
https://www.youtube.com/watch?v=lm-9hPRXhbE

Example : 1

Let V  P2 R, and let   1, x, x be the standard ordered basis for V.
2

4
 
If f x   4  6x  7x , then  f 
2
 6  .
 7 
 

Definition: Matrix of a Linear Transformation T

Suppose that V and W are finite dimensional vector spaces with ordered

bases    v1, v2 , v3 ,....vn  a n d   w1, w2 , w3 ,....wm respectively. Le t T :V  W

be a linear transformation then  a u n i q u e s c a l a r a i j  F s u c h t h a t

T v1   a11w1  a12w2  ...  a1m wm T

v2   a21w1  a22w2  ... a2 m wm

T vn   an1w1  an2w2  ...  anm wm

The matrix of T with respect to  and  is

t
 a11 a12 a1m   a11 a21 an1 
   
a21 a22 a2n   a12 a22 an2 
A  T    


   
   
 an1 an2 anm   a1m a2m anm mxn

Note: If V = W and    , then we w rite A = [T] β.

Example 2

Let T : R 2  R 3 be the linear transformation define by

T (a1 , a2 )  a1  3a2 , 0, 2a1  4a2  . Find T , with respect to the standard basis.

30
Solution:

Let β and γ be the standard ordered basis for R2 and R3respectively.

Now T (1, 0) (1, 0, 2 ) 1e1  0 e2  2 e3

1 3

Hence T    0 0  .

And T (0,1) (3, 0,  4) 3e1  0e2  4e3
 2 4 
 

2 3 
1 
Note: if we let � = (�3 , �2 , �1 ), then T 
1
  0 0  .
 1 4 
 

Example 3

Find the T , with respect to the standard basis, for the linear transformation T:


P3(R) →P2(R) defined

by T (f(x)) = f’ (x).

Solution:

let � and � be the standard ordered bases for P3(R) and P2(R)respectively.

T 1  0.1  0.x  0.x2

T  x   1.1  0. x  0.x2

T x 2   0.1  2.x  0.x 2

T x 3   0.1  0.x  3.x 2

31
  0 1 0 0
 0 2 0 .
So T    0


0 0 0 3 
 

Example 4

LetT : R2  R 3 be the linear transformation define byT x, y  x  y, x, 2x  y.

Find the matrix with respect to the standard basis � of R2 and

  (1,1,0), (0,1,1), (2, 2, 3)

Solution :

GivenT : R 2  R3 is defineasT (x, y)  (x  y, x, 2x  y).

Also given   (1, 0), (0,1)

NowT (e1)  T (1, 0)  (1 0,1, 2(1)  0)  (1,1, 0)

T (e2 )  T (0,1)  (0 1, 0, 2.11)  (1, 0,1)

Given   (1,1,0),(0,1,1),(2, 2,3)is a basis

Let v1  (1,1, 0), v2  (0,1,1), v3  (2, 2, 3)

We want to express T(e1), T (e2) as a linear combination of v1, v2, v3

Let (1,1, 0)  .v1   .v2   .v3

 .(1,1, 0)   .(0,1,1)   .(2, 2, 3)

 ( ,  , 0)  (0,  ,  )  (2 , 2 , 3 )
 (  2 ,     2 ,   3 )

32
   2  1 .....(1)

    2  1 .....(2)
  3  2 .....(3)
Substituting (1) in (2) we get,
 1  1    0

(3)  3  2    2 &
3

(1)    2. 2  1    1 4  1
3 3 3

Therefore,T (e1)  (1,1, 0)  1v 1 0.v 2 2 v 3

3 3
(1,0,1)  v1  v2   v3    2,     2,   3 
  2  1     (4)
    2  0      (5)
  3  1       (6)
Substituting (4) in (5) we get � + (−1) = 0 ⇒ � = 1
(6)  1 3  1    0
(4)    1
T (e2 )  (1, 0,1)  v1 1.v2  0.v3
1 
 1 0 2
t  3 1
  
Matrix of T 3 3   0 1 .
  2 
 1 1 0 
 0
3 
Example 5
1 3
Find the linear transformation T : R  R determined by the matrix ( 0
2 3
0)
2 −4
with respect to the standard bases. Also find the value of T(1, 2)?
Solution:
1 3 
We have to find the linear transformation T : R 2  R3 whose the matrix 0 0

 2 4 
 
1 0 2
in the standard bases. The coefficient matrix is  
 3 0 4 

33
 T e1   T 1, 0  1, 0, 2
T e2   T 0, 1  3, 0, 4
Then a, b  a, 0  0, b
 a1, 0  b 0, 1
Now, T a, b   a T 1, 0  b T 0, 1
 a 1, 0, 2 b 3, 0, 4 
 a 3b, 0, 2a 4b Therefore
the LT,T a, b   a 3b, 0, 2a 4b
Hence, T 1, 2  13.2, 0, 2.1 4.2   7, 0, 6.

a b
Example: 6 DefineT : M 2 X 2 R  P2(R)byT    a b(2d) x bx
2

 c d 
Compute T   and  arestandard basesof M 2 X 2 R & P2(R) respectively.


Solution
a b
Given : T    a b(2d) x bx
2

 c d 

  1 0  ,  0 1  , 0 0  , 0 0 and   

1, x, x2 
 0 0  0 0   1 0   0 1 

T 1 0  1 0.x  0.x2.

 0 0
T 0 1  1 0.x 1.x2
 0 0
T 0 0  0  0.x  0.x2
1 0
T 0 0  0  2.x  0.x2
0 1
1 1 0 0 

Hence T  0 0 0 2.


0 1 0 0
 

34
 DIAGONALIZATION

This chapter is concerned with the so-called diagonalization problem. For a given linear
operator T on a finite-dimensional vector space V, we seek answers to the following
questions.

Does there exist an ordered basis β for V such that [ T  is a diagonal matrix?

If such a basis exists, how can it be found?

Since computations involving diagonal matrices are simple, an affirmative answer to
question 1 leads us to a clearer understanding of how the operator T acts on V, and an
answer to question 2 enables us to obtain easy solutions to many practical problems that
can be formulated in a linear algebra context. We consider some of these problems and
their solutions. A solution to the diagonalization problem leads naturally to the concepts of
eigenvalue and eigenvector. A side from the important role that these concepts play in the
diagonalization problem.

4.7 EIGEN VALUES AND EIGEN VECTORS

Definition: A linear operator T on a finite-dimensional vector space V is called Diagonalizable

if there is an ordered basis β for V such that T  is a diagonal matrix.A square matrix A is

called diagonalizableif LA is diagonalizable.

We want to determine when a linear operator T on a finite-dimensional vector space

V is diagonalizable and, if so, how to obtain an ordered basis  {v1, v2 ,..., vn } for V

such that T  is a diagonal matrix. Note that, if D  T  is a diagonal matrix, then

for each vector v j   ,

n
we have T (v j )   Dij vi  D jj v j   j v j where  j  D jj
i1

Conversely, if  {v1, v2 ,..., vn} is an ordered basis for V such that

T v j    j v j for some scalars 1 , 2 ,..., n ,

35
  1 0 . . 0
 0 2 . . . 
 
T   . . . 3 . . 
 
 . . . . . 
 0
 0 . . n 

In the preceding paragraph, each vector v in the basis β satisfies the condition that
�(�) = �� for some scalar λ. Moreover, because v lies in a basis, v is non zero. These
computations motivate the following definitions.

Definition:
Let T be a linear operator on a vector space V. A nonzero vector v. In V is
called an eigenvector of T if there exists a scalar λ such that �(�) = � �. The scalar λ is
called the eigenvalue corresponding to the eigen vector v. Let A be in Mn×n (F).
A non-zero vector v in Fn is called an eigen vector of A if v is an eigenvector
of LA; that is, if Av = λ v for some scalar λ. The scalar λ is called the eigenvalue of A
corresponding to the eigenvector v.
The words characteristic vector and proper vector are also used in place of
eigenvector. The corresponding terms for eigenvalue are characteristic value and proper
value.
Note that a vector is an eigenvector of a matrix A if and only if it is an eigenvector of LA.
Likewise, a scalar λ is an eigenvalue of A if and only if it is an eigenvalue of LA. Using the
terminology of eigenvectors and eigenvalues, we can summarize the preceding discussion
as follows.

Theorem (only statement)

A linear operator T on a finite- dimensional vector space V is diagonalizable
if and only if there exists an ordered basis β for V consisting of eigenvectors of T.
Furthermore, if T is diagonalizable,   {v1 , v2 , ..., vn } is an ordered basis of eigenvectors of

T, and D  T  then D is a diagonal matrix and Djj is the eigenvalue corresponding to vj

for 1 ≤ j ≤n.
To diagonalize a matrix or a linear operator T is to find a basis of
eigenvector- and the corresponding eigenvalues.

36
 In order to obtain a basis of eigenvectors for a matrix (or a linear operator), we
need to be able to determine its eigenvalues and eigenvectors. The following theorem gives us
a method for computing eigenvalues

Theorem 2.9.2. Let A M nn F . Then a scalar λ is an eigenvalue of A if

and only if det( A   I n )  0

Proof.
n
A scalar λ is an eigen value of A if and only if there exists a non zero vector v  F such that
Av  v,

that is,
( A   I n )(v)  0.      (1)
 x1 
x 
 2
IfA  aij , X   .  ,then the equation (1) is equivalent to a system of linear
.
 
x n 

homogeneous equation in x1 , x2 ,  , xn.

Since X ≠0, at least one xi  0

So, the system of equation has non trivial solution.

∴ the equation (1)is equivalent to the statement that det( A   I n )  0 .

Hence the theorem is proved.

Definition. Let A∈ Mn×n (F). The polynomial f t  det( A   I n ) is called the characteristic

polynomial of A.

1 1
Example: find the Eigen value of the matrix A   
1  4 1
Solution:
The characteristic equation of A is

37
 1 t 1 
det( A  tI )  det  
 4 1 t 
 t 2  2t  3
 (t  3)(t 1).

Definition.
Let T be a linear operator on an n-dimensional vector space V with ordered basis β. We
define the characteristic polynomial f(t) of T to be the characteristic polynomial of

A  T  That is, f t   det  A  tI n .

There mark preceding this definition shows that the definition is independent
of the choice of ordered basis β. Thus if T is a linear operator on a finite-dimensional vector
space V and β is an ordered basis for V, then λ is an eigenvalue of T if and only if λ is an

eigenvalue of T  . We often denote the characteristic polynomial of an operator T by det (T 

tI ) .

4.8 Properties of Eigen Values and Eigen Vectors

1. A square matrix A and its transpose At have the same eigen values.

Proof:
The eigen values of A are the roots of the characteristic equation |� − ��| = 0

 A   I T  AT  ( I )T
 AT   I  A   I 
T

 AT   I A   I
 AT   I (since BT  B )

This shows that the characteristic equation of A and AT is the same.

Hence the characteristic equation of A and AT is |� − ��| = 0

Therefore, A and AT have the same Eigen values.

38
2. If 1, 2 , 3 ,...n are the eigen values of a square matrix of order n, then show that

13 , 2 3 , 3 3 , , n 3 are the eigen values of A3

Solution:

Let X r be the eigen vector corresponding to the eigen value r

Then AX r  r X r      (1)

Pre multiplying (1) by A and using (1),

A2 X r  A  r X r    r AX    r Xr 2
r   rX
r r

Similarly A3 X r  r 3 X r ---------(2).

From (2)  is the eigen value of A .

3 3

1
3. If  are the eigen values of the matrix A then show that A-1 has eigen value 

Solution:

Let  be the eigen value of A. Then AX   X           1

Pre multiplying both sides of (1) by A-1, we get

A1 ( AX )  A1 ( X )  A1 A X  A 1 X

IX   A 1X   X   A 1X 

 A1 X  1 X  1 X  A1 X
  -------------(2)

Comparing (1) and (2), we have 1 is an eigen value of A .

1

39
4. (i) Sum of the eigen values of a square matrix A is equal to the sum of the diagonal
elements of A.

(ii) Product of the eigen values of the matrix A is |�| .

Proof:

Let A be a square matrix of order n.

The characteristic equation of A is A  I  0

  n  S1  n1  S 2  n2  ......  1 S n  0 ......(1)

n

If 1, 2 , 3 ,...n are the roots of (1) , then 1, 2 , 3 ,...n are the eigen values of A.

w.k.t the sum of the roots of (1) is   coefficient of  n

n1

coefficient of 

1  2  3  ....  n   (S1)  S1

Sum of eigen values of a square matrix A = Sum of the diagonal elements of A.

constant term
W.k.t the product of the roots of (1) is  1
n

coefficient of  n

1. 2 .3.....n  1  1 S n  Sn

n n

Product of the eigen values of the matrix A is |�| .

Example:
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) ,then find eigen values of A  T 

Solution:
Given T : P2(R)  P2(R) define by T ( f (x))  f (x)  (x 1) f ’(x),

An ordered basis for P2(R) is   

1, x, x 2

To find A  T 

40
T 1  1   x  1. 0  1  1.1  0.x  0.x 2
T x   x   x  1. 1  1  2x  1.1  2.x  0.x 2
T x  
2
x 2  x  1. 2x  2x  3x 2  1.1  0.x  0.x 2

Then

 1 1 0

A   0 2 2 
 0 0 3
 
The characteristic polynomial of T is

1  t 1 0 

det( A  tI )  det  0 2t 2 
 0 0 3  t 


 1 t 2  t 3 – t

Hence � is the Eigen value of T (or A) if and only if   1, 2, 3.

Example:
4 1)
Find the Eigen values and Eigen vectors of the matrix (
3 2

Solution:
The characteristics equation of A is
4 1
| A   I | 0  0
3 2

(Or )
 2  S 1  S 2  0

Where S1 = the sum of the main diagonal elements of A

=4+2=6
S2 = the determent of A
=8–3=5

The characteristics equation of A is   6   5  0

2

41
    1  – 5   0
   1, 5
which is the Eigen values of A.
To find Eigen vectors:
Let

x 
X 1
x  2
be an Eigen vector of A corresponding to λ. Then

4 1  x1    0 
A  I   0   
3 2    x 2   0 

Case (i) if � = 1, then

3 1  x1   0 

3 1  x 2   0 

3x1 + x2 = 0 ⇒x2 = −3x1

Choosing x1 = 1, we get x2 = −3
∴ The eigen vector is
1 
X1   
 3  .

Case (ii) if λ = 5, then

1 1  x1    0 
 
3 3  x 2   0 

−x1 + x2 = 0 ⇒x2 = x1
Choosing x1 = 1, we get x2 = 1
∴ the eigen vector is
1 
X2   
1
The Eigen values of A are 1, 5 and the corresponding eigenvectors are

1 1
X 1    , X 2   
 3  1  .

42
Example:
Find the Eigen values and Eigen vectors of the matrix
 2 2 1
 1 3 1
 
 1 2 2
 

Solution:
The characteristics equation of A is A –  I  0

  3  S1 2  S 2 – S 3  0

where S1 = the sum of the main diagonal elements of A

= 2 +3 + 2 = 7
S2 = sum of the minors of the main diagonal elements of A

= │3 1│+ │2 1│+ │2 2│
2 2 1 2 1 3
= (6 – 2) +(4 - 1) + (6 - 2)
= 4 + 3 + 4 = 11
S3 = |A| = 2 (6-2) – 2 (2-1) + 1 (2-3) = 5
The characteristics equation of A is  3  7 2  11 – 5  0
∴ the eigen values are  = 1, 1, 5.
To find Eigen vectors:
Let
 x1 
X   x 2 

x 
 3
be an Eigen vector of A corresponding to λ. Then
 2 2 1  x1   0 

A   I   0   1 3 1  x2   0        (1)
 1 2 2    x3   0 


Case (i) if  = 5, then the equation (1) become

43
 3 2 1   x1   0
 1 2 1   x    0
  2   
1   x   0
2 3 
 3  
−3x1 + 2x2 + x3 = 0
x1 − 2x2 + x3 = 0
x1 + 2x2 − 3x3 = 0

These 3 equations are different, so we can choose any two of them

to solve for x1, x2 , x3 From (2) & (3), By rule of cross multiplication we get
x1 x2 x3
 
6  2 1 3 2  2

 x1  x2  x3  x1  x2  x3
4 4 2 1 1 1
∴ the eigen vector is

 x1  1
X 1   x 2   1
 x  1 
 3  

Case (ii) if  = 1, then the equation (1) become

1 2 1  x1   0 
1 2 1  x    0 
  2   
1 2 1  x   0 
  3    .

We have only one equation x1 + 2x2 + x3 = 0 to solve for x1 , x 2 , x 3 .

Choose x3 = 0, then x1 + 2x2 = 0 ⇒ x1 = −2x2
Choose x2 = 1, then x1 = −2
∴ the eigen vector is

 x1   2 
X2   x    1
 2  
   
 x3   0
We shall find the one more solution from x1 + 2x2 + x3 = 0

44
Choose x2 = 0, then x1 + x3 = 0 ⇒ x1 = −x3
Choose x1 = 1, then x3 = −1
∴ the eigen vector is

 x1   1 
X 3  x 2    0 

  
 x   1 
 3  
The Eigen values of A are 1, 1, 5 and the corresponding eigenvectors are

1   2 1
X 1   1 , X 2  1  , X 3   0 .
    
1  0  1 
     

Note: If the Eigen values are not different, then the corresponding eigenvectors are
linearly independent.

Example:

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 vectors of T

Solution:

Given T: P2 (R) → P2 (R) define by T ( f (x))  f (x)  (x 1) f ’(x),

An ordered basis for P2 (R) is � = {1, x, x2}

To find A  T 
T 1  1  x  1. 0  1.1  0.x  0.x 2
1
T x   x  x  1. 1  1  2x 1.1  2.x  0.x 2

T x 2   x 2  x  1. 2 x  2 x  3x 2  1.1  0.x  0.x 2

45
 1 1 0
 2 2
A  [T ]    0 
0 0 3 

1  t 1 0 
The characteristic polynom ial of T is 
det( A  tI )  det  0 2t 2 

 0 0 3  t 

 1  t  2  t  3 – t

Hence � is the Eigen value of T (or A) if and only if � = 1, 2, 3.

To find Eigen vectors:

x1
Let X = ( x 2 ) be an Eigen vector of A corresponding to λ.
x3

1   1 0   x1   0 
Then  A   I   0   0 2 2  x2    0         (1)
 0 0 3    x3   0 


Case (i) if λ = 1, then the equation (1) become

0 1 0   x1   0 
0 1 2   x2    0 
    
0 0  x  0 
2 
 3   

2x 2 = 0 ⇒ x 2 = 0

x 2 + 2x 3 = 0 ⇒ x 2 = −2x 3

2x 3 = 0 ⇒ x 3 = 0
Since x 1 is not involved in these equations, any arbitrary value to assigned to x 1 .

Take x 1 = 1.

 x1   1 
∴ the eigen vector is X 1   x 2    0  .
 
 x   0
 3  

46
  1 1 0  x1   0 
 0 0 2  x    0 
Case (ii) if � = 2, then the equation (1) become   2   
 0 0 1  x   0 
  3   

− x1 + x2 = 0 ⇒ x2 = x1

2x3 = 0 ⇒ x3 = 0

Take x1 = 1

 x1   1 
   
∴ the eigen vector is X 2   x 2   1 
 x  0
 3  

Case (iii) if � = 3, then the equation (1) become

 2 1 0   x1   0 
0 1 2   x 2    0 
    
0 0 0  x 3   0 


− 2x1 + x2 = 0 ⇒ x2 = 2x1

− x2 + 2x3 = 0 ⇒ x2 = 2x3

Take x1 = 1

 x1   1 
   
∴ the eigen vector is X 3   x 2   2 
 x   1
 3  

The Eigen values of A are 1, 2, 3 and the corresponding eigenvectors are

 1  1  1
X 1   0  , X 2  1 , X 3  2 .
    
0 0  1
     

Since the eigen vectors re elements of P2(R), they are polynomial, treating this
vectors as coordinate vectors with respect to �, we get the eigen vectors
are 1, 1  x , 1 2x  x 2 .

47
Definition:
A linear operator T on a finite dimensional vector space V is called
diagonalizable
if there exists an ordered basis � for V such that the matrix [T]β is a diagonal matrix.

Definition:
Let A and B be square matrices of order n. A is said to be Similar to
B if there exists a non - singular matrix P of order n such that A  P1 BP -- (1)
The transformation (1) which transforms B in to A is called a similarity
transformation. The matrix P is called a similarity matrix.

Definition:
A square matrix A is said to be diagonalizable if there exists a non –
singular matrix P of order n such that D = P -1 AP, where D is a diagonal matrix.
The matrix P is called a Model matrix of A.

Theorem: If A is a square matrix of order n, having n linearly independent eigen

values and M is the matrix whose columns are the eigen vectors of A , then
D = M-1AM, where D is a diagonal matrix whose diagonal elements are the eigen
values of A.
Proof: let X 1 , X 2 , X 3 , ., X n are the linearly independent eigen vector of A
corresponding to the eigen values 1, 2 , 3, ..n of A.
Then AX i  i X i , where i  1, 2, 3,., n ------ (1)
Let M  X X X  X be the matrix formed with eigen vectors as columns.
1 2 3 n

Then AM  AX AX AX  AX 
1 2 3 n

  X  X  X   X by 1
1 1 2 2 3 3 n n

 1 0 00  .
0
 2  00 .
 [ X 1 X 2 X 3 ...X n ]  . . 3 . 0
. 
 . . .. . 
 0 0 0 ..  
 n

�1 0 0 0
l 0 �2 0 …
AM = MD where D = I . 0 �3 … I
. . . …
� 0 0 �� l
0
D = M-1AM. Hence proved the theorem.

48
 Note:

1. If the eigen values 1, 2 , 3 , ..n of A are different then the corresponding

eigen vectors X 1 , X 2 , X 3 , ., X n are the linearly independent. So, A can be

diagonalized.
2. Even if 2 or more eigen vectors are equal, if we can find independent eigen
vectors corresponding to them, then A can be diagonalized.
Thus, independence of eigen vectors is the condition for diagonalization.

Example: Let T be the linear operator on P2 (R) defined by

T ( f (x))  f (x)  xf ’(x)  f ’’x.Find the eigen values and eigen vectors of T
in an ordered basis β for P2(R) such that the matrix of the given
transformation with respect to the new resultant basis β is a diagonal
matrix.

Solution:

Given T: P2(R) → P2(R) define by T ( f (x))  f (x)  xf ’(x)  f ’’ x .

An ordered basis for P2(R) is   1, x, x 2 

To find A=[T] β

T (1)  1 x.0  0  1  1.1 0.x  0.x 2

T (x)  x  x.1 0  2.x  0.1 2.x  0.x2
T (x2)  x 2  x.2x  2x  2  3x2  2.1 0.x  3.x2
 1 0 2
 A  [T ]  0 2 0 

 0 0 3
 

Since it is triangular matrix, the eigen values are the diagonal elements

∴ � = 1, 2, 3
To find Eigen vectors:
x1
x
Let X = ( 2 ) be an Eigen vector of A corresponding to λ.
x3

49
 1   0 2  x1   0

Then  A   I   0   0 2 0  x2   0 ------- (1)
 0 0 3    x3   0


 0 0 2   x1   0 
 0 1 0  x    0 
Case (i) if � = 1, then the equation (1) become   2   
0 0 2  x  0 
  3   

2x3 = 0 ⇒ x3  0

x2 = 0

2x3 = 0 ⇒ x3 = 0

Since x1 is not involved in these equations, any arbitrary value to assigned to x1 .

Take x1 = 1

 x1   1
∴ the eigen vector is X 1   x 2  0 .
  
 x  0
 3  

 1 0 2 x1   0 
    
Case (ii) if � = 2, then the equation (1) become  0 0 0  x 2   0 
 0 0 1 x   0 
  3   

− x1 + x 3 = 0 ⇒ x 3 = x1

x 3 = 0 ⇒ x1 = 0

Take x2 = 1
 x1   0 
   
∴ the eigen vector is X 2   x 2   1 
 x  0
 3  
 2 0 2 x1   0
Case (iii) if � = 3, then the equation (1) become  0 1 0 x 2    0
    
 0 0 0 x   0
  3   

− 2x1 + 2x3 = 0 ⇒ x3 = x1

− x2 = 0 ⇒ x2 = 0

Take x1 = 1.

50
  x1   1
∴ The eigen vector is   x   0
3  2  
X  x   1
 3  
The Eigen values of A are 1, 2, 3 and the corresponding eigenvectors are
 1  0  1
X 1  0  , X 2  1 , X 3  0 .
    
 0 0  1
     
Since the Eigen values are different, the eigenvector are linearly independents.
Since the dim P2(R) =3,these 3 linearly independent vectors form a basis of

P2(R) Since the eigen vectors are elements of P2(R) , they are polynomial,

treating this vectors as coordinate vectors with respect to �,

we get the basis    

1, x, 1 x 2.

Hence T is diagonalizable.

 1 0 1  1 0 0

Let M  0 1 0  M
 -1 exists so that D = M A M , where D   0 2 0 
-1

 0 0 1  0 0 3
   

 1 0 1  1 0 2  1 0 1
1

  2 0  0 1 0
D  M 1 AM   0 1 0   0  
 0 0 1  0 0 3  0 0 1 
  

 1 0 0
 
 0 2 0 
 0 0 3
 
Example:
Let T be the linear operator on P2(R) defined by

T ( f (x))  xf ’(x)  f 2.x  f 3.

Find the eigen values and eigen vectors of T in an standard ordered basis β for
P2(R) s u c h t ha t t h e m a t r i x of [T]β is diagonal matrix.

Solution: Given T: P2(R) → P2(R) define by T ( f (x))  xf ’(x)  f 2.x  f 3.

An ordered basis for P2 (R) is   1, x, x 2 

51
To find A  [T ]

T (1)  0 1.x 1  1 x  1.11.x  0.x 2

T (x)  x.1 2.x  3  3  3.x  3.1 3.x  0.x 2
T (x 2 )  x.2x  4x  9  9  4x  2x2  9.1 4.x  2.x2
 1 3 9
 
 A  [T ]  1 3 4 
 0 0 2
 

The characteristics equation of A is

A – I  0

  3  S1 2  S 2 – S 3  0

Where S1 = the sum of the main diagonal elements of A

= 1 +3 + 2 = 6

S2 = sum of the minors of the main diagonal elements of A

3 4 1 9 1 3
  
0 2 0 2 1 3

=6+2+0 =8

S3 = |A| = 0

The characteristics equation of A is  3  6 2  8  0

∴ the eigen values are  = 0, 2, 4

To find Eigen vectors:

 x1 
Let X   x 2  be an Eigen vector of A corresponding to  .
x 
 3
1   3 9  x1   0
Then  A   I   0   1 3 4   x    0  ------(1)
2  
 0 0 2    x3   0
 


52
  1 3 9 x1   0 
   
Case (i) if λ = 0, then the equation (1) become 1 3 4  x2   0 
 0 0 2  x   0 
  3   
�1 + 3x2 + 9x3 = 0
x1 + 3x2 + 4x3 = 0
x3 = 0
⇒�1 = −3�2
Take x2 = 1

 x1   3 
∴ the eigen vector is X 1   x 2    1 .

x   0 
 3  

 1 3 9   x1   0 
    
Case (ii) if λ = 2, then the equation (1) become  1 1 4  x 2   0 
 0 0 0  x   0 
  3   

− x1 + 3x2 + 9x3 = 0 ---- (1)

x1 + x2 + 4x3 = 0 -----(2)

From (2) & (1), By rule of cross multiplication we get

x1 x2 x3
 
12  9 9  4 1 3

�2 �3
⇒ �1 = =
3 13 −4

 x1   3 
∴ the eigen vector is X 2   x2    13 
 x   4 
 3  

53
  3 3 9   x1   0 
    
Case (iii) if λ = 4, then the equation (1) become  1 1 4  x2    0 
0 0 2 x 3   0

− 3x1 + 3x2 + 9x3 = 0 --- (1)
x1 − x2 + 4x3 = 0 --- (2)
−2 x3 = 0 ⇒ x3 = 0 ---- (3)
x3 = 0 Substitute in (3) we get x1 = x2

 x1   1
   
∴ the eigen vector is X 3   x 2   1 
 x  0
 3  
The Eigen values of A are 1, 2, 3 and the corresponding eigenvectors are

 3   3   1
X 1   1  , X 2  13 , X 3  1 .
    
 0   4  0
     
Since the Eigen values are different, the eigenvector are linearly independents.
Since the dimP2 (R)  3 ,these 3 linearly independent vectors form a basis of

P2 (R) Since the Eigen vectors re elements of P2 (R) , they are polynomial,

treating this vectors as coordinate vectors with respect to �, we get

the basis    3 x, 313x  4x2,1 x.

Hence T is diagonalizable.
 3 3 1 
 
Let M   1 13 1  ∴M -1
exists so that D = M -1A M , where
 0 4 0
 

 0 0 0
 
D  0 2 0 
 0 0 4
 
1
 3 3 1   1 3 9    3 3 1 
    1   (by above theorem)
D  M 1AM   1 13 1   1 3 4    1 13

 0 4 0   0 0 2    0 4 0  
   

 0 0 0
  0 2 0  .

 0 0 4
 

54
Definition: A real n x n matrix A is said to be orthogonal if A At  At A  I ,
where I is identity matrix.

Definition: A real n x n matrix A is said to be orthogonally diagonalizable

if there exists an orthogonal matrix N such that D  N 1 A N  N t A N .

The transformation which transforms A in to D called a orthogonal

transformation. The matrix N is called a orthogonal matrix.

 2 0 1
Example: for the following matrix A  0 3 0 , test for diagonalizability, and

 1 0 2
 

if A is diagonalizable, Find an invertible matrix Q and a diagonal matrix D such

that Q 1 AQ  D . Hence find A 3

 2 0 1
Solution: Given matrix A  0 3 0  which is a symmetric matrix.

 1 0 2
 

So, we shall diagonalize by orthogonal transformation

The characteristics equation of A is

A – I  0   3  S1 2  S 2 – S3  0

Where S1 = the sum of the main diagonal elements of A

=2+3+2=7

S2 = sum of the minors of the main diagonal elements of A

3 0 2 1 2 0
  
0 2 1 2 0 3

=6+3+6

= 15

S 3 = | A | =2(6) - 0 + 1(-3) = 9

The characteristics equation of A is  3  7 2  15  9  0

∴ the eigen values are  = 1, 3, 3.

55
To find Eigen vectors:
 x1 
Let X   x 2  be an Eigen vector of A corresponding to  .
x 
 3

 2 0 1  x1   0 

Then  A   I   0   0 3  0  x2    0  ------- (*)
  
 1 0 2    x3   0 


 1 0 1  x1   0 
    
Case (i) if  = 1, then the equation (*) become 0 2 0  x2    0 
 1 0 1  x   0 
  3   
�1 + x3 = 0 ⇒�1 = −x3
2x2 = 0 ⇒ x2 = 0
Take x1 = 1

 x1   1 
∴ the eigen vector is X 1  x 2    0 .

   
 x3   1 
Case (ii) if  = 3, then the equation (*) become
0
 11  x1   0 
0 00  x2    0 
    
1 0 1    
  x3   0 
− x1 + x3 = 0 ⇒ �1 = x3 -----(1)
and x2 take any values
Choose x1 = 1, then x3 = 1 by the equation (1) and choose x2 = 0
x1 1
∴ the eigen vector is X 2 = ( x2 ) = ( 0) .
x3 1
Case (iii) if  = 3, then the equation (*) become

 1 0 1  x1   0 
 0 0 0  x    0 
  2   
 1 0 1  x   0 
  3   

56
 − x1 + x3 = 0 ⇒ �1 = x3 -----(1)

and x2 take any values

 a
We shall now choose X 3  b orthogonal to X 2.
 c
 

∴ dot product = 0 ⇒ a + c = 0 and X 3 should satisfy the equation (1)

∴ a – c = 0 and 0.b = 0

 0
 
Solving we get a = c and choose b = 1, X 3   1 
 0
 

The Eigen values of A are 1, 3, 3 and the corresponding eigenvectors are

1  1 0
X 1   0  , X 2  0  , X 3  1 .
    
 1   0
   1  

Clearly they are pair wise orthogonal vectors.

 1   1 
 2  2   0 
    
The normalized eigen vectors are  0  , 0  , 1 
 1   1  0 
   
 2  2

57
∴ The Normalized model matrix
 1 1 
 2 2 0
 
Q  0 0 1
 1 1   1 1 0
0
 2 2  2 2

   
1 1 
Q  
T
0
2 2
 
 0 1 0 
 


 1 1   1 3 
 2 0 1 2 2 0  
 2 2 0
 
AQ   0 3 0   0 0 1   0 0 3
 1 0 2 
  1 1 0  1 3 0
 
 2 2  
 2 2 

 1 1   1
 0 3
2 2 
 2 02  1 0 0
1 1 
QT AQ   0  0 30  0 3 0   D
2 2 
  1 3 0   0 0 3
 0 1 0  
  2 2 
 

To find A3 Qt A Q  D  A  Q D Q t  A3  Q D3Qt .
1 1 
 1 1   2 0 2

 2 2 0  1 0 0  
 1 0 1 
= 0 0 1  0 3 0  
 1  2 2
1 0   0 0 3 
  0 1 0
 2 2   
 
1  1 0 1 
 1   2
 2 2
2 0 1 0 0  
 1 1 
= 0 0 1 0 3 0 0
 1  
 2 2
1 0 0 0 3   
   0 1 0
 2 2  
 

58
  1 1 
 1 1  0
 2 0  2 2
2  14 0 13 
  27 27  
 0 0 1   0  0 27 0 
 2 2   
 1 1 0    13 0 14 
 2  0 27 0 
 2  
 

Test for Diagonalization:

Let T be linear operator on an n- dimensional vector space V. then T is

diagonalizable if and only if both of the following conditions hold.

1. The characteristic polynomial of T splits.

2. The multiplicity of Eigen value i of T (or) A  n – rank of A – iI 
for all i

Example:

 3 1 0
Test the matrix A  0 3 0  is diagonalizability?

 0 0 4
 

The characteristics equation of A is A –  I  0     4   3 

2

Which splits, and so condition 1 of the test for diagonalization is satisfied.

Also, B has eigen values 1 3 and 2  4 with multiplicities 2 and 1, respectively.

Condition 2 satisfied for λ2= 4, because it has multiplicity 1.

So, we need only test condition 2 for 1 3

 0 1 1
For this case A  1I  0 0 0  has rank 1,

 0 1 1
 
we see that 3 – rank A – 2 I   3 – 1  2 , which is the multiplicity of 1 .
Therefore, T is diagonalizable.

59
4.9 PRACTICE QUIZ: UNIT-IV

1. Let T: ℝ 2→ ℝ3be a linear transformation given by �(�, �) = (� + �, � − �, �) Then,

Rank � is (a) 0 (b) 1 (c) 2 (d) 3

2. The linear transformation T: ℝ3→ ℝ4 whose image is generated by

{(1, 2, 0,-4), (2, 0,-1,-3)} is

(a) �(�, �, �) = (� − 2�, �, −�, −4� − 3�)

(b) �(�, �, �) = (� − 2�, −�, �, −4� − 3�)
(c) �(�, �, �) = (� + 2�, −�, �, 4� + 3�)
(d) �(�, �, �) = (� + 2�, 2�, −�, −4� − 3�).

3. Consider, the linear transformation T: ℝ4→ ℝ4 given by

�(�, �, �, �) = (�, �, 0,0), ��� ��� (�, �, �, �) ∈ ℝ4 Then, which one of the following is
correct?
(a) Rank of � > Nullity of �

(b) Rank of � < Nullity of �

(c) Rank of � = Nullity of � = 3

(d) Rank of � => Nullity of � = 2.

4. What is the rank of the linear transformation �: ℝ3 → ℝ3 defined by

�(�, �, �) = (�, 0, �)?
(a) 3 (b) 2 (c) 1 (d) 0

5. Let �: ℝ3 → ℝ3 be a linear transformation given by �(�, �, �) = (�, �, 0),

then the null space is generated by which one of the following?
(a) (0,0,1) (b) (0,1,0) (c) (1,0,0) (d) None of these

60
6. Consider the mapping
(i) T: R3→R2, T(x, y, z) = (x + 1, y + z) (ii) T: R3→R, T(x, y, z) = xyz
(iii) T: R3→R2, T(x, y, z) = (|�| , 0), which of the above are linear transformation?
(a) (I), (ii) and (iii)
(b) (i) and (ii) only
(c) (ii) and (iii) only
(d) None of these

7. For a linear transformation T: R10 → R6, The kernel is having dimension 5. Then
the dimension of the range of T is
(a) 5 (b) 6 (c) 4 (d) 2

8. The unique linear transformation T: R2→ R2 such that T (1,2) =(2,3)

and T(0,1) = (1,4). Then, the rule for T is
(a) T(a ,b)=(b,-5a+4b)
(b) T(a, b) = (-5a+4b, b)
(c) T(a, b) = (a,-5a+4b)
(d) T(a, b) = (-4a+5b,b).

9. For a linear transformation T: R12 → R6, The kernel is having dimension 7.

Then the dimension of the range of T is
(a) 6 (b) 5 (c) 4 (d) 2

10. Let U and V be vector space over the field F and let T be a linear transformation
from U into V and Ube finite dimensional , then
(a) rank(T) – Nullity (t) = Dim(U)
(b) rank(T) – Nullity (t) = Dim(V)
(c) rank(T) + Nullity (t) = Dim(U)
(d) rank(T) + Nullity (t) = Dim(V)

61
ANSWERS :

1 2 3 4 5 6 7 8 9 10
c d d b a d a a b c

62
 4.10 ASSIGNMENT QUESTIONS - 1

1. Find the matrix of the linear transformation T : R2  R3 define by

T x, y   2x – y, 3x  4 y, x in the standard bases.

2. Find the linear transformation: T : R 3  R 3 determined by the matrix

 1 2 1
 
 0 1 1  with respect to the standard bases. Also find the value
 1 3 4 
  of T 1,2,3
3. Define T : M 2X 2 F   M 2X 2 F byT A  A . Compute [�]T
�

2 2 1
4. Find the eigen values and eigenvectors of  
1 3 1
 1 2 2
 
 4.10 ASSIGNMENT QUESTIONS - 2

1. Find the matrix of the linear transformation T : R2  R3 define by

T x, y   x + 2 y, 3x - 4 y, 5 z in the standard bases.

2. Find the linear transformation: T : R 3  R 3 determined by the matrix

 1 2 1
 
 0 1 1  with respect to the standard bases. Also find the value
 1 3 4 
  of T 1,2,3
3. Define T : M 2X 2 F   M 2X 2 F byT A  A . Compute [�]T
�

2 2 1
4. Find the eigen values and eigenvectors of  
1 3 1
 1 2 2
 
 4.10 ASSIGNMENT QUESTIONS - 3

1. Find the matrix of the linear transformation T : R2  R3 define by

T x, y   x - y, 2x +3y, - 4 x + 5 y in the standard bases.

2. Find the linear transformation: T : R 3  R 3 determined by the matrix

2 2 1
  with respect to the standard bases. Also find the value
1 3 1
 1 2 2 of T 1,2,3
 

 1 2 1
 
4. Find the eigen values and eigenvectors of  0 1 1 
 1 3 4 
 
 4.10 ASSIGNMENT QUESTIONS - 4

1. Diagonalize  6 2 2  by an orthogonal transformation.

 
 2 3 1 
 2 1 3 
 

 2 1 1 
2. Diagonalize the matrix  1 1 2  by means of an orthogonal
 
 1 2 1  transformation
 

 2 2 3 
3. Diagonalize  
 2 1 6  by similarity transformation
 1 2 2 
 
 4.10 ASSIGNMENT QUESTIONS - 5

 2 1 1 
1. Diagonalize   by an orthogonal transformation.
 1 1 2 
 1 2 1 
 

 2 2 3 
 
2. Diagonalize the matrix  2 1 6  by means of an orthogonal
 1 2 2  transformation
 

 6 2 2 
3. Diagonalize   by similarity transformation
 2 3 1 
 2 1 3 
 
4.11 Part – A Questions and Answers

1. If T :V  V be a linear transformation. K2 CO 3

Prove that T  u   T  u 

Proof:
For any u V
u  (u)  0  T (u  (u))  T (0)  T (u)  T (u)  0( T (0)  0).

T (u)  T (u) .

2. Show that the transformation T : R 2  R 2 defined by K2 CO 3

T  x, y   sin x, y  is not
linear. Proof:
Let v= (x, y) and w = ( x ’, y ’)

Then c1v +c2w= (c1x +c2 x ’, c1y +c2y ’ )

T (c1v +c2 w )={sin(c1x +c2x ’ ),c1y +c2y ’ } …….. (1)

But c1T(v)+c2T(w)=c1 ( sinx ,y)+c2( sinx ’,y ’ )
= {c1 sinx +c2 sinx ’,c1y
+c2y ’ } …….(2) From (1) and (2), we see that
T (c1v + c2w) ≠c1T(v) + c2T(w)
T is not linear.

3. If V is the vector space of all n × n matrices over F K2 CO 3

and if B is an arbitrary matrix in V, show that the

transformation T : V → V defined by T ( A )= AB – BA ,
where A €V is linear. Show also that T(A) = A + B
is not linear, unless B =0.

68
 Proof:
T(c1A+c2A ’ )=(c1A+c2A ’ )B – B (c1A+c2A ’ )
=c1(AB–BA) + c2(A ’B–BA ’) (1)

c1T(A)+c2T(A ’ )=c1(AB–BA)+c2(A ’B–BA ’ )(2)

From (1) and (2), we see that T is linear.

Now T(c1A+ c2A ’ ) = c1A+ c2A ’+ B (3)

And c1T(A)+c2T(A’ )=c1(A+B)+c2(A ’+B)

≠c1A +c2A ’ +2B(4)

From (3) and (4); we see that T is not linear,
but linear when B = 0.
4. Find whether the transformation T : R2→R3 defined by K 2 CO 3

T(x, y) = (x + 1, 2y,x + y) is linear

Solution:

Let v=(x, y) and w = (x ’ , y ’ )

Then c1v+c2w=(c1x+c2x ’,c1y+c2y ’ )
T(c1v+c2w)={c1x+c2x ’+1,2(c1y+c2y ’ ),c1(x+y)+c2(x ’+y ’ )
≠c1T(v) + c2T(w). Hence T is not linear.
5. Find T (1,0), where T :R 2→R 3 is defined by K 2 CO 3

T(1,2)=(3,2,1) and T(3,4)=(6,5,4).

Solution:
Since(1,2) and(3,4 )are linearly independent , they form a basis
of R 2. (3,2,1)and (6, 5, 4) are arbitrary vectors in R 3
T :R 2→R 3 can be uniquely determined.
Let (1, 0) = c1(1,2) + c2(3,4) =>c1 + 3c2= 1 and 2c1 + 4c2 = 0

Solving three equations, c1 = –2 and c2=1

T(1, 0) = –2T(1, 2) + T(3,4)

= –2(3, 2, 1) + (6, 5, 4) = (0, 1, 2).

69
6. K1 CO 3
Is there a linear transformation T:R 3→R 2 such that
T (1, 0, 3)  (1,1) &T (2, 0, 6)  (2,1)?

Solution:
Given T (1, 0,3)  (1,1) &T (2, 0, 6)  (2,1)

T (2, 0, 6)  T (2(1, 0, 3) )  2T (1, 0, 3)( T(cv)=cT(v))

 2(1,1)  (2,1).

So, T is not linear.

7. Define kernel and image of a linear mapping. K1 CO 3
Solution:
Let T : V  U be linear mapping. The kernel of T is the set
of elements in V that map into zero vector 0 in U

i.e. ker T  v V;T  v   0

The image of T is the set of image points in U

Im T  u U,  v V for which T  v   u .

8. K1 CO 3
State Dimension theorem or Rank nullity theorem.
Solution:
The sum of the dimension of the range space and null
space of a lineartransformation is equal to the dimension of
its domain viz., if V and W are vector spaces over the field
F and
if T : V → W is alinear transformation and if V is finite
dimensional, then dim (V)=rank (T) + nullity (T)
=dim(Im T)+dim(Ker T).
9. K2 CO 3
If T : R2 R3 defined by T(a,b))  (a b,b  a, a)a,bR

is a linear transformation. Find the nullity and rank of

T.

Solution:Given T(a,b)) (ab,ba,a)a,bR

70
 We know that N(T ) uV ,T (u)  0
T (a, b)  0  (a  b, b  a, a)  (0, 0, 0)

 a b  0  a  b
a  0  a  0  b  0.

(a, b)  (0, 0) .Therefore N(T )  0

 Nullity =0, dim R2=2

By theorem, rank (T)= dim R2 – nullity = 2-0=2.
10 Let T : R 2  R 2 be defined by T (x, y)  (4x  2 y, 2x  y). Find the K2 CO 3
matrix of T relative to the standard basis.
Ans: Given T (x, y)  (4x  2 y, 2x  y)
The standard basis is e ,e  where e1  (1,0),e2  (0,1).
1 2

Now T (e1)  T (1,0)  (4, 2)  (4, 0)  (0, 2)  4(1,0)  2(0,1)  4e 1 2e 2

T (e2 )  (T (0,1)  (2,1)  (2, 0)  (0,1)  2e1  e2

 Matrix of T =  4 2  t  4 2  .
 2 
1 2 1
   

11 Let V=C(R) Tc :V V be a linear transformation defined K2 CO 3

by Tc(V)  v C, Find the matrix of Tcin the standard basis.

Ans: Let c=a+ib. The standard basis is 1,i
Tc(1) 1(a  ib)  a  ib  a.1 b.i
Tc(i)  i(a  ib)  ia  ib  (b).1 a.i
t
 a b a b
The matrix of Tc     .
 b a  b a 

12
        
1 0 0 1 0 0 0 0 K2 CO 3


Let   , , , , 1, x,
2
& 1 .  x
0 0 0 0 1 0 0 1
t
Define T : M 2 x 2 ( F )  M 2 x 2 ( F ) By T (A)  A . Compute matrix of T.
Ans: Given T : M 2 x2 (F)  M 2 x2 (F) by T ( A)  At .
1 0  1 0 
T 
 0 0  0 0 1
 1e  0e  0e  0e , T 0 1  0 0
 0e  0e 1e  0e
2 3 4 0 0 1 0 1 2 3 4
       

71
  0e 1e  0e  oe , T
0 0  0 1   0 0  0 0
T    0e  0e  0e 1e
 1 0   0 0 1 2 3 4  0 1  0 1 1 2 3 4
       
 1 0 0 0
0 0 1 0 
Matrix of T   .
0 1 0 0 
0 0 0 1 
 

13. Prove that similar matrices have the same trace. Hence K2 CO 3
prove that similar matrices have same eigen values.

Proof: Let A = [aij ] and B = [bij ] be two matrices over

m×n n×n
a field F such that B is similar to A. Then there exists an
invertible matrix P such that B = P−1AP

tr(B) = tr(P−1AP)
= ��(P−1(AP))
= tr((AP)P−1)
= ��(A(PP−1))
= tr(AI)
tr(B) = tr(A)
Let V be a finite dimensional vector space over field F.
Let T: V → V ′ be linear transformation. If B and B′ are the
′
basis, then matrices A = MB ( t) and A′ = MB′ (t) are similar.
B B
They are having the same trace.
14. 2 0 1  K2 CO 3
If 2, 3 are the Eigen values of  0 2 0  , then find the value of
 
b 0 2
b.

2 0 1 
Ans: Let A  0 2 0 and let 1,2 , 3 be the eigen values of A .
 
b 0 2

Given 1  2, 2  3 We know 1  2  3  2  2  2  6

2 0 1
Also 2+3+3 =6  3  6  5 1 .     A  0 2 0  6  8  2b  b  1.
1 2 3

b 0 2

72
15 Find the sum and product of all the eigen values of the matrix K2 CO 3
1 1 1 
1 2 2  .
 
1 2 3
 

Solution: We know that sum of the eigen values = sum of

diagonal elements 1 2  3  6
The product of the eigen values = Determinant of the matrix
1 1 1
 1 2 2 1.
1 2 3

16 2 2 1 K2 CO 3
Two eigen values of the matrix A   1 3 1  are equal to 1
 
1 2 2
each. Find the eigen values of A1.

Solution:Let the third eigen value be . The other two eigen values
are 1,1,

We know that sum of the eigen values = Trace of A

11   2  3  2  2  7    5.

The eigen values of A are 1, 1, 5.

1
The eigen values of A1 are 1,1, .
5

17 If the eigen values of the matrix A of order 3 x 3 are 2, 3, 1, K2 CO 3

then find the eigen values of adjoint of A.

1
Solution: We know that A1  adjA  adjA  A A 1
A

1 1
Eigen values of A-1 are , & 1 and A = Product of the eigen values
23
=6

1 1
Eigen values of adjoint of A are 6  , 6  , 6 1 (i.e) 3, 2, 6.
2 3

73
18  6 2 2  K2 CO 3

The product of two eigen values of the matrix A  2 3 1
 
2 1 3 
 
is 16. Find the third eigen value.

Solution:Given, 1.2 16. W.K.T 123  A

6 2 2
163   2 3 1  6  9 1  2  6  2   2 2  6   32
2 1 3

  3  2. Hence the third eigen value is 2.

19  3 5 3 K2 CO 3
Find the eigen values of A , if A   0 4 6  .
-1
 
0 0 1
 

Solution: Since A is the upper triangular matrix, the eigen values of A

are 3,4,1. The eigen values of A1 are
1 , 1 ,1.
3 4

20  a 4 K2 CO 3
Find the constants a and b such that matrix has 3 and -2
 1 b
 
as its eigen values.

 a 4
Solution: Given A 
 1 b
 

1  2  a  b  1        (1)
 1 2  ab  4   6  ab   2        (2)

From (1) and (2), we get a  2, b  1 and a  1, b  2.

21 If the sum of two eigen values and trace of 33 matrix A are K2 CO 3

equal, find A .

Solution:Trace of the Matrix (A)

= 1  2  3  1  2  3  0  A  1 2 3  0 .

74
22 4 6 6 K2 CO 3
Two eigen values of A  1 3 2  are equal and they are
 
1 5 2 
 
double the third. Find the eigen values of A2.

Solution: Eigen values of A are 2 , 2 ,  .  5  4  3  2  5

   1. Eigen values of A2 are 4, 4, 1.

23 1 2 3 K2 CO 3
The matrix A   2 0  2  is singular. One of the eigen values is
 
1 2 3
 
2. Find the other two eigen values

Solution: 1  2, A 0  1 2 3  2  0

1  2  3  4  3  2.

24 Find the Eigen values and Eigen vectors of the matrix K2 CO 3

 2  2 2
A  1 1 1  .
 
1 3 1 
 
Answer: The Characteristic equation is  3  2  2  4   8  0

The eigenvalues are –2, 2, 2.

 4  0
The eigenvectors are X   1  & X  X  1  .
1   2 3  
 7 1 
   

25 Prove that the matrix A = [1 2 ] is not diagonalizable over field C. K2 CO 3

0 1

Answer: The characteristic equation of A is

│1 − x 2 │ = 0 ⟹ (1 − x)2 = 0
0 1−x
The roots of equations are 1, 1.
Therefore, the only distinct Eigen value of A is 1.

75
 The Eigen vectors of A corresponding to this Eigen value also given
x
by [0 2] ( 1) = (0)
0 0 x2 0
0x1 + 2x2 = 0
This equation has only one linearly independent solution. We see
that X = (1 ) is the only
0
Linearly independent Eigen vectors, therefore it is not
diagonalizable.
26 State the condition for diagonalizable matrix A? K2 CO 3

ANSWER: Let T be linear operator on an n- dimensional vector

space V. then T is diagonalizable if and only if both of the following
conditions hold.

1. The characteristic polynomial of T splits.

2. The multiplicity of Eigen value (λi) of T (or)
A  n – rank of  A – i I  for all i.
27 0 0 1  K2 CO 3
Test the matrix B   1 0 1 is diagonalizability?
 
0 1 1
 

Answer:
It's not diagonalizable since its characteristic polynomial does not
split.

76
4.12 PART B

S. NO QUESTION AND ANSWERS K- CO

LEVEL
Let U be a finite dimensional vector space over the field F
&let � = {�1, �2, … . , �� } be an ordered basis for U. Let V be
a vector space over the space field F and let (�1, … . . , ��) be
1 K2 CO 3
any vectors in V.Then there exists a unique linear
transformation T from U into V such that i   i , i  1,2,n.

Let V and W be vector space and �: � → � be linear

transformation. Prove that
2 K2 CO 3
(i) The null space of T is a subspace of V.
(ii) The range of T is a subspace of V.
Let �: � → � be non-singular linear mapping, prove that

3 the image of any linearly independent set is linearly K2 CO 3

independent.

Show that the transformation T:R 2→R 2

defined by
4 K2 CO 3
T (x, y) = (ax + by, cx +dy); where a, b, c, d € R, is linear.
Show that the transformation T: R 3→R 2 defined by T(x, y,
5 K2 CO 3
z) =(x+1, y+z) is not linear.
Show that the transformation T:R 2→R 2, defined by
6 K2 CO 3
T(x, y) = (x 2, y 2) is not linear.
Show that the transformation T:R 2→R, defined by
7 K2 CO 3
T(x, y) = x y is not linear.
Is there a linear transformation T: R 2→R 2such that T (1,–
8 K2 CO 3
1)=(1,0),T(2, –1) = (0,1) and T (–3, 2) = (1, 1)?
State and prove Dimension Theorem or Rank- Nullity
9 K2 CO 3
theorem.
Find a basis and dimension for R(T) and N(T)for the linear

10 transformation T:R 3→R 3, given by K2 CO 3

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

77
11. Find a basis and dimension for R(T) and N(T), for the linear transformation K2 CO 3

T : R 3  R 3 , defined by
T (x, y, z) = (x + 2y, y – z, x + 2z).
12. Let T : R 3  R 3 be linear mapping defined by K2 CO 3

T  x, y, z    x  2 y  z, y  z, x  y  2z  .

Find the basis and dimension of (i) Range T 

(ii) Kernel T  (iii) Verify Dimension theorem.

13. For the following linear operator T on a vector space P3  R  , test T K2 CO 3
for diagonalizability, and if T is Diagonalizable, find a basis  for V such that T 
is a

diagonal matrix. V  P2  R  and T is defined by

i) T(ax 2  bx  c)  cx 2  bx  a.

ii) T  f  x  f ’  x   f ’’  x 
Answer:
−1 0 0
(i) it’s diagonalizable with D = ( 0 1 0)
0 0 1
1 1 0
& Q = ( 0 0 1)
−1 1 0
(ii) It’s not diagonalizable since dim (E0) = 1 but not 4.
14. K1 CO 3
ForeachlinearoperatorTonv,findtheeigenvaluesofTandanorderedbasis β forVs

uchthat [T ] diagonal matrix. V  P3Rand T f x  f x f 2x. 
15. K1 CO 3
For each linear operator T on V, find the eigenvalues and eigen vectors
on ordered basis b for V suchthat [T ] isadiagonalmatrix. V  R 3 and
T (a, b,c)  (7a  4b 10c, 4a 3b 8c, 2a  b  2c) .

78
SUPPORTIVE ONLINE CERTIFICATION COURSES

The following NPTEL and Coursera courses are the supportive online certification
courses for the subject Linear Algebra

Introduction to Abstract and Linear Algebra

https://swayam.gov.in/nd1_noc20_ma31/preview

Linear Algebra
https://swayam.gov.in/nd1_noc20_ma54/preview

Linear Algebra
https://www.coursera.org/learn/algebra-lineynaya

79
REAL TIME APPLICATIONS

View the following videos on YouTube:

Applications Of Matrices

https://youtu.be/rowWM-MijXU

Essence of Linear Algebra

https://youtu.be/fNk_zzaMoSs

Applications of Linear combination,Span& Basis

https://youtu.be/k7RM-ot2NWY

Applications of Eigen Values & Eigen vectors

https://youtu.be/jUIIm5C-xFs

80
CONTENT BEYOND THE SYLLABUS

Basic notions of groups, rings, fields are content beyond the syllabus for the course
Linear Algebra
View the lecture on YouTube:

https://www.youtube.com/watch?v=PN-cro0J_v8

Value Added Courses:

1. Mathematics for Machine Learning: Linear Algebra (Coursera online course)

81
 Assessment Schedule
(Proposed Date & Actual Date)
Assessment Schedule (Proposed Date & Actual Date)

Sl. Proposed Actual

ASSESSMENT
No. Date Date

24/2/25 to
1 FIRST INTERNAL ASSESSMENT
25/2/25

01/04/25 to
2 SECOND INTERNAL ASSESSMENT
05/04/25

28/04/25 to
3 MODEL EXAMINATION
07/05/25

24/5/25 to
4 END SEMESTER EXAMINATION
25/5/25
 PRESCRIBED TEXT BOOKS AND REFERENCE BOOKS

Subject Code : 20MA305

Subject Name: LINEAR ALGEBRA

TEXTBOOKS:
1.Friedberg A.H, Insel A.J. and Spence L, Linear Algebra, Prentice Hall of India,
New Delhi,
2004.

2.Faires J.D. and Burden R., Numerical Methods, Brooks/Cole (Thomson

Publications),
New Delhi, 2002.

REFERENCES:
1.Kumaresan S, Linear Algebra - A geometric approach, Prentice Hall of India,
New Delhi,
Reprint, 2010.

2.Strang G, Linear Algebra and its applications, Thomson (Brooks / Cole) New
Delhi, 2005.

3.Gerald C.F. and Wheatley P.O, Applied Numerical Analysis, Pearson Educations,
New Delhi,
2002.

4.Sundarapandian V, Numerical Linear Algebra, Prentice Hall of India, New Delhi,

2008.

5. Richard Branson, Matrix Operations, Schaum's outline series, 1989.

6.Bernard Kolman, David R. Hill, Introductory Linear Algebra, Pearson Educations,

New Delhi,
First Reprint, 2009.

84
 MINI- PROJECT - 1

1. Implement character movement and object

transformations in a 2D game.
2. U s e m a t r i c e s fo r ro t a t i o n , s c a l i n g , a n d
translation in Unity (C#) or Pygame (Python).
 MINI- PROJECT - 2

1. Apply transformations (scaling, rotation,

reflection) to an image using matrices.
2. Implement this using Python (NumPy &
OpenCV) or MATLAB.
3. Show how different transformation matrices
affect the image.
 MINI- PROJECT - 3

1. Explore Hill Cipher, a cryptographic technique

using matrices.
2. Encrypt and decrypt messages using matrix
multiplication and modular arithmetic.
3. Implement a program that takes text input
and applies the Hill cipher
 MINI- PROJECT - 4

1. Simulate how a robot moves in a plane using

transformation matrices.
2. Use rotation and translation matrices to model
robotic arm movement.
3. Implement this in Python using Matplotlib to
visualize motion.
 MINI- PROJECT - 5

1. Investigate how eigenvalues and eigenvectors

are used in machine learning, physics, and
engineering.
2. Demonstrate their use in facial recognition,
vibration analysis, or Google’s PageRank
algorithm.
3. Implement calculations and simulations in
Python or MATLAB.
 Thank you

Disclaimer:

This document is confidential and intended solely for the educational purpose of RMK Group of
Educational Institutions. If you have received this document through email in error, please notify the
system manager. This document contains proprietary information and is intended only to the
respective group / learning community as intended. If you are not the addressee you should not
disseminate, distribute or copy through e-mail. Please notify the sender immediately by e-mail if you
have received this document by mistake and delete this document from your system. If you are not
the intended recipient you are notified that disclosing, copying, distributing or taking any action in
reliance on the contents of this information is strictly prohibited.

90