Lably
Skip to content

Spectral theorem

Result about when a matrix can be diagonalized

  • 11 min read
  • 4 chapters

Related on Lably

Through Linear algebra, Matrix (mathematics) and Dimension (vector space)

Examples of operators to which the spectral theorem applies are self-adjoint operators or more generally normal operators on Hilbert spaces.

The spectral theorem also provides a canonical decomposition, called the spectral decomposition, of the underlying vector space on which the operator acts.

Augustin-Louis Cauchy proved the spectral theorem for symmetric matrices, i.e., that every real, symmetric matrix is diagonalizable. In addition, Cauchy was the first to be systematic about determinants. The spectral theorem as generalized by John von Neumann is today perhaps the most important result of operator theory.

This article mainly focuses on the simplest kind of spectral theorem, that for a self-adjoint operator on a Hilbert space. However, as noted above, the spectral theorem also holds for normal operators on a Hilbert space.

Finite-dimensional case

Hermitian maps and Hermitian matrices

We begin by considering a Hermitian matrix on Cn (but the following discussion will be adaptable to the more restrictive case of symmetric matrices on Rn). We consider a Hermitian map A on a finite-dimensional complex inner product space V endowed with a positive definite sesquilinear inner product ⟨⋅,⋅⟩. The Hermitian condition on A means that for all x, y ∈ V, ⟨Ax,y⟩=⟨x,Ay⟩.

An equivalent condition is that A* = A, where A* is the Hermitian conjugate of A. In the case that A is identified with a Hermitian matrix, the matrix of A* is equal to its conjugate transpose. (If A is a real matrix, then this is equivalent to AT = A, that is, A is a symmetric matrix.)

This condition implies that all eigenvalues of a Hermitian map are real: To see this, it is enough to apply it to the case when x = y is an eigenvector. (Recall that an eigenvector of a linear map A is a non-zero vector v such that Av = λv for some scalar λ. The value λ is the corresponding eigenvalue. Moreover, the eigenvalues are roots of the characteristic polynomial.)

Theorem—If A is Hermitian on V, then there exists an orthonormal basis of V consisting of eigenvectors of A. Each eigenvalue of A is real.

We provide a sketch of a proof for the case where the underlying field of scalars is the complex numbers.

By the fundamental theorem of algebra, applied to the characteristic polynomial of A, there is at least one complex eigenvalue λ1 and corresponding eigenvector v1, which must by definition be non-zero. Then since λ1⟨v1,v1⟩=⟨A(v1),v1⟩=⟨v1,A(v1)⟩=λ¯1⟨v1,v1⟩, we find that λ1 is real. Now consider the space Kn−1=span(v1)⊥, the orthogonal complement of v1. By Hermiticity, Kn−1 is an invariant subspace of A. To see that, consider any k∈Kn−1 so that ⟨k,v1⟩=0 by definition of Kn−1. To satisfy invariance, we need to check if A(k)∈Kn−1. This is true because, ⟨A(k),v1⟩=⟨k,A(v1)⟩=⟨k,λ1v1⟩=0. Applying the same argument to Kn−1 shows that A has at least one real eigenvalue λ2 and corresponding eigenvector v2∈Kn−1⊥v1. This can be used to build another invariant subspace Kn−2=span({v1,v2})⊥. Finite induction then finishes the proof.

The matrix representation of A in a basis of eigenvectors is diagonal, and by the construction the proof gives a basis of mutually orthogonal eigenvectors; by choosing them to be unit vectors one obtains an orthonormal basis of eigenvectors. A can be written as a linear combination of pairwise orthogonal projections, called its spectral decomposition. Let Vλ={v∈V:Av=λv} be the eigenspace corresponding to an eigenvalue λ. Note that the definition does not depend on any choice of specific eigenvectors. In general, V is the orthogonal direct sum of the spaces Vλ where the λ ranges over the spectrum of A.

When the matrix being decomposed is Hermitian, the spectral decomposition is a special case of the Schur decomposition (see the proof in case of normal matrices below).

Spectral decomposition and the singular value decomposition

The spectral decomposition is a special case of the singular value decomposition, which states that any matrix A∈Cm×n can be expressed as A=UΣV∗, where U∈Cm×m and V∈Cn×n are unitary matrices and Σ∈Rm×n is a diagonal matrix with nonnegative entries. The diagonal entries of Σ are uniquely determined by A and are known as the singular values of A. If A is Hermitian, then A∗=A and VΣU∗=UΣV∗ which implies U=V.

Normal matrices

The spectral theorem extends to a more general class of matrices. Let A be an operator on a finite-dimensional inner product space. A is said to be normal if A*A = AA*.

One can show that A is normal if and only if it is unitarily diagonalizable using the Schur decomposition. That is, any matrix can be written as A = UTU*, where U is unitary and T is upper triangular. If A is normal, then one sees that TT* = T*T. Therefore, T must be diagonal since a normal upper triangular matrix is diagonal (see normal matrix). The converse is obvious.

In other words, A is normal if and only if there exists a unitary matrix U such that A=UDU∗, where D is a diagonal matrix. Then, the entries of the diagonal of D are the eigenvalues of A. The column vectors of U are the eigenvectors of A and they are orthonormal. Unlike the Hermitian case, the entries of D need not be real.

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Topics in mathematics