# Prove that a finite abelian group is simple if and only if its order is prime.

So I'm having trouble with this problem. I know that the definition of a simple group means that the group has no nontrivial subgroups. I know that this can be proven somehow with the help of the converse of Lagrange's Theorem for Abelian groups: If G is abelian of order n, and d is a divisor of n, then G has a subgroup of order d.

My attempt: (=>)Assume that G is a finite abelian group and is simple, then G has no nontrivial normal subgroups. (Now I don't know how to show that this implies that G has order p, where p is prime.

(<=)Assume that G is a finite abelian group with order p, where p is a prime. (Since the order of p is prime then what does this mean?)

Edit: Can someone check my new attempt at the proof?

(=>) Suppose G is a simple finite abelian group. Suppose for the sake of contradiction that G does not have prime order, then |G|=p*k where p is a prime number and k is an integer such that k>1. Then G has an element of order p. Let the element of order p be called x. Then , the subgroup generated by x, is of order p and is not all of G. Since G is abelian, this subgroup is normal, which leads us to a contradiction. Therefore, G must have prime order.

(<=) Suppose that G is a finite abelian group and it’s order is p, a prime. Since G has prime order, then the only two subgroups of G are the trivial subgroup and the group G. Then, by definition the group G is simple since there are no nontrivial proper subgroups, and thus no nontrivial normal subgroups.

-
You might find your answer in the following link. math.stackexchange.com/questions/186035/… –  user112535 Dec 7 '13 at 2:26
A simple group has no nontrivial normal subgroups. –  Josh B. Dec 7 '13 at 2:27
You can omit the word "finite" and this is still true. –  Derek Holt Dec 7 '13 at 10:49
Simple groups can have proper nontrivial subgroups (they have to be nonabelian though). I think Cauchy's is too high-tech for this: –  anon Dec 8 '13 at 1:42
Say $G$ is nontrivial abelian and pick a nontrivial $g\in G$ then consider $\langle g\rangle$; it's automatically nontrivial, and if it's proper in $G$ then you're done (subgroups of abelian groups are automatically normal, so here $G$ would be nonsimple), otherwise $\langle g\rangle=G$ and we know we can consider cyclic groups. In $C_n=\langle g\rangle$, if $d\mid n$ is a nontrivial factor then $\langle g^d\rangle$ is proper and nontrivial, hence $G$ is nonsimple when $n$ is composite. As for $C_p$, it has no proper nontrivial subgroups at all, which is easy to check. –  anon Dec 8 '13 at 1:47

Edit: Can someone check my new attempt at the proof?

(=>) Suppose G is a simple finite abelian group. Suppose for the sake of contradiction that G does not have prime order, then |G|=p*k where p is a prime number and k is an integer such that k>1. Then G has an element of order p. Let the element of order p be called x. Then , the subgroup generated by x, is of order p and is not all of G. Since G is abelian, this subgroup is normal, which leads us to a contradiction. Therefore, G must have prime order.

(<=) Suppose that G is a finite abelian group and it’s order is p, a prime. Since G has prime order, then the only two subgroups of G are the trivial subgroup and the group G. Then, by definition the group G is simple since there are no nontrivial proper subgroups, and thus no nontrivial normal subgroups.

-
Yes this is correct. I feel Cauchy's is sort of high-tech for the level the problem is at though. –  anon Dec 8 '13 at 1:50

Hint :

For $\Rightarrow$ :

Suppose group has order $|G|=pqk$ where $p,q$ are distinct primes.

Now, what doe Cauchy theorem tells for finite abelian groups?

For $\Leftarrow$ :

For a group to be simple, It should have some non trivial subgroup.

Order of a subgroup divides order of group.

-

If $G$ is a simple finite abelian group, then it has no non-trivial subgroups, since all subgroups are normal because $G$ is abelian. This means that $G$ is cyclic, generated by any non-trivial element $g$. Let $n$ be the order of $G$. If $d$ divides $n$, then $\langle g^d \rangle$ is a subgroup of $G$. Thus, $d$ can only be $1$ or $n$, and so $n$ is prime.

If $G$ is a finite group whose order is prime, then $G$ is cyclic, generated by any non-trivial element. This implies that $G$ has no non-trivial subgroups.

-