4
$\begingroup$

There are two subgroups $H_1$, $H_2$ of $G$, if $H_1\neq H_2$ then $\gcd(|H_1|,|H_2|)=1$. Prove that the order of $G$ is a prime number and the group is cyclic.

I know from Lagrange that the order divides $|H_1|$ and $|H_2|$ but if so then the order of $G$ divides two numbers then it's not a prime number. I guess this is wrong but I can't understand this.

$\endgroup$
2
  • $\begingroup$ As written this is false: just take $\,G=S_3\;,\;H_1=\langle (12)\rangle\;,\;H_2=\langle (123)\rangle\,$ . Perhaps you meant that G is a group such that "for any two different groups...etc." ? $\endgroup$
    – DonAntonio
    Apr 4, 2013 at 3:49
  • 1
    $\begingroup$ Vielleicht es ist eine gute Idee, die du die Frage in deutscher Sprache schreibst. $\endgroup$
    – DonAntonio
    Apr 4, 2013 at 3:54

1 Answer 1

3
$\begingroup$

Hint (Re-framing question for clarification): What you need to prove is that, given any two subgroups $$H_1 \leq G\;\;\text{and}\;\;H_2\leq G\;\;\text{with}\;\;H_1\neq H2\;\;\text{ and with}\;\;\gcd(|H_1|,|H_2|)=1$$ $\quad \implies $ that one $H_i$ must be the trivial group, and the other "subgroup" $H_j = G$, since there can then be only two numbers dividing the order of $G$: one of order $1$, the other of order $|G|$, and hence, $G$ must be cyclic.

You can do this all with the Theorem of Lagrange, but you really only need to note that the order of any subgroup of $G$ must be coprime to $1$, the order of $\{e\}$, i.e. since we have $\{e\} \leq G$, it must follow for any subgroup $H$ of $G$, $\gcd(|\{e\}|, |H|) = 1$.


Note: the italicized qualification in the first sentence is crucial if the statement is to be true; please see @DonAntonio's comment below the question.


Let me also offer some clarification with respect to your thoughts:

"I know from Lagrange that the order divides $|H_1|$ and $|H_2|$ but if so then the order of $G$ divides two numbers then it's not a prime number."

From the Theorem of Lagrange, if $G$ is a finite group, then the order of its subgroups divides the order of $G$: so if $H_1 \leq G$ and $H_2 \leq G$, then the order of $H_1$ divides the order of $G$, and the order of $H_2$ divides the order of $G$. $|G|$ does NOT divide the order of any of its subgroups other that of itself. $1$ divides the order of any group, including a group of prime order $p$. And prime $p$ divides the order of a group of order prime $p$. And a prime number, by definition, is not divisible by any numbers other than $1$ and $p$.

$\endgroup$
2
  • 1
    $\begingroup$ sorry still didn't totally understand this... why the order f any subgroup must be coprime to 1? how do I get this from Lagrange? $\endgroup$
    – Mary
    Apr 4, 2013 at 10:45
  • $\begingroup$ That doesn't come from Lagrange, it comes from that fact that you are given, as a premise to this question, that for any two distinct subgroups $H_1$ and $H_2$, their orders must be coprime. Since the trivial subgroup has order 1 ... $\endgroup$
    – amWhy
    Apr 4, 2013 at 15:19

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .