Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proof of Theorem 2.1, p. 22 — pathwise bound on ‖x_k − x⋆ − γ∇f_i(x_k)‖² via Jensen and co-coercivity

Proved
SGDKaczmarz.SGD.step_bound

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

co-coercivityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-gradient-descent

Let H\mathcal HH be a real Hilbert space and g:H→Rg : \mathcal H \to \mathbb Rg:H→R a differentiable convex function (playing one component fif_ifi​) whose gradient is Lipschitz with constant Li≥0L_i \ge 0Li​≥0. For all points xxx (the current iterate xkx_kxk​) and x⋆x_\starx⋆​, and every real step γ\gammaγ,

∥x−x⋆−γ∇g(x)∥22≤∥x−x⋆∥22−2γ⟨x−x⋆,∇g(x)⟩+2γ2Li⟨x−x⋆,∇g(x)−∇g(x⋆)⟩+2γ2∥∇g(x⋆)∥22.\|x - x_\star - \gamma\nabla g(x)\|_2^2 \le \|x - x_\star\|_2^2 - 2\gamma\langle x - x_\star, \nabla g(x)\rangle + 2\gamma^2 L_i\langle x - x_\star, \nabla g(x) - \nabla g(x_\star)\rangle + 2\gamma^2\|\nabla g(x_\star)\|_2^2.∥x−x⋆​−γ∇g(x)∥22​≤∥x−x⋆​∥22​−2γ⟨x−x⋆​,∇g(x)⟩+2γ2Li​⟨x−x⋆​,∇g(x)−∇g(x⋆​)⟩+2γ2∥∇g(x⋆​)∥22​.

This is the first display of the proof of Theorem 2.1: one SGD step xk+1=xk−γ∇fi(xk)x_{k+1} = x_k - \gamma\nabla f_i(x_k)xk+1​=xk​−γ∇fi​(xk​), bounded for every sampled index iii before any expectation is taken.

Formalization Note The bound is deterministic: it holds for every component and every point, so it is stated for a single function ggg with constant LiL_iLi​.

Preamble
import Mathlib

open scoped NNReal InnerProductSpace
Formal statement
namespace SGDKaczmarz.SGD

/-- Proof of Theorem 2.1 (Appendix A.2), p. 22, first display: the pathwise one-step bound for one
component `g = f_i` with Lipschitz constant `Li = L_i`, current point `x = x_k`. -/
theorem step_bound {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (g : H → ℝ) (hg : Differentiable ℝ g) (hconv : ConvexOn ℝ Set.univ g) (Li : ℝ≥0)
    (hL : LipschitzWith Li (gradient g)) (x xstar : H) (γ : ℝ) :
    ‖x - xstar - γ • gradient g x‖ ^ 2
      ≤ ‖x - xstar‖ ^ 2 - 2 * γ * ⟪x - xstar, gradient g x⟫_ℝ
        + 2 * γ ^ 2 * Li * ⟪x - xstar, gradient g x - gradient g xstar⟫_ℝ
        + 2 * γ ^ 2 * ‖gradient g xstar‖ ^ 2 := by sorry

end SGDKaczmarz.SGD
Source
Needell, Srebro & Ward, Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm, arXiv:1310.5715v5, proof of Theorem 2.1 (Appendix A.2), first display, p. 22
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me