The curvature-error supremum is finite and well posed
ProvedPGDMap20261031.entropy_error_lubbregman-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 . The theorem asserts the following. For every mixture and every admissible real pair , is a least upper bound of : every with is at most , and is at most every real upper bound of all these values.
Preamble
import Definitions.Def_PGDMap20261031_Entropy open PGDMap20261031
Formal statement
theorem PGDMap20261031.entropy_error_lub : ErrorProfileLUBClaim := by sorry
Source
Jointly Optimal Bregman Geometry and Stepsize for Positive Entropy Mixtures, manuscript dated 2026-10-30, definitions p. 1; Lemma 1 and Theorem 1 proof pp. 2-4; local source: 03_Jointly_Optimal_Bregman_Map_and_Stepsize.pdf