Freiman's theorem

In additive combinatorics, a discipline within mathematics, Freiman's theorem is a central result which indicates the approximate structure of sets whose sumset is small. It roughly states that if ${\displaystyle |A+A|/|A|}$ is small, then ${\displaystyle A}$ can be contained in a small generalized arithmetic progression.

Statement

If ${\displaystyle A}$ is a finite subset of ${\displaystyle \mathbb {Z} }$ with ${\displaystyle |A+A|\leq K|A|}$, then ${\displaystyle A}$ is contained in a generalized arithmetic progression of dimension at most ${\displaystyle d(K)}$ and size at most ${\displaystyle f(K)|A|}$, where ${\displaystyle d(K)}$ and ${\displaystyle f(K)}$ are constants depending only on ${\displaystyle K}$.

Examples

For a finite set ${\displaystyle A}$ of integers, it is always true that

${\displaystyle |A+A|\geq 2|A|-1,}$

with equality precisely when ${\displaystyle A}$ is an arithmetic progression.

More generally, suppose ${\displaystyle A}$ is a subset of a finite proper generalized arithmetic progression ${\displaystyle P}$ of dimension ${\displaystyle d}$ such that ${\displaystyle |P|\leq C|A|}$ for some real ${\displaystyle C\geq 1}$. Then ${\displaystyle |P+P|\leq 2^{d}|P|}$, so that

${\displaystyle |A+A|\leq |P+P|\leq 2^{d}|P|\leq C2^{d}|A|.}$

History of Freiman's theorem

This result is due to Gregory Freiman (1964, 1966). ^{[1] [2] [3]} Much interest in it, and applications, stemmed from a new proof by Imre Z. Ruzsa (1992,1994). ^{[4] [5]} Mei-Chu Chang proved new polynomial estimates for the size of arithmetic progressions arising in the theorem in 2002. ^[6] The current best bounds were provided by Tom Sanders. ^[7]

Tools used in the proof

The proof presented here follows the proof in Yufei Zhao's lecture notes. ^[8]

Plünnecke–Ruzsa inequality

Main article: Plünnecke–Ruzsa inequality

Ruzsa covering lemma

The Ruzsa covering lemma states the following:

Let ${\displaystyle A}$ and ${\displaystyle S}$ be finite subsets of an abelian group with ${\displaystyle S}$ nonempty, and let ${\displaystyle K}$ be a positive real number. Then if ${\displaystyle |A+S|\leq K|S|}$, there is a subset ${\displaystyle T}$ of ${\displaystyle A}$ with at most ${\displaystyle K}$ elements such that ${\displaystyle A\subseteq T+S-S}$.

This lemma provides a bound on how many copies of ${\displaystyle S-S}$ one needs to cover ${\displaystyle A}$, hence the name. The proof is essentially a greedy algorithm:

Proof: Let ${\displaystyle T}$ be a maximal subset of ${\displaystyle A}$ such that the sets ${\displaystyle t+S}$ for ${\displaystyle A}$ are all disjoint. Then ${\displaystyle |T+S|=|T|\cdot |S|}$, and also ${\displaystyle |T+S|\leq |A+S|\leq K|S|}$, so ${\displaystyle |T|\leq K}$. Furthermore, for any ${\displaystyle a\in A}$, there is some ${\displaystyle t\in T}$ such that ${\displaystyle t+S}$ intersects ${\displaystyle a+S}$, as otherwise adding ${\displaystyle a}$ to ${\displaystyle T}$ contradicts the maximality of ${\displaystyle T}$. Thus ${\displaystyle a\in T+S-S}$, so ${\displaystyle A\subseteq T+S-S}$.

Freiman homomorphisms and the Ruzsa modeling lemma

Let ${\displaystyle s\geq 2}$ be a positive integer, and ${\displaystyle \Gamma }$ and ${\displaystyle \Gamma '}$ be abelian groups. Let ${\displaystyle A\subseteq \Gamma }$ and ${\displaystyle B\subseteq \Gamma '}$. A map ${\displaystyle \varphi \colon A\to B}$ is a Freiman ${\displaystyle s}$-homomorphism if

${\displaystyle \varphi (a_{1})+\cdots +\varphi (a_{s})=\varphi (a_{1}')+\cdots +\varphi (a_{s}')}$

whenever ${\displaystyle a_{1}+\cdots +a_{s}=a_{1}'+\cdots +a_{s}'}$ for any ${\displaystyle a_{1},\ldots ,a_{s},a_{1}',\ldots ,a_{s}'\in A}$.

If in addition ${\displaystyle \varphi }$ is a bijection and ${\displaystyle \varphi ^{-1}\colon B\to A}$ is a Freiman ${\displaystyle s}$-homomorphism, then ${\displaystyle \varphi }$ is a Freiman ${\displaystyle s}$-isomorphism.

If ${\displaystyle \varphi }$ is a Freiman ${\displaystyle s}$-homomorphism, then ${\displaystyle \varphi }$ is a Freiman ${\displaystyle t}$-homomorphism for any positive integer ${\displaystyle t}$ such that ${\displaystyle 2\leq t\leq s}$.

Then the Ruzsa modeling lemma states the following:

Let ${\displaystyle A}$ be a finite set of integers, and let ${\displaystyle s\geq 2}$ be a positive integer. Let ${\displaystyle N}$ be a positive integer such that ${\displaystyle N\geq |sA-sA|}$. Then there exists a subset ${\displaystyle A'}$ of ${\displaystyle A}$ with cardinality at least ${\displaystyle |A|/s}$ such that ${\displaystyle A'}$ is Freiman ${\displaystyle s}$-isomorphic to a subset of ${\displaystyle \mathbb {Z} /N\mathbb {Z} }$.

The last statement means there exists some Freiman ${\displaystyle s}$-homomorphism between the two subsets.

Proof sketch: Choose a prime ${\displaystyle q}$ sufficiently large such that the modulo-${\displaystyle q}$ reduction map ${\displaystyle \pi _{q}\colon \mathbb {Z} \to \mathbb {Z} /q\mathbb {Z} }$ is a Freiman ${\displaystyle s}$-isomorphism from ${\displaystyle A}$ to its image in ${\displaystyle \mathbb {Z} /q\mathbb {Z} }$. Let ${\displaystyle \psi _{q}\colon \mathbb {Z} /q\mathbb {Z} \to \mathbb {Z} }$ be the lifting map that takes each member of ${\displaystyle \mathbb {Z} /q\mathbb {Z} }$ to its unique representative in ${\displaystyle \{1,\ldots ,q\}\subseteq \mathbb {Z} }$. For nonzero ${\displaystyle \lambda \in \mathbb {Z} /q\mathbb {Z} }$, let ${\displaystyle \cdot \lambda \colon \mathbb {Z} /q\mathbb {Z} \to \mathbb {Z} /q\mathbb {Z} }$ be the multiplication by ${\displaystyle \lambda }$ map, which is a Freiman ${\displaystyle s}$-isomorphism. Let ${\displaystyle B}$ be the image ${\displaystyle (\cdot \lambda \circ \pi _{q})(A)}$. Choose a suitable subset ${\displaystyle B'}$ of ${\displaystyle B}$ with cardinality at least ${\displaystyle |B|/s}$ such that the restriction of ${\displaystyle \psi _{q}}$ to ${\displaystyle B'}$ is a Freiman ${\displaystyle s}$-isomorphism onto its image, and let ${\displaystyle A'\subseteq A}$ be the preimage of ${\displaystyle B'}$ under ${\displaystyle \cdot \lambda \circ \pi _{q}}$. Then the restriction of ${\displaystyle \psi _{q}\circ \cdot \lambda \circ \pi _{q}}$ to ${\displaystyle A'}$ is a Freiman ${\displaystyle s}$-isomorphism onto its image ${\displaystyle \psi _{q}(B')}$. Lastly, there exists some choice of nonzero ${\displaystyle \lambda }$ such that the restriction of the modulo-${\displaystyle N}$ reduction ${\displaystyle \mathbb {Z} \to \mathbb {Z} /N\mathbb {Z} }$ to ${\displaystyle \psi _{q}(B')}$ is a Freiman ${\displaystyle s}$-isomorphism onto its image. The result follows after composing this map with the earlier Freiman ${\displaystyle s}$-isomorphism.

Bohr sets and Bogolyubov's lemma

Though Freiman's theorem applies to sets of integers, the Ruzsa modeling lemma allows one to model sets of integers as subsets of finite cyclic groups. So it is useful to first work in the setting of a finite field, and then generalize results to the integers. The following lemma was proved by Bogolyubov:

Let ${\displaystyle A\subseteq \mathbb {F} _{2}^{n}}$ and let ${\displaystyle \alpha =|A|/2^{n}}$. Then ${\displaystyle 4A}$ contains a subspace of ${\displaystyle \mathbb {F} _{2}^{n}}$ of dimension at least ${\displaystyle n-\alpha ^{-2}}$.

Generalizing this lemma to arbitrary cyclic groups requires an analogous notion to “subspace”: that of the Bohr set. Let ${\displaystyle R}$ be a subset of ${\displaystyle \mathbb {Z} /N\mathbb {Z} }$ where ${\displaystyle N}$ is a prime. The Bohr set of dimension ${\displaystyle |R|}$ and width ${\displaystyle \varepsilon }$ is

${\displaystyle \operatorname {Bohr} (R,\varepsilon )=\{x\in \mathbb {Z} /N\mathbb {Z}$ :\forall r\in R,|rx/N|\leq \varepsilon \},}

where ${\displaystyle |rx/N|}$ is the distance from ${\displaystyle rx/N}$ to the nearest integer. The following lemma generalizes Bogolyubov's lemma:

Let ${\displaystyle A\subseteq \mathbb {Z} /N\mathbb {Z} }$ and ${\displaystyle \alpha =|A|/N}$. Then ${\displaystyle 2A-2A}$ contains a Bohr set of dimension at most ${\displaystyle \alpha ^{-2}}$ and width ${\displaystyle 1/4}$.

Here the dimension of a Bohr set is analogous to the codimension of a set in ${\displaystyle \mathbb {F} _{2}^{n}}$. The proof of the lemma involves Fourier-analytic methods. The following proposition relates Bohr sets back to generalized arithmetic progressions, eventually leading to the proof of Freiman's theorem.

Let ${\displaystyle X}$ be a Bohr set in ${\displaystyle \mathbb {Z} /N\mathbb {Z} }$ of dimension ${\displaystyle d}$ and width ${\displaystyle \varepsilon }$. Then ${\displaystyle X}$ contains a proper generalized arithmetic progression of dimension at most ${\displaystyle d}$ and size at least ${\displaystyle (\varepsilon /d)^{d}N}$.

The proof of this proposition uses Minkowski's theorem, a fundamental result in geometry of numbers.

Proof

By the Plünnecke–Ruzsa inequality, ${\displaystyle |8A-8A|\leq K^{16}|A|}$. By Bertrand's postulate, there exists a prime ${\displaystyle N}$ such that ${\displaystyle |8A-8A|\leq N\leq 2K^{16}|A|}$. By the Ruzsa modeling lemma, there exists a subset ${\displaystyle A'}$ of ${\displaystyle A}$ of cardinality at least ${\displaystyle |A|/8}$ such that ${\displaystyle A'}$ is Freiman 8-isomorphic to a subset ${\displaystyle B\subseteq \mathbb {Z} /N\mathbb {Z} }$.

By the generalization of Bogolyubov's lemma, ${\displaystyle 2B-2B}$ contains a proper generalized arithmetic progression of dimension ${\displaystyle d}$ at most ${\displaystyle (1/(8\cdot 2K^{16}))^{-2}=256K^{32}}$ and size at least ${\displaystyle (1/(4d))^{d}N}$. Because ${\displaystyle A'}$ and ${\displaystyle B}$ are Freiman 8-isomorphic, ${\displaystyle 2A'-2A'}$ and ${\displaystyle 2B-2B}$ are Freiman 2-isomorphic. Then the image under the 2-isomorphism of the proper generalized arithmetic progression in ${\displaystyle 2B-2B}$ is a proper generalized arithmetic progression in ${\displaystyle 2A'-2A'\subseteq 2A-2A}$ called ${\displaystyle P}$.

But ${\displaystyle P+A\subseteq 3A-2A}$, since ${\displaystyle P\subseteq 2A-2A}$. Thus

${\displaystyle |P+A|\leq |3A-2A|\leq |8A-8A|\leq N\leq (4d)^{d}|P|}$

so by the Ruzsa covering lemma ${\displaystyle A\subseteq X+P-P}$ for some ${\displaystyle X\subseteq A}$ of cardinality at most ${\displaystyle (4d)^{d}}$. Then ${\displaystyle X+P-P}$ is contained in a generalized arithmetic progression of dimension ${\displaystyle |X|+d}$ and size at most ${\displaystyle 2^{|X|}2^{d}|P|\leq 2^{|X|+d}|2A-2A|\leq 2^{|X|+d}K^{4}|A|}$, completing the proof.

Generalizations

See also: Arithmetic combinatorics § Breuillard–Green–Tao_theorem

A result due to Ben Green and Imre Ruzsa generalized Freiman's theorem to arbitrary abelian groups. They used an analogous notion to generalized arithmetic progressions, which they called coset progressions. A coset progression of an abelian group ${\displaystyle G}$ is a set ${\displaystyle P+H}$ for a proper generalized arithmetic progression ${\displaystyle P}$ and a subgroup ${\displaystyle H}$ of ${\displaystyle G}$. The dimension of this coset progression is defined to be the dimension of ${\displaystyle P}$, and its size is defined to be the cardinality of the whole set. Green and Ruzsa showed the following:

Let ${\displaystyle A}$ be a finite set in an abelian group ${\displaystyle G}$ such that ${\displaystyle |A+A|\leq K|A|}$. Then ${\displaystyle A}$ is contained in a coset progression of dimension at most ${\displaystyle d(K)}$ and size at most ${\displaystyle f(K)|A|}$, where ${\displaystyle f(K)}$ and ${\displaystyle d(K)}$ are functions of ${\displaystyle K}$ that are independent of ${\displaystyle G}$.

Green and Ruzsa provided upper bounds of ${\displaystyle d(K)=CK^{4}\log(K+2)}$ and ${\displaystyle f(K)=e^{CK^{4}\log ^{2}(K+2)}}$ for some absolute constant ${\displaystyle C}$. ^[9]

Terence Tao (2010) also generalized Freiman's theorem to solvable groups of bounded derived length. ^[10]

Extending Freiman’s theorem to an arbitrary nonabelian group is still open. Results for ${\displaystyle K<2}$, when a set has very small doubling, are referred to as Kneser theorems. ^[11]

The polynomial Freiman–Ruzsa conjecture, ^[12] is a generalization published in a paper ^[13] by Imre Ruzsa but credited by him to Katalin Marton. It states that if a subset of a group (a power of a cyclic group) ${\displaystyle A\subset G}$ has doubling constant such that ${\displaystyle |A+A|\leq K|A|}$ then it is covered by a bounded number ${\displaystyle K^{C}}$of cosets of some subgroup ${\displaystyle H\subset G}$ with${\displaystyle |H|\leq |A|}$. In 2012 Tom Sanders gave an almost polynomial bound of the conjecture for abelian groups. ^{[14] [15]} In 2023 a solution over ${\displaystyle G=\mathbb {F} _{2}^{n}}$ a field of characteristic 2 has been posted as a preprint by Tim Gowers, Ben Green, Freddie Manners and Terry Tao. ^{[16] [17] [18]} This proof was completely formalized in the Lean 4 formal proof language, a collaborative project that marked an important milestone in terms of mathematicians successfully formalizing contemporary mathematics. ^[19]

See also

• Markov spectrum
• Plünnecke–Ruzsa inequality
• Kneser's theorem (combinatorics)

References

1. Freiman, G.A. (1964). "Addition of finite sets". Soviet Mathematics. Doklady. 5: 1366–1370. Zbl   0163.29501.
2. Freiman, G. A. (1966). Foundations of a Structural Theory of Set Addition (in Russian). Kazan: Kazan Gos. Ped. Inst. p. 140. Zbl   0203.35305.
3. Nathanson, Melvyn B. (1996). Additive Number Theory: Inverse Problems and Geometry of Sumsets. Graduate Texts in Mathematics. Vol. 165. Springer. ISBN   978-0-387-94655-9. Zbl   0859.11003. p. 252.
4. Ruzsa, I. Z. (August 1992). "Arithmetical progressions and the number of sums". Periodica Mathematica Hungarica. 25 (1): 105–111. doi:10.1007/BF02454387. ISSN   0031-5303.
5. Ruzsa, Imre Z. (1994). "Generalized arithmetical progressions and sumsets". Acta Mathematica Hungarica . 65 (4): 379–388. doi: 10.1007/bf01876039 . Zbl   0816.11008.
6. Chang, Mei-Chu (2002). "A polynomial bound in Freiman's theorem". Duke Mathematical Journal. 113 (3): 399–419. CiteSeerX   10.1.1.207.3090 . doi:10.1215/s0012-7094-02-11331-3. MR   1909605.
7. Sanders, Tom (2013). "The structure theory of set addition revisited". Bulletin of the American Mathematical Society. 50: 93–127. arXiv: 1212.0458 . doi:10.1090/S0273-0979-2012-01392-7. S2CID   42609470.
8. Zhao, Yufei. "Graph Theory and Additive Combinatorics" (PDF). Archived from the original (PDF) on 2019-11-23. Retrieved 2019-12-02.
9. Ruzsa, Imre Z.; Green, Ben (2007). "Freiman's theorem in an arbitrary abelian group". Journal of the London Mathematical Society. 75 (1): 163–175. arXiv: math/0505198 . doi:10.1112/jlms/jdl021. S2CID   15115236.
10. Tao, Terence (2010). "Freiman's theorem for solvable groups". Contributions to Discrete Mathematics. 5 (2): 137–184. doi: 10.11575/cdm.v5i2.62020 .
11. Tao, Terence (10 November 2009). "An elementary non-commutative Freiman theorem". Terence Tao's blog.
12. "(Ben Green) The Polynomial Freiman–Ruzsa conjecture". What's new. 2007-03-11. Retrieved 2023-11-14.
13. Ruzsa, I. (1999). "An analog of Freiman's theorem in groups" (PDF). Astérisque. 258: 323–326.
14. Sanders, Tom (2012-10-15). "On the Bogolyubov–Ruzsa lemma". Analysis & PDE. 5 (3): 627–655. arXiv: 1011.0107 . doi: 10.2140/apde.2012.5.627 . ISSN   1948-206X.
15. Brubaker, Ben (2023-12-04). "An Easy-Sounding Problem Yields Numbers Too Big for Our Universe". Quanta Magazine. Retrieved 2023-12-11.
16. Gowers, W. T.; Green, Ben; Manners, Freddie; Tao, Terence (2023). "On a conjecture of Marton". arXiv: 2311.05762 [math.NT].
17. "On a conjecture of Marton". What's new. 2023-11-13. Retrieved 2023-11-14.
18. Sloman, Leila (December 6, 2023). "'A-Team' of Math Proves a Critical Link Between Addition and Sets". Quanta Magazine. Retrieved December 16, 2023.
19. "The Polynomial Freiman-Ruzsa Conjecture". PFR Project homepage.

Further reading

• Freiman, G. A. (1999). "Structure theory of set addition". Astérisque. 258: 1–33. Zbl   0958.11008.

This article incorporates material from Freiman's theorem on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.