Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.8(i) — zer⁡(M+S)\operatorname{zer}(M+S)zer(M+S) is a closed convex subset of P×D\mathcal P\times\mathcal DP×D

Proved
MonoSkew.Main.proposition_2_8_i

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

dualitymonotone-operatorsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1primal-dual

In the setting of Problems 1.1 and 1.2 (AAA, BBB maximally monotone, LLL bounded linear, z∈Hz\in\mathcal Hz∈H, r∈Gr\in\mathcal Gr∈G, MMM and SSS as in (1.8) on K=H⊕G\mathcal K=\mathcal H\oplus\mathcal GK=H⊕G), the set

zer⁡(M+S)={(x,v)∈K∣0∈M(x,v)+S(x,v)}\operatorname{zer}(M+S)=\{(x,v)\in\mathcal K\mid 0\in M(x,v)+S(x,v)\}zer(M+S)={(x,v)∈K∣0∈M(x,v)+S(x,v)}

is a closed convex subset of P×D\mathcal P\times\mathcal DP×D, where P\mathcal PP and D\mathcal DD are the solution sets of the primal inclusion (1.2) and the dual inclusion (1.3).

Thus every zero of the monotone+skew operator yields a primal solution and a dual solution at once.

Formalization Note "Closed" is in the norm topology of K\mathcal KK = WithLp 2 (H × G); "subset of P×D\mathcal P\times\mathcal DP×D" is stated componentwise: every (x,v)∈zer⁡(M+S)(x,v)\in\operatorname{zer}(M+S)(x,v)∈zer(M+S) has x∈Px\in\mathcal Px∈P and v∈Dv\in\mathcal Dv∈D.

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.8(i) (p. 8): in the setting of Problems 1.1 and 1.2, `zer(M + S)` is a closed
convex subset of `𝒫 × 𝒟`. -/
theorem proposition_2_8_i {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) :
    IsClosed (zer (addSingle (opM A B z r) (opS L))) ∧
    Convex ℝ (zer (addSingle (opM A B z r) (opS L))) ∧
    ∀ p ∈ zer (addSingle (opM A B z r) (opS L)),
      p.fst ∈ primalSet A B L z r ∧ p.snd ∈ dualSet A B L z r := 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.8(i)
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