math.NT — Number Theory
Hooley's twisted cancellation below level does not force primes
We work in Ford and Maynard's framework for sieve problems with Type I and Type II information. To Type I information at level and Type II information for factors up to , we add Hooley's condition: the parity bias of the sequence in arithmetic progressions is small on average over moduli up to . We construct prime-free sequences that satisfy all three for every Type II range and every twisted level , and strictly below each of four further corners of a staircase in the -plane, from to , that is, for every and every . The constructions add to Ford and Maynard's continuum model one function of the total size of the small prime factors for each number of them; these functions solve the twisted conditions exactly. Each case rests on a computer-assisted certificate in exact or directed-rounding integer arithmetic. Independent audits read the certificates' code for every case except and , whose certificates had an independent review of their formulas and inputs but not of their code. The cases , and each rest on a single implementation. Conversely, the term of Hooley's condition, global parity balance, already forces a positive proportion of primes once . For we exhibit twisted rows that the added functions cannot enter, and we conjecture, on floating-point evidence, that constructions of exactly this form cannot pass (Conjecture 8.2). We also record what the constructions imply for sieve approaches to Goldbach's problem.