Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A, equation A2: squared-Gaussian tail bounds

Open
QAlgorithms.Papers.Independent.Intakenext100.P54.squared_gaussian_tails

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let N≥1N\ge1N≥1, σ2>0\sigma^2>0σ2>0, and let Y1,…,YNY_1,\ldots,Y_NY1​,…,YN​ be independent measurable N(0,σ2)N(0,\sigma^2)N(0,σ2) variables. Write Xi=Yi2X_i=Y_i^2Xi​=Yi2​. For every ε≥0\varepsilon\ge0ε≥0,

Pr⁡{1N∑iXi>(1+ε)σ2}≤2−N(ε−ln⁡(1+ε))/(2ln⁡2).\Pr\left\{\frac1N\sum_iX_i>(1+\varepsilon)\sigma^2\right\}\le2^{-N(\varepsilon-\ln(1+\varepsilon))/(2\ln2)}.Pr{N1​i∑​Xi​>(1+ε)σ2}≤2−N(ε−ln(1+ε))/(2ln2).

For 0≤ε<10\le\varepsilon<10≤ε<1 one also has

Pr⁡{1N∑iXi<(1−ε)σ2}≤2−N(−ε−ln⁡(1−ε))/(2ln⁡2).\Pr\left\{\frac1N\sum_iX_i<(1-\varepsilon)\sigma^2\right\}\le2^{-N(-\varepsilon-\ln(1-\varepsilon))/(2\ln2)}.Pr{N1​i∑​Xi​<(1−ε)σ2}≤2−N(−ε−ln(1−ε))/(2ln2).

For ε≥1\varepsilon\ge1ε≥1 the strict lower-tail event has probability zero. This records both displayed consequences of Lemma 23 while giving the lower logarithm its correct domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder NNReal ENNReal

open MeasureTheory ProbabilityTheory

namespace QAlgorithms.Papers.Independent.Intakenext100.P54

open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)

open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)

open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)

open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)

open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)

/-- Equation A2, PDF p.14: both squared-Gaussian tails. The lower displayed logarithmic
bound has domain eps < 1; for eps ≥ 1 the strict lower-tail event is empty.
The paper's exp is base two. -/
theorem squared_gaussian_tails {Omega : Type*} [MeasurableSpace Omega]
    (mu : Measure Omega) [IsProbabilityMeasure mu] (N : ℕ) (hN : 0 < N)
    (s2 : ℝ≥0) (hs : 0 < s2) (Y : Fin N → Omega → ℝ)
    (hMeas : ∀ i, Measurable (Y i)) (hInd : iIndepFun Y mu)
    (hLaw : ∀ i, Measure.map (Y i) mu = gaussianReal 0 s2)
    (eps : ℝ) (heps : 0 ≤ eps) :
    mu {w | (∑ i, Y i w ^ 2) / (N : ℝ) > (1 + eps) * s2} ≤
      ENNReal.ofReal ((2 : ℝ) ^ (-(N : ℝ) * (eps - Real.log (1 + eps)) / (2 * Real.log 2))) ∧
    (eps < 1 → mu {w | (∑ i, Y i w ^ 2) / (N : ℝ) < (1 - eps) * s2} ≤
      ENNReal.ofReal ((2 : ℝ) ^ (-(N : ℝ) * (-eps - Real.log (1 - eps)) / (2 * Real.log 2)))) ∧
    (1 ≤ eps → mu {w | (∑ i, Y i w ^ 2) / (N : ℝ) < (1 - eps) * s2} = 0) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P54

end
Source
Remote preparation of quantum states, arXiv:quant-ph/0307100v3, PDF p. 14, Appendix A, equation A2: squared-Gaussian tail bounds
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let Ω\OmegaΩ be any measurable space with probability measure μ\muμ, let NNN be a positive natural number, let v=s2>0v=s2>0v=s2>0, and let Yi:Ω→RY_i:\Omega\to\mathbb RYi​:Ω→R for 0≤i<N0\le i<N0≤i<N be measurable, jointly independent functions, each with Gaussian law of mean 000 and variance vvv. For every real ε≥0\varepsilon\ge0ε≥0, writing Z(ω)=N−1∑i=0N−1Yi(ω)2Z(\omega)=N^{-1}\sum_{i=0}^{N-1}Y_i(\omega)^2Z(ω)=N−1∑i=0N−1​Yi​(ω)2, all of the following hold:

μ{Z>(1+ε)v}≤2−N(ε−ln⁡(1+ε))/(2ln⁡2);ε<1 ⟹ μ{Z<(1−ε)v}≤2−N(−ε−ln⁡(1−ε))/(2ln⁡2);ε≥1 ⟹ μ{Z<(1−ε)v}=0.\mu\{Z>(1+\varepsilon)v\} \le 2^{-N(\varepsilon-\ln(1+\varepsilon))/(2\ln2)}; \qquad \varepsilon<1\ \Longrightarrow\ \mu\{Z<(1-\varepsilon)v\} \le 2^{-N(-\varepsilon-\ln(1-\varepsilon))/(2\ln2)}; \qquad \varepsilon\ge1\ \Longrightarrow\ \mu\{Z<(1-\varepsilon)v\}=0.μ{Z>(1+ε)v}≤2−N(ε−ln(1+ε))/(2ln2);ε<1 ⟹ μ{Z<(1−ε)v}≤2−N(−ε−ln(1−ε))/(2ln2);ε≥1 ⟹ μ{Z<(1−ε)v}=0.

The finite real bounds on the right are interpreted as extended nonnegative real numbers. Both tail events use strict inequalities, including at ε=0\varepsilon=0ε=0; for ε≥1\varepsilon\ge1ε≥1, the lower-tail threshold is nonpositive.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me