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.
Scalar neutral delay equations and the derivative-segment shift
Definition
Use the fixed positive-delay/history convention of Retarded delay equations and their history space in dimension . The canonical isometric coordinate map between and is as specified in Vector-valued functions , their limits and continuity, with the dictionary to the metric notions; the formulas below write the single coordinate as a real scalar.
Let , with integer , , and let be an open interval containing . Let be continuous and globally Lipschitz in its last two variables: for some , Let be continuously differentiable, with continuity and derivative as in Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point and The derivative of at a point that is a limit point of , and differentiability on a set. A scalar neutral delay initial-value problem is with history for . A solution is continuous on , continuously differentiable on with domain-relative endpoint derivatives, and satisfies the equation. The history is compatible at zero when The parameter restriction is the stable derivative-shift branch used below; the equation itself is defined for every real . No state-dependent delay is included.
For the finite horizon , write a derivative path as segments for and . Let be the set of -tuples of continuous real functions on , with continuity as in Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, and define and the delay shift by and for . The known derivative history on the first segment is a forcing term; on each later segment the delayed derivative is exactly the preceding segment . Thus the neutral derivative relation has the operator form , with containing the right-hand side and the known initial derivative history.
For a compatible-grid method with , , and , the corresponding mesh shift on arrays is for and for . For any finite array length and integer , denote the same rule by . If , use the max norm . If , the coordinate space consists of its unique empty array, the zero vector (The vector space of all functions with pointwise operations, and as the case ); define its norm to be and define to be the unique map from this zero space to itself. Thus no maximum of an empty real set is used. In particular . This records the delayed discrete derivative when estimating any partial sequence of Euler steps. The known derivative values from occupy the first steps.
Depends on
- Retarded delay equations and their history space
- Vector-valued functions $f : A \to \mathbb{R}^m$, their limits and continuity, with the dictionary to the metric notions
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
- The derivative $f'(c) = \lim_{x \to c} \frac{f(x) - f(c)}{x - c}$ of $f : A \to \mathbb{R}$ at a point $c \in A$ that is a limit point of $A$, and differentiability on a set
- The vector space $F^{X}$ of all functions $X \to F$ with pointwise operations, and $F^{n}$ as the case $X = n = \{0, 1, \dots, n-1\}$
Used by
- Explicit Euler for a scalar neutral delay on a compatible grid Algorithm
- Neutral derivative feedback amplifies outside the stable branch Example
- Finite execution and storage counts for compatible neutral Euler Lemma
- The neutral derivative shift has a bounded Neumann inverse when |a|<1 Lemma
- Compatible-grid Euler has first-order solution and derivative error for a stable neutral delay Theorem
- Method of steps gives a unique compatible neutral-delay solution Theorem
Dependency tree · two levels
36 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)