Statement
For real c,t, define Qc(t)=((1+t)−c+(1−t)−c)/2, where powers are the code's total real-power operation. A mixture M consists of an integer m≥1, real numbers aj,wj indexed by j∈{0,…,m−1}, and a real number λ, with 0<aj<1, wj>0 for every j, and λ>0; no condition ∑jwj=1 is imposed. For real t, let CM(t)=∑j=0m−1wjaj/(1−ajt2) and DM(t)=λ/(1−t2); for real c,p,t, let eM,c,p(t)=(pQc(t)−CM(t))/(pQc(t)+DM(t)), with total real division. Let EM(c,p)={∣eM,c,p(t)∣:0≤t<1} and rM(c,p)=sSupREM(c,p), the total real supremum operation, which uses its library default on an empty or unbounded-above set. A pair (c,p)∈R2 is admissible exactly when 0≤c≤2 and p>0. A pair z=(c,p) is an optimum for M exactly when it is admissible and rM(c,p)≤rM(d,q) for every admissible pair (d,q). Assume the following assertions with their full universal quantification: For every real c1,c2 with 0≤c1<c2≤2, and every pair of real numbers s,t with 0≤s<t<1, Qc2(s)/Qc1(s)<Qc2(t)/Qc1(t). Under these assumptions, the theorem concludes the following assertion with its full universal quantification: For every mixture M, all real c,p,b with (c,p) admissible and b>0, if ∣eM,c,p(t)∣≤b for every 0≤t<1 and there exist real t1,t2,t3,σ with 0≤t1<t2<t3<1, σ∈{1,−1}, and eM,c,p(t1)=σb, eM,c,p(t2)=−σb, eM,c,p(t3)=σb, then (c,p) is an optimum for M, rM(c,p)=b, and every real pair z that is an optimum for M equals (c,p).