An unconditional explicit Selberg bound for primes in an arithmetic progression
ProvedHelfgott.prime_progression_log_sievearithmetic-progressionsexplicit-boundsgoldbachprime-numbersselberg-sieve
For natural numbers with and ,
The estimate is uniform in the residue class, with no unproved distribution hypothesis. The conservative error term is explicit.
Preamble
import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Data.Nat.Totient import Mathlib.Algebra.BigOperators.Group.Finset.Defs open Finset
Formal statement
theorem Helfgott.prime_progression_log_sieve (N q a U : ℕ) (hq : 0 < q) (hU : 2 ≤ U) :
(((range N).filter (fun n => n.Prime ∧ U < n ∧ n%q=a%q)).card:ℝ) ≤
(N:ℝ)/((Nat.totient q:ℝ)*Real.log (U:ℝ))+(U:ℝ)^4 := by sorrySource
Classical finite Selberg sieve and the Chinese remainder theorem. Radical-fibre harmonic comparison and modulus normalizer comparison retain attribution to raresbuhai, accepted submission 270f0aa4-1a5a-4d37-aad1-43522eb8dc16. Finite hyperbola and divisor energy identities retain attribution to raresbuhai submissions 4b19f26e-e6f8-4a14-8cf6-e0ea33b44440 and dc167013-7b1b-47a5-bd68-36e63ad77223 (Apache 2.0). Explicit optimized weights, inversion, supported error bound and progression theorem formalized by Codex.