Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

Weighted rational minimax families and defect

Definition

Let I=[a,b] with a<b, let m,n∈N0, and let f,w∈C(I,R) with w(x)>0 for every x∈I. A normalized reduced pair is a pair of real polynomials p,q such that q>0 on I, deg⁡p≤m, deg⁡q≤n, p and q have no nonconstant common divisor, and ∥q∥coef,2:=(∑j=0nqj2)1/2=1when q(x)=∑j=0nqjxj. The zero rational function is represented by (p,q)=(0,1). By Reduced real rational representations are unique up to scale, each rational function admissible under these conditions has exactly one normalized reduced pair. Define Rm,n+(I):={p/q:(p,q) is a normalized reduced pair} and Em,n(f,w;I):=inf⁡r∈Rm,n+(I)∥w(f−r)∥∞,I. The family is nonempty because it contains r=0. For each admissible r=p/q, q>0 on I makes r continuous by 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, so w(f−r) is continuous and bounded on compact I. The infimum is therefore finite, bounded below by zero, and exists as a real number by completeness of R.

For r=p/q≠0 in reduced form, put dm,n(r):=min⁡{m−deg⁡p, n−deg⁡q},Nm,n(r):=m+n−dm,n(r). For r=0, define dm,n(0):=n and hence Nm,n(0):=m. The integer dm,n(r) is the defect. A candidate is normal when dm,n(r)=0 and defective when dm,n(r)>0. The alternation count associated with the candidate is Nm,n(r)+2; it equals m+n+2 only in the normal case.

Depends on

Used by

Dependency tree · two levels

27 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