Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

A nonzero best polynomial error must alternate at n+2 extrema

Statement

Let I=[a,b] with a<b, let n≥0, and let f∈C(I,R). If p∈Pn(I) is a best approximant with E:=∥f−p∥∞,I>0, then there are n+2 ordered points x0<⋯<xn+1 in I and σ∈{−1,1} such that f(xi)−p(xi)=σ(−1)iE(0≤i≤n+1).

Facts & Assumptions

Given: I=[a,b] with a<b, n≥0, f∈C(I,R), and a best approximant p∈Pn(I) with E=∥f−p∥∞,I>0.

[F1]

Best uniform polynomial error on a compact interval: E is the attained uniform error on the compact interval I.

[F2]

A polynomial with the sign pattern of the active extrema: if the active extrema of a continuous residual have no n+2 alternating points, a polynomial h of degree at most n has the same strict sign as that residual on its full active-extrema set.

Proof

1.1givenF1F2F3construct

Put e=f−p. It is continuous by [F3] and has norm E by [F1]. Since I is compact, [F3] makes ∣e∣ attain E, so its active-extrema set S={x∈I:∣e(x)∣=E} is nonempty. Suppose there are not n+2 ordered alternating points in S. Applying [F2] gives a polynomial h of degree at most n with e(x)h(x)>0 for every x∈S. In particular, h is nonzero on S.

2.1F1F3step 1.1construct

The set S is compact because it is a closed subset of I. The continuous function ∣h∣ therefore has a positive minimum c on S by [F3]. The set U={x∈I:e(x)h(x)>0, ∣e(x)∣>E/2, ∣h(x)∣>c/2} is a relatively open neighborhood of S, by continuity and step 1.1.

3.1F1F3step 2.1construct

If I∖U is nonempty, it is compact and contains no point of S, so [F3] gives η:=E−max⁡x∈I∖U∣e(x)∣>0. If it is empty, set η:=E; the outside bound is then vacuous.

4.1givenF1step 1.1step 2.1step 3.1choosealgebra∎

The polynomial h is continuous and has finite norm. Choose ε>0 with ε∥h∥∞,I<min⁡(E/2,η). On U, e and h have the same sign, ∣e∣>E/2, and ε∣h∣<E/2, so ∣e−εh∣=∣e∣−ε∣h∣<E−εc/2. On I∖U, when nonempty, ∣e−εh∣≤E−η+ε∥h∥∞,I<E. Thus ∥f−(p+εh)∥∞,I<E, while p+εh∈Pn(I), contradicting that p is best. Hence the required n+2 alternating extrema exist.

Depends on

Used by

Dependency tree · two levels

30 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