Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A 1.312 logarithmic sieve lower bound at large scales, for every modulus

Proved
Helfgott.prime_sieve_large_scale_lower_1312

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

explicit-boundsgoldbachlarge-sieveminor-arcs

Define the coprime sieve sum by

Gq(R)=∑1≤n≤R(n,q)=1μ(n)2φ(n).G_q(R)=\sum_{\substack{1\le n\le R\\(n,q)=1}}\frac{\mu(n)^2}{\varphi(n)}.Gq​(R)=1≤n≤R(n,q)=1​∑​φ(n)μ(n)2​.

For every positive integer qqq and every real R≥125000000R\ge125000000R≥125000000, we have

log⁡R+1.312≤qφ(q)Gq(R).\log R+1.312\le\frac{q}{\varphi(q)}G_q(R).logR+1.312≤φ(q)q​Gq​(R).

The modulus is unrestricted. This sharpens the elementary logarithmic lower bound in the large-scale range. For q=1q=1q=1 it establishes the lower inequality from Helfgott's equation (5.15) on this range; the interval from 182 to 125000000 is not asserted here.

Preamble
import Definitions.Def_Helfgott_PrimeSieveData
import Mathlib.Analysis.SpecialFunctions.Log.Basic
open Helfgott
Formal statement
theorem Helfgott.prime_sieve_large_scale_lower_1312 (q : ℕ) (hq : 0 < q) (R : ℝ) (hR : 125000000 ≤ R) :
    Real.log R + (164/125 : ℝ) ≤
      ((q : ℝ)/(q.totient : ℝ)) * primeSieveG q R := by sorry
Source
H. A. Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 5.2, equations (5.11), (5.12), (5.14) and the lower half of (5.15). This formalization proves the range R >= 125000000, with the coprime-modulus consequence of (5.11); it does not claim the full source range R >= 182. https://arxiv.org/html/1312.7748v2

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