Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 4.2 (35) — second moments of gμg_\mugμ​ and g^μ\hat g_\mug^​μ​ for f∈C1,1f\in C^{1,1}f∈C1,1

Proved
RandomGradFree.Smooth.oracle_second_moment

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

lipschitz-gradientp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1random-oraclevariance-boundzeroth-order

Let EEE be a real inner product space of finite dimension nnn, uuu a standard Gaussian vector in EEE, and f:E→Rf : E \to \mathbb Rf:E→R convex, differentiable, with L1L_1L1​-Lipschitz gradient. Let μ>0\mu > 0μ>0 and x∈Ex \in Ex∈E, and let gμ(x)g_\mu(x)gμ​(x), g^μ(x)\hat g_\mu(x)g^​μ​(x) be the oracles of (30). Then

Eu(∥gμ(x)∥∗2)≤μ22L12(n+6)3+2(n+4)∥∇f(x)∥∗2,Eu(∥g^μ(x)∥∗2)≤μ28L12(n+6)3+2(n+4)∥∇f(x)∥∗2.\begin{aligned} \mathbb E_u\big(\|g_\mu(x)\|_*^2\big) &\le \frac{\mu^2}{2}L_1^2(n+6)^3 + 2(n+4)\|\nabla f(x)\|_*^2,\\ \mathbb E_u\big(\|\hat g_\mu(x)\|_*^2\big) &\le \frac{\mu^2}{8}L_1^2(n+6)^3 + 2(n+4)\|\nabla f(x)\|_*^2. \end{aligned}Eu​(∥gμ​(x)∥∗2​)Eu​(∥g^​μ​(x)∥∗2​)​≤2μ2​L12​(n+6)3+2(n+4)∥∇f(x)∥∗2​,≤8μ2​L12​(n+6)3+2(n+4)∥∇f(x)∥∗2​.​

The first inequality is the variance bound used in the complexity analysis of the random gradient method RGμ\mathcal{RG}_\muRGμ​ (Theorem 8).

Formalization Note The convexity hypothesis of Theorem 4's preamble is kept, as in the paper's statement. ∥gμ(x)∥∗=∥B−1gμ(x)∥\|g_\mu(x)\|_* = \|B^{-1}g_\mu(x)\|∥gμ​(x)∥∗​=∥B−1gμ​(x)∥. Both second moments are genuine integrals: for f∈C1,1f \in C^{1,1}f∈C1,1 the finite differences are bounded by ∥∇f(x)∥∥u∥+μ2L1∥u∥2\|\nabla f(x)\|\|u\| + \frac{\mu}{2}L_1\|u\|^2∥∇f(x)∥∥u∥+2μ​L1​∥u∥2.

Preamble
import Mathlib
import Definitions.Def_RandomGradFree_Shared_oracle
import Definitions.Def_RandomGradFree_Smooth_symOracle

open MeasureTheory ProbabilityTheory
Formal statement
namespace RandomGradFree.Smooth

theorem oracle_second_moment {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
    (f : E → ℝ) (hf : ConvexOn ℝ Set.univ f)
    (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)
        ≤ μ ^ 2 / 2 * L₁ ^ 2 * ((Module.finrank ℝ E : ℝ) + 6) ^ 3
          + 2 * ((Module.finrank ℝ E : ℝ) + 4) * ‖gradient f x‖ ^ 2 ∧
      ∫ u, ‖symOracle f μ x u‖ ^ 2 ∂(stdGaussian E)
        ≤ μ ^ 2 / 8 * L₁ ^ 2 * ((Module.finrank ℝ E : ℝ) + 6) ^ 3
          + 2 * ((Module.finrank ℝ E : ℝ) + 4) * ‖gradient f x‖ ^ 2 := by sorry

end RandomGradFree.Smooth
Source
Nesterov, Spokoiny, Random Gradient-Free Minimization of Convex Functions, Found. Comput. Math. 17 (2017), p. 538, Theorem 4, part 2, Eq. (35)
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, n=dim⁡REn = \dim_{\mathbb{R}} En=dimR​E, and γE\gamma_EγE​ is the standard Gaussian measure on EEE.
  • f:E→Rf : E \to \mathbb{R}f:E→R, and L1L_1L1​, μ\muμ are real numbers.

Hypotheses.

  • fff is convex on all of EEE.
  • L1≥0L_1 \ge 0L1​≥0.
  • fff is differentiable everywhere, with gradient ∇f\nabla f∇f.
  • The gradient is L1L_1L1​-Lipschitz: ∥∇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.

Claim. Both of the following hold:

∫E∥oraclef,μ(x,u)∥2 dγE(u)  ≤  μ22 L12 (n+6)3  +  2(n+4) ∥∇f(x)∥2,\int_E \big\|\mathrm{oracle}_{f,\mu}(x,u)\big\|^2\, d\gamma_E(u) \;\le\; \frac{\mu^2}{2}\,L_1^2\,(n+6)^3 \;+\; 2(n+4)\,\|\nabla f(x)\|^2,∫E​​oraclef,μ​(x,u)​2dγE​(u)≤2μ2​L12​(n+6)3+2(n+4)∥∇f(x)∥2, ∫E∥f(x+μu)−f(x−μu)2μ u∥2 dγE(u)  ≤  μ28 L12 (n+6)3  +  2(n+4) ∥∇f(x)∥2.\int_E \Big\|\frac{f(x+\mu u)-f(x-\mu u)}{2\mu}\,u\Big\|^2\, d\gamma_E(u) \;\le\; \frac{\mu^2}{8}\,L_1^2\,(n+6)^3 \;+\; 2(n+4)\,\|\nabla f(x)\|^2 .∫E​​2μf(x+μu)−f(x−μu)​u​2dγE​(u)≤8μ2​L12​(n+6)3+2(n+4)∥∇f(x)∥2.

In the first inequality, oracle\mathrm{oracle}oracle is the imported definition RandomGradFree.Shared.oracle. Its body is not included in the code provided, so this read-back cannot unfold it. In the second inequality, the integrand is the symmetric oracle written out explicitly.

Degenerate cases.

  • Integral convention. If either integrand were not integrable, its integral would be defined as 000. That inequality would then hold trivially, since both right-hand sides are ≥0\ge 0≥0.
  • L1=0L_1 = 0L1​=0. This is allowed. It forces ∇f\nabla f∇f to be constant, so fff is affine, and the μ\muμ-terms vanish.
  • n=0n = 0n=0. The right-hand sides become μ22⋅216 L12\frac{\mu^2}{2}\cdot 216\,L_1^22μ2​⋅216L12​ and μ28⋅216 L12\frac{\mu^2}{8}\cdot 216\,L_1^28μ2​⋅216L12​, because ∇f(x)=0\nabla f(x) = 0∇f(x)=0. The left side of the symmetric bound is 000.
  • μ=0\mu = 0μ=0. This is excluded by the hypothesis μ>0\mu > 0μ>0.
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