Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 5 — Eu∥gμ(x)∥∗2≤4(n+4)∥∇fμ(x)∥∗2+3μ2L12(f)(n+4)3\mathbb E_u\|g_\mu(x)\|_*^2 \le 4(n+4)\|\nabla f_\mu(x)\|_*^2 + 3\mu^2L_1^2(f)(n+4)^3Eu​∥gμ​(x)∥∗2​≤4(n+4)∥∇fμ​(x)∥∗2​+3μ2L12​(f)(n+4)3 (Eq. (37))

Proved
RandomGradFree.Accelerated.oracle_second_moment_smoothing

by mikedeng1 · Sep 28, 2026 · Mathlib 0df444a (Lean v4.33.1)

gaussian-smoothingp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-oraclezeroth-order

Let EEE be a real inner product space of dimension nnn, and let f:E→Rf : E \to \mathbb Rf:E→R be differentiable with L1L_1L1​-Lipschitz gradient (no convexity is assumed). Let μ>0\mu > 0μ>0 and let uuu be a standard Gaussian vector in EEE. Then for every x∈Ex \in Ex∈E the random gradient-free oracle B−1gμ(x)=f(x+μu)−f(x)μuB^{-1}g_\mu(x) = \frac{f(x+\mu u)-f(x)}{\mu}uB−1gμ​(x)=μf(x+μu)−f(x)​u satisfies

Eu(∥gμ(x)∥∗2)≤4(n+4) ∥∇fμ(x)∥∗2+3μ2L12(n+4)3.\mathbb E_u\big(\|g_\mu(x)\|_*^2\big) \le 4(n+4)\,\|\nabla f_\mu(x)\|_*^2 + 3\mu^2 L_1^2 (n+4)^3 .Eu​(∥gμ​(x)∥∗2​)≤4(n+4)∥∇fμ​(x)∥∗2​+3μ2L12​(n+4)3.

Unlike the bound in terms of ∇f(x)\nabla f(x)∇f(x), this form has the gradient of the smoothed function on the right, which is what the analysis of the accelerated method needs.

Preamble
import Mathlib
import Definitions.Def_RandomGradFree_Shared_smoothing
import Definitions.Def_RandomGradFree_Shared_oracle

open MeasureTheory ProbabilityTheory
Formal statement
namespace RandomGradFree.Accelerated

theorem oracle_second_moment_smoothing {E : Type*} [NormedAddCommGroup E]
    [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
    (f : E → ℝ) (L₁ : ℝ) (hL₁ : 0 ≤ L₁) (hdiff : Differentiable ℝ f)
    (hgrad : ∀ x y, ‖gradient f x - gradient f y‖ ≤ L₁ * ‖x - y‖)
    (μ : ℝ) (hμ : 0 < μ) (x : E) :
    ∫ u, ‖RandomGradFree.Shared.oracle f μ x u‖ ^ 2 ∂(stdGaussian E)
      ≤ 4 * ((Module.finrank ℝ E : ℝ) + 4) * ‖gradient (RandomGradFree.Shared.smoothing f μ) x‖ ^ 2
        + 3 * μ ^ 2 * L₁ ^ 2 * ((Module.finrank ℝ E : ℝ) + 4) ^ 3 := by sorry

end RandomGradFree.Accelerated
Source
Nesterov, Spokoiny, Random Gradient-Free Minimization of Convex Functions, Found. Comput. Math. 17 (2017), p. 539, Lemma 5, Eq. (37)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting:

  • EEE: a finite-dimensional real inner product space with its Borel σ-algebra, of dimension nnn, carrying the standard Gaussian probability measure NE\mathcal N_ENE​ (Mathlib's stdGaussian).
  • f:E→Rf : E \to \mathbb Rf:E→R: differentiable everywhere, with L1L_1L1​-Lipschitz gradient for some real L1≥0L_1 \ge 0L1​≥0.
  • μ>0\mu > 0μ>0: a real number, strictly positive.
  • x∈Ex \in Ex∈E: any point.
  • gμ(x,u)∈Eg_\mu(x, u) \in Egμ​(x,u)∈E: RandomGradFree.Shared.oracle f μ x u.
  • fμf_\mufμ​: RandomGradFree.Shared.smoothing f μ.

The definitions of gμg_\mugμ​ and fμf_\mufμ​ are not in the code provided, and this read-back does not describe them.

The theorem asserts

∫E∥gμ(x,u)∥2 dNE(u)  ≤  4 (n+4) ∥∇fμ(x)∥2  +  3 μ2L12 (n+4)3.\int_E \|g_\mu(x,u)\|^2 \, d\mathcal N_E(u) \;\le\; 4\,(n+4)\,\|\nabla f_\mu(x)\|^2 \;+\; 3\,\mu^2 L_1^2\,(n+4)^3 .∫E​∥gμ​(x,u)∥2dNE​(u)≤4(n+4)∥∇fμ​(x)∥2+3μ2L12​(n+4)3.

Here ∇fμ(x)\nabla f_\mu(x)∇fμ​(x) is the gradient of fμf_\mufμ​ at xxx. By the gradient convention, it would be 000 if fμf_\mufμ​ were not differentiable at xxx; this statement does not itself assert that differentiability. The integral is a Bochner integral of a nonnegative function, assigned the value 000 if the function is not integrable.

Degenerate cases:

  • n=0n = 0n=0: the right-hand side is 4⋅4⋅∥∇fμ(x)∥2+3⋅64 μ2L124\cdot 4\cdot\|\nabla f_\mu(x)\|^2 + 3\cdot 64\,\mu^2 L_1^24⋅4⋅∥∇fμ​(x)∥2+3⋅64μ2L12​, while the left-hand side is 000 because E={0}E = \{0\}E={0}.
  • L1=0L_1 = 0L1​=0: only the first term remains.
  • μ=0\mu = 0μ=0 is excluded by hypothesis.
Human review
  • Endorsed by Shuze Chen · Sep 28, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 28, 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