Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.9, p. 9 — (A + B)⁻¹(0) has at most one element when A is strongly monotone and B monotone

Proved
FRBSplitting.Linear.zeroSet_subsingleton

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

monotone-inclusionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1strong-monotonicity

Let HHH be a real inner product space, A:H⇉HA:H\rightrightarrows HA:H⇉H mmm-strongly monotone with m>0m>0m>0, and B:H→HB:H\to HB:H→H monotone. Then the zero set

(A+B)−1(0)={x∈H:0∈A(x)+B(x)}(A+B)^{-1}(0)=\{x\in H: 0\in A(x)+B(x)\}(A+B)−1(0)={x∈H:0∈A(x)+B(x)}

contains at most one point.

In Theorem 2.9 this gives the uniqueness of the limit: the zero set is assumed nonempty, so it is a singleton, and the iterates converge to its only element.

Formalization Note. The paper obtains uniqueness at the end of the proof of Theorem 2.9, from the convergence of a single run to every zero. The statement here needs neither the method nor Lipschitz continuity nor maximality, and is stated without them (a stronger statement).

Preamble
import Mathlib
import Definitions.Def_ThreeOpSplitting_Accel_MonotoneOperators
import Definitions.Def_FRBSplitting_Linear_Setting
open InnerProductSpace ThreeOpSplitting.Accel
Formal statement
namespace FRBSplitting.Linear

theorem zeroSet_subsingleton {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    (A : H → Set H) (B : H → H) (m : ℝ)
    (hm : 0 < m) (hAs : IsStronglyMonotoneOp m A)
    (hBm : IsMonotoneFun B) :
    (FRBSplitting.Weak.zeroSet A B).Subsingleton := by sorry

end FRBSplitting.Linear
Source
Malitsky & Tam, A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity, arXiv:1808.04162v4, p. 9, proof of Theorem 2.9, last sentence
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

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