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.
Weighted rational minimizers satisfy the defect-sensitive alternation criterion
Statement
Let with , let , and let with on . A best rational approximant in exists and is unique. For a candidate with positive weighted error , let . Then is best if and only if there are ordered nodes in and such that If the best error is , positivity of forces the unique best function to be itself. In the normal case the count is ; for defective candidates the count is .
Facts & Assumptions
Given: A nondegenerate compact interval , integers , continuous real functions on with , and a candidate .
Weighted rational minimax families and defect: the rational family has positive reduced denominators, weighted error , defect , effective perturbation degree , and the zero-function convention .
Best weighted rational approximants exist: a candidate attaining exists.
The rational first-variation space has dimension set by defect: for a candidate of defect , the polynomials with and form exactly .
A polynomial with the sign pattern of the active extrema: if a continuous residual has no alternating active extrema, a polynomial of degree at most can be chosen with the same strict sign on every active extremum.
Alternating interpolation weights annihilate lower-degree polynomials: for ordered nodes, set . Every polynomial of degree at most has , and if for one fixed then all node values are zero.
Alternating polynomial signs force the Haar zero-count contradiction: a nonzero polynomial of degree at most cannot have nonzero alternating signs at ordered nodes.
Reduced real rational representations are unique up to scale: a rational function has a unique coprime reduced pair up to scale, and a positive coefficient-norm normalization fixes that scalar.
Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function: sums, products, and quotients by nowhere-zero continuous functions are continuous.
Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and : a continuous real function on an interval takes every value between its endpoint values.
For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: continuous real functions on compact intervals attain extrema, and closed subsets of compact intervals are compact.
Proof
First suppose and that has alternating weighted extrema. If another admissible had strictly smaller weighted error, write and , so . Then . Since , the numerator has nonzero alternating signs at those nodes. It lies in by [F3], contradicting [F6]. Thus no rational candidate has smaller weighted error and is best.
Now suppose is best with , and put . It is continuous by [F8], and [F10] makes attain on compact , so its active-extrema set is nonempty and compact. If it had no alternating points, [F4] would give a polynomial with on that set. By [F3], choose with , , and .
If the best error is zero, then everywhere; since , pointwise, so the best rational function is unique.
Since on compact , [F10] gives . For all sufficiently small , on . Reduce by [F7]. Its reduced denominator has no zero on , since it divides ; it is continuous by [F8] and has constant sign by [F9], so a common sign change makes it positive and a further positive scaling gives coefficient norm . Thus , as a rational function, is represented by an admissible member of . Its weighted residual is , where . On the active-extrema set, has the same sign as and is bounded away from zero. By [F8] and [F10], and are continuous and bounded; the denominator bound implies uniformly as . Hence there are a neighborhood of that set and a constant such that , and have the same sign, and on for all sufficiently small . Shrink further so ; then on and . The compact complement , if nonempty, contains no active extremum, so [F10] gives there for some ; a further small choice of makes . Hence , contradicting best approximation. This proves necessity.
Suppose the best error is positive and are both best. By step 2.1, has alternating nodes. At each such node, has weak sign , because . The numerator lies in by [F3], and its values have the same weak alternating signs since . Thus with , so [F5] gives and hence .
Steps 1.1 and 2.1 prove the two directions of the criterion for positive error; steps 1.3 and 3.1 prove uniqueness in the zero- and positive-error cases. Existence is [F2].
Depends on
- Weighted rational minimax families and defect
- A polynomial with the sign pattern of the active extrema
- Alternating interpolation weights annihilate lower-degree polynomials
- Alternating polynomial signs force the Haar zero-count contradiction
- Reduced real rational representations are unique up to scale
- The rational first-variation space has dimension set by defect
- Sums, scalar multiples, products, absolute values, maxima, minima and quotients with nonvanishing denominator of continuous functions are continuous, as are constants, the identity and every polynomial function
- 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
- Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on $[a,b]$ takes every value between $f(a)$ and $f(b)$
- Best weighted rational approximants exist
Used by
Dependency tree · two levels
48 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 24 (standard reference, not scraped)
- András Kroó and Allan Pinkus, Strong Uniqueness, §§6.2–6.5 (standard reference, not scraped)