Bridson’s Universe of Finitely Presented Groups

This introductory post is based on parts of Martin Bridson’s 2006 ICM article.

Presentations, Cayley graphs, and word metrics

To a topologist’s eye, a finite presentation

\displaystyle \langle A \mid R \rangle \ = \ \langle a_1, \ldots, a_m \mid r_1, \ldots, r_n \rangle

for a group {\Gamma} is an encoding of a finite 2-dimensional complex {K} known as the presentation 2-complex — a complex with a single vertex, a directed edge for each {a_i}, and a face for each {r_j} — a reading of {r_j} giving that face’s attaching map.

presentation 2-complex

For example, as shown below, {K} is a figure-eight when {\Gamma} is {F_2 = \langle a,b \mid \rangle}, is a torus when {\Gamma} is {\mathbb{Z}^2 = \langle a,b \mid a^{-1}b^{-1}ab \rangle}, and is the genus-2 surface when {\Gamma} is the surface group {\langle a,b,c,d \mid a^{-1}b^{-1}abc^{-1}d^{-1}cd \rangle}.

examples of presentation 2-complexes

By the Seifert-van Kampen Theorem, {\Gamma = \pi_1 (K)}. So {\Gamma} appears in a geometric guise as the deck transformations of the universal cover {\widetilde{K}}, known asthe Cayley 2-complex. Here is {\widetilde{K}} for the three examples.

Three examples of Cayley graphs

The 1-skeleton of {\widetilde{K}} is the Cayley graph {C_A(\Gamma)}, and the {0}-skeleton can be identified with {\Gamma}. The edges of {C_A(\Gamma)} inherit directions and labels from {K}, so we recover what is perhaps the more elementary definition of {C_A(\Gamma)}: the graph with vertex set {\Gamma} and, for every {a_i \in A} and {\gamma \in \Gamma}, a directed edge labeled by {a_i} from {\gamma} to {\gamma a_i}.

The standard path metric on {C_A(\Gamma)} in which each edge has length one, agrees with the word metric on {\Gamma} — that for which {d(\gamma_1, \gamma_2)} is the length of the shortest word on the generators {A} and their inverses that represents {{\gamma_{1}}^{-1} \gamma_2}.

Two key themes of Geometric Group Theory

  1. Groups act! One tries to extract information about a group {\Gamma} from the features of a space {X} on which it acts — information depending heavily on the quality of the action and the richness of the space in question. The space may be a complex such as {\widetilde{K}}. It may be the universal cover of a closed Riemannian manifold with fundamental group {\Gamma}. It may be a {\Gamma} itself, which brings us to —
  2. Groups are geometric objects. This is already apparent in our discussion — a finitely generated group has a word metric and so is a space… a diffuse cloud of points, perhaps, but when viewed coarsely or on a large-scale, it displays intrinsic and often rich geometry.

Word metrics and Cayley graphs are defined using choices of generating sets. But those choices are downplayed in our large-scale perspective in a manner made precise by the following equivalence relation, quasi–isometry, on metric spaces.

Suppose {\lambda \geq 1} and {\mu \geq 0}. A map {f: X \rightarrow Y} between metric spaces is a {(\lambda, \mu)}quasi-isometric embedding when, for all {a,b \in X},

\displaystyle \frac{1}{\lambda} d(a,b) - \mu \ \leq \ d(f(a), f(b)) \ \leq \ \lambda d(a,b) + \mu

— that is, the map allows for a bounded amount of stretching and tearing. We say {f} is a {(\lambda, \mu)}quasi-isometry when, in addition, it is {\mu}quasi-onto, i.e. the {\mu}–neighbourhood of {f(X)} is {Y}. Two metric spaces are quasi–isometric when there is some quasi–isometry between them. Pertinent examples of quasi–isometries include:

  1. For a group {\Gamma} with finite generating set {A}, the Cayley graph {C_A(\Gamma)} is quasi–isometric to {\Gamma} with the word metric associated to {A}.
  2. The word metrics associated to any two finite generating sets for a group, yield quasi-isometric metric spaces.
  3. Finitely generated groups are quasi–isometric to their finite–index subgroups.

Two groups are commensurable when they have finite index subgroups that are isomorphic. So, finitely generated commensurable groups are quasi–isometric.

Bridson’s map

Bridson imagines mapping the finitely presented groups up to commensurability. The image is reproduced from Martin Bridson’s 2006 ICM article, except an extract from the c. 1430AD “Borgia map” has been inserted in place of a lion in the original, in keeping with the title of this blog.

Bridson's universe of finitely presented groups

Key: Ab — abelian, Nilp — nilpotent, PC — polycyclic, Solv — solvable, EA — elementary amenable, F = free, EF — elementarily free, {\mathcal{L}} — limit, Hyp — hyperbolic, {\mathcal{C}_0} — CAT(0), SH — semi-hyperbolic, Aut — automatic, IP(2) — quadratic isoperimetric inequality, Comb — combable, Asynch — asynchronously combable, vNT — the von Neumann–Tits line. The question marks indicate regions for which it is unknown whether any groups are present.

The map begins with the finite groups — all are commensurable with the trivial group and so are represented by a single point. Next is {{\mathbb Z}}, which is surely the most elementary infinite group. From there, Bridson envisages setting out to chart the land in two directions.

Taking a path which favours commutativity, one finds {{\mathbb Z}} in the corner of the abelian groups, which are a municipality of the nilpotent groups, itself in the town of polycyclic groups, and in the city of solvable groups — extending successively further along what it seems appropriate to call the amenable coastline.

Alternatively, turning away from commutativity, one sets out along the coastline of non–positive curvature. We will survey the classes of groups found there in more detail in a future post, but here’s a brief description. Moving away from {{\mathbb Z}} we first encounter the finite rank free groups. (This only adds {F_2} as all those of rank at least 2 are commensurable, but please bear with us). Free groups display tree-like geometry — that is, infinite negative curvature. As such they generalise to hyperbolic groups — negatively curved groups in a strong sense (more on which to follow). Then, relaxing to non-positively curved, one has the CAT(0) groups (that is, groups that act properly cocompactly on CAT(0) spaces). Then the landscape proceeds into regions which represent different ways of drawing out intrinsically group theoretic consequences of the definition of CAT(0) groups — semi-hyperbolic groupsautomatic groups, groups enjoying quadratic isoperimetric functionscombable groupsbicombable groupsasynchronously combable groups, etc..

So, what lies midway between these two coastlines? Close to {{\mathbb Z}}, various classes reach from coast to coast: all the non-positively curved classes include the abelian groups; and there are nilpotent groups of all classes in IP(2) (Young). Sela’s limit groups are another class that deserves to be included — they are an enclave of the CAT(0) groups (Alibegovic and Bestvina) around {{\mathbb Z}}; roughly speaking, they are those groups with Cayley graphs that are limits of Cayley graphs of free groups. They include free groups, abelian groups and many surface groups. Remarkably they can be characterised as the finitely generated groups that have the same first order existential theory as a free group (Remeslennikov, Sibirsk. Mat. Zh., 30 (1989), 193–197). The subclass, elementarily free groups, are those that have the same elementary theory as a free group.

The von Neumann–Tits line runs between the two coasts: all the groups below it contain {F_2} subgroups, all above do not.

But there remain expanses of wilderness where, thanks to Higman’s Embedding Theorem and the like, one might say “Here there be dragons!” And, as will become apparent in this blog, these dragons do not keep themselves to the distant wildernesses. They venture into the pastures of non-positive curvature, showing themselves in subgroup structure.


About berstein

berstein is the name under which participants in the Berstein Seminar - a mathematics seminar at Cornell - are blogging.
This entry was posted in Uncategorized. Bookmark the permalink.

2 Responses to Bridson’s Universe of Finitely Presented Groups

  1. Henry Wilton says:

    I just noticed one place in which Martin’s map can be updated. Limit groups are all automatic – indeed, this was known at the time of the 2006 ICM!

  2. berstein says:

    Thanks, Henry! Courtesy of a paper by you and Groves here are details of the reference: “It follows from work of Rebbechi [Algorithmic properties of relatively hyperbolic groups, Thesis, 2003, ArXiv: math/0302245] that limit groups are biautomatic.”

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 )

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s