What does it mean for a matrix to be diagonalizable?

A matrix A is diagonalizable if A = PDP⁻¹ where D is diagonal (eigenvalues on diagonal) and P has eigenvectors as columns. This means there exists a basis of eigenvectors, and in that basis the transformation acts by pure scaling along each axis.

How do you diagonalize a matrix?

Find all eigenvalues from det(A - λI) = 0. For each eigenvalue, find eigenvectors by solving (A - λI)v = 0. Place eigenvectors as columns of P and corresponding eigenvalues on diagonal of D. Verify AP = PD.

How does diagonalization simplify matrix powers?

A^k = PD^kP⁻¹ = P·diag(λ₁^k, λ₂^k, ..., λₙ^k)·P⁻¹. Raising D to any power just raises each diagonal entry. Computing A^1000 costs the same as A² — one inversion and two multiplications.

How does diagonalization solve differential equations?

For x' = Ax, diagonalization decouples the system into n independent equations yᵢ' = λᵢyᵢ with solutions e^(λᵢt). The general solution is x(t) = c₁e^(λ₁t)v₁ + c₂e^(λ₂t)v₂ + ... + cₙe^(λₙt)vₙ.

How does diagonalization solve recurrence relations?

For xₙ₊₁ = Axₙ, diagonalization gives xₙ = c₁λ₁ⁿv₁ + c₂λ₂ⁿv₂ + ... The Fibonacci sequence uses this: the matrix [[1,1],[1,0]] diagonalizes to give Binet's formula Fₙ = (φⁿ - φ̂ⁿ)/√5.

What is the spectral theorem for symmetric matrices?

Every real symmetric matrix is diagonalizable with an orthogonal matrix: A = QDQᵀ where Q is orthogonal (Q⁻¹ = Qᵀ) with orthonormal eigenvector columns. All eigenvalues are real. This is the most powerful diagonalization result.

What happens when a matrix is not diagonalizable?

Non-diagonalizable (defective) matrices have Jordan normal form instead — block diagonal with Jordan blocks containing 1s on the superdiagonal. Powers and exponentials still compute but with polynomial correction terms (t^k·e^(λt) instead of just e^(λt)).

What are quick tests for diagonalizability?

n distinct eigenvalues → always diagonalizable. Real symmetric → always diagonalizable (orthogonally). For each eigenvalue: geometric = algebraic multiplicity → diagonalizable. Any eigenvalue with geometric < algebraic → not diagonalizable.

Diagonalization

Q: When is a matrix diagonalizable?

A matrix is diagonalizable iff geometric multiplicity equals algebraic multiplicity for every eigenvalue. A sufficient (not necessary) condition: n distinct eigenvalues guarantees diagonalizability. Symmetric matrices are always diagonalizable.

Q: What is the matrix exponential for diagonalizable matrices?

e^(At) = Pe^(Dt)P⁻¹ = P·diag(e^(λ₁t), e^(λ₂t), ..., e^(λₙt))·P⁻¹. The exponential of a diagonal matrix is the diagonal matrix of exponentials. This solves x' = Ax via x(t) = e^(At)x₀.

What Diagonalization Means

Constructing the Diagonalization

When Is a Matrix Diagonalizable?

Matrix Powers

Systems of Differential Equations

Recurrence Relations

The Spectral Theorem for Symmetric Matrices

Matrix Exponential

When Diagonalization Fails

Diagonalizability at a Glance

Reducing a Matrix to Its Eigenvalue Skeleton

A diagonalizable matrix can be factored as PDP⁻¹, where D is the diagonal matrix of eigenvalues and P is the matrix of eigenvectors. This factorization strips away the complexity of the original matrix, reducing powers, exponentials, and differential equations to operations on individual eigenvalues. Diagonalization is possible when and only when the eigenvectors form a basis — and for symmetric matrices, this is always the case.

What Diagonalization Means

n \times n

matrix

A

is diagonalizable if there exists an invertible matrix

P

and a diagonal matrix

D

such that

A = PDP^{-1}

The columns of

P

are eigenvectors of

A

. The diagonal entries of

D

are the corresponding eigenvalues, in the same order. The factorization says that in the basis of eigenvectors, the transformation acts by pure scaling along each axis — the most transparent possible description.

Equivalently,

A

is diagonalizable if and only if

\mathbb{R}^n

has a basis consisting entirely of eigenvectors of

A

. The matrix

P

converts between the standard basis and this eigenvector basis, and

D

is the matrix of the transformation in the eigenvector basis.

Constructing the Diagonalization

The procedure has three steps.

Find all eigenvalues by solving the characteristic equation

\det(A - \lambda I) = 0

.

For each eigenvalue

\lambda_i

, find a basis for the eigenspace by solving

(A - \lambda_i I)\mathbf{v} = \mathbf{0}

via row reduction.

Assemble

P

and

D

. Place the eigenvectors as columns of

P

and the corresponding eigenvalues on the diagonal of

D

in matching order.

Worked Example

For

A = \begin{pmatrix} 1 & 2 \\ 4 & 3 \end{pmatrix}

, the characteristic polynomial is

\lambda^2 - 4\lambda - 5 = (\lambda - 5)(\lambda + 1)

. Eigenvalues:

\lambda_1 = 5

\lambda_2 = -1

.

For

\lambda_1 = 5

: eigenvector

\mathbf{v}_1 = (1, 2)^T

. For

\lambda_2 = -1

: eigenvector

\mathbf{v}_2 = (-1, 1)^T

P = \begin{pmatrix} 1 & -1 \\ 2 & 1 \end{pmatrix}, \quad D = \begin{pmatrix} 5 & 0 \\ 0 & -1 \end{pmatrix}

Verification:

AP = \begin{pmatrix} 5 & 1 \\ 10 & -1 \end{pmatrix} = PD = \begin{pmatrix} 1 & -1 \\ 2 & 1 \end{pmatrix}\begin{pmatrix} 5 & 0 \\ 0 & -1 \end{pmatrix} = \begin{pmatrix} 5 & 1 \\ 10 & -1 \end{pmatrix}

When Is a Matrix Diagonalizable?

The definitive condition is:

A

is diagonalizable if and only if for every eigenvalue, the geometric multiplicity equals the algebraic multiplicity (

m_g(\lambda) = m_a(\lambda)

).

A sufficient condition that is easier to check: if

A

has

n

distinct eigenvalues, it is automatically diagonalizable. Eigenvectors for distinct eigenvalues are linearly independent, so

n

distinct eigenvalues produce

n

independent eigenvectors — exactly enough for a basis.

When eigenvalues repeat, diagonalizability depends on the eigenspaces. A repeated eigenvalue

\lambda

with algebraic multiplicity

k

must have a

k

-dimensional eigenspace. If the eigenspace falls short — dimension less than

k

— there are not enough eigenvectors, and the matrix cannot be diagonalized.

Example of Failure

A = \begin{pmatrix} 2 & 1 \\ 0 & 2 \end{pmatrix}

has eigenvalue

\lambda = 2

with

m_a = 2

, but

A - 2I = \begin{pmatrix} 0 & 1 \\ 0 & 0 \end{pmatrix}

has null space of dimension

1

. Only one independent eigenvector exists, so

P

cannot be built. The matrix is defective.

Matrix Powers

The primary computational payoff of diagonalization is the simplification of matrix powers:

A^k = PD^kP^{-1} = P\,\text{diag}(\lambda_1^k, \lambda_2^k, \dots, \lambda_n^k)\,P^{-1}

Raising a diagonal matrix to a power means raising each diagonal entry independently. The entire cost of

A^k

, for any

k

, is one matrix inversion and two matrix multiplications — the same cost regardless of whether

k

2

2

million.

Worked Example

Using the diagonalization from section

2

P^{-1} = \frac{1}{3}\begin{pmatrix} 1 & 1 \\ -2 & 1 \end{pmatrix}

A^4 = P\begin{pmatrix} 5^4 & 0 \\ 0 & (-1)^4 \end{pmatrix}P^{-1} = \begin{pmatrix} 1 & -1 \\ 2 & 1 \end{pmatrix}\begin{pmatrix} 625 & 0 \\ 0 & 1 \end{pmatrix}\frac{1}{3}\begin{pmatrix} 1 & 1 \\ -2 & 1 \end{pmatrix}

= \frac{1}{3}\begin{pmatrix} 625 & -1 \\ 1250 & 1 \end{pmatrix}\begin{pmatrix} 1 & 1 \\ -2 & 1 \end{pmatrix} = \frac{1}{3}\begin{pmatrix} 627 & 624 \\ 1248 & 1251 \end{pmatrix} = \begin{pmatrix} 209 & 208 \\ 416 & 417 \end{pmatrix}

Without diagonalization, computing

A^4

requires three sequential matrix multiplications.

Systems of Differential Equations

The linear system

\mathbf{x}' = A\mathbf{x}

has a clean solution when

A

is diagonalizable. In the eigenvector basis, the system decouples into

n

independent scalar equations

y_i' = \lambda_i y_i

, each with solution

y_i(t) = c_i e^{\lambda_i t}

.

Converting back to the original basis, the general solution is

\mathbf{x}(t) = c_1 e^{\lambda_1 t}\mathbf{v}_1 + c_2 e^{\lambda_2 t}\mathbf{v}_2 + \cdots + c_n e^{\lambda_n t}\mathbf{v}_n

Each eigenvalue determines the behavior along its eigenvector direction. Positive eigenvalues produce exponential growth, negative eigenvalues produce decay, and zero eigenvalues produce constant components. Complex eigenvalues produce oscillatory terms involving sines and cosines modulated by exponential envelopes.

The constants

c_1, \dots, c_n

are determined by the initial condition

\mathbf{x}(0)

: express

\mathbf{x}(0)

as a linear combination of the eigenvectors and read off the coefficients.

Recurrence Relations

The discrete system

\mathbf{x}_{n+1} = A\mathbf{x}_n

has solution

\mathbf{x}_n = A^n\mathbf{x}_0

. When

A

is diagonalizable, this becomes

\mathbf{x}_n = PD^nP^{-1}\mathbf{x}_0 = c_1 \lambda_1^n \mathbf{v}_1 + c_2 \lambda_2^n \mathbf{v}_2 + \cdots + c_n \lambda_n^n \mathbf{v}_n

The dominant eigenvalue — the eigenvalue with the largest absolute value — determines the long-term growth rate. As

n \to \infty

, the term

c_i \lambda_i^n \mathbf{v}_i

with the largest

|\lambda_i|

dominates all others.

The Fibonacci sequence provides a classic application. The recurrence

F_{n+1} = F_n + F_{n-1}

translates to

\begin{pmatrix} F_{n+1} \\ F_n \end{pmatrix} = \begin{pmatrix} 1 & 1 \\ 1 & 0 \end{pmatrix}^n \begin{pmatrix} 1 \\ 0 \end{pmatrix}

. The matrix has eigenvalues

\phi = \frac{1 + \sqrt{5}}{2}

and

\hat{\phi} = \frac{1 - \sqrt{5}}{2}

. Diagonalization gives the Binet formula:

F_n = \frac{\phi^n - \hat{\phi}^n}{\sqrt{5}}

, a closed-form expression for the

n

-th Fibonacci number.

The Spectral Theorem for Symmetric Matrices

Every real symmetric matrix is diagonalizable. This is guaranteed — no conditions need to be checked.

The result is stronger than ordinary diagonalizability. The diagonalizing matrix

P

can be chosen orthogonal (

P^{-1} = P^T

), giving

A = QDQ^T

where

Q

is orthogonal with columns forming an orthonormal basis of eigenvectors, and

D

is diagonal with real eigenvalues.

This can be rewritten as the spectral decomposition:

A = \lambda_1 \mathbf{q}_1\mathbf{q}_1^T + \lambda_2 \mathbf{q}_2\mathbf{q}_2^T + \cdots + \lambda_n \mathbf{q}_n\mathbf{q}_n^T

Each term

\lambda_i \mathbf{q}_i\mathbf{q}_i^T

is the eigenvalue times the projection matrix onto the eigenspace. The matrix

A

is decomposed into a sum of rank-one projections, weighted by eigenvalues.

The spectral theorem is the most powerful diagonalization result in real linear algebra. It guarantees real eigenvalues, orthogonal eigenvectors, and a decomposition that simultaneously diagonalizes and orthogonalizes.

Matrix Exponential

For a diagonalizable matrix, the matrix exponential

e^{At}

— central to solving

\mathbf{x}' = A\mathbf{x}

— has an explicit form:

e^{At} = Pe^{Dt}P^{-1} = P\,\text{diag}(e^{\lambda_1 t}, e^{\lambda_2 t}, \dots, e^{\lambda_n t})\,P^{-1}

The exponential of a diagonal matrix is the diagonal matrix of exponentials. The full matrix exponential is computed from

n

scalar exponentials, one per eigenvalue.

The solution to

\mathbf{x}' = A\mathbf{x}

with initial condition

\mathbf{x}(0) = \mathbf{x}_0

is then

\mathbf{x}(t) = e^{At}\mathbf{x}_0

. This is the matrix-level analogue of the scalar solution

x(t) = e^{at}x_0

x' = ax

.

When

A

has complex eigenvalues

a \pm bi

, the exponentials

e^{(a \pm bi)t} = e^{at}(\cos bt \pm i \sin bt)

combine in conjugate pairs to produce real oscillatory terms

e^{at}\cos bt

and

e^{at}\sin bt

in the final solution.

When Diagonalization Fails

When a matrix is not diagonalizable — when some eigenvalue has geometric multiplicity strictly less than its algebraic multiplicity — the best achievable form under similarity is the Jordan normal form.

The Jordan form is block diagonal, with each block a Jordan block:

J_k(\lambda) = \begin{pmatrix} \lambda & 1 & 0 & \cdots & 0 \\ 0 & \lambda & 1 & \cdots & 0 \\ \vdots & & \ddots & \ddots & \vdots \\ 0 & & & \lambda & 1 \\ 0 & & & & \lambda \end{pmatrix}

k \times k

Jordan block has the eigenvalue

\lambda

on the diagonal and ones on the superdiagonal. A diagonalizable eigenvalue contributes

1 \times 1

Jordan blocks. A defective eigenvalue contributes blocks larger than

1 \times 1

.

The Jordan form is unique up to the ordering of blocks and is the canonical representative of the similarity class. Powers and exponentials of Jordan blocks can still be computed explicitly, but the formulas involve polynomial correction terms (

t^k e^{\lambda t}

instead of just

e^{\lambda t}

) reflecting the defective structure. The full Jordan theory belongs to advanced linear algebra.

Diagonalizability at a Glance

Several quick tests determine or suggest diagonalizability.

A matrix with

n

distinct eigenvalues is always diagonalizable — distinctness forces independence of eigenvectors.

A real symmetric matrix is always diagonalizable, and orthogonally so. This is the spectral theorem.

A matrix satisfying

m_g(\lambda) = m_a(\lambda)

for every eigenvalue is diagonalizable. This is the definitive necessary and sufficient condition.

A matrix with any eigenvalue where

m_g < m_a

is not diagonalizable. The shortfall means there are not enough eigenvectors to form a basis.

Matrices that are already diagonal are trivially diagonalizable (

P = I

). The identity matrix, all scalar matrices

cI

, and all diagonal matrices fall here.

The zero matrix is diagonalizable (it is already diagonal with all eigenvalues zero). A nilpotent matrix is diagonalizable if and only if it is the zero matrix — any other nilpotent matrix is defective.