Skip to main content
Springer logoLink to Springer
. 2019 Jan 28;374(1):499–515. doi: 10.1007/s00208-018-01795-z

Approximate subgroups of residually nilpotent groups

Matthew C H Tointon 1,
PMCID: PMC6560002  PMID: 31258186

Abstract

We show that a K-approximate subgroup A of a residually nilpotent group G is contained in boundedly many cosets of a finite-by-nilpotent subgroup, the nilpotent factor of which is of bounded step. Combined with an earlier result of the author, this implies that A is contained in boundedly many translates of a coset nilprogression of bounded rank and step. The bounds are effective and depend only on K; in particular, if G is nilpotent they do not depend on the step of G. As an application we show that there is some absolute constant c such that if G is a residually nilpotent group, and if there is an integer n>1 such that the ball of radius n in some Cayley graph of G has cardinality bounded by ncloglogn, then G is virtually (logn)-step nilpotent.

Mathematics Subject Classification: Primary 11B30, Secondary 11P70

Introduction

Let G be a group. In recent years there has been a considerable amount of study of subsets AG that have doublingK in the sense that |A2|K|A|, where K1 is some parameter. There is much motivation for the study of such sets already in the literature; rather than adding to it here, we simply point out that work in this area has had many applications in an impressively broad range of fields, and that the surveys [12, 19, 20, 29, 37] provide more detail on the background to the field and on many of these applications.

It turns out that the study of sets in G of bounded doubling essentially reduces to the study of sets called approximate subgroups of G. A finite set AG is said to be a K-approximate subgroup of G if there exists a set XG of size at most K such that A2XA. The reader may consult [41] for precise details of the relationship between sets of bounded doubling and approximate groups, although it is certainly clear that a K-approximate group has doubling at most K.

The definition of an approximate group is not particularly descriptive, and a central aim of approximate group theory is to extract more explicit, algebraic information about the structure of approximate groups. The most general result of this type is due to Breuillard, Green and Tao [10], which at its simplest level is as follows.

Theorem 1.1

(Breuillard–Green–Tao [10, Theorem 2.12]) Let G be a group and suppose that A is a K-approximate subgroup of G. Then there exist subgroups HCG such that

  1. HA12;

  2. C / H is nilpotent of rank and step at most O(K2logK);

  3. A can be covered by OK(1) left cosets of C.

By the rank of a nilpotent group here we mean the minimum number of elements needed to generate it as a group.

The use of ultrafilters in the proof of Theorem 1.1 makes it ineffective in the sense that no explicit bound is known on the number of left cosets of C required to cover A. There are, however, a number of results of various authors that give explicit bounds in this theorem if one is prepared to restrict to certain specific classes of group; see, for example, [59, 16, 17, 21, 27, 28, 3335, 40, 43]. The main purpose of this paper is to present a short argument giving explicit bounds in Theorem 1.1 in the case that G is residually nilpotent, as follows.

Theorem 1.2

Let G be a residually nilpotent group and suppose that A is a K-approximate subgroup of G. Then there exist subgroups HCG such that

  1. HAOK(1);

  2. C / H is nilpotent of step at most K6;

  3. A can be covered by exp(KO(1)) left cosets of C.

Let us emphasise in particular that if G is nilpotent then Theorem 1.2 applies with bounds that do not depend on the nilpotency class of G.

The proof of Theorem 1.2 is strongly inspired by the so-called nilpotent Freiman dimension lemma of Breuillard, Green and Tao [11], which is a similar result valid in the less general setting of a residually torsion-free nilpotent group.

Remark

It is not known what the optimal bounds should be in Theorems 1.1 and 1.2, although it would be surprising if Theorem 1.2 could not be improved. Breuillard and the author [13, Fact 4.18] have given an example to show that in Theorem 1.1 one cannot in general cover A with fewer than K1200loglogloglogK cosets of C. Eberhard [15] subsequently refined this construction to show that even KloglogK cosets are not in general sufficient.

Remark

In principle, our proof of Theorem 1.2 also gives a bound on the rank of the nilpotent quotient C / H, at least when G is assumed to be nilpotent. However, an earlier result of the author [43] gives the much better bound exp(exp(KO(1))), as we note in Corollary 1.4 below. An explicit bound on the order of the product set of A in which H is contained could also be computed from our argument, but it is rather poor, being roughly a tower of exponentials of height KO(1), and so we do not quantify it precisely.

Remark 1.3

Every finitely generated linear group is virtually residually nilpotent [44, Corollary 1.7]; see also [32, pp. 376–377]. One could therefore, in principle, deduce a version of Theorem 1.2 for any given finitely generated subgroup of GLn(K), with K an arbitrary field. Care is needed, however. In some cases the consequences are trivial; for example, if K is a finite field then the arguments of [32, 44] exhibit the trivial group as the finite-index residually nilpotent subgroup of GLn(K). In other cases the consequences are weaker than those given by earlier results; for example, if K has characteristic zero and n is fixed then results of Breuillard–Green–Tao [8, 9], or of Pyber–Szabó [33] and Breuillard–Green [6], imply Theorem 1.2 for GGLn(K) but with stronger bounds. Nonetheless, in certain cases Theorem 1.2 does appear to give new information. For example, the kernel of the projection GLn(Z)GLn(Z/pZ) is residually nilpotent (see [44, proof of Proposition 1.6] or [32, p. 377]), and so Theorem 1.2 applies directly to its approximate subgroups, whereas the results of [6, 8, 9, 33] do not apply if n is not a priori bounded.

Coset nilprogressions and a more detailed result Breuillard, Green and Tao [10] in fact proved a more detailed result than that given by Theorem 1.1. In order to state it we first need a definition. Given elements x1,,xrG and positive integers L1,,Lr, we define the set P(x1,,xr;L1,,Lr) to consist of all those elements of G that can be expressed as words in the xi and their inverses, in which each xi and its inverse appear at most Li times between them. If the xi generate an s-step nilpotent subgroup of G then P(x1,,xr;L1,,Lr) is said to be a nilprogression of rankr and steps. Finally, if C is a subgroup of G and H is a normal subgroup of C, and Q is a nilprogression of rank r and step s in C / H, then the set QH is said to be a coset nilprogression of rank r and step s in G.

A more precise version of Theorem 1.1 then states that if G is an arbitrary group, and A is a K-approximate subgroup of G, then A can be covered by OK(1) left translates of a coset nilprogression PA12 of rank and step at most O(K2logK) [10, Theorem 2.12]. As before, the bound OK(1) on the number of left translates of P needed to cover A is ineffective.

The author [43] has given an effective version of this more detailed result valid in the case that G is a nilpotent group of bounded step (see Theorem 2.8, below). Theorem 1.2 allows us to extend this to residually nilpotent groups, and in particular to make the bounds independent of the step of G in the case that G is nilpotent.

Corollary 1.4

(Freiman-type theorem for residually nilpotent groups) Let G be a residually nilpotent group and suppose that A is a K-approximate subgroup of G. Then there is a coset nilprogression PAOK(1) of rank at most exp(exp(KO(1))) and step at most K6 such that A can be covered by exp(KO(1)) left translates of P.

Remark

In the case that G is abelian the so-called polynomial Freiman–Ruzsa conjecture asserts that a K-approximate group A should be covered by KO(1) translates of a coset progression of rank O(logK) and cardinality at most |A|. These bounds would be optimal. The best result in this direction is due to Sanders [36], who has shown that one can cover A with exp((logK)O(1)) translates of a progression of rank (logK)O(1). Schoen [38] had previously obtained essentially optimal bounds in a closely related variant of this problem, showing that A is contained in a single coset progression of dimension at most K1+O((logK)-1/2) and cardinality at most exp(K1+O((logK)-1/2))|A| (similar bounds in this variant can also be computed from the Sanders result).

Remark

The abelian case of Corollary 1.4 (stated as Theorem 2.7, below) is ultimately an ingredient in the proof of Corollary 1.4. It appears that if one modified the argument of [43] to optimise the rank of the nilprogression rather than the number of translates required to cover the approximate group, and then applied the arguments of the present paper with the Sanders bounds in Theorem 2.7, one could swap the bounds on the rank and the number of translates in Corollary 1.4 (thus, the rank of P would be at most exp(KO(1)), with A being covered by exp(exp(KO(1))) translates of P). However, it does not appear that one could improve either bound without worsening the other, even assuming the polynomial Freiman–Ruzsa conjecture, and so we do not pursue this matter here.

Remark

Breuillard, Green and Tao’s more detailed version [10, Theorem 2.12] of Theorem 1.1 actually gives a bit more qualitative information than Corollary 1.4. Specifically, the coset nilprogression can be taken to be in OK(1)-normal form (see [10, Definition 2.6]). In a very recent preprint [42], Tessera and the author have shown that the coset nilprogression of Theorem 2.8, and hence that of Corollary 1.4, can also be taken to be in OK(1)-normal form. See [42] for more details and background.

Residually nilpotent groups of bounded exponent Let us point out a specific setting in which our argument gives stronger bounds than those of Theorem 1.2 and Corollary 1.4. Ruzsa [35] famously showed that if A is a set of doubling K inside an abelian group in which every element has order at most r, then A is contained inside a genuine subgroup of cardinality at most rK4K2|A|. Our argument provides the following generalisation of this statement to residually nilpotent groups.

Theorem 1.5

Let G be a residually nilpotent group in which every element has order at most r. Suppose that A is a K-approximate subgroup of G. Then A can be covered by K35K6+2 left cosets of a nilpotent subgroup contained in A(3r+2)K6+2.

A one-scale growth gap for residually nilpotent groups Let G be a group with finite symmetric generating set S. A well-known and remarkable theorem of Gromov [24] states that if |Sn| is bounded by some polynomial in n then G is virtually nilpotent. There have since been various refinements and strengthenings of this result. Some, such as [30, Theorem 7.1], [10, Corollaries 11.2, 11.5 and 11.7] and [13, Theorem 4.1], were proved using approximate groups; in particular, each of these follows from Theorem 1.1 or variants of it. As one might therefore expect, Theorem 1.2 also yields a refinement of Gromov’s theorem in the residually nilpotent case.

Before we present this result, let us note that Shalom and Tao [39] have already given a refinement of Gromov’s theorem in the general case, showing that there exists c>0 such that if

|Sn|n(loglogn)c, 1.1

for some n>1 then G is virtually nilpotent. In the residually nilpotent case, Grigorchuk and Lubotzky and Mann have shown that one can weaken the bound required on |Sn| yet further: they show that if

|Sn|<2n 1.2

for infinitely many nN then G is virtually nilpotent [14, Theorem E2]. Grigorchuk [22] proved this first in the case that G is residually a p-group; a lemma of Lubotzky and Mann [31, Lemma 1.7] then shows that his argument still works under the weaker assumption that G is residually nilpotent. It has been suggested that (1.2) could be enough to imply that an arbitrary group is virtually nilpotent [23].

Note that whereas the Grigorchuk–Lubotzky–Mann result requires the bound (1.2) to hold for infinitely many n (we call this a ‘multi-scale’ hypothesis), the Shalom–Tao result requires only that the bound (1.1) hold for a single value of n (we call this a ‘one-scale’ hypothesis). It is not known whether the bound (1.1) can be weakened further at the expense of reverting to a multi-scale hypothesis.

The following corollary of Theorem 1.2 shows that in the class of residually nilpotent groups one has Gromov’s theorem under a one-scale hypothesis with a slightly weaker bound than (1.1), and goes via a completely different argument to those of Grigorchuk, Lubotzky–Mann and Shalom–Tao.

Corollary 1.6

(One-scale growth gap for residually nilpotent groups) There exists an absolute constant c>0 such that if G is a residually nilpotent group with finite symmetric generating set S, and if there exists n>1 such that

|Sn|ncloglogn, 1.3

then G contains a (logn)-step nilpotent subgroup of index On(1).

Remark

As in Remark 1.3, Corollary 1.6 implies a growth-gap result for linear groups. Specifically, Corollary 1.6 holds with the same constant c when G is a linear group, provided n is large enough in terms of the dimension of G and the ring generated by the matrix entries of a generating set for G. However, much stronger results should be available using the uniform Tits alternative (see the papers [2, 3] of Breuillard and [4] of Breuillard–Gelander) and uniform exponential growth for soluble groups (see the paper [1] of Breuillard), and so we omit the details.

Outline of the paper In Sect. 2 we review the necessary background material on approximate groups. In Sect. 3 we prove a preliminary structure theorem for nilpotent approximate groups, which is essentially the argument of [11] adapted to deal with the possibility of finite subgroups. We also deduce Theorem 1.5 in the specific case that G is nilpotent. In Sect. 4 we prove a structure theorem for an approximate subgroup of a nilpotent group G that surjects onto the quotient G / Z(G), and then in Sect. 5 we combine everything to prove Theorem 1.2 in the case that G is nilpotent. In Sect. 6 we deduce the general statements of Theorems 1.2 and 1.5 from their respective nilpotent versions, as well as proving Corollary 1.4. Finally, in Sect. 7 we prove Corollary 1.6.

Background on approximate groups

In this section we collect together various basic facts about approximate groups. We start with a simple but powerful combinatorial lemma, based on an earlier result of Gleason [18, Lemma 1]. This is a key tool in the nilpotent Freiman dimension argument of Breuillard, Green and Tao [11], where it essentially allows the authors to bound the dimension of a torsion-free nilpotent K-approximate group in terms of K. Since the dimension also bounds the step, this is sufficient to imply Theorem 1.2 in this case.

Lemma 2.1

Let A be a finite symmetric subset of a group and let mN. Let {1}=H0H1Hk be a nested sequence of groups such that AmHiA2Hi-1. Then |Am+1|k|A|.

Proof

This is essentially [11, Lemma 3.1]. For each i=1,,k pick hi(AmHi)\A2Hi-1. It is sufficient to show that the sets Ahi are all disjoint. To see this, suppose that AhiAhj for some j<i. This would imply that hiA2hjA2HjA2Hi-1, contradicting the choice of hi.

The following standard lemma may be found in [43, Lemma 2.10], for example.

Lemma 2.2

Let G be a group with a subgroup H, and suppose that A is a K-approximate subgroup of G. Let mN. Then AmH can be covered by Km-1 left translates of A2H. In particular, AmH is a K2m-1-approximate group for every m2.

Lemma 2.3

Let G be a group and H a subgroup. Suppose that A is a finite symmetric subset of G. Then |A||A2H||AH/H||A3|. Moreover, A is covered by |AH / H| translates of A2H.

Proof

This is essentially [11, Lemma 2.2 (i)]. Let XA be a minimal set of left-coset representatives for H in AH, so that |X|=|AH/H|, and note that |X(A2H)|=|X||A2H| . The lemma then follows from the fact that AX(A2H)A3.

Corollary 2.4

Let G be a group, let A be a K-approximate subgroup, and let H be a subgroup such that |A2H||A|/K. Then |AH/H|KK2.

Proof

This observation is made in the proof of [11, Theorem 1.1]. The upper bound of Lemma 2.3, the approximate group property and the hypothesis of the corollary imply that |A2H||AH/H|K2|A|K2K|A2H|.

Lemma 2.5

Let A be a finite symmetric set in a group, and let H be a subgroup such that A2H={1}. Then |AmH||Am+1|/|A|.

Proof

This is essentially found in the proof of [11, Proposition 4.1]. First note that the sets aH with aA are disjoint. Indeed, if a,aA and aHaH then a-1aA2H, and so a=a. This implies in particular that |A(AmH)|=|A||AmH|, and the lemma follows.

The next result is another key lemma from the Breuillard–Green–Tao nilpotent Freiman dimension argument [11], where it allows the authors to locate an element in an approximate group with a large centraliser, which is in turn a key ingredient in finding a large nilpotent piece of that approximate group. It is also somewhat reminiscent of [27, Proposition 4.1].

Lemma 2.6

Let A be a K-approximate subgroup of a group G, and let G=Z1Z2 be a central series for G. Let j be maximal such that A2Zj{1}, and let ωAmZj. Then

|A2CG(ω)||A|K2m+2.

Proof

This is essentially found in the proof of [11, Proposition 4.1]. For each aA we have [ω,a]A2m+2Zj+1. Lemma 2.5 and the definition of j imply that |A2m+2Zj+1|K2m+2, and so as a ranges through A the number of values taken by [ω,a] is at most K2m+2. Fix a so that [ω,a] is the most popular such value, so that [ω,x]=[ω,a] for at least |A|/K2m+2 elements xA. For each such x we have xa-1A2CG(ω), and so the lemma holds.

Theorem 2.7

(Green–Ruzsa [21]) Suppose that A is a K-approximate subgroup of an abelian group. Then there exist a subgroup H4A, and elements x1,,xr4A and positive integers L1,,Lr with rKO(1), such that AH+P(x1,,xr;L1,,Lr)KO(1)A.

As we remarked in the introduction, Sanders [36] has shown that one can take the rank of P in Theorem 2.7 to be (logK)O(1), with A now contained in exp((logK)O(1)) translates of H+P. It does not appear that this leads to better bounds in Theorem 1.2.

Theorem 2.8

Let G be an s-step nilpotent group and suppose that A is a K-approximate subgroup of G. Then there exists a coset nilprogression P of rank at most KeO(s) such that APAKOs(1).

Proof

This is [43, Theorem 1.5], except that the bound on the rank of P stated in [43] is KOs(1). The more precise KeO(s) claimed here follows from an inspection of the proof in [43].

A preliminary structure theorem for nilpotent approximate groups

The strategy of Breuillard, Green and Tao’s nilpotent Freiman dimension argument [11] is roughly as follows. Given a K-approximate subgroup A of a torsion-free nilpotent group G, they seek a large piece of A that is nilpotent of bounded step. They first use Lemma 2.6 to locate an element γ1A with a large centraliser; passing to a group of bounded index, they can in fact assume that γ1 is central. Writing H1 for the largest cyclic subgroup containing γ1, they then pass to the quotient G/H1, which is automatically torsion-free, and repeat, producing a sequence γ1,γ2,,γk.

Writing Hi=γ1,,γi, since G/Hi-1 is torsion-free and A is finite, each γi has a power that is not contained in A2 modulo Hi. This element γi therefore contributes to the doubling of A in the sense of Lemma 2.1, and so that lemma implies that the number of elements γi this process produces is bounded in terms of K. In particular, this process gives a central series of bounded length that contains a large piece of A, and this piece is therefore of bounded step.

In the setting of the present paper, the fact that G may have torsion means we cannot assume in the same way that γi contributes to the doubling of A. Indeed, it is possible that γi generates a subgroup that is entirely contained in A modulo Hi-1, and hence makes no contribution to the doubling of A in the sense of Lemma 2.1. We must therefore content ourselves with the following statement.

Proposition 3.1

Let G be a nilpotent group and let A be a K-approximate subgroup of G. Then there exist kK6, subgroups D1DkDk+1 and A=C0C1Ck of G, and elements γ1,,γk such that γi normalises Di and such that, writing H0={1} and Hi=γiDi for i=1,,k, we have that

  1. DiCi-1;

  2. γi is central in Ci/Di; in particular HiCi;

  3. Hi-1Di;

  4. DiA2Hi-1;

  5. Ci=A2CiHi;

  6. γiA6\A2Hi-1;

  7. |A2Ci|K-35i|A|;

  8. Ck=Dk+1.

The subgroups and inclusions given by this proposition are illustrated in Fig. 1. The key output to note is the normal series

{1}=H0D1H1D2DkHkDk+1 3.1

(that this series is normal is not stated explicitly in the proposition, but follows immediately from it). Each subgroup Hi is cyclic and central modulo Di, being generated by the element γi modulo Di. The groups Hi and the elements γi are analogous to the groups Hi and elements γi in the description above of the argument of Breuillard, Green and Tao.

Fig. 1.

Fig. 1

Illustration of Proposition 3.1

The groups Di, on the other hand, do not feature in the torsion-free setting of Breuillard, Green and Tao; they correspond to the elements, described before Proposition 3.1, that do not contribute to the doubling of A in the torsion setting (note that conclusion (4) of the proposition implies that Di is contained in A2 modulo Hi-1; in particular, Di/Hi-1 is a finite group).

We will not ultimately be interested in the subgroups Ci, but their presence in the statement of the proposition makes it easier to formulate our inductive proof. The reader may therefore ignore these groups when it comes to applying Proposition 3.1 in later sections.

We start our proof of Proposition 3.1 with the following lemma.

Lemma 3.2

Let G be a group with symmetric generating set B, and let Z be a normal subgroup of G. Suppose that BZ is not a normal subgroup of G. Then B3Z\B.

Proof

If BZ is not a subgroup then we have the stronger statement that B2Z\B. If BZ is a non-normal subgroup then there exist bB and xBZ such that b-1xbBZ. Since b-1xbB3Z, the lemma is proved.

Proof of Proposition 3.1

Noting that C0=A and H0={1} always satisfy conditions (2), (5) and (7) of the proposition for i=0, we show that if subgroups C0,,Cj and D1,,Dj and elements γ1,,γj exist and satisfy the first seven conditions of the proposition for i=0,,j, and if CjA2Hj, then we can construct Cj+1,Dj+1,γj+1 that satisfy the first seven conditions for i=j+1. On the other hand, if we do have CjA2Hj then we stop and take k=j and Dj+1=Cj so that conditions (1), (3), (4) and (8) are satisfied. Note that if j>K6 then property (6) would contradict Lemma 2.1, so the process must terminate with kK6.

Write πj for the projection homomorphism πj:CjCj/Hj, and set Bj=πj(A2Cj). Let Cj/Hj=Z1Z2 be a central series for Cj/Hj. If Bj=Cj/Hj then we have CjA2Hj, and the process stops; in particular, if CjA2Hj then Bj2Bj by property (5), and so we may set to be maximal such that there exists ωjBj3Z\Bj. Property (5) for i=j, along with Lemma 3.2 and the maximality of , imply that BjZ+1 is a normal subgroup of Cj/Hj, and so we may set Dj+1 to be its pullback πj-1(BjZ+1), which satisfies conditions (1), (3) and (4) for i=j+1.

Now write ρj for the projection homomorphism ρj:Cj/HjCj/Dj+1. Note that ρj(ωj)1, and moreover that this implies that ρj(Bj){1} (since ρj(Bj) generates Cj/Dj+1 by the i=j case of property (5)). We may therefore let n be maximal such that ρj(Bj2)ρj(Zn){1}. This implies that there exist bBj2 and zZn such that ρj(b)=ρj(z)1, and in particular that there exists hBjZ+1 such that z=bh.

We conclude that zBj3Zn, and so since ρj(z)1 we have z(Bj3Zn)\(BjZ+1). Thus n by definition of . In particular, ρj(ωj)ρj(Bj3)ρj(Zn), and so Lemmas 2.2 and 2.6 imply that

|ρj(Bj2)CCj/Dj+1(ρj(ωj))||ρj(Bj)|K24.

Defining Gj+1=πj-1ρj-1(CCj/Dj+1(ρj(ωj))), we therefore have

|ρjπj(A4Gj+1)||ρj(Bj)|K24. 3.2

Moreover, following [11], we have

K11|A2Gj+1||A12Gj+1|(by Lemma2.1)|(A4Gj+1)3||(A4Gj+1)2Dj+1||ρjπj(A4Gj+1)|(by Lemma2.3).

Since (A4Gj+1)2Dj+1A4Dj+1, we conclude that

|A2Gj+1|K-11|A4Dj+1||ρjπj(A4Gj+1)|,

which combines with (3.2) to imply that

|A2Gj+1|K-35|A4Dj+1||ρj(Bj)|=K-35|A4Dj+1||ρjπj(A2Cj)|K-35|(A2Cj)2Dj+1||ρjπj(A2Cj)|K-35|A2Cj|(by Lemma2.3)K-35(j+1)|A|(by property (7) fori=j).

Pick an arbitrary element γj+1A6Cj such that πj(γj+1)=ωj, and note that γj+1 satisfies (6) for i=j+1 and, being contained in Cj, normalises Dj+1. Finally, define Cj+1=A2Gj+1Hj+1, noting that this satisfies (5) and (7) for i=j+1. Moreover, (the image of) γj+1 is central in Gj+1/Dj+i by definition, and so in particular it is central in Cj+1/Dj+i, and so (2) is satisfied for i=j+1.

Proof of Theorem 1.5 (nilpotent case)

Apply Proposition 3.1, noting that property (6) implies that γiA6, and hence that γiA3r. It then follows from repeated application of property (4) that HkA(3r+2)K6, and hence from property (8) that CkA(3r+2)K6+2. The result then follows from property (7) for i=k, and Corollary 2.4.

Central extensions of nilpotent approximate groups

Theorem 1.2 requires us to exhibit a group HAOK(1) and a group C such that HC and C / H is nilpotent of bounded step. So far, we have succeeded only in producing the chain (3.1) given by Proposition 3.1, which in fact consists of several quotients Di/Di-1 that are in some sense the opposite of what we are looking for: Hi-1 is nilpotent of bounded step (indeed, abelian) in the quotient Di/Di-1, whilst Di/Hi-1 is finite.

We have (A2Di)Hi-1=Di by conclusions (3) and (4) of Proposition 3.1, and the group Hi-1 is central in the quotient Di/Di-1 by conclusion (2). The quotient Di/Di-1 may therefore be thought of as a ‘central extension’ of the approximate group A2Di. In this section we describe the structure of such central extensions of nilpotent approximate groups, as follows.

Proposition 4.1

Let G be a finitely generated nilpotent group, and let A be a K-approximate subgroup such that G=A·Z(G). Then there exist kK8, and normal subgroups {1}=H0H1Hk[G,G] of G such that HiA8Hi-1, and such that [G,G]A4Hk. In particular, [G,G]A8K8+4.

Remark 4.2

Essentially the same argument shows that if G=G1GsGs+1={1} is the lower central series for G and G=AGs+1-i then Gi+1AKOi(1). We leave the details to the reader.

Throughout this section, G is a finitely generated nilpotent group and A is a K-approximate subgroup such that G=A·Z(G), as in Proposition 4.1.

Given elements a,bG we define, as usual, the commutator [ab] by [a,b]=a-1b-1ab. It is well known (see [26, §11.1], for example) that there exists a finite set c1,,cr of commutators, called basic commutators, such that the series {1}=Γ0Γ1Γr formed by taking Γi=c1,,ci is a central series with [G,G]=Γr, and such that every xΓi can be expressed in the form x=ciic11, with iZ of course depending on x. Let these commutators ci and subgroups Γi be fixed from now on.

Lemma 4.3

The set of commutators in G is contained in A4.

Proof

Write π:GG/Z(G) for the projection homomorphism. The commutator [ab] depends only on π(a) and π(b). Since π(A)=G/Z(G), there exist a,bA such that π(a)=π(a) and π(b)=π(b), and so [a,b]=[a,b]A4, as desired.    

Lemma 4.4

We have ΓiA4Γi-1 for each i=1,,r.

Proof

Writing ci=[ai,bi], it follows from the easily verified identity [x,yz]=[x,z]z-1[x,y]z that [ai,bi]i[ai,bii]Γi-1. The desired result therefore follows from Lemma 4.3.

Lemma 4.5

Let j{0,,r-1}. Then there exists j>j such that ΓjA4Γj, and such that either j=r or Γj+1=A8ΓjΓj+1A4Γj.

Proof

Let jr be maximal such that (A4Γj)Γj is a group, noting that j>j by Lemma 4.4. Lemma 4.4 implies that (A4Γj) generates Γj, so in fact we have (A4Γj)Γj=Γj; in particular, ΓjA4Γj, as required. If jr then (A4Γj+1)Γj is not a group by definition of j, and in particular we have (A8Γj+1)Γj(A4Γj+1)Γj, and hence A8ΓjΓj+1A4Γj. However, Γj+1=A8ΓjΓj+1 by Lemma 4.4.

Proof of Proposition 4.1

It follows from repeated application of Lemma 4.5 that there exist kZ and 0=j(0)<j(1)<<j(k) such that Γj(i)=A8Γj(i-1)Γj(i)A4Γj(i-1) for each i, and such that [G,G]A4Γj(k). Lemma 2.1 implies that kK8, and so we may take Hi=Γj(i) in Proposition 4.1.

Nilpotent groups

In this section we prove Theorem 1.2 under the assumption that G is nilpotent. In fact, we prove the following slightly more detailed result, which includes some additional conclusions that are of use when generalising to the residually nilpotent setting.

Proposition 5.1

(Nilpotent case of Theorem 1.2) Let G be a nilpotent group and suppose that A is a K-approximate subgroup of G. Then there exist subgroups HCG such that

  1. HAOK(1);

  2. C / H is nilpotent of step at most K6;

  3. C is generated by A6C;

  4. |A2C|exp(-KO(1))|A|;

  5. A can be covered by exp(KO(1)) left cosets of C.

We use the following special case of a lemma of Guralnick [25].

Lemma 5.2

([25, Lemma 3.1]) Let G be a group, and let D be an abelian normal subgroup of G such that G=x1,,xn,D. Then [G,D]={i=1n[xi,di]:diD}.

Proof of Proposition 5.1

Let k,D1,,Dk+1,γ1,γk be as given by Proposition 3.1, write Zi=γi, and write C=Dk+1; the group C acts to some extent as the ambient group in this proof. Note that Proposition 3.1 (4) and (6) imply that C is generated by A6C, and so property (c) of the present proposition is satisfied.

We have |A2C|K-35k|A| and kK6, and so Corollary 2.4 implies that A is covered by K35K6+2 translates of C, and properties (d) and (e) are satisfied. Moreover, for each i we have Di normal in C, and Di+1A2ZiDi with Zi central in C/Di. Finally, D1A2.

We claim that there exist the following.

  • (i)

    Subgroups D¯k+1D¯kD¯1, normal in C, such that D¯k+1=C and DiD¯iAOK,(k-i)(1)Di otherwise, and such that D¯i+1 is central in C/D¯i.

  • (ii)

    Non-negative integers r(k)r(1) such that r(i)OK,(k-i)(1), and elements x1,,xr(1)C such that x1,,xr(i)AOK,(k-i)(1), and such that D¯i+1=xr(i+1)+1,,xr(i),D¯i.

Note that part (i) of the claim is enough to prove the proposition, since we may take H=D¯1, and then (D¯i/D¯1) is a central series of length at most K6+1 for C / H. Part (ii) exists only to facilitate an inductive proof of part (i).

To prove the claim, we assume that D¯k+1,,D¯i+1 and x1,,xr(i+1) have been constructed and satisfy (i) and (ii), and then construct D¯i and r(i). This assumption implies that there exists mOK,(k-i)(1) such that D¯i+1=(AmD¯i+1)ZiDi. Lemma 2.2 implies that AmD¯i+1 is an OK,(k-i)(1)-approximate group, and so Proposition 4.1 applied to D¯i+1/Di implies that [D¯i+1,D¯i+1]AOK,(k-i)(1)Di.

Since D¯i+1 is normal in C, so is [D¯i+1,D¯i+1], and so we may define a normal subgroup Di=[D¯i+1,D¯i+1]Di, noting that DiAOK,(k-i)(1)Di. Since D¯i+1 is abelian in C/Di, we may apply Lemma 5.2 in this quotient to conclude that [C,D¯i+1]{j=1r(i+1)[xj,dj]:djD¯i+1}Di.

Since Zi is central in C/Di, the image of [xj,dj] in D¯i+1/Di when djD¯i+1 depends only on the image of dj in the quotient D¯i+1/ZiDi. Moreover, for each djD¯i+1 there exists djAmD¯i+1 with the same image as dj in D¯i+1/ZiDi. Every such commutator [xj,dj] therefore lies in AOK,(k-i)(1)Di. In particular, setting Di=[C,D¯i+1]Di we have DiAOK,(k-i)(1)Di, with Di normal in C.

The image of AmD¯i+1 in C/Di is an abelian OK,(k-i)(1)-approximate group by Lemma 2.2, and so it follows from Theorem 2.7 that there exist y1,,ynAOK,(k-i)(1)D¯i+1, with nOK,(k-i)(1), and a set BAOK,(k-i)(1)D¯i+1 such that BDi is a group, such that D¯i+1=y1,,yn,BDi. Set r(i)=r(i+1)+n, and set xr(i+1)+j=yj for j=1,,n.

Since the image of D¯i+1 in C/Di is central, the group BDi is normal. Note, moreover, that BDiAOK,(k-i)(1)Di. Thus we can finally define D¯i=BDi, and the claim, and hence the proposition, is proved.

Residually nilpotent groups

A group G is said to be residually nilpotent if for every non-identity element gG there exists a nilpotent group N and a homomorphism π:GN such that π(g)1. This is a strictly weaker condition than that of being nilpotent: finitely generated free groups are residually nilpotent, for example. In this section we extend our results from nilpotent groups to this more general setting, using an argument similar to one appearing in [11].

It will be convenient first to note that being residually nilpotent is in fact equivalent to an apparently slightly stronger condition, as follows.

Lemma 6.1

Let G be a residually nilpotent group and let AG be a finite set such that 1A. Then there exists a nilpotent group N and a homomorphism π:GN such that Akerπ=.

Proof

By definition, for each aA there exists a nilpotent group Na and a homomorphism πa:GNa such that πa(a)1. In particular, writing sa for the step of Na and G=G1G2 for the lower central series of G we have aGsa+1. Writing s=maxaAsa, we may therefore take π to be the projection homomorphism π:GG/Gs+1.

Lemma 6.2

Let G be a group, and let AG be a symmetric set containing the identity. Let N be another group, and let π:GN be a homomorphism. Let Hπ(A) be a subgroup of N. Then we have the following.

  1. If A2kerπ={1} then π is injective on A.

  2. If A3kerπ={1} then there exists a subgroup HA isomorphic to H via π.

  3. If A4kerπ={1} then H is normal in A if and only if H is normal in π(A).

Proof

Item (1) follows from the fact that if π(a)=π(a) then a-1akerπ, and in turn implies that for each hH there is a unique ϕ(h)A such that π(ϕ(h))=h. Given h,hH we have ϕ(h)ϕ(h)ϕ(hh)-1A3kerπ. If A3kerπ={1}, it therefore follows that ϕ(h)ϕ(h)=ϕ(hh), and hence that H=ϕ(H)A is a subgroup. Item (1) implies moreover that π|H:HH is an isomorphism.

If H is normal in π(A) then for every aA and hH there exists h^H such that π(a-1)hπ(a)=h^. In particular, a-1ϕ(h)aϕ(h^-1)kerπA4, so if A4kerπ={1} then a-1ϕ(h)aH, and hence H is normal in A.

Proof of Theorem 1.5

The theorem holds for nilpotent groups by the proof given at the end of Sect. 3. Set M=(3r+2)K6+3. Lemma 6.1 implies that there exists a homomorphism π from G to a nilpotent group N such that A3Mkerπ={1}. Applying the nilpotent version of the theorem to π(A), we conclude that there exists a subgroup Cπ(AM-1) and a subset XA with |X|K35K6+2 such that π(A)π(X)C. However, Lemma 6.2 (2) implies that there exists a subgroup CAM-1 such that π|C:CC is an isomorphism, and so for every aA there exist xX and cC such that π(a)=π(xc). Since π is injective on AM by Lemma 6.2 (1), we conclude that a=xc, and so AXC and the theorem is proved.

Recall that the simple commutator of weight k in the elements x1,,xk is defined inductively by [x1,x2]:=x1-1x2-2x1x2 and [x1,,xk]:=[[x1,,xk-1],xk], and that a group G generated by a set X is nilpotent of step s if and only if every simple commutator of weight s+1 in elements of X is trivial [26].

Proof of Theorem 1.2

Let m be the quantity implied by the OK(1) notation in Proposition 5.1 (a), let be the word length of a simple commutator of weight K6+1, and let Mm(+1). Lemma 6.1 implies that there exists a homomorphism π from G to a nilpotent group N such that A4Mkerπ={1}. Applying Proposition 5.1 to π(A), we conclude that there exist subgroups HCN such that Hπ(Am), such that C / H is nilpotent of step at most K6, such that C is generated by π(A6)C, and such that |π(A2)C|exp(-KO(1))|π(A)|.

Define C=Amπ-1(C), noting that π(C)=C. Note also that Hπ(Amπ-1(C))=π(AmC), and so Lemma 6.2 implies that there is a normal subgroup HC such that HAm and such that π|H:HH is an isomorphism.

Set k=K6. Following [11], if x1,,xk+1AmC then the nilpotency of C / H implies that [π(x1),,π(xk+1)]H, which implies that there exists hH such that [π(x1),,π(xk+1)]π(h)=1. By Lemma 6.2 (1) this implies that [x1,,xk+1]h=1, and so we conclude that C/H is nilpotent of step at most K6.

Finally, note that π(A2)C=π(A2C), and hence, by Lemma 6.2 (1), that |A2C|=|π(A2)C|exp(-KO(1))|π(A)|=exp(-KO(1))|A|. The theorem therefore follows from Corollary 2.4.

Proof of Corollary 1.4

It follows from Theorem 1.2 and Lemma 2.3 that A can be covered by exp(KO(1)) translates of A2C. Writing π:CC/H, Lemma 2.2 implies that π(A2C) is a K3-approximate subgroup of the K6-step nilpotent group C / H. The result then follows from Theorem 2.8.

Growth

Proof of Corollary 1.6

We start by proving the corollary under the additional assumption that nN, where NN is some constant to be determined shortly. If (1.3) holds then in particular we have |Sn|ncloglogn|Sn1/2|, which we may re-write as |Sn|(logn)clogn|Sn1/2|=(logn)2clogn1/2|Sn1/2|. This implies that there exists r[0,log5n1/2] such that

S5r+1n1/2(logn)O(c)S5rn1/2.

It then follows from [13, Lemma 2.2], for example, that S2·5rn1/2 is a (logn)O(c)-approximate group. Provided c is small enough and N is large enough, Theorem 1.2 therefore implies that there is a subgroup C of G and a normal subgroup HC contained in SOn(1) such that C / H is nilpotent of step at most logn-1, and such that Sn1/2 is contained in at most n1/2 left cosets of C. In particular, [13, Lemma 2.7] implies that C has index at most n1/2 in G.

Following the proof of [10, Corollary 11.7], note that C acts on H by conjugation. Since |H|On(1), the permutation group of H has cardinality at most On(1), and hence the stabiliser C<C of this action has index at most On(1). This proves the corollary for nN, since C is nilpotent of step at most logn.

Replacing c by a smaller constant if necessary, we may assume that NcloglogN<2; this ensures that if (1.3) holds for some n[2,N] then G is the trivial group, and hence satisfies the corollary. This completes the proof for all n2.

Acknowledgements

It is a pleasure to thank Emmanuel Breuillard for valuable conversations, comments and corrections; Corina Ciobotaru for corrections; Tom Sanders for help with the references; Terence Tao for encouraging the pursuit of this problem; and an anonymous referee for a careful reading of the paper and a number of helpful comments. This work was supported by ERC Grant GA617129 ‘GeTeMo’.

Footnotes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Breuillard E. On uniform exponential growth for solvable groups. Pure Appl. Math. Q. 2007;3(4):949–967. doi: 10.4310/PAMQ.2007.v3.n4.a4. [DOI] [Google Scholar]
  • 2.Breuillard E. A height gap theorem for finite subsets of GLd(Q¯) and nonamenable subgroups. Ann. Math. 2011;174(2):1057–1110. doi: 10.4007/annals.2011.174.2.7. [DOI] [Google Scholar]
  • 3.Breuillard, E.: A strong Tits alternative. arXiv:0804.1395
  • 4.Breuillard E, Gelander T. Uniform independence in linear groups. Invent. Math. 2008;173(2):225–263. doi: 10.1007/s00222-007-0101-y. [DOI] [Google Scholar]
  • 5.Breuillard E, Green BJ. Approximate groups. I. The torsion-free nilpotent case. J. Inst. Math. Jussieu. 2011;10(1):37–57. doi: 10.1017/S1474748010000150. [DOI] [Google Scholar]
  • 6.Breuillard E, Green BJ. Approximate groups, II: the solvable linear case. Q. J. Math. 2011;62(3):513–521. doi: 10.1093/qmath/haq011. [DOI] [Google Scholar]
  • 7.Breuillard E, Green BJ. Approximate groups, III: the unitary case. Turk. J. Math. 2012;36:199–215. [Google Scholar]
  • 8.Breuillard E, Green BJ, Tao TC. Approximate subgroups of linear groups. Geom. Funct. Anal. 2011;21(4):774–819. doi: 10.1007/s00039-011-0122-y. [DOI] [Google Scholar]
  • 9.Breuillard, E., Green, B.J., Tao, T.C.: A note on approximate subgroups of GLn(C) and uniformly nonamenable groups. arXiv:1101.2552
  • 10.Breuillard E, Green BJ, Tao TC. The structure of approximate groups. Publ. Math. IHES. 2012;116(1):115–221. doi: 10.1007/s10240-012-0043-9. [DOI] [Google Scholar]
  • 11.Breuillard E, Green BJ, Tao TC. A nilpotent Freiman dimension lemma. Eur. J. Comb. 2013;34(8):1287–1292. doi: 10.1016/j.ejc.2013.05.010. [DOI] [Google Scholar]
  • 12.Breuillard, E., Green, B.J., Tao, T.C.: Small doubling in groups. In: Proc. of the Erdős Centenery Conference (2013). arXiv:1301.7718
  • 13.Breuillard, E., Tointon, M.C.H.: Nilprogressions and groups with moderate growth. arXiv:1506.00886
  • 14.Dixon, J.D., Du Sautoy, M.P.F., Mann, A., Segal, D.: Analytic pro-p groups, Cambridge studies in advanced mathematics, vol. 61, 2nd edn. Cambridge Univ. Press, Cambridge (2003)
  • 15.Eberhard, S.: A note on nonabelian Freiman–Ruzsa. arXiv:1511.06758
  • 16.Freiman, G.A.: Foundations of a structural theory of set addition, Translations of Mathematical Monographs, vol. 37. Amer. Math. Soc., Providence. Translated from the 1966 Russian version, published by Kazan Gos. Ped, Inst (1973)
  • 17.Gill N, Helfgott HA. Growth in solvable subgroups of GLr(Z/pZ) Math. Ann. 2014;360(1):157–208. doi: 10.1007/s00208-014-1008-8. [DOI] [Google Scholar]
  • 18.Gleason AM. Compact subgroups. Proc. Natl. Acad. Sci. USA. 1951;37(9):622–623. doi: 10.1073/pnas.37.9.622. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 19.Green, B.J.: Approximate groups and their applications: work of Bourgain, Gamburd, Helfgott and Sarnak. Current events bulletin of the AMS (2010). arXiv:0911.3354
  • 20.Green, B.J.: Approximate algebraic structure. In: Proc. ICM 2014. arXiv:1404.0093
  • 21.Green BJ, Ruzsa IZ. Freiman’s theorem in an arbitrary abelian group. J. Lond. Math. Soc. 2007;75(1):163–175. doi: 10.1112/jlms/jdl021. [DOI] [Google Scholar]
  • 22.Grigorchuk, R.I.: On the Hilbert–Poincaré series of graded algebras that are associated with groups. Mat. Sb. 180(2), 207–225, 304 (1989). English translation Math. USSR-Sb. 66(1), 211–229 (1990)
  • 23.Grigorchuk RI. On the Gap conjecture concerning group growth. Bull. Math. Sci. 2014;4:113–128. doi: 10.1007/s13373-012-0029-4. [DOI] [Google Scholar]
  • 24.Gromov M. Groups of polynomial growth and expanding maps. Publ. Math. IHES. 1981;53:53–73. doi: 10.1007/BF02698687. [DOI] [Google Scholar]
  • 25.Guralnick RM. On a result of Schur. J. Algebra. 1979;59:302–310. doi: 10.1016/0021-8693(79)90128-5. [DOI] [Google Scholar]
  • 26.Hall M. The Theory of Groups. Providence: Amer. Math. Soc./Chelsea; 1999. [Google Scholar]
  • 27.Helfgott HA. Growth and generation in SL2(Z/pZ) Ann. Math. 2008;167:601–623. doi: 10.4007/annals.2008.167.601. [DOI] [Google Scholar]
  • 28.Helfgott HA. Growth in SL3(Z/pZ) J. Eur. Math. Soc. 2011;13(3):761–851. doi: 10.4171/JEMS/267. [DOI] [Google Scholar]
  • 29.Helfgott, H.A.: Growth in groups: ideas and perspectives. arXiv:1303.0239
  • 30.Hrushovski E. Stable group theory and approximate subgroups. J. Am. Math. Soc. 2012;25(1):189–243. doi: 10.1090/S0894-0347-2011-00708-X. [DOI] [Google Scholar]
  • 31.Lubotzky A, Mann A. On groups of polynomial subgroup growth. Invent. Math. 1991;104:521–533. doi: 10.1007/BF01245088. [DOI] [Google Scholar]
  • 32.Lubotzky A, Segal D. Subgroup Growth, Progress in Mathematics. Basel: Birkhäuser; 2003. [Google Scholar]
  • 33.Pyber, L., Szabó, E.: Growth in finite simple groups of Lie type of bounded rank. arXiv:1005.1858
  • 34.Ruzsa IZ. Generalized arithmetical progressions and sumsets. Acta Math. Hungar. 1994;65(4):379–388. doi: 10.1007/BF01876039. [DOI] [Google Scholar]
  • 35.Ruzsa IZ. An analog of Freiman’s theorem in groups, structure theory of set addition. Astérisque. 1999;258:323–326. [Google Scholar]
  • 36.Sanders T. On the Bogolyubov–Ruzsa lemma. Anal. PDE. 2012;5(3):627–655. doi: 10.2140/apde.2012.5.627. [DOI] [Google Scholar]
  • 37.Sanders T. The structure theory of set addition revisited. Bull. Am. Math. Soc. 2013;50:93–127. doi: 10.1090/S0273-0979-2012-01392-7. [DOI] [Google Scholar]
  • 38.Schoen T. Near optimal bounds in Freimans theorem. Duke Math. J. 2011;158:1–12. doi: 10.1215/00127094-1276283. [DOI] [Google Scholar]
  • 39.Shalom Y, Tao TC. A finitary version of Gromov’s polynomial growth theorem. Geom. Funct. Anal. 2010;20(6):1502–1547. doi: 10.1007/s00039-010-0096-1. [DOI] [Google Scholar]
  • 40.Tao TC. Freiman’s theorem for solvable groups. Contrib. Discrete Math. 2010;5(2):137–184. [Google Scholar]
  • 41.Tao TC. Product set estimates for non-commutative groups. Combinatorica. 2008;28(5):547–594. doi: 10.1007/s00493-008-2271-7. [DOI] [Google Scholar]
  • 42.Tessera, R., Tointon, M.C.H.: Properness of nilprogressions and the persistence of polynomial growth of given degree. arXiv:1612.05152
  • 43.Tointon MCH. Freiman’s theorem in an arbitrary nilpotent group. Proc. Lond. Math. Soc. (3) 2014;109:318–352. doi: 10.1112/plms/pdu005. [DOI] [Google Scholar]
  • 44.Wehrfritz BAF. Groups of automorphisms of soluble groups. Proc. Lond. Math. Soc. (3) 1970;20:101–122. doi: 10.1112/plms/s3-20.1.101. [DOI] [Google Scholar]

Articles from Mathematische Annalen are provided here courtesy of Springer

RESOURCES