Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.7(i)–(iii) — MMM and M+SM+SM+S are maximally monotone; SSS is bounded, skew, with ∥S∥=∥L∥\|S\|=\|L\|∥S∥=∥L∥

Proved
MonoSkew.Main.proposition_2_7_i_iii

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

maximal-monotonicitymonotone-operatorsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1primal-dual

Let H\mathcal HH, G\mathcal GG be real Hilbert spaces, let A:H→2HA:\mathcal H\to2^{\mathcal H}A:H→2H and B:G→2GB:\mathcal G\to2^{\mathcal G}B:G→2G be maximally monotone, let L:H→GL:\mathcal H\to\mathcal GL:H→G be bounded linear, let z∈Hz\in\mathcal Hz∈H and r∈Gr\in\mathcal Gr∈G, and on K=H⊕G\mathcal K=\mathcal H\oplus\mathcal GK=H⊕G let

M:(x,v)↦(−z+Ax)×(r+B−1v),S:(x,v)↦(L∗v,−Lx).M:(x,v)\mapsto(-z+Ax)\times(r+B^{-1}v),\qquad S:(x,v)\mapsto(L^*v,-Lx).M:(x,v)↦(−z+Ax)×(r+B−1v),S:(x,v)↦(L∗v,−Lx).

Then:

  1. MMM is maximally monotone;
  2. SSS is a bounded linear operator on K\mathcal KK, S∗=−SS^*=-SS∗=−S, and ∥S∥=∥L∥\|S\|=\|L\|∥S∥=∥L∥;
  3. M+SM+SM+S is maximally monotone.

These facts make Problem 1.2, 0∈Mx+Sx0\in Mx+Sx0∈Mx+Sx, an instance of the monotone inclusion solved by the forward–backward–forward method, with the Lipschitz constant ∥L∥\|L\|∥L∥ for SSS.

Formalization Note "S∈B(K)S\in\mathcal B(\mathcal K)S∈B(K)" is encoded as the existence of a continuous linear operator TTT on K\mathcal KK that agrees with SSS pointwise; S∗=−SS^*=-SS∗=−S and ∥S∥=∥L∥\|S\|=\|L\|∥S∥=∥L∥ are then statements about the adjoint and the operator norm of TTT. K\mathcal KK is WithLp 2 (H × G). The hypotheses of Problem 1.1 (both operators maximally monotone) are kept in full.

Preamble
import Mathlib
import Definitions.Def_ThreeOpSplitting_Convergence_MonotoneOperators
import Definitions.Def_ThreeOpSplitting_Convergence_WeakConvergence
import Definitions.Def_DouglasRachfordPPA_GenDR_Operators
import Definitions.Def_MonoSkew_Main_Basic

open InnerProductSpace Filter Topology
open ThreeOpSplitting.Convergence DouglasRachfordPPA.GenDR
Formal statement
namespace MonoSkew.Main

/-- Proposition 2.7(i)–(iii) (p. 8): in the setting of Problems 1.1 and 1.2, `M` is maximally
monotone; `S` is a bounded linear operator on `𝒦` with `S* = −S` and `‖S‖ = ‖L‖`; and
`M + S` is maximally monotone. -/
theorem proposition_2_7_i_iii {H G : Type*}
    [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    [NormedAddCommGroup G] [InnerProductSpace ℝ G] [CompleteSpace G]
    (A : H → Set H) (B : G → Set G) (hA : IsMaximalMonotone A) (hB : IsMaximalMonotone B)
    (L : H →L[ℝ] G) (z : H) (r : G) :
    IsMaximalMonotone (opM A B z r) ∧
    (∃ T : K H G →L[ℝ] K H G, (∀ p, T p = opS L p) ∧
      ContinuousLinearMap.adjoint T = -T ∧ ‖T‖ = ‖L‖) ∧
    IsMaximalMonotone (addSingle (opM A B z r) (opS L)) := by sorry

end MonoSkew.Main
Source
Briceño-Arias and Combettes, A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality, arXiv:1011.5517v1, p. 8, Proposition 2.7(i)–(iii)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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