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

8 results · all verified · 4 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 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Krylov Subspaces, Arnoldi and GMRES: Examples and Counterexamples

1 · Prerequisites

2 · Summary

These examples keep the exact traps visible. Early stabilization is controlled by the start vector's grade, not by the ambient matrix size; lucky Arnoldi breakdown is exact invariance, not a finite-precision accident; and GMRES can have monotone residuals without fast convergence on a nonnormal problem.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31Open item page →

A Krylov chain can stabilize early when the start vector has a short relative minimal polynomial

Example

Let

A=(010000005),b=(010).

Then Ab=e1, A2b=0, and the relative minimal polynomial of b is q(z)=z2. Hence

K1(A,b)=span{e2},K2(A,b)=span{e2,e1},Km(A,b)=K2(A,b)(m2).

So the Krylov chain stabilizes at grade 2, strictly before the ambient dimension 3.

Facts & Assumptions

Given: The matrix A and vector b displayed above.

[L1]

Krylov dimensions grow one step at a time until the grade and then stabilize (The dimensions of the Krylov spaces grow by one until the grade and then stabilize).

Verification

technique · direct
1.1

Direct multiplication gives Ab=e1 and A2b=0. Therefore q(A)b=0 for q(z)=z2, while no nonzero polynomial of degree <2 annihilates b because neither b nor Ab is zero. Hence the grade is ν(A,b)=2.

L1algebra
2.1

The displayed Krylov spaces follow from the vectors b,Ab,A2b. Since the grade is 2, [L1] predicts exactly the stabilization Km(A,b)=K2(A,b) for m2, which agrees with the calculation.

L1step 1.1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

A hand calculation of Arnoldi shows the Hessenberg factorization entry by entry

Example

Take

A=(210121012),v1=e1.

The first two Arnoldi steps give

v2=e2,v3=e3,Hˉ2=(211201),

so with Q2=[e1e2] and Q3=[e1e2e3] one has

AQ2=Q3Hˉ2.

Facts & Assumptions

Given: The matrix A and start vector v1=e1.

[L1]

Before breakdown, Arnoldi produces an orthonormal Krylov basis and the factorization AQm=Qm+1Hˉm (Before breakdown, Arnoldi produces an orthonormal Krylov basis and a rectangular upper-Hessenberg factorization).

Verification

technique · direct
1.1

Since Av1=2e1+e2, the first Arnoldi coefficients are h11=2, h21=1, and v2=e2. Next, Av2=e1+2e2+e3, so h12=1, h22=2, h32=1, and v3=e3.

L1algebra
2.1

Therefore Q2=[e1e2] and Q3Hˉ2=[Ae1Ae2]=AQ2. The vectors are orthonormal exactly as [L1] predicts, and the Hessenberg entries are visible column by column.

L1step 1.1
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31Open item page →

Lucky breakdown occurs when the current Krylov space is already invariant

Example

Let

A=diag(2,3,4),b=e1.

Then K1(A,b)=span{e1} and A(K1(A,b))K1(A,b), because Ae1=2e1. Arnoldi therefore breaks down exactly after the first step: the next residual is zero.

Facts & Assumptions

Given: The diagonal matrix A and start vector b=e1.

[L1]

Exact Arnoldi breakdown at the next step is equivalent to invariance of the current Krylov space (Exact Arnoldi breakdown is equivalent to invariance of the current Krylov space).

Verification

technique · direct
1.1

Here K1(A,b)=span{e1} and Ae1=2e1K1(A,b), so the current Krylov space is A-invariant.

algebra
2.1

By [L1], that invariance is equivalent to exact Arnoldi breakdown at the next step. Concretely, the Arnoldi residual is w1=Ae1Ae1,e1e1=2e12e1=0.

L1step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

A Ritz pair from Arnoldi has a residual given by the last Hessenberg column entry

Example

Continue the Arnoldi run from the previous example, where

H2=(2112),h3,2=1.

Take the unit eigenvector y=12(1,1)T of H2 with eigenvalue θ=3. Then the Ritz vector is

u=Q2y=12(e1+e2),

and its residual is

Auθu=12e3,

whose norm is 1/2.

Facts & Assumptions

Given: The Arnoldi data H2=(2112), h3,2=1, v3=e3, and y=12(1,1)T.

[L1]

For an Arnoldi Ritz pair, Auθu=hm+1,m(emy)vm+1 (An Arnoldi Ritz pair has residual norm controlled by the last Hessenberg subdiagonal entry).

Verification

technique · direct
1.1

One has H2y=3y, so θ=3 is a Ritz value and u=Q2y=12(e1+e2) is the associated Ritz vector. Also e2y=1/2.

algebra
2.1

Applying [L1] with m=2 gives Auθu=h3,2(e2y)v3=112e3. Therefore Auθu2=1/2.

L1step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

GMRES on a small nonsymmetric system becomes a two- or three-dimensional least-squares problem

Example

Consider

A=(2101),b=e2,x0=0.

Then r0=e2, so the one-step Arnoldi basis is v1=e2, v2=e1, and

Hˉ1=(11).

Thus one-step GMRES minimizes

e1Hˉ1y2=(1yy)2,

whose minimizer is y=12. Hence

x1=12e2.

Facts & Assumptions

Given: The system Ax=b with the displayed A,b,x0.

[L1]

Arnoldi reduces GMRES to the least-squares problem minyβe1Hˉmy2 (Arnoldi reduces GMRES to a least-squares problem for the small Hessenberg matrix).

Verification

technique · direct
1.1

Since r0=e2, one has β=1 and v1=e2. Also Av1=(1,1)T, so h11=1 and the normalized residual is v2=e1 with h21=1. Hence Hˉ1=(11).

L1algebra
2.1

By [L1], one-step GMRES minimizes (1y,y)T22=(1y)2+y2, whose derivative is 2+4y, so the minimizer is y=12. Therefore x1=x0+Q1y=12e2.

L1step 1.1algebra
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31Open item page →

A nonnormal matrix can make GMRES stagnate even when ordinary conditioning is not extreme

Statement refuted

Moderate ordinary conditioning by itself prevents GMRES stagnation.

The counterexample below shows a nonnormal 2×2 matrix with κ2(A)=(3+5)/2 for which the first GMRES step does not reduce the residual at all.

Facts & Assumptions

Given: The matrix A=(0211), the right-hand side b=e1, and the initial guess x0=0.

[L1]

The diagonalizable GMRES bound keeps the eigenvector-conditioning factor, not just the ordinary conditioning of A (For a diagonalizable matrix, the GMRES residual bound carries the eigenvector-conditioning factor κ(V)).

Counterexample

technique · direct
1.1

The initial residual is r0=e1, and the one-step GMRES search space is x=αe1. The corresponding residual is r(α)=e1αAe1=e1αe2, so r(α)22=1+α2, minimized at α=0. Thus the first GMRES step leaves the residual norm equal to 1.

algebra
2.1

The matrix is invertible with detA=2, and ATA=(1115) has eigenvalues 3±5. Hence the singular values are 3+5 and 35, so κ2(A)=3+52. Therefore exact stagnation can occur even when ordinary conditioning is only moderate. This is consistent with [L1], which warns that nonnormal behavior depends on eigenvector geometry, not eigenvalues or κ2(A) alone.

L1step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-31Open item page →

Restarted GMRES can need more cycles than unrestarted GMRES on the same system

Example

For the system

A=(0211),b=e1,x0=0,

full GMRES solves exactly in at most two steps because the matrix is 2×2, but restarted GMRES(1) stagnates immediately: every one-step cycle returns the same iterate x=0.

Facts & Assumptions

Given: The system from the previous counterexample.

[L1]

Restarted GMRES keeps cyclewise minimization but need not inherit the full unrestarted termination guarantee (Restarted GMRES preserves cyclewise residual minimization but loses the unrestarted finite-termination guarantee).

Verification

technique · direct
1.1

The previous calculation gives the one-step GMRES minimizer x1=0, so a GMRES(1) cycle starting from x0=0 ends where it started. Restarting therefore reproduces the same residual r0=e1 and the same one-step problem, so every cycle returns 0 again.

L1algebra
2.1

By contrast, unrestarted GMRES on an invertible 2×2 system reaches the exact solution by step 2. Thus restart length 1 preserves the cyclewise minimization promised by [L1] but discards the information needed for the full method's finite termination.

L1step 1.1algebra
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31Open item page →

Matrix-free GMRES accesses the matrix only through applications of the operator to vectors

Example

Define a linear operator on R4 by

T(v1,v2,v3,v4)=(2v1v2,v1+2v2v3,v2+2v3v4,v3+2v4).

Starting from b=e1, the first Krylov vectors are

b=e1,Tb=(2,1,0,0),T2b=(5,4,1,0).

So Arnoldi and GMRES can begin from repeated calls to the routine vT(v), without ever storing the full tridiagonal matrix of T.

Facts & Assumptions

Given: The operator T above and the start vector b=e1.

[F1]

In the matrix-free model, Krylov methods need only operator applications, vector updates, inner products, and norms (The matrix-free access model for Krylov methods).

[F2]

Restarted GMRES is built from ordinary GMRES cycles on such Krylov spaces (Restarted GMRES(m) as repeated GMRES cycles on fixed-size Krylov spaces).

Verification

technique · direct
1.1

Direct evaluation of the operator routine gives the displayed vectors Tb and T2b. Those are exactly the data from which the first Krylov spaces and the first Arnoldi orthogonalization steps are formed.

F1algebra
2.1

No entrywise matrix storage was used in step 1.1: only the map vT(v), vector arithmetic, and inner products are needed. Therefore this sparse example fits the matrix-free access model [F1], and restarted cycles [F2] use the same access pattern on each new residual.

F1F2step 1.1

Sources