Let A0=∑jwjaj, A1=∑jwjaj/(1−aj), aˉ=maxjaj, and χ(a)=(1+8a−1)/2. There is exactly one global minimizer (c∗,p∗) over [0,2]×(0,∞), and
0<c∗<χ(aˉ)<1,A0/2<p∗<A1,0<ρ∗<A0+2λA0<1.
Its value is strictly smaller than the infimum achieved by optimizing the positive step separately at either c=0 or c=1. The same pair uniquely minimizes the finite-horizon criterion for every N≥1.
04 · A three-contact global certificate
At the optimum, there are 0≤t1<t2<t3<1 and σ∈{−1,1} with
Ec∗,p∗(ti)=σ(−1)i−1ρ∗.
A feasible pair with a uniform error bound r>0 and three such alternating contacts is conversely the unique global optimum, with optimal value r.
For a single profile ψ(t)=H(at), the sharper bounds are a<p∗<a/(1−a); the alternating contacts start at t1=0 with signs +,−,+.
Formalization note. The target covers the stated one-dimensional positive-mixture class, the entire normalized power family and all positive constant steps. The criterion is gradient contraction. Runtime and total computational cost are not part of this target. Derivatives, integrals and extrema are computed from the explicit functions rather than supplied as assumptions.
import Definitions.Def_PGDMap20261031_Entropy
open PGDMap20261031
Formal statement
theorem PGDMap20261031.joint_bregman_optimum : FullMapTheorem := by sorry
Source
Jointly Optimal Bregman Geometry and Stepsize for Positive Entropy Mixtures, manuscript dated 2026-10-30, Theorem 1, p. 2; proof pp. 2-5; local source: 03_Jointly_Optimal_Bregman_Map_and_Stepsize.pdf