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 with , let be continuous, and let . Put and . If there are no increasing points of with alternating signs, then there is a real polynomial of degree at most such that for every .
Facts & Assumptions
Given: with , a continuous real function on , , and an integer .
Intervals of : the nine order-convex forms, nondegeneracy, and length: is a closed bounded interval in .
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: a closed bounded nonempty subset of is compact, and every continuous real function on it attains its extrema.
The reverse triangle inequality, The triangle inequality, and Basic properties of the absolute value: , , and for real .
Proof
Continuity and attainment in [F2] show that is nonempty and compact: the maximum of is attained and , while each level set is closed in the compact interval [F1]. If one of or is empty, take or according to the sign of the nonempty set; this has degree zero and the required sign.
Suppose both sets are nonempty. Their product is a closed bounded subset of . For , the reverse and ordinary triangle inequalities in [F3] give , so the distance function is continuous. By [F2] it attains a minimum separation . 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 , 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 . The gaps are pairwise disjoint subintervals of , so any transitions satisfy ; hence there are finitely many transitions, each with a distinct ordered gap.
If there were at least transitions, choosing one extremal point from each successive sign run would give ordered alternating points, contrary to the hypothesis. Thus the number of transitions is at most . Choose one point in each transition gap and set , where is chosen so that has the sign of on the first run. The polynomial has degree , has no zero on , and changes sign exactly when the extremal sign changes. Hence on the entire extremal set.
Depends on
- The reverse triangle inequality
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- The triangle inequality
- Basic properties of the absolute value
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
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
- Lloyd N. Trefethen, Approximation Theory and Approximation Practice, Chapter 10 (standard reference, not scraped)
- András Kroó and Allan Pinkus, Strong Uniqueness, §4.4 (standard reference, not scraped)