Alphabeta Math
PropositionStatement: 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.

For Hermitian matrices, the Rayleigh quotient and residual converge with the expected rates along power iteration

Statement

Let A be Hermitian with simple dominant eigenvalue λ1, let q1 be a unit eigenvector, and let (xk) be the power iteration from a start vector with nonzero q1-component. Put

μk:=⟨Axk,xk⟩,rk:=Axk−μkxk.

Then

∣μk−λ1∣=O ⁣(∣λ2λ1∣2k),∥rk∥2=O ⁣(∣λ2λ1∣k).

In particular, μk→λ1 and rk→0.

Facts & Assumptions

Given: A Hermitian matrix A with simple dominant eigenpair (λ1,q1) and a valid power iteration (xk).

[L2]

Hermitian means A∗=A, so if z⊥q1 then ⟨Az,q1⟩=⟨z,Aq1⟩=λ1⟨z,q1⟩=0 (Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space).

[L3]

The power iteration is the normalised recurrence xk+1=Axk/∥Axk∥2, with Rayleigh estimates from the same iterates (Power iteration with normalisation and Rayleigh-quotient eigenvalue estimates).

Proof

technique · direct
1.1L1L4algebra

Let ρ:=∣λ2/λ1∣<1. By [L4], the Hermitian matrix is diagonalisable, so [L1] applies. After choosing phases αk of modulus one, one has ∥αkxk−q1∥2=O(ρk). Write αkxk=ckq1+zk with zk⊥q1. Then ∣ck−1∣+∥zk∥2=O(ρk).

2.1L2step 1.1algebra

By [L2], the orthogonal complement q1⊥ is A-invariant. Since xk is unit and μk=⟨A(αkxk),αkxk⟩, the cross terms vanish: μk=∣ck∣2λ1+⟨Azk,zk⟩. Using ∣ck∣2+∥zk∥22=1, this becomes μk−λ1=⟨Azk,zk⟩−λ1∥zk∥22. Therefore ∣μk−λ1∣≤(∥A∥2+∣λ1∣)∥zk∥22=O(ρ2k).

3.1step 1.1step 2.1algebra

Using Aq1=λ1q1, one has αkrk=A(αkxk)−μk(αkxk)=ck(λ1−μk)q1+(A−μkI)zk. Since ∣αk∣=1, ∥rk∥2≤∣ck∣ ∣λ1−μk∣+(∥A∥2+∣μk∣)∥zk∥2. Step 2.1 and step 1.1 give ∥rk∥2=O(ρk).

4.1step 2.1step 3.1L3∎

The displayed bounds force μk→λ1 and rk→0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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