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.
A small left-preconditioned residual can hide a large physical residual
Example
For any ordered field and , take the scalar system , , , and trial value . The physical residual has absolute value , while the left-preconditioned residual has absolute value .
Facts & Assumptions
Given: An ordered field , a scalar , and the scalar linear system with , preconditioner , right-hand side , and trial value .
Invertible preconditioners give equivalent linear systems, with the transformed residuals and errors written explicitly: for invertible , the left-preconditioned residual is , where .
Field: every nonzero field element has a multiplicative inverse.
Ordered field: the hypothesis gives and , so and lie in the positive cone; closure under addition gives as well.
Absolute value in an ordered field: if then .
Verification
Since , it is nonzero; [F2] gives its inverse . With , commutativity gives , so . The physical residual is .
By [F1], the left-preconditioned residual is . Both and are positive by [F3], so [F4] gives absolute values and , respectively.
Since , the left-preconditioned residual has strictly smaller absolute value than the physical residual. The ratio can be made as small as the chosen .
Depends on
Used by
Nothing in the library uses this result yet.
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
- Yousef Saad, Iterative Methods for Sparse Linear Systems, 2nd ed., §9.3.4, printed pp. 285–286 (standard reference, not scraped)
- Richard Barrett et al., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, 2nd ed., §3.1.2, printed pp. 35–36 (standard reference, not scraped)