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.
Verified point and uniform linear residual certificate data
Definition
Let , let be a nonempty set of matrices in , and let be a nonempty subset of . A uniform residual certificate consists of a point matrix , a point vector , and numbers such that
for every and . Here is the operator norm induced by the Euclidean vector norm, as in The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||. The certificate is usable when ; in that case its reported error radius is . The point-data case is and .
This definition specifies mathematical upper bounds; it does not specify how a computation establishes them.
Depends on
Used by
- Finite precision point linear solve certificate with explicit status Algorithm
- Finite-budget exact or safeguarded inexact Newton-Kleinman policy iteration Algorithm
- Finite-budget stable block reordering for Schur and QZ forms Algorithm
- Uniform interval linear residual certificate with inconclusive status Algorithm
- A certified residual enclosure remains valid for an ill-conditioned 2 by 2 solve Example
- Finite Riccati candidate, Newton-Kleinman, and doubling wrappers return a status Lemma
- Verified Lyapunov residual, descent, and stability checks make an inexact Newton-Kleinman step safe Proposition
- A CARE residual and Lyapunov margin certify a unique stabilizing root in a matrix ball Theorem
- A DARE residual, Stein inverse bound, and Lyapunov margin certify a stabilizing root Theorem
- A uniform approximate inverse and residual enclose every linear solution Theorem
- The uniform interval residual certifier is sound on success Theorem
Dependency tree · two levels
2 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
- Siegfried M. Rump, Verification methods: Rigorous results using floating-point arithmetic, Acta Numerica 19 (2010), §10.5 (standard reference, not scraped)
- Nicholas J. Higham, Numerical Linear Algebra and Matrix Analysis, MIMS EPrint 2015.103, §1 (standard reference, not scraped)