POSTS AND TELECOMMUNICATIONS INSTITUTE OF

TECHNOLOGY
——————–o0o——————–

Chapter 5: Linear Mappings

ALGEBRA

Department of Mathematics, Faculty of Fundamental

Science 1

Hanoi - 2022

1 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Chapter 5: Linear Mappings

1 5.1 Introduction to Linear Mappings

2 5.2 Kernel and Image of a Linear Mapping

3 5.3 Monomorphisms, Epimorphisms, and Isomorphisms

4 5.4 Linear Mappings and Matrices

5 5.5 Diagonalization

2 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Chapter 5: Linear Mappings

1 5.1 Introduction to Linear Mappings

2 5.2 Kernel and Image of a Linear Mapping

3 5.3 Monomorphisms, Epimorphisms, and Isomorphisms

4 5.4 Linear Mappings and Matrices

5 5.5 Diagonalization

3 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.1.1 Definition

Definition
Let V and W be vector spaces. A mapping f : V → W is called a
linear mapping if it satisfies the following two conditions:
1) f (u + v) = f (u) + f (v) for all u, v ∈ V .
2) f (αu) = αf (u) for all α ∈ R and all u ∈ V .

A linear mapping is also called a linear transformation or a

homomorphism.
A linear mapping f : V → V is called an endomorphism.

4 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Example 1.
Zero mapping:

θ:V →W
u 7→ θ(u) = 0

Identity mapping:

IdV : V → V
u 7→ IdV (u) = u

5 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.1.2 Properties

Theorem 5.1
A mapping f : V → W is linear if and only if for all u, v ∈ V and all
α, β ∈ R,
f (αu + βv) = αf (u) + βf (v).

Example 2. The mapping f : Rn → Rm defined by

f (x1 , x2 , . . . , xn ) =(a11 x1 + a12 x2 + . . . + a1n xn , a21 x1 + a22 x2 +

. . . + a2n xn , . . . , am1 x1 + am2 x2 + . . . + amn xn )

is linear.

6 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.2
If f : V → W is a linear mapping, then
1) f (0) = 0.
2) f (α1 v1 + α2 v2 + . . . + αn vn ) = α1 f (v1 ) + α2 f (v2 ) + . . . + αn f (vn )
for all α1 , α2 , . . . , αn ∈ R and all v1 , v2 , . . . , vn ∈ V .

Example 3. Let f : R2 → R3 be a linear mapping. Find f (2, 1) if

f (1, 2) = (1, 0, 1), f (−1, 0) = (0, 1, 1)

7 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.3
Let V and W be vector spaces and let {v1 , v2 , . . . , vn } be a basis of V .
Given any vectors u1 , u2 , . . . , un in W , there exists a unique linear
mapping f : V → W such that

f (vi ) = ui , for each i = 1, . . . , n.

Corollary. Let f, g : V → W be two linear mappings and let

{v1 , ..., vn } be a basis of V . Then

f = g ⇔ f (vi ) = g(vi ), ∀i = 1, ..., n.

8 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.1.3 Operations on Linear Mappings

Let V and W be vector spaces. Let Hom(V, W ) denote the set of

all linear mappings from V to W .
If f, g ∈ Hom(V, W ), the sum f + g is defined by

(f + g)(v) = f (v) + g(v) for all v ∈ V.

If λ ∈ R and f ∈ Hom(V, W ), the scalar product λf is defined by

(λf )(v) = λf (v) for all v ∈ V.

9 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.4
1) Hom(V, W ) is a vector space with the above operations of addition
and scalar multiplication.
2) If V and W are of finite dimension, then

dim Hom(V, W ) = (dim V )(dim W )

10 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
 Let U, V and W be vector spaces. If f : U → V, g : V → W are
linear mappings, then the g ◦ f is also a linear mapping.
Let End(V ) denote the set of all endomorphisms of V .
For any f ∈ End(V ), we define

f 0 = IdV , f 1 = f, f 2 = f ◦ f, f n = f n−1 ◦ f = f ◦ ... ◦ f .

| {z }
n times

Given f ∈ End(V ) and the polynomial p(t) = a0 + a1 t + ... + an tn .

We denote by p(f ) the endomorphism defined by

p(f ) = a0 IdV + a1 f + ... + an f n

11 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Example 4. Let f : R2 → R2 be a linear mapping defined by

f (x, y) = (3x − 5y, 4x + y)

a) Find f 2 (x, y).

b) Given the polynomial p(t) = 50 − 9t + 2t2 . Find p(f )(x, y).

12 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Chapter 5: Linear Mappings

1 5.1 Introduction to Linear Mappings

2 5.2 Kernel and Image of a Linear Mapping

3 5.3 Monomorphisms, Epimorphisms, and Isomorphisms

4 5.4 Linear Mappings and Matrices

5 5.5 Diagonalization

13 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.5
Let f : V → W be a linear mapping. Then
1) If V1 is a subspace of V , then f (V1 ) is a subspace of W .
If S is a spanning set of V1 , then f (S) is a spanning set of f (V1 ).
Therefore, dim f (V1 ) ≤ dim V1 .
2) If W1 is a subspace of W , then f −1 (W1 ) is a subspace of V .

14 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Definition
Let f : V → W be a linear mapping. Then the kernel of f , denoted by
Kerf , and the image of f , denoted by Imf , are defined as follows

Kerf = f −1 {0} = {v ∈ V |f (v) = 0}

Imf = f (V ) = {f (v)|v ∈ V }

Remark: Kerf is a subspace of V and Imf is a subspace of W .

Rank of a Linear Mapping

Let f : V → W be a linear mapping. The rank of f , denoted by
rank(f ), is the dimension of Imf .

rank(f ) = dim Imf

15 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.6
Let f : V → W be a linear mapping. If Kerf and Imf are both finite
dimensional, then V is also finite dimensional and

dim V = dim Kerf + dim Imf = dim Kerf + rank(f )

Example 5. Let f : R4 → R3 be a linear mapping defined by

f (x, y, z, t) = (x + 2y − z + t, 3x + y + 2t, x − 3y + 2z).

a) Find a basis of Kerf, Imf .

b) Find the rank of f .

16 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Chapter 5: Linear Mappings

1 5.1 Introduction to Linear Mappings

2 5.2 Kernel and Image of a Linear Mapping

3 5.3 Monomorphisms, Epimorphisms, and Isomorphisms

4 5.4 Linear Mappings and Matrices

5 5.5 Diagonalization

17 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.3.1 Monomorphisms

Definition
A linear mapping is called a monomorphism if it is injective.

Theorem 5.7
Let f : V → W be a linear mapping. The following propositions are
equivalent.
1) f is a monomorphism.
2) Kerf = {0}.
3) The image of a linearly independent set of vectors in V is a
linearly independent set of vectors in W .
4) rank(f ) = dim V .

18 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.3.2 Epimorphisms

Definition
A linear mapping is called a epimorphism if it is surjective.

Theorem 5.8
Let f : V → W be a linear mapping. The following propositions are
equivalent.
1) f is an epimorphism.
2) The image of a spanning set of V is a spanning set of W .
3) rank(f ) = dim W .

19 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.3.3 Isomorphisms

Definition
A linear mapping is called an isomorphism if it is bijective.
The vector spaces V and W are called isomorphic if there exists an
isomorphism f : V → W .

Theorem 5.9
The vector spaces V and W are isomorphic if and only if

dim V = dim W

20 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.10
Suppose that f : V → W is a linear mapping and dim V = dim W .
Then the following propositions are equivalent.
1) f is isomorphic.
2) f is monomorphic.
3) f is epimorphic.

Example 6. Show that the linear mapping f : R3 → P2 defined by

f (x, y, z) = (x + 2y + 3z) + (2x + 5y + 6z)t + (x + 8z)t2 .

is an isomorphism.

21 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Chapter 5: Linear Mappings

1 5.1 Introduction to Linear Mappings

2 5.2 Kernel and Image of a Linear Mapping

3 5.3 Monomorphisms, Epimorphisms, and Isomorphisms

4 5.4 Linear Mappings and Matrices

5 5.5 Diagonalization

22 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.4.1 Matrix of a Linear Mapping

Definition
Let B = {e1 , . . . , en }, B ′ = {ω1 , . . . , ωm } be bases of vector spaces
V, W , respectively and let f : V → W be a linear mapping.
The matrix whose jth column is formed by the coordinates of
f (ej ) in the basis B ′ (j = 1, . . . , n) is called the matrix of f with
′
respect to the bases B and B ′ , denoted by [f ]B B .
The matrix of f with respect to the standard bases of V and W is
called the standard matrix of f .
If f is an endomorphism of V , then the matrix of f with respect to
the basis B is denoted by [f ]B .

23 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Express the vectors f (ej ), j = 1, . . . , n, as linear combinations of
ω1 , . . . , ω m .

f (e1 ) = a11 ω1 + a21 ω2 + . . . + am1 ωm

f (e2 ) = a12 ω1 + a22 ω2 + . . . + am2 ωm
...............
f (en ) = a1n ω1 + a2n ω2 + . . . + amn ωm

Then the matrix of f with respect to the bases B and B ′ is

 
a11 a12 . . . a1n
′
 a21 a22 . . . a2n 
[f ]B =
 
B  .. .. .. 
 . . . 
am1 am2 . . . amn

24 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Example 7. Find the standard matrix of the linear mapping
f : R3 → R2 defined by

f (x, y, z) = (2x + y − 4z, 3x + 5z)

25 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Remark: The standard matrix of the linear mapping f : Rn → Rm
defined by

f (x1 , x2 , . . . , xn ) =(a11 x1 + a12 x2 + . . . + a1n xn , a21 x1 + a22 x2 +

. . . + a2n xn , . . . , am1 x1 + am2 x2 + . . . + amn xn )

is  
a11 a12 ... a1n
 a21 a22 ... a2n 
A= .
 
.. .. 
 .. . ... . 
am1 am2 . . . amn

26 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.11
Let V, W be two vector spaces of dimension n and m respectively.
Suppose that B is a basis of V , B ′ is a basis of W . Then the mapping

Hom(V, W ) → Mm×n
′
f 7→ [f ]B
B

is a bijection satisfying the following properties

′ ′ ′
1) [f + g]B B B
B = [f ]B + [g]B
′
B = λ[f ]B ′
2) For all λ ∈ R, [λf ]B B
B ) ′
3) rank(f ) = rank([f ]B

27 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.12
Let B, B ′ , B ′′ be bases of vector spaces U, V, W respectively. If
f : U → V, g : V → W are linear mappings, then the matrix of g ◦ f
with respect to the bases B and B ′′ is
′′ ′′ ′
[g ◦ f ]B B B
B = [g]B ′ [f ]B

Example 8. Let f : R2 → R3 , g : R3 → R2 be the linear mappings

defined by

f (x, y) = (x − 2y, x, −3x + 4y),

g(x, y, z) = (x − 2y − 5z, 3x + 4y)

Find the standard matrix of g ◦ f .

28 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.13
Let B be a basis of a vector space V of dimension n. Then the mapping

End(V ) → Mn
f 7→ [f ]B

is a bijection satisfying the following properties

1) [f + g]B = [f ]B + [g]B
2) For all λ ∈ R, [λf ]B = λ[f ]B
3) [f ◦ g]B = [f ]B [g]B
4) rank(f ) = rank([f ]B )

29 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Corollary 1.
Let f ∈ End(V ) and A = [f ]B . Then f is an isomorphism if and only if
A is invertible and the matrix of f −1 with respect to B is

[f −1 ]B = A−1

Corollary 2.
Let f ∈ End(V ). If p(t) = a0 + a1 t + . . . + an tn is a polynomial of
degree n, then the matrix of p(f ) with respect to B is

p(A) = a0 I + a1 A + . . . + an An .

30 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Example 9. Let f : R3 → R3 be the linear mapping defined by

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

Show that f is an isomorphism. Find f −1 (x, y, z).

31 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.4.2 Matrices of a Linear Mapping with respect to
Different Bases

Theorem 5.14
Let P be the transition matrix from a basis B1 to a basis B1′ in V , and
let Q be the transition matrix from a basis B2 to a basis B2′ in W .
Then for any linear mapping f : V → W ,
B′
[f ]B2′ = Q−1 [f ]B2
B1 P
1

Corollary. Let P be the transition matrix from a basis B to a basis B ′

in a vector space V . Then for any endomorphism f of V ,

[f ]B ′ = P −1 [f ]B P.

32 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Example 10. Let f : R3 → R2 be the linear mapping defined by

f (x, y, z) = (x + y + z, x + y − z).

Find the matrix of f with respect to the bases

B1 = {(0, 1, 1), (1, 0, 1), (1, 1, 0)} and B2 = {(1, 1), (0, 1)}.

Definition
Two matrices A, B are called similar if there exists an invertible matrix
P such that B = P −1 AP .

33 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Remark:
The two matrices of an endomorphism with respect to two
different bases are similar.
If A, B are similar, then det A = det B.

Definition
Let B be a basis of a vector space V and f ∈ End(V ). The determinant
of f , denoted by det f , is the determinant of the matrix [f ]B .

det f = det ([f ]B )

34 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.4.3 Coordinates Formula of a Linear Mapping

Suppose that
f : V → W is a linear mapping,
B = {e1 , ..., en } is a basis of V ,
B ′ = {ω1 , ..., ωm } is a basis of W .
If (v)B = (x1 , x2 , . . . , xn ), (f (v))B ′ = (y1 , y2 , . . . , ym ) and
′
[f ]B
B = [aij ]m×n , then
    
y1 a11 a12 . . . a1n x1
 y2   a21 a22 . . . a2n   x2 
 ..  =  ..
    
.. ..   .. 
 .   . . ... .  . 
ym am1 am2 . . . amn xn

This formula is called the coordinates formula of the linear mapping f

with respect to the bases B, B ′ .
35 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
The coordinates formula of f can be written in the form of a linear
system of equations as



 y1 = a11 x1 + a12 x2 + · · · + a1n xn

y = a x + a x + · · · + a x
2 21 1 22 2 2n n
..................................................



y = a x + a x + · · · + a x
m m1 1 m2 2 mn n

36 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.15
Let V and W be vector spaces with bases B and B ′ respectively. If
f : V → W is a linear mapping, then for all v ∈ V ,
′
[f (v)]B ′ = [f ]B
B [v]B

Example 11. Let f : P3 → P2 be the linear mapping defined by

f (a0 + a1 t + a2 t2 + a3 t3 ) =(5a0 + 2a1 − 3a2 + a3 )+

+(4a0 + a1 − 2a2 + 3a3 )t + (a0 + a1 − a2 − 2a3 )t2 .
a) Find the coordinates formula of f with respect to the standard
bases of P3 and P2 .
b) Find a basis of Kerf and Imf .

37 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Chapter 5: Linear Mappings

1 5.1 Introduction to Linear Mappings

2 5.2 Kernel and Image of a Linear Mapping

3 5.3 Monomorphisms, Epimorphisms, and Isomorphisms

4 5.4 Linear Mappings and Matrices

5 5.5 Diagonalization

38 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.5.1 Eigenvalues and Eigenvectors

Definition
Let A be a square matrix of order n.
A number λ is called an eigenvalue of A if there exist x1 , x2 , . . . , xn
not simultaneously equal to zero such that
       
x1 x1 x1 0
 x2   x2   x2  0
A  .  = λ  .  or (A − λI)  .  =  .  (1)
       
 ..   ..   ..   .. 
xn xn xn 0

In this case, v = (x1 , x2 , . . . , xn ) ∈ Rn , v ̸= 0 is called an

eigenvector of A corresponding to the eigenvalue λ.

39 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
  
3 5
Example 12. Let A = and v = (5, 1). We have
1 −1
      
3 5 5 20 5
= =4 ,
1 −1 1 4 1

hence λ = 4 is an eigenvalue of A and v = (5, 1) is an eigenvector of A

corresponding to the eigenvalue λ = 4.

Remark:
The eigenvectors corresponding to the eigenvalue λ are the
nonzero solutions to the homogeneous system (1).
The space of solutions to (1) is called the eigenspace corresponding
to the eigenvalue λ, denoted by Vλ .

40 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Definition
Let f be an endomorphism of a vector space V . A number λ is called
an eigenvalue of f if there exists a vector v ∈ V, v ̸= 0 such that

f (v) = λv.

v is called an eigenvector corresponding to the eigenvalue λ.

Example 13. Let f : R2 → R2 be the endomorphism defined by

f (x, y) = (3x − y, −2x + 4y)

f (x, x) = 2(x, x) ⇒ λ = 2 is an eigenvalue of f and every vector

v = (x, x), x ̸= 0 is a corresponding eigenvector.

41 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Definition
Let f be an endomorphism of a vector space V . For each λ ∈ R, denote

Vλ = {v ∈ V |f (v) = λv} = Ker(f − λIdV )

If λ is an eigenvalue of f , then Vλ is called the eigenspace

corresponding to the eigenvalue λ.

Theorem 5.16
1) λ is an eigenvalue of f if and only if Vλ ̸= {0}.
2) If λ is an eigenvalue of f , then every vector v in Vλ , v ̸= 0 is an
eigenvector corresponding to λ.
3) For all λ, the subspace Vλ is invariant to f , that is f (Vλ ) ⊆ Vλ .

42 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Remark: Suppose that f is an endomorphism of a vector space V , B
is a basis of V and A = [f ]B . Then
v ∈ V is an eigenvector of f corresponding to the eigenvalue λ if
and only if (v)B is an eigenvector of A corresponding to the
eigenvalue λ.
If V = Rn and B is the standard basis of Rn , then v is an
eigenvector of f corresponding to the eigenvalue λ if and only if it
is an eigenvector of A corresponding to the eigenvalue λ.

43 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.5.2 Characteristic Polynomials

Definition
Let A be a square matrix of order n. The determinant

PA (λ) = det(A − λI)

is a polynomial of degree n of λ.
PA (λ) is called the characteristic polynomial of A.
Suppose that f is an endomorphism of a vector space V , B is a
basis of V and A = [f ]B . Then, the determinant

Pf (λ) = det(f − λIdV ) = det(A − λI)

is called the characteristic polynomial of f .

44 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.17
λ0 is an eigenvalue of A (resp. of f ) if and only if it is a solution to the
characteristic polynomial of A (resp. of f ).

Example 14. Find the eigenvalues and eigenvectors of the

endomorphism f : R2 → R2 defined by

f (x, y) = (3x − y, −2x + 4y).

45 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.5.3. Diagonalizable Endomorphisms and
Diagonalizable Matrices

Diagonal Matrix
An n × n matrix D is called a diagonal matrix if all its entries off the
main diagonal are zero, that is if D has the form
 
λ1 0 . . . 0
 0 λ2 . . . 0 
D= . ..  = diag(λ1 , λ2 , . . . , λn )
 
.. . .
 .. . . . 
0 0 . . . λn

46 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Remark: If D = diag(λ1 , λ2 , . . . , λn ), E = diag(µ1 , µ2 , . . . , µn ), then
1) DE = diag(λ1 µ1 , λ2 µ2 , . . . , λn µn )
2) Dk = diag(λk1 , λk2 , . . . , λkn )

Definition
An endomorphism f of a vector space V is called diagonalizable if
there exists a basis B of V such that [f ]B is a diagonal matrix.
A square matrix A is called diagonalizable if there exists an
invertible matrix P such that P −1 AP is a diagonal matrix.

Remark: An endomorphism f of a vector space V is diagonalizable if

and only if there exists a basis of V consisting of eigenvectors of f .

47 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Theorem 5.18
If v1 , v2 , . . . , vm are the eigenvectors corresponding to the distinct
eigenvalues λ1 , λ2 , . . . , λm of an endomorphism f (or a matrix A) then
{v1 , v2 , ..., vm } is linearly independent.

Corollary 1. Let f be an endomorphism of a vector space V of

dimension n.
If the characteristic polynomial of f has n distinct real roots, then
f is diagonalizable.
If Pf (λ) = (−1)n (λ − λ1 )m1 . . . (λ − λk )mk , where
m1 + . . . + mk = n and λ1 , . . . , λk are distinct real numbers, then f
is diagonalizable if and only if

dim Vλi = mi , ∀i = 1, . . . , k

48 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Corollary 2. Let A be a square matrix of order n.
If the characteristic polynomial of A has n distinct real roots, then
A is diagonalizable.
If PA (λ) = (−1)n (λ − λ1 )m1 ...(λ − λk )mk , where
m1 + . . . + mk = n and λ1 , . . . , λk are distinct real numbers, then
A is diagonalizable if and only if

dim Vλi = mi , ∀i = 1, . . . , k.

49 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
5.5.4. Diagonalization Algorithm

Problem of Diagonalizing a Matrix

Let A be a square matrix of order n. Find an invertible matrix P such
that P −1 AP is a diagonal matrix.

Step 1. Find the eigenvalues λ1 , . . . , λk of A by solving the equation

PA (λ) = 0.

Step 2. For each eigenvalue λi , find the dimension of the eigenspace

Vλi . The eigenvectors v = (x1 , x2 , . . . , xn ) are nonzero solutions to the
homogeneous system
   
x1 0
 ..   .. 
(A − λi I)  .  =  .  .
xn 0
50 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
 dim Vλi = di = n − r(A − λi I)

If di < mi for some value i, i = 1, . . . , k, (λi has multiplicity mi ),

then A is not diagonalizable.
If di = mi for all i = 1, . . . , k, proceed to Step 3.
Step 3. In each eigenspace Vλi , i = 1, . . . , k, choose mi linearly
independent eigenvectors. P is the matrix whose columns are the
chosen eigenvectors.
 
2 −1 0
Example 15. Diagonalize the matrix A =  9 4 6 .
−8 0 −3

51 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings
Example 16. Let f : R3 → R3 be an endomorphism defined by

f (x, y, z) = (8x − 2y + 2z, −2x + 5y + 4z, 2x + 4y + 5z).

Find a basis of R3 such that the matrix of f with respect to this basis
is diagonal.

52 / 52
Nguyen Thi Minh Tam Chapter 5: Linear Mappings