The Spectral Theorem for Symmetric Matrices
What you'll learn: You'll discover why symmetric matrices are guaranteed to be orthogonally diagonalizable—one of the most elegant results in linear algebra.
The Big Idea
The Spectral Theorem states that every symmetric matrix can be orthogonally diagonalized. In other words, if A is a real symmetric matrix (meaning A = Aᵀ), then there exists an orthogonal matrix Q and a diagonal matrix D such that:
A = QDQᵀ
This is a powerful upgrade from ordinary diagonalization: not only can we diagonalize A, but the change-of-basis matrix Q has orthonormal columns (eigenvectors). This makes the decomposition numerically stable and geometrically meaningful.
Why This Matters
Recall that orthogonal diagonalization requires:
- A has n linearly independent eigenvectors
- Those eigenvectors are mutually orthogonal
The Spectral Theorem guarantees both conditions automatically for symmetric matrices.
Proof Sketch
-
Real eigenvalues: For any symmetric matrix A, all eigenvalues are real (you proved this earlier).
-
Orthogonal eigenvectors: Eigenvectors corresponding to distinct eigenvalues of a symmetric matrix are orthogonal. (If λ ≠ μ and Av = λv, Aw = μw, then v · w = 0.)
-
Complete orthonormal basis: Using the Gram-Schmidt process within each eigenspace (for repeated eigenvalues), we can construct an orthonormal basis of eigenvectors for ℝⁿ. These form the columns of Q.
-
Orthogonal diagonalization: Since Q has orthonormal columns, Qᵀ = Q⁻¹, giving us A = QDQᵀ.
Geometric Intuition
Think of symmetric matrices as describing shapes (quadratic forms). The Spectral Theorem says every such shape has principal axes aligned with orthogonal directions—the eigenvectors. The eigenvalues tell you the "stretch" along each axis.
Key Takeaway: Every symmetric matrix is orthogonally diagonalizable; it has real eigenvalues and an orthonormal basis of eigenvectors.