For commuting real symmetric matrices , each eigenspace of is invariant under : . The restriction of to that eigenspace is again symmetric. The spectral theorem therefore supplies an orthonormal eigenbasis for inside each eigenspace of . Combining these bases gives a common orthonormal eigenbasis of the whole space. Conversely, two symmetric matrices diagonal in the same orthonormal basis commute.
For a qubit control and finite-dimensional target with unitary operator V, the controlled unitary gate is entangling if and only if V is not scalar. If , the controlled operation is a phase gate on the control tensored with the target identity and preserves every product state.
Otherwise the spectral theorem supplies two orthonormal eigenvectors with distinct eigenvalues . Set and use product input . The two conditional target vectors and are linearly independent because their eigenbasis coefficients would otherwise require . The conditional-vector product-state criterion shows that their coherent controlled superposition is entangled. Thus even a target gate arbitrarily close to scalar can be entangling, although the resulting entanglement need not be large.
Cosine-sine decomposition 2026-10-25
If a matrix with orthonormal columns is divided into two row blocks, each having at least as many rows as there are columns, it admits simultaneous thin factorizations , , with orthonormal , an orthogonal matrix , and nonnegative diagonal matrices satisfying . To prove this, apply the spectral theorem to ; the same orthonormal eigenbasis diagonalizes . Normalize the nonzero columns of and complete the zero columns to orthonormal sets. The entries of can be written as cosines and sines of angles in .
Covariance matrix Created 2026-09-24 Updated 2026-10-14
For a real random vector with finite second moments, its covariance matrix collects all pairwise covariances:
The diagonal entries are variances. The covariance matrix is a symmetric matrix and a positive semidefinite matrix, because for every real vector ,
Thus one matrix describes the variance of every linear combination of the coordinates. It is a positive-definite matrix exactly when no nonzero linear combination is constant almost surely. A deterministic linear relation produces a zero eigenvalue.
For example,
has unit coordinate variances, covariance , and eigenvalues and . Its unit eigenvectors and describe directions of greatest and least projected variance. For a unit vector , direct multiplication gives : the variation in the sum direction is nine times that in the difference direction.
Figure 1.
A covariance matrix encodes projected variance in every direction
. Left: the covariance ellipse has a semi-major axis of length and a semi-minor axis of length along the eigenvectors of . Right: the variance of the unit-direction projection is . This is exact matrix geometry for the stipulated covariance matrix, with no sampled observations or claimed probability coverage. Details.
The spectral theorem supplies an orthonormal basis of these directions. This connects covariance matrices to principal component analysis: its leading eigenvector identifies the unit-direction projection with the largest variance. For a linear transformation , the transformed random vector has covariance matrix , so uncertainties propagate through a linear model by matrix multiplication.
For symmetric negative-definite matrices, put , and . The spectral theorem gives exact exponential norm bounds, and . Integration in the exponential product defect identity proves the displayed estimate if . At equality its continuous limit is ; the quotient must not be interpreted as division by zero.
Density matrix 2026-10-13
A finite-dimensional density operator represents a quantum state on a Hilbert space. It is Hermitian, positive semidefinite, and has trace one:
The density matrix is its matrix in a chosen orthonormal basis. In dimension it has real parameters: a Hermitian matrix has , and fixing its trace removes one; positivity restricts the allowed values.
A quantum state ensemble of normalized pure states with positive probabilities gives
Zero-weight terms can be omitted. Conversely, the spectral theorem gives such an ensemble for every density operator, using its orthonormal eigenvectors and nonnegative eigenvalues, with zero eigenvalues omitted. A pure state has ; a mixed state needs at least two nonzero eigenvalues. [ref]
For a projective measurement with orthogonal projections , the Born rule is
This is the average of the component pure state probabilities. Positivity makes each outcome probability nonnegative, and makes them sum to one. The same density operator therefore predicts every measurement on the system without requiring a unique preparation history. [ref]
For a closed system, Schrödinger picture evolution under a unitary operator is
when denotes the time-independent Heisenberg picture state and . In the Schrödinger picture the density operator evolves; in the Heisenberg picture the observables evolve instead, with identical measurement predictions. This unitary operator preserves the eigenvalues and hence the purity of a density operator. [ref]
A historical source for the probabilistic formulation of quantum mechanics is von Neumann's 1927 paper Wahrscheinlichkeitstheoretischer Aufbau der Quantenmechanik. [ref]
Diagonalizable matrix Created 2026-09-24 Updated 2026-10-14
A finite-dimensional linear operator is diagonalizable over a specified field when it has an eigenbasis. Equivalently, its matrix admits
where is an invertible matrix whose columns are eigenvectors, and is a diagonal matrix of the corresponding eigenvalues. This change of basis reveals a linear map as independent one-dimensional scalings. The matrix may look coupled in the original coordinates, but each coordinate in the eigenbasis evolves on its own.
For the symmetric matrix computed in eigenvector, take
Then , hence . The orthonormal basis version is , an orthogonal matrix satisfying . Every real symmetric matrix has an orthonormal eigenbasis by the spectral theorem; a general diagonalizable matrix need not have orthogonal eigenvectors.
The immediate payoff is repeated application: adjacent factors cancel, giving . In this example,
The component in grows while the component in stays fixed. After division by its Euclidean norm, this particular sequence approaches . This is the mechanism behind the power method; an initial vector entirely in would stay there and never find the dominant eigenvalue .
Figure 1.
Repeated maps: eigenvalue growth, alignment, and the exceptional starting direction
. Details.
Two different obstructions deserve comparison. The planar rotation in eigenvector is diagonalizable over but not over , because its eigenvalues are and . By contrast, the shear mapping
has only , of algebraic multiplicity two, and , of geometric multiplicity one. There is no second independent eigenvector, even over . This is a defective matrix, already a two-dimensional Jordan block. Its powers are
Thus even though both eigenvalues are one, repeated application can produce growth. Eigenvalues alone miss the coupling recorded by a Jordan block. A repeated eigenvalue is harmless when it has enough independent eigenvectors, as demonstrates. More generally, a matrix is diagonalizable exactly when its characteristic polynomial splits over the chosen field and every eigenvalue has equal geometric multiplicity and algebraic multiplicity. The proof outline is to join bases of the distinct eigenspaces; their direct sum fills the space exactly under these conditions.
A physical motivation is the separation of normal modes. Consider two equal masses between three identical springs of stiffness , with the outer ends fixed. By Hooke's law and Newton's second law, the displacement vector obeys
The eigenvectors and have eigenvalues and : the masses move together in the first normal mode and oppositely in the second. Writing separates the coupled equations into two harmonic oscillators,
Their angular frequencies are and ; the eigenvalues give squared angular frequencies after multiplication by . This is the beauty of diagonalization: finding the right directions turns interacting motions into independent patterns. For a physical treatment, see Yen-Jie Lee's "Coupled Oscillators, Normal Modes" (MIT 8.03SC, 2016), and the local article normal modes of two equal masses between three springs.[ref]
Expectation value Created 2026-09-24 Updated 2026-10-14
The expectation value of a quantum observable is the expected value of its measurement outcome random variable in a specified quantum state. It predicts the mean of outcomes from many identical quantum state preparations. It need not equal any one possible outcome: for a spin one-half particle, equal probabilities of and give mean zero even though zero is never an outcome of that spin component. Here is the reduced Planck constant.
Let be a Hermitian operator on a finite-dimensional Hilbert space, and let be a normalized pure state, . The spectral theorem writes
The are distinct real eigenvalues, are orthogonal projections onto their eigenspaces, and is the identity operator. For an ideal projective measurement of , the Born rule and the expectation value give
Thus the expectation value is a probability-weighted average of eigenvalues, including all vectors in a degenerate eigenspace in its . In an orthonormal eigenbasis, , this is , where repeated are allowed. The weighted average lies between the smallest and largest eigenvalues; it can lie in a gap between them. The statistical meaning and operator expression are connected in this way in the authored treatment of average energies.[ref]
If a nonzero vector has not been normalized, use ; the denominator is essential. A global phase cancels between the bra and ket, so and have the same expectation value and outcome probabilities.
The outcome variance measures the spread about this mean, whereas the quantum uncertainty is its standard deviation:
For a pure state, zero variance means that lies entirely in one eigenspace. That eigenspace need not be one-dimensional. Knowing only a mean generally does not determine the entire outcome probability distribution.
For a mixed state, the same formulas use its density matrix , a positive operator with trace one:
A pure state is the special case . For a quantum state ensemble , the expectation value is . This linearity is useful when preparations vary between trials; different quantum state ensembles can have the same density matrix.
These formulas require no operator-domain qualifications in finite dimension. For an unbounded self-adjoint operator, the spectral theorem instead gives a spectral probability measure; a finite mean requires an integrable absolute first moment, and finite variance requires a finite second moment. Writing as an operator inner product additionally requires in the operator domain of . The quadratic form of a positive quantum Hamiltonian explains the useful wider form-domain version.
Finite-dimensional spectral theorem Created 2026-09-24 Updated 2026-10-14
Every self-adjoint operator on a finite-dimensional real or complex inner product space has an orthonormal eigenbasis, and all its eigenvalues are real. In orthonormal coordinates, a real symmetric matrix has the form , with an orthogonal matrix and a real diagonal matrix. A complex Hermitian matrix instead has , with a unitary matrix and its conjugate transpose. These are the self-adjoint cases of the spectral theorem; Axler gives the real and complex finite-dimensional statements in Section 7B.[ref]
An orthonormal eigenbasis turns a seemingly coupled linear map into independent scalar multiplications while preserving lengths and angles. If and , then
The last identity removes every cross term from the quadratic form. The eigenvalues tell us whether it is positive, negative, or mixed in sign, and the eigenvectors identify the corresponding directions. This connects positive-definite matrices, quadratic forms, and the Hermitian Rayleigh quotient range.
For a fully computed example, take
Direct multiplication gives and . Their dot product is zero and each has norm one. Thus
Writing changes into . Its level set is therefore an ellipse with semiaxis lengths and , along and . The coordinates change, but the ellipse does not: orthogonal diagonalization reveals its existing geometry.
Figure 1.
An orthonormal eigenbasis removes the cross term from a quadratic form and reveals the axes of its ellipse
. Details.
For distinct eigenvalues, orthogonality follows at once from self-adjointness: . Within a repeated eigenspace, choose an orthonormal basis; arbitrarily chosen eigenvectors of the same eigenvalue need not be orthogonal. One outline of the full argument finds an eigenvector, observes that its orthogonal complement is invariant, and repeats in that smaller space. Merely having real eigenvalues is weaker: has two real eigenvalues, but its eigenvectors and are not orthogonal.
Hermitian operator Created 2026-09-24 Updated 2026-10-14
A bounded operator on a real or complex Hilbert space is Hermitian, or self-adjoint, when . Equivalently,
Its directional values are real, since this identity makes equal its complex conjugate. Reality allows either sign; a positive operator additionally requires nonnegative values in every direction.
Figure 1.
Self-adjoint directional values may change sign, touch zero, or stay strictly positive
. Details.
The diagram compares Hermitian quadratic forms along paths of unit vectors. The Hermitian matrix takes the values and on the standard basis vectors; takes the values and ; and
satisfies and . These eigenvectors form an orthonormal basis, and every has . Thus is a positive operator, with eigenvalues and operator norm .
Three conditions describe different geometry. A Hermitian operator satisfies ; a normal operator satisfies ; a unitary operator satisfies , where is the identity operator. Every Hermitian operator and every unitary operator is a normal operator. Concrete matrices separate the conditions:
The spectrum of a bounded Hermitian operator is real. In finite dimension, the spectral theorem supplies an orthonormal basis of eigenvectors, turning its action into independent real scalings. This makes the geometry easy to interpret: each eigenvalue records a signed response along an orthogonal direction. An arbitrary bounded Hermitian operator in infinite dimension need not have any eigenvectors; the general spectral theorem uses a projection-valued measure. MIT's lecture 21 develops the real spectrum and the orthogonality of eigenspaces.[ref]
A historical connection is the study of forms with conjugate variables. In his 1901 account of Charles Hermite's work, Camille Jordan describes these forms and emphasizes their role in reducing forms with real or complex coefficients. In today's notation, is the diagonal value of a Hermitian form; the conjugate variables make a real-valued expression possible even with complex coefficients.[ref]
For a densely defined operator outside this bounded setting, the displayed pairing identity alone defines a symmetric operator. A self-adjoint operator must also have the same operator domain as its adjoint operator.
Hermitian quadratic form 2026-10-14
A bounded Hermitian operator determines a Hermitian form and its real-valued diagonal expression . On a complex Hilbert space,
Thus it is a quadratic form on the underlying real vector space; it is generally not a quadratic form over the complex field, whose scaling rule would involve . This distinction explains why replacing by loses the geometry of a complex inner product.
For a finite-dimensional Hermitian operator with an orthonormal basis of eigenvectors and corresponding eigenvalues , the spectral theorem gives
For a unit vector, this is an average of the eigenvalues with nonnegative weights summing to one. It is also the Rayleigh quotient, so its minimum and maximum are the smallest and largest eigenvalues.
In the Hermitian operator diagram, take for , and for . The computed curves are
These paths illustrate the extremal values; the spectral theorem supplies the bounds for every complex unit vector, including those outside the plotted paths.
Indefinite matrix 2026-10-25
A real symmetric matrix is indefinite when is an indefinite quadratic form. Equivalently, has both a positive and a negative eigenvalue, by the spectral theorem. A zero eigenvalue is permitted, so an indefinite matrix need not be an invertible matrix.
For a normal operator on a real or complex inner product space, equality of and gives . If , put . Then forces , and the adjoint operator identity gives
Thus and . Applying this implication successively to proves
In particular a nilpotent normal operator is zero. The argument uses no spectral theorem.
Matrix inverse from a decaying matrix exponential Created 2026-10-18 Updated 2026-10-20
If every eigenvalue of a finite square matrix has negative real part, its matrix exponential decays and its integral converges. The Jordan normal form shows that polynomial factors in are dominated by exponential decay. Integrating gives , proving the displayed matrix inverse formula. In particular, for a Hermitian matrix with negative eigenvalues, the spectral theorem reduces the integral to scalar exponentials with integrals . The minus sign is essential: the integral is positive definite in this Hermitian case, while has negative eigenvalues.
Minimal polynomial of a normal operator Created 2026-10-25 Updated 2026-10-31
On a real or complex inner product space of finite dimension, a normal operator has a square-free polynomial as its minimal polynomial. To prove this without the spectral theorem, suppose an irreducible polynomial occurs at least twice in . Put and . Since polynomials of a normal operator are normal, is a normal operator. For every ,
By kernel stabilization for a normal operator, . Hence the smaller-degree monic polynomial annihilates , contradicting minimality.
Over the complex numbers, all irreducible polynomials are linear, so the primary decomposition theorem for linear maps now gives a basis of eigenvectors. Over the real numbers, irreducible quadratics can remain: a nontrivial planar rotation need not have any real eigenvectors, although its minimal polynomial is square-free.
Operator exponential Created 2026-10-18 Updated 2026-10-25
For a bounded linear operator, the series converges in operator norm. For an unbounded self-adjoint operator , the spectral theorem instead defines the bounded unitary operator by applying the scalar function to its projection-valued measure. This yields unitary time evolution without assuming that every vector lies in the domain of every power of . In finite dimensions it is the matrix exponential.
For a self-adjoint Hamiltonian operator bounded below with ground-state energy , every admissible nonzero trial wavefunction has a Rayleigh quotient at least . To see this explicitly in a complete orthonormal eigenbasis, write with . Then
so
For continuous spectral components, the spectral theorem replaces the sum by an integral with the same nonnegative integrand. Equality requires the trial quantum state to lie entirely in the ground-state subspace. The variational method chooses a tractable family, evaluates the quotient and minimizes over its parameters. This gives an upper bound; enlarging the family can only improve that bound. The trial must belong to the operator domain for the operator expression above, or have finite energy in the corresponding quadratic-form version of the quantum variational principle.
For the oscillator, use the standard kinetic operator : the original PDF omits the superscript on the derivative in its numerator. Take , and normalize the scaled exact ground state as
The factor is optional in a quotient but makes the calculation transparent. Changing variable to and differentiating the scaled wavefunction gives
At this trial is the exact minimizing state, so its energy has zero derivative there. Hence . Since ,
This is the quantum virial identity from scaling for a quadratic potential, and hence the oscillator form of the virial theorem.
For the inverse-power attraction, take and suppose, for contradiction, that an exact ground state exists with separately finite kinetic energy and potential mean , admitting the same dilation variations. Homogeneity now gives
Stationarity at would require . Its second derivative would then be
For this is negative, contradicting a ground-state minimum. More strongly, one does not need a presumed exact state: choose any normalized smooth test function supported away from the singular origin. Its and are finite, and its scaled quotient satisfies
The unregularized attraction therefore exhibits fall to the centre for a supercritical inverse-power potential and has no stable ground state.
There is a necessary qualification to the PDF's broader wording about “no bound state”. Under the usual finite-energy virial theorem assumptions, a putative negative-energy bound state would satisfy
which contradicts being below the continuum threshold at zero. Thus no negative-energy bound state satisfying those regularity assumptions is possible. But this singular differential expression needs a specified domain at ; separately divergent kinetic and potential means or boundary conditions not preserved by dilation invalidate that ordinary calculation. The domain assumptions in singular-potential virial arguments must therefore be stated: the scaling proof establishes absence of a semibounded ground-state problem, rather than a domain-independent theorem about every formal square-integrable solution. A short-distance regularization would be a different potential.
Insert the complete orthonormal basis of energy eigenstates on either side of the Boltzmann factor. The spectral theorem gives
At low temperature, the gap suppresses excited energy eigenstates. The harmonic oscillator eigenfunction of the ground state is
Therefore
The common zero-point energy factor cancels. Dividing the kernel by its trace would give the position probability density of the canonical ensemble; at zero temperature this tends to , whose variance is . Thus zero temperature projects onto the ground state and retains its quantum spread, rather than concentrating at the minimum of the classical potential energy.
There is also a check on the first correction. With , the first excited harmonic oscillator eigenfunction satisfies and . Hence the spectral theorem gives , in agreement with part (c).
Proceed by induction on the dimension. For positive dimension, the fundamental theorem of algebra gives a root of the characteristic polynomial, hence a nonzero eigenvector . Normalize it to have norm one. Its span is an invariant subspace, and part (ii) makes its orthogonal complement invariant too:
The restriction of to the complement remains skew-adjoint, since the same inner product identity holds there. The induction hypothesis supplies an orthonormal eigenbasis for that smaller space. Adjoining gives an orthonormal eigenbasis for .
The zero-dimensional base case is immediate. Thus is diagonalizable, indeed unitarily diagonalizable. This proves the finite-dimensional case of the spectral theorem for a skew-adjoint operator without assuming that distinct eigenvalues have multiplicity one.
For a self-adjoint operator on a finite-dimensional complex inner product space, every eigenvalue is real and eigenspaces for distinct eigenvalues are orthogonal. The spectral theorem gives an orthonormal eigenbasis. Accordingly
and the are orthogonal projections satisfying . Since is nonsingular, none of its eigenvalues is zero. Its representing matrix in the orthonormal eigenbasis is real diagonal.