Notes of Emmanuel Breuillard’s third Oxford lecture 24-03-2017

Approximate groups, III

1. Growth

Let {F} be a finitely generated free group. It is easy that for the standard generating system, {|S|^n=2k(2k-1)^{n-1}}. What about other generating systems?

Theorem 1 (Razborov, Safin) For an arbitrary generating set {S} in {F},

\displaystyle \begin{array}{rcl} |S^{2n-1}|\geq(\frac{|S|}{10})^n . \end{array}


If a Product Theorem {|AAA\geq |A|^{1+\epsilon}} holds in a group, then {|A^n|\geq |A|^{n^\alpha}}. So this implies super-polynomial growth, but not exponential growth. Nevertheless, it might give an alternative proof of (a weak form) of Gromov’s polynomial growth theorem. Note that Product Theorems in this form are known only for certain finite simple groups (and even fail for alternating groups).

1.1. Proof of Gromov’s polynomial growth theorem

Indeed, the structure theorem for approximate groups (BGT) yields such a proof.

Assume that for all {n}, {|S^n|\leq C\,n^d}. There are arbitrarily large integers such hat {|S^{2r}|\leq 3^d|S^r|}, i.e. {S^r} is an approximate subgroup.

BGT states that {S^r\subset X_r H_r} where {H_r} is virtually nilpotent and {|X_r|\leq const.(d)}. For {r>|X_r|}, this shows that {H_r} has finite index.

Remark. We merely need one large value of {r} such that {|S^{2r}|\leq 3^d|S^r|}. Also, the constant {C} plays no role, merely the ratio {|S^r|/|S|}. So that applies to generating sets of arbitrary size.

2. Margulis Lemma

Margulis Lemma states that in a compact negatively curved Riemannian manifold {M}, the subgroup of {\pi_1(M,x)} generated by loops of length {<\epsilon(}dimension,min sectional curvature{)} is cyclic. In the non-compact case, cyclic needs be replaced with nilpotent.

Here is a generalization, which follows from BGT.

Lemma 2 Let {X} be a metric space with {K}-bounded geometry (every ball of radius 4 is covered by at mots {K} balls of radius 1). Then, for every {x}, any discrete group of isometries generated by elements that move {x} at most {\epsilon(K)} away is virtually nilpotent.

Proof. Let

\displaystyle \begin{array}{rcl} S_\epsilon=\{\gamma\,;\, d(x,\gamma)<\epsilon\}. \end{array}

Then {S_2} is an approximate group, hence contained in {XH} with {H} virtually nilpotent and {|X|\leq const.(K)}, {H} has finite index.

3. Proof of structure theorem

It goes by contradiction. Compactness plays a role, in the form of ultraproducts. The strategy was outlined by Hrushovski. We dug into the proof of the solution to Hilbert’s 5th problem.

Take any sequence of approximate subgroups {A_n} in groups {G_n}. Form ultraproducts {A<G}. This is a non-standard approximate subgroup.

3.1. Step 1

Define a locally compact topology on {A}.

A lemma due to independently to Sanders and Hrushovski says that in a finite {K}-approximate group {A'}, there exists a subset {S} of positive proportion such that {S^k\subset A'^4}. Such sets provide a basis for the required topology.

Then our non-standard {A} maps to a locally compact group with image a compact neighborhood of {1}.

3.2. Step 2

Use tools from the proof of the solution to Hilbert’s 5th problem: up to passing to an open subgroup, can mod out by a compact group and get a Lie group.

The point (Gleason Lemmas) is to show that one-parameter subgroups (obtained as limits of cyclic subgroups) can be multiplied. This produces a vectorspace, candidate to be the Lie algebra. These lemmas are quantitative, we can give approximative group versions.

4. Questions

Does this give a gap from polynomial growth? Not quite, because non effective. Kleiner’s proof is effective, Shalom and Tao managed to extract a gap from it, something like {n^{\log\log n}}.


About metric2011

metric2011 is a program of Centre Emile Borel, an activity of Institut Henri Poincaré, 11 rue Pierre et Marie Curie, 75005 Paris, France. See
This entry was posted in Course and tagged . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s