Lemma 3 — h*⁺ is closed proper convex, finite everywhere and differentiable
ProvedBregmanPPA.ProxMult.lemma3bregman-functionconvex-analysismonotone-conjugatep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a Bregman function on with zone and . Then the monotone conjugate
is a closed (lower semicontinuous) proper convex function, finite at every , and differentiable on all of .
In Theorem 8 this is applied to (zone , ): it is what makes the value in the -step of (12) a real number and in the -step well defined.
Formalization Note is EReal-valued, so finiteness is the claim for all ; convexity is convexity of the epigraph (IsConvexFn) and properness is IsProperFn. Differentiability is stated for the real-valued function (toReal), which is exact because of the finiteness clause.
Preamble
import Mathlib import Definitions.Def_BregmanPPA_Convergence_Model import Definitions.Def_BregmanPPA_IneqMult_Program open Filter Topology InertialFB.IFB
Formal statement
namespace BregmanPPA.ProxMult
/-- Lemma 3, p. 216: if `h` is a Bregman function with zone `S ⊇ Ω⁺` and `im ∇h ⊇ Ω⁺`, then
`h*⁺` is a closed proper convex function, finite everywhere and differentiable. -/
theorem lemma3 {m : ℕ} (S : Set (BregmanPPA.IneqMult.E m)) (h : BregmanPPA.IneqMult.E m → ℝ)
(hh : BregmanPPA.Convergence.IsBregmanFunction S h) (hS : BregmanPPA.IneqMult.posOrthant m ⊆ S)
(him : BregmanPPA.IneqMult.posOrthant m ⊆ gradient h '' S) :
LowerSemicontinuous (BregmanPPA.IneqMult.monoConj h) ∧
IsProperFn (BregmanPPA.IneqMult.monoConj h) ∧
IsConvexFn (BregmanPPA.IneqMult.monoConj h) ∧
(∀ z : BregmanPPA.IneqMult.E m, BregmanPPA.IneqMult.monoConj h z ≠ ⊤ ∧ BregmanPPA.IneqMult.monoConj h z ≠ ⊥) ∧
Differentiable ℝ (fun z : BregmanPPA.IneqMult.E m => (BregmanPPA.IneqMult.monoConj h z).toReal) := by sorry
end BregmanPPA.ProxMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), p. 216, Lemma 3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.