A prime-supported smoothed rational bilinear bound with an explicit sieve gain
ProvedHelfgott.prime_rational_smooth_bilinear_boundbilinear-sumsexplicit-boundsexponential-sumsgoldbachselberg-sieve
Let be natural numbers with , , , and , and let . Put and . For arbitrary complex coefficients ,
Here and for , and zero otherwise. This is an unconditional prime-supported estimate at exact rational phases, with the sieve error displayed.
Preamble
import Definitions.Def_Helfgott_Smoothings import Mathlib.Analysis.Fourier.AddCircle import Mathlib.Data.Nat.Totient open Finset Helfgott open scoped BigOperators
Formal statement
theorem Helfgott.prime_rational_smooth_bilinear_bound (N q a U C D : ℕ) (hq : 0<q) (hU : 2≤U)
(hC : 0<C) (ha : Nat.Coprime a q) (y : ℝ) (hy : 0<y) (b v : ℕ → ℂ) :
‖∑ p ∈ (range N).filter (fun p => p.Prime ∧ U<p), ∑ m ∈ Ico C D,
v p*b m*fourier ((p*m:ℕ):ℤ) (((a:ℝ)/(q:ℝ)):AddCircle (1:ℝ))*
(etaTwo (((p*m:ℕ):ℝ)/y):ℂ)‖^2 ≤
16*(Real.log 2)^2*(q:ℝ)*(((D-C)/q+1:ℕ):ℝ)*
((N:ℝ)/((Nat.totient q:ℝ)*Real.log (U:ℝ))+(U:ℝ)^4)*
(∑ p ∈ (range N).filter (fun p => p.Prime ∧ U<p), ‖v p‖^2)*
(∑ m ∈ Ico C D, ‖b m‖^2) := by sorrySource
Classical Selberg sieve, finite Fourier orthogonality and the interval-overlap factorization of the triangular logarithmic smoothing. Retained arithmetic and normalizer proofs carry attribution to raresbuhai (Apache 2.0), submissions 270f0aa4-1a5a-4d37-aad1-43522eb8dc16, 4b19f26e-e6f8-4a14-8cf6-e0ea33b44440 and dc167013-7b1b-47a5-bd68-36e63ad77223. Explicit prime progression sieve, Fourier energy, multiplicity and smoothing transfer formalized by Codex.