OctoInformBeta

OpenAI preprint, September 2026 · §3. Arithmetic, walks, and entropy

Dyadic batches of split primes: Primes p≡1(mod⁡4)p \equiv 1 \pmod 4 in [2j,2j+1)[2^j, 2^{j+1}) with chosen Gaussian factors; the mean L*L^* of log⁡p\log p over primes in [T,2T][T, 2T] lies in [log⁡T,log⁡2T][\log T, \log 2T]

Dyadic batches of split primes, many of them large.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

A rational prime p≡1(mod⁡4)p \equiv 1 \pmod 4 splits in ℤ[i]\mathbb{Z}[i] as p=πpπ‾pp = \pi_p\bar{\pi}_p, where πp\pi_p is a Gaussian prime of norm pp and π‾p\bar{\pi}_p is its conjugate. Split primes are grouped by size: 17=(4+i)(4−i)17 = (4+i)(4-i) and 29=(5+2i)(5−2i)29 = (5+2i)(5-2i), the primes p≡1(mod⁡4)p \equiv 1 \pmod 4 between 1616 and 3232, form one batch. Two numbers describe a batch: its size, and the mean L*L^* of log⁡p\log p over its primes. The questions are where L*L^* lies when all the primes lie in an interval [T,2T][T, 2T], and how often, for an integer j≥0j \ge 0, the batch between 2j2^j and 2j+12^{j+1} holds at least a fixed proportion of 2j/log⁡2j+12^j/\log 2^{j+1} primes.

The library defines the batches with their split factors and the mean L*L^*, and states an answer to each question.

Split Prime Sieves

A split prime sieve (𝒫,π)(\mathcal{P}, \pi) is a finite set 𝒫\mathcal{P} of rational primes p≡1(mod⁡4)p \equiv 1 \pmod 4 together with, for each p∈𝒫p \in \mathcal{P}, a Gaussian prime πp\pi_p of norm pp.✦

For each prime p≡1(mod⁡4)p \equiv 1 \pmod 4, the chosen split factor πp\pi_p of pp is a Gaussian prime of norm pp, one fixed choice among the Gaussian primes of norm pp.✦ The sieve of a finite set 𝒫\mathcal{P} of primes p≡1(mod⁡4)p \equiv 1 \pmod 4 is the split prime sieve (𝒫,π)(\mathcal{P}, \pi) whose set of primes is 𝒫\mathcal{P} and whose factor πp\pi_p at each p∈𝒫p \in \mathcal{P} is the chosen split factor of pp.✦

Let (𝒫,π)(\mathcal{P}, \pi) be a split prime sieve whose set 𝒫\mathcal{P} has k=|𝒫|k = |\mathcal{P}| primes p1,…,pkp_1, \dots, p_k in a fixed numbering. The mean logarithm L*(𝒫)L^*(\mathcal{P}) of the sieve is the real number L*(𝒫)=1k∑i=1klog⁡pi,L^*(\mathcal{P}) = \frac{1}{k}\sum_{i=1}^{k} \log p_i ,(1)✦

The Claim

Definition 1. For an integer j≥0j \ge 0, the dyadic batch of index jj is the set of primes 𝒟j={p prime:2j≤p<2j+1,p≡1(mod⁡4)},\mathcal{D}_j = \{\, p \text{ prime} : 2^j \le p < 2^{j+1},\ p \equiv 1 \pmod 4 \,\},(2)✦ and the dyadic sieve of index jj is the sieve of 𝒟j\mathcal{D}_j, 𝒮j=(𝒟j,(πp)p∈𝒟j).\mathcal{S}_j = \bigl(\mathcal{D}_j, (\pi_p)_{p \in \mathcal{D}_j}\bigr).(3)✦

Theorem 1. (a) Let (𝒫,π)(\mathcal{P}, \pi) be a split prime sieve with 𝒫\mathcal{P} nonempty, and let T>0T > 0 be a real number with T≤p≤2TT \le p \le 2T for every p∈𝒫p \in \mathcal{P}. Then log⁡T≤L*(𝒫)≤log⁡2T.\log T \le L^*(\mathcal{P}) \le \log 2T .(4)✦

(b) There are real numbers c>0c > 0 and δ>0\delta > 0 such that every sufficiently large real number XX satisfies #{j≥0:X≤jlog⁡2≤2120X,|𝒟j|≥δ2jlog⁡2j+1}≥cX.\#\Bigl\{\, j \ge 0 : X \le j\log 2 \le \tfrac{21}{20}X,\ |\mathcal{D}_j| \ge \delta\,\frac{2^j}{\log 2^{j+1}} \,\Bigr\} \ge cX .(5)✦

In the paper, the result reads: the batch is ℬT={p prime:T≤p≤2T,p≡1(mod⁡4)}\mathcal{B}_T = \{\, p \text{ prime} : T \le p \le 2T,\ p \equiv 1 \pmod 4 \,\}, with kT=|ℬT|k_T = |\mathcal{B}_T| and LT*L^*_T the mean of log⁡p\log p over ℬT\mathcal{B}_T, 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 πp\pi_p and the sieves they form, the dyadic batches 𝒟j\mathcal{D}_j and the mean logarithm (1).

The library proves that the sieve of every finite set of primes p≡1(mod⁡4)p \equiv 1 \pmod 4, the dyadic sieve 𝒮j\mathcal{S}_j among them, is a split prime sieve.