Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4 — ∂h + T = ∇h + T is maximal monotone, and ∇h has the L-property

Proved
BregmanPPA.Existence.theorem4_sum_maximal

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

bregman-functionconvex-analysismonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a finite-dimensional real inner product space, T:H→2HT:H\to2^HT:H→2H a maximal monotone operator, and hhh a Bregman function with zone S⊇dom⁡TS\supseteq\operatorname{dom}TS⊇domT. Let h^\hat hh^ be the extension of hhh by +∞+\infty+∞ off Sˉ\bar SSˉ, so that ∂h:=∂h^\partial h:=\partial\hat h∂h:=∂h^, and let ∇h\nabla h∇h denote the operator x↦{∇h(x)}x\mapsto\{\nabla h(x)\}x↦{∇h(x)} on SSS (empty off SSS). Then

  1. ∂h+T=∇h+T\partial h+T=\nabla h+T∂h+T=∇h+T;
  2. ∇h+T\nabla h+T∇h+T is maximal monotone;
  3. ∇h\nabla h∇h has the L-property.

Here (A+B)(x)={a+b:a∈Ax, b∈Bx}(A+B)(x)=\{a+b : a\in Ax,\ b\in Bx\}(A+B)(x)={a+b:a∈Ax, b∈Bx}. These are conditions (b) and (c) of the Brézis–Haraux theorem (Theorem 3) for A=TA=TA=T and B=∇hB=\nabla hB=∇h; condition (a) is the hypothesis dom⁡T⊆S\operatorname{dom}T\subseteq SdomT⊆S.

Formalization Note The paper writes ∂h\partial h∂h for the subdifferential of the closed proper convex function obtained by setting h=+∞h=+\inftyh=+∞ off Sˉ\bar SSˉ (note after Definition 1, p. 205); this is subdiffOp (extendedFn S h). The hypothesis is S⊇dom⁡TS\supseteq\operatorname{dom}TS⊇domT without closures, as printed in Theorem 4. The paper cites the maximality of ∂h\partial h∂h [27] and the relative-interior sum theorem [28] as known results; they are not separate items.

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
import Definitions.Def_BregmanPPA_Existence_LProperty

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

/-- Proof of Theorem 4 (p. 209): for `T` maximal monotone and `h` a Bregman function with zone
`S ⊇ dom T`, the operator `∇h + T` (domain `S ∩ dom T`) is maximal monotone and coincides with
`∂h + T`, where `∂h` is the subdifferential of the extension `ĥ` of `h` by `+∞` off `S̄`; and the
operator `∇h` has the L-property. -/
theorem theorem4_sum_maximal {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) :
    opAdd (BregmanPPA.Convergence.subdiffOp (extendedFn S h)) T = opAdd (gradOp S h) T ∧
    IsMaximalMonotone (opAdd (gradOp S h) T) ∧
    HasLProperty (gradOp S h) := 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, proof of Theorem 4 (conditions (a)–(c) of Theorem 3)
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