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.
Delay differential equations and history discretization — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Delay differential equations and history discretization
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Global ODE and Log-density Integration Error
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- One-step ODE Consistency and Local Error
- Order, Zorn's Lemma, and the Axiom of Choice
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Objective
These examples work through four boundaries of the A-page results. A constant delayed-feedback problem gives an explicit two-block Euler recurrence and the exact endpoint error . A classical RK4 step crossing a retarded-delay breakpoint has an explicitly computed second-order exact-start defect, so smooth-ODE order does not transfer across that kink. A compatible scalar neutral history shows geometric derivative amplification for and a finite-horizon shift inverse whose norm grows at . A quadratic history with constant kernel computes the distributed-delay midpoint remainder and the additional stored-history contribution separately, including their signed-error cancellation. These are concrete calculations under their stated data; they do not assert general convergence on unstable neutral branches or a fourth-order delay-equation method across breakpoints.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
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.
A breakpoint-crossing RK4 step has a second-order defect
Example
Let and solve the retarded equation with history on . Choose an integer and , so a classical four-stage RK4 step from to crosses the first breakpoint at its midpoint. This example computes its exact-start local defect; it does not assert a fourth-order DDE bound for a mesh that crosses a breakpoint. On an ODE , the classical RK4 rule used here is , with , , and . For affine , the weighted average is , so this rule integrates exactly.
Facts & Assumptions
Given: The retarded problem, , and the step for .
The history and delayed equation are as in Retarded delay equations and their history space.
The exact-start one-step local defect is the difference between the numerical output from the exact starting value and the exact next value (One-step ODE methods, local defect, uniform order, and step stability).
Verification
For , the delayed value is , so and the solution matching is . Earlier RK4 steps lie wholly in this interval, where is affine and the RK4 rule in the Example integrates it exactly. Moreover jumps at : its left limit is , while its right limit is .
Write . On the crossing step, the delayed right-hand side is for and for . The terminal stage queries , and for , so this value is already computed exactly by step 1.1; the midpoint uses . Therefore the RK4 stage values are , , and .
The RK4 increment from the stated rule is .
The exact increment is . Subtracting this from gives the exact-start defect .
This defect is not as , so the smooth-RHS fourth-order local-defect premise cannot be transferred across this breakpoint. Aligning or restarting at the breakpoint removes this particular crossing step but supplies no higher-order theorem without separate smoothness and error bounds.
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].
Distributed-delay midpoint quadrature separates two history errors
Example
Take a scalar delay window of length , constant kernel , and continuous path on , so its history is . At query time , let and refine the composite midpoint rule with cells, where are integers and . The exact integral is . The exact-history midpoint remainder is , while using the piecewise-linear stored history adds a distinct node-history term. The stored-history rule returns an error of in this example; the two terms are separated in Distributed-delay midpoint error separates history and quadrature errors.
Facts & Assumptions
Given: A scalar history on , the constant kernel on , an aligned state mesh , and midpoint refinement .
The distributed-delay integral is (Distributed delays through a finite-window history integral).
The composite midpoint rule samples the stored piecewise-linear history at (Composite midpoint quadrature for a distributed delay history).
Under its uniform stored-path error bound on , the error bound splits into a stored-history node term and an exact-history quadrature remainder (Distributed-delay midpoint error separates history and quadrature errors).
Proof
At , [F1] gives . Put , the midpoint sum using the exact history. On a cell centered at , write with . Then . Summing the cells gives .
On the history cell in the variable , the stored chord of satisfies Its maximum is , so the uniform interpolation error on is . Since , every midpoint subcell is contained in one such chord cell.
The stored chord is affine on each width- cell, and the midpoint rule is exact for an affine function on each of its equal subcells: the centered linear term integrates to zero. Therefore the stored-history midpoint sum equals the integral of the chord. The area between the chord and on one width- cell is . Summing cells gives . Combining with step 1.1 yields .
At every sampled time lies in , so [F2] and step 1.2 give . Combining this with step 1.1 directly gives , the same history/quadrature split as [F3]; this calculation needs no error bound for positive-time stored values. The exact node-history term from step 2.1 is because . Its positive sign cancels the midpoint underestimate , leaving .