Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Claim 2.2, p. 34:16 — |e^{−π(1−1/(1+ϵ)²)x²} − 1| ≤ π(1 − 1/(1+ϵ)²)x² ≤ 2πϵx²

Proved
RegevLWE.PeriodicGauss.pointwise_bound

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

gaussianinequalitylearning-with-errorsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

For every ϵ≥0\epsilon \ge 0ϵ≥0 and every real xxx,

∣e−π(1−1/(1+ϵ)2)x2−1∣≤π(1−1/(1+ϵ)2)x2≤2πϵx2.\bigl|e^{-\pi(1-1/(1+\epsilon)^2)x^2} - 1\bigr| \le \pi\bigl(1 - 1/(1+\epsilon)^2\bigr)x^2 \le 2\pi\epsilon x^2.​e−π(1−1/(1+ϵ)2)x2−1​≤π(1−1/(1+ϵ)2)x2≤2πϵx2.

The paper derives this from 1−z≤e−z≤11 - z \le e^{-z} \le 11−z≤e−z≤1 for z≥0z \ge 0z≥0.

It turns the integral left over by the first display into a second moment of a Gaussian.

Formalization Note The paper uses the bound for 0<ϵ≤10 < \epsilon \le 10<ϵ≤1; it holds, and is stated, for every ϵ≥0\epsilon \ge 0ϵ≥0.

Preamble
import Mathlib
import Definitions.Def_RegevLWE_PeriodicGauss_Gaussian

open MeasureTheory
Formal statement
namespace RegevLWE.PeriodicGauss

/-- Proof of Claim 2.2, p. 34:16: since `1 - z ≤ e^{-z} ≤ 1` for all `z ≥ 0`,
`|e^{-π(1-1/(1+ϵ)²)x²} - 1| ≤ π(1 - 1/(1+ϵ)²)x² ≤ 2πϵx²` (here for every `ϵ ≥ 0` and real `x`). -/
theorem pointwise_bound (ϵ : ℝ) (hϵ : 0 ≤ ϵ) (x : ℝ) :
    |Real.exp (-Real.pi * (1 - 1 / (1 + ϵ) ^ 2) * x ^ 2) - 1| ≤
        Real.pi * (1 - 1 / (1 + ϵ) ^ 2) * x ^ 2 ∧
      Real.pi * (1 - 1 / (1 + ϵ) ^ 2) * x ^ 2 ≤ 2 * Real.pi * ϵ * x ^ 2 := by sorry

end RegevLWE.PeriodicGauss
Source
Regev, On Lattices, Learning with Errors, Random Linear Codes, and Cryptography, J. ACM 56(6) (2009), Article 34, p. 34:16, proof of Claim 2.2, display after "since 1 − z ≤ e^{−z} ≤ 1 for all z ≥ 0"
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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