Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Lanczos largest Ritz values obey a Chebyshev start-angle bound, including degenerate branches

Statement

Let A∈Rn×n, n≥1, be symmetric with ordered eigenvalues λ1≥⋯≥λn. Let r be the multiplicity of λ1. If r<n, assume λ1>λr+1, and let P be the orthogonal projection onto the λ1-eigenspace. Let b∈Rn be a unit vector and, for m≥1, define

Km:=span⁡{b,Ab,…,Am−1b},θm:=max⁡0≠x∈KmxTAxxTx.

Thus θm is the largest Rayleigh–Ritz value on Km; if Lanczos runs through step m without breakdown, it is the largest Ritz value of QmTAQm. If r=n, then A=λ1I and θm=λ1 for every m≥1. Suppose r<n.

  1. If Pb=0, then θm≤λr+1 for every m; no convergence to λ1 is asserted.

  2. If Pb≠0, put τ:=∥(I−P)b∥2∥Pb∥2. If λr+1>λn, then for every m≥1, 0≤λ1−θm≤(λ1−λn)τ2Tm−1 ⁣(1+2λ1−λr+1λr+1−λn)2. For a simple top eigenvalue (r=1), τ is the tangent of the angle between b and a unit top eigenvector, so the starting-angle denominator is explicit.

  3. If Pb≠0 and λr+1=λn, then λ1−θ1=(λ1−λn)∥(I−P)b∥22∥b∥22,θm=λ1(m≥2).

When r<n, Pb≠0, and exact Lanczos breakdown occurs at dimension d, then θd=λ1 and Km=Kd for all m≥d. These are exact-arithmetic claims; they give no finite-precision grade-termination guarantee.

Facts & Assumptions

Given: A real symmetric A∈Rn×n, its ordered eigenvalues, the top-eigenspace projection P when r<n, a unit start vector b, the Krylov spaces Km, and the largest Rayleigh–Ritz values θm defined in the Statement.

[F1]

The Lanczos process as Arnoldi specialized to a Hermitian matrix, with the usual real-subdiagonal phase convention: exact Lanczos is Arnoldi applied to a symmetric matrix, with real nonnegative subdiagonal coefficients before breakdown.

[F2]

Before breakdown, Arnoldi produces an orthonormal Krylov basis and a rectangular upper-Hessenberg factorization: before breakdown, the Arnoldi vectors form an orthonormal basis of Km and satisfy AQm=Qm+1Hˉm.

[F3]

Ritz values and Ritz vectors extracted from the Arnoldi Hessenberg reduction and An Arnoldi Ritz pair has residual norm controlled by the last Hessenberg subdiagonal entry: eigenvalues of Hm=QmTAQm are Ritz values with vectors u=Qmy; if Arnoldi runs through step m without breakdown and Hmy=θy, then Au−θu=hm+1,m(emTy)vm+1.

[F5]

A scaled Chebyshev polynomial suppresses a separated interval: for a>b>c, the degree-k scaled filter has value 1 at a and absolute value at most 1/Tk(1+2(a−b)/(b−c)) on [c,b].

[F6]

The Arnoldi process for building an orthonormal basis of a Krylov subspace: each exact Arnoldi column has Avj=∑i=1jhijvi+wj; exact breakdown at column d means wd=0.

[F7]

The Krylov subspace Km(A,b)=span⁡{b,Ab,…,Am−1b}: Km(A,b)=span⁡{b,Ab,…,Am−1b}.

Proof

1.1givenF1F2F3F4F7

If exact Lanczos runs through step m without breakdown, [F1], [F2], and [F7] give an orthonormal basis Qm of Km and a symmetric compression Hm=QmTAQm. By [F3], each eigenpair of Hm lifts to an exact Ritz pair of A; by [F4], the largest eigenvalue of Hm is the maximum Rayleigh quotient on Km, namely θm. If Lanczos breaks down earlier, no step-m basis or Ritz assertion is used; θm remains defined directly by the Rayleigh–Ritz formula in the Statement.

1.2givenF4F7algebra

Assume r<n. By [F4], choose an orthonormal eigenbasis of A whose first r vectors span the range of P. If Pb=0, then b is orthogonal to that eigenspace. For every integer j≥0 and every top eigenvector u, symmetry gives uTAjb=(Aju)Tb=λ1juTb=0. Thus every vector in Km lies in the orthogonal complement of the top eigenspace, where all Rayleigh quotients are at most λr+1; this proves branch 1.

1.3givenF4algebra

If r=n, every eigenvalue is λ1, so [F4] gives A=λ1I. Every nonzero x∈Km then has Rayleigh quotient λ1, proving the stated dimension-one/full-multiplicity branch.

1.4givenF4F5F7algebra

Assume Pb≠0 and λr+1>λn. Apply [F5] with a=λ1, b=λr+1, c=λn, and k=m−1 to obtain a polynomial pm−1 of degree at most m−1 with pm−1(λ1)=1 and ∣pm−1(t)∣≤δm on [λn,λr+1], where δm:=1/Tm−1(1+2(λ1−λr+1)/(λr+1−λn)). By [F7], x:=pm−1(A)b belongs to Km, and spectral decomposition gives Px=Pb and ∥(I−P)x∥2≤δm∥(I−P)b∥2.

1.5givenF4F7algebra

Assume Pb≠0 and λr+1=λn. The spectral decomposition gives A=λnI+(λ1−λn)P. Hence Ab=λnb+(λ1−λn)Pb, so [F7] gives Pb∈K2 and it has Rayleigh quotient λ1; this proves θm=λ1 for m≥2. For m=1, [F7] gives K1=span⁡{b}, and the same decomposition gives the displayed exact formula for λ1−θ1.

1.6givenF1F6F7inductionalgebra

Finally, assume r<n, Pb≠0, and exact Lanczos breaks down at column d. For d>1, no breakdown occurs at columns j<d. Starting from q1=b/∥b∥2, inductively suppose q1,…,qj form an orthonormal basis of Kj. By the exact Arnoldi definition [F1, F6], the residual wj=Aqj−∑i=1jhijqi lies in Kj+1, is orthogonal to Kj, and is nonzero for j<d; hence its normalized vector qj+1 lies in Kj+1∖Kj. Since Kj+1 is generated by j+1 vectors, q1,…,qj+1 form a basis of Kj+1. Thus q1,…,qd form a basis of Kd. For d=1, q1 directly spans K1. Each Aqj∈Kd for j<d, and Aqd∈Kd because its orthogonalized residual wd is zero. Hence AKd⊆Kd, and [F7] plus induction gives Km=Kd for m≥d.

2.1givenF4step 1.4algebra

In the eigenbasis of [F4], write x=Px+(I−P)x. The two components are orthogonal, A(Px)=λ1Px, and all eigenvalues on the second component lie in [λn,λr+1]. Therefore λ1−xTAxxTx=∑j>r(λ1−λj)xj2∥Px∥22+∥(I−P)x∥22≤(λ1−λn)∥(I−P)x∥22∥Pb∥22≤(λ1−λn)δm2τ2. Since θm is the maximum Rayleigh quotient on Km, it is at least the quotient of this nonzero x and at most λ1. This proves branch 2, including m=1 because T0=1.

3.1givenF4step 1.6algebrainduction∎

Let μ1=λ1,μ2,…,μs be the distinct eigenvalues of A. Since r<n, s≥2 and the denominators below are nonzero. Define p(t):=∏i=2st−μiλ1−μi. Then p(λ1)=1 and p(μi)=0 for i≥2. On the orthonormal eigenbasis from [F4], p(A) therefore acts as the identity on the λ1-eigenspace and as zero on every other eigenspace, so p(A)=P. Since AKd⊆Kd and b∈Kd, every power of A applied to b lies in Kd, whence Pb=p(A)b∈Kd. The nonzero vector Pb has Rayleigh quotient λ1, while no quotient can exceed λ1; thus θd=λ1 and the exact-breakdown branch follows.

Depends on

Used by

Dependency tree · two levels

22 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