Proving G=1: Exercise from Serre's Book Trees

[Ultraworld]

This is an exercise from a book from Serre called Trees. Given the group

G = < a, b, c | bab⁻¹ = a², cbc⁻¹ = b², aca⁻¹ = c² >

I have to prove G = 1.

I don't have a clue. Of course G' = G (commutator subgroup equals the group itself) but I don't know what to deduce from that. Another first step could be to prove that the orders of a, b and c are finite. But I do not even know how to that.

If anyone could put me in the right direction i would be very grateful.

edit: I am going to try to use Todd Coxeter coset enumeration.

 

[Ultraworld]

I doubt wetter ToddCoxeter CE will help me

 

[matt grime]

Since the question uses a,b,c and it's Serre, let's assume that the fact there are 3 generators is important.

The only thing I can think of doing is considering products like abc or bac etc and simplifying in two ways until ended up with something that points towards the statement a=a^2, or similar.

(No, I\ve not solved this - I'll get a pen and paper and think about it some more later)

 

[Ultraworld]

well, if you can prove all the 3 generators are of finite order than I can finish this question. Because Suzuki has this exercise in his book where he assumes G is finite and he also gives lots of hints.

Here however I can not a priori assume G is finite.