Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Problem 5.5.7 (Groups of order 56)
Problem 5.5.7 (Groups of order 56)
This exercise describes thirteen isomorphism types of groups of order . (It is not difficult to show that every group of order is isomorphic to one of these.)
- (a)
- Prove that there are three abelian groups of order .
- (b)
- Prove that every group of order has either a normal Sylow -subgroup or a normal Sylow -subgroup.
- (c)
-
Construct the following non-abelian groups of order
which have a normal Sylow
-subgroup and whose Sylow
-subgroup
is as specified:
- one group when
- two nonisomorphic groups when
- one group when
- two nonisomorphic groups when
- three nonisomorphic groups when
[For a particular , two groups are not isomorphic if the kernels of the maps from into are not isomorphic.]
- (d)
- Let be a group of order with a nonnormal Sylow -subgroup. Prove that if is the Sylow -subgroup of then . [Let an element of order act by conjugation on the seven nonidentity elements of and deduce that they all have the same order.]
Answers
Proof. Let be a group of order .
- (a)
- If is abelian, by Theorem 5 of Chapter 5, there are three isomorphism types of abelian groups of order :
- (b)
-
By Sylow’s Theorem, if
denotes the number of Sylow
-subgroups of
, then
so
Assume . Since the -Sylow subgroups have trivial intersection, these subgroups contain one element of order 1 and element of order . It remains only elements, so there is at most one Sylow -subgroup of order , so . Therefore
Every group of order has either a normal Sylow -subgroup or a normal Sylow -subgroup.
- (c)
-
Suppose here that the non-abelian group
has a normal Sylow
-subgroup
(
), and let
be a Sylow
-subgroup of
. The order of an element
divides
and
, thus
, so
. Since
,
is a subgroup of
, and
, thus
. Since
Theorem 12 shows that
where the homomorphism is associated to the action of on by conjugation. There are types of groups of order , so we distinguish five cases.
-
If , then (in additive notations)
where is a homomorphism.
Since , there is only one element of order in , given by
The homomorphism maps the elements of order on an automorphism of order or , so , and so on: there exist such that
Then , where , thus , and so
Conversely, if is defined by (1), then for all ,
so and is an homomorphism. This shows that there are homomorphisms defined by (1).
If then is the trivial homomorphism, and is abelian. There are non trivial homomorphisms, for .
Consider two such homomorphisms defined by
where .
We show , by proving , where (see “Missing Theorem: precomposition by an automorphism” in the Appendix to Exercise 6).
We can rewrite (2) and (3) in the form
where , and is a linear form of matrix . Since and , there is some such that
so that , where has matrix . Then for all , so that .
This shows .
In conclusion, , where is any of the previous non trivial homomorphisms, for instance
Then the law on is given by
where .
There is only one type of non abelian groups of order which have a normal Sylow -subgroup and whose Sylow -subgroup is isomorphic to .
-
If , then
where is a homomorphism. Since , divides , and so , and similarly since , :
If and , where , then
so, for all ,
As in the previous item, every map defined by (4) is a homomorphism.
Therefore there are exactly non trivial homomorphisms , defined by
Consider the automorphism (see the appendix 1) characterized by
where and are generators of .
Since ,
Then, for all , and for all ,
This gives
By the missing Theorem “precomposition by an automorphism” in the Appendix to Exercise 6,
Therefore
where
The laws of these two groups are defined by
It remains to verify that these two groups are not isomorphic, by computing the kernels of and . If ,
So
Since all elements have order ,
Similarly,
Therefore
Since and are not isomorphic, and are not isomorphic by Theorem A given in the Appendix 2.
There are two types of non abelian groups of order which have a normal Sylow -subgroup and whose Sylow -subgroup is isomorphic to .
-
If , then
where is a homomorphism.
Since has order in , then , thus and . Therefore for some , and for all ,
There is only one non trivial homomorphism , given by
Therefore
where is given by
The law on is defined by
There is only one type of non abelian groups of order which have a normal Sylow -subgroup and whose Sylow -subgroup is isomorphic to .
-
If , then
where is a homomorphism.
By Exercise 6.3.7,
Since , then , thus and , so and , for some .
Conversely, if , then and satisfy and . Therefore and satisfy the relations of the presentation of , so there is a homomorphism such that and .
In conclusion, there are four homomorphisms characterized by
for all .
Then is the trivial homomorphism, and the corresponding group is the direct product , which is not abelian.
Explicitly, are given by
By the presentation of , since and in place of and satisfy the relations of the presentation of , there is a unique automorphism such that and . Then
Therefore , and so, by the missing Theorem “precomposition by an automorphism” in the Appendix to Exercise 6,
Similarly, there exists a unique such that and . Then
Therefore , and so
Moreover, since the kernel of the trivial homomorphism is , and .
The laws are defined by
There are two types of non abelian groups of order which have a normal Sylow -subgroup and whose Sylow -subgroup is isomorphic to .
-
If , then
where is a homomorphism.
By definition, , where and , and every element is of the form for some and some .
Since is a homomorphism, and , thus and , so and , for some . For all ,
therefore, for all , and for ,
Conversely, if is defined by (5) for some , then is a homomorphism: using , we obtain for ,
Since (because for all ), we obtain , so is a homomorphism.
(Alternatively, this is a consequence of the presentation of .)
Therefore there are homomorphisms , defined, for , by
Since is the trivial homomorphism, the corresponding group is the non abelian direct product .
Since , we can write the laws of these tree groups in the form
where .
We compute the kernels of :
So
Similarly
So
Finally,
So
This shows that is not isomorphic to , but we cannot conclude for . Note that and are characterized by
Since
the ordered pair satisfy the relation of the presentation of :
Therefore there is a unique homomorphism such that and . Since , is surjective, where is finite, so is an automorphism. Moreover, for all ,
Therefore , where , and so, by the precomposition by an automorphism in the Appendix to Exercise 6,
Moreover, since is the trivial homomorphism, with kernel , is not isomorphic to , nor to .
There are three types of non abelian groups of order which have a normal Sylow -subgroup and whose Sylow -subgroup is isomorphic to .
-
- (d)
-
Let
be a group of order
with a nonnormal Sylow
-subgroup. By part (b), the Sylow
-subgroup
is normal in
(
). Since
, we obtain
where is a homomorphism. Since divides , or . If , then is the trivial homomorphism, thus , and , which is in contradiction with the hypothesis. Therefore
Since is injective, , therefore
The group of order is isomorphic to or . The following array gives the order of in each case:
Since divides , the only possibility is
- (e)
-
By part (d) (in additive notations),
where is a homomorphism.
Such a homomorphism is characterized by the image of , of order . So corresponds to a matrix which satisfies . The identity has order , and there are elements of order in (see the sagemath computation below), one of them being
sage: liste= [] sage: G = GL(3, GF(2)) sage: G.order() 168 sage: I = G(1); sage: for A in G: ....: if A^7 == I: ....: liste.append(A) ....: sage: liste [ [1 0 0] [0 1 0] [0 0 1] [1 1 1] [1 1 0] [1 1 1] [0 1 0] [0 0 1] [1 0 0] [0 1 1] [1 0 1] (...) [0 1 1] [0 0 1], [1 1 0], [0 1 1], [1 1 0], [0 1 0], [1 0 1] ] sage: len(l) 49Thus there are exactly homomorphisms .
If is the trivial homomorphism corresponding to , then , so , which is in contradiction with the hypothesis. Each of the matrices of order gives a non trivial homomorphism, and the group is non abelian.
In particular, the group , whose law is given, for and by
is a group of order such that the Sylow -Sylow subgroup is not normal. Therefore this group is not isomorphic to the previous groups.
If is replaced by another matrix of order , we show that . The corresponding homomorphisms and are given by
(Since , the maps and are well defined and are automorphisms of .)
The elements of order in are in two conjugacy classes of , the classes of
sage: G = GL(3, GF(2)) sage: A = matrix([[0,1,0], [0,0,1], [1,1,0]]) sage: A1 = matrix([[0,0,1], [1,0,0], [0,1,1]]) sage: A = G(A); A1 = G(A1); A, A1 ( [0 1 0] [0 0 1] [0 0 1] [1 0 0] [1 1 0], [0 1 1] ) sage: A.conjugacy_class().list() [ [0 1 0] [0 1 1] [0 1 0] [1 0 1] [0 1 1] [1 1 1] [1 1 1] [1 1 0] [0 0 1] [0 0 1] [1 0 1] [1 1 1] [1 1 0] [1 0 1] [1 0 0] [1 1 1] [1 1 0], [1 0 0], [1 0 0], [1 1 0], [1 1 1], [0 1 1], [1 0 1], [0 1 0], [0 1 0] [0 0 1] [0 0 1] [1 0 1] [0 0 1] [1 1 0] [1 1 1] [0 1 0] [1 1 1] [0 1 1] [1 0 1] [0 0 1] [1 0 0] [0 0 1] [1 1 0] [0 1 1] [0 1 1], [1 1 1], [0 1 0], [1 1 1], [1 1 0], [1 0 1], [1 0 0], [1 0 1], [1 1 0] [0 1 1] [1 0 1] [1 1 1] [0 0 1] [0 1 1] [1 1 0] [1 0 1] [0 1 1] [1 0 0] [1 1 0] [0 1 1] [1 1 0] [1 1 1] [1 0 1] [1 0 0] [1 0 0], [0 1 0], [0 1 0], [1 1 0], [0 1 1], [1 0 1], [1 1 1], [0 1 1] ] sage: A1.conjugacy_class().list() [ [0 0 1] [1 1 1] [1 0 1] [0 0 1] [1 0 1] [0 1 0] [1 0 1] [0 1 1] [1 0 0] [1 1 0] [1 0 0] [1 1 0] [1 1 1] [1 0 1] [1 1 0] [1 0 0] [0 1 1], [0 1 1], [0 1 0], [0 1 0], [0 1 1], [0 1 1], [1 1 1], [1 0 1], [1 0 1] [1 1 0] [1 1 0] [0 1 1] [1 1 1] [0 0 1] [0 1 0] [0 1 1] [0 0 1] [1 0 1] [0 0 1] [1 1 0] [1 0 0] [0 1 1] [0 1 1] [1 1 1] [1 1 0], [0 1 0], [1 0 0], [1 0 0], [1 1 0], [1 1 0], [1 0 0], [0 1 0], [0 1 0] [0 0 1] [1 1 0] [0 1 1] [1 1 0] [1 1 1] [0 1 0] [1 1 1] [0 0 1] [1 0 1] [1 1 1] [0 0 1] [0 1 1] [1 0 1] [1 1 1] [0 1 1] [1 0 1], [1 1 1], [1 0 1], [1 1 1], [1 1 1], [1 0 0], [1 1 0], [1 0 1] ]Note that if , then
so
Let and denote the conjugacy classes of and .
- If , then for some .
-
If , then for some . Therefore
In both cases there is some integer ( or ) and some such that
If is defined by , then for all (where ), and all ,
Therefore for all , thus
where is cyclic.
By Exercise 6,
There is a unique group of order with a nonnormal Sylow -subgroup, up to isomorphism.
We have proved that there are exactly types of groups of order . □
APPENDIX 1. Automorphisms of .
Let . Then
The elements of order in are
Note that contains five distinct elements , and so, by Lagrange’s Theorem,
Let . Since are distinct non opposite elements of order , it is the same for . Therefore there are possibilities for , given by the following array:
This shows that there are at most automorphisms.
Conversely, if are distinct non opposite elements of order , there is a homomorphism characterized by . Indeed, if , where , then . We define
( is well defined, because and are of order ).
Then, for all ,
So is a homomorphism, and .
In conclusion, there are exactly automorphisms of , characterized by the array (3).
Among these homomorphisms, consider and defined by
Then , because contains distinct automorphisms .
Moreover , and
so
This shows
where
APPENDIX 2: We prove the following result, used in part (c):
Theorem A. Let and be finite groups. Assume that is abelian and that . Let be two group isomorphisms.
If then .
Proof. We put . We consider the two subgroups of given by
( and are the same set, but subgroups of distinct groups.)
Assume that , so that there is an isomorphism .
-
The isomorphism sends on .
Since , then , so is a normal Hall subgroup of (see Exercise 3.3.10).
A normal Hall subgroup of order is unique: Suppose that and are two normal subgroups of same order , and indices relatively prime to . The prime decompositions of and are of the form
and
Then is a subgroup of , of order , thus is a divisor of , so . Since , divides , thus .
Moreover , and so . Therefore . This shows that , thus , where , so and similarly . This shows .
Since and are normal Hall subgroups of of same order, we obtain
-
Centralizer of .
Let , where is a homomorphism. Here .
Since is abelian, for all and all ,
Hence, for all ,
( is here the set )
so that
where the law on the subgroup is the restriction of the law of , so that
where is the restriction of to , so is the trivial homomorphism, and the law on is the direct product.
Hence
If we apply this result to and , we obtain
-
The kernels are isomorphic.
Since by (7), the isomorphism sends centralizers to centralizers:
Then induces an isomorphism
the well defined isomorphism being
Then (8) shows that
In conclusion,