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 c,t, define Qc(t)=((1+t)−c+(1−t)−c)/2, where powers are the code's total real-power operation. 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). For every real t, write H(t)=((1+t)log(1+t)+(1−t)log(1−t))/2, using the total real logarithm of the code. Define FM(t)=∑j=0m−1wjH(ajt) for real t. The theorem asserts the following. For every mixture M and every real a with 0<a<1, if FM(t)=H(at) for every real t with −1<t<1, then every real pair z=(c,p) that is an optimum for M satisfies a<p<a/(1−a), and there are real t2,t3 with 0<t2<t3<1 and eM,c,p(0)=rM(c,p), eM,c,p(t2)=−rM(c,p), eM,c,p(t3)=rM(c,p).
Preamble
import Definitions.Def_PGDMap20261031_Entropy
open PGDMap20261031
Formal statement
theorem PGDMap20261031.entropy_single_profile : SingleProfileClaim := by sorry
Source
Jointly Optimal Bregman Geometry and Stepsize for Positive Entropy Mixtures, manuscript dated 2026-10-30, Theorem 1(4), p. 2; proof p. 5; local source: 03_Jointly_Optimal_Bregman_Map_and_Stepsize.pdf