Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 I=[a,b] with a<b, let m,n≥0, and let f,w∈C(I,R) with w>0 on I. A best rational approximant in Rm,n+(I) exists and is unique. For a candidate r=p/q with positive weighted error Er:=∥w(f−r)∥∞,I>0, let N=Nm,n(r)=m+n−dm,n(r). Then r is best if and only if there are N+2 ordered nodes x0<⋯<xN+1 in I and σ∈{−1,1} such that w(xi)(f(xi)−r(xi))=σ(−1)iEr(0≤i≤N+1). If the best error is 0, positivity of w forces the unique best function to be f itself. In the normal case d=0 the count is m+n+2; for defective candidates the count is m+n+2−d.

Facts & Assumptions

Given: A nondegenerate compact interval I=[a,b], integers m,n≥0, continuous real functions f,w on I with w>0, and a candidate r=p/q∈Rm,n+(I).

[F1]

Weighted rational minimax families and defect: the rational family has positive reduced denominators, weighted error ∥w(f−r)∥∞,I, defect d, effective perturbation degree N=m+n−d, and the zero-function convention d=n.

[F2]

Best weighted rational approximants exist: a candidate attaining Em,n(f,w;I) exists.

[F3]

The rational first-variation space has dimension set by defect: for a candidate of defect d, the polynomials uq−pv with deg⁡u≤m and deg⁡v≤n form exactly PN.

[F4]

A polynomial with the sign pattern of the active extrema: if a continuous residual has no N+2 alternating active extrema, a polynomial of degree at most N can be chosen with the same strict sign on every active extremum.

[F5]

Alternating interpolation weights annihilate lower-degree polynomials: for N+2 ordered nodes, set wi=∏j≠i(xi−xj). Every polynomial g of degree at most N has ∑ig(xi)/wi=0, and if ε(−1)ig(xi)≥0 for one fixed ε∈{−1,1} then all node values are zero.

[F6]

Alternating polynomial signs force the Haar zero-count contradiction: a nonzero polynomial of degree at most N cannot have nonzero alternating signs at N+2 ordered nodes.

[F7]

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.

Proof

1.1F1F3F6givenalgebra

First suppose Er>0 and that r has N+2 alternating weighted extrema. If another admissible s=p′/q′ had strictly smaller weighted error, write ei=w(xi)(f(xi)−r(xi))=σ(−1)iEr and ei′=w(xi)(f(xi)−s(xi)), so ∣ei′∣<Er. Then σ(−1)iw(xi)(s(xi)−r(xi))=Er−σ(−1)iei′>0. Since w(xi)q(xi)q′(xi)>0, the numerator p′q−pq′ has nonzero alternating signs at those nodes. It lies in PN by [F3], contradicting [F6]. Thus no rational candidate has smaller weighted error and r is best.

1.2F1F3F4F8F10givenconstruct

Now suppose r is best with E:=Er>0, and put e=w(f−r). It is continuous by [F8], and [F10] makes ∣e∣ attain E on compact I, so its active-extrema set is nonempty and compact. If it had no N+2 alternating points, [F4] would give a polynomial g∈PN with e(x)g(x)>0 on that set. By [F3], choose u,v with deg⁡u≤m, deg⁡v≤n, and g=uq−pv.

1.3F1F2algebra

If the best error is zero, then w(f−r)=0 everywhere; since w>0, r=f pointwise, so the best rational function is unique.

2.1F1F3F4F7F8F9F10givenstep 1.2choosealgebra

Since q>0 on compact I, [F10] gives q0=min⁡Iq>0. For all sufficiently small ε>0, q+εv>0 on I. Reduce (p+εu,q+εv) by [F7]. Its reduced denominator has no zero on I, since it divides q+εv; 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 1. Thus rε=(p+εu)/(q+εv), as a rational function, is represented by an admissible member of Rm,n+(I). Its weighted residual is eε=e−εhε, where hε:=wg/[q(q+εv)]. On the active-extrema set, h0=wg/q2 has the same sign as e and is bounded away from zero. By [F8] and [F10], h0 and e are continuous and bounded; the denominator bound implies hε→h0 uniformly as ε↓0. Hence there are a neighborhood U of that set and a constant c>0 such that ∣e∣>E/2, e and hε have the same sign, and ∣hε∣≥c on U for all sufficiently small ε. Shrink ε further so ε∥hε∥∞,I<E/2; then ε∣hε∣<∣e∣ on U and ∣eε∣=∣e∣−ε∣hε∣≤E−εc<E. The compact complement I∖U, if nonempty, contains no active extremum, so [F10] gives ∣e∣≤E−η there for some η>0; a further small choice of ε makes ε∥hε∥∞,I<η/2. Hence ∥eε∥∞,I<E, contradicting best approximation. This proves necessity.

3.1F1F3F5F7step 2.1algebra

Suppose the best error E is positive and r,s=p′/q′ are both best. By step 2.1, r has N+2 alternating nodes. At each such node, w(s−r)=er−es has weak sign σ(−1)i, because ∣es∣≤E. The numerator g=p′q−pq′ lies in PN by [F3], and its values have the same weak alternating signs since wqq′>0. Thus ε(−1)ig(xi)≥0 with ε=σ, so [F5] gives g=0 and hence r=s.

4.1F2step 1.1step 2.1step 1.3step 3.1∎

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

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