The Setting
A Gaussian block assigns weights to the Boolean vertices of a unit cube and samples its folded density on a residue grid. The denominator of the grid is chosen on an exponential scale determined by the mean logarithmic density.
Let be a nonnegative integer. Identify a Boolean digit with its real value or , so that a Boolean word is a vertex of . The standard Gaussian densities and are the functions defined by (1): (1) For , the univariate folded density and the product density are the functions defined by (2): (2) The Gaussian atom associated with a Boolean vertex is the function in (3): (3)✦ For , the conditional bit probability and, for , the conditional word probability are the functions defined by (4), with words indexed by all Boolean words: (4)
The folded mass is the integral of on .✦ For , the mean logarithmic density of on is the average of with respect to the measure with density and total mass , as in (5): (5) The block height and its logarithmic mean , for integers , are given in (6); all logarithms are natural: (6)
For a positive integer , let . The anchor of a residue vector and its grid cell are the point and half-open cube in (7), where is the representative of in : (7) Write for the eligible grid residues with parameters . For an integer , the eligible block set is the subset of defined by the parameter choices in (8): (8) For , the discrete folded Gaussian mass of a set is the grid average in (9): (9)
The Claim
Theorem 1. For all sufficiently large integers , there is a prime in the logarithmic window (10): (10)✦ For all sufficiently large integers , every positive integer satisfying has the grid mass bounds (11): (11)✦ For every , the logarithmic mean has the lower bound (12) and the upper bound (13): (12)✦ (13)✦ Let , let , and let satisfy in every coordinate. Put . For every Boolean word , the Gaussian rounding bounds are (14): (14)✦ There is an absolute constant such that, for all sufficiently large integers and every prime satisfying , each , , and Boolean word satisfy (15): (15)✦
In the paper, the result reads: for all sufficiently large there is a prime with , the uniform expectations over satisfy and , and ; with , every and Boolean word satisfy and , while there is an absolute constant such that, for eligible , every and Boolean word have both and at most .
What Is Checked
The statements are over finite Boolean cubes with Gaussian atom weights and finite residue grids, with the eligible sets .