Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 8, p. 221 — h_x ⊕ h_p is a Bregman function with zone S_x × S_p ⊇ C × Ω̄⁺ ⊇ cl dom K

Proved
BregmanPPA.ProxMult.sum_bregman

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

bregman-functionp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1saddle-point

For a problem of the form (10), let hxh_xhx​ be a Bregman function on Rn\mathbb R^nRn with zone Sx⊇CS_x\supseteq CSx​⊇C and hph_php​ a Bregman function on Rm\mathbb R^mRm with zone Sp⊇Ω+‾S_p\supseteq\overline{\Omega^+}Sp​⊇Ω+. Then h=hx⊕hph=h_x\oplus h_ph=hx​⊕hp​, h(x,p)=hx(x)+hp(p)h(x,p)=h_x(x)+h_p(p)h(x,p)=hx​(x)+hp​(p), is a Bregman function on Rn+m\mathbb R^{n+m}Rn+m with zone Sx×SpS_x\times S_pSx​×Sp​, and

Sx×Sp⊇C×Ω+‾⊇dom⁡K‾.S_x\times S_p\supseteq C\times\overline{\Omega^+}\supseteq\overline{\operatorname{dom}K}.Sx​×Sp​⊇C×Ω+⊇domK.

Together these give the hypotheses S‾⊇dom⁡K\overline{S}\supseteq\operatorname{dom}KS⊇domK and (C1) S⊇dom⁡K‾S\supseteq\overline{\operatorname{dom}K}S⊇domK under which Theorem 1 is applied to KKK.

Formalization Note Rn+m\mathbb R^{n+m}Rn+m is WithLp 2 (E n × E m), where Dh((x,p),(y,q))=Dhx(x,y)+Dhp(p,q)D_h((x,p),(y,q))=D_{h_x}(x,y)+D_{h_p}(p,q)Dh​((x,p),(y,q))=Dhx​​(x,y)+Dhp​​(p,q). The paper's chain also passes through dom⁡l‾\overline{\operatorname{dom}l}doml; the statement keeps its two ends, the zone and dom⁡K‾\overline{\operatorname{dom}K}domK. The paper asserts the Bregman property without proof ("Then hhh is a Bregman function").

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_Convergence_Model
import Definitions.Def_BregmanPPA_IneqMult_Program
import Definitions.Def_BregmanPPA_ProxMult_Saddle

open ThreeOpSplitting.Convergence
Formal statement
namespace BregmanPPA.ProxMult

/-- Proof of Theorem 8, p. 221: `h = h_x ⊕ h_p` is a Bregman function on `ℝⁿ⁺ᵐ` with zone
`S_x × S_p`, and `S_x × S_p ⊇ C × Ω̄⁺ ⊇ cl dom K`. -/
theorem sum_bregman {n m : ℕ} (C : Set (BregmanPPA.IneqMult.E n)) (f : BregmanPPA.IneqMult.E n → EReal) (g : Fin m → BregmanPPA.IneqMult.E n → EReal)
    (Sx : Set (BregmanPPA.IneqMult.E n)) (hx : BregmanPPA.IneqMult.E n → ℝ) (Sp : Set (BregmanPPA.IneqMult.E m)) (hp : BregmanPPA.IneqMult.E m → ℝ)
    (hP : BregmanPPA.IneqMult.IsConvexProgram C f g)
    (hhx : BregmanPPA.Convergence.IsBregmanFunction Sx hx) (hSx : C ⊆ Sx)
    (hhp : BregmanPPA.Convergence.IsBregmanFunction Sp hp) (hSp : BregmanPPA.IneqMult.nonnegOrthant m ⊆ Sp) :
    BregmanPPA.Convergence.IsBregmanFunction (prodZone Sx Sp) (sumFn hx hp) ∧
    closure (dom (opK C f g)) ⊆ prodZone Sx Sp := 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. 221, proof of Theorem 8 (h = h_x ⊕ h_p)
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