Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Marginal law of z̄ — the sample mean of the z_i is N(0, (1 + σ²/n) I)

Proved
RobustGeneralization.GaussLower.zbar_marginal

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

gaussian-convolutiongaussian-modelp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let n≥1n \ge 1n≥1 and σ>0\sigma > 0σ>0. Draw θ∼N(0,Id)\theta \sim \mathcal N(0, I_d)θ∼N(0,Id​) and then, given θ\thetaθ, z1,…,znz_1,\dots,z_nz1​,…,zn​ i.i.d. from N(θ,σ2Id)\mathcal N(\theta, \sigma^2 I_d)N(θ,σ2Id​). The sample mean zˉ=1n∑i=1nzi\bar z = \frac1n\sum_{i=1}^n z_izˉ=n1​∑i=1n​zi​ then has marginal law

zˉ∼N(0,(1+σ2n)Id).\bar z \sim \mathcal N\Big(0, \big(1 + \tfrac{\sigma^2}{n}\big) I_d\Big).zˉ∼N(0,(1+nσ2​)Id​).

Combined with μ′=nσ2+nzˉ\mu' = \frac{n}{\sigma^2+n}\bar zμ′=σ2+nn​zˉ, this converts the bound Ξ≥12 PM[∥μ′∥∞≤ε]\Xi \ge \frac12\,\mathbb P_{\mathcal M}[\|\mu'\|_\infty \le \varepsilon]Ξ≥21​PM​[∥μ′∥∞​≤ε] into a probability about a single standard Gaussian vector.

Formalization Note n≥1n \ge 1n≥1 is added because the mean of zero samples is undefined. The marginal M\mathcal MM of (z1,…,zn)(z_1,\dots,z_n)(z1​,…,zn​) is the one in the definitions file. The covariance (1+σ2/n)I(1+\sigma^2/n) I(1+σ2/n)I is encoded by the standard deviation 1+σ2/n\sqrt{1+\sigma^2/n}1+σ2/n​.

Preamble
import Mathlib
import Definitions.Def_RobustGeneralization_GaussLower_Model

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace RobustGeneralization.GaussLower

theorem zbar_marginal (d n : ℕ) (hn : 1 ≤ n) (σ : ℝ) (hσ : 0 < σ) :
    (sampleMarginal d n σ).map (fun z => ((n : ℝ)⁻¹) • ∑ i, z i) =
      gaussVec 0 (Real.sqrt (1 + σ ^ 2 / n)) := by sorry

end RobustGeneralization.GaussLower
Source
Schmidt, Santurkar, Tsipras, Talwar, Mądry, Adversarially Robust Generalization Requires More Data, arXiv:1804.11285v2, p. 30, §A.2, proof of Theorem 11, paragraph 'It remains to analyze the distribution of the vector z̄'
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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