Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4 — Bregman proximal point sequences exist when im ∇h is everything, or is open and 0 ∈ im T

Proved
BregmanPPA.ProxMult.theorem4

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

bregman-functionmaximal-monotonep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-point

Let TTT be a maximal monotone operator on a finite-dimensional real inner product space HHH, and let hhh be a Bregman function with zone S⊇dom⁡TS\supseteq\operatorname{dom}TS⊇domT. If either

  1. im⁡∇h=H\operatorname{im}\nabla h=Him∇h=H, or
  2. im⁡(∇h)\operatorname{im}(\nabla h)im(∇h) is open and 0∈im⁡T0\in\operatorname{im}T0∈imT,

then for every sequence of positive scalars ckc_kck​ bounded away from zero and every x0∈dom⁡∇h=Sx^0\in\operatorname{dom}\nabla h=Sx0∈dom∇h=S, an infinite sequence {xk}\{x^k\}{xk} starting at x0x^0x0 and conforming to the recursion (3) exists.

The proof of Theorem 8 applies case 1 on Rn+m\mathbb R^{n+m}Rn+m to obtain the existence clause.

Formalization Note Restated over a finite-dimensional inner product space (the paper's Rn\mathbb R^nRn). im⁡∇h\operatorname{im}\nabla him∇h is the image ∇h(S)\nabla h(S)∇h(S) and im⁡T={y:∃x, y∈Tx}\operatorname{im}T=\{y:\exists x,\ y\in T x\}imT={y:∃x, y∈Tx}. The paper's recursion (3) does not fix ckc_kck​; the statement quantifies over every sequence bounded away from zero, as in the Section 2 setup of recursion (3).

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_Convergence_Model

open ThreeOpSplitting.Convergence
Formal statement
namespace BregmanPPA.ProxMult

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [FiniteDimensional ℝ H]

/-- Theorem 4, p. 209, restated: `T` maximal monotone, `h` a Bregman function with zone
`S ⊇ dom T`. If `im ∇h = H`, or `im ∇h` is open and `0 ∈ im T`, then for all positive `c k` bounded away from zero
and every `x⁰ ∈ dom ∇h = S` an infinite sequence conforming to (3) and starting at `x⁰` exists. -/
theorem theorem4 (T : H → Set H) (S : Set H) (h : H → ℝ)
    (hT : IsMaximalMonotone T) (hh : BregmanPPA.Convergence.IsBregmanFunction S h) (hdom : dom T ⊆ S)
    (hcase : gradient h '' S = Set.univ ∨
      (IsOpen (gradient h '' S) ∧ (0 : H) ∈ {y : H | ∃ z, y ∈ T z})) :
    ∀ c : ℕ → ℝ, (∀ k, 0 < c k) →
      (∃ ε : ℝ, 0 < ε ∧ ∀ k, ε ≤ c k) → ∀ x₀ ∈ S,
      ∃ x : ℕ → H, x 0 = x₀ ∧ BregmanPPA.Convergence.IsBregmanPPARun S h T c x := 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. 209, Theorem 4
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