Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 1 — Gaussian moment bounds Mp≤np/2M_p \le n^{p/2}Mp​≤np/2 (p≤2p\le2p≤2), np/2≤Mp≤(p+n)p/2n^{p/2}\le M_p\le(p+n)^{p/2}np/2≤Mp​≤(p+n)p/2 (p≥2p\ge2p≥2)

Proved
RandomGradFree.Smooth.gaussian_moment_bound

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

gaussian-momentsgaussian-smoothingp2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let EEE be a real inner product space of finite dimension nnn, uuu a standard Gaussian vector in EEE, and Mp=Eu∥u∥pM_p = \mathbb E_u\|u\|^pMp​=Eu​∥u∥p. Then:

  1. for p∈[0,2]p \in [0,2]p∈[0,2],
Mp≤np/2;M_p \le n^{p/2};Mp​≤np/2;
  1. for p≥2p \ge 2p≥2,
np/2≤Mp≤(p+n)p/2.n^{p/2} \le M_p \le (p+n)^{p/2}.np/2≤Mp​≤(p+n)p/2.

These bounds turn the second moments of the random oracles into explicit dimension-dependent constants; the case p=6p = 6p=6 produces the factor (n+6)3(n+6)^3(n+6)3 in the variance bound (35).

Preamble
import Mathlib
import Definitions.Def_RandomGradFree_Shared_moment

open MeasureTheory ProbabilityTheory
Formal statement
namespace RandomGradFree.Smooth

theorem gaussian_moment_bound (E : Type*) [NormedAddCommGroup E] [InnerProductSpace ℝ E]
    [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E] (p : ℝ) :
    (0 ≤ p → p ≤ 2 → RandomGradFree.Shared.moment E p ≤ (Module.finrank ℝ E : ℝ) ^ (p / 2)) ∧
    (2 ≤ p → (Module.finrank ℝ E : ℝ) ^ (p / 2) ≤ RandomGradFree.Shared.moment E p ∧
      RandomGradFree.Shared.moment E p ≤ (p + Module.finrank ℝ E) ^ (p / 2)) := by sorry

end RandomGradFree.Smooth
Source
Nesterov, Spokoiny, Random Gradient-Free Minimization of Convex Functions, Found. Comput. Math. 17 (2017), p. 534, Lemma 1, Eqs. (16)-(17)
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 ppp is any real number. Write n=dim⁡REn = \dim_{\mathbb{R}} En=dimR​E. Write Mp=moment(E,p)M_p = \mathrm{moment}(E, p)Mp​=moment(E,p) for the imported definition RandomGradFree.Shared.moment. Its body is not included in the code provided, so this read-back cannot unfold it.

Claim. The theorem asserts both of the following:

  • (a) If 0≤p≤20 \le p \le 20≤p≤2, then
Mp  ≤  np/2.M_p \;\le\; n^{p/2}.Mp​≤np/2.
  • (b) If p≥2p \ge 2p≥2, then
np/2  ≤  Mp  ≤  (p+n)p/2.n^{p/2} \;\le\; M_p \;\le\; (p+n)^{p/2}.np/2≤Mp​≤(p+n)p/2.

Powers are real powers of nonnegative bases. At p=2p = 2p=2 both (a) and (b) apply, which gives n≤M2≤nn \le M_2 \le nn≤M2​≤n together with M2≤2+nM_2 \le 2+nM2​≤2+n. For p<0p < 0p<0 the theorem claims nothing.

Degenerate cases.

  • n=0n = 0n=0 (E={0}E = \{0\}E={0}). The convention 00=10^0 = 100=1 applies.
    • At p=0p = 0p=0, part (a) says M0≤1M_0 \le 1M0​≤1.
    • For 0<p≤20 < p \le 20<p≤2, part (a) says Mp≤0M_p \le 0Mp​≤0.
    • For p≥2p \ge 2p≥2, part (b) says 0≤Mp≤pp/20 \le M_p \le p^{p/2}0≤Mp​≤pp/2.
  • p=0p = 0p=0 for any nnn. Part (a) says M0≤1M_0 \le 1M0​≤1.
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