Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 y′=a(y)+b(y) of Additive autonomous ODE partitions, set γ:=1−12,δ:=−12. 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 A~=(000γ00δ1−δ0),b~=(δ,1−δ,0),c~=(0,γ,1), A=(0000γ001−γγ),b=(0,1−γ,γ),c=(0,γ,1). For a step h>0 from y, the method is defined by Y1=y,Y2=y+γha(Y1)+γhb(Y2), Y3=y+h[δa(Y1)+(1−δ)a(Y2)]+h[(1−γ)b(Y2)+γb(Y3)],y+=Y3. 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

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