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.

Best weighted rational approximants exist

Statement

For I=[a,b] with a<b, m,n≥0, f∈C(I,R), and a strictly positive continuous weight w, there is r∗∈Rm,n+(I) such that ∥w(f−r∗)∥∞,I=Em,n(f,w;I).

Facts & Assumptions

Given: A nondegenerate compact interval I=[a,b], integers m,n≥0, f,w∈C(I,R), and w>0 on I.

[F1]

Weighted rational minimax families and defect: candidates have reduced degrees at most (m,n), a denominator q>0 normalized by coefficient Euclidean norm 1, and error ∥w(f−p/q)∥∞,I.

[F2]

Reduced real rational representations are unique up to scale: for a nonempty interval, two reduced representations of the same rational function with denominators positive on I and coefficient norm 1 are equal.

[F3]

For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent: continuous functions on nonempty compact intervals attain extrema; closed bounded subsets of finite-dimensional Euclidean space are compact and continuous functions on them attain minima.

[F4]

A nonzero real polynomial of degree n has no more than n distinct real roots: a nonzero polynomial has finitely many roots in I.

[F5]

A real polynomial vanishing at a is divisible by x−a: if a polynomial vanishes at c, it is divisible by x−c.

[F7]

Polynomial coefficients are bounded by values at fixed distinct nodes: for fixed distinct nodes, bounded polynomial values give a fixed bound on all coefficients.

[F8]

Over an integral domain, degrees add under multiplication of nonzero polynomials: degrees add for products of nonzero real polynomials.

Proof

1.1F1F3F6givenconstruct

Let γ:=min⁡x∈Iw(x)>0 and M:=∥wf∥∞,I. Positivity of γ follows because the continuous positive function w attains its minimum on compact I by [F3]. In the coefficient space for pairs (p,q) of degrees at most (m,n) and an extra scalar t, define K by ∥q∥coef,2=1, q(x)≥0 on I, 0≤t≤M, and ∣w(x)(f(x)q(x)−p(x))∣≤tq(x) for every x∈I. The triple (0,1,M) lies in K, so K is nonempty.

2.1F1F3F7step 1.1algebra

The coefficient norm equation, the interval for t, and each pointwise inequality defining K are closed conditions on the finite coefficient vector, so K is closed. Its denominator coefficients have norm 1, and for every (p,q,t)∈K, ∣p(x)∣≤(∣f(x)∣+M/γ)q(x) on I. The coefficient norm bound gives ∥q∥∞,I≤∑j=0nmax⁡(∣a∣,∣b∣)j, hence ∥p∥∞,I is uniformly bounded. For m=0, evaluation at one node bounds the sole coefficient of p. For m≥1, evaluate at the m+1 distinct nodes τj=a+j(b−a)/m; each value is bounded by ∥p∥∞,I, so [F7] bounds every coefficient. Thus K is bounded.

3.1F1F2F3step 1.1step 2.1construct

By [F3], K is compact, so its coordinate function (p,q,t)↦t has a minimum t∗ at some (p∗,q∗,t∗)∈K. For every admissible rational r=p/q with error at most M, [F1] supplies a normalized positive reduced representing pair, unique by [F2]; with t=∥w(f−r)∥∞,I this triple belongs to K. Candidates with larger error exceed M≥t∗. Therefore t∗≤Em,n(f,w;I).

3.2F1F4F5F6F8step 2.1algebra

For the minimizing pair, q∗ is a nonzero nonnegative polynomial because its coefficient norm is 1. Its zero set in I is finite by [F4]. The defining inequality of K and w≥γ give ∣p∗(x)∣≤(∥f∥∞,I+M/γ)q∗(x) for every x∈I. At any zero c of q∗, repeated use of [F5] writes q∗(x)=(x−c)su(x) with u(c)≠0 and, if p∗≠0, writes p∗(x)=(x−c)rv(x) with v(c)≠0. If p∗≠0 and r<s, then [F8] and [F4] give q∗(x)>0 on a punctured one-sided neighborhood of c inside I. By continuity in [F6] and u(c)v(c)≠0, ∣v(x)∣/∣u(x)∣ is bounded below by a positive constant on a sufficiently small such neighborhood, so ∣p∗(x)∣/q∗(x)=∣x−c∣r−s∣v(x)∣/∣u(x)∣ is unbounded as x→c from within I, contradicting the displayed bound. Hence p∗ is divisible by the factor of q∗ at every interval zero; this is automatic if p∗=0. Thus every interval zero of q∗ cancels from the quotient.

4.1F1F2F6F9step 3.1step 3.2algebra∎

For each interior zero c of q∗, its multiplicity is even: an odd multiplicity would make q∗ change sign across c, contradicting q∗≥0 on I. Form H from the factors (x−c)s at interior zeros (where s is even), (x−a)sa at a if it is a zero, and (b−x)sb at b if it is a zero. Then H≥0 on I and H>0 off the finite zero set of q∗. Step 3.2 shows that H divides both p∗ and q∗. Write p∗=Hpˉ and q∗=Hqˉ. The exact multiplicities included in H make qˉ nonzero at every zero of q∗; elsewhere, q∗>0 and H>0, so qˉ>0. Since qˉ is continuous by [F6], positivity off the finite zero set makes it nonnegative at each removed zero; its nonvanishing there makes it positive on all of I. At every point outside those zeros, divide the defining inequality ∣w(fq∗−p∗)∣≤t∗q∗ by H to obtain ∣w(fqˉ−pˉ)∣≤t∗qˉ. Thus ∣w(f−pˉ/qˉ)∣≤t∗ there. The quotient pˉ/qˉ and w(f−⋅) are continuous on I by [F6], so the same bound holds at the cancelled zeros by continuity. Reduce (pˉ,qˉ) using [F2]. The reduced denominator still has no zero on I because it divides qˉ; it is continuous by [F6] and has constant sign by [F9] (otherwise the intermediate value theorem would give a zero). A common sign change makes it positive, and a further positive scaling gives coefficient norm 1. The resulting pair is admissible and represents the same quotient, hence has error at most t∗. Therefore Em,n(f,w;I)≤t∗. Together with step 3.1, equality holds and the infimum is attained.

Depends on

Used by

Dependency tree · two levels

47 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