The Setting
Let be a self-avoiding walk in with steps at most , and let be a batch of primes , all in an interval . Start at a time , move forward a random number of steps drawn by a fixed sampling schedule, and reduce the displacement modulo a signed prime, or its conjugate , where is a Gaussian prime of norm for . The residue ring has classes, and a class is low when the terminal residue falls in it with probability below , for a floor such as . The item shows that, from every start , all but a share of the signed primes have few low classes, through a certificate built from lower bounds on the entropy of the terminal residues.
A split prime sieve is a finite set of rational primes together with, for each , a Gaussian prime of norm .✦ The mean log of a split prime sieve with primes, listed in a fixed enumeration , is the average of over them: (1)✦
A signed index of is a pair of a sign vector and a position .✦ Its prime is ✦, and its signed factor is when and the conjugate when .✦ The residue ring at is the quotient of by the multiples of , its products with Gaussian integers✦, and the residue map sends a Gaussian integer to its class there.✦
Laws and Entropy
A finite probability law on a finite set is a function with nonnegative values that sum to one.✦ The uniform law gives each point of the mass ✦, and the probability of an event is the total mass of the outcomes at which it holds.✦ The pushforward of a law on along a map from is the law that gives each point the mass of its preimage under .✦ Given a law on and a law on for each , the joint law on gives the mass .✦ The entropy of a random variable on is the Shannon entropy of its law.✦
For a random point of on and a sign vector , the residue vector of has the entries , , where is the class of modulo when and modulo when .✦ The point entropy of at is the sign-averaged entropy of the residue vector: the mean, over the sign vectors , of its random-order prefix entropy, which is the mean, over the orderings of the positions, of the entropy of the prefix revealing its first entries in the order (all of them when ): (2)✦
Sampling Schedules
A forward kernel consists of a bound and, for every time , a finite probability law on the advances .✦ For forward kernels and , the composed kernel is the forward kernel that runs and then : its bound is , and its law at is the pushforward, under the sum of offsets , of the joint law that draws from and then from , (3)✦
The smoothing kernel has bound and, at every time, the uniform law on .✦ The difference kernel of the walk has bound . At a time it looks at the walk segment and its difference set , with a pair of times in chosen once for each so that . The difference pair law draws uniformly and returns ✦; the difference kernel tosses a fair coin besides and returns on heads and on tails: (4)✦
For a sequence of phase lengths and a smoothing length , the common sampling schedule runs the difference kernels with these lengths in order and ends with the smoothing kernel: (5)✦ We write for the sequence followed by , and for the sum of the entries of .
For a forward kernel , a sequence of Gaussian integers, a time and a signed index , the relative residue law is the law on of the class of when is drawn from . With drawn from in the same way, is the point entropy at of . For the schedule , the terminal residue law at a time and a signed index is the relative residue law .
The low residues of a finite probability law on a finite set at a floor form the set (6)✦ and on , a group of elements, the bound is .
For a forward kernel , a time , a floor and thresholds at the signed indices, the bad share is the share of signed indices with at least low residues: (7) with drawn from the uniform law on the signed indices.
Entropy Bands
For a ratio , an initial scale and an index , the band scale, the band length and the band size are (8) The lattice ball of radius is the set of the Gaussian integers with .✦
An entropy band for , a step bound , a sequence of phase lengths, a smoothing length , a number of primes and a deficit consists of a ratio with , an initial scale , a number of bands and a cost rate such that, for some sequences and , the sequence is , then , then , with , (9) and (10)✦
Coverage Derivations
A coverage derivation for , a step bound and a smoothing length is a relation between a sequence of phase lengths, a floor , thresholds at the signed indices and a rate , defined inductively by a base rule and a step rule.
By the base rule, holds when, for some with , some and some , there is an entropy band for with smoothing length , primes and deficit , and (11)✦
By the step rule, holds when there are an integer with , an integer , reals and thresholds , such that holds, there is an entropy band for with smoothing length , primes and deficit , and they satisfy (12) and, at every signed index , (13)
The coverage repetition count of a real number is .✦
The Claim
Theorem 1. Let be a split prime sieve, a real number and a natural number, with taken for , and . Parts (i) to (iii) assume that is nonempty with its primes in for some , that , and that is a self-avoiding walk in with steps at most .
(i) If holds, then for every start (14)✦
(ii) If there is an entropy band for with smoothing length , primes and deficit , then at every time (15)✦
(iii) If , , , and sequences , satisfy (9), then for the sequence made of , then , then , at every time (16)✦
(iv) Let be a forward kernel, nonempty, any sequence of Gaussian integers and a time. If , , , at every signed index , and , then (17)✦
(v) Suppose there are an entropy band for with smoothing length , primes and deficit and one for with smoothing length , primes and deficit , where , and , and let be an integer. If every signed index has and , and (18) then (19)✦
(vi) Suppose there are an entropy band for with smoothing length , primes and deficit and one for with smoothing length , primes and the same deficit , that and , and that with at every signed index . If (20) then (21)✦
In the paper, the result reads: for all sufficiently large , uniformly over the batches, over and over all exact start times at , all but a fraction at most of the signed primes satisfy , where is the terminal residue law modulo from the start .
The box counts the low residues against a threshold in place of , and (19) and (21) give the floor with the rate .
What Is Checked
The claims are stated over a split prime sieve with its signed indices, residue rings and mean log ; over a sequence of Gaussian integers, a self-avoiding walk with steps at most in (14), (15) and (16); and over forward kernels, the common sampling schedule (5), the relative residue laws and their low residues, the point entropy (2), entropy bands and coverage derivations.
Beyond the claims, the library proves that a nonempty sieve has a signed index✦, and that every element of the difference set of a walk segment is for some times .✦