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

Fourth-order global error for RK4 on a regularized vortex particle tube

Statement

Fix ε>0, finitely many vortex weights, T>0, and the regularized finite-particle vector field of Equal-probability mean-field and weighted signed vortex particle systems, possibly with an added common smooth force correction gq(t,X,xi) for spatial force quadrature. Suppose the resulting nonautonomous state field f(t,X) is jointly C4 on an open time-state domain, with derivatives through order four bounded on a common compact convex tube T compactly contained in that domain. Assume the exact path, RK4 grid states, and every RK4 stage lie in that tube for h=T/N≤h0, and the common force correction is included in these bounds. Let C4 be a uniform exact-start defect constant, so the local defect is at most C4h5 as in One-step ODE methods, local defect, uniform order, and step stability. Let L∗ be the stability constant from One-step Lipschitz bound for classical RK4 on an admitted tube, so the one-step factor is 1+L∗h. For exact initialization, the state errors Ek satisfy max⁡0≤k≤NEk≤{C4eL∗T−1L∗h4,L∗>0,C4Th4,L∗=0. The tube and stage-admissibility assumptions are conditional; no invariance or global numerical-domain claim is made. The constant C4 may depend on ε, particle count, the quadrature field, and the tube.

For every step k, assume all RK4 stages generated from both the exact start x(tk) and the numerical start Xk lie in T, and both one-step maps are defined. Let L be a uniform operator-norm bound for DXf on T and set L∗=LeLh0, as in the stability lemma. The only admitted start pair used in the stability estimate at step k is (x(tk),Xk).

Facts & Assumptions

Given: The smooth nonautonomous finite-particle field, the common tube, bounded derivatives through order four, exact initialization, and admitted RK4 stages from both the exact and numerical starts at each step.

[F1]

Classical RK4 has local order at least four for a C4 autonomous field with bounded derivatives and exact-start stages in a compact convex tube; adjoining the time equation t′=1 gives the same local order for the stated nonautonomous field (Orders and scalar stability functions of Euler, midpoint, and classical RK4).

[F2]

The one-step defect is measured from the exact starting state, and local order four means a uniform O(h5) bound (One-step ODE methods, local defect, uniform order, and step stability).

[F3]

For the exact/numerical start pair at each grid step, the RK4 map is Lipschitz with factor at most 1+L∗h when all stages from both starts are admitted (One-step Lipschitz bound for classical RK4 on an admitted tube).

[F4]

The finite recurrence ek+1≤(1+Lh)ek+Chp+1 has the stated exponential bound (Finite geometric error bound from a one-step recurrence).

[F6]

A uniform operator-norm bound on the state derivative makes each fixed-stage-time restriction L-Lipschitz along line segments contained in the convex tube: the chain rule differentiates the restriction to the segment, and the vector mean-value inequality bounds its endpoint difference (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), The mean value inequality: if f:[a,b]→Rm is continuous and differentiable on (a,b) with ∥f′∥2≤M, then ∥f(b)−f(a)∥2≤M(b−a)).

Proof

1.1givenF1F2

Apply [F1] to the autonomous augmentation (t,X)′=(1,f(t,X)). The time component is integrated exactly by RK4 because its weights sum to one; the state component therefore has the same exact-start defect order. The tube and derivative assumptions in the Given clause make the defect uniform, so [F2] gives the bound C4h5.

2.1F2F3F5F6step 1.1algebra

Put Ek=∣Xk−x(tk)∣ for the numerical and exact grid states. Applying [F3] to the admitted exact/numerical start pair, using [F6] for the state Lipschitz premise, bounds the one-step map difference by (1+L∗h)Ek. The exact-start local defect is at most C4h5 by step 1.1 and [F2]. The Euclidean triangle inequality [F5] therefore gives Ek+1≤(1+L∗h)Ek+C4h5, with E0=0.

3.1F4step 2.1∎

Apply [F4] with p=4, C0=0, C=C4, L=L∗, and the recurrence from step 2.1. Its L∗>0 and L∗=0 cases are exactly the displayed bound.

Depends on

Used by

Dependency tree · two levels

60 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