Diagonalization

Definition and Overview

Concept

Diagonalization: process of finding a diagonal matrix D similar to a given square matrix A. Purpose: simplify matrix powers, computations, and reveal intrinsic structure.

Formal Definition

Matrix A ∈ ℝⁿˣⁿ is diagonalizable if ∃ invertible P such that P⁻¹AP = D, where D is diagonal.

Significance

Transforms linear operator into simpler form. Enables easy eigenvalue extraction and matrix function evaluation.

Eigenvalues and Eigenvectors

Eigenvalues

Definition: scalar λ satisfying det(A - λI) = 0. Represents scaling factor along eigenvector direction.

Eigenvectors

Nonzero vector v where Av = λv. Defines invariant directions of linear transformation.

Characteristic Polynomial

p(λ) = det(A - λI). Roots: eigenvalues of A. Degree n polynomial for n×n matrix.

Algebraic and Geometric Multiplicities

Algebraic multiplicity: multiplicity of eigenvalue as root of characteristic polynomial. Geometric multiplicity: dimension of eigenspace corresponding to λ.

Similarity Transformation

Definition

Matrices A and B are similar if ∃ invertible P such that B = P⁻¹AP.

Properties

Similarity preserves eigenvalues, determinant, trace, characteristic polynomial.

Purpose in Diagonalization

Use similarity to convert A to diagonal matrix D for which computations are simpler.

Diagonalizable Matrices

Definition

A matrix A is diagonalizable if it is similar to a diagonal matrix.

Condition

Diagonalizable ⇔ sum of geometric multiplicities equals n (dimension). Equivalently, A has n linearly independent eigenvectors.

Examples

Symmetric matrices over ℝ, matrices with distinct eigenvalues.

Non-Diagonalizable Cases

Defective matrices with fewer eigenvectors than eigenvalues' algebraic multiplicity.

Diagonalization Process

Step 1: Find Eigenvalues

Solve characteristic polynomial det(A - λI) = 0 to find λ₁, λ₂, ..., λₖ.

Step 2: Find Eigenvectors

For each λ, solve (A - λI)v = 0 for eigenvectors v.

Step 3: Form Matrix P

Construct P whose columns are the eigenvectors of A.

Step 4: Compute P⁻¹AP

Calculate P⁻¹AP to obtain diagonal matrix D with eigenvalues on diagonal.

Summary Formula

A = P D P⁻¹whereD = diag(λ₁, λ₂, ..., λₙ),P = [v₁ v₂ ... vₙ] eigenvectors matrix.

Spectral Theorem

Statement

Every real symmetric matrix is orthogonally diagonalizable: A = Q D Qᵀ with Q orthogonal.

Implications

Eigenvalues real, eigenvectors orthonormal. Simplifies quadratic forms and matrix decompositions.

Orthogonal Diagonalization

Matrix Q satisfies QᵀQ = I. Preservation of inner product in transformation.

Applications

Used in principal component analysis, optimization, quantum mechanics.

Applications

Matrix Powers

Compute Aⁿ efficiently using A = P D P⁻¹ ⇒ Aⁿ = P Dⁿ P⁻¹.

Matrix Functions

Functions f(A) defined via eigenvalues: f(A) = P f(D) P⁻¹.

Differential Equations

Solving systems of linear ODEs using diagonalization simplifies solutions.

Quantum Mechanics

Observables represented by diagonalizable operators; eigenvalues correspond to measurable quantities.

Data Analysis

Principal component analysis relies on diagonalization of covariance matrices.

Examples

Example 1: Distinct Eigenvalues

Matrix A with eigenvalues 2, 3, 4; eigenvectors found; diagonalization straightforward.

Example 2: Symmetric Matrix

Real symmetric matrix diagonalized using orthogonal transformation.

Example 3: Defective Matrix

Matrix with repeated eigenvalue but insufficient eigenvectors, not diagonalizable.

Example 4: Diagonalization of a 2x2 Matrix

A = [4 1 0 2]Eigenvalues: λ₁=4, λ₂=2Eigenvectors: v₁=[1,0]ᵀ, v₂=[1,-2]ᵀP = [1 1 0 -2]D = diag(4, 2)Check: P⁻¹AP = D

Limitations and Non-Diagonalizable Cases

Defective Matrices

Insufficient eigenvectors to form basis. Cannot diagonalize.

Jordan Normal Form

Generalization of diagonalization using Jordan blocks when diagonalization not possible.

Complex Eigenvalues

Real matrices with complex eigenvalues require complex diagonalization or real Jordan form.

Numerical Issues

Rounding errors can affect eigenvalues and eigenvectors computation.

Computational Aspects

Algorithms

QR algorithm, power iteration, and Jacobi method for eigenvalue/eigenvector computation.

Complexity

Matrix diagonalization typically O(n³) operations for n×n matrix.

Software Tools

MATLAB, NumPy, Mathematica provide built-in functions for diagonalization.

Stability

Well-conditioned matrices yield reliable diagonalization; ill-conditioned require caution.

Common Mistakes

Assuming Diagonalizability

Not all matrices diagonalizable; check eigenvector count.

Confusing Algebraic and Geometric Multiplicities

Must verify geometric multiplicity equals algebraic multiplicity for each eigenvalue.

Ignoring Complex Eigenvalues

Real matrices can have complex eigenvalues; affects diagonalization over ℝ.

Incorrect Matrix P Construction

Order and completeness of eigenvectors crucial for correct P.

References

• G. Strang, "Linear Algebra and Its Applications," 4th ed., Brooks Cole, 2006, pp. 271-320.
• S. Axler, "Linear Algebra Done Right," 3rd ed., Springer, 2015, pp. 112-150.
• K. Hoffman and R. Kunze, "Linear Algebra," 2nd ed., Prentice Hall, 1971, pp. 214-260.
• R. A. Horn and C. R. Johnson, "Matrix Analysis," 2nd ed., Cambridge University Press, 2012, pp. 135-190.
• D. C. Lay, "Introduction to Linear Algebra," 5th ed., Pearson, 2015, pp. 345-390.