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.
Quadratic interpolation at three nodes is exact
Example
For at the three nodes , the cardinal interpolant is exactly .
Facts & Assumptions
Given: The ordered nodes and the function .
Cardinal-polynomial interpolation: is the sum of the nodal values times the cardinal functions.
Formal real polynomials, evaluation, degree, leading coefficient, and monic polynomials: is the evaluation of a formal polynomial of degree .
Existence and uniqueness of the cardinal-polynomial interpolant: the degree-at-most- polynomial matching at these three distinct nodes is uniquely .
Proof
The nodal values are , , and .
The polynomial has degree by [F2] and takes these three values. By the definition [F1] and uniqueness [F3], .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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
- Mark Embree, Lecture Notes on Numerical Analysis, lecture 1 (standard reference, not scraped)
- Jean-Paul Berrut and Lloyd N. Trefethen, Barycentric Lagrange Interpolation (standard reference, not scraped)