Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8 (existence clause) — if im ∇h_x = ℝⁿ, a sequence conforming to (12) exists from every (x⁰, p⁰) ∈ C × Ω̄⁺

Proved
BregmanPPA.ProxMult.theorem8_existence

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

bregman-functionexistencep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-method-of-multipliers

Consider a problem of the form (10), a Bregman function hxh_xhx​ on Rn\mathbb R^nRn with zone Sx⊇CS_x\supseteq CSx​⊇C, and a Bregman function hph_php​ on Rm\mathbb R^mRm with zone Sp⊇Ω+‾S_p\supseteq\overline{\Omega^+}Sp​⊇Ω+ and im⁡(∇hp)=Rm\operatorname{im}(\nabla h_p)=\mathbb R^mim(∇hp​)=Rm. If also im⁡(∇hx)=Rn\operatorname{im}(\nabla h_x)=\mathbb R^nim(∇hx​)=Rn, then for every sequence of positive scalars ckc_kck​ bounded away from zero and every (x0,p0)∈C×Ω+‾(x^0,p^0)\in C\times\overline{\Omega^+}(x0,p0)∈C×Ω+ there is an infinite sequence {(xk,pk)}\{(x^k,p^k)\}{(xk,pk)} starting at (x0,p0)(x^0,p^0)(x0,p0) and conforming to the recursions

xk+1=arg⁡min⁡x∈C{f(x)+1ckhp∗+(∇hp(pk)+ckg(x))+1ckDhx(x,xk)},pk+1=∇hp∗+(∇hp(pk)+ckg(xk+1)).(12)x^{k+1}=\arg\min_{x\in C}\Big\{f(x)+\frac1{c_k}h_p^{*+}\big(\nabla h_p(p^k)+c_kg(x)\big)+\frac1{c_k}D_{h_x}(x,x^k)\Big\},\qquad p^{k+1}=\nabla h_p^{*+}\big(\nabla h_p(p^k)+c_kg(x^{k+1})\big).\tag{12}xk+1=argx∈Cmin​{f(x)+ck​1​hp∗+​(∇hp​(pk)+ck​g(x))+ck​1​Dhx​​(x,xk)},pk+1=∇hp∗+​(∇hp​(pk)+ck​g(xk+1)).(12)

This is the third sentence of Theorem 8; together with the goal it guarantees that the method never halts.

Formalization Note The page prints "for any (x0,p0))∈C×Ω+‾(x^0,p^0))\in C\times\overline{\Omega^+}(x0,p0))∈C×Ω+" with an extra parenthesis. The step sizes satisfy the positive lower bound assumed at the start of Theorem 8.

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_Convergence_Model
import Definitions.Def_BregmanPPA_IneqMult_Program
import Definitions.Def_BregmanPPA_ProxMult_Saddle
Formal statement
namespace BregmanPPA.ProxMult

/-- Theorem 8, p. 221 (third sentence): if moreover `im ∇h_x = ℝⁿ`, then for every sequence of
positive scalars `c k` bounded away from zero and every `(x⁰, p⁰) ∈ C × Ω̄⁺` an infinite sequence conforming to (12)
and starting at `(x⁰, p⁰)` exists. -/
theorem theorem8_existence {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)
    (him : gradient hp '' Sp = Set.univ)
    (himx : gradient hx '' Sx = Set.univ) :
    ∀ c : ℕ → ℝ, (∀ k, 0 < c k) →
      (∃ ε : ℝ, 0 < ε ∧ ∀ k, ε ≤ c k) → ∀ x₀ ∈ C, ∀ p₀ ∈ BregmanPPA.IneqMult.nonnegOrthant m,
      ∃ (x : ℕ → BregmanPPA.IneqMult.E n) (p : ℕ → BregmanPPA.IneqMult.E m), x 0 = x₀ ∧ p 0 = p₀ ∧
        IsProxMultRun C f g Sx hx Sp hp c x p := 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, Theorem 8 (third sentence)
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