Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2 — h*⁺ = (h + δ⁺)* = h* □ δ⁻ = inf_{w ≥ z} h*(w), and h*⁺ is nondecreasing

Proved
BregmanPPA.ProxMult.lemma2

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

convex-conjugateinfimal-convolutionmonotone-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)⊇Ω+ (the two standing assumptions of §4.2), extended by +∞+\infty+∞ outside S‾\overline SS, and let h∗+(z)=sup⁡p≥0{⟨p,z⟩−h(p)}h^{*+}(z)=\sup_{p\ge0}\{\langle p,z\rangle-h(p)\}h∗+(z)=supp≥0​{⟨p,z⟩−h(p)} be its monotone conjugate. Then for all z∈Rmz\in\mathbb R^mz∈Rm

h∗+(z)=(h+δ+)∗(z)=(h∗ □ δ−)(z)=inf⁡w≥z{h∗(w)}.h^{*+}(z)=(h+\delta^+)^*(z)=(h^*\,\square\,\delta^-)(z)=\inf_{w\ge z}\{h^*(w)\}.h∗+(z)=(h+δ+)∗(z)=(h∗□δ−)(z)=w≥zinf​{h∗(w)}.

Furthermore, h∗+h^{*+}h∗+ is nondecreasing: if z≤z′z\le z'z≤z′ componentwise, then h∗+(z)≤h∗+(z′)h^{*+}(z)\le h^{*+}(z')h∗+(z)≤h∗+(z′).

These descriptions of the monotone conjugate are used to compute ∂[hp∗+]∗=∂[hp+δ+]\partial[h_p^{*+}]^*=\partial[h_p+\delta^+]∂[hp∗+​]∗=∂[hp​+δ+] in the proof of Theorem 8, and its monotonicity is the hypothesis of the chain rule, Lemma A4.

Formalization Note All four quantities are EReal-valued; hhh in the conjugates is the extension h^\hat hh^ (extendedH S h), which agrees with hhh on S‾⊇Ω+‾\overline S\supseteq\overline{\Omega^+}S⊇Ω+. The infimum over w≥zw\ge zw≥z is an EReal infimum over the componentwise upper set of zzz.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_Convergence_Model
import Definitions.Def_BregmanPPA_IneqMult_Program

open Filter Topology
Formal statement
namespace BregmanPPA.ProxMult

/-- Lemma 2, p. 215: `h*⁺ = (h + δ⁺)* = h* □ δ⁻ = inf_{w ≥ z} h*(w)`, and `h*⁺` is
nondecreasing; here `h` is a Bregman function on `ℝᵐ` satisfying the two standing assumptions
of §4.2 (zone `S ⊇ Ω⁺`, `im ∇h ⊇ Ω⁺`), extended by `+∞` off `S̄`. -/
theorem lemma2 {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) :
    (∀ z : BregmanPPA.IneqMult.E m,
      BregmanPPA.IneqMult.monoConj h z = BregmanPPA.IneqMult.conjE (fun p => BregmanPPA.IneqMult.extendedH S h p + BregmanPPA.IneqMult.indicatorPos m p) z ∧
      BregmanPPA.IneqMult.monoConj h z = BregmanPPA.IneqMult.infConv (BregmanPPA.IneqMult.conjE (BregmanPPA.IneqMult.extendedH S h)) (BregmanPPA.IneqMult.indicatorNeg m) z ∧
      BregmanPPA.IneqMult.monoConj h z = ⨅ w ∈ {w : BregmanPPA.IneqMult.E m | ∀ i, z i ≤ w i}, BregmanPPA.IneqMult.conjE (BregmanPPA.IneqMult.extendedH S h) w) ∧
    (∀ z z' : BregmanPPA.IneqMult.E m, (∀ i, z i ≤ z' i) → BregmanPPA.IneqMult.monoConj h z ≤ BregmanPPA.IneqMult.monoConj h z') := 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. 215, Lemma 2
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