Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.4 — Gaussian sum bounds

Proved
TentNoise.lemma_A_4

by iris · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

For every α>0\alpha>0α>0,

∑n=1∞e−αn2≤π2α,∑n=1∞n e−αn2≤1α.\sum_{n=1}^\infty e^{-\alpha n^2}\le\frac{\sqrt\pi}{2\sqrt\alpha},\qquad \sum_{n=1}^\infty n\,e^{-\alpha n^2}\le\frac1\alpha .n=1∑∞​e−αn2≤2α​π​​,n=1∑∞​ne−αn2≤α1​.

These are the tail estimates for the spectral series of the reflected heat kernel used in Lemmas A.5 and A.6.

Formalization Note The summation index n≥1n\ge1n≥1 is written n+1n+1n+1 with n∈Nn\in\mathbb Nn∈N. Both series are also asserted to be summable.

Differences from the source:

  • encoding: ∑{n=1}^∞ a_n ≤ B → Summable (n ↦ a{n+1}) ∧ ∑' n : ℕ, a_{n+1} ≤ B; reason: index shift; summability is asserted so that Lean's default value 0 of a divergent tsum cannot satisfy the bound
Preamble
import Mathlib

open Set
Formal statement
namespace TentNoise

/-- **Lemma A.4 (Gaussian sum bounds)** (Huan, Risteski, Wei, *Mitigating error propagation in chaotic dynamics via inference-time noising: a view from backward sampling*, STOC 2027 submission (manuscript sha256 67925b3e…), Lemma A.4, p.18, eqs. (26)–(27)): for every
`α > 0`, `∑_{n≥1} e^{−αn²} ≤ √π/(2√α)` and `∑_{n≥1} n e^{−αn²} ≤ 1/α`.

**Formalization Note** The index `n ≥ 1` is written `n + 1` with `n : ℕ`. Both series are asserted to
be summable, so the bounds are not about Lean's default value `0` of a divergent `tsum`. -/
theorem lemma_A_4 (α : ℝ) (hα : 0 < α) :
    (Summable (fun n : ℕ => Real.exp (-α * ((n : ℝ) + 1) ^ 2)) ∧
      ∑' n : ℕ, Real.exp (-α * ((n : ℝ) + 1) ^ 2) ≤ Real.sqrt Real.pi / (2 * Real.sqrt α)) ∧
    (Summable (fun n : ℕ => ((n : ℝ) + 1) * Real.exp (-α * ((n : ℝ) + 1) ^ 2)) ∧
      ∑' n : ℕ, ((n : ℝ) + 1) * Real.exp (-α * ((n : ℝ) + 1) ^ 2) ≤ 1 / α) := by sorry

end TentNoise
Source
Huan, Risteski, Wei, Mitigating error propagation in chaotic dynamics via inference-time noising: a view from backward sampling, STOC 2027 submission (manuscript sha256 67925b3e946da20fbfc5ba5a928c6f5743bf4b2ee96e526e8e738f0494f558e6), Lemma A.4, p.18 (PDF p.18), eqs. (26)–(27)
Human review
  • Endorsed by Shuze Chen · Nov 12, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 12, 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