Chapter V.
On Groups Whose Orders Are the Powers of Primes.

H aving in the last chapter dealt in some detail with Abelian groups of order pm, where p is a prime, we shall now investigate some of the more important properties of groups, which have the power of a prime for their order but are not necessarily Abelian. Besides illustrating and leading to many interesting applications of the general theorems of Chapter III, the discussion of groups, whose order is the power of a prime, will be found in many ways to facilitate the subsequent discussion of other groups, whose order is not thus limited.

52. If G is a group whose order is pm, where p is a prime, the order of every sub-group of G must also be a power of p; and therefore (§ 25) the total number of operations of G which are conjugate with any given operation must be a power of p. The identical operation of G is self-conjugate. Hence if the operations of G, other than the identical operation, are distributed in conjugate sets containing pα, pβ, … operations, the total number of operations of G is 1 + pα + pβ + ; and therefore

pm = 1 + pα + pβ + .

This equation can only be true if pr1 1 of the indices α, β, … are zero, r1 being some integer not less than unity. Hence G must contain pr1 self-conjugate operations, which form (§ 27) a self-conjugate sub-group14. Hence:—

THEOREM I. Every group whose order is the power of a prime contains self-conjugate operations, other than the identical operation; and no such group can be simple.

53. Let H1 be the sub-group of G of order pr1, formed of its self-conjugate operations. Then G H1 is a group of order pmr1, and it must contain self-conjugate operations other than identity, forming a self-conjugate sub-group of order pr2. Corresponding to this self-conjugate sub-group of  G H1, G must have a self-conjugate sub-group H2 of order pr1+r2, which contains H1. If r1 + r2 < m, G H2 is a group of order pmr1r2; and it again will have self-conjugate operations forming a sub-group of order pr3. Corresponding to this, G will have a self-conjugate sub-group H3 of order pr1+r2+r3, which contains H2. If the process thus indicated is continued, till G itself is arrived at, a series of groups

H1,H2,,Hn,G
is formed, each of which is self-conjugate in G and contains all that precede it15. Moreover Hr+1 Hr  is the group formed of the self-conjugate operations of  G Hr, and it is therefore an Abelian group.

The series of sub-groups thus arrived at is of considerable importance. From the mode of formation, it is clear that a second group G of order pm cannot be simply isomorphic with G, unless Hr+1 Hr and H H are simply isomorphic for each value of r. It by no means however follows that, when this latter condition is satisfied, G and G are always simply isomorphic. This is indeed not necessarily the case; instances to the contrary will be found among the groups of order p3 and p4 in §§ 69–72. While in general there is no limitation on the type of any Abelian factor-group Hr+1 Hr formed from two consecutive terms of the series, it is to be noted that the last factor-group G Hn cannot be cyclical16, a restriction that can be established as follows. If G Hn were cyclical, then, because Hn Hn1 is the group formed of the self-conjugate operations of G Hn1, the operations of G Hn1 could be arranged in the sets

Hn Hn1,P Hn Hn1,P2 Hn Hn1,,Ppα1 Hn Hn1,
pα being the order of G Hn and Ppα  being an operation of  Hn Hn1. But since P is permutable with its own powers and with every operation of  Hn Hn1, these operations would form an Abelian group. Now the self-conjugate operations of  G Hn1 form the group Hn Hn1, and therefore G Hn1 cannot be Abelian. Hence the assumption, that G Hn is cyclical, is incorrect.

One immediate consequence of this result is that a group G of order p2 is necessarily Abelian. For if it were not, its self-conjugate operations would form a sub-group H of order p, and G H being of order p would be cyclical.

A second consequence is that if G, of order pm, is not Abelian, the order of the sub-group H1, formed of the self-conjugate operations of G, cannot exceed pm2.

54. It was proved in the last chapter that an Abelian group has one or more sub-groups the order of which is any given factor of the order of the group itself. Hence, since Hr+1 Hr is Abelian, Hr+1 must have one or more sub-groups which contain Hr, of any given order greater than that of Hr and less than its own.

In particular, if ps and pt are the orders of Hr and Hr+1, then Hr+1 Hr must have a series of sub-groups of orders

pts1,pts2,,p,1,
each of which contains those that follow it, while each one is of necessity self-conjugate in  G Hr. Hence between Hr and Hr+1, a series of groups hs+1, hs+2, …, ht1 of orders ps+1, ps+2, …, pt1 can be chosen, so that each of the series
Hr,hs+1,hs+2,,ht1,Hr+1
is self-conjugate in G and contains all that precede it. We can therefore always form, in at least one way, a series of sub-groups of G of orders
1,p,p2,,pm1,pm,
such that each is self-conjugate in G and contains all that precede it.

It will be shewn in the next paragraph that every sub-group of order ps of G is contained self-conjugately in some sub-group of order ps+1, and that every sub-group of order ps of a group of order ps+1 is self-conjugate. Assuming this result, it follows at once that a series of sub-groups of orders

1,p,p2,,pm1,pm
can always be formed, which shall contain any one given sub-group and which shall be such that each group of the series contains the previous one self-conjugately. It will not however, in general, be the case, as in the previous series, that each group of the series is self-conjugate in G.

55. Let Gs be any sub-group of G of order ps, and let Hr+1 be the first of the series of sub-groups

H1,H2,,Hn
which is not contained in Gs. Then Gs Hr is a sub-group of G Hr which does not contain all the operations of Hr+1 Hr . Every operation of Hr+1 Hr is self-conjugate in  G Hr; and therefore Gs Hr is self-conjugate in Gs Hr, Hr+1 Hr , a group of order greater than its own. Hence Gs must be contained self-conjugately in some group Gs+t of order ps+t, where t is not less than unity. Moreover since Gs+t Gs must contain operations of order p, there must be one or more groups of order ps+1 which contain Gs self-conjugately. Hence:—

THEOREM II. If Gs of order ps is a sub-group of G, which is of order pm, then G must contain a sub-group of order ps+t, t 1, within which Gs is self-conjugate. In particular, every sub-group of order pm1 of G is a self-conjugate sub-group17.

Suppose now that Gs+t, of order ps+t, is the greatest sub-group of G which contains a given sub-group Gs, of order ps, self-conjugately; so that Gs is one of pmst conjugate sub-groups. Suppose also that Gs+t+u of order ps+t+u, (u 1), is the greatest sub-group of G that contains Gs+t self-conjugately. Every operation of Gs+t+u transforms Gs+t into itself; and no operation of Gs+t+u that is not contained in Gs+t transforms Gs into itself. Hence, in Gs+t+u, Gs is one of pu conjugate sub-groups and each of these is self-conjugate in Gs+t.

The pmst sub-groups conjugate with Gs may therefore be divided into pmstu sets of pu each, (u 1), such that any operation of one of the sets transforms each sub-group of that set into itself.

Similarly if Gr, of order pr, is the greatest sub-group of G that contains a given operation P self-conjugately, and if Gr+s, s 1, is the greatest sub-group that contains Gr self-conjugately, then Gr must contain self-conjugately ps operations of the conjugate set to which P belongs, and therefore any two of these ps operations are permutable. Hence the pmr conjugate operations of the set to which P belongs can be divided into pmrs sets of ps each, (s 1), such that all the operations of any one set are permutable with each other. In particular, if P is one of a set of p conjugate operations, all the operations of the set are permutable.

56. If P is an operation of G, of order pn, which is conjugate to one of its own powers Pα, there must be some other operation Q such that

Q1PQ = Pα.

From this equation it follows that

Q1PxQ = (Q1PQ)x = Pxα.

Again

Q2PQ2 = Q1PαQ = Pα2 , Q3PQ3 = Q1Pα2 Q = Pα3 ,

and so on. Hence

QyPxQy = Pxαy .

If Qβ is the lowest power of Q which is permutable with P, then in {P,Q} P will be one of β conjugate operations, and therefore β must be a power of p, say pr, less than pn. Now

Qpr PQpr = Pαpr ;
and therefore
αpr 1(modpn),
while
αpr1 1(modpn).

First, we will suppose that p is an odd prime. Then since

xpr = x(modp),
whatever integer x may be, we may assume that α = 1 + kps, where k is not a multiple of p; and then

αpr = 1 + kpr+s + αpr1 = 1 + kpr+s1 +

Hence

r + s = n,
and
α 1(modpnr).

In particular, we see that no operation of order p can be conjugate to one of its powers. Hence if P and P are two conjugate operations of order p, {P} and {P} have no operation in common except identity. Also, if {P} be a self-conjugate sub-group of order p, each of its operations is self-conjugate.

If p is 2, we must take

α = ±1 + k2s,
where k is odd, and we are led by the same process to the result
α ±1(mod 2nr).

57. If P is an operation of G which belongs to the sub-group Hr+1 (§ 53) and to no previous sub-group in the set

1,H1,H2,,Hn,G,
then {P,Hr} is a sub-group of Hr+1; and therefore every operation of {P,Hr} Hr is self-conjugate in  G Hr. The set of operations PHr is therefore transformed into itself by every operation of G, and hence every operation that is conjugate to P is contained in the set PHr. Suppose now, if possible, that all the operations conjugate with P are contained in the set PHr1. Then every operation of G transforms this set into itself, and therefore every operation of {P,Hr1} Hr1 is self-conjugate in  G Hr1. This however cannot be the case, since by supposition P does not belong to Hr. Hence among the operations conjugate to P, there must be some which belong to PHr and not to PHr1. In particular, if P is one of p conjugate operations, no operation conjugate to P can belong to the set PHr1. For there must be an operation Q such that Q1PQ belongs to PHr and not to PHr1; and this being the case, no one of the operations QxPQx, (x = 1, 2,,p 1), can belong to PHr1. But these operations with P constitute the conjugate set.

It follows from the above reasoning that, if P belongs to Hr+1, then each operation of the set PαQ1PαQ, where Q is any operation of G, belongs to Hr. If Q belongs to Hs+1, (s < r), the operation PαQ1PαQ, regarded as the product of PαQ1Pα and Q, must similarly belong to Hs. Hence unless every operation of Hs+1 is permutable with P, there must be operations conjugate to P, which belong to the set PHs. Moreover those operations of G which transform P into operations of the set PHs form a sub-group. For if

S1PS = Ph s,
and
S1PS = Ph,
then
S1S1PSS = Ph S1h sS,
and when both hs and h belong to Hs, so also does hS1hsS.

58. In illustration of the foregoing paragraph, we will consider a group G of order pr+s where p is an odd prime in which the group H1, is of type (r), while G H1 is an Abelian group of type (1,1, with s units).

Let Q be an operation of order pr that generates H1; and let P1, P2, …, Ps be s operations no one of which is a power of any other, such that, with Q, they generate G.

If P1 and P2 are not permutable, then

P21P 1P2 = P1Qα,
and
P2pP 1P2p = P 1Qpα.

Now P2p belongs to H1, and therefore

Qpα = 1,
so that
α = kpr1.

Hence the only operations which are conjugate to P1 are

P1,P1Qpr1 ,P1Q2pr1 ,,P1Q(p1)pr1 ;
and P1 is one of a set of p conjugate operations, which are transformed among themselves by P2. Similarly P2 is one of a set of p conjugate operations which are transformed among themselves by P1. Hence both P1 and P2 are permutable with each of the operations P3, P4, …, Ps. Again, P3 is not self-conjugate, and there must therefore be another, say P4, of the set P3, P4, …, Ps which, with its powers, transforms P3 into a set of p conjugate operations. Then P3 will similarly transform P4; and P3P4 will be permutable with each of the set P5, …, Ps, P1P2. Hence finally the set of s operations P1, P2, …, Ps must be divisible into sets of two, such that each pair are permutable with all the remaining operations, but are not permutable with each other. The group can therefore only exist if s is even18.

The sub-group {P1,P2,Q} is a group which satisfies the same conditions as G, when s = 2. Its order is pr+2, and it contains a self-conjugate operation of order pr. Now we shall see in §§ 65, 66 that such a group is necessarily of one of two types19, the generating operations of which satisfy one or the other of the sets of equations

Qpr = 1,P1p = 1,P 2p = 1,P 21P 1P2 = P1Qpr1 :
or
Qpr = 1,P1p = Q,P 2p = 1,P 21P 1P2 = P1Qpr1 .

The same is true for the sub-groups {P3,P4,Q}, etc.; and all the operations of any one of these sub-groups are permutable with each operation of {P1,P2,Q}.

Hence finally, since the equations to be satisfied by each pair of operations, such as P1 and P2, may be chosen in two distinct ways, there are in all 21 2s distinct types of group of order pr+s, for which H1 is a cyclical group of order pr, and G H1 is an Abelian group of type (1,1,, to s units).

59. It has been seen in § 55 that every sub-group G of order pm1 of a group G of order pm is self-conjugate. Suppose now that G contains two such sub-groups G and G. Then since G and G are permutable with each other, while the order of {G,G} is pm, the order of the greatest group g common to them must (§ 33) be pm2; and since g is the greatest common sub-group of two self-conjugate sub-groups of G, it must itself be a self-conjugate sub-group of G. The factor group G g of order p2 contains the two distinct sub-groups G g and G g, which are of order p and permutable with each other. Hence G g must be an Abelian group of type (1, 1), and it therefore contains (§ 49) p + 1 sub-groups of order p. Hence, besides G, G must contain p other sub-groups of order pm1 which have in common with G the sub-group g. If the p + 1 sub-groups thus obtained do not exhaust the sub-groups of G of order pm1, let G be a new one. Then, as before, G and G must have a common sub-group g, of order pm2, which is self-conjugate in G. If g were the same as g, G g  would be contained in G g, which by supposition is not the case. It may now be shewn as above that there are, in addition to G, p sub-groups of order pm1 which have in common with G the group g. These are therefore necessarily distinct from those before obtained. This process may clearly be repeated till all the sub-groups of order pm1 are exhausted. Hence finally, if the number of sub-groups of G, of order pm1 be rm1, we have rm1 1(modp).

60. The self-conjugate operations of a group G of order pm, whose orders are p, form with identity a self-conjugate sub-group whose order is some power of p; and therefore their number must be congruent to 1, (modp). On the other hand, if P is any operation of G of order p which is not self-conjugate, the number of operations in the conjugate set to which P belongs is a power of p. Hence the total number of operations of G, of order p, is congruent to 1, (modp). Now if r1 is the total number of sub-groups of G of order p, the number of operations of order p is r1(p 1), since no two of these sub-groups can have a common operation, except identity. It follows that

r1(p 1) 1,(modp),
and therefore
r1 1,(modp).

If now Gs is any sub-group of G of order ps, and if Gs+t is the greatest sub-group of G in which Gs is contained self-conjugately, then every sub-group of G which contains Gs self-conjugately is contained in Gs+t. But every sub-group of order ps+1, which contains Gs, contains Gs self-conjugately; and therefore every sub-group of order ps+1, which contains Gs, is itself contained in Gs+t. By the preceding result, the number of sub-groups of Gs+t Gs of order p is congruent to unity, (modp). Hence the number of sub-groups of G of order ps+1, which contain Gs of order ps, is congruent to unity, (modp).

61. Let now rs represent the total number of sub-groups of order ps contained in a group G of order pm. If any one of them is contained in ax sub-groups of order ps+1, and if any one of the sub-groups of order ps+1 contains by sub-groups of order ps, then

x=1x=ra x = y=1y=rs+1b y;
for the numbers on either side of this equation are both equal to the number of sub-groups of order ps+1, when each of the latter is reckoned once for every sub-group of order ps that it contains. It has however been shewn, in the two preceding paragraphs, that for all values of x and y
ax 1,by 1(modp).

Hence

rs rs+1(modp).

Now it has just been proved that

r1 1 andrm1 1(modp);
and therefore finally, for all values of s,
rs 1(modp).
We may state the results thus obtained as follows:—

THEOREM III. The number of sub-groups of any given order ps of a group of order pm is congruent to unity, (modp)20.

Corollary. The number of self-conjugate sub-groups of order ps of a group of order pm is congruent to unity, (modp).

This is an immediate consequence of the theorem, since the number of sub-groups in any conjugate set is a power of p.

62. Having shewn that the number of sub-groups of G of order ps is of the form 1 + kp, we may now discuss under what circumstances it is possible for k to be zero, so that G then contains only one sub-group Gs of order ps.

If this is the case, and if P is any operation of G not contained in Gs, the order of P must be not less than ps+1; for if it were less, G would have some sub-group of order ps containing P and this would necessarily be different from Gs. If the order of P is ps+t, then {Ppt } is a cyclical sub-group of order ps; and it must coincide with Gs. Hence, if Gs is the only sub-group of order ps, it must be cyclical.

Suppose now that G contains operations of order pr (r > s), but no operations of order pr+1; and let P be an operation of G of order pr. Then {P} must be contained self-conjugately in a non-cyclical sub-group of order pr+1.

We will take first the case in which p is an odd prime. Then (§ 55) G must contain an operation P which does not belong to {P}, such that

P1PP = Pα,Pp = Pβ.
If α were unity, {P,P} would be an Abelian group of order pr+1 containing no operation of order pr+1. Its type would therefore be (r, 1), and it would necessarily contain an operation of order p not occurring in {P}. It has been shewn that this is impossible if Gs is the only sub-group of order ps, and therefore α cannot be unity.

We may then without loss of generality (§ 56) assume that

α = 1 + pr1.
Moreover if β were not divisible by p, the order of P would be pr+1, contrary to supposition. Hence we must have the relations
P1PP = P1+pr1 ,Pp = Pγp.

By successive applications of the first of these equations, we get

PyPxPy = Px(1+ypr1) ,
for all values of x and y; and from this it immediately follows that

(PxP)p = PpPx{p+1 2p(p+1)pr1} = P(x+γ)p.

Hence if

x = pr1 γ,
the order of PxP, an operation not contained in {P}, is p. This is impossible if Gs is the only sub-group of order ps. If then r < m, G must contain operations of order greater than pr; and G is therefore a cyclical group. Hence:—

THEOREM IV. If G, of order pm, where p is an odd prime, contains only one sub-group of order ps, G must be cyclical.

63. When p = 2, the result is not so simple.

Let Q be an operation that transforms {P} into itself, and suppose that the lowest power of Q that occurs in {P} is Q4. Then {P,Q} must be defined by

Q1PQ = Pα,Q4 = Pβ,
where
α = ±1 + k2r2.
Moreover β must be a multiple of 4, as otherwise the order of Q would be greater than 2r. A simple calculation now gives
(PxQ2)2 = Pβ+x(1+α2) ;
and since
β 0(mod 4),
and
α2 1(mod 2r1),
x can always be chosen so that
β + x(1 + α2) 0(mod 2r).
When x is thus chosen, PxQ2 is an operation of order 2 which is not contained in {P}. But this is inconsistent with Gs being the only sub-group of order 2s; hence {P} must contain Q2.

If now {P} is not a self-conjugate sub-group, there must (§ 55) be some operation P of order pr, conjugate with P and not contained in {P}, which transforms {P} into itself; and then {P,P} is defined by

P1PP = Pα,P2 = P2β,
where α is 1 or ± 1 + 2r1, and β is odd.

If

α = 1 + 2r1,
then
(PxP)2 = P2{β+x(1+2r2)} ;
and x can be chosen so that PxP is of order 2. Hence this case cannot occur.

If α is either 1 or 1 + 2r1, the defining relations of {P,P} are not self-consistent unless r is 2; for they lead to

P1P2βP = P2β,
and
P1P2βP = P2β.

If r is 2, and if P is an operation that transforms P into P, so that

P1PP = P,
then
(PP)2 = PP2P = P1P,
since
P2 = P2 = P2.

Hence PP would be of order 8; and therefore this case cannot occur.

Hence, finally, {P} must be self-conjugate.

If r + 1 < m, {P} must be transformed into itself by some operation Q not contained in {P,Q}, so that

Q1PQ = P1+k2r1 ,
and
Q1PQ = P1+k2r1 ,
where k and k are each either zero or unity. If both are zero or both unity, QQ is permutable with P; and if one is zero and the other unity,
(QQ)1P(QQ) = P1+2r1 .
In either case, the group contains an operation of order 2 that does not belong to {P}, and this is inadmissible. Hence, lastly, r must not be less than m 1.

Suppose now that r is equal to m 1, and that of the operations of G, not contained in {P}, Q has as small an order as possible, say 2t (t s + 1). Then Q2 of order 2t1 is contained in {P}; without loss of generality we may assume

Q2 = P2mt .

Moreover

Q1PQ = P1 orP1+2m2 ,
and hence
Q1P2mt Q = P2mt .
Now Q is permutable with P2mt , one of its own powers, and therefore P2mt  is an operation of order 2. Hence t is 2 and s is unity. If then s is greater than unity, G must contain operations of order 2m and must therefore be cyclical. Moreover if s is unity, the relations
Q1PQ = P1+2m2 ,Q2 = P2m2 ,
lead to
(PQ)2 = 1,
and they are therefore inadmissible.

On the other hand, the relations

Q1PQ = P1,Q2 = P2m2 ,
give
(PxQ)2 = P2m2 ;
and every operation of G, not contained in {P}, is of order 4. Also these relations are clearly self-consistent, and they define a group of order 2m. Hence finally:—

THEOREM V. If a group G, of order 2m, has a single sub-group of order 2s,

s > 1

, it must be cyclical; if it has a single sub-group of order 2, it is either cyclical or of the type defined by

P2m1 = 1,Q2 = P2m2 ,Q1PQ = P1.

64. We shall now proceed to discuss, in application of the foregoing theorems and for the importance of the results themselves, the various types of groups of order pm which contain self-conjugate cyclical sub-groups of orders pm1 and pm2 respectively. It is clear from Theorem V that the case p = 2 requires independent investigation; we shall only deal in detail with the case in which p is an odd prime, and shall state the results for the case when p = 2.

The types of Abelian groups of order pm which contain operations of order pm2 are those corresponding to the symbols (m), (m 1, 1), (m 2, 2), and (m 2, 1, 1). We will assume that the groups which we consider in the following paragraphs are not Abelian.

65. We will first consider a group G, of order pm, which contains an operation P of order pm1. The cyclical sub-group {P} is self-conjugate and contains a single sub-group {Ppm2 } of order p. By Theorem IV, since G is not cyclical, it must contain an operation Q, of order p, which does not occur in {P}. Since {P} is self-conjugate and the group is not Abelian, Q must transform P into one of its own powers. Hence

Q1PQ = Pα,
and since Qp is permutable with P it follows, from § 56, that
α = 1 + kpm2.

Since the group is not Abelian, k cannot be zero; but it may have any value from 1 to p 1. If now

kx 1(modp),
then
QxPQx = P1+pm2 ;
and therefore, writing Q for Qx, the group is defined by
Ppm1 = 1,Qp = 1,Q1PQ = P1+pm2.

These relations are clearly self-consistent, and they define a group of order pm.

There is therefore a single type of non-Abelian group of order pm which contains operations of order pm1, because, for any such group, a pair of generating operations may be chosen which satisfy the above relations.

From the relation

Q1PQ = P1+pm2 ,
it follows by repetition and multiplication that
QyPxQy = Px(1+ypm2) ,
and therefore that
(PxQy)z = Pxz{1+1 2(z+1)ypm2}(1yzpm2) Qyz,
and
(PxQy)p = Pxp.

Hence G contains p cyclical sub-groups of order pm1 of which P and PQy (y = 1, 2,,p 1) may be taken as the generating operations. Since Q and Pp are permutable, G also contains an Abelian non-cyclical sub-group {Q,Pp} of order pm1 It is easy to verify that the 1 + p sub-groups thus obtained exhaust the sub-groups of order pm1; and that, for any other order ps, there are also exactly p + 1 sub-groups of which p are cyclical and one is Abelian of type (s 1, 1).

The reader will find it an instructive exercise to verify the results of the corresponding case where p is 2; they may be stated thus. There are four distinct types of non-Abelian group of order 2m, which contain operations of order 2m1, when m > 3. Of these, one is the type given in Theorem V, and the remaining three are defined by

P2m1 = 1, Q2 = 1, QPQ = P1+2m2 ; P2m1 = 1, Q2 = 1, QPQ = P1+2m2 ; P2m1 = 1, Q2 = 1, QPQ = P1.

When m = 3, there are only two distinct types. In this case, the second and the fourth of the above groups are identical, and the third is Abelian.

66. Suppose next that G, a group of order pm, has a self-conjugate cyclical sub-group {P} of order pm2, and that no operation of G is of higher order than pm2. We may at once distinguish two cases for separate discussion; viz. (i) that in which P is a self-conjugate operation, (ii) that in which P is not self-conjugate.

Taking the first case, there can be no operation Q in G such that Qp2  is the lowest power of Q contained in {P}, for if there were, {Q,P} would be Abelian and, its order being pm, it would necessarily coincide with G. Hence any operation Q, not contained in {P}, generates with P an Abelian group of type (m 2, 1), and we may choose P and Q as independent generators of this sub-group, the order of Q being p. If now R is any operation of G not contained in {Q,P}, Rp must occur in this sub-group, and therefore

Rp = PαQβ.

If β were not zero, Rp2  would be the lowest power of R that occurs in {P}, and we have just seen that this cannot be the case. Hence

Rp = Pα,
and {R,P} is again an Abelian group of type (m 2, 1). If P and R are independent generators of this group, the latter cannot occur in {Q,P}. Now since Q is not self-conjugate,
R1QR = QPβ;
and since Rp is permutable with Q
Ppβ = 1,
so that
β 0(modpm3).

Hence

R1QR = QPkpm3 ,
where k is not a multiple of p. If finally, Pk be taken as a generating operation in the place of P, the group is defined by

Ppm2 = 1,Qp = 1,Rp = 1,R1QR = QPpm3 , PQ = QP,PR = RP.

There is therefore a single type of group of order pm, which contains a self-conjugate operation of order pm2 and no operation of order pm1.

67. Taking next the second case, we suppose that G contains a cyclical self-conjugate sub-group {P} of order pm2, but no self-conjugate operation of this order.

If G contains an operation Q such that Qp2  is the lowest power of Q occurring in {P}, it follows (§ 56), since {P} is self-conjugate, that

Q1PQ = P1+kpm4 .

Moreover, since the order of Q cannot exceed pm2, we have

Qp2 = Pαp2 .

A simple calculation, similar to that of § 65, will now shew that

(PxQ)p2 = P(x+α)p2 ,
while
(PxQ)p = QpPx{p+1 2k(p+1)pm3} .

Hence PαQ is an operation of order p2, none of whose powers, except identity, is contained in {P}. If this operation be represented by Q, G is defined by

Ppm2 = 1,Qp2 = 1,Q1PQ = P1+kpm4 .

If k is a multiple of p2, the group is Abelian.

If k is kp, and if Qα is taken for a new generating operation, where α is chosen so that

αk 1(modp),
we have a single type defined by
Ppm2 = 1,Qp2 = 1,Q1PQ = P1+pm3 .

If k is not a multiple of p, we may take it equal to k1 + k2p, where k1 and k2 are both less than p, and k1 is not zero. (This case cannot occur if m < 5.) Then

Qx1x2pPQx1+x2p = P1+k1x1pm4+(k 1x2+k2x1)pm3 ,
when m > 5; while if m = 5, the coefficient of pm3, viz. of p2, in the index of P must be increased by 1 2x1(x1 1)k12.

If now we choose x1 so that

k1x1 = 1 + y1p,
and then x2 so that
y1 + k1x2 + k2x1 0(modp),
(with the suitable modification when m = 5), then Qx1+x2p transforms P into P1+pm4 . We therefore again in this case get a single type of group, which, if Qx1+x2p is represented by R, is defined by
Ppm2 = 1,Rp2 = 1,R1PR = P1+pm4 .
As already stated, this type exists only when m > 4.

If every operation of G is such that its pth power occurs in {P}, P must be one of a set of p conjugate operations; for if P is one of p2 conjugate operations, there must be an operation Q which transforms P into P1+kpm4 , where k is not a multiple of p, and then Qp2 is the lowest power of Q which is permutable with P. Since P is one of p conjugate operations, it must be self-conjugate in an Abelian group {Q,P} of type (m 2, 1). Again, since P and P1+pm3 are conjugate operations, P must be contained in a group of order pm1, defined by

Ppm2 = 1,Rp = 1,R1PR = P1+pm3 .

If Q is not a self-conjugate operation, it must be one of p conjugate operations and (§ 57) these must be

Q,QPpm3 ,QP2pm3 ,,QP(p1)pm3 .

Now if

R1QR = QPαpm3 ,
then
R1PαQR = PαQ.
Hence, if Q is not self-conjugate, PαQ is a self-conjugate operation of order pm2: and the group is that determined in the last paragraph. Therefore Q must be self-conjugate, and the group is defined by

Ppm2 = 1,Qp = 1,Rp = 1,R1PR = P1+pm3 , PQ = QP,RQ = QR.

It is clear from these relations that the group thus arrived at is the direct product of the groups {P,R} and {Q}21.

It is to be expected, from the result of the corresponding case at the end of § 65, that the number of distinct types when p = 2 is much greater than when p is an odd prime. There are, in fact, when m > 5, fourteen distinct types of groups of order 2m, which contain a self-conjugate cyclical sub-group of order 2m2 and no operation of order 2m1. They may be classified as follows.

Suppose first that the group has a self-conjugate operation of order 2m2. There is then a single type defined by the relations

 (i)A2m2 = 1,B2 = 1,C2 = 1,CBC = BA2m3 .

Suppose next that the group G has no self-conjugate operation of order 2m2, and let {A} be a self-conjugate cyclical sub-group of order 2m2. If G {A} is cyclical, there are, when m > 5, five distinct types. The common defining relations of these are

A2m2 = 1,B4 = 1,B1AB = Aα;
and the five distinct types are

 (ii)α = 1, (iii)α = 1 + 2m3, (iv)α = 1 + 2m3,  (v)α = 1 + 2m4, (vi)α = 1 + 2m4.

If m = 5, then (iv) and (v) are identical, and (vi) is Abelian; so that there are only three distinct types. If m = 4, there is a single type; it is given by (ii).

When G {A} is not cyclical, the square of every operation of G is contained in {A}. If all the self-conjugate operations of G are not contained in {A}, there must be a self-conjugate operation B, of order 2, which does not occur in {A}. If C is any operation of G, not contained in {A,B}, then {A,C} is a self-conjugate sub-group of order 2m1, which has no operation except identity in common with {B}. Hence G is a direct product of a group of order 2 and a group of order 2m1. There are therefore, for this case, four types (vii), (viii), (ix), (x), when m > 4, corresponding to the four groups of order 2m1 of § 65. If m = 4, there are two types.

Next, let all the self-conjugate operations of G be contained in {A}; and suppose that A is one of two conjugate operations. Then G must contain an Abelian sub-group of type (m 2,1), in which A occurs; and it may be shewn that, when m > 4, there are two types defined by the relations

(xi)and (xii) A2m2 = 1,B2 = 1,BAB = A,C2 = 1, CBC = BA2m3 ,CAC = A1 orA1+2m3 .
When m = 4, there is, for this case, no type.

Lastly, suppose that A is one of four conjugate operations. Then G must contain sub-groups of order 2m1, of the second and the third types of § 65, and a sub-group of order 2m1 of either the first or fourth type (l.c.). In this last case, there are two distinct types defined by

(xiii)and (xiv)A2m2 = 1,B2 = 1,BAB = A1+2m3 , C2 = 1,CAC = A1+2m3 ,CBC = B orBA2m3 .
These two types exist only when m > 4.

68. We shall now, as a final illustration, determine and tabulate all types of groups of orders p2p3 and p4. It has been already seen that when p = 2 the discussion must, in part at least, be distinct from that for an odd prime; for the sake of brevity we shall not deal in detail with this case, but shall state the results only and leave their verification as an exercise to the reader.

It has been shewn (§ 53) that all groups of order p2 are Abelian; and hence the only distinct types are those represented by (2) and (1,1).

For Abelian groups of order p3, the distinct types are (3), (2,1) and (1,1,1).

If a non-Abelian group of order p3 contains an operation of order p2, the sub-group it generates is self-conjugate; hence (§ 65) in this case there is a single type of group defined by

Pp2 = 1,Qp = 1,Q1PQ = P1+p.

If there is no operation of order p2, then since there must be a self-conjugate operation of order p, the group comes under the head discussed in § 66; there is again a single type of group defined by

Pp = 1,Qp = 1,Rp = 1,R1QR = QP, R1PR = P,Q1PQ = P.

These two types exhaust all the possibilities for non-Abelian groups of order p3.

69. For Abelian groups of order p4, the possible distinct types are (4), (3,1), (2,2), (2,1,1) and (1,1,1,1).

For non-Abelian groups of order p4 which contain operations of order p3 there is a single type, namely that given in § 65 when m is put equal to 4.

For non-Abelian groups which contain a self-conjugate cyclical sub-group of order p2 and no operation of order p3, there are three distinct types, obtained by writing 4 for m in the group of § 66 and in the first and the last groups of § 67. The defining relations of these need not be here repeated, as they will be given in the summarizing table (§ 73).

It remains now to determine all distinct types of groups of order p4, which contain no operation of order p3 and no self-conjugate cyclical sub-group of order p2. We shall first deal with groups which contain operations of order p2.

Let S be an operation of order p2 in a group G of order p4. The cyclical sub-group {S} must be self-conjugate in a non-cyclical sub-group {S,T} of order p3, defined by

Sp2 = 1,Tp = 1,T1ST = S1+kp.

If R is any operation of G, not contained in {S,T}, then since {S} is not self-conjugate, we must have (§ 57)

R1SR = S1+αpTβ,
and therefore
R1SpR = Sp.

Now

T1SpT = Sp,
and therefore the pth power of every operation of order p2 in G is a self-conjugate operation.

First let us suppose that G contains other self-conjugate operations besides those of {Sp}. Every such operation must occur in the group that contains {S} self-conjugately; hence in this case T must be self-conjugate.

We now therefore have

Sp2 = 1,Tp = 1,T1ST = S, R1SR = S1+αpTβ,R1TR = T, Rp = SγpTδ.

These equations give

(SxR)p = RpSxp = S(x+γ)pTδ.

Hence, if δ = 0, SγR is an operation of order p. Denoting this by R and SαpTβ by T, the group is defined by

Sp2 = 1,Tp = 1,Rp = 1,R1SR= ST, T1ST= S,R1TR= T.

On the other hand, if δ is not zero, Sδα β γR is an operation of order p2 such that R transforms it into a power of itself. This is contrary to the supposition that the group contains no cyclical self-conjugate sub-group of order p2. Hence δ cannot be different from zero: we therefore have only one type of group.

70. Next, let {Sp}contain all the self-conjugate operations of G; and as before, let {S,T}be the group that contains {S} self-conjugately. If G contains an operation S of order p2 which does not occur in {S,T}, there must also be a non-cyclical sub-group {S,T} of order p3 which contains {S} self-conjugately. Now {S,T}and {S,T} must have a common sub-group of order p2; since this is self-conjugate in G, it cannot be cyclical. The only non-cyclical sub-groups of orders p2 that {S,T}and {S,T} contain are {Sp,T}and {Sp,T}. Hence these must be identical, and therefore T must occur in {S,T}. If now {S,T}and {S,T} were both Abelian, T would be permutable both with S and with S, and would therefore, contrary to supposition, be a self-conjugate operation. Hence either (i) G must contain a non-Abelian group {S,T} of order p3, in which S is an operation of order p2; or (ii) the Abelian group {S,T}, in which S is an operation of order p2, must contain all the operations of G of order p2.

In the case (i), the group is defined by

Sp2 = 1,Tp = 1,T1ST = S1+p, R1SR = S1+αpTβ,R1TR = SγpT, Rp = Sδp.

These equations give

(SxR)p = RpSxp{1+1 6(p1)p(p+1)β(γ2)},
and therefore, except when p = 3, SδR is an operation of order p. Hence, if p > 3, we may, without loss of generality, put zero for δ. In this case a simple calculation gives
RxSRx = S1+αxpTβx ,RxTRx = SγxpT,
where
αx = 1 2βγx(x 1) + xα,βx = xβ,γx = xγ.

Hence if Rx = R, Sy = S, SzpT = T, where xy and z are not multiples of p, then

Sp2 = 1,Tp = 1,T1ST= S1+p, R1SR= S1+(αxzβx)pTyβ, R1TR= Sγxp y T,Rp = 1.

If now we take

z αx βx,y 1 βx(modp),
then
R1SR= ST,R1TR= Sx2βγpT.

Dropping the accents, the defining relations now become

Sp2 = 1,Tp = 1,Rp = 1,T1ST = S1+p, R1SR = ST,R1TR = SαpT;

where α is either zero, unity, or any given non-residue. Since the sub-group {R,T,Sp} contains all the operations of order p of the group, it follows at once that these three cases give three distinct types.

When p = 3, it will be found that the defining relations again give three distinct types. The operation R may always be chosen so that α and γ are zero. If it is so chosen, the three types correspond to the values 10; 11; and 1 1; of β and δ.

In case (ii), the group is defined by

Sp2 = 1,Tp = 1,T1ST = S, R1SR = S1+αpTβ,R1TR = SγpT, Rp = 1;

with the condition that all operations of G, not contained in {S,T}, are of order p.

The formulæ for RxSRx and RxTRx enable us to calculate directly the power of any given operation of G. Thus they give

(SxR)p = Spx{1+1 6βγ(p+1)p(p1)+1 2αp(p+1)}.

If p > 3, this gives

(SxR)p = Spx,
so that, if x is not a multiple of p, the order of SxR is p2. Hence the type of group under consideration can only occur when p = 3.

In this case

(SxR)3 = S3x(1+βγ).

Hence if p = 3 and βγ 1(mod3), we obtain a new type. A reduction similar to that in the previous case may now be effected; and taking unity for x, the group is defined by

S9 = 1,T3 = 1,R3 = 1,T1ST = S, R1SR = ST,R1TR = S3T.

71. It only remains to determine the distinct types which contain no operation of order p2.

Suppose first that the self-conjugate operations of G form a group of order p2. This must be generated by two independent operations P and Q of order p.

If now R is any other operation of the group, {P,Q,R}must be an Abelian group of type (1,1,1). If again S is any operation not contained in {P,Q,R}, it cannot be permutable with R; for if it were, R would be self-conjugate. There must therefore be a relation of the form (§ 57)

S1RS = RPαQβ.

Since any operation of {P,Q} may be taken for one of its generating operations, we may take PαQβ or P for one. If then Q is an independent operation of {P,Q}, G will be defined by

Pp = 1,Qp = 1,Rp = 1,Sp = 1,S1RS = RP,
in addition to the relations expressing that P and Q are self-conjugate. There is then in this case a single type. That all the operations of G in this case are actually of order p follows from the obvious fact that every sub-group of order p3 is either Abelian or of the second type of non-Abelian groups of order p3.

72. Suppose, secondly, that the self-conjugate operations of G form a sub-group of order p, generated by P. There must then be some operation Q which belongs to a set of p conjugate operations; for if every operation of G which is not self-conjugate were one of a set of p2 conjugate operations, the total number of operations in the group would be congruent to p(modp2). It follows that Q must be self-conjugate in a group of order p3; and since P is also self-conjugate in this group, it must be Abelian. Let PQR be generators of this group and S any operation of G not contained in it. We may now assume that Q belongs to the sub-group H2 (§ 53), and therefore that

S1QS = QPα,
while
S1RS = RQβPγ.

If β were zero, Q1 α R1 γ would be a self-conjugate operation not contained in {P}; and therefore β must be different from zero. We may now put

QβPγ = Q,Pαβ = P;
and the group is then defined by the relations

Pp = 1,Qp = 1,Rp = 1,Sp = 1, S1RS = RQ,S1QS = QP,

together with the relations expressing that P is self-conjugate. There is thus again in this case, at most, a single type. It remains to determine whether the operations are all actually of order p.

The defining relations give

S1Pαx Qβx Rγx S = Pαx+1 Qβx+1 Rγx+1 ,
where
αx+1 = αx + βx,βx+1 = βx + γx,γx+1 = γx;
and therefore
SxPαQβRγSx = Pαx Qβx Rγx ,
where
αx = α + xβ + 1 2x(x 1)γ,βx = β + xγ,γx = γ.

Hence

(PαQβRγS)p = P 1pαx Q 1pβx R 1pγx = Ppα+1 2p(p1)β+1 6(p+1)p(p1)γQpβ+1 2p(p1)γRpγ.

If p is a greater prime than 3, the indices of PQR are all multiples of p; hence PαQβRγS is of order p, S being any operation not contained in G. If however p = 3, then

(PαQβRγS)3 = Pγ,
so that, if γ is not a multiple of 3, PαQβRγS is an operation of order 9. Hence this last type of group exists as a distinct type for all primes greater than 3; but for p = 3, it is not distinct from one of the previous types containing operations of order 9.

73. In tabulating, as follows, the types of group thus obtained, we give with each group G a symbol of the form

(a,b,)(a,b,)(a,b,),
indicating the types of H1, H2 H1, H3 H2, …, where
H1,H2,H3,,Hn,G
is the series of self-conjugate sub-groups defined in § 53. This symbol is to be read from the left so that (a,b,) is the type of H1.

Moreover in each group there is no operation of higher order than that denoted by P.

Table of groups of order pn, p an odd prime22.

I. n = 2, two types.

    (i) (2); (ii) (1, 1).

II. n = 3, five types.

    (i) (3); (ii) (2, 1); (iii) (1, 1, 1);

    (iv) Pp2 = 1, Qp = 1, Q1PQ = P1+p, (1)(11);

    (v) Pp = 1,Qp = 1,Rp = 1,R1QR = QP, R1PR = P,Q1PQ = P,(1)(11).

III. n = 4, fifteen types.

    (i) (4); (ii) (3, 1); (iii) (2, 2);

    (iv) (2, 1, 1); (v) (1, 1, 1, 1);

    (vi) Pp3 = 1, Qp = 1, Q1PQ = P1+p2 , (2)(11);

    (vii) Pp2 = 1,Qp = 1,Rp = 1,R1QR = QPp, Q1PQ = P,R1PR = P,(2)(11);

    (viii) Pp2 = 1, Qp2 = 1, Q1PQ = P1+p, (11)(11);

    (ix) Pp2 = 1,Qp = 1,Rp = 1,R1PR = P1+p, P1QP = Q,R1QR = Q,(11)(11),
this group (ix) being the direct product of {Q} and {P,R};

    (x) Pp2 = 1,Qp = 1,Rp = 1,R1PR = PQ, Q1PQ = P,R1QR = Q,(11)(11);

    (xi), (xii), and (xiii) p > 3,

Pp2 = 1,Qp = 1,Rp = 1,Q1PQ = P1+p, R1PR = PQ,R1QR = PαpQ,(1)(1)(11),

where for (xi) α = 0, for (xii) α = 1, for (xiii) α = any non-residue, (modp);

    (xi), (xii), and (xiii) p = 3,

P9 = 1,Q3 = 1,R3 = P3α,Q1PQ = P4, R1PR = PQβ,R1QR = Q,(1)(1)(11),

where for (xi) α = 0, β = 1, for (xii) α = 1, β = 1, for (xiii) α = 1, β = 1.

    (xiv) Pp = 1,Qp = 1,Rp = 1,Sp = 1,S1RS = RP, S1QS = Q,S1PS = P,R1QR = Q, R1PR = P,Q1PQ = P,(11)(11),
this group (xiv) being the direct product of {Q} and {P,R,S};

    (xv) p > 3,

Pp = 1,Qp = 1,Rp = 1,Sp = 1,S1RS = RQ,S1QS = QP, S1PS = P,R1QR = Q,R1PR = P, Q1PQ = P,(1)(1)(11);

    (xv) p = 3,

P9 = 1,Q3 = 1,R3 = 1,Q1PQ = P,R1PR = PQ, R1QR = P3Q,(1)(1)(11).

74. To complete the list, we add, as was promised in § 68, the types of non-Abelian groups of orders 23 and 24; the possible types of Abelian groups being the same as for an odd prime.

Non-Abelian groups of order 23; two types.

    (i) identical with II (iv), writing 2 for p;

    (ii) P4 = 1, Q4 = 1, Q1PQ = P1, Q2 = P2, (1)(11).

Non-Abelian groups of order 24; nine types.

    (i), (ii), (iii), (iv) and (v) identical with III (vi), (vii), (viii), (ix) and (x), writing 2 for p;

    (vi) P4 = 1,Q4 = 1,R2 = 1,Q1PQ = P1, Q2 = P2,R1QR = Q,R1PR = P,(11)(11),
this group (vi) being the direct product of {R} and {P,Q};

    (vii) P8 = 1, Q2 = 1, Q1PQ = P1, (1)(1)(11);

    (viii) P8 = 1, Q2 = 1, Q1PQ = P3, (1)(1)(11);

    (ix) P8 = 1, Q4 = 1, Q1PQ = P1, Q2 = P4, (1)(1)(11).

75. In the following examples, G is a non-Abelian group whose order is the power of a prime p; and the sub-groups H1, H2, …, Hn referred to are the series of self-conjugate sub-groups of § 53.

Ex. 1. If P and Q are any two operations of G, the totality of operations of the form P1Q1PQ generate a self-conjugate sub-group identical with or contained in Hn.

Ex. 2. Shew that, if every sub-group of G is Abelian, G H1 is an Abelian group of type (1,1); and any two operations of G, neither of which belongs to H1 and neither of which is a power of the other, generate G.

Ex. 3. If G Hn, Hn Hn 1, Hn1 Hn2, … are of types (1,1), (1), (1), …, shew that G can be generated by two operations.

Ex. 4. If G, of order pm, is not Abelian, and if every sub-group of G is self-conjugate, shew that p must be 2. (Dedekind.)

Ex. 5. If G is of order pm, and H1 of type (1,1,, with m 2 units), and if m > 5, G is the direct product of two groups. If m = 5, there is one type for which G is not a direct product, viz. 

Q1p2 = 1,Q2p2 = 1,Pp = 1,Q 21Q 1Q2 = Q1P, Q11PQ 1 = P,Q21PQ 2 = P.

Ex. 6. A group G, of order pm, (m > 4), where p is an odd prime, contains an operation P of order pm2, and no cyclical self-conjugate sub-group of order pm2. Shew that, if P is one of a set of p2 conjugate operations, the defining relations of the group are of the form

Ppm2 = 1,Qp = 1,Q1PQ = P1+pm3 ,Rp = PαpQβ, R1QR = Q,R1PR = P1+βpm4 Q;

and that, if P is one of a set of p conjugate operations, the defining relations are of the form

Ppm2 = 1,Qp = 1,Q1PQ = P,Rp = Qα, R1QR = Pβpm3 Q,R1PR = PQ.

Determine in each case the number of distinct types.