Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.9, p. 9 — b_k ≥ 0 for L-Lipschitz B and λ ∈ (0, 1/(2L))

Proved
FRBSplitting.Linear.b_nonneg

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

lipschitzoperator-splittingp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a real inner product space, B:H→HB:H\to HB:H→H LLL-Lipschitz with L>0L>0L>0, λ∈(0,12L)\lambda\in(0,\tfrac1{2L})λ∈(0,2L1​), (xk)k≥−1(x_k)_{k\ge-1}(xk​)k≥−1​ any sequence in HHH and x∈Hx\in Hx∈H any point. Then for every k∈Nk\in\mathbb Nk∈N

bk:=12∥xk−x∥2+2λ⟨B(xk)−B(xk−1),x−xk⟩+12∥xk−xk−1∥2 ≥ 0.b_k:=\tfrac12\|x_k-x\|^2+2\lambda\langle B(x_k)-B(x_{k-1}),x-x_k\rangle+\tfrac12\|x_k-x_{k-1}\|^2\ \ge\ 0 .bk​:=21​∥xk​−x∥2+2λ⟨B(xk​)−B(xk−1​),x−xk​⟩+21​∥xk​−xk−1​∥2 ≥ 0.

Nonnegativity of bkb_kbk​ is what allows the inequality α(ak+1+bk+1)≤ak+bk\alpha(a_{k+1}+b_{k+1})\le a_k+b_kα(ak+1​+bk+1​)≤ak​+bk​ to be iterated into a bound on ak+1=12∥xk+1−x∥2a_{k+1}=\tfrac12\|x_{k+1}-x\|^2ak+1​=21​∥xk+1​−x∥2 alone.

Formalization Note. Indices are shifted by one (bSeq B lam x xs k is bkb_kbk​). The paper states the bound for the iterates of the method and a zero xxx; it holds for every sequence and every point, and is stated so (a stronger statement). L>0L>0L>0 is pinned because the step range divides by LLL.

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 b_nonneg {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H]
    (B : H → H) (L lam : ℝ)
    (hL : 0 < L) (hBL : IsLipschitzOp L B)
    (hlam0 : 0 < lam) (hlam1 : lam < 1 / (2 * L))
    (x : ℕ → H) (xs : H) :
    ∀ k : ℕ, 0 ≤ bSeq B lam x xs k := by sorry

end FRBSplitting.Linear
Source
Malitsky & Tam, A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity, arXiv:1808.04162v4, p. 9, definition of b_k and its lower bound, proof of Theorem 2.9
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