You are currently browsing the tag archive for the ‘ultra approximate groups’ tag.
A common theme in mathematical analysis (particularly in analysis of a “geometric” or “statistical” flavour) is the interplay between “macroscopic” and “microscopic” scales. These terms are somewhat vague and imprecise, and their interpretation depends on the context and also on one’s choice of normalisations, but if one uses a “macroscopic” normalisation, “macroscopic” scales correspond to scales that are comparable to unit size (i.e. bounded above and below by absolute constants), while “microscopic” scales are much smaller, being the minimal scale at which nontrivial behaviour occurs. (Other normalisations are possible, e.g. making the microscopic scale a unit scale, and letting the macroscopic scale go off to infinity; for instance, such a normalisation is often used, at least initially, in the study of groups of polynomial growth. However, for the theory of approximate groups, a macroscopic scale normalisation is more convenient.)
One can also consider “mesoscopic” scales which are intermediate between microscopic and macroscopic scales, or large-scale behaviour at scales that go off to infinity (and in particular are larger than the macroscopic range of scales), although the behaviour of these scales will not be the main focus of this post. Finally, one can divide the macroscopic scales into “local” macroscopic scales (less than for some small but fixed
) and “global” macroscopic scales (scales that are allowed to be larger than a given large absolute constant
). For instance, given a finite approximate group
:
- Sets such as
for some fixed
(e.g.
) can be considered to be sets at a global macroscopic scale. Sending
to infinity, one enters the large-scale regime.
- Sets such as the sets
that appear in the Sanders lemma from the previous set of notes (thus
for some fixed
, e.g.
) can be considered to be sets at a local macroscopic scale. Sending
to infinity, one enters the mesoscopic regime.
- The non-identity element
of
that is “closest” to the identity in some suitable metric (cf. the proof of Jordan’s theorem from Notes 0) would be an element associated to the microscopic scale. The orbit
starts out at microscopic scales, and (assuming some suitable “escape” axioms) will pass through mesoscopic scales and finally entering the macroscopic regime. (Beyond this point, the orbit may exhibit a variety of behaviours, such as periodically returning back to the smaller scales, diverging off to ever larger scales, or filling out a dense subset of some macroscopic set; the escape axioms we will use do not exclude any of these possibilities.)
For comparison, in the theory of locally compact groups, properties about small neighbourhoods of the identity (e.g. local compactness, or the NSS property) would be properties at the local macroscopic scale, whereas the space of one-parameter subgroups can be interpreted as an object at the microscopic scale. The exponential map then provides a bridge connecting the microscopic and macroscopic scales.
We return now to approximate groups. The macroscopic structure of these objects is well described by the Hrushovski Lie model theorem from the previous set of notes, which informally asserts that the macroscopic structure of an (ultra) approximate group can be modeled by a Lie group. This is already an important piece of information about general approximate groups, but it does not directly reveal the full structure of such approximate groups, because these Lie models are unable to see the microscopic behaviour of these approximate groups.
To illustrate this, let us review one of the examples of a Lie model of an ultra approximate group, namely Exercise 28 from Notes 7. In this example one studied a “nilbox” from a Heisenberg group, which we rewrite here in slightly different notation. Specifically, let be the Heisenberg group
with group law
, where
is the box
thus is the nonstandard box
where . As the above exercise establishes,
is an ultra approximate group with a Lie model
given by the formula
for and
. Note how the nonabelian nature of
(arising from the
term in the group law (1)) has been lost in the model
, because the effect of that nonabelian term on
is only
which is infinitesimal and thus does not contribute to the standard part. In particular, if we replace
with the abelian group
with the additive group law
and let and
be defined exactly as with
and
, but placed inside the group structure of
rather than
, then
and
are essentially “indistinguishable” as far as their models by
are concerned, even though the latter approximate group is abelian and the former is not. The problem is that the nonabelian-ness in the former example is so microscopic that it falls entirely inside the kernel of
and is thus not detected at all by the model.
The problem of not being able to “see” the microscopic structure of a group (or approximate group) also was a key difficulty in the theory surrounding Hilbert’s fifth problem that was discussed in previous notes. A key tool in being able to resolve such structure was to build left-invariant metrics (or equivalently, norms
) on one’s group, which obeyed useful “Gleason axioms” such as the commutator axiom
, or the escape axiom
was sufficiently small. Such axioms have important and non-trivial content even in the microscopic regime where
or
are extremely close to the identity. For instance, in the proof of Jordan’s theorem from Notes 0, which showed that any finite unitary group
was boundedly virtually abelian, a key step was to apply the commutator axiom (2) (for the distance to the identity in operator norm) to the most “microscopic” element of
, or more precisely a non-identity element of
of minimal norm. The key point was that this microscopic element was virtually central in
, and as such it restricted much of
to a lower-dimensional subgroup of the unitary group, at which point one could argue using an induction-on-dimension argument. As we shall see, a similar argument can be used to place “virtually nilpotent” structure on finite approximate groups. For instance, in the Heisenberg-type approximate groups
and
discussed earlier, the element
will be “closest to the origin” in a suitable sense to be defined later, and is centralised by both approximate groups; quotienting out (the orbit of) that central element and iterating the process two more times, we shall see that one can express both
and
as a tower of central cyclic extensions, which in particular establishes the nilpotency of both groups.
The escape axiom (3) is a particularly important axiom in connecting the microscopic structure of a group to its macroscopic structure; for instance, as shown in Notes 2, this axiom (in conjunction with the closely related commutator axiom) tends to imply dilation estimates such as
that allow one to understand the microscopic geometry of points
close to the identity in terms of the (local) macroscopic geometry of points
that are significantly further away from the identity.
It is thus of interest to build some notion of a norm (or left-invariant metrics) on an approximate group that obeys the escape and commutator axioms (while being non-degenerate enough to adequately capture the geometry of
in some sense), in a fashion analogous to the Gleason metrics that played such a key role in the theory of Hilbert’s fifth problem. It is tempting to use the Lie model theorem to do this, since Lie groups certainly come with Gleason metrics. However, if one does this, one ends up, roughly speaking, with a norm on
that only obeys the escape and commutator estimates macroscopically; roughly speaking, this means that one has a macroscopic commutator inequality
and a macroscopic escape property
but such axioms are too weak for analysis at the microscopic scale, and in particular in establishing centrality of the element closest to the identity.
Another way to proceed is to build a norm that is specifically designed to obey the crucial escape property. Given an approximate group in a group
, and an element
of
, we can define the escape norm
of
by the formula
Thus, equals
if
lies outside of
, equals
if
lies in
but
lies outside of
, and so forth. Such norms had already appeared in Notes 4, in the context of analysing NSS groups.
As it turns out, this expression will obey an escape axiom, as long as we place some additional hypotheses on which we will present shortly. However, it need not actually be a norm; in particular, the triangle inequality
is not necessarily true. Fortunately, it turns out that by a (slightly more complicated) version of the Gleason machinery from Notes 4 we can establish a usable substitute for this inequality, namely the quasi-triangle inequality
where is a constant independent of
. As we shall see, these estimates can then be used to obtain a commutator estimate (2).
However, to do all this, it is not enough for to be an approximate group; it must obey two additional “trapping” axioms that improve the properties of the escape norm. We formalise these axioms (somewhat arbitrarily) as follows:
Definition 1 (Strong approximate group) Let
. A strong
-approximate group is a finite
-approximate group
in a group
with a symmetric subset
obeying the following axioms:
An ultra strong
-approximate group is an ultraproduct
of strong
-approximate groups.
The first trapping condition can be rewritten as
and the second trapping condition can similarly be rewritten as
This makes the escape norms of , and
comparable to each other, which will be needed for a number of reasons (and in particular to close a certain bootstrap argument properly). Compare this with equation (12) from Notes 4, which used the NSS hypothesis to obtain similar conclusions. Thus, one can view the strong approximate group axioms as being a sort of proxy for the NSS property.
Example 1 Let
be a large natural number. Then the interval
in the integers is a
-approximate group, which is also a strong
-approximate group (setting
, for instance). On the other hand, if one places
in
rather than in the integers, then the first trapping condition is lost and one is no longer a strong
-approximate group. Also, if one remains in the integers, but deletes a few elements from
, e.g. deleting
from
), then one is still a
-approximate group, but is no longer a strong
-approximate group, again because the first trapping condition is lost.
A key consequence of the Hrushovski Lie model theorem is that it allows one to replace approximate groups by strong approximate groups:
Exercise 1 (Finding strong approximate groups)
- (i) Let
be an ultra approximate group with a good Lie model
, and let
be a symmetric convex body (i.e. a convex open bounded subset) in the Lie algebra
. Show that if
is a sufficiently small standard number, then there exists a strong ultra approximate group
with
and with
can be covered by finitely many left translates of
. Furthermore,
is also a good model for
.
- (ii) If
is a finite
-approximate group, show that there is a strong
-approximate group
inside
with the property that
can be covered by
left translates of
. (Hint: use (i), Hrushovski’s Lie model theorem, and a compactness and contradiction argument.)
The need to compare the strong approximate group to an exponentiated small ball will be convenient later, as it allows one to easily use the geometry of
to track various aspects of the strong approximate group.
As mentioned previously, strong approximate groups exhibit some of the features of NSS locally compact groups. In Notes 4, we saw that the escape norm for NSS locally compact groups was comparable to a Gleason metric. The following theorem is an analogue of that result:
Theorem 2 (Gleason lemma) Let
be a strong
-approximate group in a group
.
- (Symmetry) For any
, one has
.
- (Conjugacy bound) For any
, one has
.
- (Triangle inequality) For any
, one has
.
- (Escape property) One has
whenever
.
- (Commutator inequality) For any
, one has
.
The proof of this theorem will occupy a large part of the current set of notes. We then aim to use this theorem to classify strong approximate groups. The basic strategy (temporarily ignoring a key technical issue) follows the Bieberbach-Frobenius proof of Jordan’s theorem, as given in Notes 0, is as follows.
- Start with an (ultra) strong approximate group
.
- From the Gleason lemma, the elements with zero escape norm form a normal subgroup of
. Quotient these elements out. Show that all non-identity elements will have positive escape norm.
- Find the non-identity element
in (the quotient of)
of minimal escape norm. Use the commutator estimate (assuming it is inherited by the quotient) to show that
will centralise (most of) this quotient. In particular, the orbit
is (essentially) a central subgroup of
.
- Quotient this orbit out; then find the next non-identity element
in this new quotient of
. Again, show that
is essentially a central subgroup of this quotient.
- Repeat this process until
becomes entirely trivial. Undoing all the quotients, this should demonstrate that
is virtually nilpotent, and that
is essentially a coset nilprogression.
There are two main technical issues to resolve to make this strategy work. The first is to show that the iterative step in the argument terminates in finite time. This we do by returning to the Lie model theorem. It turns out that each time one quotients out by an orbit of an element that escapes, the dimension of the Lie model drops by at least one. This will ensure termination of the argument in finite time.
The other technical issue is that while the quotienting out all the elements of zero escape norm eliminates all “torsion” from (in the sense that the quotient of
has no non-trivial elements of zero escape norm), further quotienting operations can inadvertently re-introduce such torsion. This torsion can be re-eradicated by further quotienting, but the price one pays for this is that the final structural description of
is no longer as strong as “virtually nilpotent”, but is instead a more complicated tower alternating between (ultra) finite extensions and central extensions.
Example 2 Consider the strong
-approximate group
in the integers, where
is a large natural number not divisible by
. As
is torsion-free, all non-zero elements of
have positive escape norm, and the nonzero element of minimal escape norm here is
(or
). But if one quotients by
,
projects down to
, which now has torsion (and all elements in this quotient have zero escape norm). Thus torsion has been re-introduced by the quotienting operation. (A related observation is that the intersection of
with
is not a simple progression, but is a more complicated object, namely a generalised arithmetic progression of rank two.)
To deal with this issue, we will not quotient out by the entire cyclic group generated by the element
of minimal escape norm, but rather by an arithmetic progression
, where
is a natural number comparable to the reciprocal
of the escape norm, as this will be enough to cut the dimension of the Lie model down by one without introducing any further torsion. Of course, this cannot be done in the category of global groups, since the arithmetic progression
will not, in general, be a group. However, it is still a local group, and it turns out that there is an analogue of the quotient space construction in local groups. This fixes the problem, but at a cost: in order to make the inductive portion of the argument work smoothly, it is now more natural to place the entire argument inside the category of local groups rather than global groups, even though the primary interest in approximate groups
is in the global case when
lies inside a global group. This necessitates some technical modification to some of the preceding discussion (for instance, the Gleason-Yamabe theorem must be replaced by the local version of this theorem, due to Goldbring); details can be found in this recent paper of Emmanuel Breuillard, Ben Green, and myself, but will only be sketched here.
In the previous set of notes, we introduced the notion of an ultra approximate group – an ultraproduct of finite
-approximate groups
for some
independent of
, where each
-approximate group
may lie in a distinct ambient group
. Although these objects arise initially from the “finitary” objects
, it turns out that ultra approximate groups
can be profitably analysed by means of infinitary groups
(and in particular, locally compact groups or Lie groups
), by means of certain models
of
(or of the group
generated by
). We will define precisely what we mean by a model later, but as a first approximation one can view a model as a representation of the ultra approximate group
(or of
) that is “macroscopically faithful” in that it accurately describes the “large scale” behaviour of
(or equivalently, that the kernel of the representation is “microscopic” in some sense). In the next section we will see how one can use “Gleason lemma” technology to convert this macroscopic control of an ultra approximate group into microscopic control, which will be the key to classifying approximate groups.
Models of ultra approximate groups can be viewed as the multiplicative combinatorics analogue of the more well known concept of an ultralimit of metric spaces, which we briefly review below the fold as motivation.
The crucial observation is that ultra approximate groups enjoy a local compactness property which allows them to be usefully modeled by locally compact groups (and hence, through the Gleason-Yamabe theorem from previous notes, by Lie groups also). As per the Heine-Borel theorem, the local compactness will come from a combination of a completeness property and a local total boundedness property. The completeness property turns out to be a direct consequence of the countable saturation property of ultraproducts, thus illustrating one of the key advantages of the ultraproduct setting. The local total boundedness property is more interesting. Roughly speaking, it asserts that “large bounded sets” (such as or
) can be covered by finitely many translates of “small bounded sets”
, where “small” is a topological group sense, implying in particular that large powers
of
lie inside a set such as
or
. The easiest way to obtain such a property comes from the following lemma of Sanders:
Lemma 1 (Sanders lemma) Let
be a finite
-approximate group in a (global) group
, and let
. Then there exists a symmetric subset
of
with
containing the identity such that
.
This lemma has an elementary combinatorial proof, and is the key to endowing an ultra approximate group with locally compact structure. There is also a closely related lemma of Croot and Sisask which can achieve similar results, and which will also be discussed below. (The locally compact structure can also be established more abstractly using the much more general methods of definability theory, as was first done by Hrushovski, but we will not discuss this approach here.)
By combining the locally compact structure of ultra approximate groups with the Gleason-Yamabe theorem, one ends up being able to model a large “ultra approximate subgroup”
of
by a Lie group
. Such Lie models serve a number of important purposes in the structure theory of approximate groups. Firstly, as all Lie groups have a dimension which is a natural number, they allow one to assign a natural number “dimension” to ultra approximate groups, which opens up the ability to perform “induction on dimension” arguments. Secondly, Lie groups have an escape property (which is in fact equivalent to no small subgroups property): if a group element
lies outside of a very small ball
, then some power
of it will escape a somewhat larger ball
. Or equivalently: if a long orbit
lies inside the larger ball
, one can deduce that the original element
lies inside the small ball
. Because all Lie groups have this property, we will be able to show that all ultra approximate groups
“essentially” have a similar property, in that they are “controlled” by a nearby ultra approximate group which obeys a number of escape-type properties analogous to those enjoyed by small balls in a Lie group, and which we will call a strong ultra approximate group. This will be discussed in the next set of notes, where we will also see how these escape-type properties can be exploited to create a metric structure on strong approximate groups analogous to the Gleason metrics studied in previous notes, which can in turn be exploited (together with an induction on dimension argument) to fully classify such approximate groups (in the finite case, at least).
There are some cases where the analysis is particularly simple. For instance, in the bounded torsion case, one can show that the associated Lie model is necessarily zero-dimensional, which allows for a easy classification of approximate groups of bounded torsion.
Some of the material here is drawn from my recent paper with Ben Green and Emmanuel Breuillard, which is in turn inspired by a previous paper of Hrushovski.

Recent Comments