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.
Implicit residuals and their update and derivative units
Definition
Let be the residual map of an implicit equation, where is the admissible set for the unknown vector. An exact solution is a point with .
An equation residual need not have the same units as its unknown. When the equation is normalized so that each component of has the units of the corresponding component of , the update residual at an approximate solution is . For example, has squared state units when does, so it must first be normalized to use this update-residual convention. If the original equation was divided by a positive step scale , then the derivative residual is , and the corresponding update residual is times that derivative residual. A residual norm is not a forward-error bound unless a separate inverse or stability estimate converts it to .
For a first-order vector field on an open time-state domain (First-order systems, initial value problems, and solutions on intervals), take a time , input , and step with . For backward Euler, an endpoint is admissible only when , and its update residual is
so the derivative residual is .
For an -stage implicit Runge–Kutta tableau , a stage vector is admissible only when for every . On that admissible set, its stage update residual has blocks
The stage derivative residual is . These conventions distinguish an equation residual from the distance to its exact root.
Depends on
Used by
- Finite budget RATTLE solve with scaled constraint residuals Algorithm
- Finite-budget coupled backward Euler for an index-one DAE Algorithm
- Finite-budget coupled constant-step BDF2 for an index-one DAE Algorithm
- Finite-budget Newton and chord solves with scheduled factorization reuse Algorithm
- Finite-precision one-stage Rosenbrock step with residual status Algorithm
- One-step IMEX Euler with an implicit branch and residual status Algorithm
- Two-stage second-order Rosenbrock W-method with shared factorization Algorithm
- Backward Euler step equation and algebraic residual Definition
- Implicit Runge–Kutta stage equations and update Definition
- The ARS(2,2,2) additive tableau and its three stages Definition
- A fixed RATTLE residual budget allows an O(epsilon) drift envelope Example
- One Robertson reaction step: Newton work and the chord reuse tradeoff Example
- Rosenbrock–Euler has an explicit one-step defect and solve-residual allowance Lemma
- Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error Lemma
- The two implicit ARS stages have selected branches and residual bounds Lemma
- The two-stage Rosenbrock W-method has a cubic local defect and explicit stage-residual allowance Lemma
- Backward Euler propagates unscaled algebraic update residuals Theorem
- IMEX Euler preserves first-order convergence under per-step residuals of order h squared Theorem
- Scaled RATTLE residuals bound the finite solve trajectory error Theorem
- The ARS(2,2,2) pair is second order under distinct stage residual tolerances Theorem
Dependency tree · two levels
3 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
- Ernst Hairer and Gerhard Wanner, Introduction à l’Analyse Numérique, Chapter III: Équations Différentielles Ordinaires (standard reference, not scraped)
- John C. Butcher, Implicit Runge–Kutta Methods, tutorial accompanying Numerical Methods for Ordinary Differential Equations (standard reference, not scraped)