A spectral decomposition expresses a linear operator through its eigenvalues and projections onto its eigenspaces.
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.
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.
Articles by others on the same topic
There are currently no matching articles.