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.
A bounded fifth derivative gives the central-difference expansion required by Richardson extrapolation
Statement
Let be open, let , and let with . Suppose on a neighborhood of this interval and throughout it. Then for some real ,
The same coefficient works for every admissible at the fixed point .
Facts & Assumptions
Given: The domain, smoothness and fifth-derivative bound in the statement.
Forward and central difference stencils with bounded evaluation errors: for with both stencil points in the domain.
The Lagrange and Cauchy forms of Taylor's remainder and Taylor polynomials and their remainders: for a function on the interval, the remainder after the degree- Taylor polynomial at is at an intermediate point .
Absolute value in an ordered field and Basic properties of the absolute value: absolute values are nonnegative and .
Proof
Given: The hypotheses listed above.
Apply [F2] at to and . The degree-four Taylor polynomials subtract to , because the constant, quadratic and fourth-degree terms agree at the two endpoints. Each remainder has magnitude at most .
By [F3]–[F4], the difference of the two remainders has magnitude at most . Divide the subtracted expansion by and use [F1]: the remainder in is bounded by , and the cubic term becomes .
Depends on
Used by
Dependency tree · two levels
18 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
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, finite differences (standard reference, not scraped)
- Andreas Buttenschoen, Introduction to Scientific Computing, Numerical Differentiation (standard reference, not scraped)