up | next | prev | ptail | tail |
W e shall now, in illustration of the general principles that have been developed in the preceding chapters, proceed to discuss and give an analysis of certain special groups. The first that we choose for this purpose is the group of isomorphisms of an Abelian group of order and type . This group has been defined and its order determined in §§ 171, 172. It is there shewn that the group is simply isomorphic with the homogeneous linear group defined by all sets of congruences
whose determinants are not congruent to zero; and that its order is The operation given by the above set of congruences will be denoted in future by the symbol216. It may be easily verified by direct calculation that, if and are the determinants of two operations and of the group, then is the determinant of the operation , all the numbers involved being reduced, . Hence it immediately follows that those operations of the group, whose determinant is unity, form a sub-group. If this sub-group is denoted by , the group itself being , then is a self-conjugate sub-group of . For if is any operation of and any operation of whose determinant is , the determinant of is or unity; and therefore belongs to . Suppose now that is an operation88 of whose determinant is , a primitive root of the congruence
Then the determinant of every operation of the set is ; and therefore, if and are not congruent , the two sets can have no operation in common. Moreover, if is any operation of whose determinant is , then belongs to , and therefore belongs to the set . Hence finally, the sets are all distinct, and they include every operation of ; so thatThe factor-group is therefore cyclical and of order .
217. It may be very readily verified that the operations of the cyclical sub-group generated by
are self-conjugate operations of . To prove that these are the only self-conjugate operations of , we will deal with the case : it will be seen that the method is perfectly general. Suppose then that is a self-conjugate operation of , while is any operation. The relation involves the nine simultaneous congruences89and these must be satisfied for all possible values of the coefficients of . Now
is a possible relation between the coefficients of , whether regarded as an operation of or ; and therefore In the same way, it may be shewn that and that so that is a power of the operation The only self-conjugate operations of are therefore the powers of , where denotes and the only self-conjugate operations of are those operations of this cyclical sub-group which are contained in . Now the order of is and its determinant is . Hence the self-conjugate operations of form a cyclical sub-group of order , where is the greatest common factor of and ; and this sub-group is generated by .218. To determine completely the composition-series of , it is necessary to find whether has a self-conjugate sub-group greater than and containing . A simple calculation will shew that, from
and its conjugate operations, all the operations of may be generated; and hence no self-conjugate sub-group of which is different from itself can contain an operation of this form. If then it is shewn that any self-conjugate sub-group of , distinct from , necessarily contains operations of this form, it follows that is a maximum self-conjugate sub-group of .We shall first deal with the case .
If , the orders of , and are , and . In this case, is simply isomorphic with the symmetric group of three symbols, which has a self-conjugate sub-group of order . The successive factor-groups of the composition-series of are therefore cyclical groups of orders and .
If , the orders of , and are , and . The factor-group has for its order, and cannot therefore be a simple group. The reader will have no difficulty in verifying that, in this case, the successive factor-groups of have orders , , , and . We may therefore, in dealing with the case , assume that is not less than .
Let us suppose now that has a self-conjugate sub-group that contains ; and let or
be one of its operations, not contained in .If is different from zero, contains , where denotes
and therefore contains , which isIf is zero, is congruent with ; therefore, in any case, contains an operation of the form
Again, contains the operation , where denotes
and therefore contains , which isHence unless , must coincide with . Now, when , can always be chosen so that this congruence is not satisfied. If , the square of the above operation , when unity is written for , is
unless , this again requires that coincides with . If finally, the condition is satisfied in , it is not satisfied in , another operation belonging to ; and therefore again, in this case, coincides with .Hence finally, if , the factor-group is simple, except when is or .
219. When is greater than , it will be found that it is sufficient to deal in detail with the case , as the method will apply equally well for any greater value of . Suppose here again that has a self-conjugate sub-group which contains ; and let , denoting
be one of the operations of which is not contained in . cannot be permutable with all operations of the form , as it would then be permutable with every operation of . We may therefore suppose without loss of generality that and are not permutable, denoting . Then is an operation, distinct from identity, belonging to . Now a simple calculation shews that this operation, say , is of the form where is the symbol with which replaces .If and are both different from zero, will contain an operation of the form
and contains , which is of the formMoreover, if either or is zero, the operation itself leaves one symbol unaltered. Hence always contains operations by which one symbol is unaltered.
This process may now be repeated to shew that necessarily contains operations of the form
and, since the determinant of the operation is unity, is necessarily congruent to unity. But it has been seen that the group is generated from the last operation and the operations conjugate to it. Hence finally, if is greater than , the factor-group is simple for all values of .220. The composition-series of is now, except as regards the constitution of the simple group , perfectly definite. It has, in fact, been seen that and are cyclical groups of orders and ; and therefore if , , , … are distinct primes whose product is , and if , , , … are distinct primes whose product is ; the successive factor-groups of are first, a series of simple groups of prime orders , , , …: then a simple group of composite order : and lastly, a series of simple groups of prime orders , , , ….
The sequence in which the set of simple groups of orders , , , … are taken in the composition-series may be clearly any whatever, and the same is true of the set of factor-groups of orders , , , …; but it is to be noticed that, when is not equal to , the composition-series is capable of further modifications. In this case, is a self-conjugate sub-group of of order , which has a maximum self-conjugate sub-group of order . The successive composition-factors of may therefore be taken in the sequence
and their arrangement may be yet further changed by considering the self-conjugate sub-group , where is a factor of less than .221. For every value of , except and , it thus appears that the linear group may be regarded as defining a simple group of composite order. We shall now proceed to a discussion of the constitution of the simple groups thus defined when , being greater than 90. In this case, the group is defined by the congruences
and since is divisible by when is an odd prime, is equal to . Hence the self-conjugate operations of areThe order of is , and therefore the order of the simple group, , which it defines is . Suppose now, if possible, that contains a sub-group simply isomorphic with . If is any operation of , not contained in , the whole of the operations of are contained in the two sets
Now , whose square is a self-conjugate operation, cannot be contained in the simple group . Hence both and are contained in , an obvious contradiction. Therefore contains no sub-group simply isomorphic with .
For a discussion of the properties of , some concrete representation of the group itself is necessary; this may be obtained in the following way. Instead of the pair of homogeneous congruences that define each operation of , let us, as in § 113, consider the single non-homogeneous congruence
where Corresponding to every operation of , there will be a single operation of this new set; namely that in which , , , have respectively the same values. But since the operations are identical, two operations of will correspond to each operation of the new set; the two self-conjugate operations in particular, corresponding to the identical operation of the new set. Moreover, direct calculation immediately verifies that, to the product of any two operations of , corresponds the product of the two corresponding operations of the new set. Hence the new set of operations forms a group of order , with which is multiply isomorphic; the group of order formed by the self-conjugate operations of corresponding to the identical operation of the new group.The simple group , of order , which we propose to discuss, can therefore be represented by the set of operations
where , , , being integers reduced to modulus .222. Since the order of is divisible by and not by , the group must contain a single conjugate set of sub-groups of order . Now the operation
or as we will write it in future, is clearly an operation of order : for its th power is , and is the smallest value of for which this is the identical operation. If and are represented by and , thenThis is identical with , only if
and therefore is permutable with no operations except its own powers. On the other hand, if then and therefore every operation, for which , transforms the sub-group into itself. These operations therefore form a sub-group: a result that may also be easily verified directly. The order of this sub-group is the number of distinct operations for which . The ratio must be a quadratic residue, while may have any value whatever. Hence the order of the sub-group is ; and therefore contains sub-groups of order . Since is a simple group, it follows (§ 125) that it can be represented as a transitive substitution group of degree .This representation of the group can be directly derived, as in § 113, from the congruences already used to define it. Thus if, in
we write for successively , , , …, , , the values obtained for , when reduced , will be the same symbols in some other sequence. For if then and therefore .Each operation of gives therefore a distinct substitution performed on the symbols , , …, , ; and the complete set of substitutions thus obtained gives the representation of as a transitive substitution group of degree . Since contains operations of order , this substitution group must be doubly transitive. That this is the case may also be shewn directly. Thus
is an operation changing into and into . This operation may be written and its determinant isIf now is a quadratic residue (or non-residue) , may be any quadratic residue (or non-residue); and can always be chosen so that the determinant is unity. There are therefore substitutions in the group, changing any two symbols , into any other two given symbols , . Further, if the operation keeps unchanged in the substitution group, must satisfy the congruence
that is Such a congruence cannot have more than two roots; and therefore every substitution displaces all, all but one, or all but two, of the symbols.223. The substitutions, which keep either one or two symbols fixed, must therefore be regular in the remaining or symbols. Hence the order of every substitution which keeps just one symbol fixed must be ; and the order of every substitution that keeps two symbols fixed must be equal to or be a factor of . Now it was seen in the last paragraph that the order of the sub-group that keeps two symbols fixed is . Moreover, if is a primitive root , the sub-group that keeps and fixed contains the operation
and the order of this operation is . Hence, the sub-group that keeps any two symbols fixed is a cyclical group of order ; and every operation that keeps two symbols fixed is some power of an operation of order . Since the group is a doubly transitive group of degree , there must be sub-groups which keep two symbols fixed; and these must form a conjugate set. Each is therefore self-conjugate in a sub-group of order . To determine the type of this sub-group, we may consider the sub-group keeping and fixed: this is generated by , where denotes . If is represented by , then which can be a power of only ifHence either
in which case is a power of : orIn the latter case, we have
which is an operation of order ; and thenThe group of order , which contains self-conjugately a cyclical sub-group of order that keeps two symbols fixed, is therefore a group of dihedral (§ 202) type. Moreover, if is any factor of , this investigation shews that is the greatest sub-group that contains self-conjugately.
224. A substitution that changes all the symbols must either be regular in the symbols, or must be such that one of its powers keeps two symbols fixed. The latter case however cannot occur; for we have just seen that, if is an operation, of order , which keeps two symbols fixed, the only operations permutable with are the powers of . Hence the substitutions that change all the symbols must be regular in the symbols, and their orders must be equal to or be factors of .
Suppose now that is a primitive root of the congruence
so that and are the roots of a quadratic congruence with real coefficients; and consider the operation , denoting where is not a multiple of . On solving with respect to , is expressed in the form an operation of determinant unity. It will be found, on writing for in the coefficients of this operation, that they remain unaltered; therefore, since they are symmetric functions of and , they must be real numbers. The operation therefore belongs to . The th power of this operation is given by and therefore, since the first power of which is congruent to unity, , is the th, the order of the operation is . If we write for in the operation , the new operation is ; but if is replaced by any other number , which is not a multiple of , the new operation , given by generates a new sub-group of order , which has no operation except identity in common with . Now there are numbers less than which are not multiples of ; therefore contains cyclical sub-groups of order , no two of which have a common operation except identity. The corresponding substitutions displace all the symbols.225. A simple enumeration shews that the operations of the cyclical sub-groups of orders , and , exhaust all the operations of the group. Thus there are, omitting identity from each sub-group:
(i) sub-groups of order , containing distinct operations;
(ii) sub-groups of order , containing distinct operations;
(iii) sub-groups
of order ,
containing
distinct operations;
and the sum of these numbers, with
for the identical
operation, gives ,
which is the order of the group.
Every operation that displaces all the symbols is therefore the power of an operation of order .
226. We shall now further shew that the sub-groups of order form a single conjugate set, and that each is contained self-conjugately in a dihedral group of order . Let be any operation of , which is permutable with and replaces by some other symbol . Then is an operation which leaves unaltered; it may therefore be expressed in the form
This can belong to the sub-group generated by , only if and are the same pair as and . Hence must be either or ; and similarly, if replaces by , the latter must be either or . Hence either must keep both the symbols and unchanged or it must interchange them; and conversely, every operation which either keeps both the symbols unchanged or interchanges them, must transform into itself. If keeps both of them unchanged, it is a power of . If interchanges them, it is of the form
and a simple calculation shews that If we take , becomes an operation belonging to . Hence the cyclical sub-group is contained self-conjugately in the sub-group of which is of dihedral type. If there were any other operation , not contained in , which transformed into its inverse, then would be an operation permutable with and not contained in . It has just been seen that no such operation exists. Hence , of order , is the greatest sub-group that contains self-conjugately; and must be one of conjugate sub-groups.227. The distribution of the operations of in conjugate sets is now known. A sub-group of order is contained self-conjugately in a group of order , while an operation of order is permutable only with its own powers. There are therefore two conjugate sets of operations of order , each set containing operations. Again, each of the operations of a cyclical sub-group of order or is conjugate to its own inverse and to no other of its powers. Hence if is even and therefore odd, there are conjugate sets of operations whose orders are factors of , each set containing operations; conjugate sets of operations whose orders are factors of , other than the factor , each set containing operations; and a single set of operations of order , containing operations. If is even and odd, there are conjugate sets of operations whose orders are factors of , each containing operations; conjugate sets whose orders are factors of , other than the factor , each set containing operations; and a single set of conjugate operations of order . In either case, the group contains, exclusive of identity, conjugate sets of operations.
228. Since and can have no common factor except , it follows that, if denote the highest power of an odd prime, other than , which divides the order of , must be a factor of or of ; and the sub-groups of order must be cyclical. Moreover, since no two cyclical sub-groups of order , or , have a common operation except identity, the same must be true of the sub-groups of order .
If is the highest power of that divides or , will be the highest power of that divides the order of . Moreover, a sub-group of order must contain a cyclical sub-group of order self-conjugately, and it must contain an operation of order that transforms every operation of this cyclical sub-group into its own inverse; in other words, the sub-groups of order are of dihedral type.
Suppose now that two sub-groups of order () have a common sub-group of order (). Such a sub-group must be either cyclical or dihedral: in the latter case, it contains self-conjugately a single cyclical sub-group of order . Hence, on the supposition made, a cyclical sub-group of order at least would be contained self-conjugately in two distinct cyclical sub-groups of order . It has been seen that this is not the case; and therefore the greatest sub-group, that two sub-groups of order can have in common, must be a sub-group of order , whose operations, except identity, are all of order . Now every group of order contains one self-conjugate operation of order , and operations of order falling into conjugate sets of each. Moreover, the group of order , which has a cyclical sub-group of order and contains the operation of order of this cyclical group self-conjugately, has other operations of order ; and therefore it contains sub-groups of order , each of which has for its self-conjugate operation. If now is any operation of order of this sub-group of order , and if it is distinct from , then enters into a sub-group of order that contains self-conjugately. But since is permutable with , must belong to the sub-group of order , which contains self-conjugately; hence enters into a sub-group of order which contains self-conjugately. The sub-group is therefore common to two distinct sub-groups of order . Now no group of order () can be common to two sub-groups of order ; and therefore must (§ 80) be permutable with some operation whose order is prime to . If is not , must be permutable with and : and then and would be two distinct sub-groups of orders , whose operations are permutable with each other. It has been seen that does not contain such sub-groups. Hence ; and transforms , and cyclically, or is a sub-group of tetrahedral type (§ 202).
The number of quadratic91 sub-groups contained in may be directly enumerated. A group of order contains such sub-groups, which fall into conjugate sets of each; a single group of order containing each quadratic group self-conjugately. The quadratic groups, contained in the sub-groups of order of a sub-group of order , are clearly all distinct, and each quadratic group belongs to just groups of order ; thus belongs to the groups which contain , and respectively as self-conjugate operations. Hence the total number of quadratic groups contained in is
229. The greatest sub-group of a group of order , that contains a quadratic group self-conjugately, is a group of order and dihedral type; and it has been shewn that is the only factor, prime to , that occurs in the order of the sub-group containing a quadratic group self-conjugately. Hence finally, the order of the greatest group containing a quadratic group self-conjugately is , and the quadratic groups fall into two conjugate sets of each. The group of order , that contains a quadratic group self-conjugately, contains also a self-conjugate tetrahedral sub-group, while the sub-groups of order are dihedral. Hence (§ 84) this group must be of octohedral type.
Since every tetrahedral sub-group of contains a quadratic sub-group self-conjugately, and every octohedral sub-group contains a tetrahedral sub-group self-conjugately, there must also be two conjugate sets of tetrahedral sub-groups and two conjugate sets of octohedral sub-groups, the number in each set being .
230. We have hitherto supposed , or what is the same thing, . If now , so that , the highest power of that divides the order of is ; and, since is not a factor of , the sub-groups of order are quadratic. Moreover, since is the highest power of dividing the order of , the quadratic sub-groups form a single conjugate set. Each sub-group of order , which has a self-conjugate operation of order , contains sub-groups of order , and each of the latter belongs to of the former. The total number is as before
and since they form a single conjugate set, each quadratic group is self-conjugate in a group of order . Also, for the same reason as in the previous case, this sub-group is of tetrahedral type.Finally, since every sub-group of of tetrahedral type must contain a quadratic sub-group self-conjugately, must contain a single conjugate set of tetrahedral sub-groups. In this case, the order of is not divisible by , and therefore the question of octohedral sub-groups does not arise.
231. The group always contains tetrahedral sub-groups; when its order is divisible by , it contains also octohedral sub-groups. Now if , the order of is divisible by : it may be shewn as follows that, in these cases, contains sub-groups of icosahedral type.
Let us suppose, first, that ; and let be a primitive root of the congruence
Then , which we will denote by , is an operation of order . The operations of order of are all of the form , where denotes , since each is its own inverse. Now and (§ 203) if and generate an icosahedral group, A simple calculation shews that, if this condition is satisfied, then Also, since the determinant of is unity, These two congruences have just distinct solutions, the solutions , , and , , being regarded as identical. There are therefore operations of order two in , namely the operations where which with generate an icosahedral sub-group.The group generated by
contains of the operations of order of the form viz. those for which Hence the sub-group , of order , belongs to distinct icosahedral sub-groups. Now each icosahedral sub-group has sub-groups of order ; and contains sub-groups of order forming a single conjugate set. The number of icosahedral sub-groups in is therefore The group of isomorphisms of the icosahedral group is the symmetric group of degree (§ 173). Now can contain no sub-group simply isomorphic with the symmetric group of degree . For if it contained such a sub-group, an operation of order would be conjugate to its own square; and this is not the case.Hence (§ 165), if an icosahedral sub-group of is contained self-conjugately in a greater sub-group , then must be the direct product of and some other sub-group. This also is impossible; for the greatest sub-group of in which any cyclical sub-group, except those of order , is contained self-conjugately, is of dihedral type. Hence must coincide with , and must be one of conjugate sub-groups. The icosahedral sub-groups of therefore fall into two conjugate sets of each.
In a similar manner, when , we may take as a typical operation , of order ,
and it may be shewn, the calculation being rather more cumbrous than in the previous case, that there are just operations , of the form , such that and that five of these belong to the icosahedral group generated by and any one of them. It follows, exactly as in the previous case, that contains icosahedral sub-groups, which fall into two conjugate sets, each set containing groups.232. Finally, we proceed to shew that has no other sub-groups than those which have been already determined. Suppose, first, that a sub-group of contains two distinct sub-groups of order . These must, by Sylow’s theorem, form part of a set of sub-groups of order conjugate within . Now contains only sub-groups of order , and therefore must be unity and must contain all the sub-groups of order ; or since is simple, must contain and therefore coincide with . Hence the only sub-groups of , whose orders are divisible by , are those that contain a sub-group of order self-conjugately. They are of known types.
Suppose next that is a sub-group of , whose order is not divisible by , and let be an operation of whose order is not less than the order of any other operation of . In the sub-group is self-conjugate in a dihedral group of order ; and the greatest sub-group of this group, which contains no operation of order greater than , is a dihedral group of order . Hence in the sub-group is self-conjugate in a group of order or , and therefore it forms one of or of conjugate sub-groups. Moreover, no two of these sub-groups contain a common operation except identity; and they therefore contain, excluding identity, distinct operations, where is either or .
Of the remaining operations of , let be one whose order is not less than that of any of the others. The operation cannot be permutable with any of the operations already accounted for, since is not a power of any one of these operations. Hence, exactly as before, must form one of conjugate sub-groups in , being either or ; and these sub-groups contain operations which are distinct from identity, from each other, and from those of the previous set. This process may be continued till the identical operation only remains. Hence, finally, being the total number of operations of , we must have
or233. In this equation, let of the ’s be and of them be , so that is their total number, say . Then
Hence, since is a positive integer, there cannot be more than three terms under the sign of summation. Moreover, since
cannot be greater than , and therefore not more than one of the ’s can be unity. Also, when one of the ’s is unity, we haveso that, in this case, cannot be greater than unity. The solutions are now easily obtained by trial.
(i) For one term in the sum, the only possible solution is
and the corresponding group is cyclical.(ii) For two terms in the sum, the solutions are
To the solution () there corresponds no sub-group; for , and the values , imply that has a sub-group of order .
To the solution () correspond the sub-groups of order of dihedral type, for which is odd, so that the operations of order form a single conjugate set.
To the solution () corresponds a sub-group of order containing operations of order and operations of order , i.e. a tetrahedral sub-group.
(iii) For three terms in the sum, the solutions are
To the solution () correspond the sub-groups of order of dihedral type, in which is even, so that the operations of order , which do not belong to the cyclical sub-group of order , fall into two distinct conjugate sets.
To the solution () would correspond a group of order containing operations of order and sub-groups of order which fall into two conjugate sets of each. Sylow’s theorem shews that such a group cannot exist; and therefore there is no sub-group of corresponding to this solution.
Solution () gives a group of order , with conjugate cyclical sub-groups of order , conjugate cyclical sub-groups of order , and other operations of order forming a single conjugate set. No operation of this group is permutable with each of the sub-groups of order ; and therefore, if the group exists, it can be represented as a transitive group of symbols. On the other hand, the order of the symmetric group of symbols, which (§ 203) is simply isomorphic with the octohedral group, is ; and its cyclical sub-groups are distributed as above. Hence to this solution there correspond the octohedral sub-groups of .
Solution () gives a group of order , with conjugate sub-groups of order , conjugate sub-groups of order , and a conjugate set of operations of order . It has been shewn, in § 85, that there is only one type of group of order that has sub-groups of order ; viz. the alternating group of degree : and that, in this group, the distribution of sub-groups in conjugate sets agrees with that just given. Moreover, the alternating group of degree is simply isomorphic with the icosahedral group. Hence to this solution there correspond the icosahedral sub-groups of .
234. When , then ; and, when , . Hence when , the order of the greatest sub-group of is , and the least number of symbols in which can be expressed as a transitive substitution group is .
When is , or , however, can be expressed as a transitive substitution group of symbols92.
For, when , contains a tetrahedral sub-group of order , forming one of conjugate sub-groups; therefore can be expressed as a transitive group of symbols. It is to be noticed that in this case is an icosahedral group.
When , contains an octohedral sub-group of order , which is one of conjugate sub-groups; and can therefore be expressed as a transitive group of symbols. Similarly, when , contains an icosahedral sub-group of order , which is one of conjugate sub-groups; and the group can be expressed transitively in symbols.
235. The simple groups, of the class we have been discussing in the foregoing sections, are self-conjugate sub-groups of the triply transitive groups of degree , defined by
the existence of which was demonstrated in § 113. In fact, since and represent the same transformation, the determinant, , of any transformation may always be taken as either unity or a given non-residue; and it follows at once that the transformations of determinant unity form a self-conjugate sub-group of the whole group of transformations.If, as in § 113, , , , , are powers of , where is a primitive root of the congruence
the triply transitive group of degree , which is defined by the transformations, has again, when is an odd prime, a self-conjugate sub-group of order , which is given by the transformations of determinant unity. It follows from Theorem IX, § 134, that , being a triply transitive group of degree , must have, as a self-conjugate sub-group, a doubly transitive simple group; and it is easy to shew that is this sub-group.In fact, if a simple group is a self-conjugate sub-group of it must be contained in . Also, since is a doubly transitive group of degree , it must contain every operation of order that occurs in . Now we may shew that these operations generate . Thus and are operations of order belonging to . Therefore belongs to . But this operation is transformed into by . Hence belongs to ; and a sub-group of which keeps one symbol unchanged is the group of order generated by and . The order of therefore is not less than ; in other words is identical with .
When , every power of is a quadratic residue, and the determinant of every transformation is unity. In this case it may be shewn, by an argument similar to the above, that the group of order is itself a simple group.
We are thus led to recognize the existence of a doubly-infinite series of simple groups of orders and , which are closely analogous to the groups of order already discussed. For an independent proof of the existence of these simple groups and for an investigation of their properties, the reader is referred to the memoirs mentioned below93.
236. We will now return to the linear homogeneous group of transformations of symbols, taken to a prime modulus ; and consider it more directly as the group of isomorphisms of an Abelian group of order and type . As in § 156, it may be expressed in the form of a substitution group performed on the symbols of the operations, other than identity, of the Abelian group. In this form it is clearly transitive, since there are isomorphisms changing any operation of the Abelian group into any other operation. If is any operation of the Abelian group, an isomorphism which changes any one of the operations
into any other, will certainly interchange the set among themselves. Hence, when expressed as a group of degree , is imprimitive; and the symbols forming an imprimitive system are those of the operations, other than identity, of any sub-group of order of the Abelian group. If are a set of generating operations of the Abelian group, an isomorphism, which changes each of the sub-groups into itself, must be of the form This isomorphism changes into ; therefore it will only transform the sub-group into itself when . If then the given isomorphism changes every sub-group of order into itself, we must haveHence the only operations of , which interchange the symbols of each imprimitive system among themselves, are those given by the powers of
where is a primitive root of . This operation is the same as that denoted by in § 217. It follows immediately that the factor-group can be represented as a transitive group in symbols. In fact, the operations of are the only operations of which transform each of the sub-groups of order in itself; and these sub-groups must be permuted among themselves by every operation of . The substitution group thus obtained is doubly transitive; for if and are any two operations of the Abelian group such that is not a power of , and if and are any other two operations of the Abelian group subject to the same condition, there certainly exists an isomorphism of the form and this isomorphism changes the sub-groups and into the sub-groups and .These results will still hold if, instead of considering the total group of isomorphisms, we take the group of isomorphisms of determinant unity. Thus the determinant of
is times the determinant of It is therefore possible always to choose so that the determinant of shall be unity; and this isomorphism still changes the sub-groups and into and respectively.The lowest power of contained in is (§ 217) . Hence the group can be represented as a doubly transitive group of degree . This group is (§ 220) simply isomorphic with the simple group of order , which is defined by the composition-series of .
We may sum up these results as follows:—
THEOREM. The homogeneous linear group of order
when is neither nor , defines, by its composition-series, a simple group of order , where is the greatest common factor of and . This simple group can be represented as a doubly transitive group of degree .237. The symbols, permuted by one of these doubly transitive simple groups, may be regarded as the sub-groups of order of an Abelian group of order and type . Now every pair of sub-groups of such an Abelian group enters in one, and only in one, sub-group of order ; and every sub-group of order contains sub-groups of order . Hence from the symbols permuted by the doubly transitive group, sets of symbols each may be formed, such that every pair of symbols occurs in one set and no pair in more than one set, while the sets are permuted transitively by the operations of the group. These groups therefore belong to the class of groups referred to in § 148. The sub-group, that leaves two symbols unchanged, permutes the remaining symbols in two transitive systems of and ; and the sub-group, that leaves unchanged each of the symbols of one of the sets of , is contained self-conjugately in a sub-group whose order is times that of a sub-group leaving two symbols unchanged. This latter sub-group permutes the symbols in two transitive systems of and . It may be pointed out that, when is , such a sub-group is simply isomorphic with, but is not conjugate to, the sub-groups that leave one symbol unchanged: this may be seen at once by noticing that an Abelian group, of order and type , has the same number of sub-groups of orders and .
238. Some special cases may be noticed. First, when , both and are unity, and the homogeneous linear group is itself a simple group.
If , then ; so that the group of isomorphisms of a group of order , whose operations are all of order , is the simple group of order (§ 146).
If , then . This is the order of the alternating group of symbols; and it may be shewn that this group is simply isomorphic with the group of isomorphisms.
The Abelian group of order contains sub-groups of order ; and it may be shewn that, from these sub-groups, sets of can be formed in distinct ways, so that each set of contains every operation of order of the Abelian group once, and once only. If
are a set of generating operations of the Abelian group, such a set of sub-groups of order is given by Now is an isomorphism of order of the Abelian group, and is the only operation of the group, except identity, which is left unchanged by this isomorphism. It may be directly verified that the sets of groups of order , into which the given set is transformed by the powers of this isomorphism, contain every sub-group of order of the Abelian group. The sets, being interchanged among themselves by this isomorphism of order which leaves only unchanged, must be interchanged among themselves by isomorphisms of order which leave any other single operation of the Abelian group unchanged. There are therefore at least isomorphisms of order which interchange the sets among themselves. Now the isomorphisms, which interchange the sets among themselves, form a sub-group of the group of isomorphisms, which is isomorphic with a group of degree ; and the only groups of degree , which contain at least operations of order , are the symmetric and the alternating groups. The group of isomorphisms must therefore contain a sub-group which is isomorphic with the symmetric or with the alternating group of degree . Hence at once, since the group of isomorphisms is simple, it must contain a sub-group which is simply isomorphic with the alternating group of degree . Since this must be one of conjugate sub-groups, the group of substitutions itself is simply isomorphic with the alternating group of degree .If , then , , and . There is therefore a doubly transitive simple group of degree and order (§§ 145, 149).
239. The homogeneous linear group may be generalized by taking for the coefficients powers of a primitive root of
instead of powers of a primitive root of When the coefficients are thus chosen, the order of the group , defined by all sets of transformations whose determinant differs from zero, may be shewn, as in § 172, to be and the order of the sub-group , formed of those transformations whose determinant is unity, is . The only self-conjugate operations of are the operations of the sub-group generated by , which are contained in . If is the greatest common factor of and , these self-conjugate operations of form a cyclical sub-group of order . Finally, the argument of § 219 maybe repeated to shew that is a simple group.The homogeneous linear group , when values of greater than unity are admitted, thus defines a triply infinite system of simple groups; it may be proved that these groups can, for all values of , be expressed as doubly transitive groups of degree .
240. We may shew, in conclusion, that the group is simply isomorphic with a sub-group of . For this purpose, we consider the group defined by
the congruences being taken to modulus . This is an Abelian group of order and type . Moreover, the operation
of transforms the given operation of the Abelian group into
whereEvery operation of as defined in § 239, is therefore permutable with the Abelian group, and gives a distinct isomorphism of it; or in other words, as stated above, is simply isomorphic with a sub-group of .
Further, the sub-group
is transformed by the given operation of into the sub-group
If
the two sub-groups are identical; but if these conditions are not satisfied, they have no operation in common except identity. Moreover, may each have any value from to , simultaneous zero values alone excluded. Hence the sub-group of order defined byis one of conjugate sub-groups in the group formed by combining the Abelian group with ; and no two of these conjugate sub-groups have a common operation except identity.
The operations, other than identity, of an Abelian group of order and type , can therefore be divided into sets of each, such that each set, with identity, forms a sub-group of order ; and the group is isomorphic with a group of isomorphisms of the Abelian group which permutes among themselves such a set of sub-groups of order .
Ex. 1. Shew that the sub-groups of order of an Abelian group of order and type can be divided into sets of each, such that each set contains every operation of the group, other than identity, once and once only; and discuss in how many distinct ways such a division may be carried out.
Ex. 2. Shew that the simple group, defined by the group of isomorphisms of an Abelian group of order and type , admits a class of contragredient isomorphisms, which change the operations of the simple group, that correspond to isomorphisms leaving a sub-group of order of the Abelian group unaltered, into operations that correspond to isomorphisms leaving a sub-group of order of the Abelian group unaltered.
up | next | prev | ptail | top |