Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.42) — 𝒢(x^md_k, ∇Ψ(x^md_k), β_k) = (x^md_k − x^ag_k)/β_k

Proved
NonconvexAG.Composite.eq_2_42

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

accelerated-gradientcomposite-optimizationnonconvex-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Consider Algorithm 2 with any gradient map ∇Ψ\nabla\Psi∇Ψ, any prox map P\mathcal PP, any step sizes and any starting point. For every k≥1k\ge1k≥1, the gradient mapping (2.38) at the middle iterate with step βk\beta_kβk​ is the scaled difference of the middle and the aggregated iterates:

G(xkmd,∇Ψ(xkmd),βk)=1βk(xkmd−xkag).\mathcal G\big(x^{md}_k,\nabla\Psi(x^{md}_k),\beta_k\big)=\frac1{\beta_k}\big(x^{md}_k-x^{ag}_k\big).G(xkmd​,∇Ψ(xkmd​),βk​)=βk​1​(xkmd​−xkag​).

This identity, immediate from (2.38) and (2.41), converts the bound on ∑∥xkag−xkmd∥2\sum\|x^{ag}_k-x^{md}_k\|^2∑∥xkag​−xkmd​∥2 obtained in the proof of Theorem 2 into the bound (2.44) on the gradient mapping, the termination criterion of the method.

Preamble
import Mathlib
import Definitions.Def_ConvexOptAlg_SmoothGD_Defs
import Definitions.Def_NonconvexAG_Composite_ProxMap
import Definitions.Def_NonconvexAG_Composite_AGRun
Formal statement
namespace NonconvexAG.Composite

open ConvexOptAlg.SmoothGD

/-- (2.42), p. 11: along Algorithm 2, the gradient mapping at `x^md_k` with step `βₖ` is
`(x^md_k − x^ag_k)/βₖ`. -/
theorem eq_2_42 {n : ℕ} (gΨ : NonconvexAG.Smooth.E n → NonconvexAG.Smooth.E n) (P : NonconvexAG.Smooth.E n → NonconvexAG.Smooth.E n → ℝ → NonconvexAG.Smooth.E n) (α β lam : ℕ → ℝ) (x0 : NonconvexAG.Smooth.E n) :
    ∀ k, 1 ≤ k →
      gradMap P (xmdSeq gΨ P α β lam x0 k) (gΨ (xmdSeq gΨ P α β lam x0 k)) (β k) =
        (1 / β k) • (xmdSeq gΨ P α β lam x0 k - xagSeq gΨ P α β lam x0 k) := by sorry
end NonconvexAG.Composite
Source
Ghadimi & Lan, Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming, arXiv:1310.3787v1, p. 11, (2.42)
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