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.
Krylov methods and Lanczos convergence — Examples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugate Gradients, MINRES and Preconditioning
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalue Iterations and the QR Algorithm
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite-precision direct factorizations and least squares
- Foundations of the Real Numbers for Analysis
- Fundamental Trigonometric Identities
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Krylov methods and Lanczos convergence
- Krylov Subspaces, Arnoldi and GMRES
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Norms, Condition Numbers and Numerical Stability
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
Unrestarted GMRES solves a two-dimensional diagonal system in two steps while GMRES(1) restarts after one
Example
Let , , and . Verify that unrestarted GMRES reaches the exact solution by step , whereas the first GMRES cycle leaves residual .
Facts & Assumptions
Given: The real diagonal system and starting vector in the Example.
The GMRES iterate as the residual minimizer over an affine Krylov space: GMRES minimizes over .
Restarted GMRES as repeated GMRES cycles on fixed-size Krylov spaces: GMRES completes one GMRES step at the current guess and then starts a new cycle from the resulting residual.
Verification
We have and the determinant of the matrix with columns is . Thus . The exact solution is , so the minimum residual in [F1] is zero at step .
In the first GMRES cycle, [F1] restricts to for a scalar . Its residual is , whose squared norm is . The unique minimizer is , and the residual is , which is nonzero. By [F3] this is the first-cycle residual before any restart.
CG's positive-denominator hypothesis fails on an indefinite system while MINRES can start
Example
For , , and , evaluate the formal first CG denominator expression outside the CG definition's SPD domain, and compute the first MINRES least-squares problem and the exact solution's membership in . Contrast this with the first CG denominator for and the same , and verify that one exact CG step decreases the -energy error norm from to .
Facts & Assumptions
Given: The two real diagonal systems and starting data in the Example.
The conjugate-gradient recurrence: for real SPD , , and , one has and the first CG step uses . Substitution of an indefinite matrix into this formula is only a formal attempt to extend it beyond its defined domain.
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 .
The MINRES iterate from the Lanczos tridiagonal least-squares problem: MINRES step minimizes , where , when Lanczos completes its first column without breakdown.
Verification
Formally setting for gives , so while . Thus attempting the first CG update formula would divide by zero. Since is indefinite, [F1] does not define a CG step for it, and the SPD theorem [F2] does not apply.
The normalized first Lanczos vector is . Then and has norm , so the first subdiagonal coefficient is . Hence [F3] applies at step , with and . The squared objective is , uniquely minimized at even over . Also and are linearly independent, so [F4] gives . The exact solution therefore lies in ; no step- MINRES claim is needed after the invariant-subspace breakdown.
For , the first CG denominator is and . The exact solution is , so and [F5] gives . The first iterate is , hence and . Thus the energy-error norm decreases from to , a factor of . The recursive residual is . This verifies the positive first denominator and energy decrease in this SPD instance, contrasting with step 1.1.
A poorly aligned start delays the largest Ritz value and requires the start-angle factor
Example
Let and Verify that , bound the largest two-step Ritz value by , 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.
Lanczos largest Ritz values obey a Chebyshev start-angle bound, including degenerate branches: for a simple top eigenvalue, is the maximum Rayleigh quotient on and the stated Chebyshev error bound includes .
Verification
Since , the vector is unit. Also . Set Direct dot products give and . The vectors are independent because their first coordinates would force a proportionality factor , while the second coordinates would force factor . Hence is two-dimensional and equals .
We have For every unit , . By [F2], so . Its Rayleigh quotient satisfies since . Taking the maximum gives , so .
The top eigenspace is , hence . The unwanted interval is , and its affine exterior point is , so . The theorem's bound is which is valid but large. If its factor were deleted, the proposed right side would be , contradicting step 1.2. Thus this start cannot support that angle-free bound.
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) and ; (ii) with ; (iii) with ; and (iv) the same with . 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.
Lanczos largest Ritz values obey a Chebyshev start-angle bound, including degenerate branches: if the top eigenvalue has multiplicity , every Rayleigh–Ritz value is ; if , every ; if the unwanted interval collapses and , then for ; and exact breakdown at dimension with gives .
The Arnoldi process for building an orthonormal basis of a Krylov subspace: exact breakdown at a column means its orthogonalized residual is zero.
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
In case (i), take . Then , , and is invariant under . The first Arnoldi residual is zero, so Lanczos breaks down at ; every nonzero vector has Rayleigh quotient , giving for all by [F1]. In case (ii), projects onto , so . Here and , so , an invariant subspace. The first Arnoldi residual is nonzero, while makes the second residual zero; hence Lanczos breaks down at . Since has Rayleigh quotient , the maximum is , as [F1] predicts for the collapsed interval branch.
In case (iii), projects onto , so ; gives for every , and therefore , in agreement with [F1]. At the first Arnoldi column, already lies in , so subtracting its projection leaves zero residual. Thus [F3]–[F4] give exact Lanczos breakdown at without a top component.
In case (iv), and are independent, so ; this space is invariant under . At the second Arnoldi column, , so subtracting its two orthogonal projections leaves zero residual. Thus [F3]–[F4] give exact Lanczos breakdown at . Since , [F1] gives ; directly, , so and its Rayleigh quotient is .
Sources
- Yousef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §§6.4–6.5, printed pp. 179–193
- Youcef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §§6.6–6.8, printed pp. 194–204
- David Bindel, Matrix Computations (CS 6210), Cornell University, Fall 2012, Lecture 35: Some minimization problems
- Youcef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §6.11.1, printed pp. 209–210
- David Bindel, Matrix Computations (CS 6210), Cornell University, Fall 2012, Lectures 38–39
- Youcef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §§6.6 and 6.11.1, printed pp. 194–195 and 209–210