Statement
Let
be a prime number. Then there are, up to isomorphism, five groups of order
. These include three abelian groups and two non-abelian groups. The nature of the two non-abelian groups is somewhat different for the case
.
For more information on side-by-side comparison of the groups for odd primes, see groups of prime-cube order. For information for the prime 2, see groups of order 8
The three abelian groups
The three abelian groups correspond to the three partitions of 3:
The two non-abelian groups
For the case
, these are dihedral group:D8 (GAP ID: (8,3)) and quaternion group (GAP ID: (8,4)).
For the case of odd
, these are prime-cube order group:U(3,p) (GAP ID: (
,3)) and semidirect product of cyclic group of prime-square order and cyclic group of prime order (GAP ID: (
,4)).
Facts used
- Prime power order implies not centerless
- Center is normal
- Cyclic over central implies abelian
- Lagrange's theorem
- Equivalence of definitions of group of prime order: This basically states that any group of prime order must be cyclic.
- Classification of groups of prime-square order
- Structure theorem for finitely generated abelian groups
Proof
First part of proof: crude descriptions of center and quotient by center
Given: A prime number
, a group
of order
.
To prove: Either
is abelian, or we have:
is a cyclic group of order
and
is an elementary abelian group of order
Proof: Let
be the center of
.
| Step no. |
Assertion/construction |
Facts used |
Given data used |
Previous steps used |
Explanation
|
| 1 |
is nontrivial |
Fact (1) |
has order , specifically, a power of a prime |
|
Fact+Given direct
|
| 2 |
The order of cannot be  |
Facts (2), (3), (4), (5) |
has order  |
|
[SHOW MORE]If  has order  , then  (which exists by fact (2)) has order  (by fact (4)) hence must be cyclic (by fact (5)). Then, by fact (3),  would be abelian, but this would imply that  , in which case the order of  would be  .
|
| 3 |
The order of is either or  |
Fact (4) |
has order  |
Steps (1), (2) |
[SHOW MORE]By fact (4), the order of  must divide the order of  . The only possibilities are  . Step (1) eliminates the possibility of  , and step (3) eliminates the possibility of  . This leaves only  or  .
|
| 4 |
If has order , then is cyclic of order and the quotient is elementary abelian of order  |
Facts (3), (4), (5), (6) |
has order . |
|
[SHOW MORE]If  has order  , then by fact (5),  must be cyclic. By Fact (4),  has order  . Further, by fact (3),  cannot be cyclic, because if it were cyclic, then  would be abelian, which would mean that  has order  . Thus,  is a non-cyclic group of order  . By fact (6), it must be the elementary abelian group of order  .
|
| 5 |
If has order , is abelian. |
|
has order . |
|
[SHOW MORE]We get  , so  is abelian.
|
| 6 |
We get the desired result. |
|
|
Steps (3), (4), (5) |
Step-combination.
|
Second part of proof: classifying the abelian groups
This classification follows from fact (7): the abelian groups of order
correspond to partitions of 3, as indicated in the original statement of the classification.
Third part of proof: classifying the non-abelian groups
Given: A non-abelian group
of order
. Let
be the center of
.
Previous steps:
is cyclic of order
, and
is elementary abelian of order
.
We first make some additional observations.
| Step no. |
Assertion/construction |
Facts used |
Given data used |
Previous steps used |
Explanation
|
| 1 |
The derived subgroup (commutator subgroup) equals . |
|
is non-abelian of order . |
is abelian, has order . |
[SHOW MORE]Since  is abelian,  is contained in  . Since  has prime order, the only possible subgroups are the trivial subgroup and  itself. The derived subgroup cannot be trivial since  is non-abelian, hence the derived subgroup must be  .
|
| 2 |
We can find elements such that the images of in are non-identity elements of that generate it. |
|
|
is elementary abelian of order  |
[SHOW MORE] is elementary abelian of order  , hence is generated by a set of size two comprising non-identity elements. Choose  to be arbitrary inverse images of these elements.
|
| 3 |
together generate . |
|
|
|
|
| 4 |
and do not commute. |
|
|
Steps (2), (3) |
[SHOW MORE]If  and  commute, then  contains  , hence equals all of  . Thus,  , so its image in  is the identity element, a contradiction to what we assumed.
|
| 5 |
Let . Then, is a non-identity element of and . |
|
|
Steps (1), (4) |
[SHOW MORE]We must have  , which equals  by Step (1). By Step (4), ![{\displaystyle [a,b]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/9c4b788fc5c637e26ee98b45f89a5c08c85f7935) is not the identity element. So  is a non-identity element of  .
|
| 6 |
The elements both have order either or . |
|
|
|
[SHOW MORE]The order of  must divide the order of the group, which is  . It cannot equal  , because that would make the group cyclic and hence abelian. It cannot equal  , because  is a non-identity element. The only possibilities are  and  . The same goes for  .
|
We now make cases based on the orders of
and
. Note that these cases may turn out to yield isomorphic groups, because the cases are made based on
and
, and there is some freedom in selecting these.
Case A:
and
both have order
.
In this case, the relations so far give the presentation:
These relations already restrict us to order at most
, because we can use the commutation relations to express every element in the form Failed to parse (unknown function "\alphab"): {\displaystyle a^\alphab^\betaz^\gamma}
, where
are integers mod
. To show that there is no further reduction, we note that there is a group of order
satisfying all these relations, namely prime-cube order group:U(3,p). This is the multiplicative group of unipotent upper-triangular matrices with entries from the field of
elements.
Thus, Case A gives a unique isomorphism class of groups. Note that the analysis here works both for
and for odd primes. The nature of the group obtained, though, is different for
, where we get dihedral group:D8 which has exponent
. For odd primes, we get a group of prime exponent.