What is Diagonalization?
You'll learn: How to represent a matrix in a simpler form by writing it as PDP⁻¹, where D is diagonal.
The Core Idea
Diagonalization is a way of transforming a matrix into its simplest possible form. If a matrix A can be written as A = PDP⁻¹, where D is a diagonal matrix (one with non-zero entries only on its main diagonal), we say A is diagonalizable.
Think of it like this: imagine you have a complicated machine that performs transformations. Diagonalization is like finding a special coordinate system where that same machine just stretches or shrinks things along perpendicular axes—no rotation, no mixing. The matrix P represents the "change of coordinates," D tells you the stretching factors, and P⁻¹ brings you back.
Why Does This Matter?
When A = PDP⁻¹:
- P is a matrix whose columns are eigenvectors of A
- D is a diagonal matrix whose diagonal entries are the corresponding eigenvalues
- P⁻¹ is the inverse of P
This only works when A has "enough" eigenvectors—specifically, when A has a complete set of linearly independent eigenvectors. If you can find n independent eigenvectors for an n×n matrix, you can diagonalize it.
When Can We Diagonalize?
Not every matrix can be diagonalized. The key requirement: A must have n linearly independent eigenvectors (where n is the size of the matrix). This happens automatically when all eigenvalues are distinct, but can also occur with repeated eigenvalues if the geometric multiplicity equals the algebraic multiplicity for each.
Key Takeaway: Diagonalization rewrites a matrix A as PDP⁻¹ using eigenvectors (columns of P) and eigenvalues (diagonal of D), simplifying computations like powers and exponentials dramatically.