The Spectral theorem reference article from the English Wikipedia on 24-Jul-2004
(provided by Fixed Reference: snapshots of Wikipedia from wikipedia.org)

Spectral theorem

Why not sponsor a child for Christmas in 2008?
In mathematics, the spectral theorem is an important theorem in linear algebra and functional analysis. It provides a canonical decomposition, called the spectral decomposition, for normal operators on Hilbert spaces. Since the class of normal operators includes a number of special kinds of operators such as self-adjoint operators or unitary operators or operators represented by special kinds of matrices such as symmetric matrices, the spectral theorem can be applied in a wide range of situations. In broad terms, the spectral theorem identifies a class of linear operators that can be modelled by multiplication operators, which are as simple as one can hope to find. See also spectral theory for a historical perspective.

Table of contents
1 Finite-dimensional case
2 The spectral theorem for compact hermitian operators
3 Functional analysis
4 See also
5 Reference

Finite-dimensional case

We begin by considering a symmetric operator A on a finite dimensional inner product space V; the symmetry condition means <A x, y> = <x, A y> for all x,y elements of V. Recall that an eigenvector of a linear operator A is a vector x such that A x = r x for some scalar r. r is the corresponding eigenvalue.

Theorem. There is an orthonormal basis of V consisting of eigenvectors of A. Each eigenvalue is real.

This result is of such importance in many parts of mathematics, that we provide a sketch of a proof. First the property that all the eigenvalues are real. Indeed if λ is an eignevalue of A, for some non-zero vector x

It follows λ equals its own conjugate and is therefore real.

To prove the existence of an eigenvector basis, we use induction on the dimension of V. In fact it suffices to show A has at least one non-zero eigenvector e. For then we can consider the space K of vectors v orthogonal to e. This is finite dimensional, and A has the property that it maps every vector w in K into K:

Moreover, A considered as a linear operator on K is also symmetric so by the induction hypothesis this completes the proof.

It remains however to show A has at least one eigenvector. The easiest way to do that is to consider the case in which the field of scalars is complete. Then the polynomial function p(x) = det(Ax I) has a complex zero r. This means the linear operator Ar I is not invertible and hence maps a non-zero vector e to 0. This vector e is a non-zero eigenvector of A. This completes the proof.

The spectral theorem is also true for symmetric operators on finite dimensional real inner product spaces.

The spectral decomposition of an operator A which has an orthonormal basis of eigenvectors, is obtained by grouping together all vectors corresponding to the same eigenvalue. Thus

Note: these spaces are invariantly defined.

As an immediate consequence of the spectral theorem for symmetric operators we get the spectral decomposition theorem: V is the orthogonal direct sum of the spaces Vλ where the index ranges over eigenvalues. Another equivalent formulation is letting Pλ be the orthogonal projection onto Vλ

and if λ1,..., λm are the eigenvalues of A,

If A is a normal operator on a finite dimensional inner product space, A also has a spectral decomposition and the decomposition theorem holds for A. The eigenvalues will be complex numbers in general. The proof is somewhat more complicated and is discussed in the Axler reference below.

These results translate immediately into results about matrices: For any normal matrix, there exists a unitary matrix U such that

where Σ is the diagonal matrix where the entries are the eigenvalues of A. Furthermore, any matrix which diagonalizes in this way must be normal.

The column vectors of U are the eigenvectors of A and they are orthogonal.

It could be viewed as a special case of the Schur decomposition.

If A is a real symmetric matrix, it follows by the real version of the spectral theorem for symmetric operators that there is an orthogonal matrix such that U A U* is diagonal and all the eigenvalues of A are real.

The spectral theorem for compact hermitian operators

In Hilbert spaces in general, the statement of the spectral theorem for compact hermitian operators is virtually the same as in the finite-dimensional case.

Theorem. Suppose A is a compact hermitian operator on a Hilbert space V. There is an orthonormal basis of V consisting of eigenvectors of A. Each eigenvalue is real.

Again the key point is to prove the existence of at least one nonzero eigenvector. To prove this, we cannot rely on determinants to show existence of eigenvalues, but instead we use a maximization argument analogous to proving the min-max theorem for eigenvalues.

Note that the above spectral theorem holds for real or complex Hilbert spaces.

Functional analysis

The next generalization we consider is that of bounded self-adjoint operators A on a Hilbert space V. Such operators may have no eigenvalues: for instance let A be the operator multiplication by t on L2[0,1], that is

Theorem. Let A be a bounded self-adjoint operator on a Hilbert space H. Then there is a measure space (X, M, μ) and a real-valued measurable function f on X and a unitary operator U:HL2μ(X) such that

where T is the multiplication operator:

This is the beginning of the vast research area of functional analysis called
operator theory.

A normal operator on a Hilbert space may have no eigenvalues; for example, the bilateral shift on the Hilbert space l2(Z) has no eigenvalues. There is also a spectral theorem for normal operators on Hilbert spaces, though, in which the sum in the finite-dimensional spectral theorem is replaced by an integral of the coordinate function over the spectrum against a projection-valued measure.

When the normal operator in question is compact, this spectral theorem reduces to the finite-dimensional spectral theorem above, except that the operator is expressed as a linear combination of possibly infinitely many projections.

See also

Reference