Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Problem 5.5.8 (Groups of order 75)
Problem 5.5.8 (Groups of order 75)
Construct a non-abelian group of order . Classify all groups of order (there are three of them).
Answers
Proof. Let be an element of order , for instance
Consider the map
Since , is well defined. Moreover, for all , and ,
thus , so is a homomorphism.
Hence the group
is well defined. Since is not the trivial homomorphism, is not abelian, so there exists a non abelian group of order .
The law in is given by
where .
Classification of groups of order .
Let be a group of order . If is abelian, by Theorem 5,
Now we assume that is not abelian.
By Sylow’s Theorem, and , so
Moreover, and , thus or .
Let be a Sylow - subgroup and be a Sylow -subgroup.
Suppose that . Then , and . Therefore is abelian, in contradiction with our assumption. this shows
Since and ,
where is the homomorphism associated to conjugation. If is the trivial homomorphism, then is abelian, in contradiction with our hypothesis. Since , where , then maps on an element of order , so .
Moreover, , thus is abelian, and or . Since , we conclude
Therefore
where
is a (non trivial) homomorphism.
Then maps the element of order on some element of order , so there is some matrix of order such that for all , and for all ,
We prove that , where is defined by (1) and (2).
There are elements of order in , and the class of conjugacy of is the set of these elements, so there exists such that
(All elements of order in are similar.)
With sagemaths:
sage: G = GL(2,GF(5)) sage: G.order() 480 sage: l = [] sage: for A in G: ....: if A != G(1) and A^3 == G(1): ....: l.append(A) ....: sage: l [ [0 4] [4 1] [3 2] [0 2] [3 1] [3 4] [0 1] [4 4] [4 3] [0 3] [1 4], [4 0], [1 1], [2 4], [2 1], [3 1], [4 4], [1 0], [3 0], [3 4], [4 2] [1 3] [2 3] [2 4] [1 2] [2 2] [1 1] [3 3] [1 4] [2 1] [2 0], [4 3], [1 2], [2 2], [1 3], [4 2], [2 3], [4 1], [3 3], [3 2] ] sage: A = l[0]; A [0 4] [1 4] sage: A.conjugacy_class().list() [ [0 4] [0 3] [1 1] [0 1] [3 3] [1 2] [0 2] [2 2] [2 1] [1 4] [1 4], [3 4], [2 3], [4 4], [4 1], [1 3], [2 4], [4 2], [3 2], [3 3], [2 4] [3 1] [1 3] [3 2] [4 4] [2 3] [3 4] [4 3] [4 2] [4 1] [2 2], [2 1], [4 3], [1 1], [1 0], [1 2], [3 1], [3 0], [2 0], [4 0] ]
Since , for all ,
where is an automorphism of (see Exercise 7).
Thus , and by Exercise 6,
So there are three types of groups of order , given by
where
□