The Setting
A rational prime splits in as , where is a Gaussian prime of norm and is its conjugate. Split primes are grouped by size: and , the primes between and , form one batch. Two numbers describe a batch: its size, and the mean of over its primes. The questions are where lies when all the primes lie in an interval , and how often, for an integer , the batch between and holds at least a fixed proportion of primes.
The library defines the batches with their split factors and the mean , and states an answer to each question.
Split Prime Sieves
A split prime sieve is a finite set of rational primes together with, for each , a Gaussian prime of norm .✦
For each prime , the chosen split factor of is a Gaussian prime of norm , one fixed choice among the Gaussian primes of norm .✦ The sieve of a finite set of primes is the split prime sieve whose set of primes is and whose factor at each is the chosen split factor of .✦
Let be a split prime sieve whose set has primes in a fixed numbering. The mean logarithm of the sieve is the real number (1)✦
The Claim
Definition 1. For an integer , the dyadic batch of index is the set of primes (2)✦ and the dyadic sieve of index is the sieve of , (3)✦
Theorem 1. (a) Let be a split prime sieve with nonempty, and let be a real number with for every . Then (4)✦
(b) There are real numbers and such that every sufficiently large real number satisfies (5)✦
In the paper, the result reads: the batch is , with and the mean of over , and the batches are controlled by the prime number theorem in arithmetic progressions, the paper’s (3.1).
What Is Checked
The claims are stated over split prime sieves, the chosen split factors and the sieves they form, the dyadic batches and the mean logarithm (1).
The library proves that the sieve of every finite set of primes , the dyadic sieve among them, is a split prime sieve.