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 be open and let be an IVP vector field on a neighborhood of a common compact convex tube; consider an exact solution of on a fixed interval in this tube. Assume each scalar coordinate has continuous partial derivatives through total order two and is Lipschitz in 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 , a common tube, the one-node Gaussian data, and the local branch assumptions in the Statement.
One-node Gauss data are midpoint data: , , and .
Collocation tableau from distinct quadrature nodes: the one-stage equations are and .
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 gives componentwise.
Higher derivatives and the classes and : the one-variable coordinate paths use the scalar convention; multivariable smoothness of the components of is the partial-derivative assumption in the Statement.
Small-step collocation maps are Lipschitz stable: if , then the one-stage map has Lipschitz constant at most .
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 with gives a uniform bound on every mesh prefix of length at most .
First-order systems, initial value problems, and solutions on intervals: the exact path satisfies on the stated interval.
A compact set inside an open set has a uniform neighborhood radius gives a uniform positive neighborhood radius for a compact set inside an open set. Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line makes a closed bounded Euclidean neighborhood compact, and For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent bounds continuous scalar derivatives on it.
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 and .
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.
Countable Choice, as required by the one-node Lebesgue moment data in [F1].
Proof
Substituting [F1] under [A2] into [F2] gives and , which is precisely implicit midpoint. Since is bounded on the compact tube, the stage equation gives . Taylor expansion of each coordinate at then gives : first use in and substitute that estimate back into the stage equation.
Write . Applying the first-order scalar Taylor formula with quadratic remainder [F3] to each coordinate at and using step 1.1 yields in Euclidean norm. The exact path has by [F7] and by [F3]. Coordinatewise Taylor's formula for and the endpoint expression in step 1.1 therefore give uniformly.
Let be the compact convex time-state tube in the Statement, and let be its open neighborhood where is componentwise . By [F8] choose such that the closed -neighborhood lies in . This neighborhood is compact and convex, and [F8] gives uniform bounds for , for , and bounds for the second partial derivatives there. If and , every stage point with is within of , hence lies in . For and , [F9] supplies the unique midpoint stage in that ball. Any other midpoint stage in equals it by subtracting the equations and using ; thus it agrees with the branch assumed in the Statement whenever that branch lies in . The Taylor estimates of steps 1.1–2.1 and stability [F5] apply uniformly on , with endpoint Lipschitz bound .
Set and compute on . As long as , step 3.1 defines the next stage and endpoint. Inserting the exact-start endpoint and using steps 2.1 and 3.1 gives . On every such mesh prefix [F6] bounds all errors, including the newly computed endpoint error, by , with independent of the prefix length because that length is at most . Choose small enough that . Starting with , induction now continues every step and keeps every grid state within of the exact path. All grid states and stages therefore lie in , and the same recurrence gives . This proves global order two without assuming endpoint containment in the original tube.
Depends on
- Collocation tableau from distinct quadrature nodes
- One-node Gauss data are midpoint data
- First-order systems, initial value problems, and solutions on intervals
- The derivative and the Riemann integral of a vector-valued function: an intrinsic derivative and a componentwise integral
- Small-step collocation maps are Lipschitz stable
- Multivariable Taylor formula with a Lagrange remainder along a line segment
- Chain sum product and composition rules for Banach derivatives
- Higher derivatives and the classes $C^k$ and $C^\infty$
- Global error from uniform one-step defect and stability
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- A compact set inside an open set has a uniform neighborhood radius
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
- Small-step implicit Runge–Kutta stages have a unique branch and controlled residual error
- Finite geometric error bound from a one-step recurrence
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
- Ernst Hairer, Syvert P. Nørsett, and Gerhard Wanner, Solving Ordinary Differential Equations I, 2nd ed., Chapter II §II.7 (standard reference, not scraped)
- Mathew F. Causley and David C. Seal, On the convergence of spectral deferred correction methods, Communications in Applied Mathematics and Computational Science 14 (2019), §3 (standard reference, not scraped)