You are currently browsing the tag archive for the ‘strongly bounded’ tag.

Before looking for surface subgroups, it is worth thinking about how to find (or rule out the existence of) simpler classes of subgroups. This is a very general question, and I do not intend to give a complete survey; however, it is instructive to build up to the question of surface subgroups incrementally and to catalog some of the interesting examples and counterexamples along the way.

**Question**: When is a group infinite?

Already this question is more than hard enough. But first we must examine some unstated assumptions behind the question. We have some group in mind, and want to know whether it is infinite or not. But in what sense do we “have” the group ? There are several things we might mean by this, including:

- An explicit group given by generators and relations; i.e. .
- A group given together with an action on a set .
- A group not uniquely defined, but described implicitly in terms of its properties (e.g. is amenable, or left-orderable, or has property , or is linear, or is residually , or is a -manifold group, or is finitely presented, or satisfies a law, etc.).

In general, it is hard to learn much about a group from a presentation. However, sometimes one can have some success:

**Example**: If is given by a finite presentation , the *deficiency* of the presentation is the difference between the number of generators and the number of relators; i.e. . The *deficiency* of is the maximum of the deficiency of all finite presentations. In practice, it is very difficult to determine the deficiency of a group, but trivial to determine the deficiency of a given presentation. The rank of the abelianization of (i.e. the rank of ) is at least as big as the deficiency; hence if the deficiency is positive, is infinite, and in fact contains a copy of .

**Example**: Daniel Allcock observed that one can do better when some of the relators as above are proper powers. Geometrically, a relator of order counts as only “ of a relator” for the purposes of computing the rank of . Explicitly, Allcock shows that if is a group with a presentation of the form then if is a normal subgroup of of index and for each index , one has for then the rank of the abelianization of is at least . If this rank is positive, then is infinite, and therefore so is .

**Example**: A much more subtle example is the famous Golod-Shafarevich inequality. Let be a finite -group (i.e. a group in which every element is torsion, with order a power of ). Let be the minimum number of generators of , and the number of relations between these generators in the corresponding free pro--group (if denotes the minimum number of relations defining as a discrete group then ). The G-S inequality is the inequality . In particular, if is a nontrivial pro--group for which (or which implies it) then is infinite. This inequality enabled Golod to give a negative answer to the generalized Burnside’s problem, by showing that for each prime there is an infinite group generated by three elements, in which every element has order a power of .

**Example**: Marc Lackenby has made very nice use of the Golod-Shafarevich inequality in his work on Kleinian groups with finite non-cyclic subgroups. A* Kleinian group* is a finitely generated discrete subgroup of the group of isometries of hyperbolic -space; such a group is the fundamental group of a hyperbolic -orbifold. Marc shows that if a Kleinian group contains a finite non-cyclic subgroup, then is finite, or virtually free, or contains a closed surface subgroup. The argument is very interesting and delicate, and I hope to return to it in a later post. But for the moment I just want to remark that the form of the G-S inequality Marc uses is as follows. Let be a group with a finite presentation . Let denote the dimension of where is a prime. If then is infinite.

**Example**: Another way to show a group is infinite is if the relators are very long. This is the method of *small cancellation theory*, and can be implemented in many different ways. From the modern perspective, a group presentation satisfies a small cancellation condition if one can build a -complex from the presentation which is manifestly non-positively curved in some explicit sense. For example, if is a symmetrized presentation (i.e. one in which elements of are cyclically reduced, and is closed under taking cyclic permutations and inverses), a *piece* is a word in the generators if there are distinct relations in . If no relation is a product of fewer than pieces, one says that satisfies the small cancellation condition . So, for example, if is , one can build a -complex presenting built from polygons, each of which has at least sides, and is non-positively curved (and therefore is infinite).

**Example**: Instead of showing that a particular group is infinite, one can show that certain groups whose presentations are obtained by a statistical process, are infinite *with overwhelming probability*. Yann Ollivier wrote an introduction to Gromov’s theory of *Random Groups*, in which it is made precise what one means by a “random group”, and many important properties of such groups are delineated. There is a parameter in the theory which governs the density of relations added to a generating set to determine the random group. The most striking aspect of the theory (in my opinion) is the existence of a phase transition. Gromov showed that if is a random group at density then if , with overwhelming probability, is infinite, hyperbolic, torsion-free and of geometric dimension (i.e. it is not free, but admits a -dimensional ). However, if , with overwhelming probability, is either trivial or .

**Example**: A group which admits a finite dimensional is torsion-free, and therefore either trivial or infinite. This follows from the fact that the ‘s are the infinite dimensional Lens spaces, which have nontrivial homology in infinitely many dimensions, together with elementary covering space theory. This example begs the question: how do you tell if a group has a finite dimensional ? Well, one way is to exhibit a free, properly discontinuous action of on a finite dimensional contractible space; of course, given such an action, it is probably easier to directly find elements in of infinite order.

**Example**: A function is said to be a *length function* if it satisfies , if it is symmetric (i.e. for all ) and if it is subadditive: . A group is said to be *strongly bounded* if every length function on is bounded. The strongly bounded property was introduced by George Bergman in this paper. A countable group is strongly bounded if and only if it is finite (the fact that finite groups are strongly bounded is obvious). Moreover, a group which admits an unbounded length function is evidently infinite. However, it turns out that there are many interesting uncountable but strongly bounded groups! Bergman showed that the group of permutations of any set is strongly bounded. Yves de Cornulier, in an appendix to a paper of mine with Mike Freedman, showed that the same is true for , the group of homeomorphisms of an -sphere.

**Example**: One of the most spectacular proofs of the finiteness of a (certain class of) group(s) is Margulis’ proof of the normal subgroup theorem, which says that if is a lattice in a higher rank Lie group, then every normal subgroup in is either finite, or of finite index. The proof has three steps: first, one shows that if is infinite, then is amenable. Second, since has property , the same is true for . Third, an amenable group with property is finite. The second and third steps are not very complicated: a group has property if the trivial representation is isolated in the space of all irreducible unitary representations, in a certain topology. A quotient of a group by a closed normal subgroup certainly has no more unitary representations than the original group itself, so the second step is not hard to show. An amenable group has almost invariant vectors in ; since it has property , it has an invariant vector in ; but this implies that is finite. So the hard part is to show that is amenable. This is done using what is now known as *boundary theory*, and is described in Chapter VI of Margulis’ book.

I would be curious to hear other people’s favorite tricks/techniques to show that a group is or is not infinite.

## Recent Comments