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.
Floater–Hormann barycentric interpolant
Definition
Let , let be distinct real nodes, let be data, and let be an integer with . For , define The index range is nonempty and every product is positive, so every is nonzero. The Floater–Hormann interpolant of degree parameter is the barycentric rational quotient of these nodes, data, and weights from Barycentric rational quotient with support values and reduced poles. Away from the nodes, exact evaluation uses the quotient with this denominator; a zero of the reduced denominator is reported as pole status. The no-real-pole theorem below proves that this status never occurs for admissible exact real inputs.
Depends on
Used by
- Uniform meshes refute the C^(d+1)-seminorm-only Floater–Hormann rate Counterexample
- Local mesh ratio for degree-zero Floater–Hormann interpolation Definition
- Local polynomial in a Floater–Hormann window Definition
- Floater–Hormann barycentric denominator lower bound Lemma
- Floater–Hormann blend partial sums are positive in each node gap Lemma
- Floater–Hormann weights equal the local-polynomial blend weights Lemma
- Floater–Hormann C^(d+2) parity error bounds Theorem
- Floater–Hormann error bounds for a bounded-variation highest derivative Theorem
- Floater–Hormann interpolants have no real poles Theorem
Dependency tree · two levels
2 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
- Michael S. Floater and Kai Hormann, Barycentric rational interpolation with no poles and high rates of approximation, Sections 2 and 4 (standard reference, not scraped)