<<

Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions

Lecture 4, Geometric and asymptotic theory

Olga Kharlampovich

NYC, Sep 16

1 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions

The universal property of free groups allows one to describe arbitrary groups in terms of generators and relators. Let G be a group with a generating set S. By the universal property of free groups there exists a homomorphism ϕ: F (S) → G such that ϕ(s) = s for s ∈ S. It follows that ϕ is onto, so by the first isomorphism theorem

G ' F (S)/ker(ϕ).

In this event ker(ϕ) is viewed as the set of relators of G, and a group w ∈ ker(ϕ) is called a relator of G in generators S. If a subset R ⊂ ker(ϕ) generates ker(ϕ) as a normal of F (S) then it is termed a set of defining relations of G relative to S.

2 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions

The pair hS | Ri is called a presentation of G, it determines G uniquely up to isomorphism. The presentation hS | Ri is finite if both sets S and R are finite. A group is finitely presented if it has at least one finite presentation. Presentations provide a universal method to describe groups. Example of finite presentations

1 G = hs1,..., sn | [si , sj ], ∀1 ≤ i < j ≤ ni is the free abelian group of rank n. n 2 Cn = hs | s = 1i is the of n. 3 Both presentations ha, b | ba2b−1a−3i and ha, b | ba2b−1a−3, [bab−1, a3]i define the Baumslag-Solitar group BS(2, 3) (HWP7 Prove that these presentations define isomorphic groups).

3 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions If a group G is defined by a presentation, then one can try to find homomorphisms from G into other groups. Lemma Let G = hS | Ri be a group defined by a (finite) presentation with the set of relators R = {r = y (j) ... y (j) | y (j) ∈ S±1, 1 ≤ j ≤ m}, j i1 ij i and let H be an arbitrary group. A map ψ : S±1 → H extends to a homomorphism ψ˜: G → H, if and only if ψ(r ) = ψ(y (j)) . . . ψ(y (j)) = 1 in H for all r ∈ R. j i1 ij j

Proof Define the map ψ˜: G → H by ˜ ψ(yn1 ... ynt ) = ψ(yn1 ) . . . ψ(ynt ), ±1 ˜ whenever yni ∈ S . If ψ is a homomorphism, then obviously ψ˜(rj ) = 1 for all rj ∈ R. 4 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions The converse follows from Lemma (Mapping property of quotient groups) Let N be a normal subgroup of G, let G = G/N, and let π : G → G be the canonical map, π(g) =g ¯ = gN. Let φ : G → G 0 be a homomorphism such that N ≤ Ker(φ). Then there is a unique homomorphism φ : G → G 0 such that φ ◦ π = φ. This map is defined by the rule φ(¯g) = φ(g).

π G → G φ & ↓ φ G 0

5 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions

Let G be a group, by the commutant (or derived subgroup) G 0 of G we mean the subgroup generated by all the commutators [g, b] = gbg −1b−1 in G. Since a[g, b]a−1 = [aga−1, aba−1], the commutant is a normal subgroup of G. The quotient G/G 0 is called the abelianization of G. G/G 0 is an . For example, the abelianization of a Fn is the free abelian group of rank n. In general, if

G = hs1,..., sn | r1,..., rmi, then 0 G/G = hs1,..., sn | r1,..., rm, [si , sj ](1 ≤ i < j ≤ n)i

6 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions

As the following corollary shows, the abelianization G/G 0 is the largest abelian quotient of G, in a sense. Corollary

Let H be an abelian quotient of G, and let ν : G → G/G 0 and ψ : G → H be the natural homomorphisms. Then there is a homomorphism ϕ: G/G 0 → H so that the following diagram commutes:

G → G/G 0 ψ & ↓ ϕ H

7 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions

Proof. 0 Let G be generated by S = {s1,..., sn}, then G/G is generated by ν(S) = {ν(s1), . . . , ν(sn)}. We still denote ν(si ) by si , since we want to fix the alphabet S±1 for both G and G/G 0. Hence, G/G 0 has the presentation above. Define a map ϕ0 : ν(S) → H by 0 0 ϕ (si ) = ψ(si ) for all i. Observe that ϕ (rj ) = ψ(rj ) = 1 in H, since ψ is a homomorphism and rj = 1 in G. Also, 0 ϕ ([si , sj ]) = ψ([si , sj ]) = [ψ(si ), ψ(sj )] = 1, since H is abelian. It follows now from the previous lemma that the map ϕ0 extends to a homomorphism from G/G 0 to H.

8 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions More groups given by generators and relations

The free Burnside group of exponent n with two generators is given by the presentation

ha, b | un = 1i

for all words u in the alphabet a, b. The fundamental group of the orientable surface of genus n is given by the presentation

ha1, b1, ..., an, bn | [a1, b1]...[an, bn] = 1i.

9 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions More groups given by generators and relations

The free Burnside group of exponent n with two generators is given by the presentation

ha, b | un = 1i

for all words u in the alphabet a, b. The fundamental group of the orientable surface of genus n is given by the presentation

ha1, b1, ..., an, bn | [a1, b1]...[an, bn] = 1i.

9 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions More groups given by generators and relations

The free Burnside group of exponent n with two generators is given by the presentation

ha, b | un = 1i

for all words u in the alphabet a, b. The fundamental group of the orientable surface of genus n is given by the presentation

ha1, b1, ..., an, bn | [a1, b1]...[an, bn] = 1i.

9 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions More groups given by generators and relations

The free Burnside group of exponent n with two generators is given by the presentation

ha, b | un = 1i

for all words u in the alphabet a, b. The fundamental group of the orientable surface of genus n is given by the presentation

ha1, b1, ..., an, bn | [a1, b1]...[an, bn] = 1i.

9 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions More groups given by generators and relations

The free Burnside group of exponent n with two generators is given by the presentation

ha, b | un = 1i

for all words u in the alphabet a, b. The fundamental group of the orientable surface of genus n is given by the presentation

ha1, b1, ..., an, bn | [a1, b1]...[an, bn] = 1i.

9 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions More groups given by generators and relations

The free Burnside group of exponent n with two generators is given by the presentation

ha, b | un = 1i

for all words u in the alphabet a, b. The fundamental group of the orientable surface of genus n is given by the presentation

ha1, b1, ..., an, bn | [a1, b1]...[an, bn] = 1i.

9 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions More groups given by generators and relations

The free Burnside group of exponent n with two generators is given by the presentation

ha, b | un = 1i

for all words u in the alphabet a, b. The fundamental group of the orientable surface of genus n is given by the presentation

ha1, b1, ..., an, bn | [a1, b1]...[an, bn] = 1i.

9 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions More groups given by generators and relations

The free Burnside group of exponent n with two generators is given by the presentation

ha, b | un = 1i

for all words u in the alphabet a, b. The fundamental group of the orientable surface of genus n is given by the presentation

ha1, b1, ..., an, bn | [a1, b1]...[an, bn] = 1i.

9 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Group presentations

The object of study in - finitely generated groups given by presentations ha1, ..., an | r1, r2, ...i, where ri is a word in a1, ..., an. That is groups generated by a1, ..., an with relations r1 = 1, r2 = 1, ... imposed.

10 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Group presentations

The object of study in Geometric Group Theory- finitely generated groups given by presentations ha1, ..., an | r1, r2, ...i, where ri is a word in a1, ..., an. That is groups generated by a1, ..., an with relations r1 = 1, r2 = 1, ... imposed.

10 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Group presentations

The object of study in Geometric Group Theory- finitely generated groups given by presentations ha1, ..., an | r1, r2, ...i, where ri is a word in a1, ..., an. That is groups generated by a1, ..., an with relations r1 = 1, r2 = 1, ... imposed.

10 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Group presentations

The object of study in Geometric Group Theory- finitely generated groups given by presentations ha1, ..., an | r1, r2, ...i, where ri is a word in a1, ..., an. That is groups generated by a1, ..., an with relations r1 = 1, r2 = 1, ... imposed.

10 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

Theorem. (Boone-Novikov’s solution of Dehn’s problem) There exists a finitely presented group with undecidable word problem. Theorem. (Higman) A group has recursively enumerable word problem iff it is a subgroup of a finitely presented group. Theorem. (Adian-Novikov’s solution of ) The free Burnside group of exponent n with at least two generators is infinite for large enough odd n. It is still unknown if such a group is infinite for n = 5, 8 etc

11 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

Theorem. (Boone-Novikov’s solution of Dehn’s problem) There exists a finitely presented group with undecidable word problem. Theorem. (Higman) A group has recursively enumerable word problem iff it is a subgroup of a finitely presented group. Theorem. (Adian-Novikov’s solution of Burnside problem) The free Burnside group of exponent n with at least two generators is infinite for large enough odd n. It is still unknown if such a group is infinite for n = 5, 8 etc

11 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

Theorem. (Boone-Novikov’s solution of Dehn’s problem) There exists a finitely presented group with undecidable word problem. Theorem. (Higman) A group has recursively enumerable word problem iff it is a subgroup of a finitely presented group. Theorem. (Adian-Novikov’s solution of Burnside problem) The free Burnside group of exponent n with at least two generators is infinite for large enough odd n. It is still unknown if such a group is infinite for n = 5, 8 etc

11 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

Theorem. (Boone-Novikov’s solution of Dehn’s problem) There exists a finitely presented group with undecidable word problem. Theorem. (Higman) A group has recursively enumerable word problem iff it is a subgroup of a finitely presented group. Theorem. (Adian-Novikov’s solution of Burnside problem) The free Burnside group of exponent n with at least two generators is infinite for large enough odd n. It is still unknown if such a group is infinite for n = 5, 8 etc

11 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

Theorem. (Boone-Novikov’s solution of Dehn’s problem) There exists a finitely presented group with undecidable word problem. Theorem. (Higman) A group has recursively enumerable word problem iff it is a subgroup of a finitely presented group. Theorem. (Adian-Novikov’s solution of Burnside problem) The free Burnside group of exponent n with at least two generators is infinite for large enough odd n. It is still unknown if such a group is infinite for n = 5, 8 etc

11 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

Theorem. (Boone-Novikov’s solution of Dehn’s problem) There exists a finitely presented group with undecidable word problem. Theorem. (Higman) A group has recursively enumerable word problem iff it is a subgroup of a finitely presented group. Theorem. (Adian-Novikov’s solution of Burnside problem) The free Burnside group of exponent n with at least two generators is infinite for large enough odd n. It is still unknown if such a group is infinite for n = 5, 8 etc

11 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

Theorem. (Boone-Novikov’s solution of Dehn’s problem) There exists a finitely presented group with undecidable word problem. Theorem. (Higman) A group has recursively enumerable word problem iff it is a subgroup of a finitely presented group. Theorem. (Adian-Novikov’s solution of Burnside problem) The free Burnside group of exponent n with at least two generators is infinite for large enough odd n. It is still unknown if such a group is infinite for n = 5, 8 etc

11 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

Theorem. (Boone-Novikov’s solution of Dehn’s problem) There exists a finitely presented group with undecidable word problem. Theorem. (Higman) A group has recursively enumerable word problem iff it is a subgroup of a finitely presented group. Theorem. (Adian-Novikov’s solution of Burnside problem) The free Burnside group of exponent n with at least two generators is infinite for large enough odd n. It is still unknown if such a group is infinite for n = 5, 8 etc

11 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

The growth rate of a group is a well-defined notion from asymptotic analysis. To say that a finitely generated group has polynomial growth means the number of elements of length (relative to a symmetric generating set) at most n is bounded above by a polynomial function p(n). The order of growth is then the least degree of any such polynomial function p. A nilpotent group G is a group with a lower central series terminating in the identity subgroup. Theorem. (Gromov’s solution of Milnor’s problem) Any group of polynomial growth has a nilpotent subgroup of finite index.

12 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

The growth rate of a group is a well-defined notion from asymptotic analysis. To say that a finitely generated group has polynomial growth means the number of elements of length (relative to a symmetric generating set) at most n is bounded above by a polynomial function p(n). The order of growth is then the least degree of any such polynomial function p. A nilpotent group G is a group with a lower central series terminating in the identity subgroup. Theorem. (Gromov’s solution of Milnor’s problem) Any group of polynomial growth has a nilpotent subgroup of finite index.

12 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

The growth rate of a group is a well-defined notion from asymptotic analysis. To say that a finitely generated group has polynomial growth means the number of elements of length (relative to a symmetric generating set) at most n is bounded above by a polynomial function p(n). The order of growth is then the least degree of any such polynomial function p. A nilpotent group G is a group with a lower central series terminating in the identity subgroup. Theorem. (Gromov’s solution of Milnor’s problem) Any group of polynomial growth has a nilpotent subgroup of finite index.

12 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

The growth rate of a group is a well-defined notion from asymptotic analysis. To say that a finitely generated group has polynomial growth means the number of elements of length (relative to a symmetric generating set) at most n is bounded above by a polynomial function p(n). The order of growth is then the least degree of any such polynomial function p. A nilpotent group G is a group with a lower central series terminating in the identity subgroup. Theorem. (Gromov’s solution of Milnor’s problem) Any group of polynomial growth has a nilpotent subgroup of finite index.

12 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Some classical results

The growth rate of a group is a well-defined notion from asymptotic analysis. To say that a finitely generated group has polynomial growth means the number of elements of length (relative to a symmetric generating set) at most n is bounded above by a polynomial function p(n). The order of growth is then the least degree of any such polynomial function p. A nilpotent group G is a group with a lower central series terminating in the identity subgroup. Theorem. (Gromov’s solution of Milnor’s problem) Any group of polynomial growth has a nilpotent subgroup of finite index.

12 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Homomorphisms of groups Quasi-isometry Limit groups Free actions Action of a group on a set

A group G acts on a set X if for each g ∈ G there is a bijection x → gx defined on X such that

ex = x, (g1(g2(x)) = (g1g2)(x).

13 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Finitely generated groups viewed as metric spaces

Let G be a group given as a quotient π : F (S) → G of the free group on a set S. Therefore G = hS|Ri. The word length |g| of an element g ∈ G is the smallest n for which there exists a −1 sequence s1,..., sn of elements in S ∪ S such that g = π(s1 ... sn). The word metric dS (g1, g2) is defined on G by

−1 dS (g1, g2) = |g1 g2|.

G acts on itself from the left by isometries.

14 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions

Note, that if S and S¯ are two finite generating sets of G then dS and dS¯ are bi-Lipschitz equivalent, namely ∃C∀g1, g2 ∈ G 1 ( C dS (g1, g2) ≤ dS¯ (g1, g2) ≤ CdS (g1, g2).)

15 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Polynomial growth

A ball of radius n in Cay(G, S) is

Bn = {g ∈ G||g| ≤ n}.

G has polynomial growth iff the number of elements in Bn is bounded by a polynomial p(n).

16 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Hyperbolic groups

A geodesic is called δ-hyperbolic if for every geodesic triangle, each edge is contained in the δ neighborhood of the union of the other two edges. If δ = 0 the space is called a real tree or R-tree. A group G is hyperbolic Cay(G, X ) is hyperbolic.

17 / 32

A finitely generated group is called hyperbolic if its Cayley graph is hyperbolic. Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Quasi-isometry

Definition Let (X , dX ) and (Y , dY ) be metric spaces. Given real numbers k ≥ 1 and C ≥ 0, a map f : X → Y is called a (k, C)-quasi-isometry if

1 1 k dX (x1, x2) − C ≤ dY (f (x1), f (x2)) ≤ kdX (x1, x2) + C for all x1, x2 ∈ X , 2 the C neighborhood of f (X ) is all of Y . Examples of quasi-isometries 1. (Z; d) and (R; d) are quasi-isometric. The natural of Z in R is isometry. It is not surjective, but each point of R is at most 1/2 away from Z.

18 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions All regular trees of valence at least 3 are quasi-isometric. We denote by Tk the regular tree of valence k and we show that T3 is quasi-isometric to Tk for every k ≥ 4. We define the map q : T3 → Tk , sending all edges drawn in thin lines isometrically onto edges and all paths of length k − 3 drawn in thick lines onto one vertex. The map q thus defined is surjective and it satisfies the inequality 1 dist(x, y) − 1 ≤ dist(q(x), q(y)) ≤ dist(x, y). k − 2

19 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions 3. Free groups of finite rank are quasi-isometric

All non-Abelian free groups of finite rank are quasi-isometric to each other. The Cayley graph of the free group of rank n with respect to a set of n generators and their inverses is the regular simplicial tree of valence 2n.

20 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions

4. Let G be a group with a finite generating set S, and let Cay(G, S) be the corresponding Cayley graph. We can make Cay(G, X ) into a metric space by identifying each edge with a unit interval [0, 1] in R and defining d(x, y) to be the length of the shortest path joining x to y. This coincides with the path-length metric when x and y are vertices. Since every point of Cay(G, X ) is in the 1/2 -neighbourhood of some vertex, we see that G and Cay(G, S) are quasi-isometric for this choice of d.

21 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Quasi-isometry

5. Every bounded metric space is quasi-isometric to a point. 6. If S and T are finite generating sets for a group G, then (G, dS ) and (G, dT ) are quasi-isometric. 7. The main example, which partly justifies the interest in quasi-isometries, is the following. Given M a compact Riemannian manifold, let M˜ be its universal covering and let π1(M) be its fundamental group. The group π1(M) is finitely generated, in fact even finitely presented. The metric space M˜ with the Riemannian metric is quasi-isometric to π1(M) with some word metric. 8. If G1 is a finite index subgroup of G, then G and G1 are quasi-isometrically equivalent (HW8).

22 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Quasi-isometric rigidity

Classes of groups K complete with respect to quasi-isometries (every group quasi-isometric to a group from K has a finite index subgroup in K) Finitely presented groups, Nilpotent groups, Abelian groups, Hyperbolic groups, nonabelian free groups of finite rank (follows from the fact that their Cayley graphs are trees). Amenable groups (see below)

23 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Quasi-isometric rigidity

Eskin, Fisher, Whyte obtained first results on quasi-isometric rigidity of non-nilpotent polycyclic groups. Theorem Any group quasi-isometric to the three dimensional solvable Lie group Sol is virtually a lattice in Sol. That completed the classification of three-dimensional manifolds up to quasi-isometry started by Thurston, Schwartz and others. Conjecture Let G be a solvable Lie group, and Γ a lattice in G . Any finitely generated group Γ0 quasi-isometric to Γ is virtually a lattice in a solvable Lie group G 0. Equivalently, any f.g. group quasi-isometric to a is virtually polycyclic.

24 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Limit groups (fully residually free groups)

A marked group (G, S) is a group G with a prescribed family of generators S = (s1,..., sn). 0 0 0 Two marked groups (G, (s1,..., sn)) and (G , (s1,..., sn)) are 0 isomorphic as marked groups if the bijection si ←→ si extends to an isomorphism. For example, (hai, (1, a)) and (hai, (a, 1)) are not isomorphic as marked groups. Denote by Gn the set of groups marked by n elements up to isomorphism of marked groups. One can define a metric on Gn by setting the distance between two marked groups (G, S) and (G 0, S0) to be e−N if they have exactly the same relations of length at most N (under the bijection S ←→ S0) (Grigorchuk, Gromov’s metric) Finally, a limit group is a limit (with respect to the metric above) of marked free groups in Gn.

25 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions limits of free groups

Example: A free abelian group of rank 2 is a limit of a sequence of cyclic groups with marking

(hai, (a, an)), n → ∞.

26 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions limits of free groups

Theorem Let G be a finitely generated group. Then the following conditions are equivalent: 1) G is fully residually free (that is for finitely many non-trivial elements g1,..., gn ∈ G there exists a homomorphism φ from G to a free group such that φ(gi ) 6= 1 for i = 1,..., n); 2) [Champetier and Guirardel] G is a limit of free groups in Gromov-Grigorchuk metric. 3) [Remeslennikov] G is universally equivalent to F (in the language without constants);

27 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Free actions on metric spaces

Theorem. A group G is free if and only if it acts freely by isometries on a tree.

Free action = no inversion of edges and stabilizers of vertices are trivial.

28 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions R-trees

An R-tree is a metric space (X , p) (where p : X × X → R) which satisfies the following properties: 1)( X , p) is geodesic, 2) if two segments of (X , p) intersect in a single point, which is an endpoint of both, then their union is a segment, 3) the intersection of two segments with a common endpoint is also a segment.

29 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions R-trees

An R-tree is a metric space (X , p) (where p : X × X → R) which satisfies the following properties: 1)( X , p) is geodesic, 2) if two segments of (X , p) intersect in a single point, which is an endpoint of both, then their union is a segment, 3) the intersection of two segments with a common endpoint is also a segment.

29 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Examples

X = R with usual metric.

A geometric realization of a simplicial tree.

2 X = R with metric d defined by  |y1| + |y2| + |x1 − x2| if x1 6= x2 d((x1, y1), (x2, y2)) = |y1 − y2| if x1 = x2

(x1,y1)

x

(x2,y2) 30 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Examples

X = R with usual metric.

A geometric realization of a simplicial tree.

2 X = R with metric d defined by  |y1| + |y2| + |x1 − x2| if x1 6= x2 d((x1, y1), (x2, y2)) = |y1 − y2| if x1 = x2

(x1,y1)

x

(x2,y2) 30 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Examples

X = R with usual metric.

A geometric realization of a simplicial tree.

2 X = R with metric d defined by  |y1| + |y2| + |x1 − x2| if x1 6= x2 d((x1, y1), (x2, y2)) = |y1 − y2| if x1 = x2

(x1,y1)

x

(x2,y2) 30 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions X = R2 with SNCF metric (French Railway System)

31 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Finitely generated R-free groups

Rips’ Theorem [Rips, 1991 - not published] A f.g. group is R-free (acts freely on an R-tree by isometries) if and only if it is a free product of surface groups (except for the non-orientable surfaces of genus 1,2, 3) and free abelian groups of finite rank.

Gaboriau, Levitt, Paulin (1994) gave a complete proof of Rips’ Theorem.

Bestvina, Feighn (1995) gave another proof of Rips’ Theorem proving a more general result for stable actions on R-trees.

32 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Finitely generated R-free groups

Rips’ Theorem [Rips, 1991 - not published] A f.g. group is R-free (acts freely on an R-tree by isometries) if and only if it is a free product of surface groups (except for the non-orientable surfaces of genus 1,2, 3) and free abelian groups of finite rank.

Gaboriau, Levitt, Paulin (1994) gave a complete proof of Rips’ Theorem.

Bestvina, Feighn (1995) gave another proof of Rips’ Theorem proving a more general result for stable actions on R-trees.

32 / 32 Preliminaries Presentations of groups Finitely generated groups viewed as metric spaces Quasi-isometry Limit groups Free actions Finitely generated R-free groups

Rips’ Theorem [Rips, 1991 - not published] A f.g. group is R-free (acts freely on an R-tree by isometries) if and only if it is a free product of surface groups (except for the non-orientable surfaces of genus 1,2, 3) and free abelian groups of finite rank.

Gaboriau, Levitt, Paulin (1994) gave a complete proof of Rips’ Theorem.

Bestvina, Feighn (1995) gave another proof of Rips’ Theorem proving a more general result for stable actions on R-trees.

32 / 32