Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.4, p. 267 — a β-smooth f satisfies |f(x) − f(y) − ∇f(y)⊤(x − y)| ≤ (β/2)‖x − y‖²

Proved
ConvexOptAlg.SmoothGD.lemma_3_4

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

convex-optimizationdescent-lemmap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1smoothness

Let f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R be β\betaβ-smooth, i.e. differentiable with β\betaβ-Lipschitz gradient ∇f\nabla f∇f. Then for all x,y∈Rnx,y\in\mathbb R^nx,y∈Rn,

∣f(x)−f(y)−∇f(y)⊤(x−y)∣≤β2∥x−y∥2.\bigl|f(x)-f(y)-\nabla f(y)^\top(x-y)\bigr|\le\frac{\beta}{2}\|x-y\|^2.​f(x)−f(y)−∇f(y)⊤(x−y)​≤2β​∥x−y∥2.

This is the two-sided quadratic bound on the error of the first-order Taylor approximation; no convexity is assumed. Its upper half is the descent lemma used to measure the progress of one gradient step.

Formalization Note The gradient is an explicit map ggg with g(x)=∇f(x)g(x)=\nabla f(x)g(x)=∇f(x) for every xxx; β≥0\beta\ge0β≥0 is included because a Lipschitz constant is non-negative, including when n=0n=0n=0.

Preamble
import Mathlib
import Definitions.Def_ConvexOptAlg_SmoothGD_Defs
open scoped InnerProductSpace
Formal statement
namespace ConvexOptAlg.SmoothGD

/-- Lemma 3.4 (Bubeck, arXiv:1405.4980v2, p. 267): for a β-smooth `f` on `ℝⁿ` with gradient map
`g`, `|f(x) − f(y) − ∇f(y)⊤(x − y)| ≤ (β/2)‖x − y‖²` for all `x, y`. No convexity. -/
theorem lemma_3_4 {n : ℕ} (f : EuclideanSpace ℝ (Fin n) → ℝ)
    (g : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n)) (β : ℝ)
    (hf : IsBetaSmooth f g β) (x y : EuclideanSpace ℝ (Fin n)) :
    |f x - f y - ⟪g y, x - y⟫_ℝ| ≤ β / 2 * ‖x - y‖ ^ 2 := by sorry

end ConvexOptAlg.SmoothGD
Source
Bubeck, arXiv:1405.4980v2, Lemma 3.4, p. 267
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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