12

Let $G$ a group with normal subgroup $H$. If every element of $G/H$ has finite order and every element of $H$ has finite order, then every element of $G$ has finite order

Proof:

Let G be a group with normal subgroup H. Suppose that every element of G/H has finite order and that every element of H has finite order.

We want to show $G$ has finite order.

Let $x \in G$ then by coset and quotient group definition, $Hx \in G/H$ has $Hx$ has finite order $n$ or in other words $(Hx)^n=e$. Also for some $h \in H$, it also has a finite order where $h^m=e$

I'm stuck on how to link it together. Any input?

Chilanie
  • 409

3 Answers3

12

Note that in $G/H$, an element $xH$ is the identity if and only if $x\in H$. This means that $(xH)^n = eH$ implies that $x^n \in H$, and so you can use the fact that elements in $H$ have finite order to proceed.

Rolf Hoyer
  • 12,399
  • Just wondering, how do we know if $x$ is in $H$? because on my paper, I have the definition of quotient group being $G/H={xH| x \in G}$ Is it because $H$ is a normal subgroup to $G$? – Chilanie Apr 11 '15 at 00:28
  • 1
    Two cosets $x_1H, x_2H$ are equal if and only if $x_2^{-1}x_1 \in H$. – Rolf Hoyer Apr 11 '15 at 00:37
10

Here is a way of putting things together:

Let $g \in G$. Consider the coset $gH$. Since every element in $ G/H$ has finite order, there exists $n \in \Bbb N$ such that $g^nH = (gH)^n = eH = H$, i.e. $g^n\in H$ . Now we use the fact that every element in $H$ has finite order, so there exists $m \in \Bbb N$ such that $(g^n)^m = e$, i.e. $g^{mn}= e$. Thus $g$ has finite order.

Elaqqad
  • 13,725
  • I think im a bit confused but when you say $g^nH$, aren't you saying that g has a finite order but isn't that what we are trying to prove and how do we know that g has a finite order? Isn't it just $(gH)^n$ has a finite order? – Chilanie Apr 11 '15 at 00:32
  • we can always consider the powers of any element,so we did not assume anything about $g$, $n$ is the order of $gH$ this gives us $(gH)^n=eH=H$ and we know that $g^nH=(gH)^n$ so $g^nH=H$ hence $g^n\in H$ and $m$ is the order of $g^n$ as an element of $H$ – Elaqqad Apr 11 '15 at 00:38
2

$$\forall\,x\in G\;\;\exists\,n_x\in\Bbb N\;\;s.t.\;\;x^{n_x}\in H\implies\,\exists m_x\in\Bbb N\;\;s.t.\;\;\left(x^{n_x}\right)^{m_x}=1$$

Timbuc
  • 34,191