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.
Delayed feedback gives an explicit two-block Euler recurrence
Example
Let , , and consider with history on , through . This is the retarded problem of Retarded delay equations and their history space, and its unique solution is supplied by Method of steps gives a unique retarded-delay solution. For with integer , apply Explicit Euler with a stored piecewise-linear delay history. The exact endpoint error is It vanishes when and is first order in otherwise, in agreement with Grid-aligned Euler has first-order error for retarded delays.
Facts & Assumptions
Given: A fixed delay , scalar coefficient , constant history , target , and the aligned grid .
The exact equation is with the given history; the retarded method of steps gives its unique solution (Retarded delay equations and their history space, Method of steps gives a unique retarded-delay solution).
The algorithm initializes exact history values and updates (Explicit Euler with a stored piecewise-linear delay history).
Under grid alignment, compact-tube, and time-Lipschitz assumptions, this algorithm has uniform first-order error for the returned interpolation (Grid-aligned Euler has first-order error for retarded delays).
Proof
On the first block , the delayed value is , so . On the second block, writing , the delayed value is , hence and .
The first Euler block gives for . On the second block, [F2] gives for . Summing yields . Pairing the terms and (and retaining the middle term when is odd) gives , so .
Subtracting step 1.2 from step 1.1 and using gives . Since this is nonnegative, its absolute value is the claimed error, including . On the first Euler block, ; on the second, for . The exact solution is polynomial on each of the first three delay blocks: besides step 1.1, on it is . These formulas give a common bounded tube independent of . The data therefore satisfy [F3] with , because is time-independent, the history has zero second derivative, and the tube is compact. Thus the exact error formula is consistent with the first-order guarantee.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
20 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)