Jump to content

Spectral theorem

From Wikipedia, the free encyclopedia
(Redirected from Theorem for normal matrices)

In mathematics, particularly linear algebra and functional analysis, a spectral theorem is a result about when a linear operator or matrix can be diagonalized (that is, represented as a diagonal matrix 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 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.[1][2] 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

[edit]

Hermitian maps and Hermitian matrices

[edit]

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 A on a finite-dimensional complex inner product space V endowed with a positive definite sesquilinear inner product The Hermitian condition on means that for all x, yV,

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 A v = λ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 we find that λ1 is real. Now consider the space the orthogonal complement of v1 . By Hermiticity, is an invariant subspace of A. To see that, consider any so that by definition of To satisfy invariance, we need to check if This is true because Applying the same argument to shows that A has at least one real eigenvalue and corresponding eigenvector This can be used to build another invariant subspace 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 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 where the ranges over the spectrum of

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

[edit]

The spectral decomposition is a special case of the singular value decomposition, which states that any matrix can be expressed as where and are unitary matrices and is a diagonal matrix. The diagonal entries of are uniquely determined by and are known as the singular values of If is Hermitian, then and which implies

Normal matrices

[edit]

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 = A A* .

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 = U T U* , where U is unitary and T is upper triangular. If A is normal, then one sees that T T* = 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 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.

Compact self-adjoint operators

[edit]

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 A is a compact self-adjoint operator on a (real or complex) Hilbert space V. Then there is an orthonormal basis of V consisting of eigenvectors of A. 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. For example, the multiplication operator on which takes each to is bounded and self-adjoint, but has no eigenvectors. However, its spectrum, suitably defined, is still equal to , see spectrum of bounded operator.

Bounded self-adjoint operators

[edit]

Possible absence of eigenvectors

[edit]

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

This operator does not have any eigenvectors in , though it does have eigenvectors in a larger space. Namely the distribution , 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 L2[0, 1] or any other Banach space. Thus, the delta-functions are "generalized eigenvectors" of but not eigenvectors in the usual sense.

Spectral subspaces and projection-valued measures

[edit]

In the absence of (true) eigenvectors, one can look for a "spectral subspace" consisting of an almost eigenvector, i.e, a closed subspace of associated with a Borel set in the spectrum of . This subspace can be thought of as the closed span of generalized eigenvectors for with eigenvalues in .[4] In the above example, where we might consider the subspace of functions supported on a small interval inside . This space is invariant under and for any in this subspace, is very close to . Each subspace, in turn, is encoded by the associated projection operator, and the collection of all the subspaces is then represented by a projection-valued measure.

One formulation of the spectral theorem expresses the operator A as an integral of the coordinate function over the operator's spectrum with respect to a projection-valued measure.[5] When the self-adjoint operator in question is compact, this version of the spectral theorem reduces to something similar to the finite-dimensional spectral theorem above, except that the operator is expressed as a finite or countably infinite linear combination of projections, that is, the measure consists only of atoms.

Multiplication operator version

[edit]

An alternative formulation of the spectral theorem says that every bounded self-adjoint operator is unitarily equivalent to a multiplication operator, a relatively simple type of operator.

Theorem[6] — Let be a bounded self-adjoint operator on a Hilbert space . Then there is a measure space and a real-valued essentially bounded measurable function on and a unitary operator such that where is the multiplication operator: and .

Multiplication operators are a direct generalization of diagonal matrices. A finite-dimensional Hermitian vector space may be coordinatized as the space of functions from a basis to the complex numbers, so that the -coordinates of a vector are the values of the corresponding function . The finite-dimensional spectral theorem for a self-adjoint operator states that there exists an orthonormal basis of eigenvectors , so that the inner product becomes the dot product with respect to the -coordinates: thus is isomorphic to for the discrete unit measure on . Also is unitarily equivalent to the multiplication operator , where is the eigenvalue of : that is, multiplies each -coordinate by the corresponding eigenvalue , the action of a diagonal matrix. Finally, the operator norm is equal to the magnitude of the largest eigenvector .

The spectral theorem is the beginning of the vast research area of functional analysis called operator theory; see also spectral measure.

There is also an analogous spectral theorem for bounded normal operators on Hilbert spaces. The only difference in the conclusion is that now may be complex-valued.

Direct integrals

[edit]

There is also a formulation of the spectral theorem in terms of direct integrals. It is similar to the multiplication-operator formulation, but more canonical.

Let be a bounded self-adjoint operator and let be the spectrum of . The direct-integral formulation of the spectral theorem associates two quantities to . First, a measure on , and second, a family of Hilbert spaces We then form the direct integral Hilbert space The elements of this space are functions (or "sections") such that for all . The direct-integral version of the spectral theorem may be expressed as follows:[7]

Theorem — If is a bounded self-adjoint operator, then is unitarily equivalent to the "multiplication by " operator on for some measure and some family of Hilbert spaces. The measure is uniquely determined by up to measure-theoretic equivalence; that is, any two measure associated to the same have the same sets of measure zero. The dimensions of the Hilbert spaces are uniquely determined by up to a set of -measure zero.

The spaces can be thought of as something like "eigenspaces" for . Note, however, that unless the one-element set has positive measure, the space is not actually a subspace of the direct integral. Thus, the 's should be thought of as "generalized eigenspace"—that is, the elements of are "eigenvectors" that do not actually belong to the Hilbert space.

Although both the multiplication-operator and direct integral formulations of the spectral theorem express a self-adjoint operator as unitarily equivalent to a multiplication operator, the direct integral approach is more canonical. First, the set over which the direct integral takes place (the spectrum of the operator) is canonical. Second, the function we are multiplying by is canonical in the direct-integral approach: Simply the function .

Cyclic vectors and simple spectrum

[edit]

A vector is called a cyclic vector for if the vectors span a dense subspace of the Hilbert space. Suppose is a bounded self-adjoint operator for which a cyclic vector exists. In that case, there is no distinction between the direct-integral and multiplication-operator formulations of the spectral theorem. Indeed, in that case, there is a measure on the spectrum of such that is unitarily equivalent to the "multiplication by " operator on .[8] This result represents simultaneously as a multiplication operator and as a direct integral, since is just a direct integral in which each Hilbert space is just .

Not every bounded self-adjoint operator admits a cyclic vector; indeed, by the uniqueness in the direct integral decomposition, this can occur only when all the 's have dimension one. When this happens, we say that has "simple spectrum" in the sense of spectral multiplicity theory. That is, a bounded self-adjoint operator that admits a cyclic vector should be thought of as the infinite-dimensional generalization of a self-adjoint matrix with distinct eigenvalues (i.e., each eigenvalue has multiplicity one).

Although not every admits a cyclic vector, it is easy to see that we can decompose the Hilbert space as a direct sum of invariant subspaces on which has a cyclic vector. This observation is the key to the proofs of the multiplication-operator and direct-integral forms of the spectral theorem.

Functional calculus

[edit]

One important application of the spectral theorem (in whatever form) is the idea of defining a functional calculus. That is, given a function defined on the spectrum of , we wish to define an operator . If is simply a positive power, , then is just the -th power of , . The interesting cases are where is a nonpolynomial function such as a square root or an exponential. Either of the versions of the spectral theorem provides such a functional calculus.[9] In the direct-integral version, for example, acts as the "multiplication by " operator in the direct integral: That is to say, each space in the direct integral is a (generalized) eigenspace for with eigenvalue .

Unbounded self-adjoint operators

[edit]

Many important linear operators which occur in analysis, such as differential operators, are unbounded. There is also a spectral theorem for self-adjoint operators that applies in these cases. To give an example, every constant-coefficient differential operator is unitarily equivalent to a multiplication operator. Indeed, the unitary operator that implements this equivalence is the Fourier transform; the multiplication operator is a type of Fourier multiplier.

In general, spectral theorem for self-adjoint operators may take several equivalent forms.[10] Notably, all of the formulations given in the previous section for bounded self-adjoint operators—the projection-valued measure version, the multiplication-operator version, and the direct-integral version—continue to hold for unbounded self-adjoint operators, with small technical modifications to deal with domain issues. Specifically, the only reason the multiplication operator on is bounded, is due to the choice of domain . The same operator on, e.g., would be unbounded.

The notion of "generalized eigenvectors" naturally extends to unbounded self-adjoint operators, as they are characterized as non-normalizable eigenvectors. Contrary to the case of almost eigenvectors, however, the eigenvalues can be real or complex and, even if they are real, do not necessarily belong to the spectrum. Though, for self-adjoint operators there always exist a real subset of "generalized eigenvalues" such that the corresponding set of eigenvectors is complete.[11]

See also

[edit]

Notes

[edit]
  1. ^ Hawkins, Thomas (1975). "Cauchy and the spectral theory of matrices". Historia Mathematica. 2: 1–29. doi:10.1016/0315-0860(75)90032-4.
  2. ^ A Short History of Operator Theory by Evans M. Harrell II
  3. ^ Hall 2013 Section 6.1
  4. ^ Hall 2013 Theorem 7.2.1
  5. ^ Hall 2013 Theorem 7.12
  6. ^ Hall 2013 Theorem 7.20
  7. ^ Hall 2013 Theorem 7.19
  8. ^ Hall 2013 Lemma 8.11
  9. ^ E.g., Hall 2013 Definition 7.13
  10. ^ See Section 10.1 of Hall 2013
  11. ^ de la Madrid Modino 2001, pp. 95–97.

References

[edit]