The Setting
Let be a walk in with steps at most , a sequence of Gaussian integers with for every . Watch it at a random time and again at a random later time, at most steps on. How much entropy can the displacement between the two positions carry, in terms of and alone? And given Gaussian primes of norm for finitely many primes , by how much can the entropy of the residues of the position modulo or fall across such a displacement?
The library answers the first question with explicit constants, from a fixed start and from a random one, and the second for the residue entropy averaged over the choice of or and over the order of the primes. It also bounds the number of Gaussian integers in a disc and the entropy of a Gaussian integer confined to one.
Lattice Balls, Laws and Random Lags
For a real number , the lattice ball of radius is the finite set of Gaussian integers with ; the ball has elements.✦
A finite probability law on a finite set is a function that is nonnegative at every point and sums to over .✦ A random variable on the finite probability space is a function from to a set, and its entropy, in natural logarithms, is the Shannon entropy of its law, (1)✦ the sum running over the finitely many values that takes.
Given a finite probability law on a finite set and, for each , a finite probability law on a finite set , the joint law is the finite probability law on with (2)✦
A time law is a natural number , its last time, together with a finite probability law on , the law of a random time .✦ A forward kernel of bound is a family of finite probability laws on , one for each : is the law of the lag by which the walk moves on from time .✦
Residues and Their Entropy
A split prime sieve is a finite set of rational primes together with, for each , a Gaussian prime of norm .✦ Its primes are numbered once and for all as , where .✦
For a Gaussian integer and a sign , the signed factor is itself when and its conjugate when .✦ The multiples of form the sublattice of spanned over by and .✦ The residue of modulo is its class in the quotient by this sublattice✦; denotes this class.
For signs , the residue vector of is , with entries (3)✦
Let be a random vector on , a permutation of and . The prefix of of length in the order is the random vector whose entry of index is for and a fixed constant value for , so that only the first entries carry information.✦ The random-order prefix entropy of at is the mean of the entropy of this prefix over the permutations .✦ For a random vector that depends on signs , the sign-averaged entropy at is the mean of its random-order prefix entropy over the choices of .✦
For a split prime sieve and a random variable on with values in , the averaged signed residue entropy is the sign-averaged entropy of the residue vectors at : (4)✦
The Claim
Theorem 1. For every real , the lattice ball of radius satisfies (5)✦ and every random variable with values in on a finite probability space, with at every point, satisfies (6)✦ Let be real, let be a walk in with steps at most , and let be a forward kernel of bound . For every time , with the lag drawn from , (7)✦ and for every time law , under the joint law of a time drawn from and a lag drawn from , (8)✦ For every split prime sieve, all random variables and with values in on one finite probability space, and every , (9)✦
In the paper, the result reads: if and are jointly distributed finite random times with almost surely, then , also conditionally, and for every finite vector of residue maps.
In the box, is and is , so that , and the vectors are the prefixes of the residue vectors , with and in place of and and the entropies averaged into .
What Is Checked
The claim is stated over the lattice balls , finite probability laws and the entropy (1), walks in with steps at most , forward kernels, time laws and the joint law (2), and split prime sieves, with the residues modulo their signed factors and the averaged signed residue entropy (4).
The library shows that the joint law (2) is again a finite probability law, and that is a -linear isomorphism of onto ✦, with and the corresponding basis of over .✦