Solved Exercises on Diagonalization of Matrices in Linear Algebra

Master matrix diagonalization: eigenvalues, eigenvectors, diagonal matrices, and similarity transformations through these 5 detailed exercises.

Diagonalization Fundamentals
\(A = PDP^{-1}\)
Diagonalization Formula
Key Definitions:

Diagonalizable Matrix: A matrix A is diagonalizable if A = PDP⁻¹ where D is diagonal and P is invertible

Eigenvalue λ: Scalar satisfying Av = λv for some non-zero vector v

Eigenvector v: Non-zero vector satisfying Av = λv

Characteristic Polynomial: det(A - λI) = 0

Diagonalization Process:
  1. Find characteristic polynomial: det(A - λI) = 0
  2. Solve for eigenvalues: Find roots of characteristic equation
  3. Find eigenvectors: For each λ, solve (A - λI)v = 0
  4. Form matrices: P from eigenvectors, D from eigenvalues
  5. Verify: Check A = PDP⁻¹
Tip 1: A matrix is diagonalizable if it has n linearly independent eigenvectors.
Tip 2: Symmetric matrices are always diagonalizable.
Tip 3: Distinct eigenvalues guarantee diagonalizability.
Tip 4: Use diagonalization for efficient matrix powers: A^n = PD^nP⁻¹
Key Properties: Eigenvalues unchanged under similarity, trace(A) = sum of eigenvalues, det(A) = product of eigenvalues
Applications: Solving differential equations, Markov chains, principal component analysis
Essential Formulas:

• Characteristic equation: det(A - λI) = 0

• Eigenvalue equation: Av = λv

• Diagonalization: A = PDP⁻¹

• Matrix powers: A^n = PD^nP⁻¹

Solution: Exercises 1 to 3
1 Basic Diagonalization
Exercise 1
Find the diagonalization of: A =
[
4
-2
1
1
]
Definition:

Diagonalization: Express A as A = PDP⁻¹ where D is diagonal matrix of eigenvalues

Step-by-step Method:
  1. Find characteristic polynomial det(A - λI) = 0
  2. Find eigenvalues λ
  3. Find eigenvectors v for each λ
  4. Form P from eigenvectors, D from eigenvalues
  5. Verify A = PDP⁻¹
Step 1: Find characteristic polynomial

A - λI =

[
4-λ
-2
1
1-λ
]

det(A - λI) = (4-λ)(1-λ) - (-2)(1) = (4-λ)(1-λ) + 2

= 4 - 4λ - λ + λ² + 2 = λ² - 5λ + 6

Step 2: Find eigenvalues

λ² - 5λ + 6 = 0 → (λ - 2)(λ - 3) = 0

Therefore: λ₁ = 2, λ₂ = 3

Step 3: Find eigenvector for λ₁ = 2

(A - 2I)v = 0 →

[
2
-2
1
-1
]
[
x
y
]
=
[
0
0
]

This gives: 2x - 2y = 0 and x - y = 0, so x = y

Eigenvector: v₁ =

[
1
1
]

Step 4: Find eigenvector for λ₂ = 3

(A - 3I)v = 0 →

[
1
-2
1
-2
]
[
x
y
]
=
[
0
0
]

This gives: x - 2y = 0, so x = 2y

Eigenvector: v₂ =

[
2
1
]

Step 5: Form diagonalization matrices

P = [v₁ v₂] =

[
1
2
1
1
]

D =

[
2
0
0
3
]

A = PDP⁻¹ where P =
[
1
2
1
1
]
, D =
[
2
0
0
3
]
Final answer:

A = PDP⁻¹ with distinct eigenvalues λ₁ = 2, λ₂ = 3

Applied rules:

• Characteristic equation: Set det(A - λI) = 0

• Eigenvector equation: Solve (A - λI)v = 0

• Distinct eigenvalues: Guarantee diagonalizability

2 3x3 Matrix Diagonalization
Exercise 2
Diagonalize: A =
[
2
0
0
1
3
0
-1
0
1
]
Definition:

3x3 Diagonalization: Same process extended to higher dimensions

Step 1: Find characteristic polynomial

det(A - λI) = det

[
2-λ
0
0
1
3-λ
0
-1
0
1-λ
]

Since this is lower triangular matrix, determinant is product of diagonal: (2-λ)(3-λ)(1-λ)

Step 2: Find eigenvalues

(2-λ)(3-λ)(1-λ) = 0 → λ₁ = 2, λ₂ = 3, λ₃ = 1

Step 3: Find eigenvector for λ₁ = 2

(A - 2I)v = 0 →

[
0
0
0
1
1
0
-1
0
-1
]
[
x
y
z
]
=
[
0
0
0
]

This gives: x + y = 0 and -x - z = 0, so y = -x and z = -x

Eigenvector: v₁ =

[
1
-1
-1
]

Step 4: Find eigenvector for λ₂ = 3

(A - 3I)v = 0 →

[
-1
0
0
1
0
0
-1
0
-2
]
[
x
y
z
]
=
[
0
0
0
]

This gives: -x = 0 and -x - 2z = 0, so x = 0 and z = 0

Eigenvector: v₂ =

[
0
1
0
]

Step 5: Find eigenvector for λ₃ = 1

(A - I)v = 0 →

[
1
0
0
1
2
0
-1
0
0
]
[
x
y
z
]
=
[
0
0
0
]

This gives: x = 0 and x + 2y = 0, so x = 0 and y = 0

Eigenvector: v₃ =

[
0
0
1
]

P =
[
1
0
0
-1
1
0
-1
0
1
]
, D =
[
2
0
0
0
3
0
0
0
1
]
Final answer:

A = PDP⁻¹ with 3 distinct eigenvalues, so A is diagonalizable

Applied rules:

• Triangular matrix: Eigenvalues are diagonal entries

• Systematic solving: Solve (A - λI)v = 0 for each eigenvalue

• Linear independence: Verify eigenvectors are independent

3 Verification Exercise
Exercise 3
Verify that the matrices P and D from Exercise 1 satisfy A = PDP⁻¹
Definition:

Verification: Confirm diagonalization by computing PDP⁻¹ and comparing to A

Step 1: Recall matrices from Exercise 1

P =

[
1
2
1
1
]
, D =
[
2
0
0
3
]

Step 2: Compute P⁻¹

det(P) = (1)(1) - (2)(1) = 1 - 2 = -1

P⁻¹ = (1/-1)

[
1
-2
-1
1
]
=
[
-1
2
1
-1
]

Step 3: Compute PDP⁻¹

First compute PD:

[
1
2
1
1
]
[
2
0
0
3
]
=
[
2
6
2
3
]

Then compute (PD)P⁻¹:

[
2
6
2
3
]
[
-1
2
1
-1
]

=

[
2×(-1) + 6×1
2×2 + 6×(-1)
2×(-1) + 3×1
2×2 + 3×(-1)
]
=
[
4
-2
1
1
]

PDP⁻¹ =
[
4
-2
1
1
]
= A ✓
Final answer:

PDP⁻¹ = A, confirming our diagonalization is correct

Applied rules:

• Matrix inverse: P⁻¹ = (1/det(P)) × adjugate(P)

• Verification: Essential to confirm correctness

• Associativity: (AB)C = A(BC) allows step-by-step computation

Solution: Exercises 4 to 5
4 Non-Diagonalizable Matrix
Exercise 4
Show that A =
[
2
1
0
2
]
is not diagonalizable
Definition:

Non-diagonalizable Matrix: Matrix that doesn't have enough linearly independent eigenvectors

Step 1: Find characteristic polynomial

det(A - λI) = det

[
2-λ
1
0
2-λ
]
= (2-λ)²

Step 2: Find eigenvalues

(2-λ)² = 0 → λ = 2 (with algebraic multiplicity 2)

Step 3: Find eigenvectors for λ = 2

(A - 2I)v = 0 →

[
0
1
0
0
]
[
x
y
]
=
[
0
0
]

This gives: y = 0, so x can be any value

Eigenspace is span{

[
1
0
]
}, dimension = 1

Step 4: Determine diagonalizability

Algebraic multiplicity of λ = 2 is 2

Geometric multiplicity (dimension of eigenspace) is 1

Since algebraic multiplicity ≠ geometric multiplicity, A is not diagonalizable

Matrix A has eigenvalue λ = 2 with algebraic multiplicity 2 but geometric multiplicity 1, so it's not diagonalizable
Final answer:

A cannot be diagonalized because it lacks sufficient linearly independent eigenvectors

Applied rules:

• Algebraic multiplicity: Multiplicity of eigenvalue as root of characteristic polynomial

• Geometric multiplicity: Dimension of eigenspace

• Diagonalizability criterion: AM = GM for all eigenvalues

5 Matrix Powers Application
Exercise 5
Using the diagonalization from Exercise 1, compute A⁵ where A =
[
4
-2
1
1
]
Definition:

Matrix Powers via Diagonalization: A^n = PD^nP⁻¹ is much more efficient than repeated multiplication

Step 1: Recall diagonalization from Exercise 1

P =

[
1
2
1
1
]
, D =
[
2
0
0
3
]
, P⁻¹ =
[
-1
2
1
-1
]

Step 2: Compute D⁵

Since D is diagonal, D⁵ =

[
2⁵
0
0
3⁵
]
=
[
32
0
0
243
]

Step 3: Compute A⁵ = PD⁵P⁻¹

First compute PD⁵:

[
1
2
1
1
]
[
32
0
0
243
]
=
[
32
486
32
243
]

Then compute (PD⁵)P⁻¹:

[
32
486
32
243
]
[
-1
2
1
-1
]

=

[
32×(-1) + 486×1
32×2 + 486×(-1)
32×(-1) + 243×1
32×2 + 243×(-1)
]
=
[
454
-422
211
-179
]

A⁵ =
[
454
-422
211
-179
]
Final answer:

A⁵ computed efficiently using diagonalization

Applied rules:

• Power efficiency: A^n = PD^nP⁻¹ avoids n-1 matrix multiplications

• Diagonal powers: Just raise diagonal elements to power

• Practical application: Useful for dynamical systems and Markov chains

Questions & Answers

Question: I understand that diagonalization helps with matrix powers, but what's the geometric interpretation of eigenvalues and eigenvectors?

Answer: The geometric interpretation is beautiful and intuitive!

  • Eigenvectors: These are the "special directions" where the transformation A acts like a simple scaling
  • Eigenvalues: These are the "scaling factors" along each eigenvector direction
  • Diagonalization: It's essentially changing to a coordinate system where the transformation becomes pure scaling

In Exercise 1, the matrix A transforms space in general ways, but along the directions [1,1] and [2,1], it only stretches by factors of 2 and 3 respectively. The diagonalization A = PDP⁻¹ means: change to eigenvector coordinates (P⁻¹), scale by eigenvalues (D), then change back (P).

This is why diagonalization is so powerful - it reveals the "natural axes" of the transformation.

Question: In Exercise 4, you showed a matrix isn't diagonalizable. Are there other forms for such matrices?

Answer: Yes! When a matrix isn't diagonalizable, we use the Jordan Canonical Form:

  • Jordan form: A = PJP⁻¹ where J is block diagonal with Jordan blocks
  • Jordan blocks: Look like diagonal matrices but with 1's on superdiagonal for repeated eigenvalues
  • Every matrix: Has a Jordan form, diagonalizable matrices have 1×1 blocks

For Exercise 4's matrix A =

[
2
1
0
2
]
, this is already in Jordan form with one 2×2 Jordan block for eigenvalue λ = 2.

The Jordan form still provides computational advantages, though not as efficient as diagonal form.

Question: How do I quickly determine if a matrix is diagonalizable without going through all calculations?

Answer: Here are quick diagnostic tests for diagonalizability:

  1. Distinct eigenvalues: If all n eigenvalues are distinct, matrix is diagonalizable
  2. Symmetric matrices: Always diagonalizable (spectral theorem)
  3. Check multiplicity: For each eigenvalue, geometric multiplicity = algebraic multiplicity
  4. Trace and determinant: Sum of eigenvalues = trace(A), product = det(A)

For Exercise 1, we had distinct eigenvalues (2 and 3), so we knew it would be diagonalizable before computing eigenvectors. For Exercise 4, we had repeated eigenvalue with geometric multiplicity less than algebraic multiplicity, so we knew it wouldn't be diagonalizable.

These shortcuts save significant computation time!