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.
The ARS(2,2,2) additive tableau and its three stages
Definition
For the autonomous split problem of Additive autonomous ODE partitions, set The explicit tableau and the lower-triangular implicit tableau, using the separate stage conventions of Explicit Runge–Kutta tableaus, stage maps, and failure status and Implicit Runge–Kutta stage equations and update, are For a step from , the method is defined by Thus there are two implicit solves per step, one for each nonzero diagonal implicit stage. The unscaled stage-equation residual uses the update-residual convention of Implicit residuals and their update and derivative units. The tableaus and stages alone assert neither branch existence nor stability.
Depends on
Used by
- ARS(2,2,2) amplification on a two-cell reaction-diffusion grid Example
- The ARS(2,2,2) coefficients satisfy the coupled second-order identities Lemma
- The two implicit ARS stages have selected branches and residual bounds Lemma
- The ARS(2,2,2) bivariate scalar stability function Proposition
- The ARS(2,2,2) pair is second order under distinct stage residual tolerances Theorem
Dependency tree · two levels
7 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
- Uri M. Ascher, Steven J. Ruuth, and Raymond J. Spiteri, Implicit-explicit Runge-Kutta methods for time-dependent partial differential equations (standard reference, not scraped)
- Lorenzo Pareschi and Giovanni Russo, Implicit-explicit Runge-Kutta schemes and applications to hyperbolic systems with relaxation (standard reference, not scraped)