Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.47) — the L_f-corrected convexity gap at x^md_k, along Algorithm 4

Proved
NonconvexAG.StochComposite.eq_2_47

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

accelerated-gradientnonconvex-optimizationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Ψ=f+h\Psi=f+hΨ=f+h be as in Lemma 5 and run Algorithm 4 along any realization of the oracle samples. Then for every k≥1k\ge1k≥1 and every x∈Rnx\in\mathbb R^nx∈Rn,

Ψ(xkmd)−[(1−αk)Ψ(xk−1ag)+αkΨ(x)]≤⟨∇Ψ(xkmd),xkmd−αkx−(1−αk)xk−1ag⟩+Lfαk2∥xkmd−x∥2+Lfαk2(1−αk)2∥xk−1ag−xk−1∥2.\Psi(x^{md}_k)-\big[(1-\alpha_k)\Psi(x^{ag}_{k-1})+\alpha_k\Psi(x)\big]\le\langle\nabla\Psi(x^{md}_k),x^{md}_k-\alpha_kx-(1-\alpha_k)x^{ag}_{k-1}\rangle+\frac{L_f\alpha_k}2\|x^{md}_k-x\|^2+\frac{L_f\alpha_k^2(1-\alpha_k)}2\|x^{ag}_{k-1}-x_{k-1}\|^2 .Ψ(xkmd​)−[(1−αk​)Ψ(xk−1ag​)+αk​Ψ(x)]≤⟨∇Ψ(xkmd​),xkmd​−αk​x−(1−αk​)xk−1ag​⟩+2Lf​αk​​∥xkmd​−x∥2+2Lf​αk2​(1−αk​)​∥xk−1ag​−xk−1​∥2.

This is where the possible nonconvexity of fff enters the analysis, through the constant LfL_fLf​ only.

Formalization Note Pathwise. Ψ\PsiΨ, ∇Ψ\nabla\Psi∇Ψ and LΨL_\PsiLΨ​ are given with the identities Ψ=f+h\Psi=f+hΨ=f+h, ∇Ψ=∇f+∇h\nabla\Psi=\nabla f+\nabla h∇Ψ=∇f+∇h, LΨ=Lf+LhL_\Psi=L_f+L_hLΨ​=Lf​+Lh​. Restated from mission 2 of this series (there along Algorithm 2) because drafts cannot import one another; only (2.2) is used, so it holds along Algorithm 4 as well.

Preamble
import Mathlib
import Definitions.Def_ConvexOptAlg_SmoothGD_Defs
import Definitions.Def_GhadimiLan_RSG_Model
import Definitions.Def_NonconvexAG_StochComposite_ProxMap
import Definitions.Def_NonconvexAG_StochComposite_RSAG
open MeasureTheory ProbabilityTheory
open scoped InnerProductSpace
Formal statement
namespace NonconvexAG.StochComposite

open GhadimiLan.RSG (E)
open ConvexOptAlg.SmoothGD

/-- (2.47), p. 12 (outer ends of the chain), along Algorithm 4 on `Ψ = f + h`, for every
realization `ω`, every `k ≥ 1` and every `x ∈ ℝⁿ`. -/
theorem eq_2_47 {n : ℕ} (f h : E n → ℝ) (gf gh : E n → E n) (Lf Lh : ℝ)
    (hf : IsBetaSmooth f gf Lf) (hh : IsBetaSmooth h gh Lh) (hhc : ConvexOn ℝ Set.univ h)
    (Ψ : E n → ℝ) (gΨ : E n → E n) (LΨ : ℝ) (hΨ : Ψ = fun x => f x + h x)
    (hgΨ : gΨ = fun x => gf x + gh x) (hLΨ : LΨ = Lf + Lh)
    (P : E n → E n → ℝ → E n) {Ξ : Type*} (G : E n → Ξ → E n)
    (α β lam : ℕ → ℝ) (m : ℕ → ℕ) (hstep : RSAGStepsizes α β lam m) (x0 : E n)
    {Ω : Type*} (ξ : ℕ → Ω → Ξ) :
    let xk : ℕ → Ω → E n := xSeq G P α β lam m x0 ξ
    let xag : ℕ → Ω → E n := xagSeq G P α β lam m x0 ξ
    let xmd : ℕ → Ω → E n := xmdSeq G P α β lam m x0 ξ
    ∀ ω : Ω, ∀ k, 1 ≤ k → ∀ x : E n,
      Ψ (xmd k ω) - ((1 - α k) * Ψ (xag (k - 1) ω) + α k * Ψ x) ≤
        inner ℝ (gΨ (xmd k ω)) (xmd k ω - α k • x - (1 - α k) • xag (k - 1) ω) +
          Lf * α k / 2 * ‖xmd k ω - x‖ ^ 2 +
          Lf * α k ^ 2 * (1 - α k) / 2 * ‖xag (k - 1) ω - xk (k - 1) ω‖ ^ 2 := by sorry

end NonconvexAG.StochComposite
Source
Ghadimi & Lan, Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming, arXiv:1310.3787v1, p. 12, (2.47)
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