2024-09-29

786: Abelian Group Is Simple Group iff Its Order Is Prime Number

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that Abelian group is simple group iff its order is prime number

Topics


About: group

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that any Abelian group is a simple group if and only if its order is a prime number.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
G: { the Abelian groups }
//

Statements:
G{ the simple groups }

|G|=p where p{ the prime numbers }
//


2: Natural Language Description


Any Abelian group is a simple group if and only if the order, |G| is any prime number, p.


3: Proof


Whole Strategy: Step 1: suppose that G is a simple group, take any element, gG{1}, and the subgroup generated by g, (g), and see that (g)=G; Step 2: when g2=1, see that |G|=2, otherwise, take (g2) and see that (g2)=G=(g); Step 3: see that Step 1 and Step 2 imply that |G| is finite; Step 4: let |G|=pk for a prime number, p, and see that k=1; Step 5: suppose that |G|=p for a prime number, p, and see that its subgroups are only {1} and G.

Step 1:

Let us suppose that G is a simple group.

Let us take any element, gG{1}, and the subgroup generated by g, (g)={gG|g=gz,zZ}.

(g) is indeed a subgroup: gzgz=gz+z(g); g0=1(g); for each gz(g), gzgz=gzgz=g0=1.

(g) is a normal subgroup, because each subgroup of any Abelian group is a normal subgroup.

So, (g)=G, because G is simple (obviously, G{1}).

Step 2:

When g2=1, G={1,g}, and |G|=2, which is a prime number.

Let us suppose otherwise hereafter.

Let us take (g2), which is a normal subgroup of G, as before, because we just have took g2 instead of g.

(g2)=G, as before.

Step 3:

Let us see that G=(g)=(g2) implies that |G| is finite.

There is a z such that g=g2z.

1=gg1=g2zg1=g2z1. 2z10, because it is odd. When 0<2z1, let n:=2z1; otherwise, 0<(2z1), and let n:=(2z1). Anyway, gn=1, because 1=11=(g2z1)1=g(2z1). n1, because g1=g1. g1=gn1, because ggn1=gn1g=gn=1.

So, each element of (g) equals one of {1,g,...,gn1} (there may be some duplications in the set), because for each zZ, z=nk+l where 0l<n and gz=gnk+l=gnkgl=(gn)kgl=1kgl=gl.

So, |G|=|(g)| is finite.

Step 4:

Let us take the prime factorization of |G|. As 1<|G|, there is at least 1 prime number, p, such that |G|=pk where kN{0}.

As G=(g), G={1,g,...,gpk1} where gpk=1.

Let us take (gp). As gpk=1, (gp)={1,gp,...,gp(k1)}.

As (gp) is a normal subgroup as before and G is simple, (gp) is {1} or G. But it cannot be G, because at least g,...,gp1 are missing there. So, (gp)={1}. That means that k=1.

So, |G|=p.

Step 5:

Let us suppose that |G|=p for a prime number, p.

By Lagrange's theorem, each of the only possible subgroups of G has order 1 or p. So, the subgroups of G are only {1} and G. The normal subgroups of G are {1} and G, even more.

So, G is simple.


References


<The previous article in this series | The table of contents of this series | The next article in this series>