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.
In exact arithmetic, CG residuals are mutually orthogonal and the search directions are -conjugate
Statement
Let be Hermitian positive definite, and run the conjugate-gradient recurrence in exact arithmetic. For all indices for which the quantities are defined,
Thus the residuals are mutually orthogonal and the search directions are -conjugate.
Facts & Assumptions
Given: A Hermitian positive-definite system and an exact-arithmetic CG run.
CG uses the recurrence with (The conjugate-gradient recurrence).
If , then (Before convergence, every CG denominator is positive).
The energy inner product is (The energy inner product and energy norm for a Hermitian positive-definite matrix).
Proof
We prove by induction on that are pairwise orthogonal and are pairwise -conjugate. For there is nothing to prove. Assume the claim through step . Because for and , the spans and agree for every .
For , the induction hypothesis and step 1.1 give using [L2], because lies in and is -conjugate to each of those earlier directions. Also, Since for , the induction hypothesis gives , and for the same identity is immediate. Using [F1], we obtain . Thus is orthogonal to every earlier residual.
For , Hermitian symmetry and [F1] give Because from [F1], step 2.1 implies , so . For , step 2.1 yields , hence Therefore because and by [F1], with positivity from [L1] ensuring these divisions are valid before convergence. This closes the induction.
Depends on
Used by
- CG on a 2×2 Hermitian positive-definite system reaches the solution in at most two steps Example
- In floating-point arithmetic, CG can lose exact residual orthogonality, A-conjugacy, and the finite-termination guarantee Remark
- CG is the Krylov Galerkin method, and the mth iterate uniquely minimizes the A-norm of the error over x₀+Kₘ(A,r₀) Theorem
Dependency tree · two levels
6 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
- Magnus R. Hestenes and Eduard Stiefel, Methods of Conjugate Gradients for Solving Linear Systems (standard reference, not scraped)
- Jonathan Richard Shewchuk, An Introduction to the Conjugate Gradient Method Without the Agonizing Pain (standard reference, not scraped)