2
$\begingroup$

I found this question in an algebra qualifying exam and I'm interested if anyone has a way to organize the way I should be trying to solve it or if there's a better way to approach it.

Question: Let $G$ be a group generated by two elements $a,b$ where $a^2=b^2=1$. Show that the commutator subgroup $G'$ is cyclic.

So far I have reasoned that we can write any element of $G$ as $(ab)^n$ or $(ab)^nb$ or $(ba)^n$ or $(ba)^nb$ for some $n\geq0$. Then we have identities such as $(ab)^{-1}=ba$ and $(ab)^nb=b(ba)^n$ so we can check that every commutator of combinations of the four options above (for instance $[(ab)^n,(ba)^mb]$) can be written as $(ab)^{2l}$ for some integer $l$. Thus $G'$ is generated by $abab=[a,b]$.

I'd rather not do all that work so is there a way to avoid it that might give more understanding?

  • 0
    @JackSchmidt Now I know... thanks!2012-09-27

2 Answers 2

1

Try this: You know $G$ consists of all manner of finite strings of $a$ and $b$. You also know that $G/G'$ has to be Abelian, and that $G'$ is the smallest such normal subgroup to do that.

Examining $G$, you can see that if you make $a$ commute with $b$, (i.e., require $ab=ba$, aka $aba^{-1}b^{-1}=1$) by modding out the normal (edit) subgroup generated by $[a,b]$, then the quotient is abelian.

So, it makes sense that $G/\langle[a,b]\rangle$ would be abelian.

That gives you that $\langle[a,b]\rangle\supseteq G'$, and the reverse containment is trivial.

  • 0
    @JackSchmidt Ah yeah that omission slipped in: thank you.2012-09-27
3

As rschweib mentions, the commutator subgroup of $G=\langle a,b\rangle$ is the smallest normal subgroup containing the commutator $[a,b]$.

For a general group generated by two elements $\langle a,b\rangle$, the commutator subgroup certainly need not be cyclic. For instance if $a=(1,3,2)$ and $b=(2,5)(3,4)$, then $\langle [a,b] \rangle = \langle (1,2,3,4,5) \rangle$ has order 5 and is not a normal subgroup of $\langle a,b \rangle$. Indeed the commutator subgroup of $\langle a,b \rangle$ is the entire $\langle a,b \rangle$ in this case and one certainly does not have that $\langle [a,b] \rangle \supseteq G'$.

Hence one needs to show that $\langle [a,b] \rangle$ is normal, which makes essential use of the fact that $a$ and $b$ have order 2.

When $a,b$ have order 2, one gets the very simple formula $x^a = axa$ and $[a,b] = abab$, so that $[a,b]^a = aababa = baba = [b,a] = [a,b]^{-1}$ and $[a,b]^b = bababb = baba = [b,a] =[a,b]^{-1}$. In particular, $\langle [a,b] \rangle$ is normal, and both $a$ and $b$ act as the automorphism $x \mapsto x^{-1}$.