Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(62), Appendix H, p. 23 — F(x + t e_i) − F(x) ≤ t∇_i f(x) + (L/2)t² + g_i(x_i + t) − g_i(x_i)

Proved
KarimiPL.ProxCD.coord_upper_62

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

coordinate-descentdescent-lemmap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1proximal-gradient

Let f:Rd→Rf:\mathbb R^d\to\mathbb Rf:Rd→R be differentiable and satisfy the coordinate-wise LLL-Lipschitz condition (5), L>0L>0L>0: f(x+tei)≤f(x)+t∇if(x)+(L/2)t2f(x+t e_i)\le f(x)+t\nabla_i f(x)+(L/2)t^2f(x+tei​)≤f(x)+t∇i​f(x)+(L/2)t2 for every x,i,tx,i,tx,i,t. Let g(x)=∑igi(xi)g(x)=\sum_i g_i(x_i)g(x)=∑i​gi​(xi​) be separable, with arbitrary real-valued gig_igi​, and F=f+gF=f+gF=f+g. Then for every point xxx, coordinate iii and step t∈Rt\in\mathbb Rt∈R,

F(x+tei)−F(x) ≤ t ∇if(x)+L2 t2+gi(xi+t)−gi(xi).F(x+t e_i)-F(x)\ \le\ t\,\nabla_i f(x)+\frac L2\,t^2+g_i(x_i+t)-g_i(x_i).F(x+tei​)−F(x) ≤ t∇i​f(x)+2L​t2+gi​(xi​+t)−gi​(xi​).

This is the coordinate-wise upper model that the proximal coordinate step (16) minimizes; it is the first step of the proof of Theorem 6.

Formalization Note The coordinate-wise condition is stated in the exact upper-bound form (5). The full LLL-Lipschitz gradient assumed in Theorem 6 implies it. The page writes g(xi)g(x_i)g(xi​) for gi(xi)g_i(x_i)gi​(xi​) in the last term.

Preamble
import Mathlib
import Definitions.Def_KarimiPL_ProxCD_Setting

open InnerProductSpace
Formal statement
namespace KarimiPL.ProxCD

theorem coord_upper_62 {d : ℕ} (f : KarimiPL.Rel.E d → ℝ) (hdiff : Differentiable ℝ f) (L : ℝ) (hL : 0 < L)
    (hCoord : ∀ (x : KarimiPL.Rel.E d) (i : Fin d) (t : ℝ),
      f (x + t • EuclideanSpace.single i (1 : ℝ)) ≤ f x + t * gradient f x i + L / 2 * t ^ 2)
    (gs : Fin d → ℝ → ℝ) :
    ∀ (x : KarimiPL.Rel.E d) (i : Fin d) (t : ℝ),
      (f (x + t • EuclideanSpace.single i (1 : ℝ)) + sepSum gs (x + t • EuclideanSpace.single i (1 : ℝ)))
        - (f x + sepSum gs x) ≤ coordModel f gs L x i t := by sorry

end KarimiPL.ProxCD
Source
Karimi, Nutini, Schmidt, arXiv:1608.04636v4, Appendix H, (62), p. 23
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