For real c,t, define Qc(t)=((1+t)−c+(1−t)−c)/2, where powers are the code's total real-power operation. For real a,c,u, put Ta,c(u)=(1−au)Qc(u) and τ(a)=(1+8a−1)/2, with the total real square root. 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). Let B0(M)=∑j=0m−1wjaj, B1(M)=∑j=0m−1wjaj/(1−aj), amax(M)=sSupR{aj:0≤j<m}, τ(a)=(1+8a−1)/2 for real a, and β(M)=B0(M)/(B0(M)+2λ); the supremum defining amax(M) is over a nonempty finite set. Assume the following assertions with their full universal quantification: For every real a,c with 0<a<1 and 0<c<1, both of the following implications hold: if τ(a)≤c, then Ta,c(s)<Ta,c(t) for every 0≤s<t<1; if c<τ(a), then there is a real u with 0<u<1 such that Ta,c(t)<Ta,c(s) whenever 0≤s<t≤u, and Ta,c(s)<Ta,c(t) whenever u≤s<t<1; and For every mixture M and every real pair z=(c,p) that is an optimum for M, ∣eM,c,p(t)∣≤rM(c,p) for all 0≤t<1, and there exist real t1,t2,t3,σ with 0≤t1<t2<t3<1, σ∈{1,−1}, and eM,c,p(t1)=σrM(c,p), eM,c,p(t2)=−σrM(c,p), eM,c,p(t3)=σrM(c,p). Under these assumptions, the theorem concludes the following assertion with its full universal quantification: For every mixture M, there exists a real pair z=(c,p) which is an optimum for M and satisfies 0<c<τ(amax(M))<1, B0(M)/2<p<B1(M), and 0<rM(c,p)<β(M)<1.
Preamble
import Definitions.Def_PGDMap20261031_Entropy
open PGDMap20261031