Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(15), p. 9 — one proximal-gradient step gives F(xk+1)−F∗≤(1−μ/L)[F(xk)−F∗]F(x_{k+1}) - F^* \le (1 - \mu/L)[F(x_k) - F^*]F(xk+1​)−F∗≤(1−μ/L)[F(xk​)−F∗]

Proved
KarimiPL.Prox.one_step_15

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

linear-convergencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyak-lojasiewiczproximal-gradient

Let f:Rd→Rf : \mathbb R^d \to \mathbb Rf:Rd→R be differentiable with an LLL-Lipschitz continuous gradient, L>0L > 0L>0, let g:Rd→Rg : \mathbb R^d \to \mathbb Rg:Rd→R be convex, and write F=f+gF = f + gF=f+g. Suppose FFF has a minimizer x∗x^*x∗, write F∗=F(x∗)F^* = F(x^*)F∗=F(x∗), and suppose FFF satisfies the proximal-PL inequality (12) with μ>0\mu > 0μ>0:

12 Dg(x,L)≥μ (F(x)−F∗)for all x.\tfrac12\,\mathcal D_g(x, L) \ge \mu\,\bigl(F(x) - F^*\bigr) \qquad \text{for all } x.21​Dg​(x,L)≥μ(F(x)−F∗)for all x.

Let x∈Rdx \in \mathbb R^dx∈Rd and let x+x^+x+ minimize y↦⟨∇f(x),y−x⟩+L2∥y−x∥2+g(y)−g(x)y \mapsto \langle \nabla f(x), y - x\rangle + \frac L2\|y - x\|^2 + g(y) - g(x)y↦⟨∇f(x),y−x⟩+2L​∥y−x∥2+g(y)−g(x). Then

F(x+)−F∗≤(1−μL)[F(x)−F∗].(15)F(x^+) - F^* \le \Bigl(1 - \frac{\mu}{L}\Bigr)\bigl[F(x) - F^*\bigr]. \tag{15}F(x+)−F∗≤(1−Lμ​)[F(x)−F∗].(15)

This is the one-step contraction of the proof of Theorem 5; applying it along the iterates gives the theorem.

Preamble
import Mathlib
import Definitions.Def_KarimiPL_Prox_Setting

open InnerProductSpace
Formal statement
namespace KarimiPL.Prox

theorem one_step_15 {d : ℕ} (f g : EuclideanSpace ℝ (Fin d) → ℝ)
    (hdiff : Differentiable ℝ f) (L : ℝ) (hL : 0 < L)
    (hLip : ∀ x y, ‖gradient f x - gradient f y‖ ≤ L * ‖x - y‖)
    (hg : ConvexOn ℝ Set.univ g)
    (xstar : EuclideanSpace ℝ (Fin d)) (hxstar : ∀ y, f xstar + g xstar ≤ f y + g y)
    (μ : ℝ) (hμ : 0 < μ) (hPPL : ProxPL f g L μ (f xstar + g xstar)) :
    ∀ x y : EuclideanSpace ℝ (Fin d), (∀ z, proxModel f g x L y ≤ proxModel f g x L z) →
      (f y + g y) - (f xstar + g xstar) ≤ (1 - μ / L) * ((f x + g x) - (f xstar + g xstar)) := by sorry

end KarimiPL.Prox
Source
Karimi, Nutini, Schmidt, arXiv:1608.04636v4, proof of Theorem 5, (15), p. 9
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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