The structure of approximate groups
arXiv:1110.5008
Abstract
Let K >= 1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A^2 is covered by K left translates of A. The main result of this paper is a qualitative description of approximate groups as being essentially finite-by-nilpotent, answering a conjecture of H. Helfgott and E. Lindenstrauss. This may be viewed as a generalisation of the Freiman-Ruzsa theorem on sets of small doubling in the integers to arbitrary groups. We begin by establishing a correspondence principle between approximate groups and locally compact (local) groups that allows us to recover many results recently established in a fundamental paper of Hrushovski. In particular we establish that approximate groups can be approximately modeled by Lie groups. To prove our main theorem we apply some additional arguments essentially due to Gleason. These arose in the solution of Hilbert's fifth problem in the 1950s. Applications of our main theorem include a finitary refinement of Gromov's theorem, as well as a generalized Margulis lemma conjectured by Gromov and a result on the virtual nilpotence of the fundamental group of Ricci almost nonnegatively curved manifolds.
arXiv comment91 pages
References in corpus (7)
- On the Bogolyubov-Ruzsa lemma
- Growth in finite simple groups of Lie type of bounded rank
- Structure of fundamental groups of manifolds with Ricci curvature bounded below
- Growth in solvable subgroups of GL_r(Z/pZ)
- A quantitative version of the non-abelian idempotent theorem
- Eigenvalue multiplicity and volume growth
- Approximate groups and doubling metrics
Cited by in corpus (5)
- Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets
- On the cardinality of sumsets in torsion-free groups
- An analytic approach to a weak non-Abelian Kneser-type theorem
- A nilpotent Freiman dimension lemma
- Additive combinatorics with a view towards computer science and cryptography: An exposition