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.
Neutral derivative feedback amplifies outside the stable branch
Example
For any , let and on . Consider This is the scalar neutral problem of Scalar neutral delay equations and the derivative-segment shift. Its history is compatible at zero. On each later delay segment its derivative is multiplied by : Thus for , derivative norms grow geometrically from segment to segment. At the boundary , the finite-horizon shift inverse exists but its norm grows with the number of segments. The uniform resolvent bound in The neutral derivative shift has a bounded Neumann inverse when is therefore restricted to .
Facts & Assumptions
Given: A positive delay , the compatible history above, real , and a finite horizon with integer .
The scalar neutral equation is , and compatibility is (Scalar neutral delay equations and the derivative-segment shift).
Compatible history and continuous state-Lipschitz give a unique solution by method of steps (Method of steps gives a unique compatible neutral-delay solution).
When , the segment shift inverse has norm at most (The neutral derivative shift has a bounded Neumann inverse when ).
Proof
Differentiating the displayed polynomial gives , , and . With , the compatibility equation [F1] reads , so it holds. The zero right-hand side is continuous and Lipschitz in the two state variables. Therefore [F2] supplies the unique solution on every finite horizon .
On the first segment, the equation gives . If on segment the derivative is , then on segment the same equation gives . Compatibility makes the left and right endpoint values agree at every breakpoint, so induction proves the formula for . Since , each segment derivative has supremum at least ; for this is geometric amplification.
For , on the -segment space from [F1], let and for . The defined shift has and for , so . Also , hence by multiplying the finite sum. Since and , the inverse norm is at least . Thus no horizon-independent bound follows at , consistent with the strict hypothesis in [F3].
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 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)