8 Improving the exponents
The arguments here are due to Jyun-Jie Liao.
Definition
8.1
New definition of
is a real parameter with .
Previously in Definition 6.1 we had set . To implement this chapter, one should refactor the previous arguments so that is now free to be a positive number, though the specific hypothesis would now need to be added to Theorem 6.23.
Let be -valued random variables, and let be -minimizers as defined in Definition 6.4.
For the next two lemmas, let be a -valued random variable such that holds identically. Let be the quantity in 3.
We have the following variant of Lemma 6.21:
Lemma
8.2
Constructing good variables, I’
Proof
▶
We apply Lemma 3.23 with there. Since , the conclusion is that
The right-hand side in 1 can be rearranged as
using the fact (from Lemma 2.2) that all three terms are equal to and hence to each other. We also have
and similarly
Putting the above observations together, we have
where we introduce the notation
On the other hand, from Lemma 6.6 we have , and the claim follows.
(One could in fact refactor Lemma 6.21 to follow from Lemma 8.2 and Lemma 3.24).
Lemma
8.3
Constructing good variables, II’
Proof
▶
Average Lemma 8.2 over all six permutations of .
Now let be independent copies of , and set
and
and introduce the quantities
and
Lemma
8.4
Constructing good variables, III’
Proof
▶
For each in the range of , apply Lemma 8.3 with equal to , , respectively (which works thanks to Lemma 6.20), multiply by , and sum in to conclude.
To control the expressions in the right-hand side of this lemma we need a general entropy inequality.
Lemma
8.5
General inequality
Let be independent -valued random variables, and let be another -valued random variable. Set . Then
Proof
▶
On the one hand, by Lemma 3.24 and two applications of Lemma 3.25 we have
From Corollary 5.3 (with set equal to respectively) one has
Rearranging the mutual information and Ruzsa distances slightly, we conclude that
On the other hand, has an identical distribution to the independent sum of and . We may therefore apply Lemma 3.25 to conditioned variables and and average in to obtain the alternative bound
If one takes the arithmetic mean of these two bounds and simplifies using Corollary 5.3, one obtains the claim.
Returning to our specific situation, we now have
Lemma
8.6
Bound on distance differences
Proof
▶
If we apply Lemma 8.5 with , and equal to the permutations of , and sums (using the symmetry , which follows from Lemma 2.12), we can bound
by
which simplifies to
A symmetric argument also bounds
by
On the other hand, from Lemma 6.15 one has
Summing the previous three estimates, we obtain the claim.
Theorem
8.7
Improved -decrement
Suppose . Let be tau-minimizers. Then .
Theorem
8.8
Limiting improved -decrement
For , there exist tau-minimizers satisfying .
Proof
▶
For each , consider minimizers and from Proposition 6.5. By Theorem 8.7, they satisfy . By compactness of the space of probability measures on , one may extract a converging subsequence of the distributions of and as . By continuity of all the involved quantities, the limit is a pair of tau-minimizers for satisfying additionally .
Theorem
8.9
Improved entropy version of PFR
Let , and suppose that are -valued random variables. Then there is some subgroup such that
where is uniformly distributed on . Furthermore, both and are at most .
Proof
▶
Let be the good -minimizer from Theorem 8.8. By construction, . From Corollary 4.6, . Also from -minimization we have . Using this and the Ruzsa triangle inequality we can conclude.
One can then replace Lemma 7.2 with
Lemma
8.10
If is non-empty and , then can be covered by at most translates of a subspace of with
Proof
▶
By repeating the proof of Lemma 7.2 and using Theorem 8.9 one can obtain the claim with replaced with and replaced by .
This implies the following improved version of Theorem 7.3:
Theorem
8.11
Improved PFR
If is non-empty and , then can be covered by most translates of a subspace of with .
Proof
▶
By repeating the proof of Theorem 7.3 and using Lemma 8.10 one can obtain the claim with replaced by . □
Of course, by replacing Theorem 7.3 with Theorem 8.11 we may also improve constants in downstream theorems in a straightforward manner.