Upper Bounds and the Min–Max Principle
The ground-state variational principle is the first member of a hierarchy. The min–max principle characterizes every discrete eigenvalue below the essential spectrum by optimizing the Rayleigh quotient over subspaces of a prescribed dimension. It is the theorem behind excited-state Ritz bounds, eigenvalue interlacing, and the monotone improvement of finite-basis spectra.
The theorem is precise about what is bounded. Eigenvalues are ordered and counted with multiplicity; trial vectors must lie in the energy form domain; and the familiar upper-bound conclusion applies to discrete levels below the essential-spectrum threshold. A finite matrix always has discrete eigenvalues, but not every eigenvalue of a discretized continuum is an approximation to a bound state.
This page owns those guarantees and caveats. Matrix construction and diagonalization remain the canonical subject of the Rayleigh–Ritz Method, while the ground-state proof is given in the Variational Principle.
Setup and Spectral Ordering
Section titled “Setup and Spectral Ordering”Let be a self-adjoint Hamiltonian bounded from below. Denote its closed quadratic form by
and its form domain by . For every nonzero , define
When lies in the operator domain, this agrees with
Let
be the bottom of the essential spectrum, and write
for the bottom of the full spectrum. List the discrete eigenvalues below as
counting multiplicity. Thus a threefold-degenerate energy occupies three consecutive positions in the list.
If has compact resolvent, its spectrum is purely discrete with finite multiplicities and no finite accumulation point. One may then regard for the purpose of this discussion. If essential spectrum is present, only finitely or countably many discrete levels may lie below its threshold.
Ground State as the First Min–Max Level
Section titled “Ground State as the First Min–Max Level”The bottom of the spectrum is characterized by
If a discrete ground-state eigenvalue exists below , then and a ground-state eigenvector attains the infimum. If the spectrum begins with continuum and has no bound state, then and the infimum need not be attained by any normalizable vector.
Restricting the search to a trial set gives
When a ground-state eigenvalue exists, this is the familiar upper bound to . The higher-level theorem replaces a single trial vector by a trial subspace.
Exact Orthogonality and Excited States
Section titled “Exact Orthogonality and Excited States”Suppose exact orthonormal eigenvectors for all lower indices are known. Define
Then
To see why, expand an admissible normalized state orthogonal to the lower eigenspace:
Every remaining spectral contribution has energy at least , so
The state attains equality. Degeneracy causes no problem when indices are counted with multiplicity and the lower subspace is specified consistently.
The formula is conceptually useful but computationally circular: if the exact lower eigenvectors were available, much of the spectral problem would already be solved.
Why Approximate Orthogonality Can Lose the Bound
Section titled “Why Approximate Orthogonality Can Lose the Bound”Replacing exact lower states by approximate ones does not preserve the excited-state upper bound. A two-level system makes the failure explicit. Let
Take an approximate ground state
The unique normalized state orthogonal to it is, up to phase,
Its energy is
For , this lies below . Orthogonality to an inaccurate ground state leaves a component of the true ground state in the putative excitation.
Penalty methods need the same care. Minimizing
is a variational problem for the modified Hamiltonian . Its ground energy is not automatically an upper bound to of the original .
Exact symmetry sectors are different. If preserves a subspace with quantum number , minimization in that invariant sector bounds its lowest energy even when that state is excited relative to the full Hilbert space.
Courant–Fischer in Finite Dimension
Section titled “Courant–Fischer in Finite Dimension”Let be Hermitian on an -dimensional Hilbert space, with ordered eigenvalues
For , the min–max formula is
An equivalent max–min formula is
The first form says: among all -dimensional subspaces, choose the one whose highest Rayleigh quotient is as low as possible. The optimal choice is the exact low-energy subspace
Proof of the min–max form
Section titled “Proof of the min–max form”For , every normalized vector has energy no greater than , and has energy . Therefore
This proves that the min–max value is at most .
Now take any subspace of dimension . The lower exact subspace
has dimension . Dimension counting implies that contains a nonzero vector orthogonal to . That vector has Rayleigh quotient at least . Hence
Since this is true for every -dimensional , the minimum of those maxima is at least . The two inequalities prove the formula.
Semibounded-Operator Min–Max Principle
Section titled “Semibounded-Operator Min–Max Principle”For the self-adjoint, semibounded operator introduced above, define the th variational level
For every index for which the th discrete eigenvalue exists below the essential spectrum, the theorem states
The discrete eigenvalues are counted with multiplicity. If exactly such levels exist, then
If the resolvent is compact, the discrete case supplies the whole spectrum and as .
The second case is crucial. Variational levels do not enumerate a continuum as a sequence of normalizable eigenstates. Once no further discrete level exists below , the min–max construction reaches the continuum threshold.
Ritz Values as Upper Bounds
Section titled “Ritz Values as Upper Bounds”Let be an -dimensional trial subspace. Its ordered Ritz values
have the internal variational characterization
The candidate subspaces are restricted to , so their minimum cannot be lower than the unrestricted one:
Therefore, for every such that is a discrete eigenvalue,
This is often called the Hylleraas–Undheim–MacDonald theorem in quantum chemistry. It avoids explicit orthogonality to unknown exact lower states: diagonalization optimizes all ordered states in the trial subspace simultaneously.
For nested trial spaces , each fixed-index Ritz value can only decrease, while remaining above the corresponding discrete eigenvalue below the essential-spectrum threshold .
Matrix realization
Section titled “Matrix realization”For a basis , define
The Ritz values are the generalized eigenvalues of
provided is positive definite on the retained span. Solving this finite problem accurately is the implementation; the min–max theorem explains its spectral ordering and bound.
Nested Spaces and Interlacing
Section titled “Nested Spaces and Interlacing”If
then, for every fixed index available in both spaces,
The larger space offers every old -dimensional candidate subspace and additional ones, so the minimum cannot increase.
When the dimension increases by one, the sharper interlacing relation is
for . Thus new Ritz values enter between old ones while each fixed-index upper bound moves downward or stays fixed.
Monotonicity requires genuinely nested spaces and exact evaluation of the same Hamiltonian form. Changing a box, pseudopotential, quadrature rule, nonlinear basis family, or truncation prescription can destroy the set inclusion needed by the argument.
When Ritz Values Converge
Section titled “When Ritz Values Converge”Upper bounds need not be useful bounds. A sequence can remain far above the exact level. For nested spaces , convergence to a discrete eigenvalue follows under appropriate approximation hypotheses, commonly expressed by requiring the union of the spaces to be dense in the form domain with the form norm, or at least to approximate the relevant eigenspace in that norm.
Under such conditions, for every fixed discrete level below ,
as .
Density only in the Hilbert-space norm can be too weak for an unbounded Hamiltonian because it need not control kinetic energy or other contributions to the quadratic form.
Eigenvectors and degenerate clusters
Section titled “Eigenvectors and degenerate clusters”Eigenvalue convergence does not imply that an individual Ritz vector has a stable identity. Near a degeneracy, numerical eigenvectors can rotate arbitrarily inside the nearly degenerate invariant subspace. Compare spectral projectors, subspace angles, symmetry labels, and matrix elements rather than component-by-component eigenvectors.
Residuals Add Local Spectral Information
Section titled “Residuals Add Local Spectral Information”Let be a normalized Ritz vector with Ritz value and strong residual
For self-adjoint , the spectral theorem implies
Thus a small residual guarantees that some spectral point lies nearby. It does not by itself identify the eigenvalue index, distinguish a discrete state from continuum, or certify that two nearly degenerate Ritz vectors span the correct subspace.
If , Ritz stationarity makes this residual orthogonal to the trial subspace:
This Galerkin orthogonality says that the trial-space component of the eigen-equation error has been removed. The residual can still be large in directions absent from .
For a form-conforming space contained only in , the corresponding statement is instead
A norm-valued strong residual need not exist until additional regularity places in .
Numerical algorithms and residual stopping criteria are treated in Sparse Eigensolvers.
Degeneracy and Symmetry Sectors
Section titled “Degeneracy and Symmetry Sectors”Suppose
The energy has multiplicity . A trial space must contain enough independent directions to approximate the whole eigenspace if all Ritz values are to converge. Capturing one linear combination does not certify the full degeneracy.
If a symmetry operator commutes with , decompose the Hilbert space into invariant sectors and apply the min–max principle to each restricted Hamiltonian. The sector ground state is then the first min–max level in that sector. This is often the cleanest way to target an excited state with known parity, angular momentum, particle number, or another exact quantum number.
The ordering must be interpreted within the declared sector. The second state in one symmetry sector need not be the second state of the full spectrum.
Essential Spectrum and Continuum Caveats
Section titled “Essential Spectrum and Continuum Caveats”The threshold is not decorative. It marks where the ordinary below-threshold min–max sequence stops identifying isolated bound states.
Finite boxes create pseudostates
Section titled “Finite boxes create pseudostates”Putting a scattering problem in a finite box replaces continuum by a discrete box spectrum. Those box eigenvalues are genuine eigenvalues of the finite-box Hamiltonian, but they are not upper bounds to a sequence of continuum eigenvalues of the infinite-volume operator. Their dependence on box size and boundary conditions must be analyzed separately.
Spectral pollution in gaps
Section titled “Spectral pollution in gaps”For operators with gaps in the essential spectrum, naive Galerkin approximations can produce stable-looking Ritz values that converge to no true spectral point. This is spectral pollution. The below-threshold semibounded min–max theorem does not justify arbitrary interior-gap approximations.
Resonances are not ordinary eigenvalues
Section titled “Resonances are not ordinary eigenvalues”Metastable resonances generally are not normalizable eigenstates of the self-adjoint Hamiltonian. Complex scaling, analytic continuation, scattering poles, and stabilization methods have different variational structures; the ordinary real upper-bound theorem does not apply to a complex resonance energy.
Operators unbounded on both sides
Section titled “Operators unbounded on both sides”The standard energy min–max principle assumes a lower-semibounded operator. The Dirac Hamiltonian is unbounded above and below, so naive energy minimization suffers variational collapse. Gap eigenvalues require specialized min–max constructions, spectral projections, or well-defined effective Hamiltonians.
Discretization can lose the bound
Section titled “Discretization can lose the bound”If matrix elements are approximated inconsistently, quadrature is biased, the overlap matrix is truncated, or the discretized form is not the restriction of the original form, a computed value need not remain an upper bound. A solver’s floating-point eigenvalue is a theorem about its matrix only after numerical error is controlled.
The operator, domain, and spectral distinctions used here are developed in Eigenvalue Problems, Unbounded Operators, and the Practical Spectral Theorem. Spatial discretization and spectral pollution are discussed in PDE Solvers.
A Three-Level Example
Section titled “A Three-Level Example”Let
with . Choose the two-dimensional trial space
The two spanning vectors are orthonormal, and has no matrix element between them. The projected eigenvalues are therefore the ordered pair formed from
Hence
The ordered bounds hold for every :
At values of where the two projected energies cross, the labels attached to the basis vectors exchange, but the ordered Ritz indices remain the correct objects for the theorem.
What an Upper Bound Does Not Supply
Section titled “What an Upper Bound Does Not Supply”The inequality
does not give a two-sided error bar. A lower bound, a gap estimate, a residual theorem, or an independently converged computation is needed to bracket the exact level.
As one example, Temple’s inequality can provide a ground-state lower bound from an energy expectation, its variance, and reliable information about the next spectral level. Its assumptions are additional information; it is not a consequence of the upper-bound statement alone.
Agreement of two Ritz calculations is strongest when the spaces are nested, matrix elements are independently checked, residuals are small, and the common limit lies safely below a known essential-spectrum threshold.
Practical Workflow
Section titled “Practical Workflow”- Specify the self-adjoint Hamiltonian, its boundary conditions, and the quadratic-form domain.
- Identify the symmetry sector and whether the target lies below essential spectrum.
- Order exact and approximate levels consistently, counting multiplicity.
- Choose an admissible trial subspace and verify that its overlap matrix is positive definite on the retained span.
- Solve the Hermitian generalized eigenproblem and sort the Ritz values.
- Refine through nested spaces when possible and check fixed-index monotonicity.
- Report residual norms and monitor invariant subspaces near degeneracies.
- Vary box size, mesh, quadrature, and boundary conditions separately from basis enrichment.
- Do not interpret above-threshold pseudostates or interior-gap values using the below-threshold theorem.
Common Mistakes
Section titled “Common Mistakes”- Applying the ground-state upper bound to an excited-state ansatz without exact orthogonality, symmetry restriction, or min–max structure.
- Orthogonalizing against approximate lower states and assuming the resulting energy remains above the exact excitation.
- Forgetting that eigenvalues are counted with multiplicity.
- Comparing states by labels rather than sorting the Ritz spectrum consistently through crossings.
- Calling a sequence monotone when the trial spaces, Hamiltonian, box, or quadrature change together.
- Assuming Hilbert-norm density automatically controls an unbounded Hamiltonian’s quadratic form.
- Treating every finite-box level as a bound-state approximation.
- Reporting a stabilized Ritz value without its residual.
- Ignoring spectral pollution in gaps of essential spectrum.
- Applying ordinary energy minimization to an operator unbounded below.
Exercises
Section titled “Exercises”1. Prove finite-dimensional min–max
Section titled “1. Prove finite-dimensional min–max”For a Hermitian matrix with ordered eigenvalues , prove
Solution
Choose
Every normalized vector in this subspace has Rayleigh quotient at most , and attains . Therefore the min–max value is at most .
For any other -dimensional subspace , dimension counting gives a nonzero vector in
That vector has support only on eigenvectors with index at least , so its quotient is at least . Hence the maximum over is at least . Taking the minimum over all proves the equality.
2. Approximate orthogonality counterexample
Section titled “2. Approximate orthogonality counterexample”For the two-level construction in the text, compute the energy of the state orthogonal to and show explicitly how far it lies below .
Solution
The orthogonal state is
Its energy is
Therefore
Any nonzero error angle produces a value below the true excited energy. The violation is second order for small .
3. Analyze the three-level trial space
Section titled “3. Analyze the three-level trial space”Derive the two Ritz values for in the worked example. For which do the two projected energies cross?
Solution
In the stated orthonormal basis, the projected Hamiltonian is diagonal:
The ordered eigenvalues are the minimum and maximum of the two diagonal entries. They cross when
or
The basis-vector identity of the lower Ritz state changes there, while the ordered upper-bound statement remains valid.
4. Monotonicity under nested enrichment
Section titled “4. Monotonicity under nested enrichment”Use the subspace min–max formula to prove that whenever .
Solution
The value minimizes the largest Rayleigh quotient over all -dimensional subspaces contained in . Every such subspace is also contained in . The larger trial space offers at least the same candidates and possibly better ones. Therefore
No statement about convergence rate follows from this ordering alone.
5. Residual distance to the spectrum
Section titled “5. Residual distance to the spectrum”Let be self-adjoint, , , and . Use the spectral measure of to prove
Solution
Let be the normalized spectral measure of . Then
If every spectral point were farther than from , then the integrand would be strictly greater than everywhere on the support of a probability measure. Its integral would then be strictly greater than , a contradiction. Hence at least one spectral point lies within the residual norm.
6. Exhausting discrete levels
Section titled “6. Exhausting discrete levels”Suppose has exactly two discrete eigenvalues below its essential spectrum. What are , , and ? Why does not identify a third bound state?
Solution
The min–max theorem gives
After the two discrete levels are exhausted,
The value is the bottom of essential spectrum. It need not be a normalizable eigenvalue, so the third variational level marks the continuum threshold rather than a third bound state.
References
Section titled “References”- R. Courant and D. Hilbert, Methods of Mathematical Physics, Vol. I (Wiley-Interscience, 1989 reprint), chapters on eigenvalue problems and variational principles.
- M. Reed and B. Simon, Methods of Modern Mathematical Physics, Vol. IV: Analysis of Operators (Academic Press, 1978), especially the min–max principle and Schrödinger-operator applications. Bibliographic record.
- T. Kato, Perturbation Theory for Linear Operators, 2nd ed. (Springer, 1995), for closed forms, self-adjoint operators, and spectral approximation foundations.
- J. K. L. MacDonald, “Successive Approximations by the Rayleigh–Ritz Variation Method”, Physical Review 43, 830–833 (1933). A classic derivation of successive Ritz bounds.
- E. B. Davies, Spectral Theory and Differential Operators (Cambridge University Press, 1995), for discrete spectra, essential spectra, and variational eigenvalue methods.
- I. Babuška and J. Osborn, “Eigenvalue Problems,” in Handbook of Numerical Analysis, Vol. II (North-Holland, 1991), pp. 641–787. A systematic treatment of variational spectral approximation.
- M. Levitin and E. Shargorodsky, “Spectral pollution and second-order relative spectra for self-adjoint operators”, IMA Journal of Numerical Analysis 24, 393–416 (2004). A rigorous discussion of spurious Galerkin spectrum.