Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5, p. 220 — the saddle operator K(x, p) = ∂ₓl × (−∂̂ₚl) is maximal monotone

Proved
BregmanPPA.ProxMult.K_maximal

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

lagrangianmaximal-monotonep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1saddle-point

Consider a problem of the form (10): C⊆RnC\subseteq\mathbb R^nC⊆Rn closed, nonempty and convex, f,g1,…,gmf,g_1,\dots,g_mf,g1​,…,gm​ proper lower semicontinuous convex and finite on CCC. Let lll be its Lagrangian and

K(x,p)=∂xl(x,p)×(−∂^pl(x,p))K(x,p)=\partial_x l(x,p)\times\big(-\hat\partial_p l(x,p)\big)K(x,p)=∂x​l(x,p)×(−∂^p​l(x,p))

the set-valued map on Rn+m\mathbb R^{n+m}Rn+m. Then KKK is maximal monotone.

The paper derives this from the fact that lll is a closed saddle function, convex in xxx and concave in ppp, citing Rockafellar's Convex Analysis, Corollary 37.5.2. Maximality is the hypothesis under which Theorem 1 is applied to KKK.

Formalization Note Rn+m\mathbb R^{n+m}Rn+m is WithLp 2 (E n × E m). Monotonicity and maximality are the published IsMonotoneOp/IsMaximalMonotone (graph-maximality).

Preamble
import Mathlib
import Definitions.Def_BregmanPPA_Convergence_Model
import Definitions.Def_BregmanPPA_IneqMult_Program
import Definitions.Def_BregmanPPA_ProxMult_Saddle

open ThreeOpSplitting.Convergence
Formal statement
namespace BregmanPPA.ProxMult

/-- §5, p. 220: for a problem of the form (10), the operator
`K(x, p) = ∂ₓ l(x, p) × (−∂̂ₚ l(x, p))` on `ℝⁿ⁺ᵐ` is maximal monotone. -/
theorem K_maximal {n m : ℕ} (C : Set (BregmanPPA.IneqMult.E n)) (f : BregmanPPA.IneqMult.E n → EReal) (g : Fin m → BregmanPPA.IneqMult.E n → EReal)
    (hP : BregmanPPA.IneqMult.IsConvexProgram C f g) :
    IsMaximalMonotone (opK C f g) := 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. 220, §5 (K is maximal monotone [26, Corollary 37.5.2])
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