A spectral decomposition expresses a linear operator through its eigenvalues and projections onto its eigenspaces.
For a diagonalizable matrix with distinct eigenvalues , this polynomial is the projection operator onto the eigenspace for along the direct sum of the other eigenspaces. It is one on its own eigenspace and zero on the others. Consequently for different eigenvalues, and . These projections need not be orthogonal projections; that stronger property holds for a normal matrix. This is the polynomial interpolation form of the spectral decomposition.
An eigenvalue is dominant when its modulus is greater than or equal to that of every other eigenvalue. It is uniquely dominant when the inequality is strict.
A spectral gap is a positive separation between designated parts of the spectrum of a linear operator. For the power method, the relevant gap separates the modulus of the dominant eigenvalue from the other eigenvalue moduli.
An energy gap is a positive separation between a ground-state sector and its lowest excitations, with the sector, momentum and thermodynamic limit specified. A local positive curvature of an auxiliary field is not alone a proof of a dynamical gap: the kinetic terms and conjugate variables determine the excitation poles.
Let be a finite-dimensional Hermitian matrix and real. The spectral theorem gives in an orthonormal eigenbasis, so
If the spectrum avoids the closed interval, every factor product is positive. Consequently the quadratic form is positive for and zero for . More precisely it is bounded below by . This is a finite-dimensional instance of testing a spectral gap with a polynomial in the operator.
Suppose has ground energy zero and positive spectral gap at least , and . Let be the minimum of restricted to the ground space. Splitting a normalized vector into ground and excited components bounds its energy below by , with the excited norm. Completing the square yields the displayed bound for . The error is controlled by the gap and cannot be treated as a uniform when closes.
The Davis-Kahan theorem bounds the change of an invariant eigenspace of a symmetric matrix in terms of a matrix perturbation and an appropriate spectral gap. The rank-one eigenprojector perturbation bound below depends only on the unperturbed gap. Yu, Wang and Samworth's formulation gives population-gap bounds in greater generality.
If a symmetric matrix has largest eigenvalue separated from by , and is its leading rank-one orthogonal projection matrix, then every unit vector , with , satisfies the displayed inequality. Expanding in an orthonormal eigenbasis gives , while . The analogous statement for a smallest eigenvalue follows by replacing by .
Let project onto a leading unit eigenvector of , with as in the Davis-Kahan curvature lemma. Its maximizing Rayleigh quotient gives . Duality of the operator norm and trace norm, together with the rank-two bound , proves the estimate. No gap condition on the perturbed matrix is needed.

Ancestors (8)

  1. Diagonalizable matrix
  2. Eigenvalue
  3. Operator theory
  4. Linear algebra
  5. Algebra
  6. Area of mathematics
  7. Mathematics
  8. Home

Synonyms (2)

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.