Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 leading Euler–Heun estimator coefficient can vanish

Example

Apply the Euler–Heun pair to y′=t2, y(0)=0, on one step of size h>0. The low-order defect begins at order h3, not h2, so the embedded difference is not asymptotically equal to the low-order defect in ratio.

Facts & Assumptions

Given: The field f(t,y)=t2, initial time and value t0=y0=0, and h>0.

[F1]

Euler–Heun embedded Runge–Kutta pair: K1=f(0,0), K2=f(h,hK1), YE=hK1, and YH=h2(K1+K2).

[F2]

Local orders and leading estimator term for the Euler–Heun pair: the local error expansions compare each one-step value with the exact endpoint.

[F3]

A nonzero leading defect makes the embedded difference asymptotically match the low-order defect: a ratio-one conclusion requires a nonzero leading low-defect coefficient.

Verification

1.1givenF1F2algebra

Here K1=0 and K2=h2, so YE=0 and YH=h3/2. Since y(h)=∫0ht2dt=h3/3, the Euler defect is −h3/3, the Heun defect is h3/6, and the embedded estimator is ∣YH−YE∣=h3/2.

2.1F1F3step 1.1algebra∎

The Euler defect has zero coefficient at order h2 and the estimator-to-Euler-defect ratio is (h3/2)/(h3/3)=3/2 for every h>0. This concrete case shows why [F3] requires a nonzero leading coefficient before asserting ratio one.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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