PFR

11 Weak PFR over the integers

Lemma 11.1
#

If G is torsion-free and X,Y are G-valued random variables then d[X;2Y]5d[X;Y].

Proof
Lemma 11.2
#

If G is a torsion-free group and X,Y are G-valued random variables and ϕ:GF2d is a homomorphism then

H(ϕ(X))10d[X;Y].
Proof
Lemma 11.3
#

Let G=F2n and α(0,1) and let X,Y be G-valued random variables such that

H(X)+H(Y)>20αd[X;Y].

There is a non-trivial subgroup HG such that

log|H|<1+α2(H(X)+H(Y))

and

H(ψ(X))+H(ψ(Y))<α(H(X)+H(Y))

where ψ:GG/H is the natural projection homomorphism.

Proof
Lemma 11.4
#

If G=F2d and α(0,1) and X,Y are G-valued random variables then there is a subgroup HF2d such that

log|H|1+α2(1α)(H(X)+H(Y))

and if ψ:GG/H is the natural projection then

H(ψ(X))+H(ψ(Y))20αd[ψ(X);ψ(Y)].
Proof

We could use the previous lemma for any value of α(0,1), which would give a whole range of estimates in Theorem 11.10. For definiteness, we specialize only to α=3/5, which gives a constant 2 in the first bound below.

Lemma 11.5
#

If G=F2d and α(0,1) and X,Y are G-valued random variables then there is a subgroup HF2d such that

log|H|2(H(X)+H(Y))

and if ψ:GG/H is the natural projection then

H(ψ(X))+H(ψ(Y))34d[ψ(X);ψ(Y)].
Proof
Lemma 11.6
#

Let ϕ:GH be a homomorphism and A,BG be finite subsets. If x,yH then let Ax=Aϕ1(x) and By=Bϕ1(y). There exist x,yH such that Ax,By are both non-empty and

d[ϕ(UA);ϕ(UB)]log|A||B||Ax||By|(H(ϕ(UA))+H(ϕ(UB)))(d(UA,UB)d(UAx,UBy)).
Proof
Definition 11.7
#

If AZd then by dim(A) we mean the dimension of the span of AA over the reals – equivalently, the smallest d such that A lies in a coset of a subgroup isomorphic to Zd.

Theorem 11.8
#

If A,BZd are finite non-empty sets then there exist non-empty AA and BB such that

log|A||B||A||B|34d[UA;UB]

such that max(dimA,dimB)40log2d[UA;UB].

Proof
Theorem 11.9
#

If AZd is a finite non-empty set with d[UA;UA]logK then there exists a non-empty AA such that

|A|K17|A|

and dimA40log2logK.

Proof
Theorem 11.10
#

Let AZd and |AA|K|A|. There exists AA such that |A|K17|A| and dimA40log2logK.

Proof