The Setting
Let be a random point of and a finite set of Gaussian integers. The residues of modulo the elements of form a random vector. The question is how much information this vector can carry: how large its Shannon entropy can be, given the norms of the moduli.
Residues and Their Codes
The Gaussian integers form a lattice with basis .✦ For a Gaussian integer , the set of multiples of is a subgroup of .✦ The residue class of a Gaussian integer modulo is its coset in the quotient group .✦
The residue code of a Gaussian integer modulo is the natural number that labels the residue class of modulo in a fixed numbering of the classes of modulo .✦
Entropy of Residue Vectors
A finite probability law on a finite set assigns to each point of a mass , the masses summing to over .✦ The entropy of a random variable on , with values in any set, is the Shannon entropy of its law under , (1)✦ The sum runs over the finitely many values that takes, and is the natural logarithm.
For a random variable on with values in and a finite set of Gaussian integers, the residue vector of modulo is the random variable on whose value at is the vector of residue codes.
The residue weight of a finite set of Gaussian integers is the sum of the natural logarithms of the norms of its elements: (2)✦
The Claim
In the library, two residue vectors arise from a walk , both taken at , its point at the terminal time of the common schedule, difference transitions followed by a uniform offset. The first holds the residues of modulo the selected factors of the batch of index , Gaussian primes or of norm for the primes with . The second holds its residues modulo a finite set of nonzero Gaussian integers of bounded residue weight, which stands for the earlier batches.
Theorem 1. Let , and be Gaussian integers. Then (3)✦ If , the set of residue codes modulo is finite, and (4)✦ Let be a finite probability law on a finite set , let be a random variable on with values in , and let be a finite set of nonzero Gaussian integers. Then (5)✦
In the paper, the result reads in terms of , the selected residue vector at of the batch of primes in , and , the selected residue vectors of the smaller batches.
What Is Checked
The claim is stated over the residue code , which numbers the residue classes modulo the multiples of , over the residue weight of (2), and over the entropy (1) of a random variable under a finite probability law.