In
mathematics, particularly
linear algebra
Linear algebra is the branch of mathematics concerning linear equations such as:
:a_1x_1+\cdots +a_nx_n=b,
linear maps such as:
:(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n,
and their representations in vector spaces and through matric ...
and
functional analysis, a spectral theorem is a result about when a
linear operator or
matrix
Matrix most commonly refers to:
* ''The Matrix'' (franchise), an American media franchise
** '' The Matrix'', a 1999 science-fiction action film
** "The Matrix", a fictional setting, a virtual reality environment, within ''The Matrix'' (franchi ...
can be
diagonalized (that is, represented as a
diagonal matrix
In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal ...
in some basis). This is extremely useful because computations involving a diagonalizable matrix can often be reduced to much simpler computations involving the corresponding diagonal matrix. The concept of diagonalization is relatively straightforward for operators on finite-dimensional vector spaces but requires some modification for operators on infinite-dimensional spaces. In general, the spectral theorem identifies a class of
linear operators that can be modeled by
multiplication operators, which are as simple as one can hope to find. In more abstract language, the spectral theorem is a statement about commutative
C*-algebras. See also
spectral theory for a historical perspective.
Examples of operators to which the spectral theorem applies are
self-adjoint operators or more generally
normal operators on
Hilbert space
In mathematics, Hilbert spaces (named after David Hilbert) allow generalizing the methods of linear algebra and calculus from (finite-dimensional) Euclidean vector spaces to spaces that may be infinite-dimensional. Hilbert spaces arise natu ...
s.
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
Baron Augustin-Louis Cauchy (, ; ; 21 August 178923 May 1857) was a French mathematician, engineer, and physicist who made pioneering contributions to several branches of mathematics, including mathematical analysis and continuum mechanics. H ...
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
John von Neumann (; hu, Neumann János Lajos, ; December 28, 1903 – February 8, 1957) was a Hungarian-American mathematician, physicist, computer scientist, engineer and polymath. He was regarded as having perhaps the widest cove ...
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
(but the following discussion will be adaptable to the more restrictive case of
symmetric matrices on
). We consider a
Hermitian map on a finite-dimensional
complex inner product space endowed with a
positive definite sesquilinear
In mathematics, a sesquilinear form is a generalization of a bilinear form that, in turn, is a generalization of the concept of the dot product of Euclidean space. A bilinear form is linear in each of its arguments, but a sesquilinear form allow ...
inner product . The Hermitian condition on
means that for all ,
:
An equivalent condition is that , where is the
Hermitian conjugate of . In the case that is identified with a Hermitian matrix, the matrix of can be identified with its
conjugate transpose
In mathematics, the conjugate transpose, also known as the Hermitian transpose, of an m \times n complex matrix \boldsymbol is an n \times m matrix obtained by transposing \boldsymbol and applying complex conjugate on each entry (the complex c ...
. (If is a
real matrix, then this is equivalent to , that is, is a
symmetric matrix
In linear algebra, a symmetric matrix is a square matrix that is equal to its transpose. Formally,
Because equal matrices have equal dimensions, only square matrices can be symmetric.
The entries of a symmetric matrix are symmetric with ...
.)
This condition implies that all eigenvalues of a Hermitian map are real: it is enough to apply it to the case when is an eigenvector. (Recall that an
eigenvector of a linear map is a (non-zero) vector such that for some scalar . The value is the corresponding
eigenvalue
In linear algebra, an eigenvector () or characteristic vector of a linear transformation is a nonzero vector that changes at most by a scalar factor when that linear transformation is applied to it. The corresponding eigenvalue, often denot ...
. Moreover, the
eigenvalues are roots of the
characteristic polynomial
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The ...
.)
Theorem. If is Hermitian on , then there exists an
orthonormal basis
In mathematics, particularly linear algebra, an orthonormal basis for an inner product space ''V'' with finite dimension is a basis for V whose vectors are orthonormal, that is, they are all unit vectors and orthogonal to each other. For ex ...
of consisting of eigenvectors of . Each eigenvalue is real.
We provide a sketch of a proof for the case where the underlying field of scalars is the
complex number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the for ...
s.
By the
fundamental theorem of algebra, applied to the
characteristic polynomial
In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The ...
of , there is at least one eigenvalue and eigenvector . Then since
:
we find that is real. Now consider the space , the
orthogonal complement of . By Hermiticity, is an
invariant subspace of . Applying the same argument to shows that has an eigenvector . Finite induction then finishes the proof.
The spectral theorem holds also for symmetric maps on finite-dimensional real inner product spaces, but the existence of an eigenvector does not follow immediately from the
fundamental theorem of algebra. To prove this, consider as a Hermitian matrix and use the fact that all eigenvalues of a Hermitian matrix are real.
The matrix representation of 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. can be written as a linear combination of pairwise orthogonal projections, called its spectral decomposition. Let
:
be the eigenspace corresponding to an eigenvalue . Note that the definition does not depend on any choice of specific eigenvectors. is the orthogonal direct sum of the spaces where the index ranges over eigenvalues.
In other words, if denotes the
orthogonal projection
In linear algebra and functional analysis, a projection is a linear transformation P from a vector space to itself (an endomorphism) such that P\circ P=P. That is, whenever P is applied twice to any vector, it gives the same result as if i ...
onto , and are the eigenvalues of , then the spectral decomposition may be written as
:
If the spectral decomposition of ''A'' is
, then
and
for any scalar
It follows that for any polynomial one has
:
The spectral decomposition is a special case of both the
Schur decomposition and the
singular value decomposition
In linear algebra, the singular value decomposition (SVD) is a factorization of a real or complex matrix. It generalizes the eigendecomposition of a square normal matrix with an orthonormal eigenbasis to any \ m \times n\ matrix. It is r ...
.
Normal matrices
The spectral theorem extends to a more general class of matrices. Let be an operator on a finite-dimensional inner product space. is said to be
normal if . One can show that is normal if and only if it is unitarily diagonalizable. Proof: By the
Schur decomposition, we can write any matrix as , where is unitary and is upper-triangular.
If is normal, then one sees that . Therefore, must be diagonal since a normal upper triangular matrix is diagonal (see
normal matrix). The converse is obvious.
In other words, is normal if and only if there exists a
unitary matrix such that
:
where is a
diagonal matrix
In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices. Elements of the main diagonal can either be zero or nonzero. An example of a 2×2 diagonal ...
. Then, the entries of the diagonal of are the
eigenvalue
In linear algebra, an eigenvector () or characteristic vector of a linear transformation is a nonzero vector that changes at most by a scalar factor when that linear transformation is applied to it. The corresponding eigenvalue, often denot ...
s of . The column vectors of are the eigenvectors of and they are orthonormal. Unlike the Hermitian case, the entries of need not be real.
Compact self-adjoint operators
In the more general setting of Hilbert spaces, which may have an infinite dimension, the statement of the spectral theorem for
compact self-adjoint operators is virtually the same as in the finite-dimensional case.
Theorem. Suppose is a compact self-adjoint operator on a (real or complex) Hilbert space . Then there is an
orthonormal basis
In mathematics, particularly linear algebra, an orthonormal basis for an inner product space ''V'' with finite dimension is a basis for V whose vectors are orthonormal, that is, they are all unit vectors and orthogonal to each other. For ex ...
of consisting of eigenvectors of . Each eigenvalue is real.
As for Hermitian matrices, the key point is to prove the existence of at least one nonzero eigenvector. One cannot rely on determinants to show existence of eigenvalues, but one can use a maximization argument analogous to the variational characterization of eigenvalues.
If the compactness assumption is removed, then it is ''not'' true that every self-adjoint operator has eigenvectors.
Bounded self-adjoint operators
Possible absence of eigenvectors
The next generalization we consider is that of
bounded
Boundedness or bounded may refer to:
Economics
* Bounded rationality, the idea that human rationality in decision-making is bounded by the available information, the cognitive limitations, and the time available to make the decision
* Bounded e ...
self-adjoint operators on a Hilbert space. Such operators may have no eigenvalues: for instance let be the operator of multiplication by on
, that is,
:
This operator does not have any eigenvectors ''in''
, though it does have eigenvectors in a larger space. Namely the
distribution Distribution may refer to:
Mathematics
*Distribution (mathematics), generalized functions used to formulate solutions of partial differential equations
*Probability distribution, the probability of a particular value or value range of a varia ...
, where
is the
Dirac delta function, is an eigenvector when construed in an appropriate sense. The Dirac delta function is however not a function in the classical sense and does not lie in the Hilbert space or any other
Banach space
In mathematics, more specifically in functional analysis, a Banach space (pronounced ) is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between ve ...
. Thus, the delta-functions are "generalized eigenvectors" of
but not eigenvectors in the usual sense.
Spectral subspaces and projection-valued measures
In the absence of (true) eigenvectors, one can look for subspaces consisting of ''almost eigenvectors''. In the above example, for example, where
we might consider the subspace of functions supported on a small interval