Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.4.11 — comparing Gaussian tails

Proved
SmoothedSimplex.Shadow.comparing_gaussian_tails

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

gaussianp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1probabilitysmoothed-analysis

Let 0<σ≤10<\sigma\le10<σ≤1 and let μ(t)=12π σe−t2/2σ2\mu(t)=\frac{1}{\sqrt{2\pi}\,\sigma}e^{-t^2/2\sigma^2}μ(t)=2π​σ1​e−t2/2σ2 be the density of the centered normal distribution with variance σ2\sigma^2σ2. Then for x≤2x\le 2x≤2 and ∣x−y∣≤ε|x-y|\le\varepsilon∣x−y∣≤ε,

∫t=y∞μ(t) dt∫t=x∞μ(t) dt ≥ 1−8ε3σ2.(6)\frac{\int_{t=y}^{\infty}\mu(t)\,dt}{\int_{t=x}^{\infty}\mu(t)\,dt}\ \ge\ 1-\frac{8\varepsilon}{3\sigma^{2}}. \tag{6}∫t=x∞​μ(t)dt∫t=y∞​μ(t)dt​ ≥ 1−3σ28ε​.(6)

Moving the threshold of a Gaussian tail by ε\varepsilonε changes its mass by a relative factor of order ε/σ2\varepsilon/\sigma^2ε/σ2, as long as the threshold is not far out in the tail; Lemma 4.2.3 applies this to halfspace probabilities.

Formalization Note The tail integrals are the masses of [x,∞)[x,\infty)[x,∞) and [y,∞)[y,\infty)[y,∞) under gaussianReal 0 σ²; the ratio is cross-multiplied (the denominator is positive).

Preamble
import Mathlib
Formal statement
namespace SmoothedSimplex.Shadow

open MeasureTheory ProbabilityTheory
open scoped RealInnerProductSpace

/-- **Lemma 2.4.11 (Comparing Gaussian tails)** (Spielman & Teng, arXiv:cs/0111050v7,
Lemma 2.4.11, printed p. 23, PDF p. 23). Let `σ ≤ 1` and let `µ(t) = (1/(√(2π)σ)) e^{−t²/2σ²}`.
Then, for `x ≤ 2` and `|x − y| ≤ ε`,
`∫_{t=y}^∞ µ(t) dt / ∫_{t=x}^∞ µ(t) dt ≥ 1 − 8ε/(3σ²)`.

**Formalization Note.** `σ > 0`. `µ` is the density of `gaussianReal 0 σ²`, so
`∫_{t=y}^∞ µ(t) dt = gaussianReal 0 σ² [y, ∞)`. The ratio is cross-multiplied (the denominator is
positive, so this is equivalent). -/
theorem comparing_gaussian_tails (σ : ℝ) (hσ : 0 < σ) (hσ1 : σ ≤ 1) (x y ε : ℝ)
    (hx : x ≤ 2) (hxy : |x - y| ≤ ε) :
    (1 - 8 * ε / (3 * σ ^ 2)) * (gaussianReal 0 (σ ^ 2).toNNReal (Set.Ici x)).toReal ≤
      (gaussianReal 0 (σ ^ 2).toNNReal (Set.Ici y)).toReal := by sorry

end SmoothedSimplex.Shadow
Source
Spielman & Teng, Smoothed Analysis of Algorithms, arXiv:cs/0111050v7, Lemma 2.4.11, eq. (6), printed p. 23 (PDF p. 23)
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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