Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
BregmanPPA.Existence.theorem4

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 (the paper's Rn\mathbb R^nRn), let T:H→2HT:H\to2^HT:H→2H be a maximal monotone operator, and let hhh be a Bregman function with zone S⊇dom⁡TS\supseteq\operatorname{dom}TS⊇domT. Suppose that either

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

where im⁡∇h=∇h(S)\operatorname{im}\nabla h=\nabla h(S)im∇h=∇h(S). Then for every sequence of positive scalars {ck}k≥0\{c_k\}_{k\ge0}{ck​}k≥0​ and every x0∈dom⁡∇h=Sx^0\in\operatorname{dom}\nabla h=Sx0∈dom∇h=S there is an infinite sequence {xk}k≥0\{x^k\}_{k\ge0}{xk}k≥0​ starting at x0x^0x0 and conforming to the recursion (3),

xk+1=(∇h+ckT)−1(∇h(xk)),k=0,1,2,…x^{k+1}=(\nabla h+c_kT)^{-1}\bigl(\nabla h(x^k)\bigr),\qquad k=0,1,2,\dotsxk+1=(∇h+ck​T)−1(∇h(xk)),k=0,1,2,…

that is, xk∈Sx^k\in Sxk∈S and 1ck(∇h(xk)−∇h(xk+1))∈T(xk+1)\tfrac1{c_k}\bigl(\nabla h(x^k)-\nabla h(x^{k+1})\bigr)\in T(x^{k+1})ck​1​(∇h(xk)−∇h(xk+1))∈T(xk+1) for every kkk.

Theorem 1 of the paper describes the behaviour of such sequences; this theorem gives conditions under which they exist at all. Without them the method can halt: the next iterate need not exist.

Formalization Note The scalars ckc_kck​ are not fixed by the statement and are quantified over all positive sequences (Theorem 1's extra condition inf⁡kck>0\inf_k c_k>0infk​ck​>0 is not needed for existence). The hypothesis is S⊇dom⁡TS\supseteq\operatorname{dom}TS⊇domT without closures, as printed. Recursion (3) is encoded through the equivalent inclusion (4) (p. 207) with all iterates in SSS, so the conclusion includes that every iterate stays in the zone. im⁡∇h\operatorname{im}\nabla him∇h is the image of SSS under ∇h\nabla h∇h, not the range of Mathlib's total gradient h.

Preamble
import Mathlib
import Definitions.Def_ThreeOpSplitting_Convergence_MonotoneOperators
import Definitions.Def_DouglasRachfordPPA_GenDR_Operators
import Definitions.Def_BregmanPPA_Convergence_Model
import Definitions.Def_BregmanPPA_Existence_Operators

open ThreeOpSplitting.Convergence DouglasRachfordPPA.GenDR
Formal statement
namespace BregmanPPA.Existence

/-- Theorem 4 (p. 209): let `T` be maximal monotone and `h` a Bregman function with zone
`S ⊇ dom T`. If `im ∇h = ℝⁿ`, or `im ∇h` is open and `0 ∈ im T`, then for every sequence of
positive scalars `c k` and every `x⁰ ∈ dom ∇h = S`, an infinite sequence conforming to the
recursion (3) and starting at `x⁰` exists. -/
theorem theorem4 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    [FiniteDimensional ℝ H] (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) ∈ imOp T)) :
    ∀ c : ℕ → ℝ, (∀ k, 0 < c k) → ∀ x₀ ∈ S,
      ∃ x : ℕ → H, x 0 = x₀ ∧ IsBregmanPPARun S h T c x := by sorry

end BregmanPPA.Existence
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