Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Problem 5.5.9 (Groups of order $1805$)
Problem 5.5.9 (Groups of order $1805$)
Show that the matrix is an element of order in . Use this matrix to construct a non-abelian group of order and give a presentation of this group. Classify groups of order (there are three isomorphism types).
Answers
Proof. Put
We check :
sage: G = GL(2, GF(19)) sage: G.order() 123120 sage: A = matrix([[0,-1],[1,4]]); A = G(A); A [ 0 18] [ 1 4] sage: A^5 [1 0] [0 1]
Note that .
Consider the map
As in Exercise 8, since , is well defined, and is a homomorphism. Therefore
is a non-abelian group of order .
The law of is given by
where .
Presentation of .
Consider the three elements of defined by
If is any element of , then
so
By (2), we have
Now we prove that
To this end, we must prove that if is any group containing elements such that
then there is a unique homomorphism such that
-
Unicity. If is a homomorphism that satisfies (3) and (4), then
This proves the unicity of .
-
Existence. We define the map by
Since and by (3), is a well defined application such that (4) is true.
We show that is a homomorphism. We prove first by induction on that for all integers ,
It is true when . Suppose that (5) is true for some integer . Then
where
The induction is done, which proves that (5) is true for any .
If , by (5) applied to , then , where , thus , where , so (5) is true for all integers .
Then, for all and for all ,
and
So is a homomorphism.
Put . The preceding reasoning shows that there is a homomorphism such that and . By definition of a presentation, there is an homomorphism such that and . Then satisfies . Since , this shows that . Similarly, . So is bijective, and is an isomorphism. This proves, with a slight notation modification,
Classification of groups of order . Let be a group of order . By Theorem 5, if is abelian,
Now we assume that is a non-abelian group.
By Sylow’s Theorem, and , thus . Let be the unique Sylow -subgroup, and let be a -Sylow subgroup. Similarly, and , thus or .
If , then and , and is abelian, in contradiction with our hypothesis. Therefore
Since , is a subgroup of . Moreover (if , then divides and , thus ). Therefore . Moreover, or .
If , then , so . The homomorphism is the trivial homomorphism and is abelian: contradiction. Therefore
for some homomorphism .
There is some matrix such that
Since , then , and since is not trivial, .
With some help of Sagemath(see APPENDIX) , we obtain that the set
of cardinality , is the union of two disjoint conjugacy classes and , where
Both classes have cardinality .
Moreover , and for , we obtain
With these results, we can show that :
- 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 non-abelian group of order , up to isomorphism.
So there are types of groups of order :
where
□APPENDIX:
sage: G = GL(2, GF(19))
sage: order(G), order(G).factor()
(123120, 2^4 * 3^4 * 5 * 19)
sage: A = G(matrix([[0, -1],[1,4]])); A
[ 0 18]
[ 1 4]
sage: I = G(1)
sage: CA = A.conjugacy_class().list(); len(CA)
342
sage: liste = []
sage: for B in G:
....: if B != I and B^5 == I:
....: liste.append(B)
....:
sage: len(liste)
684
sage: for B in liste:
....: if B not in CA:
....: break
....:
sage: B
[ 2 17]
[17 12]
sage: CB = B.conjugacy_class().list(); len(CB)
342
sage: B in CA
False
sage: B^2 in CA
True
sage: for P in G:
....: if P * A * P^-1 == B^2:
....: break
....:
sage: P
[10 4]
[ 0 5]
sage: P * A * P^-1, B^2
(
[ 8 10] [ 8 10]
[10 15], [10 15]
)