Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

A stage residual tolerance preserves collocation order

Statement

Fix M nodes and an integer 1≤p≤M. On a fixed interval use exact collocation stages Un∗ and the collocation endpoint map Ψh,n of Collocation tableau from distinct quadrature nodes. Assume the hypotheses of Contraction and residual error bound for the SDC sweep hold uniformly, with contraction constants qn≤q0<1, the common field Lipschitz constant is L, and all exact and approximate stages and grid states stay in one compact tube. Assume also that the hypotheses of M-node collocation has local defect order M and Small-step collocation maps are Lipschitz stable hold uniformly at all mesh times for the exact and numerical starting states, including the bounded componentwise smoothness, exact-path derivative bound, and common branch and tube requirements. Let Un∗ be the collocation stage vector for the numerical start yn, and suppose the SDC stage vector Vn belongs to its invariant product ball Cn and satisfies ∥Sn(Vn)−Vn∥∞,2≤(1−qn)Cτhp+1. Starting from the exact initial value and setting yn+1=yn+h∑jbjf(tn+cjh,(Vn)j), the inexact method has global error O(hp). Thus a fixed residual constant and a stage target O(hp+1) preserve any collocation order p≤M; the bound is conditional on the stated local contraction and tube assumptions.

Facts & Assumptions

Given: A uniform mesh h=T/N, the exact IVP solution, the collocation tableau and branch, and the uniform local-defect and stability hypotheses, and the inexact stage vectors satisfying the Statement.

[F1]

Contraction and residual error bound for the SDC sweep: for every stage vector V in the invariant product ball Cn, ∥V−Un∗∥∞,2≤∥Sn(V)−V∥∞,2/(1−qn); this estimate does not require V to be an iterate.

[F2]

Collocation tableau from distinct quadrature nodes: the exact collocation endpoint is Ψh,n(u)=u+h∑jbjf(tn+cjh,Uj∗(u)).

[F3]

Small-step collocation maps are Lipschitz stable: exact collocation endpoints from two inputs in the tube differ by at most (1+Lsh) times the input difference, for a uniform Ls.

[F4]

M-node collocation has local defect order M: the exact-start collocation defect is bounded by C0hM+1 uniformly. For h≤1 and p≤M, this is also at most C0hp+1.

[L1]

Finite geometric error bound from a one-step recurrence: if en+1≤(1+Lsh)en+Chp+1 and e0=0, then max⁡nen≤C′hp on the fixed interval.

[A1]

For every n, Vn and Un∗ lie in the corresponding invariant product ball Cn; the segments joining corresponding stages lie in the tube, so the state Lipschitz estimate applies componentwise.

Proof

1.1A1F1F2algebra

Applying [F1] to the residual inequality in the Statement gives ∥Vn−Un∗∥∞,2≤Cτhp+1. By [F2], the same-input endpoint difference is ∥yn+h∑jbjf(tn+cjh,(Vn)j)−Ψh,n(yn)∥2≤hL∑j∣bj∣∥Vn−Un∗∥∞,2≤LCτ∥b∥1hp+2, where ∥b∥1=∑j∣bj∣ is finite because the tableau has finitely many finite entries.

2.1A1F3F4step 1.1algebra

Let en=∥yn−y(tn)∥2. Insert and subtract the exact collocation output from yn and the exact-start collocation output. By the triangle inequality, [F3] and [F4], en+1≤(1+Lsh)en+C0hp+1+LCτ∥b∥1hp+2≤(1+Lsh)en+C1hp+1, for h≤1, where C1=C0+LCτ∥b∥1 is independent of n,h.

3.1F1L1step 2.1∎

The initial error is zero. Apply [L1] to the recurrence in step 2.1 to obtain max⁡0≤n≤Nen≤C′hp. This proves the claimed order and makes no claim for a residual threshold that fails the stated O(hp+1) stage target.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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