The Setting
A fixed grid records the cell containing a real random variable and discards its position within that cell. For a finite law, this observation can identify distinct atoms.
A finitely supported probability law on is a probability measure with a finite support and strictly positive normalized masses , as in (1), where is the unit point mass at . (1)✦ The entropy in nats of weights on a finite set and the Shannon entropy in bits of the finite law are the real quantities given in (2). (2) Here the summand at a zero weight is zero.
For a finite set in a set , real weights , an observable taking values in a set and a value , the fiber mass is the sum of the weights of the points of mapped to .✦ The observable entropy of real weights on a finite set under an observable is the Shannon entropy in nats of the fiber masses on .✦ For the law , its observable entropy is given in (3). (3) At a scale , the unshifted grid observation assigns each atom its cell index; its grid entropy in bits is in (4). (4)✦
For a nonnegative integer , the iterated sumset is the set of sums of atoms, with the empty sum interpreted as zero, as in (5). (5)✦
Dyadic Pair Capacities
The dyadic distance band index of a real number is the negative of the floor of its base-two logarithm, as in (6). (6)✦ For an integer , the pairs at scale are the unordered pairs of atoms whose distances lie in that dyadic band✦; the occupied distance bands are the indices of nonempty pair sets in (7). (7)
The incident pair mass of weights at a real point is half the total weight of the pairs containing , as in (8). (8)✦ Feasible pair weights on are nonnegative weights whose incident mass at each atom is at most that atom’s mass; their set is defined in (9). (9)✦ The fair-pair capacity is the fractional matching capacity obtained by taking the supremum of total feasible pair weights in (10). (10)✦
The Claim
Theorem 1. Let be a finitely supported probability law on , let be an integer, and let . Its fixed-grid entropy loss obeys (11). (11)✦
In the paper, the result reads: for every integer there is a finite constant , independent of the smallest positive distance in , such that every finitely supported probability law on and every satisfy (12). (12)
What Is Checked
The claim is stated for finite probability laws on , positive integers and positive grid scales , with the capacities in (10) defined using the feasible pair weights in (9).