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.
Grid-aligned Euler has first-order error for retarded delays
Statement
Fix and . Write . Let and a history define the retarded problem of Retarded delay equations and their history space on , with global state Lipschitz constant , and assume . Let be the unique solution there by Method of steps gives a unique retarded-delay solution. Suppose is twice continuously differentiable on the interval interior, with continuous one-sided extensions of and to the endpoints, and . For , where is a positive integer, assume the exact path and all Euler nodes generated for target lie in a fixed closed ball . Choose such that for , and set Assume that on , is bounded in norm by , and on it satisfies for fixed and all in this time interval. Put and Then, when Explicit Euler with a stored piecewise-linear delay history completes all updates (no evaluation budget or an integer budget ), its returned piecewise-linear interpolant through , where is the least integer with , satisfies All constants are independent of . The claim uses a fixed positive delay, grid alignment , time-Lipschitz , and a common compact tube; it asserts no order for state-dependent delays or a higher-order method crossing a delay breakpoint.
Facts & Assumptions
Given: The retarded delay problem on , the bounded twice differentiable history, an aligned grid, a completed Euler run (no budget or ), the stated uniform tube for the exact and Euler paths, and the stated bounds on .
The retarded problem's solution equals on and satisfies on (Retarded delay equations and their history space, Method of steps gives a unique retarded-delay solution).
The algorithm uses , and its stored history is the piecewise-linear interpolant of its history and solution nodes (Explicit Euler with a stored piecewise-linear delay history).
The global state Lipschitz bound is (Retarded delay equations and their history space).
A path with derivative norm at most is -Lipschitz, and its increments equal integrals of its derivative (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz).
The norm of an integrable vector-valued integral is at most the integral of the norm (For and integrable when , ; for , is integrable).
If exact nodal values of a path with cellwise second derivative bounded by are linearly interpolated on cells of width , the interpolation error is at most (Error bound for piecewise-linear stored delay histories).
A nonnegative retarded-delay integral inequality with history bound and forcing has running maximum at most (A Gronwall bound for retarded-delay inequalities).
A continuous state-Lipschitz ODE field has a unique local solution; if it is bounded on a compact state ball, the quantitative local theorem gives continuation on a short interval (Picard-Lindelöf local existence and uniqueness for first-order systems).
For the one-step map with local defect at most , stability at most , and exact and numerical states and stages inside a common compact tube, the uniform-grid global error on an interval of length is at most for , and for (Global error from uniform one-step defect and stability).
If with nonnegative continuous , then (Gronwall's integral inequality with variable and constant coefficients).
The exact-start local defect of a one-step map is its output from the exact starting value minus the exact next value (One-step ODE methods, local defect, uniform order, and step stability).
The Euclidean norm satisfies the triangle inequality (Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation).
The exact path and Euler nodes lie in , and the stated field and time-Lipschitz bounds hold on the displayed compact tubes.
Proof
Fix , let be the least integer with , and put . Run the algorithm through and call its stored interpolant . Convex interpolation and [A1] give . Extend it constantly just beyond each endpoint for local ODE neighborhoods of time radius less than . Define for . It is continuous and -Lipschitz in . By [F3], . Local solutions of therefore obey . The vector integral norm bound [F5] and triangle inequality [F12] justify this estimate. For , replace the first two terms by the constant and apply [F10]; this gives . On the compact tube of radius the field is bounded by , so [F8] continues each local solution by a common positive short-time amount while it remains in that ball. The a priori bound keeps each continuation endpoint within radius ; finitely many continuations cover . Denote the resulting solution by and set on . Since is a stored node, [F2] shows the Euler updates are exactly forward Euler applied to this fixed ODE.
The auxiliary path and the Euler states lie in the radius- tube, and . On positive-time cells, each slope of is an Euler right-hand side bounded by ; on history cells, [F4] and [F5] bound its slope by . Thus is -Lipschitz on .
The Euler map for the fixed ODE is . By [F3] and the triangle inequality [F12] it satisfies . For , [F3], the time bound, and step 2.1 give By [F4], the exact increment is the integral of ; integrating this estimate and using [F5] gives exact-start local defect at most by [F11] and [F12]. Apply [F9] on the uniform grid of length , with initial error zero. Since , it gives
On a solution cell, the nodal error bound proved in the preceding step contributes at most by the triangle inequality [F12]. The interpolant of the two exact endpoints differs from by at most : if , the endpoint-increment estimate is . Hence . On history cells, [F6] gives error at most . Therefore
Let for . It is zero on the history. Subtract the integral equations for and using [F1] and [F4], then use [F3] and bound by using step 4.1. This yields Apply [F7] with and constant forcing to obtain . The triangle inequality and the interpolation bound from step 4.1 give the claimed estimate on by [F12].
Depends on
- Retarded delay equations and their history space
- A Gronwall bound for retarded-delay inequalities
- Method of steps gives a unique retarded-delay solution
- Explicit Euler with a stored piecewise-linear delay history
- Error bound for piecewise-linear stored delay histories
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- One-step ODE methods, local defect, uniform order, and step stability
- Global error from uniform one-step defect and stability
- Picard-Lindelöf local existence and uniqueness for first-order systems
- Gronwall's integral inequality with variable and constant coefficients
- If $f : [a,b] \to \mathbb{R}^m$ is differentiable with integrable $f'$ then $\int_a^b f' = f(b)-f(a)$; and a bounded derivative makes $f$ Lipschitz
- For $a \le b$ and $f : [a,b] \to \mathbb{R}^m$ integrable when $a<b$, $\bigl\lVert\int_a^b f\bigr\rVert_2 \le \int_a^b \lVert f\rVert_2$; for $a<b$, $\lVert f\rVert_2$ is integrable
Used by
Dependency tree · two levels
70 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
- M. Zennaro, The Numerical Solution of Delay Differential Equations, Dobbiaco 2006 summer-school lecture notes (standard reference, not scraped)
- Nicola Guglielmi and Ernst Hairer, Solving Delay Differential Equations, Chapter 1 (standard reference, not scraped)