Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4.1 — the accelerated proximal point method has fixed-point residual ∥xi−yi−1∥2≤R2/i2\|x_i-y_{i-1}\|^2\le R^2/i^2∥xi​−yi−1​∥2≤R2/i2

Proved
AccelPPM.FPR.theorem4_1_fixed_point_residual

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationmonotone-operatorsp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-point-method

Let H\mathcal HH be a real Hilbert space, let M∈M(H)M\in\mathcal M(\mathcal H)M∈M(H) be a maximally monotone operator, let λ>0\lambda>0λ>0, and let x0,y0,x1,y1,⋯∈Hx_0,y_0,x_1,y_1,\dots\in\mathcal Hx0​,y0​,x1​,y1​,⋯∈H be generated by the proposed accelerated proximal point method

x0=y0=y−1,xi+1=JλM(yi),yi+1=xi+1+ii+2(xi+1−xi)−ii+2(xi−yi−1).x_0=y_0=y_{-1},\qquad x_{i+1}=J_{\lambda M}(y_i),\qquad y_{i+1}=x_{i+1}+\frac{i}{i+2}(x_{i+1}-x_i)-\frac{i}{i+2}(x_i-y_{i-1}).x0​=y0​=y−1​,xi+1​=JλM​(yi​),yi+1​=xi+1​+i+2i​(xi+1​−xi​)−i+2i​(xi​−yi−1​).

Assume ∥x0−x∗∥≤R\|x_0-x_*\|\le R∥x0​−x∗​∥≤R for a constant R>0R>0R>0 and some x∗∈X∗(M)={x:0∈Mx}x_*\in X_*(M)=\{x:0\in Mx\}x∗​∈X∗​(M)={x:0∈Mx}. Then for every i≥1i\ge1i≥1,

∥xi−yi−1∥2 ≤ R2i2.\|x_i-y_{i-1}\|^2\ \le\ \frac{R^2}{i^2}.∥xi​−yi−1​∥2 ≤ i2R2​.

Here xi−yi−1=JλM(yi−1)−yi−1x_i-y_{i-1}=J_{\lambda M}(y_{i-1})-y_{i-1}xi​−yi−1​=JλM​(yi−1​)−yi−1​ is the fixed-point residual of the resolvent at yi−1y_{i-1}yi−1​. The rate O(1/i2)O(1/i^2)O(1/i2) improves the O(1/i)O(1/i)O(1/i) rate of the plain proximal point method, and it holds in every real Hilbert space, for every step size and every maximally monotone operator.

Formalization Note The step size λ\lambdaλ is written lam. The resolvent step is encoded relationally as λ−1(yi−xi+1)∈Mxi+1\lambda^{-1}(y_i-x_{i+1})\in Mx_{i+1}λ−1(yi​−xi+1​)∈Mxi+1​, i.e. yi∈(I+λM)xi+1y_i\in(I+\lambda M)x_{i+1}yi​∈(I+λM)xi+1​; for monotone MMM and λ>0\lambda>0λ>0 the resolvent is single-valued, so the inclusion determines xi+1=JλM(yi)x_{i+1}=J_{\lambda M}(y_i)xi+1​=JλM​(yi​), and for maximally monotone MMM it is defined everywhere (Minty), so runs exist from every start. The sequences are indexed by ℕ; y−1=y0y_{-1}=y_0y−1​=y0​ is y (0 - 1) = y 0 by natural-number subtraction. iii is cast to R\mathbb RR in R2/i2R^2/i^2R2/i2.

Preamble
import Mathlib
import Definitions.Def_AccelPPM_FPR_IsMaximalMonotone
import Definitions.Def_AccelPPM_FPR_IsAccelPPMSeq
Formal statement
namespace AccelPPM.FPR

/-- **Theorem 4.1** (Kim, arXiv:1905.05149v4, p. 10). Let `M` be a maximally monotone operator on
a real Hilbert space `H`, let `λ > 0`, and let `x₀, y₀, x₁, y₁, … ∈ H` be generated by the proposed
accelerated proximal point method. Assume `‖x₀ − x_*‖ ≤ R` for a constant `R > 0` and some
`x_* ∈ X_*(M)`. Then for every `i ≥ 1`,
`‖x_i − y_{i−1}‖² ≤ R² / i²`. -/
theorem theorem4_1_fixed_point_residual {H : Type*} [NormedAddCommGroup H]
    [InnerProductSpace ℝ H] [CompleteSpace H]
    (M : H → Set H) (hM : IsMaximalMonotone M) (lam : ℝ) (hlam : 0 < lam)
    (x y : ℕ → H) (hseq : IsAccelPPMSeq M lam x y)
    (xstar : H) (hxstar : xstar ∈ zeroSet M) (R : ℝ) (hR : 0 < R)
    (hx0 : ‖x 0 - xstar‖ ≤ R) :
    ∀ i : ℕ, 1 ≤ i → ‖x i - y (i - 1)‖ ^ 2 ≤ R ^ 2 / (i : ℝ) ^ 2 := by sorry

end AccelPPM.FPR
Source
Kim, Accelerated proximal point method for maximally monotone operators, arXiv:1905.05149v4, p. 10, Theorem 4.1, Eq. (27)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me