Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Krylov methods and Lanczos convergence — Examples

1 · Prerequisites

2 · Summary

The examples calculate the first restarted-GMRES residual, distinguish CG's positive-denominator setting from an indefinite MINRES start, and show a one-step decrease in the SPD CG energy-error norm. They also check Lanczos behavior for a poorly aligned start and several degenerate spectral cases. The Ritz examples retain the top-eigenspace component and exact-breakdown hypotheses explicitly.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passOpen item page →

Unrestarted GMRES solves a two-dimensional diagonal system in two steps while GMRES(1) restarts after one

Example

Let A=diag⁡(1,2), b=(1,1)T, and x0=0. Verify that unrestarted GMRES reaches the exact solution by step 2, whereas the first GMRES(1) cycle leaves residual (2/5,−1/5)T≠0.

Facts & Assumptions

Given: The real diagonal system and starting vector in the Example.

[F1]

The GMRES iterate as the residual minimizer over an affine Krylov space: GMRES minimizes ∥b−Ax∥2 over x0+Km(A,b).

[F2]

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

[F3]

Restarted GMRES(m) as repeated GMRES cycles on fixed-size Krylov spaces: GMRES(1) completes one GMRES step at the current guess and then starts a new cycle from the resulting residual.

Verification

1.1givenF1F2algebra

We have Ab=(1,2)T and the determinant of the matrix with columns b,Ab is 1⋅2−1⋅1=1≠0. Thus K2(A,b)=R2. The exact solution is x∗=A−1b=(1,1/2)T∈K2(A,b), so the minimum residual in [F1] is zero at step 2.

2.1givenF1F3algebra∎

In the first GMRES(1) cycle, [F1] restricts x1 to x0+yb=yb for a scalar y. Its residual is b−yAb=(1−y,1−2y)T, whose squared norm is (1−y)2+(1−2y)2=5(y−3/5)2+1/5. The unique minimizer is y=3/5, and the residual is (2/5,−1/5)T, which is nonzero. By [F3] this is the first-cycle residual before any restart.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passOpen item page →

CG's positive-denominator hypothesis fails on an indefinite system while MINRES can start

Example

For A−=diag⁡(1,−1), b=(1,1)T, and x0=0, evaluate the formal first CG denominator expression bTA−b outside the CG definition's SPD domain, and compute the first MINRES least-squares problem and the exact solution's membership in K2(A−,b). Contrast this with the first CG denominator for A+=diag⁡(1,2) and the same b,x0, and verify that one exact CG step decreases the A+-energy error norm from 3/2 to 1/6.

Facts & Assumptions

Given: The two real diagonal systems and starting data in the Example.

[F1]

The conjugate-gradient recurrence: for real SPD A, x0=0, and b≠0, one has p0=r0=b and the first CG step uses α0=(bTb)/(p0TAp0). Substitution of an indefinite matrix into this formula is only a formal attempt to extend it beyond its defined domain.

[F2]

Finite-precision CG has a recursive-residual gap and an attainable-accuracy bound: its hypotheses require a symmetric positive-definite matrix; it makes no claim for the indefinite system A−.

[F3]

The MINRES iterate from the Lanczos tridiagonal least-squares problem: MINRES step 1 minimizes ∥βe1−Tˉ1y∥2, where β=∥r0∥2, when Lanczos completes its first column without breakdown.

Verification

1.1givenF1F2algebra

Formally setting p0=b for A− gives A−p0=(1,−1)T, so p0TA−p0=1−1=0 while bTb=2. Thus attempting the first CG update formula would divide by zero. Since A− is indefinite, [F1] does not define a CG step for it, and the SPD theorem [F2] does not apply.

1.2givenF3F4algebra

The normalized first Lanczos vector is q1=b/2. Then q1TA−q1=0 and A−q1=(1,−1)T/2 has norm 1, so the first subdiagonal coefficient is β1=1>0. Hence [F3] applies at step 1, with β=∥r0∥2=2 and Tˉ1=(0,1)T. The squared objective is ∥(2,0)T−(0,y)T∥22=2+∣y∣2, uniquely minimized at y=0 even over C. Also b and A−b=(1,−1)T are linearly independent, so [F4] gives K2(A−,b)=R2. The exact solution A−−1b=(1,−1)T therefore lies in K2; no step-2 MINRES claim is needed after the invariant-subspace breakdown.

2.1givenF1F5algebra∎

For A+, the first CG denominator is bTA+b=1+2=3>0 and α0=2/3. The exact solution is x∗=A+−1b=(1,1/2)T, so e0=x∗−x0=(1,1/2)T and [F5] gives ∥e0∥A+2=1+2(1/2)2=3/2. The first iterate is x1=x0+α0b=(2/3,2/3)T, hence e1=x∗−x1=(1/3,−1/6)T and ∥e1∥A+2=(1/3)2+2(1/6)2=1/6. Thus the energy-error norm decreases from 3/2 to 1/6, a factor of 1/3. The recursive residual is r1=b−α0A+b=(1/3,−1/3)T≠0. This verifies the positive first denominator and energy decrease in this SPD instance, contrasting with step 1.1.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A poorly aligned start delays the largest Ritz value and requires the start-angle factor

Example

Let A=diag⁡(10,2,1) and b=(1/100,α,α)T,α=9999/20000. Verify that ∥b∥2=1, bound the largest two-step Ritz value by θ2<9/4, and compare the resulting gap with the Chebyshev bound from Lanczos largest Ritz values obey a Chebyshev start-angle bound, including degenerate branches. The comparison must show that deleting the start-angle factor would make this particular bound false.

Facts & Assumptions

Given: The diagonal matrix and unit starting vector specified above.

[F1]

Lanczos largest Ritz values obey a Chebyshev start-angle bound, including degenerate branches: for a simple top eigenvalue, θm is the maximum Rayleigh quotient on Km(A,b) and the stated Chebyshev error bound includes τ2=∥(I−P)b∥22/∥Pb∥22.

Verification

1.1givenF1algebra

Since 1/10000+2(9999/20000)=1, the vector b is unit. Also Ab=(1/10,2α,α)T. Set v:=(−α2,9α/100,−8α/100)T. Direct dot products give vTb=0 and vTAb=−α2/10+18α2/100−8α2/100=0. The vectors b,Ab are independent because their first coordinates would force a proportionality factor 10, while the second coordinates would force factor 2. Hence K2(A,b) is two-dimensional and equals v⊥.

1.2givenF1F2algebra

We have v22+v32v12=145(1/10000)α2=2909999. For every unit x∈K2(A,b), vTx=0. By [F2], ∣x1∣2≤v22+v32v12(x22+x32)=2909999(1−∣x1∣2), so ∣x1∣2≤290/10289. Its Rayleigh quotient satisfies xTAx=10x12+2x22+x32≤2+8x12≤2+232010289<94, since 4(2320)=9280<10289. Taking the maximum gives θ2<9/4, so λ1−θ2>31/4.

2.1givenF1step 1.2algebra∎

The top eigenspace is span⁡{e1}, hence τ2=(9999/10000)/(1/10000)=9999. The unwanted interval is [1,2], and its affine exterior point is 1+2(10−2)/(2−1)=17, so T1(17)=17. The theorem's m=2 bound is λ1−θ2≤9⋅9999172=89991289, which is valid but large. If its factor τ2 were deleted, the proposed right side would be 9/289<31/4, contradicting step 1.2. Thus this start cannot support that angle-free bound.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Lanczos handles repeated top eigenvalues, absent top components, and exact breakdown

Example

Check four branches of Lanczos largest Ritz values obey a Chebyshev start-angle bound, including degenerate branches: (i) A=5I1 and b=1; (ii) A=diag⁡(5,5,1) with b=(1,0,1)T/2; (iii) A=diag⁡(5,2,1) with b=e2; and (iv) the same A with b=(e1+e2)/2. Verify the Rayleigh–Ritz values, top-eigenspace components, and exact invariant-subspace breakdown dimensions.

Facts & Assumptions

Given: The matrices, vectors, Krylov spaces, and Rayleigh–Ritz values in the Example.

[F1]

Lanczos largest Ritz values obey a Chebyshev start-angle bound, including degenerate branches: if the top eigenvalue has multiplicity r=n, every Rayleigh–Ritz value is λ1; if Pb=0, every θm≤λr+1; if the unwanted interval collapses and Pb≠0, then θm=λ1 for m≥2; and exact breakdown at dimension d with Pb≠0 gives θd=λ1.

[F2]

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

[F3]

The Arnoldi process for building an orthonormal basis of a Krylov subspace: exact breakdown at a column means its orthogonalized residual is zero.

[F4]

The Lanczos process as Arnoldi specialized to a Hermitian matrix, with the usual real-subdiagonal phase convention: for a real symmetric matrix, exact Lanczos is the corresponding exact Arnoldi process specialized to the Hermitian three-term recurrence.

Verification

1.1givenF1F2F3F4algebra

In case (i), take b=1. Then P=I, Pb=b≠0, and K1=R is invariant under A=5I1. The first Arnoldi residual is zero, so Lanczos breaks down at d=1; every nonzero vector has Rayleigh quotient 5, giving θm=5 for all m≥1 by [F1]. In case (ii), P projects onto span⁡{e1,e2}, so Pb=e1/2≠0. Here Ab=(5,0,1)T/2 and Ab−b=(4,0,0)T/2, so K2(A,b)=span⁡{e1,e3}, an invariant subspace. The first Arnoldi residual is nonzero, while Aq2∈K2=span⁡{q1,q2} makes the second residual zero; hence Lanczos breaks down at d=2. Since e1∈K2 has Rayleigh quotient 5, the maximum is θ2=5, as [F1] predicts for the collapsed interval branch.

1.2givenF1F2F3F4algebra

In case (iii), P projects onto e1, so Pb=0; Ae2=2e2 gives Km(A,e2)=span⁡{e2} for every m, and therefore θm=2=λr+1, in agreement with [F1]. At the first Arnoldi column, Ae2 already lies in K1=span⁡{e2}, so subtracting its projection leaves zero residual. Thus [F3]–[F4] give exact Lanczos breakdown at d=1 without a top component.

2.1givenF1F2F3F4algebra∎

In case (iv), b and Ab=(5e1+2e2)/2 are independent, so K2=span⁡{e1,e2}; this space is invariant under A. At the second Arnoldi column, Aq2∈K2=span⁡{q1,q2}, so subtracting its two orthogonal projections leaves zero residual. Thus [F3]–[F4] give exact Lanczos breakdown at d=2. Since Pb=e1/2≠0, [F1] gives θ2=5; directly, Ab−2b=3e1/2∈K2, so e1∈K2 and its Rayleigh quotient is 5.

Sources