The Spectral Theorem states that for a real Symmetric Matrix or a complex Hermitian matrix , there exists an orthonormal basis of eigenvectors such that can be diagonalized. Formally: or where:

  • is an Orthogonal matrix (real case) or unitary matrix (complex case) whose columns are the eigenvectors of ,
  • is a diagonal matrix containing the eigenvalues of .

For real Symmetric Matrix, the eigenvalues are real; for Hermitian matrices, they are real as well.

Intuition

The Spectral Theorem reveals that symmetric (or Hermitian) matrices are structurally simple in the sense that:

  1. They can be fully described by their eigenvalues and eigenvectors.
  2. Their action in a vector space is equivalent to scaling along mutually perpendicular directions (eigenvectors).

Key Properties

  1. Orthogonality: The eigenvectors corresponding to distinct eigenvalues of are orthogonal.
  2. Diagonalization: can be expressed as (or ), where contains only real eigenvalues.
  3. Decomposition: For real symmetric matrices: where are eigenvalues and are the corresponding eigenvectors.
  4. Symmetry and Real Eigenvalues: For real symmetric matrices, all eigenvalues are real, and the eigenvectors form an orthonormal basis of .
  5. Hermitian Case: For complex Hermitian matrices, eigenvalues are still real, and eigenvectors form an orthonormal basis in .

Applications

  1. Principal Component Analysis (PCA): Eigen-decomposition of the covariance matrix leverages the Spectral Theorem to identify principal directions in data.
  2. Quantum Mechanics: Hermitian operators represent observable quantities, with real eigenvalues corresponding to measurable outcomes.
  3. Optimization: Spectral properties help in solving quadratic forms and determining extrema.
  4. Graph Theory: The Laplacian matrix of a graph is symmetric; its eigenvalues and eigenvectors reveal structural properties.
  5. Matrix Function: Computing functions like , , and using eigenvalues and eigenvectors.