How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Near a simple Hermitian eigenvector, Rayleigh-quotient iteration converges cubically
Statement
Let , let be self-adjoint (Hermitian in the complex case), and let be a unit eigenvector for a simple eigenvalue . Then there are constants and such that whenever
and the Rayleigh-quotient step of Rayleigh-quotient iteration for Hermitian matrices is defined, the next iterate satisfies
Thus the convergence to the eigendirection is local and cubic.
Facts & Assumptions
Given: A Hermitian matrix , a simple eigenpair , and a Rayleigh-quotient iterate with for small enough that the current Rayleigh-quotient step is defined.
Hermitian means , so is normal (Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space).
A self-adjoint real operator and a normal complex operator have orthonormal eigenbases (Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis, Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Rayleigh-quotient iteration uses the current Rayleigh quotient as the shift (Rayleigh-quotient iteration for Hermitian matrices).
Orthogonal projection onto a one-dimensional subspace gives the nearest point on that subspace; for a unit vector it is (Orthogonal projection is linear, and an orthonormal basis of gives , The orthogonal projection is the unique nearest point in the subspace).
The induced operator norm and Cauchy--Schwarz imply (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||, Cauchy–Schwarz: , with equality exactly for linearly dependent vectors).
Proof
By [L1] and [L2], choose an orthonormal eigenbasis over the given field, with eigenvalues . Let For , [L4] gives the orthogonal decomposition Since the iterate has unit length, .
The Rayleigh shift is Because , , and is Hermitian, the cross terms vanish: Using , this becomes Hence [L5] gives Set , and shrink so that and . Then whenever , the shift satisfies , so for every .
By [L3], the next unnormalised iterate is Using the eigenbasis from step 1.1, Because on , one has
Since , the identity gives . After normalising , the distance to the line is bounded by the ratio of the orthogonal and parallel parts: Combining this with step 2.1 yields
Taking proves whenever and the current Rayleigh-quotient step is defined. Hence the convergence is local and cubic.
Depends on
- Rayleigh-quotient iteration for Hermitian matrices
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Orthogonal projection is linear, and an orthonormal basis $(e_i)$ of $W$ gives $P_Wv=\sum_i\langle v,e_i\rangle e_i$
- The orthogonal projection is the unique nearest point in the subspace
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Cauchy–Schwarz: $|\langle u,v\rangle|\leq\lVert u\rVert\lVert v\rVert$, with equality exactly for linearly dependent vectors
Used by
Dependency tree · two levels
23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Andrew Stuart and Jochen Voss, Matrix Analysis and Algorithms (standard reference, not scraped)