Lemma 2 — representations and monotonicity of the monotone conjugate
ProvedBregmanPPA.IneqMult.lemma2Let be a Bregman function whose zone contains the strictly positive orthant , with (the two standing assumptions of §4.2, p. 215). Extend by outside the closure of its zone. If and are the indicator functions of the nonnegative and nonpositive orthants, respectively, then for every ,
Moreover, componentwise implies . These identities make the orthant restriction compatible with ordinary convex conjugacy and are used throughout the analysis of recursion (11).
Formalization Note All conjugates and infima take values in extended reals; the source's in these identities denotes its extension outside . The assumption is carried because the section states it before the lemma; the paper's proof uses only .
import Mathlib import Definitions.Def_BregmanPPA_IneqMult_Program open Filter Topology
namespace BregmanPPA.IneqMult
/-- Lemma 2, p. 215: four representations of the monotone conjugate and its monotonicity. -/
theorem lemma2 {m : ℕ} (S : Set (E m)) (h : E m → ℝ)
(hh : BregmanPPA.Convergence.IsBregmanFunction S h) (hS : posOrthant m ⊆ S)
(him : posOrthant m ⊆ gradient h '' S) :
(∀ z : E m,
monoConj h z = conjE (fun p => extendedH S h p + indicatorPos m p) z ∧
monoConj h z = infConv (conjE (extendedH S h)) (indicatorNeg m) z ∧
monoConj h z = ⨅ w ∈ {w : E m | ∀ i, z i ≤ w i}, conjE (extendedH S h) w) ∧
(∀ z z' : E m, (∀ i, z i ≤ z' i) → monoConj h z ≤ monoConj h z') := by sorry
end BregmanPPA.IneqMult
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.