Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 3, p. 7 — for f ∈ F_∞ the solution of (3) satisfies f(X(t)) − f⋆ ≤ 2‖x₀ − x⋆‖²/t²

Proved
NesterovODE.Rate.theorem_3

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

convergence-ratelyapunov-energynesterov-odep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f∈F∞f\in\mathcal F_\inftyf∈F∞​, i.e. f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R is convex and continuously differentiable with LLL-Lipschitz gradient for some L>0L>0L>0. Let x⋆x^\starx⋆ be any minimizer of fff and f⋆=f(x⋆)f^\star=f(x^\star)f⋆=f(x⋆). Let XXX be the solution of

X¨+3tX˙+∇f(X)=0(t>0),X(0)=x0, X˙(0)=0.\ddot X+\frac3t\dot X+\nabla f(X)=0\quad(t>0),\qquad X(0)=x_0,\ \dot X(0)=0 .X¨+t3​X˙+∇f(X)=0(t>0),X(0)=x0​, X˙(0)=0.

Then for every t>0t>0t>0,

f(X(t))−f⋆≤2∥x0−x⋆∥2t2.(7)f(X(t))-f^\star\le\frac{2\|x_0-x^\star\|^2}{t^2}.\tag{7}f(X(t))−f⋆≤t22∥x0​−x⋆∥2​.(7)

This is the continuous-time counterpart of Nesterov's bound f(xk)−f⋆≤2∥x0−x⋆∥2/(s(k+1)2)f(x_k)-f^\star\le 2\|x_0-x^\star\|^2/(s(k+1)^2)f(xk​)−f⋆≤2∥x0​−x⋆∥2/(s(k+1)2) for the accelerated gradient method with step size s≤1/Ls\le1/Ls≤1/L (6): under the identification t≈kst\approx k\sqrt st≈ks​ the two rates coincide.

Formalization Note Rn\mathbb R^nRn is EuclideanSpace ℝ (Fin n). The paper speaks of "the unique global solution" in C2((0,∞))∩C1([0,∞))C^2((0,\infty))\cap C^1([0,\infty))C2((0,∞))∩C1([0,∞)); the statement here holds for every solution in that class (encoded as a pair (X,X˙)(X,\dot X)(X,X˙)), which by Theorem 1 of the paper is the same statement. No hypothesis beyond the paper's is added; the Lipschitz constant is not used quantitatively.

Preamble
import Mathlib
import Definitions.Def_NesterovODE_Rate_Setting
Formal statement
namespace NesterovODE.Rate

/-- Theorem 3 (arXiv:1503.01243v2, p. 7): for `f ∈ F_∞`, every minimizer `x⋆` and every solution
`X` of (3) with `X(0) = x₀`, `Ẋ(0) = 0`, one has `f(X(t)) − f⋆ ≤ 2‖x₀ − x⋆‖²/t²` for all `t > 0`. -/
theorem theorem_3 {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ) (hf : IsFinfty f)
    (x₀ xstar : EuclideanSpace ℝ (Fin n)) (hxstar : ∀ y, f xstar ≤ f y)
    (X V : ℝ → EuclideanSpace ℝ (Fin n)) (hX : IsSolution f 3 x₀ X V) :
    ∀ t : ℝ, 0 < t → f (X t) - f xstar ≤ 2 * ‖x₀ - xstar‖ ^ 2 / t ^ 2 := by sorry

end NesterovODE.Rate
Source
Su, Boyd, Candès, A Differential Equation for Modeling Nesterov's Accelerated Gradient Method, arXiv:1503.01243v2, p. 7, Theorem 3, (7)
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me