Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Section 2, Eq. (21) — ∇fμ(x)=Euf(x+μu)−f(x)μBu\nabla f_\mu(x) = \mathbb E_u \frac{f(x+\mu u)-f(x)}{\mu}Bu∇fμ​(x)=Eu​μf(x+μu)−f(x)​Bu

Proved
RandomGradFree.Smooth.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, f:E→Rf : E \to \mathbb Rf:E→R differentiable with L1L_1L1​-Lipschitz gradient, and μ>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 expected finite-difference oracle:

∇fμ(x)=Eu ⁣[f(x+μu)−f(x)μ u]=1κ∫Ef(x+μu)−f(x)μ e−12∥u∥2 u du.\nabla f_\mu(x) = \mathbb E_u\!\left[\frac{f(x+\mu u) - f(x)}{\mu}\, u\right] = \frac1\kappa\int_E \frac{f(x+\mu u)-f(x)}{\mu}\, e^{-\frac12\|u\|^2}\, u\, du .∇fμ​(x)=Eu​[μf(x+μu)−f(x)​u]=κ1​∫E​μf(x+μu)−f(x)​e−21​∥u∥2udu.

This identity says that the random oracle gμg_\mugμ​ is an unbiased estimator of ∇fμ\nabla f_\mu∇fμ​, so the random gradient method is a stochastic gradient method for fμf_\mufμ​.

Formalization Note The paper's formula has BuBuBu (a dual vector); after identifying E∗E^*E∗ with EEE via the inner product this is the vector uuu. The paper asks only that fff be continuous enough to differentiate under the integral and leaves integrability implicit; here f∈C1,1f \in C^{1,1}f∈C1,1 (the setting of Theorem 8) guarantees it.

Preamble
import Mathlib
import Definitions.Def_RandomGradFree_Shared_smoothing
import Definitions.Def_RandomGradFree_Shared_oracle

open MeasureTheory ProbabilityTheory
Formal statement
namespace RandomGradFree.Smooth

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.Smooth
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 is a finite-dimensional real inner product space with its Borel σ-algebra, and γE\gamma_EγE​ is the standard Gaussian measure on EEE.

Hypotheses.

  • f:E→Rf : E \to \mathbb{R}f:E→R is differentiable everywhere.
  • Its gradient is L1L_1L1​-Lipschitz, with L1≥0L_1 \ge 0L1​≥0: ∥∇f(x)−∇f(y)∥≤L1∥x−y∥\|\nabla f(x) - \nabla f(y)\| \le L_1\|x-y\|∥∇f(x)−∇f(y)∥≤L1​∥x−y∥ for all x,yx, yx,y.
  • μ>0\mu > 0μ>0.
  • x∈Ex \in Ex∈E is arbitrary.

Convexity of fff is not assumed.

Claim. Let fμ=smoothing(f,μ):E→Rf_\mu = \mathrm{smoothing}(f,\mu) : E \to \mathbb{R}fμ​=smoothing(f,μ):E→R and oraclef,μ\mathrm{oracle}_{f,\mu}oraclef,μ​ be the imported definitions RandomGradFree.Shared.smoothing and RandomGradFree.Shared.oracle. Their bodies are not included in the code provided, so this read-back cannot unfold them. The theorem asserts that fμf_\mufμ​ is Fréchet differentiable at xxx with gradient equal to the EEE-valued Bochner integral

∇fμ(x)  =  ∫Eoraclef,μ(x,u) dγE(u).\nabla f_\mu(x) \;=\; \int_E \mathrm{oracle}_{f,\mu}(x,u)\, d\gamma_E(u).∇fμ​(x)=∫E​oraclef,μ​(x,u)dγE​(u).

Degenerate cases.

  • Integral convention. If u↦oraclef,μ(x,u)u \mapsto \mathrm{oracle}_{f,\mu}(x,u)u↦oraclef,μ​(x,u) were not Bochner-integrable, the integral would be defined as 000. The claim would then say that fμf_\mufμ​ has gradient 000 at xxx.
  • L1=0L_1 = 0L1​=0. This is allowed and forces fff to be affine.
  • μ=0\mu = 0μ=0. This is excluded.
  • E={0}E = \{0\}E={0}. The claim reduces to the right-hand side being the zero vector, which holds automatically.
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