Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 5, p. 21 — along the high-resolution ODE of NAG-C, inf_{t₀≤u≤t}‖∇f(X(u))‖² ≤ (12 + 9sL)‖x₀ − x⋆‖²/(2√s(t³ − t₀³))

Proved
HighResODE.NAGCODE.theorem_5

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

accelerated-gradientconvex-optimizationgradient-normhigh-resolution-odenesterovp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f∈FL2(Rn)f\in\mathcal F^2_L(\mathbb R^n)f∈FL2​(Rn) be an LLL-smooth convex function with Lipschitz-continuous Hessian, and let x⋆x^\starx⋆ be a minimizer of fff. Fix an arbitrary step size s>0s>0s>0, put t0=1.5st_0=1.5\sqrt st0​=1.5s​, and let X=X(t)X=X(t)X=X(t) solve the high-resolution ODE of NAG-C

X¨(t)+3tX˙(t)+s ∇2f(X(t))X˙(t)+(1+3s2t)∇f(X(t))=0(t≥t0),X(t0)=x0, X˙(t0)=−s ∇f(x0).\ddot X(t)+\frac3t\dot X(t)+\sqrt s\,\nabla^2 f(X(t))\dot X(t)+\Big(1+\frac{3\sqrt s}{2t}\Big)\nabla f(X(t))=0\quad(t\ge t_0),\qquad X(t_0)=x_0,\ \dot X(t_0)=-\sqrt s\,\nabla f(x_0).X¨(t)+t3​X˙(t)+s​∇2f(X(t))X˙(t)+(1+2t3s​​)∇f(X(t))=0(t≥t0​),X(t0​)=x0​, X˙(t0​)=−s​∇f(x0​).

Then the squared gradient norm satisfies

inf⁡t0≤u≤t∥∇f(X(u))∥2≤(12+9sL)∥x0−x⋆∥22s (t3−t03)for all t>t0.\inf_{t_0\le u\le t}\|\nabla f(X(u))\|^2\le\frac{(12+9sL)\|x_0-x^\star\|^2}{2\sqrt s\,(t^3-t_0^3)}\qquad\text{for all }t>t_0 .t0​≤u≤tinf​∥∇f(X(u))∥2≤2s​(t3−t03​)(12+9sL)∥x0​−x⋆∥2​for all t>t0​.

With s=1/Ls=1/Ls=1/L this is an O(L/t3)O(\sqrt L/t^3)O(L​/t3) rate for the squared gradient norm, faster than the O(L/t2)O(L/t^2)O(L/t2) that follows from the function-value rate. It is the continuous-time counterpart of the inverse cubic rate of NAG-C (Theorem 6 of the paper), and it is driven by the Hessian (gradient-correction) term, which the low-resolution ODE lacks.

Formalization Note The statement holds for every solution (X,X˙)(X,\dot X)(X,X˙) of the ODE on [t0,∞)[t_0,\infty)[t0​,∞); existence and uniqueness of the solution (Proposition 2.2 of the paper) are not assumed. The minimizer x⋆x^\starx⋆ is assumed to exist, as the paper presupposes. The infimum is over the points of [t0,t][t_0,t][t0​,t]. The step size is unrestricted: there is no condition s≤1/Ls\le1/Ls≤1/L.

Preamble
import Mathlib
import Definitions.Def_HighResODE_NAGCODE_Setting
Formal statement
namespace HighResODE.NAGCODE

open scoped InnerProductSpace

/-- Theorem 5, p. 21: for `f ∈ F²_L(ℝⁿ)`, any step size `s > 0` and the solution `X` of (1.12),
`inf_{t₀≤u≤t} ‖∇f(X(u))‖² ≤ (12 + 9sL)‖x₀ − x⋆‖²/(2√s(t³ − t₀³))` for all `t > t₀ = 1.5√s`. -/
theorem theorem_5 {n : ℕ} (f : HighResODE.NAGSC.E n → ℝ) (L s : ℝ) (hf : IsF2 f L) (xs : HighResODE.NAGSC.E n)
    (hmin : ∀ z : HighResODE.NAGSC.E n, f xs ≤ f z) (hs : 0 < s) (x0 : HighResODE.NAGSC.E n) (X V : ℝ → HighResODE.NAGSC.E n)
    (hsol : IsNAGCODE f s x0 X V) :
    ∀ t : ℝ, t0 s < t →
      (⨅ u : Set.Icc (t0 s) t, ‖gradient f (X u)‖ ^ 2)
        ≤ (12 + 9 * s * L) * ‖x0 - xs‖ ^ 2 / (2 * Real.sqrt s * (t ^ 3 - (t0 s) ^ 3)) := by sorry

end HighResODE.NAGCODE
Source
Shi, Du, Jordan & Su, Understanding the Acceleration Phenomenon via High-Resolution Differential Equations, arXiv:1810.08907v3, p. 21, Theorem 5
Human review
  • Endorsed by Shuze Chen · Oct 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 10, 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