Solved Exercises on Characteristic Equation and Diagonalization Basics

Master characteristic equation and diagonalization: finding eigenvalues, diagonalizing matrices, and properties of diagonalizable matrices through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Characteristic Equation
Exercise 1
Find the characteristic equation and eigenvalues of A = \(\begin{bmatrix} 4 & -2 \\ 1 & 1 \end{bmatrix}\).
Definition:

Characteristic equation: det(A - λI) = 0, where I is the identity matrix

Method:
  1. Form the characteristic matrix A - λI
  2. Calculate the determinant: det(A - λI)
  3. Solve the characteristic equation: det(A - λI) = 0
Characteristic matrix
A - λI = \(\begin{bmatrix} 4-λ & -2 \\ 1 & 1-λ \end{bmatrix}\)
Eigenvalues
λ₁ = 3, λ₂ = 2
Step 1: Form the characteristic matrix

A - λI = \(\begin{bmatrix} 4 & -2 \\ 1 & 1 \end{bmatrix} - λ\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix}\)

= \(\begin{bmatrix} 4-λ & -2 \\ 1 & 1-λ \end{bmatrix}\)

Step 2: Calculate the determinant

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

= (4-λ)(1-λ) + 2

= 4 - 4λ - λ + λ² + 2

= λ² - 5λ + 6

Step 3: Form the characteristic equation

λ² - 5λ + 6 = 0

Step 4: Solve the characteristic equation

λ² - 5λ + 6 = 0

Factor: (λ - 3)(λ - 2) = 0

So: λ₁ = 3, λ₂ = 2

Step 5: Verify using trace and determinant

Trace(A) = 4 + 1 = 5 = λ₁ + λ₂ = 3 + 2 ✓

det(A) = (4)(1) - (-2)(1) = 4 + 2 = 6 = λ₁ × λ₂ = 3 × 2 ✓

Characteristic equation: λ² - 5λ + 6 = 0
Eigenvalues: λ₁ = 3, λ₂ = 2
Final answer:

The characteristic equation is λ² - 5λ + 6 = 0 with eigenvalues λ₁ = 3 and λ₂ = 2

Applied rules:

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

• Trace property: Sum of eigenvalues equals trace

• Determinant property: Product of eigenvalues equals determinant

2 Diagonalization Process
Exercise 2
Diagonalize the matrix A = \(\begin{bmatrix} 4 & -2 \\ 1 & 1 \end{bmatrix}\) from Exercise 1 by finding matrices P and D such that A = PDP⁻¹.
Definition:

Diagonalization: A = PDP⁻¹ where D is diagonal matrix of eigenvalues and P has eigenvectors as columns

Eigenvector for λ₁ = 3
v₁ = \(\begin{bmatrix} 2 \\ 1 \end{bmatrix}\)
Eigenvector for λ₂ = 2
v₂ = \(\begin{bmatrix} 1 \\ 1 \end{bmatrix}\)
Step 1: Find eigenvector for λ₁ = 3

Solve (A - 3I)v = 0

\(\begin{bmatrix} 4-3 & -2 \\ 1 & 1-3 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}\)

\(\begin{bmatrix} 1 & -2 \\ 1 & -2 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}\)

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

Choose y = 1, so x = 2: v₁ = \(\begin{bmatrix} 2 \\ 1 \end{bmatrix}\)

Step 2: Find eigenvector for λ₂ = 2

Solve (A - 2I)v = 0

\(\begin{bmatrix} 4-2 & -2 \\ 1 & 1-2 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}\)

\(\begin{bmatrix} 2 & -2 \\ 1 & -1 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}\)

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

Choose x = 1, so y = 1: v₂ = \(\begin{bmatrix} 1 \\ 1 \end{bmatrix}\)

Step 3: Form the diagonalization matrices

P = [v₁ v₂] = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\)

D = \(\begin{bmatrix} 3 & 0 \\ 0 & 2 \end{bmatrix}\) (diagonal matrix with eigenvalues)

Step 4: Calculate P⁻¹

For P = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\):

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

P⁻¹ = \(\frac{1}{1}\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix} = \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)

Step 5: Verify A = PDP⁻¹

PDP⁻¹ = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} 3 & 0 \\ 0 & 2 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)

= \(\begin{bmatrix} 6 & 2 \\ 3 & 2 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)

= \(\begin{bmatrix} 6-2 & -6+4 \\ 3-2 & -3+4 \end{bmatrix} = \begin{bmatrix} 4 & -2 \\ 1 & 1 \end{bmatrix} = A\) ✓

P = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\), D = \(\begin{bmatrix} 3 & 0 \\ 0 & 2 \end{bmatrix}\)
Final answer:

A = PDP⁻¹ where P = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\) and D = \(\begin{bmatrix} 3 & 0 \\ 0 & 2 \end{bmatrix}\)

Applied rules:

• Diagonalization: A = PDP⁻¹

• Eigenvector matrix: P has eigenvectors as columns

• Diagonal matrix: D has eigenvalues on diagonal

3 Non-Diagonalizable Matrix
Exercise 3
Show that A = \(\begin{bmatrix} 2 & 1 \\ 0 & 2 \end{bmatrix}\) is not diagonalizable by finding its eigenvalues and eigenvectors.
Definition:

Diagonalizable matrix: Matrix with n linearly independent eigenvectors for n×n matrix

Eigenvalue
λ = 2 (multiplicity 2)
Eigenvectors
Only one linearly independent eigenvector
Step 1: Find the characteristic equation

A - λI = \(\begin{bmatrix} 2-λ & 1 \\ 0 & 2-λ \end{bmatrix}\)

det(A - λI) = (2-λ)² = 0

So λ = 2 with algebraic multiplicity 2

Step 2: Find eigenvectors for λ = 2

(A - 2I)v = 0

\(\begin{bmatrix} 0 & 1 \\ 0 & 0 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}\)

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

So all eigenvectors are of the form \(\begin{bmatrix} x \\ 0 \end{bmatrix} = x\begin{bmatrix} 1 \\ 0 \end{bmatrix}\)

Step 3: Count linearly independent eigenvectors

There is only one linearly independent eigenvector: \(\begin{bmatrix} 1 \\ 0 \end{bmatrix}\)

For a 2×2 matrix to be diagonalizable, we need 2 linearly independent eigenvectors

Step 4: Determine geometric multiplicity

The geometric multiplicity of λ = 2 is 1 (dimension of eigenspace)

Since geometric multiplicity (1) ≠ algebraic multiplicity (2), the matrix is not diagonalizable

Step 5: Geometric interpretation

This matrix represents a shear transformation combined with scaling

It has only one direction (the x-axis) that is preserved under the transformation

Such matrices are called defective matrices

λ = 2 (algebraic multiplicity 2), geometric multiplicity 1
Matrix is not diagonalizable
Final answer:

Matrix A is not diagonalizable because it has only one linearly independent eigenvector

Applied rules:

• Diagonalizability condition: n linearly independent eigenvectors for n×n matrix

• Algebraic vs geometric multiplicity: Must be equal for diagonalizability

• Defective matrix: Has fewer eigenvectors than algebraic multiplicity

Characteristic Equation and Diagonalization
\text{det}(A - \lambda I) = 0
Characteristic Equation
Formula
A = PDP^{-1}
Diagonalization
Property
\text{tr}(A) = \sum \lambda_i
Trace Property
Property
\text{det}(A) = \prod \lambda_i
Determinant Property
Diagonalization condition: n linearly independent eigenvectors for n×n matrix
Algebraic multiplicity: Root multiplicity of characteristic polynomial
Geometric multiplicity: Dimension of eigenspace (number of lin. indep. eigenvectors)
Solution: Exercises 4 to 5
4 Powers of Diagonalizable Matrix
Exercise 4
Using the diagonalization from Exercise 2, find A⁵ where A = \(\begin{bmatrix} 4 & -2 \\ 1 & 1 \end{bmatrix}\).
Definition:

Matrix powers: If A = PDP⁻¹, then Aⁿ = PDⁿP⁻¹ where Dⁿ has eigenvalues raised to nth power

A = PDP⁻¹
P = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\), D = \(\begin{bmatrix} 3 & 0 \\ 0 & 2 \end{bmatrix}\)
A⁵ = PD⁵P⁻¹
D⁵ = \(\begin{bmatrix} 243 & 0 \\ 0 & 32 \end{bmatrix}\)
Step 1: Recall the diagonalization from Exercise 2

A = PDP⁻¹ where:

P = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\), D = \(\begin{bmatrix} 3 & 0 \\ 0 & 2 \end{bmatrix}\), P⁻¹ = \(\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)

Step 2: Calculate D⁵

For a diagonal matrix, raising to a power means raising each diagonal element to that power:

D⁵ = \(\begin{bmatrix} 3^5 & 0 \\ 0 & 2^5 \end{bmatrix} = \begin{bmatrix} 243 & 0 \\ 0 & 32 \end{bmatrix}\)

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

A⁵ = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} 243 & 0 \\ 0 & 32 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)

= \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} 243 & 0 \\ 0 & 32 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)

= \(\begin{bmatrix} 486 & 32 \\ 243 & 32 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)

= \(\begin{bmatrix} 486-32 & -486+64 \\ 243-32 & -243+64 \end{bmatrix}\)

= \(\begin{bmatrix} 454 & -422 \\ 211 & -179 \end{bmatrix}\)

Step 4: Verify by direct computation

We could compute A⁵ directly, but that would require 4 matrix multiplications

Using diagonalization, we only needed to raise scalars to the 5th power

Step 5: Generalize the pattern

For any power Aⁿ: Aⁿ = P\(\begin{bmatrix} 3^n & 0 \\ 0 & 2^n \end{bmatrix}\)P⁻¹

This shows the computational advantage of diagonalization

A⁵ = \(\begin{bmatrix} 454 & -422 \\ 211 & -179 \end{bmatrix}\)
Final answer:

A⁵ = \(\begin{bmatrix} 454 & -422 \\ 211 & -179 \end{bmatrix}\)

Applied rules:

• Matrix powers: Aⁿ = PDⁿP⁻¹ when A = PDP⁻¹

• Diagonal matrix powers: Raise diagonal elements to power

• Computational efficiency: Diagonalization greatly simplifies power calculations

5 Symmetric Matrix Diagonalization
Exercise 5
Diagonalize the symmetric matrix S = \(\begin{bmatrix} 3 & 1 \\ 1 & 3 \end{bmatrix}\) and verify that the eigenvectors are orthogonal.
Definition:

Symmetric matrix: Matrix where Aᵀ = A, always has real eigenvalues and orthogonal eigenvectors

Eigenvalues
λ₁ = 4, λ₂ = 2
Eigenvectors
v₁ = \(\begin{bmatrix} 1 \\ 1 \end{bmatrix}\), v₂ = \(\begin{bmatrix} 1 \\ -1 \end{bmatrix}\)
Step 1: Find the characteristic equation

S - λI = \(\begin{bmatrix} 3-λ & 1 \\ 1 & 3-λ \end{bmatrix}\)

det(S - λI) = (3-λ)² - 1 = 9 - 6λ + λ² - 1 = λ² - 6λ + 8

λ² - 6λ + 8 = 0

(λ - 4)(λ - 2) = 0

So λ₁ = 4, λ₂ = 2

Step 2: Find eigenvector for λ₁ = 4

(S - 4I)v = 0

\(\begin{bmatrix} -1 & 1 \\ 1 & -1 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}\)

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

Choose x = 1: v₁ = \(\begin{bmatrix} 1 \\ 1 \end{bmatrix}\)

Step 3: Find eigenvector for λ₂ = 2

(S - 2I)v = 0

\(\begin{bmatrix} 1 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} = \begin{bmatrix} 0 \\ 0 \end{bmatrix}\)

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

Choose x = 1: v₂ = \(\begin{bmatrix} 1 \\ -1 \end{bmatrix}\)

Step 4: Verify orthogonality of eigenvectors

v₁ · v₂ = (1)(1) + (1)(-1) = 1 - 1 = 0

Since the dot product is zero, the eigenvectors are orthogonal ✓

Step 5: Form the diagonalization

P = [v₁ v₂] = \(\begin{bmatrix} 1 & 1 \\ 1 & -1 \end{bmatrix}\)

D = \(\begin{bmatrix} 4 & 0 \\ 0 & 2 \end{bmatrix}\)

Since eigenvectors are orthogonal, we can normalize them to get an orthogonal matrix

P = \(\begin{bmatrix} 1/\sqrt{2} & 1/\sqrt{2} \\ 1/\sqrt{2} & -1/\sqrt{2} \end{bmatrix}\) (orthogonal matrix)

For symmetric matrices: A = PDPᵀ where P is orthogonal

S = PDPᵀ where P = \(\begin{bmatrix} 1/\sqrt{2} & 1/\sqrt{2} \\ 1/\sqrt{2} & -1/\sqrt{2} \end{bmatrix}\), D = \(\begin{bmatrix} 4 & 0 \\ 0 & 2 \end{bmatrix}\)
Final answer:

For symmetric matrix S, eigenvectors are orthogonal and S = PDPᵀ

Applied rules:

• Symmetric matrix property: Always diagonalizable with orthogonal eigenvectors

• Orthogonal diagonalization: A = PDPᵀ for symmetric A

• Real eigenvalues: Symmetric matrices have real eigenvalues

Characteristic Equation and Diagonalization: Comprehensive Guide
\text{det}(A - \lambda I) = 0
Characteristic Equation
Key definitions:

Characteristic equation: det(A - λI) = 0, whose roots are eigenvalues of A

Diagonalizable matrix: Matrix A such that A = PDP⁻¹ where D is diagonal

Algebraic multiplicity: Number of times an eigenvalue appears as a root of characteristic equation

Geometric multiplicity: Dimension of eigenspace for an eigenvalue

Complete methodology:
  1. Find characteristic equation: det(A - λI) = 0
  2. Solve for eigenvalues: Find roots of characteristic polynomial
  3. Find eigenvectors: For each eigenvalue λ, solve (A - λI)v = 0
  4. Check diagonalizability: Verify n linearly independent eigenvectors for n×n matrix
  5. Form diagonalization: A = PDP⁻¹
Tip 1: For 2×2 matrices, characteristic polynomial is λ² - (trace)λ + (determinant) = 0.
Tip 2: Symmetric matrices are always diagonalizable with orthogonal eigenvectors.
Tip 3: If algebraic multiplicity ≠ geometric multiplicity for any eigenvalue, matrix is not diagonalizable.
Tip 4: Diagonalization makes computing matrix powers much easier: Aⁿ = PDⁿP⁻¹.
Common errors: Miscalculating characteristic polynomial, missing complex eigenvalues, assuming all matrices are diagonalizable.
Exam preparation: Master 2×2 and 3×3 diagonalization, understand when matrices aren't diagonalizable.
Properties to know by heart:

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

• Trace property: Sum of eigenvalues = trace(A)

• Determinant property: Product of eigenvalues = det(A)

• Diagonalizability: n linearly independent eigenvectors for n×n matrix

• Algebraic vs geometric: geom ≤ alg for each eigenvalue

• Symmetric matrices: Always diagonalizable with orthogonal eigenvectors

• Matrix powers: Aⁿ = PDⁿP⁻¹ when A = PDP⁻¹

Diagonalization Properties Visualization
Exercise 6: Property Analysis
Visual analysis of diagonalization properties:
• Characteristic polynomial roots
• Diagonalizability conditions
• Matrix power computations

Analysis: The visualization shows how different matrix properties affect diagonalization.

  • Real eigenvalues are necessary for diagonalization over reals
  • Independent eigenvectors are sufficient for diagonalization
  • Symmetric matrices always diagonalizable

Questions & Answers

Question: What's the difference between algebraic and geometric multiplicity? Why is this important for diagonalization?

Answer: The concepts are crucial for understanding diagonalization:

Algebraic multiplicity:

  • How many times an eigenvalue appears as a root of the characteristic polynomial
  • Counted with multiplicity: if (λ - 2)³ appears in the characteristic polynomial, eigenvalue 2 has algebraic multiplicity 3

Geometric multiplicity:

  • Dimension of the eigenspace for that eigenvalue
  • Number of linearly independent eigenvectors for that eigenvalue
  • Equals the nullity of (A - λI)

Relationship:

For any eigenvalue: geometric multiplicity ≤ algebraic multiplicity

Diagonalization condition:

A matrix is diagonalizable if and only if, for every eigenvalue, geometric multiplicity equals algebraic multiplicity.

This ensures we have enough linearly independent eigenvectors to form the diagonalizing matrix P.

Question: Why is diagonalization useful? What advantages does it provide?

Answer: Diagonalization provides significant computational and theoretical advantages:

Matrix powers:

Instead of computing Aⁿ through repeated multiplication, we use Aⁿ = PDⁿP⁻¹

Computing Dⁿ is trivial since D is diagonal (just raise each diagonal element to the power n)

Matrix exponentials:

For eᴬ = I + A + A²/2! + A³/3! + ..., if A = PDP⁻¹, then eᴬ = PeᴰP⁻¹

Computing eᴰ is straightforward since D is diagonal

Solving differential equations:

Systems of linear differential equations become easier when the coefficient matrix is diagonalizable

Understanding transformations:

Diagonalization reveals the fundamental directions (eigenvectors) and scaling factors (eigenvalues) of the transformation

Principal component analysis:

Essential in statistics and machine learning for dimensionality reduction

Diagonalization essentially finds the "natural coordinate system" for a linear transformation.

Question: What are the practical applications of diagonalization?

Answer: Diagonalization has extensive practical applications:

  • Physics: Solving systems of differential equations, analyzing coupled oscillators
  • Computer Graphics: Principal component analysis for data compression
  • Machine Learning: PCA, spectral clustering, dimensionality reduction
  • Finance: Portfolio optimization and risk analysis
  • Quantum Mechanics: Finding energy eigenstates
  • Network Analysis: Centrality measures and community detection
  • Image Processing: Compression algorithms like JPEG

Specific examples:

In Google's PageRank algorithm, the dominant eigenvector of a stochastic matrix determines web page importance.

In structural engineering, eigenvalues represent natural frequencies of vibration and eigenvectors represent mode shapes.

In data science, diagonalization of covariance matrices enables principal component analysis, which reduces high-dimensional data to its most important features.

The concept is fundamental because it identifies the most important directions in data or systems, providing a way to understand complex behaviors in terms of simpler, fundamental components.