Alphabeta Math
LemmaStatement: 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 polynomial with the sign pattern of the active extrema

Statement

Let I=[a,b] with a<b, let e:I→R be continuous, and let E=∥e∥∞,I>0. Put S+={x∈I:e(x)=E} and S−={x∈I:e(x)=−E}. If there are no n+2 increasing points of S+∪S− with alternating signs, then there is a real polynomial h of degree at most n such that e(x)h(x)>0 for every x∈S+∪S−.

Facts & Assumptions

Given: I=[a,b] with a<b, a continuous real function e on I, E=∥e∥∞,I>0, and an integer n≥0.

[F3]

The reverse triangle inequality, The triangle inequality, and Basic properties of the absolute value: ∣∣u∣−∣v∣∣≤∣u−v∣, ∣u+v∣≤∣u∣+∣v∣, and ∣−u∣=∣u∣ for real u,v.

Proof

1.1givenF1F2construct

Continuity and attainment in [F2] show that S+∪S− is nonempty and compact: the maximum of ∣e∣ is attained and E>0, while each level set is closed in the compact interval [F1]. If one of S+ or S− is empty, take h=1 or h=−1 according to the sign of the nonempty set; this has degree zero and the required sign.

1.2givenF1F2F3constructalgebra

Suppose both sets are nonempty. Their product is a closed bounded subset of R2. For (x,y),(x′,y′)∈R2, the reverse and ordinary triangle inequalities in [F3] give ∣∣x−y∣−∣x′−y′∣∣≤∣(x−y)−(x′−y′)∣≤∣x−x′∣+∣y−y′∣≤2∥(x,y)−(x′,y′)∥2, so the distance function is continuous. By [F2] it attains a minimum separation δ=min⁡{∣x−y∣:x∈S+, y∈S−}. This minimum is positive because a minimizing pair at distance zero would give a point in both disjoint sets. Starting at the leftmost point of S+∪S−, repeatedly take the first point of the opposite-sign set to the right and the last current-sign point before it. These extrema exist because the level sets are compact, and each transition gives an open gap of length at least δ containing no point of S+∪S−. The gaps are pairwise disjoint subintervals of [a,b], so any k transitions satisfy kδ≤b−a; hence there are finitely many transitions, each with a distinct ordered gap.

2.1givenstep 1.2constructalgebra∎

If there were at least n+1 transitions, choosing one extremal point from each successive sign run would give n+2 ordered alternating points, contrary to the hypothesis. Thus the number k of transitions is at most n. Choose one point ξj in each transition gap and set h(x)=c∏j=1k(x−ξj), where c∈{−1,1} is chosen so that h has the sign of e on the first run. The polynomial has degree k≤n, has no zero on S+∪S−, and changes sign exactly when the extremal sign changes. Hence e(x)h(x)>0 on the entire extremal set.

Depends on

Used by

Dependency tree · two levels

19 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