§ 4. Groups and groups with operators
1. Groups
Recall the following definition (§ 2, no. 3, Definition 6).
Definition 1
A set with an associative law of composition, possessing an identity element and under which every element is invertible, is called a group.
In other words, a group is a monoid (§ 2, no. 1, Definition 1) in which every element is invertible. A law of composition on a set which determines a group structure on it is called a group law. If G and H are two groups, a magma homomorphism of G into H is also called a group homomorphism. Such a homomorphism maps identity element to identity element; for, let (resp. ) be the identity element of G (resp. H); writing the group laws of G and H multiplicatively, , whence and, multiplying by . Hence is unital. It then follows from no. 3 of § 2 that for all .
Example
In any monoid E the set of invertible elements with the structure induced by that on E is a group. In particular, the set of bijective mappings of a set F onto itself (or set of permutations of F) is a group under the law , called the symmetric group of the set F and denoted by .
In this paragraph, unless otherwise indicated, the law of composition of a group will always be written multiplicatively and will denote the identity element of such a group law.
A group G is called finite if the underlying set of G is finite; otherwise it is called infinite; the cardinal of a group is called the order of the group.
If a law of composition on G determines a group structure on G, so does the opposite law. The mapping of a group G onto itself which associates with each the inverse of is an isomorphism of G onto the opposite group (§ 2, no. 3, Proposition 4).
Following our general conventions (Set Theory, II, § 3, no. 1), we shall denote by the image of a subset A of G under the mapping . But it is important to note that, in spite of the analogy of notation, is definitely not the inverse element of A under the law of composition between subsets of G (recall that XY is the set of with ): the identity element under this law is and the only invertible elements of under this law are the sets A consisting of a single element (such an A, moreover, certainly has inverse ). The identity
holds for , . is called a symmetric subset of if . For all , , and are symmetric.
2. Groups with operators
Definition 2
Let be a set. A group together with an action of on which is distributive with respect to the group law, is called a group with operators in .
In what follows will denote the composition of and . Distributivity is then expressed by the identity .
In a group with operators , each operator defines an endomorphism of the underlying group structure; these endomorphisms will sometimes be called the homotheties of the group with operators .
A group with operators is called commutative (or Abelian) if its group law is commutative.
In what follows a group will be identified with the group with operators in obtained by giving the unique action of on . This allows us to consider groups as special cases of groups with operators and to apply to them the definitions and results relating to the latter which we shall state.
Example
In a commutative group , written multiplicatively, for all (§ 2, no. 8, equation (1)); the action of on therefore defines, together with the group law, the structure of a group with operators on .
Definition 3
Let and be groups with operators in . A homomorphism of groups with operators of into is a homomorphism of the group into the group such that
for all and all .
An endomorphism of the group with operators is an endomorphism of the group which is permutable with all the homotheties of .
As two homotheties of a group with operators are not necessarily permutable, a homothety of is not in general an endomorphism of the group with operators .
The identity mapping of a group with operators is a homomorphism of groups with operators; the composition of two homomorphisms of groups with operators is also one. For a mapping to be an isomorphism of groups with operators, it is necessary and sufficient that it be a bijective homomorphism of groups with operators and the inverse mapping is then an isomorphism of groups with operators.
More generally, let G (resp. G') be a group with operators in (resp. ). Let be a mapping of into . A -homomorphism of G into G' is a homomorphism of the group G into the group G' such that
for all and all .
In the rest of this paragraph we shall be given a set . Unless otherwise mentioned the groups with operators considered will admit as set of operators.
3. Subgroups
Definition 4
Let G be a group with operators. A stable subgroup of G is a subset H of G with the following properties*:
(i) ; (ii) ; (iii) ; (iv) and imply .
If H is a stable subgroup of G, the structure induced on H by the structure of a group with operators on G is the structure of a group with operators and the canonical injection of H into G is a homomorphism of groups with operators.
Let G be a group. A stable subgroup of G with the action of (no. 2), which is a subset of G satisfying conditions (i), (ii), (iii) of Definition 4, is called a subgroup of G. When we speak of a subgroup of a group of operators we shall always mean a subgroup of the underlying group of G. A subgroup of a group with operators G is not necessarily a stable subgroup of G.
Example (1). Let be a species of structure (Set Theory, IV, § 1, no. 4) and S a structure of species on a set E (loc. cit.). The set of automorphisms of S is a subgroup of .
Proposition 1
Let G be a group with operators and H a subset of G which is stable under the homotheties of G. The following conditions are equivalent*:
(a) H is a stable subgroup of G. (b) H is non-empty and the relations and . (c) H is non-empty and the relations . (d) H is stable under the law on G and the law of composition induced on H by the law of composition on G is a group law.
Clearly (a) implies (b). We show that (b) implies (a). It suffices to show that H contains the identity element of G. As the subset H is non-empty, let . Then and . Clearly (b) implies (c). We show that (c) implies (b). First of all since H is non-empty it contains an element x. Hence xx^{-1} = e is an element of H. For every element x of H, belongs to H; hence the relations imply . Clearly (a) implies (d). We show that (d) implies (a): the canonical injection of H into G is a group homomorphism; hence and the relation implies (no. 1).
Remark
(1) Similarly it can be shown that condition (b) is equivalent to the condition (c') and the relations and imply . (2) For every subgroup H of G there are the following relations
If H is a stable subgroup of G and K is a stable subgroup of H, clearly K is a stable subgroup of G.
The set is the smallest stable subgroup of G. The intersection of a family of stable subgroups of G is a stable subgroup. There is therefore a smallest stable subgroup H of G containing a given subset X of G; it is called the stable subgroup generated by X and X is called a generating system (or generating set) of H.
Proposition 2
Let X be a non-empty subset of a group with operators G and the stable subset under the action of on G generated by X. The stable subgroup generated by X is the stable subset under the law on G generated by the set .
The latter subset Z is the set of compositions of finite sequences all of whose terms are elements of or inverse of elements of : the inverse of such a composition is a composition of the same form (§ 2, no. 3, Corollary 1 to Proposition 5) and Z is stable under the action of , as is seen by applying § 3, no. 4, Proposition 1 to the homotheties of G, hence (Proposition 1) Z is a stable subgroup of G. Conversely, every stable subgroup containing X obviously contains Y and hence Z.
Corollary 1
Let G be a group with operators and X a subset of G which is stable under the action of . The subgroup generated by X and the stable subgroup generated by X coincide.
Corollary 2
Let G be a group and X a subset of G consisting of pairwise permutable elements. The subgroup of G generated by X is commutative.
The set consists of pairwise permutable elements (§ 2, no. 3, Proposition 5) and the law induced on the stable subset generated by Y is commutative (§ 1, no. 5, Corollary 2).
If G is a group with operators, the stable subgroup generated by a subset of G consisting of pairwise permutable elements is not necessarily commutative.
Corollary 3
Let be a homomorphism of groups with operators and X a subset of G. The image under f of the stable subgroup of G generated by X is the stable subgroup of G' generated by .
Let . Then and . Hence
Example (2). Let G be a group and x an element of G. The subgroup generated by (called more simply the subgroup generated by x) is the set of . The stable subset (under the law on G) generated by is the set of where . These two sets are in general distinct.
Thus, in the additive group , the subgroup generated by an element x is the set of , and the stable subset generated by x is the set of . These two sets are always distinct if .
The union of a right directed family of stable subgroups of G is obviously a stable subgroup. It follows that, if P is a subset of G and H a stable subgroup of G not meeting P, the set of stable subgroups of G containing H and not meeting P, ordered by inclusion, is inductive (Set Theory, III, § 2, no. 4). Applying Zorn's Lemma (Set Theory, III, § 2, no. 4), we obtain the following result:
Proposition 3
Let G be a group with operators, P a subset of G and H a stable subgroup G not meeting P. The set of stable subgroups of G containing H and not meeting P has a maximal element.
4. Quotient groups
Theorem 1
Let R be an equivalence relation on a group with operators G; if R is left (resp. right) compatible (§ 3, no. 3) with the group law on G and compatible with the action of , the equivalence class of e is a stable subgroup H of G and the relation R is equivalent to (resp. ). Conversely, if H is a stable subgroup of G, the relation (resp. ) is an equivalence relation which is left (resp. right) compatible with the group law on G and compatible with the action of and under which H is the equivalence class of e.
We restrict our attention to the case where the relation R is left compatible with the law on G (the case of a right compatible relation follows by replacing the law on G by the opposite law). The relation is equivalent to , for implies and conversely implies . If H denotes the equivalence class of e, the relation R is then equivalent to . We show that H is a stable subgroup of G. For every operator , the relation implies , hence and H is stable under the action of . It suffices to establish (Proposition 1) that and imply , that is and imply , which is a consequence of the transitivity of R.
Conversely, let H be a stable subgroup of G; the relation is reflexive since ; it is symmetric since implies ; it is transitive, for and imply ; it is left compatible with the law of composition on G, for for all ; finally, for every operator , the relation implies and hence the equivalence relation is compatible with the action of on G.
Let G be a group and H a subgroup of G; the relation (resp. ) is also written in the equivalent form (resp. ). Every subgroup H of G thus defines two equivalent relations on G, namely and : the equivalent classes under these relations are respectively the sets , which are called left cosets of H (or modulo H), and the sets , which are called right cosets of H (or modulo H). By saturating a subset with respect to these relations (Set Theory, II, § 6, no. 4), we obtain respectively the sets AH and HA. The mapping transforms left cosets modulo H into right cosets modulo H and conversely.
The cardinal of the set of left cosets (mod. H) is called the index of the subgroup H with respect to G and is denoted by ; it is also equal to the cardinal of the set of right cosets.
If a subgroup K of G contains H, it is a union of left (or right) cosets of H. Since a left coset of K is obtained from K by left translation, the set of left cosets of H contained in a left coset of K has cardinal independent of the latter. Hence (Set Theory, III, § 5, no. 8, Proposition 9):
Proposition 4
Let H and K be two subgroups of a group G such that H K. Then*
Corollary
If G is a finite group of order g and H is a subgroup of G of order h, then*
Theorem 1 allows us to determine the equivalence relations compatible with the laws on a group with operators G: if R is such a relation, it is both left and right compatible with the group law on G and with the action of . Hence, if H is the class of (mod. R), H is a stable subgroup such that the relations and are equivalent (since both are equivalent to R); hence for all . Conversely, if this is so, one or other of the equivalent relations is compatible with the group law, since it is both left and right compatible with this law ( 3, no. 4) and is compatible with the action of . Since the equation is equivalent to , we make the following definition:
Definition 5
Let G be a group with operators. A stable subgroup H of G is called a normal (or invariant) stable subgroup of G if for all .
If , a normal stable subgroup of G is called a normal (or invariant) subgroup of G. In a commutative group every subgroup is normal.
To verify that a stable subgroup H is normal, it suffices to show that for all ; for if so then for all , that is , and hence .
Let H be a normal stable subgroup of G and R the equivalence relation defined by H; on the quotient set , the internal law, the quotient by R of the law of the group G, is associative; the class of e is the identity element of this quotient law; the classes of two inverse elements in G are inverses under the quotient law and the action of , the quotient by R of the action of on G, is distributive with respect to the internal law on ( 3, no. 5). Hence, summarizing the results obtained:
Theorem 2
Let G be a group with operators. For an equivalence relation R on G to be compatible with the group law and the action of , it is necessary and sufficient that it be of the form , where H is a normal stable subgroup of G (the relation being moreover equivalent to for such a subgroup). The law of composition on the quotient of that on G and the action of on the quotient of that of on G by such a relation R give the structure of a group with operators, called the quotient structure, and the canonical mapping of the passage to the quotient is a homomorphism of groups with operators.
Definition 6
The quotient of a group with operators G by the equivalence relation defined by a normal subgroup H of G, with the quotient structure, is called the quotient group with operators of G by H and is denoted by . The canonical mapping is called a canonical homomorphism
Let G be a group and H a normal subgroup of G. The quotient , with its group structure, is called the quotient group of G by H. For a mapping from to a group with operators to be a homomorphism of groups with operators, it is necessary and sufficient that its composition with the canonical mapping of G onto be one: this justifies the name "quotient group" (Set Theory, IV, 2, no. 6).
The equivalence relation defined by a normal stable subgroup of G is denoted by or .
Proposition 5
Let be a homomorphism of groups with operators and and normal stable subgroups of and respectively such that . The mapping is compatible with the equivalence relations defined by and . Let and be the canonical homomorphisms. The mapping derived from by passing to the quotients is a homomorphism.
If , then , whence
Remark
(1) If is any subset of a group and is a normal subgroup of , then ; this set is obtained by saturating with respect to the relation .
(2) If is a normal subgroup of of finite index, the quotient group is a finite group of order .
Note that if is a normal subgroup of a group and is a normal subgroup of , is not necessarily a normal subgroup of (I, , Exercise 10).
Let be a group with operators. The intersection of every family of normal stable subgroups of is a normal stable subgroup. Hence, for every subset of , there exists a smallest normal stable subgroup containing , called the normal stable subgroup generated by .
In a group with operators , the stable subgroups and are normal.
Definition 7
A group with operators* is called simple if and there exists no normal stable subgroup of other than and .
5. Decomposition of a homomorphism
Proposition 6
Let* be a group with operators and a magma with an action by , written exponentially. Let be a homomorphism of the magna into the magma such that, for all and all , . Then is a stable subset of under the law on and the action of ; the set with the induced laws is a group with operators and the mapping of into is a homomorphism of groups with operators.
By virtue of , no. 4, Proposition 1, is a stable subset of under the internal law on . For every element and for every operator , and therefore is stable under the action of on . Writing the internal law of multiplicatively,
Let be the identity element of . Its image is an identity element of (, no. 1). Every element of is invertible in (, no. 3). Therefore the law induced on by the internal law on is a group law. For all elements and in and every operator ,
which shows that the action of is distributive with respect to the group law on . Therefore with the induced laws is a group with operators and clearly the mapping is a homomorphism of groups with operators.
Definition 8
Let be a homomorphism of groups with operators. The inverse image of the identity element of is called the kernel of .
The kernel of is often denoted by and the image of is sometimes denoted by .
Theorem 3
Let be a homomorphism of groups with operators.* (a) is a normal stable subgroup of ; (b) is a stable subgroup of ; (c) the mapping is compatible with the equivalence relation defined on by ; (d) the mapping derived from by passing to the quotient is an isomorphism of groups with operators; (e) *, where is the canonical injection of into and is the canonical homomorphism of onto .
Assertion (b) follows from Proposition 6. The equivalence relation on is compatible with the group with operators structure on . By Theorem 2 (no. 4), it is therefore of the form , where is a normal stable subgroup of and is the class of the identity element, whence . Assertions (a), (c) and (d) then follow. Assertion (e) is obvious (Set Theory, II, § 6, no. 5).
6. Subgroups of a quotient group
Proposition 7
Let and be two groups with operators, a homomorphism of into and the kernel of .* (a) Let be a stable subgroup of . The inverse image is a stable subgroup of and is normal in if is normal in . Further, is a normal subgroup of . If is surjective, then and defines an isomorphism of onto on passing to the quotient. (b) *Let be a stable subgroup of . The image is a stable subgroup of and . In particular, if and only if . If is surjective and is normal in , then is normal in .
(a) Let and be in and ; then and , whence , that is ; hence is a subgroup of . Now , whence and therefore is stable. Suppose is normal in and let ; then and
(b) Let and be in and in ; there exist in with and , whence , hence is a subgroup of which is stable, for . Let ; then if and only if , that is if and only if there exists in with ; the relation is equivalent to the existence of with ; finally, is equivalent to . Clearly the relation is equivalent to . Suppose finally that is surjective and is normal in ; let and ; there exist and with and , whence . Hence is normal in .
Corollary 1
Suppose that is surjective. Let (resp. ) be the set of stable (resp. normal stable) subgroups of containing and (resp. ) the set of stable (resp. normal stable) subgroups of , these sets being ordered by inclusion. The mapping is an ordered set isomorphism ; the inverse isomorphism is the mapping . Further and induce isomorphisms and .
Corollary 2
Let be a homomorphism of groups with operators, the kernel of , a stable subgroup of and a normal stable subgroup of . Then and are normal stable subgroups of and respectively and the three quotient groups with operators and are isomorphic.
Let and denote the homomorphism of onto which coincides with on ; the kernel of is and ; by Proposition 7, is a normal stable subgroup of and
it defines an isomorphism of onto . By Proposition 7, (b), ; if is the homomorphism of onto which coincides with on , the homomorphism of onto is surjective with kernel ; this proves that is a normal stable subgroup of and that defines an isomorphism of onto .
Corollary 3
Let be a homomorphism of groups with operators, its kernel, a subset of such that generates and a subset of which generates . Then generates .
Let be the stable subgroup of generated by . As , .
As , , whence .
Remark
In the notation of Proposition 7, the fact that the inverse image of a subgroup of is a subgroup of follows from the following more general fact.
If and are subsets of and is surjective, then
Obviously ; on the other hand, if , there exists and such that ; as is surjective, there exists such that ; writing , and , whence . The relation is equivalent to , hence to , that is to and finally to .
Proposition 8
Let be a group with operators and and two stable subgroups of . Suppose that the relations and imply (in other words, normalizes ). Then is a stable subgroup of , is a normal stable subgroup of and is a normal stable subgroup of . The canonical injection of into defines on passing to the quotient an isomorphism of onto .
The formulae
for , and every operator on , show that is a stable subgroup of . Let and ; then by the hypotheses made on and and clearly belongs to , hence is normal in . Let and be in ; the formula shows that is normal in . Let be the restriction to of the canonical homomorphism of AB onto AB/B; then and hence the kernel of is equal to . Clearly is surjective and hence defines an isomorphism of onto .
Theorem 4
Let G be a group with operators and N a normal stable subgroup of G.
(a) The mapping is a bijection of the set of stable subgroups of G containing N onto the set of stable subgroups of G/N.
(b) Let be a stable subgroup of G containing N. For to be normal in , it is necessary and sufficient that be normal in G and the groups and are then isomorphic.
(c) Let be a stable subgroup of G. Then is a stable subgroup of G and N is normal in . Further is normal in and the groups and are isomorphic.
Let denote the canonical homomorphism of G onto . For all , ; therefore, for every subgroup of G containing N. As is surjective, assertion (a) follows from Corollary 1 to Proposition 7; similarly for the equivalence "G' normal" "G'/N normal". Suppose that is a normal stable subgroup of G containing N. By no. 4, Proposition 5 applied to , there exists a homomorphism of into defined by for all . It is immediate that is surjective with kernel whence the desired isomorphism of onto . Finally, (c) follows immediately from Proposition 8.
7. The jordan-hölder theorem
Definition 9
A composition series of a group with operators G is a finite sequence of stable subgroups of G, with and and such that is a normal subgroup of for . The quotients are called the quotients of the series. A composition series is said to be finer than a composition series if is a series taken from .
If and are respectively composition series of two groups with operators G and H, they are said to be equivalent if and there exists a permutation of the interval of , such that the groups with operators and are isomorphic for all .
Note that in general a series taken from a composition series is not a composition series, since for , is not in general a normal subgroup of .
Theorem 5 (Schreier). *Given two composition series of a group with operators G, there exist two equivalent composition series , finer respectively than and .
Let and be the two given composition series with respectively and terms; we shall see that the composition series can be formed by inserting subgroups (1 \leq j \leq p - 1) between H_i and H_{i+1} for 0 \leq i \leq n - 1 and the series \Sigma_2' by inserting n - 1 subgroups K_{j,i}' (1 \leq i \leq n - 1) between K_j and K_{j+1} for 0 \leq j \leq p - 1; thus two series of pn + 1 stable subgroups of G will be obtained; by choosing suitably the inserted stable subgroups, we shall show that these series are equivalent composition series.
To this end note that H_i \cap K_j is a stable subgroup of H_i and of K_j, and hence (Theorem 4) H_{i+1}.(H_i \cap K_j) is a stable subgroup of H_i containing H_{i+1} and K_{j+1}.(H_i \cap K_j) is a stable subgroup of K_j containing K_{j+1}. If we write H_{i,j}' = H_{i+1}.(H_i \cap K_j) and K_{j,i}' = K_{j+1}.(H_i \cap K_j), H_{i,j+1}' is a stable subgroup of H_{i,j}' (0 \leq j \leq p - 1) and K_{j,i+1}' is a stable subgroup of K_{j,i}' (0 \leq i \leq n - 1). Moreover H_{i,0}' = H_i, H_{i,p}' = H_{i+1}, K_{j,0}' = K_j and K_{j,p}' = K_{j+1}. To show the theorem, it suffices to show that H_{i,j+1}' (resp. K_{j,i+1}') is a normal stable subgroup of H_{i,j}' (resp. K_{j,i}') and that the quotient groups H_{i,j}'/H_{i,j+1}' and K_{j,i}'/K_{j,i+1}' are isomorphic (0 \leq i \leq n - 1, 0 \leq j \leq p - 1). This follows from the following lemma by taking H = H_i, H' = H_{i+1}, K = K_j, K' = K_{j+1}.
Lemma 1 (Zassenhaus). Let H and K be two stable subgroups of a group with operators G and H' and K' normal stable subgroups of H and K respectively; then H'.(H \cap K') is a normal stable subgroup of H'.(H \cap K), K'.(K \cap H') is a normal stable subgroup of K'.(K \cap H) and the quotient groups with operators (H'.(H \cap K))/(H'.(H \cap K')) and (K'.(K \cap H))/(K'.(K \cap H')) are isomorphic.
By Theorem 4, H' \cap K = H' \cap (H \cap K) is a normal stable subgroup of H \cap K; similarly K' \cap H is a normal stable subgroup of K \cap H; hence (no. 6, Corollary 2) (H' \cap K)(K' \cap H) is a normal stable subgroup of H \cap K. By Theorem 4 applied to the group H,
is a normal stable subgroup of H'.(H \cap K) and the quotient group
is isomorphic to
In the last quotient, H and H' on the one hand and K and K' on the other appear symmetrically; permuting them the stated result is obtained.
Definition 10
A Jordan-Hölder series of a group with operators G is a strictly decreasing decomposition series \Sigma such that there exists no strictly decreasing decomposition series distinct from \Sigma and finer than \Sigma.
Proposition 9
For a decomposition series of G to be a Jordan-Hölder series it is necessary and sufficient that all the quotients of the series be simple.
A decomposition series is strictly decreasing if and only if none of its successive quotients is reduced to the identity element. If a strictly decreasing composition series is not a Jordan-Hölder series, there exists a strictly decreasing composition series which is finer than and distinct from . There are therefore two consecutive terms of which are not consecutive in ; let be the first term which follows in ; is a normal stable subgroup of , containing and distinct from the latter; hence is a normal stable subgroup of , distinct from the latter and from the identity element; therefore is not simple. Conversely, if is a strictly decreasing composition series one of whose quotients is not simple, this quotient contains a normal stable subgroup other than itself and , whose inverse image in is a normal stable subgroup of , distinct from and (Theorem 4); it suffices to insert between and to obtain a strictly decreasing composition series distinct from and finer than .
Theorem 6 (Jordan-Hölder). Two Jordan-Hölder series of a group with operators are equivalent.
Let be two Jordan-Hölder series of a group with operators ; by applying Theorem 5 two equivalent composition series are obtained which are respectively finer than and ; since the latter are Jordan-Hölder series, is identical with or is derived from it by repeating certain terms; the series of quotients of is derived from that for by inserting a number of terms isomorphic to the group ; since is strictly decreasing, the series of quotients of is derived from that of by suppressing in the latter all the terms isomorphic to . Similarly for and . As the series of quotients of and differ (up to isomorphism) only in the order of the terms, the same is true of and ; the theorem is proved.
Corollary
Let be a group with operators in which there exists a Jordan-Hölder series. If is any strictly decreasing composition series of , there exists a Jordan-Hölder series finer than .
Let be a Jordan-Hölder series of ; by Theorem 5, there exist two equivalent composition series, and respectively finer than and ; the argument of Theorem 6 shows that, by suppressing from the repetitions, a sequence is obtained which is equivalent to and hence a Jordan-Hölder series, since all its quotients are simple (Proposition 9). As is strictly decreasing, is finer than , whence the corollary.
Remark
A group with operators does not always possess a Jordan-Hölder series; an example is given by the additive group of rational integers: the sequence is a strictly decreasing infinite sequence of (normal) subgroups of ; for all , the first terms of this sequence form with the group a strictly decreasing composition series; if there existed a Jordan-Hölder series for , it would have at least terms, by the Corollary to Theorem 6; absurd, since is arbitrary.
On the other hand, there exists a Jordan-Hölder series in every finite group with operators G: if , among the normal stable subgroups of G distinct from G, let be a maximal subgroup; similarly define by induction as a maximal element in the set of normal subgroups of , distinct from , when ; the sequence of orders of the is strictly decreasing, hence there exists such that and the sequence consisting of G and the () is by its formation a Jordan-Hölder series.
Definition 11
Let G be a group with operators; the length of G is the upper bound of the integers such that there exists a strictly decreasing composition series of G .
If G admits a Jordan-Hölder series, the length of G is the number of successive quotients of this series, as follows from the Corollary to Theorem 6. If G does not admit a Jordan-Hölder series, its length is infinite; by Proposition 9, for every strictly decreasing series of G there exists a strictly finer strictly decreasing series. The group consisting of the identity element is the only group with operators of length zero. A group with operators is simple if and only if it is of length 1.
Let G be a group with operators, H a normal stable subgroup of G, K the quotient G/H and the canonical homomorphism. Let
be a decomposition series of H and
be a composition series of K. Writing for and for , a composition series
of G is obtained. The sequence of quotients of is obtained by juxtaposing the sequence of quotients of and the sequence of quotients of . If and are Jordan-Hölder series, is a Jordan-Hölder series of G, by Proposition 9. If H or K admits composition series of arbitrary length, so does G. We have proved:
Proposition 10
Let G be a group with operators and H a normal stable subgroup of G. The length of G is the sum of the lengths of H and G/H.
Corollary
Let G be a group with operators and a composition series of G. The length of G is the sum of the lengths of the , .
If G and are isomorphic groups with operators and G admits a Jordan-Hölder series, so does and the Jordan-Hölder series of G and are equivalent. However, non-isomorphic groups can have equivalent Jordan-Hölder series; such is true for and , cf. no. 10.
8. Products and fibre products
Let be a family of groups with operators. Let be the product monoid of the . Consider the action of on defined by
With this structure is a group with operators. For all , the projection mapping is a homomorphism of groups with operators.
Definition 12
The group with operators* defined above is the product group with operators of the . The mappings are called the projection homomorphisms.
A particular case of the product of groups with operators is the group consisting of the mappings of a set into a group with operators , the laws being defined by:
Let be a family of homomorphisms of groups with operators. The mapping of into is a homomorphism of groups with operators. It is the only homomorphism satisfying for all . This justifies the name "product group with operators" (Set Theory, IV, § 2, no. 4).
Let be a family of homomorphisms of groups with operators. The mapping of into is a homomorphism of groups with operators.
Proposition 11
Let* be a family of homomorphisms of groups with operators and let . *Then:
(a) ; in particular, if all the *are injective, is injective.
(b) ; in particular, if all the *are surjective, is surjective.
This is immediate.
In particular, let be a family of groups with operators and, for all , let be a stable (resp. normal stable) subgroup of . The product is a stable (resp. normal stable) subgroup of and the canonical mapping of onto defines when passing to the quotient an isomorphism of
If and are disjoint subsets of , it follows from the definitions that every element of commutes with every element of .
Definition 13
Let be a group with operators and a family of normal stable subgroups of . Let be the canonical homomorphism. is called the internal product (or product) of the family of quotient groups if the homomorphism is an isomorphism of onto .
Let and be groups with operators and let and be two homomorphisms of into . The set of elements in such that is a stable subgroup of , called the coincidence group of and . In particular, let and be homomorphisms of groups with operators; the coincidence group of the homomorphisms and of into is called the fibre product of and over relative to and . It is denoted by when there is no ambiguity about and and the restrictions and of and to are also called projection homomorphisms. Then . The elements of are the ordered pairs such that . If is a homomorphism of a group with operators into () and , there exist one and only one homomorphism of into such that for .
9. Restricted sums
Let be a family of groups with operators and, for , let be a stable subgroup of . The subset of consisting of the such that the set of with is finite is a stable subgroup of equal to if is finite. It is called the restricted sum of the with respect to the . When, for all except for a finite number, is a normal stable subgroup of , the restricted sum is a normal stable subgroup of the product. When, for all , the subgroup is reduced to the identity element of , the direct sum of the with respect to the is called simply the restricted sum of the and is sometimes denoted by . For all , the mapping defined by , where and if , is an injective homomorphism of groups with operators called the canonical injection. is identified with the stable subgroup . The subgroups are normal. For , the elements of and commute and . The group is generated by the set .
Proposition 12
Let be a family of homomorphisms of groups with operators such that, for all and with , , , the elements and of commute; there exists one and only one homomorphism of groups with operators of into such that for all . For every element of , .
If and are solutions to the problem, they coincide on and hence on , whence the uniqueness of . We now show the existence of : for every element of , let (§ 1, no. 5). Clearly for all and commutes with homotheties; the formula follows from § 1, no. 5, formula (9).
Definition 14
Let be a group with operators and a family of stable subgroups of . is called the internal restricted sum (or restricted sum) of the family of subgroups if every element of is permutable with every element of for and the unique homomorphism of into whose restriction to each of the is the canonical injection is an isomorphism.
When is finite, we also say, by an abuse of language, internal direct product (or direct product, or product) instead of internal restricted sum. Every stable subgroup H of G for which there exists a stable subgroup H' of G such that G is the direct product of H and H' is called a direct factor of G.
Proposition 13
Let G be a group with operators and a family of stable subgroups of G such that every element of is permutable with every element of for . For G to be the restricted sum of the family of subgroups , it is necessary and sufficient that every element x of G be expressible uniquely in the form , where is a family with finite support of elements of G with for all i.
Obvious.
Proposition 14
Let G be a group with operators and a finite family of stable subgroups of G. For G to be the restricted sum of the family of subgroups , it is necessary and sufficient that each be normal and that G be the product of the quotient groups , where is the subgroup generated by the for .
The condition is obviously necessary. Conversely, suppose G is the product of the and let G be identified with the product of the . Then is identified with a subgroup of , so that, for , every element of is permutable with every element of ; on the other hand, is identified with the product of the for , hence for all and G is the direct product of the .
Proposition 15
Let G be a group with operators and a sequence of normal stable subgroups of G such that*
By induction on , this is immediately reduced to proving the proposition for . We show first that, if and , x and y are permutable; for and hence (since and are normal) , that is , by the hypothesis. Moreover is a subset of G which is stable under the homotheties of G. It follows (by no. 3, Proposition 1) that is a stable subgroup of G and it is immediately verified that this subgroup is normal. Suppose finally that , with ; then , hence , and similarly ; is thus the direct product of and .
When the group considered are commutative, the term direct sum is used instead of direct product.
10. Monogenous groups
Let ; since is a subgroup of , the relation between elements of which states "there exists such that " is an equivalence relation, which we agree, once and for all, to write as or and which is called congruence modulo . Replacing by an equivalent relation is obtained, hence it may be supposed that ; for , means , hence a relation distinct from equality is obtained only if : we shall therefore suppose in what follows that unless otherwise indicated.
For , the quotient of by the congruence , that is the group , is called the group of rational integers modulo .
Proposition 16
Let be an integer . The integers such that form a system of representatives of the equivalence relation on .
If is an integer , there exist (Set Theory, III, § 5, no. 6) integers and such that and and . If is an integer , the integer is and by the above there exists an integer such that and . Writing if and if , then
and . We now show that if , then . Now for and for , whence .
Corollary
Let be an integer . The group of rational integers modulo is a group of order .
Proposition 17
Let be a subgroup of . There exists one and only one integer such that .
If , then . Suppose that . The subgroup has an element . Then or , and therefore has elements . Let be the smallest element in . The subgroup generated by is contained in ; we show that . Let . By Proposition 16, there exists an integer such that and . A fortiori , whence . But this is only possible if and therefore . The integer is unique: if , then necessarily , and if , the integer is the order of .
Definition 15
A group is called monogenous if it admits a system of generators consisting of a single element. A finite monogenous group is called cyclic.
Every monogenous group is commutative (no. 3, Corollary 2 to Proposition 2). Every quotient group of a monogenous group is monogenous (no. 3, Corollary 3 to Proposition 2).
The additive group is monogenous: it is generated by . For every positive integer , the group is monogenous, for it is a quotient of .
Proposition 18
A finite monogenous group of order a is isomorphic to . An infinite monogenous group is isomorphic to .
Let G be a monogenous group (written multiplicatively) and x a generator of G. The identity (§ 1, no. 3, formula (1)) shows that the mapping is a homomorphism of into G. Its image is a subgroup of G containing x and hence it is G. By no. 5, Theorem 3, the group G is isomorphic to the quotient of by a subgroup, which is necessarily of the form (Proposition 17). If , the group G is finite of order a and if , the group G is isomorphic to .
Proposition 19
Let a be an integer > 0. Let H be a subgroup of , b the order of H and c its index in . Then , and H is isomorphic to .
Conversely, let b and c be two integers > 0 such that . Then and is a subgroup of , of order b and index c.
by no. 4, Corollary to Proposition 4. By no. 7, Theorem 4, H is of the form , where is a subgroup of and is isomorphic to and hence of order c. By Proposition 17 and the Corollary to Proposition 16, and hence H is monogenous. Finally, H is isomorphic to by Proposition 18. Conversely, if , then for : the quotient group is isomorphic to (no. 7, Theorem 4) and hence of order c (no. 4, Corollary to Proposition 4) and index b (no. 4, Corollary to Proposition 4).
Corollary
Every subgroup of a monogenous group is monogenous.
Let a and b be two integers . The relation is also written: b is a multiple of a, and also a divides b or a is a divisor of b.
Definition 16
An integer is called prime if and it admits no divisor > 1 other than p.
Proposition 20
An integer is prime if and only if the group is a simple group.
This follows from Proposition 19.
Corollary
Every commutative simple group is cyclic of prime order.
Let G be such a group. Then ; let be an element of G. The subgroup generated by a is normal since G is commutative, it is not reduced to and hence is equal to G. Therefore G is monogenous and hence isomorphic to a group of the form with , since is not simple, and is necessarily prime.
Remark
A finite group G of prime order is necessarily cyclic. G admits no subgroup other than G and and hence it is generated by every element .
Lemma 2
Let be an integer . By associating with every composition series of the group the sequence , where is the order of , a one-to-one correspondence is obtained between the composition series of and the finite sequences of integers such that . The composition series is a Jordan-Hölder series if and only if the are prime.
If is a composition series of , it follows, by induction on , from no. 4, Proposition 4, that .
Conversely, let be a sequence of integers such that . If is a composition series of such that for , then necessarily as is seen by induction on , whence (Proposition 19), which shows the injectivity of the mapping in question. We now show its surjectivity. Writing for , a composition series of is obtained such that (Proposition 19). The second assertion follows from Proposition 20 and no. 7, Proposition 9.
Let denote the set of prime numbers.
Theorem 7 (decomposition into prime factors)
Let be a strictly positive integer. There exists one and only one family of integers such that the set of with is finite and
As the group is finite, it admits a Jordan-Hölder series. Lemma 2 then implies that is a product of prime integers, whence the existence of the family ; further, for every family satisfying the conditions of Theorem 7, the integer is, for all , equal to the number of factors of a Jordan-Hölder series of isomorphic to (Lemma 2). The uniqueness of the family therefore follows from the Jordan-Hölder theorem (no. 7, Theorem 6).
Corollary
Let and be two integers . Then . For to divide , it is necessary and sufficient that for every prime number .
In any group , if the (monogenous) subgroup generated by an element is of finite order , is called an element of order ; the number is therefore the least integer such that ; if the subgroup generated by is infinite, is said to be of infinite order. These definitions, together with Proposition 4 (no. 4), imply in particular that in a finite group G the order of every element of G is a divisor of the order of G.
Proposition 21
In a finite group G of order n, for all .
If is the order of , then , with an integer, and hence .
Exercises
See the exercises for § 4.