Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Section 2, Eq. (21) — ∇fμ(x)=Eu gμ(x)\nabla f_\mu(x) = \mathbb E_u\, g_\mu(x)∇fμ​(x)=Eu​gμ​(x) for μ>0\mu > 0μ>0

Proved
RandomGradFree.Accelerated.smoothing_hasGradient

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

gaussian-smoothingp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1zeroth-order

Let EEE be a finite-dimensional real inner product space, let f:E→Rf : E \to \mathbb Rf:E→R be differentiable with L1L_1L1​-Lipschitz gradient, and let μ>0\mu > 0μ>0. Then the Gaussian approximation fμf_\mufμ​ is differentiable at every x∈Ex \in Ex∈E, and its gradient is the expectation of the random gradient-free oracle:

∇fμ(x)=1κ∫Ef(x+μu)−f(x)μ e−12∥u∥2 Bu du=Eu(gμ(x)).\nabla f_\mu(x) = \frac{1}{\kappa}\int_E \frac{f(x+\mu u) - f(x)}{\mu}\, e^{-\frac12\|u\|^2}\, Bu\,du = \mathbb E_u\big(g_\mu(x)\big).∇fμ​(x)=κ1​∫E​μf(x+μu)−f(x)​e−21​∥u∥2Budu=Eu​(gμ​(x)).

Thus gμ(x)g_\mu(x)gμ​(x) is an unbiased estimate of ∇fμ(x)\nabla f_\mu(x)∇fμ​(x); this is the identity used when the expectation over uku_kuk​ is taken in the proof of Theorem 9.

Formalization Note The statement is HasGradientAt of fμf_\mufμ​ at xxx with gradient the Bochner integral of the (B−1B^{-1}B−1-applied) oracle against stdGaussian E. The paper states differentiability for any positive μ\muμ; the C1,1C^{1,1}C1,1 hypothesis of this mission guarantees the integrals exist.

Preamble
import Mathlib
import Definitions.Def_RandomGradFree_Shared_smoothing
import Definitions.Def_RandomGradFree_Shared_oracle

open MeasureTheory ProbabilityTheory
Formal statement
namespace RandomGradFree.Accelerated

theorem smoothing_hasGradient {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) :
    HasGradientAt (RandomGradFree.Shared.smoothing f μ) (∫ u, RandomGradFree.Shared.oracle f μ x u ∂(stdGaussian E)) x := by sorry

end RandomGradFree.Accelerated
Source
Nesterov, Spokoiny, Random Gradient-Free Minimization of Convex Functions, Found. Comput. Math. 17 (2017), pp. 534-535, Section 2, Eq. (21)
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, carrying the standard Gaussian probability measure NE\mathcal N_ENE​.
  • 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 μ.

Neither definition is in the code provided, and this read-back does not describe them.

The theorem asserts that fμf_\mufμ​ is differentiable at xxx and its gradient there is the EEE-valued Gaussian average of the oracle:

∇fμ(x)  =  ∫Egμ(x,u) dNE(u).\nabla f_\mu(x) \;=\; \int_E g_\mu(x,u)\, d\mathcal N_E(u).∇fμ​(x)=∫E​gμ​(x,u)dNE​(u).

Degenerate cases:

  • The integral is a Bochner integral. If u↦gμ(x,u)u \mapsto g_\mu(x,u)u↦gμ​(x,u) were not integrable, it would be assigned the value 000, and the claim would then read "fμf_\mufμ​ has gradient 000 at xxx".
  • n=0n = 0n=0 makes the claim trivial.
  • μ=0\mu = 0μ=0 is excluded.
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