Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 20, p. 31 — gradient difference for two local solutions

Proved
NesterovODE.WellPosed.lemma_20

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

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

Suppose f∈FLf\in\mathcal F_Lf∈FL​, and X,YX,YX,Y are two solutions of (3) with the same initial position and zero initial velocity on 0<t<a0<t<a0<t<a. Let M~(t)=sup⁡0≤u<t∥X˙(u)−Y˙(u)∥\widetilde M(t)=\sup_{0\le u<t}\|\dot X(u)-\dot Y(u)\|M(t)=sup0≤u<t​∥X˙(u)−Y˙(u)∥. Then for 0<t<a0<t<a0<t<a,

∥∇f(X(t))−∇f(Y(t))∥≤Lt M~(t).\|\nabla f(X(t))-\nabla f(Y(t))\|\le Lt\,\widetilde M(t).∥∇f(X(t))−∇f(Y(t))∥≤LtM(t).

This controls the difference in the forcing terms near the initial time.

Formalization Note Any BBB that bounds the velocity difference at every 0≤u<t0\le u<t0≤u<t replaces the supremum in Lean. The local solution predicate includes the common initial data and the one-sided regularity at zero.

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

/-- Lemma 20, p. 31: gradient variation between two local solutions. -/
theorem lemma_20 {n : ℕ} (f : E n → ℝ) (L : NNReal) (x₀ : E n)
    (a t B : ℝ) (X V Y W : ℝ → E n)
    (hf : IsFL f L) (hX : IsLocalSolution f x₀ a X V)
    (hY : IsLocalSolution f x₀ a Y W)
    (ht₀ : 0 < t) (hta : t < a)
    (hB : ∀ u : ℝ, 0 ≤ u → u < t → ‖V u - W u‖ ≤ B) :
    ‖gradient f (X t) - gradient f (Y t)‖ ≤ (L : ℝ) * t * B := by sorry

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