The monster group

Serena Yuan
2015-03-10

1
1.1

Expanders
Lemma

Let = (n )nN be a family of graphs. If (j) denotes the graph obtained by

subdivision of each edge of into j new edges, then
(j)
1 (n ) 1j(2 n ) and b((j) ) b()
j ,
then
(j)
(j)
girth n = jgirthn and diam n = jdiamn .

1.2

the monster

We are now ready to apply the theorem of random lacunary hyperbolic groups
to a non-elementary torsion-free hyperbolic group G generated by a set S of k
generators and to a specific expander from the preceding section: a constant
|b+ln|
> 0 is given by Kazhdans property T and = 2ln(2k1)
.

1.3

Theorem.

Let 0 < p < 1. There exists an infinite sequence of integers I = {ni } N such
that with probability at least p, the group GI () is infinite and the image of
the graph ni in the Cayley graph of GI () satisfies
girth
r0
|fni (x) fni (y)| diamnni 3202sinhr
( |x y| ni )
0 2
where ni = l(girthni ) + 0 girthni .
The group above is the Gromov monster; it contains a coarse image of an
expander.

1.4

Theorem .

Let = (n )nN be an expander. Suppose there is a 1-Lipschitz map from to

a Hilbert space H. Then there exist two sequences of points xn , yn in n at a
distance at least ln(cardn ) with images at a uniformly bounded distance in H.