PFR

8 Improving the exponents

The arguments here are due to Jyun-Jie Liao.

Definition 8.1 New definition of η
#

η is a real parameter with η>0.

Previously in Definition 6.1 we had set η=1/9. To implement this chapter, one should refactor the previous arguments so that η is now free to be a positive number, though the specific hypothesis η=1/9 would now need to be added to Theorem 6.23.

Let X10,X20 be G-valued random variables, and let X1,X2 be τ-minimizers as defined in Definition 6.4.

For the next two lemmas, let (T1,T2,T3) be a G3-valued random variable such that T1+T2+T3=0 holds identically. Let δ be the quantity in 3.

We have the following variant of Lemma 6.21:

Lemma 8.2 Constructing good variables, I’
#

One has

kδ+η(d[X10;T1|T3]d[X10;X1])+η(d[X20;T2|T3]d[X20;X2]).
Proof

(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’
#

One has

kδ+η6i=121j,l3;jl(d[Xi0;Tj|Tl]d[Xi0;Xi])
Proof

Now let X1,X2,X~1,X~2 be independent copies of X1,X2,X1,X2, and set

U:=X1+X2,V:=X~1+X2,W:=X1+X~1

and

S:=X1+X2+X~1+X~2

and introduce the quantities

k=d[X1;X2]

and

I1=I(U:V|S).
Lemma 8.4 Constructing good variables, III’
#

One has

kI(U:V|S)+I(V:W|S)+I(W:U|S)+η6i=12A,B{U,V,W}:AB(d[Xi0;A|B,S]d[Xi0;Xi]).
Proof

To control the expressions in the right-hand side of this lemma we need a general entropy inequality.

Lemma 8.5 General inequality
#

Let X1,X2,X3,X4 be independent G-valued random variables, and let Y be another G-valued random variable. Set S:=X1+X2+X3+X4. Then

d[Y;X1+X2|X1+X3,S]d[Y;X1]14(d[X1;X2]+2d[X1;X3]+d[X2;X4])+14(d[X1|X1+X3;X2|X2+X4]d[X3|X3+X4;X1|X1+X2])+18(H[X1+X2]H[X3+X4]+H[X2]H[X3]+H[X2|X2+X4]H[X1|X1+X3]).
Proof

Returning to our specific situation, we now have

Lemma 8.6 Bound on distance differences
#

We have

i=12A,B{U,V,W}:ABd[Xi0;A|B,S]d[Xi0;Xi]12k+4(2ηkI1)1η.
Proof
Theorem 8.7 Improved τ-decrement
#

Suppose 0<η<1/8. Let X1,X2 be tau-minimizers. Then d[X1;X2]=0.

Proof
Theorem 8.8 Limiting improved τ-decrement
#

For η=1/8, there exist tau-minimizers X1,X2 satisfying d[X1;X2]=0.

Proof
Theorem 8.9 Improved entropy version of PFR
#

Let G=F2n, and suppose that X10,X20 are G-valued random variables. Then there is some subgroup HG such that

d[X10;UH]+d[X20;UH]10d[X10;X20],

where UH is uniformly distributed on H. Furthermore, both d[X10;UH] and d[X20;UH] are at most 6d[X10;X20].

Proof

One can then replace Lemma 7.2 with

Lemma 8.10
#

If AF2n is non-empty and |A+A|K|A|, then A can be covered by at most K6|A|1/2/|H|1/2 translates of a subspace H of F2n with

|H|/|A|[K10,K10].
Proof

This implies the following improved version of Theorem 7.3:

Theorem 8.11 Improved PFR
#

If AF2n is non-empty and |A+A|K|A|, then A can be covered by most 2K11 translates of a subspace H of F2n with |H||A|.

Proof

Of course, by replacing Theorem 7.3 with Theorem 8.11 we may also improve constants in downstream theorems in a straightforward manner.