Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Explicit Gaussian logarithmic-moment bounds for minor arcs

Proved
Helfgott.gaussian_log_moment_explicit_bound

by flyingviper · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

explicit-boundsgaussiangoldbachintegrationminor-arcs

Let 0≤a≤10\le a\le10≤a≤1 and put

I(a)=∫a1t2e−t2/2(−log⁡t) dt.I(a)=\int_a^1 t^2e^{-t^2/2}(-\log t)\,dt.I(a)=∫a1​t2e−t2/2(−logt)dt.

Then

I(a)≤0.093426,I(a)π/2≤0.07455.I(a)\le0.093426,\qquad \frac{I(a)}{\sqrt{\pi/2}}\le0.07455.I(a)≤0.093426,π/2​I(a)​≤0.07455.

The integral is finite at a=0a=0a=0, because t2log⁡tt^2\log tt2logt extends continuously to zero. Both endpoints a=0a=0a=0 and a=1a=1a=1 are included.

For Helfgott's smoothing φ(t)=t2e−t2/2\varphi(t)=t^2e^{-t^2/2}φ(t)=t2e−t2/2 and K>1K>1K>1, the choice a=1/Ka=1/Ka=1/K supplies the logarithmic moment Cφ,2,KC_{\varphi,2,K}Cφ,2,K​. The normalized inequality, divided by the positive number log⁡K\log KlogK, is the numerical input in equation (7.31) of the minor-arc argument. This result does not assert the remaining pointwise, sieve, or total minor-arc estimates.

Preamble
import Mathlib.Analysis.SpecialFunctions.Integrals.Basic
import Mathlib.Analysis.SpecialFunctions.Log.NegMulLog
import Mathlib.Analysis.Real.Pi.Bounds
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.NormNum

open MeasureTheory Finset
open scoped BigOperators
Formal statement
theorem Helfgott.gaussian_log_moment_explicit_bound (a : ℝ) (ha0 : 0 ≤ a) (ha1 : a ≤ 1) :
    (∫ t in a..1, t ^ 2 * Real.exp (-(t ^ 2) / 2) * (-Real.log t)) ≤
      (46713 / 500000 : ℝ) ∧
    (∫ t in a..1, t ^ 2 * Real.exp (-(t ^ 2) / 2) * (-Real.log t)) /
      Real.sqrt (Real.pi / 2) ≤ (1491 / 20000 : ℝ) := by sorry
Source
H. A. Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 7.3, the displayed bound C_{phi,2,K} <= 0.093426 immediately preceding equation (7.31), and equation (7.31) itself. https://arxiv.org/html/1312.7748v2 . The formalization proves the published upper bounds uniformly for every lower integration endpoint in [0,1].

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