Separated prime factors give a product bound for the actual sieve sums
ProvedHelfgott.prime_sieve_separated_product_boundgoldbachlarge-sieveminor-arcsmultiplicative-functions
Let be a positive integer and let be real. Define
Each prime appears just once in , and an empty product is . Then
All denominators in the second inequality are positive. Taking and 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 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 sorrySource
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.