Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3 — h*⁺ is closed proper convex, finite everywhere and differentiable

Proved
BregmanPPA.ProxMult.lemma3

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

bregman-functionconvex-analysismonotone-conjugatep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let hhh be a Bregman function on Rm\mathbb R^mRm with zone S⊇Ω+S\supseteq\Omega^+S⊇Ω+ and im⁡(∇h)⊇Ω+\operatorname{im}(\nabla h)\supseteq\Omega^+im(∇h)⊇Ω+. Then the monotone conjugate

h∗+(z)=sup⁡p≥0{⟨p,z⟩−h(p)}h^{*+}(z)=\sup_{p\ge0}\{\langle p,z\rangle-h(p)\}h∗+(z)=p≥0sup​{⟨p,z⟩−h(p)}

is a closed (lower semicontinuous) proper convex function, finite at every z∈Rmz\in\mathbb R^mz∈Rm, and differentiable on all of Rm\mathbb R^mRm.

In Theorem 8 this is applied to hph_php​ (zone Sp⊇Ω+‾⊇Ω+S_p\supseteq\overline{\Omega^+}\supseteq\Omega^+Sp​⊇Ω+⊇Ω+, im⁡∇hp=Rm\operatorname{im}\nabla h_p=\mathbb R^mim∇hp​=Rm): it is what makes the value hp∗+(⋅)h_p^{*+}(\cdot)hp∗+​(⋅) in the xxx-step of (12) a real number and ∇hp∗+\nabla h_p^{*+}∇hp∗+​ in the ppp-step well defined.

Formalization Note h∗+h^{*+}h∗+ is EReal-valued, so finiteness is the claim −∞<h∗+(z)<+∞-\infty<h^{*+}(z)<+\infty−∞<h∗+(z)<+∞ for all zzz; convexity is convexity of the epigraph (IsConvexFn) and properness is IsProperFn. Differentiability is stated for the real-valued function z↦h∗+(z)z\mapsto h^{*+}(z)z↦h∗+(z) (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
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me