Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — the Bregman proximal point algorithm converges to a zero of a maximal monotone operator

Proved
BregmanPPA.EqMult.theorem1

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

bregman-functionmonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-point

Let HHH be a finite-dimensional real inner product space, T:H→2HT : H \to 2^HT:H→2H a maximal monotone operator, and hhh a Bregman function with zone SSS such that Sˉ⊇dom⁡T\bar S \supseteq \operatorname{dom} TSˉ⊇domT. Let {ck}k≥0\{c_k\}_{k\ge0}{ck​}k≥0​ be positive scalars with inf⁡kck>0\inf_k c_k > 0infk​ck​>0, and let {xk}k≥0\{x^k\}_{k\ge 0}{xk}k≥0​ be an infinite sequence conforming to the recursion

xk+1=(∇h+ckT)−1(∇h(xk)).(3)x^{k+1} = (\nabla h + c_k T)^{-1}\bigl(\nabla h(x^k)\bigr). \tag{3}xk+1=(∇h+ck​T)−1(∇h(xk)).(3)

Suppose that one of the following holds:

  1. (C1) S⊇dom⁡T‾S \supseteq \overline{\operatorname{dom} T}S⊇domT;
  2. (C2) T=∂fT = \partial fT=∂f for a proper lower semicontinuous convex function f:H→(−∞,+∞]f : H \to (-\infty,+\infty]f:H→(−∞,+∞].

Then, if TTT has a zero, {xk}\{x^k\}{xk} converges to a zero of TTT. If TTT has no zero and (C1) holds, then {xk}\{x^k\}{xk} is unbounded.

This is the central convergence theorem of the paper. In §4.1 it is applied to T=∂(−d)T = \partial(-d)T=∂(−d), the subdifferential of the negated dual functional of an equality-constrained convex program, for which (C2) holds.

Formalization Note The paper prints "maximal monontone operator of Rn\mathbb R^nRn"; it means a maximal monotone operator on Rn\mathbb R^nRn, here a finite-dimensional real inner product space HHH. A run of (3) is encoded through the paper's equivalent form (4) together with xk∈Sx^k \in Sxk∈S. "Converges to one of them" is ∃z, 0∈Tz∧xk→z\exists z,\ 0 \in T z \wedge x^k \to z∃z, 0∈Tz∧xk→z; "unbounded" is "the range of k↦xkk \mapsto x^kk↦xk is not bounded". inf⁡ck>0\inf c_k > 0infck​>0 is "∃ε>0, ε≤ck\exists \varepsilon > 0,\ \varepsilon \le c_k∃ε>0, ε≤ck​ for all kkk". This restates the goal of mission 1 of this series in this mission's namespace.

Preamble
import Mathlib
import Definitions.Def_ThreeOpSplitting_Convergence_MonotoneOperators
import Definitions.Def_InertialFB_IFB_ConvexAnalysis
import Definitions.Def_BregmanPPA_Convergence_Model

open ThreeOpSplitting.Convergence InertialFB.IFB Filter Topology
Formal statement
namespace BregmanPPA.EqMult
theorem theorem1 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    [FiniteDimensional ℝ H]
    (T : H → Set H) (S : Set H) (h : H → ℝ) (c : ℕ → ℝ) (x : ℕ → H)
    (hT : IsMaximalMonotone T) (hh : BregmanPPA.Convergence.IsBregmanFunction S h) (hdom : dom T ⊆ closure S)
    (hc : ∀ k, 0 < c k) (hcinf : ∃ ε > 0, ∀ k, ε ≤ c k)
    (hx : BregmanPPA.Convergence.IsBregmanPPARun S h T c x)
    (hC : closure (dom T) ⊆ S ∨
      ∃ f : H → EReal, IsProperFn f ∧ IsConvexFn f ∧ LowerSemicontinuous f ∧ T = BregmanPPA.Convergence.subdiffOp f) :
    ((zer T).Nonempty → ∃ z ∈ zer T, Tendsto x atTop (𝓝 z)) ∧
    (zer T = ∅ → closure (dom T) ⊆ S → ¬ Bornology.IsBounded (Set.range x)) := by sorry
end BregmanPPA.EqMult
Source
Eckstein, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res. 18(1) (1993), pp. 206–207, Theorem 1
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