Lean Bourgain Extractor

1 Additive Combinatorics

Lemma 1.1
#

For any two sets \(A, B\), we have \(|A-B| \leq \frac{|A+B|^3}{|A||B|}\)

Proof

By the triangle inequality we have \(|A-B| \leq \frac{|A+B| |B+B|}{|B|}\), and from the Plünnecke-Ruzsa inequality we have \(|B+B| \leq (\frac{|A+B|}{|A|})^2 |A|\).

Lemma 1.2
#

For any set \(A\) and a non-zero value \(x\), we have \(|xA| = |A|\)

Proof

This is obvious from the bijection of multiplication by \(x\).

Lemma 1.3
#

we have \(-(A \cap B) = -A \cap -B\)

Proof

Trivial from the definitions.

Lemma 1.4
#

For any set \(A\) and two values \(a, b\), we have \((a+b)A \subseteq aA + bA\).

Proof

For any value \((a+b) v\) with \(v \in A\) we have \(a v \in a A\), \(b v \in b A\), and \(a v + b v = (a+b)v\)

Lemma 1.5
#

For any set \(A\) and two values \(a, b\), we have \((a-b)A \subseteq aA - bA\).

Proof

Exactly the same as the previous lemma.

Lemma 1.6
#

If \(A \cap C \neq \emptyset \), we have \(|B+C| \leq \frac{|B+A| |C+C|}{|A \cap C|}\).

Proof

By the triangle inequality, we have \(|B+C| \leq \frac{|B + (A \cap C)| |(A \cap C) + C|}{|A \cap C|}\), and this is less than \(\frac{|B+A| |C+C|}{|A \cap C|}\) because \(B + (A \cap C)\subseteq B+A\) and \((A \cap C) + C \subseteq C + C\).

Lemma 1.7
#

For any three sets \(A, B, C\), we have \(|A+B+C| \leq \frac{|C+A| |A+B|^8}{|A|^6 |B|^2}\)

Proof

If either \(A\) or \(B\) are empty this is trivial. Otherwise we have an element \(v \in B\). We obviously have \((A + B) \cap (A + \{ v\} ) = A + \{ v\} \), and it is nonempty. So by 1.6 we have

\[ |A+B+C| = |C + (A+B)| \leq \frac{|C + A + \{ v\} | |(A+B) + (A+B)|}{|A + \{ v\} |} = \frac{|C + A| |(A+B) + (A+B)|}{|A|} \]

By Ruzsa’s covering lemma we have a set \(u\) of size \(\leq \frac{|A+B|}{|B|}\) such that \(A \subseteq u + B - B\). This gives \(\frac{|C + A| |(A+B) + (A+B)|}{|A|} \leq \frac{|C + A| |(u+B-B+B) + (u+B-B+B)|}{|A|} = \frac{|C + A| |2 \cdot u + 4 \cdot B - 2 \cdot B|}{|A|} \leq \frac{|C + A| |u|^2 |4 \cdot B - 2 \cdot B|}{|A|}\). By the Plünnecke-Ruzsa inequality we now have \(|4 \cdot B - 2 \cdot B| \leq (\frac{|A+B|}{|A|})^6 |A|\), and the result follows from this and the bound on \(|u|\).

Lemma 1.8
#

We have that \(Q(A, x A)\) for \(x \neq 0\) is the number of quadruples \((a, b, c, d) \in A^4\) such that \(a + x b = c + x d\).

Proof

By a direct bijection from quadruples \((a, b, c, d) \in A \times (xA) \times A \times (xA)\) such that \(a + b = c + d\).