Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 [5] — trimonotone operators, in particular subdifferentials, have the L-property

Proved
BregmanPPA.Existence.theorem2

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

convex-analysismonotone-operatorp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a finite-dimensional real inner product space. Then:

  1. every trimonotone operator R:H→2HR:H\to2^HR:H→2H has the L-property;
  2. in particular, for every proper convex f:H→(−∞,+∞]f:H\to(-\infty,+\infty]f:H→(−∞,+∞], the subdifferential map ∂f\partial f∂f has the L-property.

That is, for such RRR and all u∈dom⁡Ru\in\operatorname{dom}Ru∈domR, v∈im⁡Rv\in\operatorname{im}Rv∈imR,

inf⁡{⟨x−u, y−v⟩:y∈Rx}>−∞.\inf\{\langle x-u,\,y-v\rangle : y\in Rx\}>-\infty .inf{⟨x−u,y−v⟩:y∈Rx}>−∞.

This is the result of Brézis and Haraux that makes their range theorem (Theorem 3) applicable to the operator ∇h\nabla h∇h of a Bregman function in the proof of Theorem 4.

Formalization Note The paper's parenthetical remark that subdifferential maps are cyclically monotone [26] is the reason for the second clause; the second clause is stated separately for proper convex fff encoded as an EReal-valued function, so that it can be used without first proving cyclic monotonicity. Lower semicontinuity is not required for this claim.

Preamble
import Mathlib
import Definitions.Def_ThreeOpSplitting_Convergence_MonotoneOperators
import Definitions.Def_DouglasRachfordPPA_GenDR_Operators
import Definitions.Def_InertialFB_IFB_ConvexAnalysis
import Definitions.Def_BregmanPPA_Existence_Operators
import Definitions.Def_BregmanPPA_Existence_LProperty

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

/-- Theorem 2 [5] (p. 208): every trimonotone operator has the L-property; in particular the
subdifferential map of a proper convex function has it. -/
theorem theorem2 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    [FiniteDimensional ℝ H] :
    (∀ R : H → Set H, IsTrimonotone R → HasLProperty R) ∧
        (∀ f : H → EReal, IsProperFn f → IsConvexFn f →
      HasLProperty (BregmanPPA.Convergence.subdiffOp f)) := 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. 208, Theorem 2 (citing Brézis–Haraux [5])
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