3
$\begingroup$

Suppose G is a group defined by the presentation $G=\langle u, v\mid uv^2=v^3u, ~u^2v=vu^3\rangle$, is $G$ finite or infinite? If it is finite, what is its order?

In general, I want to know whether there are some useful strageties to detect whether a group $G$ is finite or infinite only from its presentation, and when it is finite, how to deduce its order.

  • 3
    One easy way (that is, easy if it works) to determine if $G$ is infinite is to find a homomorphism out of $G$ onto some other group that you know to be infinite. For example, it is straightforward to determine if the abelianization of a finitely presented group is infinite (we get a finitely presented abelian group and we can compute Smith normal forms to determine its rank). In this case the abelianization is trivial so that doesn't work.2012-09-10
  • 1
    I changed $G=< u, v~|~~ uv^2=v^3u, ~u^2v=vu^3>$ to $G=\langle u, v\mid uv^2=v^3u, ~u^2v=vu^3\rangle$. I used \langle, \rangle, and \mid. Notice the spacing that results from the use of \mid. This spacing need not be added manually.2012-09-10
  • 0
    @QiaochuYuan Do you mean a homomorphism out of $G$ *onto* some infinite group? The trivial homomorphism into, say, $\mathbb{C}$ is certainly a homomorphism from any group into an infinite group ...2012-09-10
  • 0
    @Neal: yes, thanks for the correction.2012-09-10
  • 5
    Here is a proof your group (and many like it) are trivial: http://math.stackexchange.com/questions/66573/a-particular-two-variable-system-in-a-group/66632#666322012-09-10
  • 0
    @ Steve, many thanks!2012-09-10
  • 0
    @ougao: The link Steve gave you is the best answer. Still, you can find more than you had expected by your question by following the link. I think the best source for such these groups is **Presentations of groups** by D. L. Johnson. Todd-coxeter Algorithm and Tietze transformations are ways which help you step by step finding the order of such this group. :)2012-09-10
  • 0
    You should notice that your presentation is "balanced". That is, there is an equal number of generators and relations. However, if you have just one more generator than relations then your group is automatically infinite, while if you have at least two more generators then relations then your group is what is called "Large". That is, it has a subgroup of finite index which maps onto $F_2$, the free group on two generators. Largeness might seem synthetic, but it is a natural and rather interesting property.2012-09-10

1 Answers 1

6

One method for attempting to determine the order of a group given a finite presentation is the Todd-Coxeter algorithm. Be warned, it's not fun to try to run through by hand.

One can prove that there is no algorithm which can detect whether finite presentations yield finite or infinite groups. In fact, the problem of merely detecting whether you have the trivial group or not is unsolvable.

For your specific problem GAP says your group is trivial...

f := FreeGroup("u","v");;

u := f.1;; v := f.2;;

rels := [ u*v^2*u^(-1)*v^(-3), u^2*v*u^(-3)*v^(-1) ];

[ u*v^2*u^-1*v^-3, u^2*v*u^-3*v^-1 ]

G := f/rels;

Size(G);

1

  • 0
    thanks, I have not used GAP before.2012-09-10
  • 0
    Sure. No problem. GAP is free and it's a fantastic tool.2012-09-10
  • 0
    If it's a homework question, then doing it using GAP is cheating! (Although I have to admit that I would be tempted to do that first just to get an idea of what the answer might be, before trying to prove it by hand.)2012-09-10
  • 0
    @Derek, good suggestion, thanks!2012-09-11