Every optimum has three alternating active points
ProvedPGDMap20261031.entropy_necessary_alternationbregman-geometryconvex-optimizationperformance-estimation
Statement
A mixture consists of an integer , real numbers indexed by , and a real number , with , for every , and ; no condition is imposed. For real , define , where powers are the code's total real-power operation. For real , let and ; for real , let , with total real division. Let and , the total real supremum operation, which uses its library default on an empty or unbounded-above set. A pair is admissible exactly when and . A pair is an optimum for exactly when it is admissible and for every admissible pair . The theorem asserts the following. For every mixture and every real pair that is an optimum for , for all , and there exist real with , , and , , .
Preamble
import Definitions.Def_PGDMap20261031_Entropy open PGDMap20261031
Formal statement
theorem PGDMap20261031.entropy_necessary_alternation : NecessaryAlternationClaim := by sorry
Source
Jointly Optimal Bregman Geometry and Stepsize for Positive Entropy Mixtures, manuscript dated 2026-10-30, Theorem 1 proof, p. 4; local source: 03_Jointly_Optimal_Bregman_Map_and_Stepsize.pdf