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.
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 .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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
- Nicola Guglielmi and Ernst Hairer, Solving Delay Differential Equations, Chapter 1 (standard reference, not scraped)
- Roland Pulch, Equivalent Systems for Differential Equations with Polynomially Distributed Delay, version 3 (standard reference, not scraped)