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.
Uniform meshes refute the C^(d+1)-seminorm-only Floater–Hormann rate
Statement refuted
The refuted claim is that, for every integer and , there exists a constant such that for every , every ordered distinct real mesh in a compact interval , and every , the exact Floater–Hormann interpolant satisfies the following bound whenever , where and : Here for continuous on .
Facts & Assumptions
Given: A fixed integer , the exact Floater–Hormann weights on uniform nodes, and the construction below.
Floater–Hormann barycentric interpolant: the weights are .
Floater–Hormann interpolants have no real poles: the exact denominator is nonzero at every real query point.
Higher derivatives and the classes and : means derivatives through order exist and are continuous on the closed interval.
Barycentric rational quotient with support values and reduced poles: away from support nodes, the rational quotient is the barycentric numerator divided by its denominator; common nonzero scaling of all weights cancels.
Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value: a continuous real function on the nonempty compact interval has a finite attained maximum and minimum.
Counterexample
Fix . For every integer , take , on , and query . This family has . From [F1], after multiplying every weight by the same positive factor , its weights are Indeed, on a uniform mesh each reciprocal-distance product in [F1] equals . Thus , and for .
Define At both support endpoints the polynomial has a zero of multiplicity , so its derivatives through order vanish there and agree with the zero extension; hence and . Expanding the polynomial and differentiating each term gives This is a finite bound depending only on , and its term shows .
Let be the denominator at the query. If , its term has magnitude , and the remaining terms form an alternating decreasing sequence beginning with magnitude , so . If , the endpoint blocks and each contain terms of magnitude at most . The middle block has constant and alternating decreasing magnitudes, so its sum has magnitude at most . Hence in both cases The strict lower inequality follows from [F2].
The real number is nonzero. Define if it is positive and if it is negative, and set The supports have radius about distinct nodes, so they are disjoint; the query is outside every support. Therefore , , , and by [F3] and the derivative estimate in step 1.2.
By the barycentric quotient formula [F4] and the signs , the numerator at is . Restricting to and using and , step 2.1 gives Since is decreasing, This lower bound grows without limit as increases.
By [F2], is continuous on , so [F5] makes its uniform norm finite. It follows that Every mesh in the family has ratio one, but no fixed can satisfy the refuted inequality. Thus it fails even at for each fixed .
Depends on
- Floater–Hormann barycentric interpolant
- Barycentric rational quotient with support values and reduced poles
- Floater–Hormann interpolants have no real poles
- Higher derivatives and the classes $C^k$ and $C^\infty$
- Extreme value theorem: a continuous real function on a nonempty compact subset of $\mathbb{R}$ attains a greatest and a least value
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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)