Alphabeta Math
ExampleConstruction: 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.

PCHIP loses third-order value accuracy next to a smooth extremum

Example

Fix f(x)=x2 on [−1,1]. For each integer n≥2, use the uniform grid xj=−1+jh, j=0,…,2n, with h=1/n. The function is smooth and has a strict extremum at zero. On the cell [−h,0], PCHIP's local maximum error is at least 2h2/27, so no uniform Ch3 value-error bound on this fixed interval can hold across the extremum.

Facts & Assumptions

Given: An integer n≥2, h=1/n, f(x)=x2 on [−1,1], the uniform nodes xj=−1+jh for j=0,…,2n, and exact real arithmetic.

[F1]

PCHIP slope selection: opposite-sign neighboring secants give zero interior slope; same-sign secants use the weighted harmonic mean.

[F2]

Piecewise cubic Hermite interpolant: the segment is formed from endpoint values and slopes using H00,H01,H10,H11.

[F3]

PCHIP has third-order value accuracy on uniform nonstationary grids: the third-order value bound assumes a uniform grid and a derivative bounded away from zero on the whole interval.

[F4]

Sum, product, quotient, and chain rules from difference quotients: the power rule (xm)′=mxm−1 holds for every integer m≥1.

[F5]

Heine-Borel by bisection: every closed bounded interval [a,b] is compact: every closed interval [u,v] with u≤v is compact.

[F6]

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 a nonempty compact subset of R attains its maximum.

Verification

1.1givenF1algebra

The secants on [−2h,−h], [−h,0], [0,h], and [h,2h] are −3h, −h, h, and 3h. At x=−h, the equal-width weights are 3h,3h, so [F1] gives m(−h)=6h/(3h/(−3h)+3h/(−h))=−3h/2. At x=0 the adjacent secants have opposite signs, so [F1] gives m(0)=0.

2.1F2step 1.1algebra

With t=(x+h)/h on [−h,0], [F2] gives Ph(x)/h2=H00(t)−32H10(t)=1−32t+12t3, whereas f(x)/h2=(1−t)2. Therefore (Ph(x)−f(x))/h2=12t(1−t)2.

3.1F3F4F5F6step 2.1givenalgebra∎

On this cell, step 2.1 gives the error E(x)=∣Ph(x)−f(x)∣=h22t(1−t)2, since 0≤t≤1. This expression is a polynomial in x through t=(x+h)/h, so [F4] makes it differentiable, hence continuous, on the cell. As h>0, the interval [−h,0] is nonempty and compact by [F5]; [F6] therefore gives an attained maximum of E there. Since t=1/3 corresponds to a point of the cell and step 2.1 gives E=2h2/27 at that point, the maximum is at least 2h2/27. Any uniform bound ∣Ph−f∣≤Ch3 on these grids with C independent of n would imply 2/27≤Ch=C/n for all sufficiently large n, which is impossible as n→∞. The hypothesis ∣f′∣≥c>0 in [F3] also fails because [F4] gives f′(0)=0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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.