spectral_theorem

The Spectral Theorem

Dr. Victor Frankenstein and Captain Nemo
Institute of Linear Transformations, Transylvania Polytechnic

January 5, 2025

Abstract

The spectral theorem establishes that symmetric matrices can be diagonalized by orthogonal transformations. This fundamental result connects linear algebra with geometric intuition and enables applications from optimization to quantum mechanics.

Example scroll made with Typst + Pandoc for Scroll Press.

Introduction

The spectral theorem answers a fundamental question: when can a linear transformation be completely understood through its eigenvalues and eigenvectors? For symmetric matrices, the answer is remarkably complete—they always possess a full set of real eigenvalues with orthogonal eigenvectors.

Main Result

Theorem (Spectral Theorem for Real Symmetric Matrices). Let $A \in {\mathbb{R}}^{n \times n}$ be symmetric. Then:

All eigenvalues of $A$ are real.
There exists an orthonormal basis of ${\mathbb{R}}^{n}$ consisting of eigenvectors of $A$ .
$A$ can be diagonalized as $A = Q\Lambda Q^{T}$ , where $Q$ is orthogonal and $\Lambda$ is diagonal.

Proof sketch. By induction on $n$ . Symmetric matrices have real eigenvalues (shown via conjugate transpose argument). For each eigenvalue $\lambda_{1}$ with unit eigenvector $\mathbf{v}_{1}$ , extend to an orthonormal basis and consider $Q_{1}^{T}AQ_{1}$ , which has block-diagonal form with $(n - 1) \times (n - 1)$ symmetric block $\widetilde{A}$ . Apply induction to $\widetilde{A}$ and combine orthogonal matrices.

Example

Consider $A = \begin{pmatrix} 3 & 1 \\ 1 & 3 \end{pmatrix}$ . The characteristic polynomial is $(\lambda - 4)(\lambda - 2)$ , giving eigenvalues $\lambda_{1} = 4$ and $\lambda_{2} = 2$ . Corresponding orthonormal eigenvectors are:

$\mathbf{v}_{1} = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 \\ 1 \end{pmatrix},\quad\mathbf{v}_{2} = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 \\ - 1 \end{pmatrix}$

Thus: $Q = \begin{pmatrix} 1/\sqrt{2} & 1/\sqrt{2} \\ 1/\sqrt{2} & - 1/\sqrt{2} \end{pmatrix},\quad\Lambda = \begin{pmatrix} 4 & 0 \\ 0 & 2 \end{pmatrix}$

Verification: $Q^{T}AQ = \Lambda$ and $A = Q\Lambda Q^{T}$ .

Applications

Quadratic forms: Using $A = Q\Lambda Q^{T}$ , any quadratic form $\mathbf{x}^{T}A\mathbf{x}$ reduces to $\sum_{i = 1}^{n}\lambda_{i}y_{i}^{2}$ in eigenvector coordinates. The signs of eigenvalues determine whether critical points are minima, maxima, or saddles.

Principal Component Analysis: PCA finds directions of maximum variance in data by computing eigenvectors of the covariance matrix, projecting onto top eigenvectors for dimensionality reduction.

Differential equations: For $\mathbf{x}\prime(t) = A\mathbf{x}(t)$ with symmetric $A$ , the eigenvector decomposition decouples the system into independent modes: $y_{i}\prime(t) = \lambda_{i}y_{i(t)}$ , with solutions $y_{i(t)} = y_{i(0)}e^{\lambda_{i}t}$ .

Conclusion

The spectral theorem provides both theoretical insight and computational power for symmetric matrices. The geometric interpretation—any symmetric transformation is a rotation, scaling along axes, and inverse rotation—illuminates the structure while enabling applications across mathematics, physics, and data science.

References

Axler, S. (2015). Linear Algebra Done Right (3rd ed.). Springer.
Strang, G. (2016). Introduction to Linear Algebra (5th ed.). Wellesley-Cambridge Press.

Example scroll made with Typst + Pandoc for Scroll Press.

The Spectral Theorem for Symmetric Matrices