Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 16, p. 29 — gradient variation along a smoothed solution

Proved
NesterovODE.WellPosed.lemma_16

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

convex-optimizationnesterov-odep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1singular-ode

Let f∈FLf\in\mathcal F_Lf∈FL​, let XδX_\deltaXδ​ solve the smoothed equation (31) from x0x_0x0​, and let u>0u>0u>0. Write Mδ(u)=sup⁡0<v≤u∥X˙δ(v)∥/vM_\delta(u)=\sup_{0<v\le u}\|\dot X_\delta(v)\|/vMδ​(u)=sup0<v≤u​∥X˙δ​(v)∥/v. Then

∥∇f(Xδ(u))−∇f(x0)∥≤12LMδ(u)u2.\|\nabla f(X_\delta(u))-\nabla f(x_0)\|\le \tfrac12 L M_\delta(u)u^2.∥∇f(Xδ​(u))−∇f(x0​)∥≤21​LMδ​(u)u2.

This controls the change in the gradient through the initial velocity growth.

Formalization Note The statement uses any upper bound BBB on every quotient ∥X˙δ(v)∥/v\|\dot X_\delta(v)\|/v∥X˙δ​(v)∥/v for 0<v≤u0<v\le u0<v≤u, and concludes the same inequality with BBB. This pointwise form represents the supremum without a default value on an unbounded set.

Preamble
import Mathlib
import Definitions.Def_NesterovODE_WellPosed_Setting
Formal statement
namespace NesterovODE.WellPosed

/-- Lemma 16, p. 29: gradient variation along a smoothed trajectory. -/
theorem lemma_16 {n : ℕ} (f : E n → ℝ) (L : NNReal) (x₀ : E n)
    (δ : ℝ) (X V : ℝ → E n) (u B : ℝ)
    (hf : IsFL f L) (hX : IsSmoothedSolution f δ x₀ X V)
    (hu : 0 < u) (hB : ∀ v : ℝ, 0 < v → v ≤ u → ‖V v‖ / v ≤ B) :
    ‖gradient f (X u) - gradient f x₀‖ ≤
      (1 / 2 : ℝ) * (L : ℝ) * B * u ^ 2 := by sorry

end NesterovODE.WellPosed
Source
Su, Boyd, Candès, A Differential Equation for Modeling Nesterov's Accelerated Gradient Method, arXiv:1503.01243v2, p. 29, Lemma 16
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