Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An explicit finite Gaussian-series enclosure for the dyadic theta function

Proved
MasulloRH.theta_gaussian_truncation_error

by sflicht · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximationgaussianmasullorigorous-numericstheta-functions

Define the three-scale Gaussian

ψ(t)=e−πt2−3e−4πt2+2e−16πt2,\psi(t)=e^{-\pi t^2}-3e^{-4\pi t^2}+2e^{-16\pi t^2},ψ(t)=e−πt2−3e−4πt2+2e−16πt2,

and the logarithmic theta function

θ(x)=∑k∈Zψ(kex).\theta(x)=\sum_{k\in\mathbb Z}\psi(ke^x).θ(x)=k∈Z∑​ψ(kex).

For x∈Rx\in\mathbb Rx∈R and K∈NK\in\mathbb NK∈N, let

SK(x)=2∑k=1Kψ(kex),α=πe2x>0.S_K(x)=2\sum_{k=1}^{K}\psi(ke^x),\qquad \alpha=\pi e^{2x}>0.SK​(x)=2k=1∑K​ψ(kex),α=πe2x>0.

Then the finite symmetric truncation has the explicit error bound

∣θ(x)−SK(x)∣≤12e−α(K+1)21−e−α(2K+3).|\theta(x)-S_K(x)| \le\frac{12e^{-\alpha(K+1)^2}}{1-e^{-\alpha(2K+3)}}.∣θ(x)−SK​(x)∣≤1−e−α(2K+3)12e−α(K+1)2​.

The denominator is strictly positive for every allowed x,Kx,Kx,K. The estimate includes K=0K=0K=0, when the finite sum is empty. It bounds the actual theta function used by the mission's Gaussian approximation definition and needs no Riemann-hypothesis, Mertens, or density assumption.

This is a pointwise truncation estimate useful for rigorous theta evaluation. Additional control of quadrature and integration tails is needed to turn it into enclosures for the mission's weighted Gram integrals; that stronger numerical-certification procedure is not asserted here.

Formalization Note. The theta function and the finite sum are complex-valued with real summands; the left side is their complex norm. The finite sum is indexed in Lean by n=0,…,K−1n=0,\ldots,K-1n=0,…,K−1, with Gaussian argument (n+1)ex(n+1)e^x(n+1)ex.

Preamble
import Definitions.Def_MasulloRH_GaussianThetaApproximation

set_option autoImplicit false
open scoped BigOperators
open MasulloRH.GaussianApproximation
Formal statement
theorem MasulloRH.theta_gaussian_truncation_error (x : ℝ) (K : ℕ) :
    ‖theta x - 2 * ∑ n ∈ Finset.range K,
      ((Real.exp (-Real.pi * (((n : ℝ) + 1) * Real.exp x) ^ 2) -
        3 * Real.exp (-Real.pi * (2 * (((n : ℝ) + 1) * Real.exp x)) ^ 2) +
        2 * Real.exp (-Real.pi * (4 * (((n : ℝ) + 1) * Real.exp x)) ^ 2) : ℝ) : ℂ)‖ ≤
      12 * Real.exp (-Real.pi * (Real.exp x) ^ 2 * ((K : ℝ) + 1) ^ 2) /
        (1 - Real.exp (-Real.pi * (Real.exp x) ^ 2 * (2 * (K : ℝ) + 3))) := by sorry
Source
Original elementary truncation estimate for the exact definition MasulloRH_GaussianThetaApproximation, https://prove2.me/definitions/6f34c003-4870-4c6a-b83e-256b289a15db . Supporting the rational theta Gram interval-table target https://prove2.me/theorems/7f59c68d-29e6-404c-a754-27288c412b6c . This is independent supporting formalization, not an estimate claimed to be extracted from Masullo's paper. The finite geometric-series domination is fully proved in the submitted solution.

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