Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.4, p. 10 — with linesearch and locally Lipschitz B, the method converges to a zero of A + B in finite dimensions

Proved
FRBSplitting.Linesearch.theorem_3_4

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

convergencelinesearchmonotone-inclusionoperator-splittingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a finite-dimensional real inner product space, A:H⇉HA:H\rightrightarrows HA:H⇉H maximally monotone with resolvents JtA=(I+tA)−1J_{tA}=(I+tA)^{-1}JtA​=(I+tA)−1, and B:H→HB:H\to HB:H→H monotone and locally Lipschitz continuous, and suppose (A+B)−1(0)≠∅(A+B)^{-1}(0)\neq\emptyset(A+B)−1(0)=∅. Let δ∈(0,1)\delta\in(0,1)δ∈(0,1), σ∈(0,1)\sigma\in(0,1)σ∈(0,1), λ−1>0\lambda_{-1}>0λ−1​>0 and x0,x−1∈Hx_0,x_{-1}\in Hx0​,x−1​∈H, and let (xk)(x_k)(xk​) be generated by Algorithm 1: in every iteration some ρ∈{1,σ−1}\rho\in\{1,\sigma^{-1}\}ρ∈{1,σ−1} is chosen, λk=ρλk−1σi\lambda_k=\rho\lambda_{k-1}\sigma^iλk​=ρλk−1​σi with iii the smallest nonnegative integer such that

xk+1=JλkA(xk−λkB(xk)−λk−1(B(xk)−B(xk−1)))satisfiesλk∥B(xk+1)−B(xk)∥≤δ2∥xk+1−xk∥.x_{k+1}=J_{\lambda_kA}\big(x_k-\lambda_kB(x_k)-\lambda_{k-1}(B(x_k)-B(x_{k-1}))\big)\quad\text{satisfies}\quad\lambda_k\|B(x_{k+1})-B(x_k)\|\le\frac\delta2\|x_{k+1}-x_k\|.xk+1​=Jλk​A​(xk​−λk​B(xk​)−λk−1​(B(xk​)−B(xk−1​)))satisfiesλk​∥B(xk+1​)−B(xk​)∥≤2δ​∥xk+1​−xk​∥.

Then there is xˉ∈(A+B)−1(0)\bar x\in(A+B)^{-1}(0)xˉ∈(A+B)−1(0) with

lim⁡k→∞xk=xˉ.\lim_{k\to\infty}x_k=\bar x .k→∞lim​xk​=xˉ.

The linesearch removes the need to know a Lipschitz constant of BBB, and the result covers operators that are only locally Lipschitz.

Formalization Note. The resolvent is a hypothesis: J : ℝ → H → H with IsResolventFamily A J (for maximally monotone AAA it exists and is unique on t>0t>0t>0). The run predicate requires, at every iteration, the chosen ρ∈{1,σ−1}\rho\in\{1,\sigma^{-1}\}ρ∈{1,σ−1} and the least accepted index iii; ρ\rhoρ may vary between iterations. Indices are shifted: x j =xj−1=x_{j-1}=xj−1​, lam j =λj−1=\lambda_{j-1}=λj−1​; Algorithm 1's λ0\lambda_0λ0​ is never used by the iteration and is not a parameter. Convergence is in norm (equivalently in any norm, HHH being finite dimensional).

Preamble
import Mathlib
import Definitions.Def_ThreeOpSplitting_Accel_MonotoneOperators
import Definitions.Def_FRBSplitting_Linesearch_Setting
open InnerProductSpace ThreeOpSplitting.Accel
Formal statement
namespace FRBSplitting.Linesearch

theorem theorem_3_4 {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [FiniteDimensional ℝ H]
    (A : H → Set H) (B : H → H) (J : ℝ → H → H) (δ σ : ℝ)
    (hA : IsMaximalMonotone A)
    (hJ : IsResolventFamily A J)
    (hBm : IsMonotoneFun B) (hBloc : LocallyLipschitz B)
    (hzer : (FRBSplitting.Weak.zeroSet A B).Nonempty)
    (hδ0 : 0 < δ) (hδ1 : δ < 1) (hσ0 : 0 < σ) (hσ1 : σ < 1)
    (lam : ℕ → ℝ) (x : ℕ → H) (hlam0 : 0 < lam 0) (hrun : IsLinesearchRun J B δ σ lam x) :
    ∃ xs ∈ FRBSplitting.Weak.zeroSet A B, Filter.Tendsto x Filter.atTop (nhds xs) := by sorry

end FRBSplitting.Linesearch
Source
Malitsky & Tam, A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity, arXiv:1808.04162v4, p. 10, Theorem 3.4
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