up | next | prev | ptail | tail |
I t has been proved (§ 22) that the order of any sub-group of a group is a factor of the order of ; and it results at once from the investigation of §§ 45–47 that, in an Abelian group, there is always at least one sub-group whose order is any given factor of the order of the group. The latter result is not however generally true for groups which are not Abelian; and for factors of the order of a group which contain more than one distinct prime, no general law is known as to the existence or non-existence of corresponding sub-groups. If however , where is a prime, divides the order of the group, it may be shewn that the group will always contain a sub-group of order . The special form of this theorem, that a group whose order is divisible by a prime contains operations of order , is due originally to Cauchy23. The more general result was first established by Sylow. He has shewn24 that, if is the highest power of a prime which divides the order of a group, the group contains a single conjugate set of sub-groups of order .
For the special case , the following proof of Cauchy’s theorem is perhaps worth giving for its simplicity. Arrange the operations of a group of even order in pairs and of inverse operations. If at any stage no further pairs can be formed, the remaining operations must all, except the identical operation, be of order . The number of these remaining operations, which include the identical operation, is even. Hence there must be at least one operation of order , and the total number of such operations is odd.
We shall devote the present chapter to the proof of Sylow’s theorem; and a consideration of some of its more immediate consequences. These constitute, as will be seen later on, a most important set of results.
77. We shall divide the proof of Sylow’s theorem into two parts. First we shew that, if is the highest power of a prime which divides the order of a group, the group must have a sub-group of order ; and secondly that the sub-groups of order form a single conjugate set and that their number is congruent to unity, .
Lemma. If is the highest power of a prime by which the order of a group is divisible, must contain a sub-group whose order is divisible by .
If the group is Abelian, this has been already proved in § 37. Suppose then that of order (, where is prime to ) is not Abelian; and let of order be the sub-group of formed of its self-conjugate operations. If is any operation of which is not self-conjugate, and if is the order of the greatest sub-group within which is permutable, forms one of a set of conjugate operations; hence, by equating the order of the group to the sum of the numbers of operations contained in the different conjugate sets, we obtain the equation
where the sign of summation is extended to all the different conjugate sets of those operations which are not self-conjugate.If is not divisible by , or in other words if contains no self-conjugate operations of order , this equation requires that at least one of the symbols should be divisible by ; therefore in this case the lemma is true.
If is divisible by , the group , being Abelian, must contain a sub-group of order ; and this sub-group is self-conjugate in . Consider now the group of order . If it has no self-conjugate operations of order , it must (by the result just obtained) contain a sub-group whose order is divisible by ; and hence contains a sub-group whose order is divisible by . If, on the other hand, has a sub-group of self-conjugate operations of order , then must contain a self-conjugate sub-group of order , say . We may now repeat the same reasoning with the group of order . In this way we must in any case be ultimately led to a sub-group of whose order is divisible by . The lemma is therefore established.
We have as an immediate inference:—
THEOREM I. If is the highest power of a prime which divides the order of a group, the group contains a sub-group of order .
For the group contains a sub-group whose order is divisible by ; this sub-group must itself contain a sub-group whose order is divisible by , and so on. Hence at last a sub-group must be arrived at whose order is .
Corollary. Since it has been seen in § 53 that a group of order contains sub-groups of every order (), it follows that, if the order of a group is divisible by , the group must contain a sub-group of order . In particular, a group whose order is divisible by a prime has operations of order .
78. THEOREM II. If is the highest power of a prime which divides the order of a group , the sub-groups of of order form a single conjugate set, and their number is congruent to unity, .
If is a sub-group of of order , the only operations of , which are permutable with and have powers of for their orders, are the operations of itself. For if is an operation of order , not contained in and permutable with it, and if is the order of the greatest group common to and , the order of is . But can have no such sub-group, since is not a factor of the order of .
Suppose now that is any sub-group conjugate to ; and let be the order of the group common to and . When is transformed by all the operations of , the operations of are the only ones which transform into itself. Hence the operations of can be divided into sets of each, such that the operations of each set transform into a distinct sub-group. In this way, sub-groups are obtained distinct from each other and from and conjugate to . If these sub-groups do not exhaust the set of sub-groups conjugate to , let be a new one. From another set of sub-groups can be formed, distinct from each other and from and conjugate to . Moreover no sub-group of this latter set can coincide with one of the previous set. For if
where and are operations of , then where () is an operation of ; and this is contrary to the supposition that is different from each group of the previous set. By continuing this process, it may be shewn that the number of sub-groups in the conjugate set containing is where no one of the indices , , … can be less than unity. The number of sub-groups in the conjugate set containing is therefore congruent to unity, .If now contains another sub-group , of order , it must belong to a different conjugate set. The number of sub-groups in the new set may be shewn, as above, to be congruent to unity, . But on transforming by the operations of , a set of conjugate sub-groups is obtained, where is the order of the sub-group common to and . A further sub-group of the set, if it exists, gives rise to additional conjugate sub-groups, distinct from each other and from the previous . Proceeding thus we shew that the number of sub-groups in the conjugate set is a multiple of ; and as it cannot be at once a multiple of and congruent to unity, , the set does not exist. The sub-groups of order therefore form a single conjugate set and their number is congruent to unity, .
Corollary I. If is the order of the greatest group , within which the group of order is contained self-conjugately, the order of the group must be of the form
Corollary II. The number of groups of order contained in , i.e. the factor in the preceding expression for the order of the group, can be expressed in the form
where is the number of groups having with a given group of the set greatest common sub-groups of order .This follows immediately from the arrangement of the set of groups given in the proof of the theorem. Thus each of the groups, obtained on transforming by the operations of , has in common with a greatest common sub-group of order . It may of course happen that any one or more of the numbers , , …, is zero. If no two sub-groups of the set have a common sub-group whose order is greater than , then , , …, all vanish; and the number of sub-groups in the set is congruent to unity, . Conversely, if is the highest power of that divides , some two sub-groups of the set must have a common sub-group whose order is not less than ; for if there were no such common sub-groups, the number of sub-groups in the set would be congruent to unity, .
Corollary III. Every sub-group of whose order is , (), must be contained in one or more sub-groups of order .
For if the sub-group of order is contained in no sub-group of order , the only operations whose orders are powers of that transform it into itself are its own. In this case, the preceding method may be used to shew that the number of sub-groups in the conjugate set to which the given sub-group belongs must be congruent to unity, . But this is impossible, as the number of such sub-groups must, on the assumption made, be a multiple of . The sub-group of order is therefore contained in one of order , and hence repeating the same reasoning in one of order .
79. We shall refer to Theorems I and II together as Sylow’s theorem. In discussing in this and the following paragraphs some of the results that follow from Sylow’s theorem, we shall adhere to the notation that has been used in establishing the theorem itself. Thus will always denote the highest power of a prime which divides the order of ; the sub-groups of of order will be denoted by , , …, and the greatest sub-groups of that contain these self-conjugately by , , …. These latter form a single conjugate set of sub-groups of , whose orders are , the order of itself being . Moreover the number of groups in this conjugate set is .
Suppose now that is any operation of whose order is a power of . When the sub-groups
are transformed by , each one that contains is transformed into itself, while the remainder are interchanged in sets, the number in any set being a power of . Hence the number of these groups which contain must be congruent to unity, . In precisely the same way, it may be shewn that the number of sub-groups of order , which contain a given sub-group of order , is congruent to unity, .A sub-group (or operation), having a power of for its order and occurring in sub-groups of order , will not necessarily be one of the same number of conjugate sub-groups (or operations) in each of these sub-groups. If then is a sub-group, of order , that occurs in sub-groups of order , we may choose one of these, say , in which is one of as small a number as possible of conjugate sub-groups. Let this number be , so that, in , is self-conjugate in a group of order . Then in , the order of the greatest group , in which is self-conjugate, must be , where is relatively prime to . The number of sub-groups of of order must be congruent to unity, . No two of these groups of order can occur in the same group of order ; for if they did, they would generate a group of order , (), and this is impossible, being the highest power of that divides the order of . Moreover the number of groups of order in which any one of these groups of order enters is congruent to unity, . Hence the number of groups of order , in which is one of (the least possible number) conjugate sub-groups, is congruent to unity, . Suppose now that, in , is one of () conjugate sub-groups; so that in it is self-conjugate in a sub-group of order and in no greater sub-group. Then the highest power of that divides the order of the group common to and is ; and therefore, when is transformed by all the operations of , the number of groups of order formed is a multiple of . In each of these groups, is one of conjugate sub-groups. If this does not exhaust all the groups of order in which is one of conjugate sub-groups, let be another. Then from this another set of groups, whose number is a multiple of , may be formed, which are distinct from each other and from the previous set, such that in each of them is one of conjugate sub-groups. This process may clearly be continued till all such groups are exhausted. Hence the number of groups of order , in which is one of () conjugate sub-groups, is a multiple of . If enters as one of conjugate sub-groups in , a sub-group conjugate to must enter as one of conjugate sub-groups in . Hence if , , , … are the orders of the greatest sub-groups that contain self-conjugately in the various sub-groups of order in which it appears, then must contain sub-groups of the conjugate set (in ) to which belongs in conjugate sets of , , , … only. The total number of such sub-groups contained in is clearly connected with the total number of sub-groups of order , in which appears, by the relation
being the number of sub-groups in the conjugate set. For every sub-group of order will contain of the set: and the two sides of the equation represent two distinct ways of reckoning all the sub-groups of the set contained in the sub-groups of the set , when all repetitions are counted.It is to be noticed that, with the above notation,
and therefore80. THEOREM III. Let be the highest power of a prime which divides the order of a group , and let be a sub-group of of order . Let be a sub-group common to and some other sub-group of order , such that no sub-group, which contains and is of greater order, is common to any two sub-groups of order . Then there must be some operation of , of order prime to , which is permutable with and not with 25.
Suppose that and are two groups of order to which is common; and let and be sub-groups of and , of greater order than , in which is self-conjugate. If and generate a group whose order is a power of , it must occur in some group of order ; and then and have a common group , which contains and is of greater order. This is contrary to supposition, and therefore the order of the group generated by and is not a power of . Hence is permutable with some operation whose order is prime to .
Let be the order of , and be the order of the greatest sub-group of that contains self-conjugately. If contained a self-conjugate sub-group of order , and would be sub-groups of it and they would generate a group whose order is a power of . This is not the case, and therefore must contain sub-groups of order , so that we may write for ; and then, in , a sub-group of order is self-conjugate in a sub-group of order . No sub-group of of order () can occur in more than one sub-group of order ; and the sub-groups of of order belong therefore to distinct sub-groups of order . Moreover occurs in no sub-groups of order other than these . For if occurred in another sub-group , it would in this sub-group be self-conjugate in a group of order (); and this group would occur in . This group would then be common to two sub-groups of order , contrary to supposition.
An operation of , which transforms one of its sub-groups of order into another, must transform the sub-group of order containing the one into that containing the other. Hence must contain operations which are not permutable with . The greatest common sub-group of and is that sub-group of of order which contains the sub-group of order belonging to self-conjugately. For every operation, that transforms this sub-group of order into itself, must transform into itself; and no operation can transform into itself which transforms this sub-group of order into another.
81. Let be an operation, or sub-group, which is self-conjugate in ; and let be another operation, or sub-group, of , which is conjugate to in , but not conjugate to in . Suppose first that, if possible, is self-conjugate in . There must be an operation which transforms into and into some other sub-group , so that
Now in the sub-group which contains self-conjugately, the sub-groups of order form a single conjugate set, and must occur among them. Hence this sub-group must contain an operation such that
and It follows thator that, contrary to supposition, and are conjugate in . Hence:—
THEOREM IV. Let and be defined as in the previous theorem, and let be the greatest sub-group of which contains self-conjugately. Then if and are two self-conjugate operations or sub-groups of , which are not conjugate in , they are not conjugate in .
Corollary. If is Abelian, no two operations of which are not conjugate in can be conjugate in . Hence the number of distinct sets of conjugate operations in , which have powers of for their orders, is the same as the number of such sets in .
82. Suppose next that is not self-conjugate in . Then every operation that transforms into must transform into a sub-group of order in which is not self-conjugate. Of the sub-groups of order , to which belongs and in which is not self-conjugate, choose so that, in , forms one of as small a number of conjugate operations or sub-groups as possible. Let be the greatest sub-group of that contains self-conjugately. Among the sub-groups of order that contain self-conjugately, there must be one or more to which belongs. Let be one of these; and suppose that and are the greatest sub-groups of and respectively that contain self-conjugately. The orders of both and must (Theorem II, § 55) be greater than the order of ; and in consequence of the assumption made with respect to , every sub-group, having a power of for its order and containing , must contain self-conjugately.
Now consider the sub-group . Since it does not contain self-conjugately, its order cannot be a power of . Also if is the highest power of that divides its order, it must contain more than one sub-group of order . For any sub-group of order , to which belongs, contains self-conjugately; and any sub-group of order , to which belongs, does not. Suppose now that is an operation of , having its order prime to and transforming a sub-group of of order , to which belongs, into one to which belongs. Then cannot be permutable with ; for if it were, would be self-conjugate in each of these sub-groups of order .
When is an operation, we may reason in the same way with respect to .
Since is self-conjugate in both and , must transform into itself. Now is self-conjugate in , and therefore is also self-conjugate in for all values of . If then is the first power of which is permutable with , the series of groups , , …, are all distinct and each is a self-conjugate sub-group of . Every group in this series is therefore permutable with every other. Hence:—
THEOREM V. If and are defined as in the two preceding theorems, and if is a self-conjugate sub-group or operation of , then either (i) must be self-conjugate in every sub-group of , of order , in which it enters, or (ii) there must be an operation , of order prime to , such that the set of sub-groups
are all distinct and permutable with each other.
83. In illustration of Sylow’s theorem and its consequences, we will now consider certain special types of group; and we will deal first with a group whose order is the product of two different primes.
If and () are distinct primes, a group of order must, by Sylow’s theorem, have a self-conjugate sub-group of order . If is not congruent to unity, , the group must also have a self-conjugate sub-group of order . The two self-conjugate sub-groups of orders and can have no common operation except the identical operation; and therefore (Theorem IX, § 34) every operation of one must be permutable with every operation of the other. Hence if is not congruent to unity, , a group of order must be Abelian, and therefore also cyclical.
If is congruent to unity, , there may be either or conjugate sub-groups of order .
If there is one, it is self-conjugate and the group is cyclical.
If there are sub-groups of order , let denote an operation which generates one of them. Then if is an operation of order ,
therefore so that Hence If were unity, would be permutable with , and would not be one of conjugate sub-groups. Hence must be a primitive root of the above congruence.A group of order , which has conjugate sub-groups of order , must therefore, when it exists, be defined by the relations
where is a primitive root of the congruence26It follows from § 33 that the order of the group defined by these relations cannot exceed . But also from the given relations it is clearly impossible to deduce new relations of the form
where and are less than , and and are less than ; hence the order cannot be less than .Again, let be a primitive root of the congruence, distinct from , so that
Then if, in the group defined by
we represent by , the defining relations become and the group is simply isomorphic with the previous group.Hence finally, when is congruent to unity, , there is a single type of group of order , which contains conjugate sub-groups of order .
84. We will next deal with the problem of determining all distinct types of group of order .
A group of order must contain either or sub-groups of order , and either or sub-groups of order . If it has one sub-group of order and one sub-group of order , the group must, since each of these sub-groups is self-conjugate, be their direct product. We have seen (§§ 68, 74) that there are five distinct types of group of order ; there are therefore five distinct types of group of order , which are obtained by taking the direct product of any group of order and a group of order .
If there are groups of order , some two of them must (Theorem II, Cor. II, § 78) have a common sub-group of order ; and (Theorem III, § 80) this common sub-group must be a self-conjugate sub-group of the group of order . Moreover if, in this case, a sub-group of order is Abelian, each operation of the self-conjugate sub-group of order must (Theorem IV, Cor. § 81) be a self-conjugate operation of the group of order .
With the aid of these general considerations, it now is easy to determine for each type of group of order , the possible types of group of order , in addition to the five types already obtained.
(i) Suppose a group of order to be cyclical, and let be an operation that generates it. If is self-conjugate and is an operation of order , then
and therefore Hence and therefore so that and are permutable. This is one of the types already obtained. Hence for a new type, cannot be self-conjugate, and must be a self-conjugate operation; is therefore one of two conjugate operations, while is self-conjugate. Hence the only possible new type in this case is given by(ii) Next, let a group of order be an Abelian group defined by
If this is self-conjugate, then, by considerations similar to those of the preceding case, we infer that the group is the direct product of groups of orders and . Hence there is not in this case a new type.
If the group of order is not self-conjugate, the self-conjugate group of order may be either or . In either case, if is an operation of order , it must be one of two conjugate operations while is self-conjugate. Hence there are two new types respectively given by
and(iii) Let a group of order be an Abelian group defined by
If it is self-conjugate, and if the group of order is not the direct product of groups of orders and , an operation of order must transform the operations of order among themselves; and it must therefore be permutable with one of them. Now the relations
are not self-consistent, because they give Hence, since the group of order is generated by , and any other operation of order except , we may assume, without loss of generality, that These relations give and thereforeNow if
and if then so that the two alternatives and lead to simply isomorphic groups.Hence there is in this case a single type. It is the direct product of and , where
If the group of order is not self-conjugate, the self-conjugate group of order may be taken to be ; and being an operation of order , there is a single new type given by
(iv) Let a group of order be a non-Abelian group defined by
and let be an operation of order . If the group of order is self-conjugate, and the group of order is not a direct product of groups of orders and , must transform the sub-groups of order , , and , among themselves. Hence we may take and If transforms into , then and cannot be an operation of order . Hence in this case there is only one new type, given byIf the sub-group of order is not self-conjugate, the self-conjugate sub-group of order is cyclical, and each of its operations must be permutable with . Hence again we get a single new type, given by
(v) Lastly, let a sub-group of order be a non-Abelian group defined by
This contains one cyclical and two non-cyclical sub-groups of order . If it is self-conjugate, the group of order must therefore be the direct product of groups of orders and ; and there is no new type.
If the sub-group of order is not self-conjugate, and the self-conjugate sub-group of order is the cyclical group , then must be permutable with an operation of order , and there is a single new type given by
If the self-conjugate sub-group of order is not cyclical, it may be taken to be . If is permutable with each operation of this sub-group, there is a single type given by
If is not permutable with every operation of the self-conjugate sub-group, it must transform , , among themselves and we may take
Now is self-conjugate, and therefore must transform into another operation of order contained in this sub-group. Hence
The only values of , , which are consistent with the previous relation
areThe last new type is therefore defined by
When is eliminated between these relations, it will be found that the only independent relations remaining are
It is a good exercise to verify that these form a complete set of defining relations for the group. (Compare Ex. 1, § 35.)
There are therefore, in all, fifteen distinct types of group of order . The last of these is the only type, which has neither a self-conjugate sub-group of order , nor one of order . The reader should satisfy himself, as an exercise, that, in the ten cases where the group is not a direct product of groups of orders and , the defining relations which we have given are self-consistent. This is of course an essential part of the investigation, and it may, in more complicated cases, involve some little difficulty. We have omitted the verification here, where it is very easy, for the sake of brevity.
It is to be noticed that the last type obtained gives an example, and indeed the simplest possible, of Theorem V, § 82. Thus in of order , is a self-conjugate operation and is not. In the group of order , the operations and are conjugate; and is an operation, of order prime to , such that , , generate three mutually permutable sub-groups.
A discussion similar to that of the present section (but simpler, since in each case the number of types is smaller), will verify the following table27:—
Order | 6 | 10 | 12 | 14 | 15 | 18 | 20 | 22 | 26 | 28 | 30 |
Number | 2 | 2 | 5 | 2 | 1 | 5 | 5 | 2 | 2 | 4 | 4 |
This table, taken with the results of Chapter V, gives the number of distinct types of groups for all orders less than .
85. As a second example, we will discuss the various distinct types of group of order .
A group of order must, by Sylow’s theorem, contain either or cyclical sub-groups of order .
We will first suppose that a group of order contains a single cyclical sub-group of order , which is necessarily self-conjugate. There will then be four operations of order in ; and we may deal with two sub-cases according as these operations are or are not self-conjugate.
(i) Suppose that each operation of order is self-conjugate. There must then be either or sub-groups of order . If there is only one, it must be permutable with an operation of order ; and then contains a sub-group of order . If there are three, it follows, by Theorem II, Cor. II (§ 78), that some pair of them must have a common sub-group of order . But (Theorem III, § 80) this sub-group of order must be permutable with some operation of order prime to , which is not permutable with a sub-group of order . This operation must be of order ; hence in this case also there must be a sub-group of order . Thus then the group is, with either alternative, the direct product of a group of order and a group of order . Now there are five distinct types of group of order ; there are therefore five distinct types of group of order which contain self-conjugate operations of order .
(ii) Suppose that is an operation of order which is not self-conjugate. If is an operation which is not permutable with , then
where is not unity. Also, if is the lowest power of which is permutable with , then and thereforeIt follows that must be either or . If is for every operation which is not permutable with , then and form a complete set of conjugate operations; as also do and . If is for any operation , the four operations , , , form a single conjugate set.
First, let be one of two conjugate operations; it must then be self-conjugate in a sub-group of order , and by Sylow’s theorem this sub-group must contain a single sub-group of order . It will therefore be given by
according as is or is not a self-conjugate operation; in either case being permutable with both and .
If the sub-groups of order are cyclical, must contain an operation of order whose square is ; and must transform into its inverse and into itself. The latter condition clearly cannot be satisfied if the self-conjugate sub-group of order is of type (). Hence we have two types given by
If the sub-groups of order are not cyclical, must contain an operation of order , which is permutable with ; and transforms into its inverse and into itself. In this case, if the self-conjugate sub-group is of type (), there are two types given by
If the self-conjugate sub-group is of type (), there is a single type in which the last two of the preceding equations are replaced by
Secondly, let the operations of order form a single conjugate set. The sub-groups of order must then be cyclical since contains an operation , such that is the lowest power of which is permutable with . Also is permutable in a sub-group of order . This sub-group must be self-conjugate; and therefore contains a self-conjugate sub-group of order . Let
define the self-conjugate sub-group of order ; and let be an operation of order , none of whose powers is permutable with . We may then take since is self-conjugate, must transform this sub-group into itself. There are therefore two types given by and Hence there are in all twelve distinct groups of order , each of which has a self-conjugate sub-group of order .(iii) Next, suppose that contains conjugate sub-groups of order . No operation of order can be permutable with an operation of order , and therefore by Sylow’s theorem there must be conjugate sub-groups of order . Hence contains operations of order and operations of order . If any one operation of order were permutable with an operation of order , all its powers would be permutable with the same operation, and therefore, since the sub-groups of order form a single conjugate set, every operation of order would be permutable with an operation of order . The group would then contain at least operations of order . This is clearly impossible, since the sum of the numbers of operations of orders , and would be greater than the order of the group. Hence the sub-group of order , which contains self-conjugately a sub-group of order , must be of the type
In a similar way, we shew that a sub-group of order , which contains self-conjugately a sub-group of order , is of the type
Since no operation of order or is permutable with an operation of order , it follows (Theorem III, § 80) that no two sub-groups of order can have a common operation other than identity. Hence there must be sub-groups of order ; for if there were or , some of them would necessarily have common operations. Each sub-group of order is therefore contained self-conjugately in a sub-group of order . Such a sub-group of order can contain no self-conjugate operation of order , since contains no operation of order . Hence the sub-groups of order are non-cyclical, and the operations of order in any sub-group of order are conjugate operations in the sub-group of order containing it. This sub-group must therefore be of the type
where and are two permutable operations of order .The sub-groups of order contain therefore distinct operations of order ; and these form a conjugate set. We have already seen that the operations of order form a conjugate set, and that the operations of order form two conjugate sets of each. Hence the operations of the group are distributed in conjugate sets, containing respectively , , , and operations. It follows at once (§ 27, p. 111) that the group, when it exists, is simple.
A sub-group of order , the existence of which has been proved, must be one of conjugate sub-groups; and, since the group is simple, no operation can transform each of these into itself. Hence if the conjugate sub-groups
are transformed by any operation of the group into and if we regard as a substitution performed on symbols, the group is simply isomorphic with a substitution group of symbols. In other words, the group can be represented as a group of substitutions of symbols. Now there are just even substitutions of symbols; and it is easy to verify that the group they form satisfy all the conditions above determined. Moreover it will be formally proved in Chapter VIII, and it is indeed almost obvious, that no group of substitutions can be simple if it contains odd substitutions. Hence finally, there is one and only one type of group of order which contains sub-groups of order .Ex. 1. If , , are distinct primes, shew that a group of order , which contains a self-conjugate operation of order , must be the direct product of two groups of orders and respectively.
Ex. 2. Shew that there is a single type of group of order which contains sub-groups of order ; and determine its defining relations.
Ex. 3. If () is the highest power of which divides the order of , and if be the number of sub-groups of of order , shew that (i) if , (ii) if a group of order is cyclical and , is composite. (Maillet, Comptes Rendus, CXVIII, (1894), p. 1188.)
86. A remarkable and important extension of Sylow’s theorem has recently been given by Herr Frobenius28. In the theorem, as stated above, is the highest power of a prime that divides the order of a group. Herr Frobenius shews that, if is any power of a prime that divides the order of a group, the number of sub-groups of order is congruent to unity, . These groups do not however, in general, form a single conjugate set.
For a group whose order is a power of higher than , this result has been already proved in § 61. Suppose now that
are the sub-groups of order contained in a group , and that is the highest power of dividing the order of . It has been seen, in the proof of Sylow’s theorem, that contains at least one sub-group of order . The above set of sub-groups of order may then be divided into two classes, those namely which are contained in , and those which are not. The result of § 61 shews that the number of the sub-groups contained in the first of these classes is congruent to unity, ; and if is a self-conjugate sub-group of , all the sub-groups must be contained in this class. If is not self-conjugate in , and if , any one of the sub-groups belonging to the second class, be transformed by all the operations of , a set of sub-groups of order will result.Now it is easy to see that is not less than unity, and that every one of these sub-groups belongs to the second class. For suppose first that is zero, so that is transformed into itself by every operation of . Then is a sub-group of whose order is a power of ; and since is not contained in , the order of this sub-group is not less than . This is impossible, since is not a factor of the order of . Secondly, if were contained in , being some operation of , then would be contained in or in , contrary to supposition. If the sub-groups of the second class are not thus exhausted, and if is a new one, we may on transforming by the operations of form a fresh set of sub-groups of the second class which are distinct from each other and from the previous set; and this process may be continued till the second class is exhausted. The number of sub-groups in the second class is therefore a multiple of . Hence:—
THEOREM VI. If , where is prime, divides the order of a group , the number of sub-groups of of order is congruent to unity, .
87. If is a prime which divides the order of a group , it immediately follows from the foregoing theorem that the number of operations of , which satisfy the relation
is a multiple of . For the number of sub-groups of of order is , and no two of these sub-groups can contain a common operation except identity. There are therefore distinct operations of order in ; these, together with the identical operation, which also satisfies give in all operations.This result has been generalized by Herr Frobenius29 in the following form:—
THEOREM VII. If is a factor of the order of a group , the number of operations of , including identity, whose orders are factors of , is a multiple of .
It is easy to verify the truth of this theorem directly for small values of ; and we may therefore assume it true for every group whose order is less than that of the given group . Again, when is equal to , the theorem is obviously true. If then, on the assumption that the theorem is true for all factors of which are greater than , we shew that it is true for , the general truth of the theorem will follow by induction.
If is any factor of , we assume that the number of operations of whose orders divide is a multiple of , and therefore also of ; and we have to shew that the number of operations of , whose orders divide and do not divide , is also a multiple of . Let this set of operations be denoted by . If is the highest power of that divides , the order of every operation of the set must be equal to or be a multiple of . Let be one of these operations and its order. Then, if is the number of integers less than and prime to , the cyclical sub-group contains operations of order , and each of these belongs to the set . If these do not exhaust the set, let of order be another operation belonging to it. Then no one of the operations of order , contained in the cyclical sub-group , can be identical with any of the preceding set of operations, since itself is not contained in that set; at the same time, the new set of operations all belong to . This process may be continued till the set is exhausted. Now , , … are all divisible by , and therefore , , … are all divisible by . Hence the number of operations in the set is a multiple of .
If now , where by supposition is relatively prime to , it remains to shew that the number of operations in the set is a multiple of . For this purpose, let be any operation of of order ; and let those operations of , which are permutable with , form a sub-group of order . The number of operations of whose orders divide is the same as the number whose orders divide , where is the greatest common measure of and . Now the order of is less than , and therefore we may assume that the number of operations of whose orders divide is a multiple of , say . therefore contains operations of the form , where and are permutable and the order of divides . Now is one of a set of conjugate operations in ; and corresponding to each of these, there is a similar set of operations. Moreover no two of these operations can be identical; for we have seen (§ 16) that, if and are relatively prime, an operation of order of a group , can be expressed in only one way as the product of two permutable operations of of orders and .
The complete set of operations of the form belongs to ; if is not thus exhausted, its remaining operations can be divided into similar sets. Now is divisible by both and , and therefore by their least common multiple . Hence is divisible by , and therefore also the number of operations in the set is divisible by . The number of operations in , being divisible both by and by , is therefore divisible by . Hence finally, the number of operations of , whose orders divide , is a multiple of ; and the theorem is proved.
Corollary I. Let be the number of operations of whose orders divide , and suppose that
Let be the smallest prime factor of , and the highest power of that divides , so that where every prime factor of is greater than . If the order of is divisible by a higher power of than , then where is an integer. Now if the order of any operation divides and does not divide , then must be a multiple of ; and therefore among the operations, whose orders divide , there must be operations whose orders are equal to or are multiples of . Hence where Now is the number of operations whose orders are factors of and multiples of ; and it has been shewn, in the proof of the theorem, that this number is a multiple of . Hence Since every prime factor of is greater than , this equation requires that should be unity; thereforeThis process may be repeated to shew that, for each value of which is not greater than , we have
so that, finally,Moreover it is easy to see that the reasoning holds when is the highest power of that divides the order of , provided that then the sub-groups of , of order , are cyclical.
Suppose now that
where , , …, are primes in ascending order; and either that, for each value of from to , is not the highest power of which divides the order of : or that, if is the highest power of that divides the order of , the sub-groups of order are cyclical.Then we may prove as above, first, that contains operations of each of the orders , , …, ; and secondly that, for each value of from to ,
The equation
implies that has a self-conjugate sub-group of order ; for has a sub-group of this order, and if had more than one, it would necessarily contain more than operations whose orders divide .Again, since contains a self-conjugate sub-group of order and also operations of order , it must contain a sub-group of order . If it had more than one sub-group of this order, it would contain more than operations whose orders divide . But since
this is impossible. Hence contains a single sub-group of order , which is necessarily self-conjugate. In the same way we shew that, for each order contains a single sub-group.Finally then, under the conditions stated above, the equation
involves the property that has a self-conjugate sub-group of order and no other sub-group of the same order.Corollary II30. If and are relatively prime factors of the order of , and if the numbers of operations of whose orders divide and respectively are equal to and ; then every operation whose order is a factor of is permutable with every operation whose order is a factor of , and the number of operations of whose orders divide is equal to .
Every operation of whose order divides can be expressed as the product of two permutable operations whose orders divide and respectively; and therefore the number of operations whose orders divide cannot be greater than . On the other hand, it follows from the theorem that the number of such operations cannot be less than ; and therefore every operation whose order divides must be permutable with every operation whose order divides .
Corollary III31. If a group of order , where and are relatively prime, contains a self-conjugate sub-group of order , the group contains exactly operations whose orders divide .
If the group has an operation whose order divides , and if is not contained in the self-conjugate sub-group of order , would be a sub-group of , whose order is greater than and at the same time contains no factor in common with . This is impossible, and therefore must contain all the operations of whose orders divide .
Corollary IV32. If has a self-conjugate sub-group of order , where and are relatively prime, and if has a self-conjugate sub-group of order , then is a self-conjugate sub-group of .
For by the preceding Corollary, contains exactly operations whose orders divide , namely the operations forming the sub-group ; and every operation that transforms into itself must interchange these operations among themselves. Hence every operation of is permutable with .
Ex. 1. Shew that if, the conditions of Corollary II being satisfied, the order of is , then either is the direct product of two groups of orders and , or contains an Abelian self-conjugate sub-group.
Ex. 2. If and are distinct primes, there cannot be more than one type of group of order which contains no operation of order .
88. We have seen in § 53 that a group , whose order is the power of a prime, contains a series of self-conjugate sub-groups
such that in every operation of is self-conjugate. We shall conclude the present chapter by shewing that any group which has such a series of self-conjugate sub-groups is the direct product of two or more groups whose orders are powers of primes.THEOREM VIII. If a group , of order , where , , …, are distinct primes, has a series of self-conjugate sub-groups
such that in every operation of is self-conjugate, then is the direct product of groups of order , , …, .Suppose, if possible, that divides the order of and does not divide the order of . If is an operation of order contained in , is a self-conjugate sub-group of ; and every operation conjugate to is contained in the set . But the only operation of this set, whose order is , is . Hence must be a self-conjugate operation, contrary to the supposition that has been made. Hence if the order of is not divisible by , neither is the order of . Suppose, next, that is the highest power of that divides the orders of both and . Then the order of the sub-group of , formed of the self-conjugate operations of the latter, is not divisible by ; and therefore the order of is not divisible by . Hence is the highest power of that divides the order of . This reasoning may be repeated to shew that is the highest power of that divides the order of each of the groups , , …. Hence must be equal to ; and therefore the order of must be divisible by each of the primes , , …, .
Suppose now that, for each prime which divides the order of , every operation of , whose order is a power of , is permutable with every operation of whose order is relatively prime to . Let be any operation, whose order is a power of , belonging to and not to ; and let be any operation of whose order is relatively prime to . If is not permutable with , then
where is some operation of . The order of must be a power of . For let , where the order of is a power of and the order of is relatively prime to . Then, from the supposition made with regard to the sub-group , the operation is the product of the permutable operations and . But, since the order of is a power of , this is impossible unless is identity. If the order of is , then and this equation implies that is permutable with , since and the order of are relatively prime. Hence if the supposition that has been made holds for , it also holds for . But it certainly holds for , and therefore it is true for . Hence every operation of whose order is a power of is permutable with every operation of whose order is relatively prime to . The group therefore contains self-conjugate sub-groups of each of the orders , , …, ; and it follows, from the definition of § 31, that is the direct product of these groups.We add here two examples in further illustration of the applications of Sylow’s theorem.
Ex. 1. If is a prime, greater than , shew that the number of distinct types of group of order is or , according as is congruent to or , .
Ex. 2. If is a prime, greater than , shew that the number of distinct types of group of order is , , or , according as is congruent to , , or , .
up | next | prev | ptail | top |