As part of the 18.099 discrete analysis reading group at MIT,
I presented section 4.7 of Tao-Vu’s Additive
Combinatorics textbook.
Here were the notes I used for the first part of my presentation.
1. Synopsis
In the previous few lectures we’ve worked hard at developing the notion of characters, Bohr sets, spectrums.
Today we put this all together to prove some Szemerédi-style results on
arithmetic progressions of ZN.
Recall that Szemerédi’s Theorem states that:
Theorem 1(Szemerédi)
Let k≥3 be an integer. Then for sufficiently large N,
any subset of {1,…,N} with density at least
(loglogN)2−2k+91
contains a length k arithmetic progression.
Notice that the density approaches zero as N→∞ but it does so extremely slowly.
Our goal is to show much better results for sets like 2A−2A, A+B+C or A+B. In this post we will prove:
Theorem 2(Chang’s Theorem)
Let K,N≥1 and let A⊆Z=ZN. Suppose E(A,A)≥∣A∣3/K, and let
d≪K(1+logPZA1).
Then there is a proper symmetric progression P⊆2A−2A of rank at most d and density
PZP≥d−d.
One can pick K such that for example ∣A±A∣≤k∣A∣, i.e. if A has small Ruzsa diameter.
Or one can pick K=1/PZA always, but then d becomes quite large.
We also prove that
Theorem 3. Let K,N≥1 and let A,B,C⊆Z=ZN.
Suppose ∣A∣=∣B∣=∣C∣≥K1∣A+B+C∣ and now let
d≪K2(1+logPZA1).
Then there is a proper symmetric progression P⊆A+B+C of rank at most d and
PZP≥d−d.
2. Main steps
Our strategy will take the following form.
Let S be the set we want to study (for us, S=2A−2A or S=A+B+C).
Then our strategy will take the following four steps.
Step 1. Analyze the Fourier coefficients of 1S. Note in particular the identities
Step 3. Use the triangle inequality and the Fourier concentration lemma (covering). Recall that this says:
Lemma 4(Fourier Concentration, or “Covering Lemma”, Tao-Vu 4.36)
Let A⊆Z, and let 0<α≤1. Then one can pick η1, …, ηd such that
d≪α21+logPZA1
and SpecαA is contained in a d-cube, i.e.
it’s covered by c1η1+⋯+cdηd where ci∈{−1,0,1}.
Using such a d, we have by the triangle inequality
Bohr({η1,…,ηd},dρ)⊆Bohr(SpecαA,ρ).(1)
Step 4. We use the fact that Bohr sets contain long arithmetic progressions:
Theorem 5(Bohr sets have long coset progressions, Tao-Vu 4.23)
Let Z=ZN. Then within Bohr(S,r) one can select a
proper symmetric progression P such that
PZP≥(∣S∣r)∣S∣
and rankP≤∣S∣.
The third step is necessary because in the bound for the preceding theorem,
the dependence on ∣S∣ is much more severe than the dependence on r.
Therefore it is necessary to use the Fourier concentration lemma in order to
reduce the size of ∣S∣ before applying the result.
3. Proof of Chang’s theorem
First, we do the first two steps in the following proposition.
Proposition 6. Let A⊆Z, 0<α≤1. Assume E(A,A)≥4α2∣A∣3, Then
Bohr(SpecαA,61)⊆2A−2A.
Proof: To do this, as advertised consider
f=1A∗1A∗1−A∗1−A(x).
We want to show that any x∈Bohr(SpecαA,61) lies in the support of f.
Note that if x does lie in this Bohr set, we have
Ree(ξ⋅x)≥21∀ξ∈SpecαA.
We aim to show now f(x)>0. This follows by computing
and then using the main result on Bohr sets, we can find a symmetric progression of density at least
(d1/6d)d=d−d
and whose rank is at most d. This completes the proof of Chang’s theorem.
4. Proof of the second theorem
This time, the Bohr set we want to use is:
Proposition 7. Let α=2πK1. Then
Bohr(SpecαA,2πK1)⊆A+B+C.
Proof: Let f=1A∗1B∗1C.
Note that we have PZ(A+B+C)≤KPZA, while EZA=(PZA)3.
So by shifting C, we may assume without loss of generality that
f(0)≥KPZA(PZA)3≥K1(PZA)2.
Now, consider x in the Bohr set. Then we have
So there are the main theorem on Bohr sets again, there is a symmetric progression of density at least
(d2πKd1)d≪d−d
and rank at most d. This completes the proof of the second theorem.