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.
Cardinal-polynomial interpolation
Definition
Let with , let be distinct real nodes, and let . Define the node polynomial and barycentric weights by An empty product is , so when .
In these formulas, is a real argument, and for real and nonzero real , denotes in the field (Field).
For each , the cardinal function is The interpolation function for the data is For a real function defined at the nodes, write .
For products indexed by , use the length- list (), where for and for ; the product is in this order and is empty when . Strict ordering gives for every factor, so A finite product of nonzero reals is nonzero and the field inverse law make each well defined.
Depends on
Used by
- Chebyshev–Gauss–Lobatto polynomial differentiation matrix Algorithm
- Finite barycentric interpolation evaluator Algorithm
- Best uniform polynomial error and Chebyshev interpolation operators Definition
- Chebyshev–Gauss–Lobatto collocation grid Definition
- Collocation tableau from distinct quadrature nodes Definition
- The m-node Gaussian quadrature rule for a positive measure Definition
- A cubic gives equality in the pointwise interpolation remainder Example
- Quadratic interpolation at three nodes is exact Example
- Two Gaussian weights are the squared norms of the two cardinal polynomials Example
- Unit nodal data exhibit equispaced cardinal basis growth Example
- A Gaussian collocation defect has a high-order weighted endpoint bound Lemma
- Cardinal interpolation functions are polynomials of the stated degrees Lemma
- Chebyshev–Lobatto interpolation folds polynomial modes Lemma
- Collocation quadrature data are well defined Lemma
- Divided differences are symmetric leading coefficients Lemma
- Exact weights and degree-nine exactness of the eight-panel rule Lemma
- Floater–Hormann window polynomials interpolate their local data Lemma
- Newton remainder for a Floater–Hormann window polynomial Lemma
- One-node Gauss data are midpoint data Lemma
- The Gaussian nodes, cardinal polynomials and weights are well-defined Lemma
- Equispaced interpolation has linearly growing basis amplification Proposition
- Barycentric interpolation identities Theorem
- Chebyshev–Lobatto interpolation has an algebraic weighted spectral-Sobolev rate Theorem
- Chebyshev–Lobatto interpolation remainder bound Theorem
- DCT-I coefficients of the Chebyshev–Lobatto interpolant Theorem
- Double-node Hermite interpolation has the stated pointwise remainder Theorem
- Existence and uniqueness of the cardinal-polynomial interpolant Theorem
- Gaussian quadrature is exact through degree 2m−1 and has positive weights Theorem
- M-node collocation has local defect order M Theorem
- Pointwise Lagrange interpolation remainder Theorem
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
- Mark Embree, Lecture Notes on Numerical Analysis, lectures 1 and 3 (standard reference, not scraped)
- Jean-Paul Berrut and Lloyd N. Trefethen, Barycentric Lagrange Interpolation (standard reference, not scraped)