Lemma 1 — Gaussian moment bounds (), ()
ProvedRandomGradFree.Smooth.gaussian_moment_boundLet be a real inner product space of finite dimension , a standard Gaussian vector in , and . Then:
- for ,
- for ,
These bounds turn the second moments of the random oracles into explicit dimension-dependent constants; the case produces the factor in the variance bound (35).
import Mathlib import Definitions.Def_RandomGradFree_Shared_moment open MeasureTheory ProbabilityTheory
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Setting. is a finite-dimensional real inner product space with its Borel σ-algebra, and is any real number. Write . Write 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 , then
- (b) If , then
Powers are real powers of nonnegative bases. At both (a) and (b) apply, which gives together with . For the theorem claims nothing.
Degenerate cases.
- (). The convention applies.
- At , part (a) says .
- For , part (a) says .
- For , part (b) says .
- for any . Part (a) says .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.