# Approximate group

In mathematics, an approximate group is a subset of a group which behaves like a subgroup "up to a constant error", in a precise quantitative sense (so the term approximate subgroup may be more correct). For example, it is required that the set of products of elements in the subset be not much bigger than the subset itself (while for a subgroup it is required that they be equal). The notion was introduced in the 2010s but can be traced to older sources in additive combinatorics.

## Formal definition

Let $\displaystyle{ G }$ be a group and $\displaystyle{ K \ge 1 }$; for two subsets $\displaystyle{ X, Y \subset G }$ we denote by $\displaystyle{ X\cdot Y }$ the set of all products $\displaystyle{ xy, x\in X, y\in Y }$. A non-empty subset $\displaystyle{ A \subset G }$ is a $\displaystyle{ K }$-approximate subgroup of $\displaystyle{ G }$ if:

1. It is symmetric, that is if $\displaystyle{ g \in A }$ then $\displaystyle{ g^{-1} \in A }$;
2. There exists a subset $\displaystyle{ X \subset G }$ of cardinality $\displaystyle{ |X| \le K }$ such that $\displaystyle{ A \cdot A \subset X\cdot A }$.

It is immediately verified that a 1-approximate subgroup is the same thing as a genuine subgroup. Of course this definition is only interesting when $\displaystyle{ K }$ is small compared to $\displaystyle{ |A| }$ (in particular, any subset $\displaystyle{ B \subset G }$ is a $\displaystyle{ |B| }$-approximate subgroup). In applications it is often used with $\displaystyle{ K }$ being fixed and $\displaystyle{ |A| }$ going to infinity.

Examples of approximate subgroups which are not groups are given by symmetric intervals and more generally arithmetic progressions in the integers. Indeed, for all $\displaystyle{ n \ge 1 }$ the subset $\displaystyle{ X = [-N, N] \subset \mathbb Z }$ is a 2-approximate subgroup: the set $\displaystyle{ X + X = [-2N, 2N] }$ is contained in the union of the two translates $\displaystyle{ X + N }$ and $\displaystyle{ X - N }$ of $\displaystyle{ X }$. A generalised arithmetic progression in $\displaystyle{ \mathbb Z }$ is a subset in $\displaystyle{ \mathbb Z }$ of the form $\displaystyle{ \{n_1x_1 + \cdots + n_dx_d : |n_i| \le N_i\} }$, and it is a $\displaystyle{ 2^d }$-approximate subgroup.

A more general example is given by balls in the word metric in finitely generated nilpotent groups.

## Classification of approximate subgroups

Approximate subgroups of the integer group $\displaystyle{ \mathbb Z }$ were completely classified by Imre Z. Ruzsa and Freiman. The result is stated as follows:

For any $\displaystyle{ K \ge 1 }$ there are $\displaystyle{ C_K, c_K \gt 0 }$ such that for any $\displaystyle{ K }$-approximate subgroup $\displaystyle{ A \subset \mathbb Z }$ there exists a generalised arithmetic progression $\displaystyle{ P }$ generated by at most $\displaystyle{ C_K }$ integers and containing at least $\displaystyle{ c_K|A| }$ elements, such that $\displaystyle{ A+A+A+A \supset P }$.

The constants $\displaystyle{ C_K, C_K', c_K }$ can be estimated sharply. In particular $\displaystyle{ A }$ is contained in at most $\displaystyle{ C_K' }$translates of $\displaystyle{ P }$: this means that approximate subgroups of $\displaystyle{ \mathbb Z }$ are "almost" generalised arithmetic progressions.

The work of Breuillard–Green–Tao (the culmination of an effort started a few years earlier by various other people) is a vast generalisation of this result. In a very general form its statement is the following:

Let $\displaystyle{ K \ge 1 }$; there exists $\displaystyle{ C_K }$ such that the following holds. Let $\displaystyle{ G }$ be a group and $\displaystyle{ A }$ a $\displaystyle{ K }$-approximate subgroup in $\displaystyle{ G }$. There exists subgroups $\displaystyle{ H \triangleleft G_0 \le G }$ with $\displaystyle{ H }$ finite and $\displaystyle{ G_0/H }$ nilpotent such that $\displaystyle{ A^4 \supset H }$, the subgroup generated by $\displaystyle{ A^4 }$ contains $\displaystyle{ G_0 }$, and $\displaystyle{ A \subset X\cdot G_0 }$ with $\displaystyle{ |X| \le C_K }$.

The statement also gives some information on the characteristics (rank and step) of the nilpotent group $\displaystyle{ G_0/H }$.

In the case where $\displaystyle{ G }$ is a finite matrix group the results can be made more precise, for instance:

Let $\displaystyle{ K \ge 1 }$. For any $\displaystyle{ d }$ there is a constant $\displaystyle{ C_d }$ such that for any finite field $\displaystyle{ \mathbb F_q }$, any simple subgroup $\displaystyle{ G \subset \mathrm{GL}_d(\mathbb F_q) }$ and any $\displaystyle{ K }$-approximate subgroup $\displaystyle{ A \subset G }$ then either $\displaystyle{ A }$ is contained in a proper subgroup of $\displaystyle{ G }$, or $\displaystyle{ |A| \le K^{C_d} }$, or $\displaystyle{ |A| \ge |G|/K^{C_d} }$.

The theorem applies for example to $\displaystyle{ \mathrm{SL}_d(\mathbb F_q) }$; the point is that the constant does not depend on the cardinality $\displaystyle{ q }$ of the field. In some sense this says that there are no interesting approximate subgroups (besides genuine subgroups) in finite simple linear groups (they are either "trivial", that is very small, or "not proper", that is almost equal to the whole group).

## Applications

The Breuillard–Green–Tao theorem on classification of approximate groups can be used to give a new proof of Gromov's theorem on groups of polynomial growth. The result obtained is actually a bit stronger since it establishes that there exists a "growth gap" between virtually nilpotent groups (of polynomial growth) and other groups; that is, there exists a (superpolynomial) function $\displaystyle{ f }$ such that any group with growth function bounded by a multiple of $\displaystyle{ f }$ is virtually nilpotent.

Other applications are to the construction of expander graphs from the Cayley graphs of finite simple groups, and to the related topic of superstrong approximation.