Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 d≥0 and ρ≥1, there exists a constant C(d,ρ) such that for every n>d, every ordered distinct real mesh x0<⋯<xn in a compact interval [a,b], and every f∈Cd+1([a,b]), the exact Floater–Hormann interpolant rd satisfies the following bound whenever h/hmin⁡≤ρ, where h=max⁡j(xj+1−xj) and hmin⁡=min⁡j(xj+1−xj): ∥f−rd∥∞≤C(d,ρ)hd+1∥f(d+1)∥∞ Here ∥q∥∞:=sup⁡t∈[a,b]∣q(t)∣ for continuous q on [a,b].

Facts & Assumptions

Given: A fixed integer d≥0, the exact Floater–Hormann weights on uniform nodes, and the construction below.

[F1]

Floater–Hormann barycentric interpolant: the weights are wj=(−1)j−d∑i=max⁡(0,j−d)min⁡(j,n−d)∏k=i, k≠ji+d∣xj−xk∣−1.

[F2]

Floater–Hormann interpolants have no real poles: the exact denominator is nonzero at every real query point.

[F3]

Higher derivatives and the classes Ck and C∞: Cd+1 means derivatives through order d+1 exist and are continuous on the closed interval.

[F4]

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.

[F5]

Extreme value theorem: a continuous real function on a nonempty compact subset of R attains a greatest and a least value: a continuous real function on the nonempty compact interval has a finite attained maximum and minimum.

Counterexample

1.1givenF1constructalgebra

Fix d≥0. For every integer n≥2d+2, take h=1/n, xj=jh on [0,1], and query x=h/2. This family has h/hmin⁡=1. From [F1], after multiplying every weight by the same positive factor hdd!, its weights are w~j=(−1)j−dδj,δj=∑i=max⁡(0,j−d)min⁡(j,n−d)(dj−i). Indeed, on a uniform mesh each reciprocal-distance product in [F1] equals h−d/((j−i)!(i+d−j)!). Thus 1≤δj≤2d, and δj=2d for d≤j≤n−d.

1.2givenconstructalgebra

Define ϕ(t)={(1−16t2)d+2,∣t∣≤1/4,0,∣t∣>1/4. At both support endpoints the polynomial has a zero of multiplicity d+2, so its derivatives through order d+1 vanish there and agree with the zero extension; hence ϕ∈Cd+1(R) and ϕ(0)=1. Expanding the polynomial and differentiating each term gives ∥ϕ(d+1)∥∞≤Md:=4d+1∑k=⌈(d+1)/2⌉d+2(d+2k)(2k)!(2k−d−1)!<∞. This is a finite bound depending only on d, and its k=d+2 term shows Md>0.

2.1givenF1F2step 1.1algebra

Let D(x)=∑j=0nw~j/(x−xj) be the denominator at the query. If d=0, its j=0 term has magnitude 2/h, and the remaining terms form an alternating decreasing sequence beginning with magnitude 2/h, so ∣D(x)∣≤4/h. If d≥1, the endpoint blocks j=0,…,d−1 and j=n−d+1,…,n each contain d terms of magnitude at most 2d+1/h. The middle block j=d,…,n−d has constant δj=2d and alternating decreasing magnitudes, so its sum has magnitude at most 2d+1/h. Hence in both cases 0<∣D(x)∣≤2d(4d+4)h, The strict lower inequality follows from [F2].

2.2givenF3step 1.2constructalgebra

The real number w~j/(x−xj) is nonzero. Define σj=1 if it is positive and σj=−1 if it is negative, and set fn(t)=hd+1∑j=0nσjϕ ⁣(t−xjh),0≤t≤1. The supports have radius h/4 about distinct nodes, so they are disjoint; the query x=h/2 is outside every support. Therefore fn(x)=0, fn(xj)=hd+1σj, fn∈Cd+1([0,1]), and ∥fn(d+1)∥∞≤Md by [F3] and the derivative estimate in step 1.2.

3.1givenF1F2F4step 2.1step 2.2algebra

By the barycentric quotient formula [F4] and the signs σj, the numerator at x is hd+1∑j∣w~j/(x−xj)∣. Restricting to j=d+1,…,n−d and using δj=2d and ∣x−xj∣=h(j−12), step 2.1 gives ∣fn(x)−rd(x)∣≥hd+14d+4∑j=d+1n−d1j−12. Since t↦1/(t−12) is decreasing, ∑j=d+1n−d1j−12≥∫d+1n−d+1dtt−12=log⁡n−d+12d+12. This lower bound grows without limit as n increases.

4.1F5step 2.2step 3.1algebra∎

By [F2], fn−rd is continuous on [0,1], so [F5] makes its uniform norm finite. It follows that ∥fn−rd∥∞hd+1Md≥log⁡((n−d+12)/(d+12))(4d+4)Md⟶∞(n→∞). Every mesh in the family has ratio one, but no fixed C(d,1) can satisfy the refuted inequality. Thus it fails even at ρ=1 for each fixed d.

Depends on

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