Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Separated prime factors give a product bound for the actual sieve sums

Proved
Helfgott.prime_sieve_separated_product_bound

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

goldbachlarge-sieveminor-arcsmultiplicative-functions

Let qqq be a positive integer and let R,S≥1R,S\ge1R,S≥1 be real. Define

Gq(T)=∑1≤n≤T(n,q)=1μ(n)2φ(n),P=∏p primep∣q or p≤Rp.G_q(T)=\sum_{\substack{1\le n\le T\\(n,q)=1}}\frac{\mu(n)^2}{\varphi(n)},\qquad P=\prod_{\substack{p\text{ prime}\\p\mid q\ \text{or}\ p\le R}}p.Gq​(T)=1≤n≤T(n,q)=1​∑​φ(n)μ(n)2​,P=p primep∣q or p≤R​∏​p.

Each prime appears just once in PPP, and an empty product is 111. Then

Gq(R)GP(S)≤Gq(RS),Gq(R)Gq(RS)≤1GP(S).G_q(R)G_P(S)\le G_q(RS),\qquad \frac{G_q(R)}{G_q(RS)}\le\frac1{G_P(S)}.Gq​(R)GP​(S)≤Gq​(RS),Gq​(RS)Gq​(R)​≤GP​(S)1​.

All denominators in the second inequality are positive. Taking R=Q0/(sq)R=Q_0/(sq)R=Q0​/(sq) and S=Q/Q0S=Q/Q_0S=Q/Q0​ gives equation (5.19) in Helfgott's sieve argument. This reduction is useful when the numerator's range is small, where asymptotic estimates for it are relatively weak. It leaves the subsequent quantitative lower bound for GP(S)G_P(S)GP​(S) as a separate step.

Preamble
import Definitions.Def_Helfgott_PrimeSieveData
open Helfgott Finset
open scoped BigOperators Classical
Formal statement
theorem Helfgott.prime_sieve_separated_product_bound (q : ℕ) (hq : 0 < q) (R S : ℝ) (hR : 1 ≤ R) (hS : 1 ≤ S) :
    let P := ∏ p ∈ q.primeFactors ∪ ((range (⌊R⌋₊ + 1)).filter Nat.Prime), p
    primeSieveG q R * primeSieveG P S ≤ primeSieveG q (R * S) ∧
      primeSieveG q R / primeSieveG q (R * S) ≤ 1 / primeSieveG P S := by sorry
Source
H. A. Helfgott, The ternary Goldbach conjecture is true, arXiv:1312.7748v2, Section 5.2, proof of Lemma 5.4: the product inequality immediately before equation (5.19), and (5.19) itself. https://arxiv.org/html/1312.7748v2 . The real scales R and S are kept independent; their source specialization is also checked locally.

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