Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Each SDC sweep raises the order up to the collocation order

Statement

Fix M≥1 collocation nodes and a nonnegative integer k independent of h. Use the explicit-left-Euler SDC sweep in Finite explicit-left-Euler spectral deferred-correction sweep with constant predictor U0=1u and form the candidate endpoint from Uk, after k completed sweeps. Assume each coordinate of f has continuous partial derivatives through total order M on an open neighborhood of a common compact tube T; assume f is state-Lipschitz with constant L and bounded by B on T, which contains the exact path, all iterates, and the comparison segments. Also assume the exact-path integrand has the derivative bound required by M-node collocation has local defect order M. At each mesh time tn, let Un⊆Ttn:={u:(tn,u)∈T} be a set of starting states containing the exact and numerical grid states used in the global-error comparison. For every u∈Un, assume the constant predictor U0=1u belongs to a nonempty closed product ball Cn,u used in Contraction and residual error bound for the SDC sweep, and each inner stage map and sweep preserves Cn,u. Assume the contraction theorem holds uniformly with a=hL∥QΔ∥∞≤1/2 and q≤Cqh<1. For the global-order assertion, initialize the numerical grid solution exactly, y0=y(0). For fixed k, the Uk endpoint map has exact-start defect O(hp+1) and global order p=min⁡(M,k+1) on any fixed interval, provided all grid states stay in T. The claim is local-step and fixed-k; it asserts no uniform constants as M or k grows.

Facts & Assumptions

Given: A fixed uniform mesh, an IVP, its collocation stages and endpoint, the constant SDC predictor, and the uniform tube and contraction hypotheses.

[F1]

Collocation tableau from distinct quadrature nodes: U∗=1u+hQF(U∗) and the collocation endpoint is u+h∑jbjFj(U∗).

[F2]

Finite explicit-left-Euler spectral deferred-correction sweep: each iterate satisfies Uj+1=1u+hQΔF(Uj+1)+h(Q−QΔ)F(Uj), and its candidate endpoint is u+h∑jbjFj(Uk).

[F3]

Contraction and residual error bound for the SDC sweep: there is a unique collocation stage vector U∗∈C; when U0∈C, the iterates converge to it and ∥Uk−U∗∥∞,2≤qk∥U0−U∗∥∞,2.

[F4]

M-node collocation has local defect order M: the exact-start collocation defect is uniformly O(hM+1).

[F5]

Finite geometric error bound from a one-step recurrence: if e0=0 and en+1≤(1+Csh)en+Chp+1 uniformly, then the maximum grid error is O(hp) on a fixed interval.

[A1]

The numerical grid solution starts at y0=y(0). The field satisfies ∥F(U)∥∞,2≤B and ∥F(U)−F(V)∥∞,2≤L∥U−V∥∞,2 on the common invariant tube. The fixed nodes make Q,QΔ,b finite and independent of h.

Proof

1.1A1F1F3algebra

The stage points of the contraction limit U∗ lie in the compact set T, since all iterates do and they converge by [F3]. The constant predictor gives ∥U0−U∗∥∞,2=∥hQF(U∗)∥∞,2≤h∥Q∥∞B by [F1] and the row-sum norm. Since q≤Cqh, [F3] gives ∥Uk−U∗∥∞,2≤Cqk∥Q∥∞Bhk+1 for fixed k (with the same O(h) bound when k=0).

1.2A1F2algebrainduction

To bound dependence on the input, let Dj=∥Uj(u)−Uj(v)∥∞,2 for two starts u,v∈Un, and put δ=hL∥Q−QΔ∥∞. Subtracting the stage equations [F2] and using the row-sum norm gives (1−a)Dj+1≤∥u−v∥2+δDj. Since a≤1/2 and δ=O(h), D0=∥u−v∥2 and induction for the fixed number k gives Dk≤Ck∥u−v∥2 with Ck independent of h.

1.3givenconstruct

Let Ω be the open neighborhood of T on which the stated smoothness holds, within the IVP domain. There is ρ>0 such that the closed 3ρ-neighborhood N of T lies in Ω: cover T by finitely many balls whose concentric doubled balls lie in Ω, and take 3ρ smaller than the minimum of their radii. The set N is compact, so all partial derivatives through order M are bounded there. In particular, since M≥1, the state Jacobian has a uniform bound L^; applying the scalar mean-value estimate along state segments gives a state Lipschitz bound L^ on each convex cylinder contained in N. For an exact start u=y(t), the fixed cylinder Kt=[t,t+ρ]×B‾(u,ρ) is compact, convex, and contained in N, because its points have distance at most 2ρ from (t,u)∈T. These bounds are uniform in t and independent of h.

2.1givenA1F1F3F4step 1.1step 1.3algebra

For an exact start, [F1] and step 1.1 give sup⁡0≤τ≤1∥uh(τ)−u∥2≤hΛMB. The exact path has speed at most B, hence sup⁡0≤τ≤1∥y(t+τh)−u∥2≤hB. Thus for h≤ρ and hBmax⁡{1,ΛM}≤ρ, both paths, the stages, and their comparison segments lie in Kt. Any two collocation solutions V,W with stage points in Kt satisfy ∥V−W∥∞,2≤hL^∥Q∥∞∥V−W∥∞,2 by subtracting [F1]. Taking hL^∥Q∥∞<1 proves uniqueness there; existence follows from [F3] and the containment of U∗. Together with the assumed exact-path derivative bound, step 1.3 now verifies every tube, smoothness, and branch hypothesis of [F4], with uniform constants.

2.2A1F2step 1.2algebra

Applying the endpoint formula [F2] to the two stage vectors gives ∥Ψh(k)(u)−Ψh(k)(v)∥2≤∥u−v∥2+hL∥b∥1Dk≤(1+Csh)∥u−v∥2 for u,v∈Un.

3.1A1F2F4step 1.1step 2.1algebra

The endpoint formula in [F2], the state Lipschitz bound, and step 1.1 give a difference from the exact collocation endpoint of at most hL∥b∥1∥Uk−U∗∥∞,2=O(hk+2). Adding the exact collocation defect [F4], whose hypotheses were checked in step 2.1, gives an exact-start defect O(hM+1)+O(hk+2)=O(hp+1), since p+1=min⁡(M+1,k+2) and h≤1.

4.1A1F4F5step 3.1step 2.2algebra∎

Let en=∥yn−y(tn)∥2. Both starts lie in Un by the Statement. Insert and subtract the exact-start one-step output to obtain, using step 2.2 and step 3.1, en+1≤(1+Csh)en+Chp+1 with p=min⁡(M,k+1) and a uniform C. The initial error is e0=0, so [F5] gives global order p.

Depends on

Used by

Dependency tree · two levels

37 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