Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-31
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 F{R,C}, let AMn(F) be self-adjoint (Hermitian in the complex case), and let qFn be a unit eigenvector for a simple eigenvalue λ. Then there are constants C>0 and δ>0 such that whenever

0<dist(xk,Fq)<δ

and the Rayleigh-quotient step of Rayleigh-quotient iteration for Hermitian matrices is defined, the next iterate satisfies

dist(xk+1,Fq)Cdist(xk,Fq)3.

Thus the convergence to the eigendirection is local and cubic.

Facts & Assumptions

Given: A Hermitian matrix A, a simple eigenpair (λ,q), and a Rayleigh-quotient iterate xk with 0<dist(xk,Fq)<δ for δ small enough that the current Rayleigh-quotient step is defined.

[L3]

Rayleigh-quotient iteration uses the current Rayleigh quotient as the shift (Rayleigh-quotient iteration for Hermitian matrices).

[L4]

Orthogonal projection onto a one-dimensional subspace gives the nearest point on that subspace; for a unit vector q it is PFqx=x,qq (Orthogonal projection is linear, and an orthonormal basis (ei) of W gives PWv=iv,eiei, The orthogonal projection is the unique nearest point in the subspace).

Proof

technique · direct
1.1

By [L1] and [L2], choose an orthonormal eigenbasis q,q2,,qn over the given field, with eigenvalues λ,λ2,,λn. Let γ:=mini2λiλ>0. For θk:=dist(xk,Fq), [L4] gives the orthogonal decomposition xk=ckq+zk,zkq,zk2=θk. Since the iterate has unit length, ck2+θk2=1.

L1L2L4given
2.1

The Rayleigh shift is μk:=Axk,xk. Because Aq=λq, zkq, and A is Hermitian, the cross terms vanish: μk=ck2λ+Azk,zk. Using ck2+θk2=1, this becomes μkλ=Azk,zkλθk2. Hence [L5] gives μkλ(A2+λ)θk2. Set C0:=A2+λ, and shrink δ so that C0δ2γ/2 and δ1/2. Then whenever θk<δ, the shift satisfies μkλγ/2, so λiμkγ/2 for every i2.

L1L5step 1.1algebra
3.1

By [L3], the next unnormalised iterate is yk+1:=(AμkI)1xk. Using the eigenbasis from step 1.1, yk+1=ck(λμk)1q+wk,wk:=(AμkI)1zkq. Because λiμkγ/2 on q, one has wk22γθk.

L2L3step 1.1step 2.1algebra
4.1

Since θk<δ1/2, the identity ck2+θk2=1 gives ck3/2. After normalising yk+1, the distance to the line Fq is bounded by the ratio of the orthogonal and parallel parts: θk+1wk2ckλμk143γλμkθk. Combining this with step 2.1 yields θk+14C03γθk3.

step 2.1step 3.1algebra
5.1

Taking C:=4C0/(3γ) proves dist(xk+1,Fq)Cdist(xk,Fq)3 whenever 0<dist(xk,Fq)<δ and the current Rayleigh-quotient step is defined. Hence the convergence is local and cubic.

step 4.1

Depends on

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