Alphabeta Math
PropositionStatement: 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.

One-node Gauss collocation is implicit midpoint of order two

Statement

Assume Countable Choice for the Lebesgue interval-measure formula. Let D⊆R×Rd be open and let f:D→Rd be an IVP vector field on a neighborhood of a common compact convex tube; consider an exact solution y of y′=f(t,y) on a fixed interval [0,T] in this tube. Assume each scalar coordinate has continuous partial derivatives through total order two and is Lipschitz in y there. Smoothness and Taylor expansions for vector-valued functions are interpreted componentwise, by applying scalar results to each coordinate. Assume the small-step one-stage collocation branch exists uniquely in this tube and its stages, the exact path, and the segments used in the estimates remain there. For the one-node Gaussian tableau of One-node Gauss data are midpoint data, the method is the implicit midpoint rule and, starting from the exact initial value, has global order two on any fixed interval for which these hypotheses hold uniformly.

Facts & Assumptions

Given: An exact IVP solution on [0,T], a common tube, the one-node Gaussian data, and the local branch assumptions in the Statement.

[F1]

One-node Gauss data are midpoint data: c1=1/2, b1=1, and Q11=1/2.

[F2]

Collocation tableau from distinct quadrature nodes: the one-stage equations are U=u+hQ11f(t+c1h,U) and Psih(u)=u+hb1f(t+c1h,U).

[F3]

Multivariable Taylor formula with a Lagrange remainder along a line segment and Chain sum product and composition rules for Banach derivatives: scalar Taylor expansion to second order has a uniform quadratic remainder on the tube and applies to each coordinate; differentiating each coordinate of y′=f(t,y) gives y′′=ft+Dyf f componentwise.

[F4]

Higher derivatives and the classes Ck and C∞: the one-variable coordinate paths use the scalar C2 convention; multivariable smoothness of the components of f is the partial-derivative assumption in the Statement.

[F5]

Small-step collocation maps are Lipschitz stable: if hL∥Q∥∞≤1/2, then the one-stage map has Lipschitz constant at most 1+2hL∣b1∣.

[F6]

Global error from uniform one-step defect and stability requires all numerical grid states and stages in its common tube. We establish that containment below, using Finite geometric error bound from a one-step recurrence: an error recurrence en+1≤(1+L0h)en+Ch3 with e0=0 gives a uniform bound en≤CTh2 on every mesh prefix of length at most T.

[F7]

First-order systems, initial value problems, and solutions on intervals: the exact path satisfies y′=f(t,y) on the stated interval.

[F9]

Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error: a bounded Lipschitz stage field on a closed product ball has a unique stage when h∥Q∥∞B≤R and h∥Q∥∞L<1.

[A1]

The exact path and stage values remain in the common tube, the unique local branch in the Statement is selected, and the segments used in the Lipschitz and Taylor estimates are contained there; all constants are uniform in the starting grid time.

[A2]

Countable Choice, as required by the one-node Lebesgue moment data in [F1].

Proof

1.1A1A2F1F2F3F4algebra

Substituting [F1] under [A2] into [F2] gives U=u+(h/2)f(t+h/2,U) and Ψh(u)=u+hf(t+h/2,U), which is precisely implicit midpoint. Since f is bounded on the compact tube, the stage equation gives U−u=O(h). Taylor expansion of each coordinate at (t,u) then gives U−u=(h/2)f(t,u)+O(h2): first use U−u=O(h) in f(t+h/2,U)=f(t,u)+O(h) and substitute that estimate back into the stage equation.

2.1A1F2F3F7step 1.1algebra

Write f0=f(t,u). Applying the first-order scalar Taylor formula with quadratic remainder [F3] to each coordinate at (t+h/2,U) and using step 1.1 yields f(t+h/2,U)=f0+h2(ft(t,u)+Dyf(t,u)f0)+O(h2) in Euclidean norm. The exact path has y′(t)=f0 by [F7] and y′′(t)=ft(t,u)+Dyf(t,u)f0 by [F3]. Coordinatewise Taylor's formula for y and the endpoint expression in step 1.1 therefore give y(t+h)−Ψh(u)=O(h3) uniformly.

3.1A1F1F3F5F8F9step 1.1step 2.1choosealgebra

Let K be the compact convex time-state tube in the Statement, and let V be its open neighborhood where f is componentwise C2. By [F8] choose r>0 such that the closed 4r-neighborhood K+ lies in V⊆D. This neighborhood is compact and convex, and [F8] gives uniform bounds B+ for f, L+ for Dyf, and bounds for the second partial derivatives there. If ∥u−y(tn)∥2≤r and h≤2r, every stage point (tn+h/2,Y) with ∥Y−u∥2≤r is within 3r of (tn,y(tn))∈K, hence lies in K+. For hB+/2≤r and hL+/2≤1/2, [F9] supplies the unique midpoint stage in that ball. Any other midpoint stage in K+ equals it by subtracting the equations and using hL+/2<1; thus it agrees with the branch assumed in the Statement whenever that branch lies in K. The Taylor estimates of steps 1.1–2.1 and stability [F5] apply uniformly on K+, with endpoint Lipschitz bound 1+2L+h.

4.1F6step 2.1step 3.1chooseinductionalgebra∎

Set y0=y(0) and compute on h=T/N. As long as en:=∥yn−y(tn)∥2≤r, step 3.1 defines the next stage and endpoint. Inserting the exact-start endpoint and using steps 2.1 and 3.1 gives en+1≤(1+2L+h)en+Ch3. On every such mesh prefix [F6] bounds all errors, including the newly computed endpoint error, by CTh2, with CT independent of the prefix length because that length is at most T. Choose h small enough that CTh2<r. Starting with e0=0, induction now continues every step and keeps every grid state within r of the exact path. All grid states and stages therefore lie in K+, and the same recurrence gives max⁡0≤n≤Nen≤CTh2. This proves global order two without assuming endpoint containment in the original tube.

Depends on

Used by

Dependency tree · two levels

112 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