94. Spectral Theorem

The Spectral Theorem says that every real symmetric matrix is orthogonally diagonalizable:

𝐴=𝑄𝐷𝑄𝑇

where:

Equivalently, 𝑄𝑇𝑄=𝐼, and the columns of 𝑄 are orthonormal eigenvectors.

94.1. What it guarantees

For a real symmetric matrix 𝐴:

  1. All eigenvalues are real (no complex eigenvalues, even if 𝐴’s entries don’t suggest it)
  2. Eigenvectors for distinct eigenvalues are orthogonal (automatic)
  3. Eigenvectors for repeated eigenvalues can be chosen orthonormal (within that eigenspace, via Gram–Schmidt)
  4. The full set of 𝑛 orthonormal eigenvectors forms a basis of 𝑛

The trio (1)+(2)+(3) is what makes the theorem work. No real symmetric matrix is missing eigenvectors.

94.2. Spectral expansion

Write 𝑄=[𝑞1𝑞2𝑞𝑛] and 𝐷=diag(𝜆1,,𝜆𝑛). Then:

𝐴=𝑖=1𝑛𝜆𝑖𝑞𝑖𝑞𝑖𝑇

The matrix decomposes into a sum of rank-1 spectral projectors 𝑞𝑖𝑞𝑖𝑇, each scaled by an eigenvalue. This is the spectral decomposition.

Example
𝐴=[2112]

Eigenvalues: 𝜆1=3,𝜆2=1.

Orthonormal eigenvectors: 𝑞1=12[11], 𝑞2=12[11].

𝑄=12[1111]𝐷=[3001]𝐴=𝑄𝐷𝑄𝑇

Spectral expansion: 𝐴=3𝑞1𝑞1𝑇+1𝑞2𝑞2𝑇=32[1111]+12[1111].

94.3. Generalizations

94.4. Why it matters

94.5. See also