Journal of Mathematics and System Science 11 (2021) 34-37

doi: 10.17265/2159-5291/2021.02.004
D DAVID PUBLISHING

Some Applications of the First Sylow Theorem

Emmanuel Akweittey1, Yarhands Dissou Arthur1, Daniel Gyam2, and Albert Adu-Sackey3
1. Department of Mathematics Education, Akenten Appiah-Menka University of Skills Training & Entrepreneurial Development,
Ghana
2. Department of Mathematics & Statistics, University of Energy & Natural Resources, Ghana
3 Department of Applied Mathematics, Koforidua Technical University, Ghana

Abstract: In this research, numerical examples of the first Sylow theorem are discussed. Groups, subgroups, cyclic groups, p-group,
Sylow p-subgroup and, Cauchy’s theorem were used to illustrate the results.

Key words: Groups, subgroups, cyclic group, Sylow’s theorem.

1. Introduction Proof. Suppose p is a prime that divides ab but does

not divide a. We must show that p divides b. Since p
Sylow theorems form a primal part of finite group
does not divide a, there are integers s and t such that 1
theory and have very significant applications in the
= as+pt. Then b = abs+ptb, and since p divides the
classification of finite simple groups. Sylow’s
right-hand side of this equation, p also divides b.
theorems give significantly more information about
the subgroups of a finite group. The reverse of 2.1 Binaary Operation
Lagrange’s theorem is not true. Thus if G is a group of
Let G be a set. A binary operation on G is a
order p and q divides p, then G does not necessarily
function that assigns each ordered pair of elements of
possess a subgroup of order q. The Sylow theorem
G an element of G.
however, does provide a converse for Lagrange’s
theorem; in certain cases it ensures subgroups of 2.2 Group
specific orders. This theorem yields a powerful set of
Let G be a set together with a binary operation
tools for the classification of all finite nonabelian
(usually called multiplication) that assigns to each
groups. Sylow’s and Lagrange’s theorem are the two
ordered pair (a, b) of elements of G an element in G
most substantial results in finite group theory. The
denoted by ab. We say G is a group under this
first gives a sufficient condition for the existence of
operation if the following three properties are
subgroups and the second gives a necessary condition
satisfied.
[1].
1) Associative. The operation is associative; that
2. Preliminaries is, abc = a(bc) for all a, b, cG.
2) Identity. There is an element e (called the
In this section, supporting definitions, corollary,
identity) in G such that ae = ea = a for all
theorems and lemma are presented.
aG.
Lemma 2.1. If p is prime that divides ab, then p
3) Inverse. For each element aG, there is an
divides a or p divides b.
element bG (called inverse of a) such that
ab = ba = e.
If a group has the property that ab = ba for every
Corresponding author: Emmanuel Akweittey, E-mail:
eakweittey@[Link]. pair of elements a and b, we say the group is Abelian.
 Some Applications of the First Sylow Theorem 35

Theorem 2.2. In a group G, there is only one called a generator of G. The cyclic group G generated
identity element. by G is denoted by G = < a >.
Proof. Suppose both e and e' are identities of G. Theorem 2.4. Every finite Abelian group is a direct
Then, product of cyclic groups of prime-power order.
1) ae = a for every aG, and Moreover, the number of terms in the product and the
2) ea = a for every aG. order of the cyclic groups are uniquely determined by
The choices of a = e' in (part 1) and a = e in (part 2) the group [2].
yields e'e = e. Thus e and e0 are both equal to e'e and Theorem 2.5. Every cyclic group is Abelian.
so are equal to each other. Proof. The elements of cyclic groups are of the
Theorem 2.3. For each element a in a group G, form ai. Commutativity amounts to proving that
there is a unique element bG such that ab = ba = e. aiaj = ajai.
Proof. Suppose b and c are both inverses of a. Then aiaj = ai+j
ab = e and ac = e, so that ab = ac. = aj+i addition of integers is commutative
Canceling the a on both side gives b = c, as desired. = ajai [3].

2.3 Order of a Group 3. Main Result

The number of elements of a group (finite or 3.1 p-Group
infinite) is called its order. We will use G to denote
Let p be a prime number. A p group is any finite
the order of G.
group whose order is a power of p.
Thus, the group Z of integers under addition has
infinite order, whereas the group U(10) = {1; 3; 7; 9} 3.2 Example and Non-example
g under multiplication modulo 10 has order 4.
1) The dihedral group D4 = < a, ba4 = b2 = e; ab =
2.4 Order of an Element ba-1 > has order 8 = 23 and therefore is a 2-group.
2) The symmetric group S3 has order 6  pn for any
The order of an element g in a group G is the
prime p and therefore not a p-group.
smallest positive n such that gn = e. (In addition
notation, this would be ng = 0). If no such integer 3.3 Sylow p-Subgroup
exists, we say that g has infinite order. The order of an
Let G be a finite group and let p be prime such that
element g is denoted by g.
p divides G and pk+1 does not divide G, then any
k

2.5 Subgroup subgroup of G of order pk is called a Sylow

p-subgroup of G.
If a subset H of a group G is itself a group under the
operation of G, we say that H is a subgroup of G. 3.4 Examples
The notation H ≤ G is used to mean that H is a
1) Let G be a group of order 315000 = [Link].
subgroup of G. If we want to indicate that H is a
We call any subgroup of order 8 = 23, a Sylow
subgroup of G but is not equal to G itself, we write H
2-subgroup of G. Similarly, any subgroup of
< G. Such a group is called a proper subgroup.
order 625 = 54 is a Sylow 5-subgroup of G and
2.6 Cyclic Group so on.
2) Consider the symmetric group S3 = {e; (12);
A group G is called cyclic if there is an element
(13); (23); (231); (312)} with order S3 = 6 =
aG such that G = {annℤ}. Such an element a is
36 Some Applications of the First Sylow Theorem

21.31. This group has three Sylow 2-subgroups, a2, x, ax = xa3, a2x, a3x = xaD8
namely 2) The Klein 4-group (ℤ/8ℤ)* = {1, 3, 5, 7} has
(a) H1 = {e; (12)} such that H1 = 21 order 4. The prime 2(ℤ/8ℤ)* and it’s also the
(b) H2 = {e; (13)} such that H2 = 21 order of the non identity elements 3, 6, 7
(c) H3 = {e; (23)} such that H3 = 21 (ℤ/8ℤ)*
3) The dihedral group D4 has five Sylow 2-groups, Theorem 3.4. Let G be a p-group. Then the order
each generated respectively by s; 2; s; 2s; of G is a power of p.
3s. Proof. If q  p is a prime which divides G, then G
Lemma 3.1. Let A be a finite abelian group and p would have an element of order q by Cauchy’s
be prime. If pA, then A has an element of order p [4]. Theorem. This contradicts the definition of a p-group,
so we must have G = pn for some nN [6].
3.5 Examples
3.8 Example
1) Let p be prime. Then the group (ℤn, +) is cyclic
and therefore abelian if n = p. Thus (ℤp, +) is Consider the group (ℤ36, +). The order of the group
an abelian group of order p and the order of is 36 = 2232 and therefore a Sylow 2-subgroup has
every element a in (ℤp, +) is p/gcd(a, p). Thus, order 4, and a Sylow 3-subgroup has order 9.
every aℤp which is relatively prime to p has Theorem 3.5. Let p be a prime. Then every group
order p. of order p2 is abelian.
2) The prime number 5 divides the order of the Proof. If G is not cyclic, then every element for e
abelian group ℤ5 and every element in ℤ5, except 0, must have order p because the only option are 1 (the
has order five. identity), p, and p2 (not possible since G is not cyclic).
Theorem 3.2. Let G be a finite group and p be We fix aG. So < a > is a subgroup of order p, and
prime. If p G, then G has a subgroup of order p .
k k
is a proper subgroup of G. Now fix bG, with b<
a >. We have < a >  < b >= {e}, since, if there exist
3.6 Illustration
c  e with c< a >  < b >, then c generates both < a >
Suppose we have a group G such that G = 360 = and < b >. We would then have < a >=< b > which is
2 .32.51. Then the Sylow’s First Theorem says that G
3
a contradiction.
must have at least one subgroup of each of the By the First Sylow Theorem, the subgroup < a > is
following orders: 8, 9, and 5. In contrast, this theorem normal in some subgroup of G with order p2, and so <
tells us nothing about the existence of subgroups of a > is normal in G. Now < a >  < b > is a subgroup
orders 6, 10, 12, or any other divisors of G = 360 that of G, and its order must divide p2. Therefore < a >  <
has two or more distinct prime factors. b >= G. This implies we have G < a >  < b >. Since
Corollary 3.3. Let G be a finite group and let p be a < a > and < b > are abelian, then G is also abelian. We
prime that divided the order of G. have G  ℤp  ℤp [6].
Then G has an element of order p [5].
3.9 Examples
3.7 Examples
1) The Klein four-group has a representation as a
1) The Dihedral group D8 has order 8 and 22 real matrices with the matrix multiplication
D8 = < x, a: a4 = x2 = e; xax-1 = G-1 > operation:
Hence the prime 2 divides D8 and is also the order
1 0 1 0   −1 0   −1 0 
of the elements a= ,b =  ,c =  ,d =  
0 1  0 −1  0 1  0 −1
 Some Applications of the First Sylow Theorem 37

This group has order 22 = 4. Though a matrix group, with order S3 = 6 has subgroups
it is abelian. H1 = e; (12) with H1 = 2
H2 = e; (13) with H2 = 2
0 0   −1 0 
Since ab = ba =   , ac = ca =  , H3 = e; (23) with H3 = 2
 0 −1   0 1 We see that the order of each subgroup Hi divides
the order of S3.
0 0   −1 0 
ad = da =   , bc = cb =   , cd = dc =
 0 −1   0 −1  4. Conclusion
In this paper, a numerical illustration of some
1 0   −1 0 
  , and bd = db =  . applications of the first Sylow theorem was given.
 0 −1   0 1 These numerical applications shows that if p is prime
2) For every prime p, there are (up to and pk divides the order of a finite group G, then G has
isomorphism) exactly two groups of order p2, a subgroup of order pk.
namely, ℤ𝑝2 and ℤpℤp. Specifically, we can
References
say ℤ2ℤ2 has order 22 = 4 and is abelian.
Theorem 3.6. Let G be a finite group, and H any [1] Joseph A. Gallian (2015). “Contemporary Abstract Algebra
(9th ed.)”. Printed in the United States of America.
subgroup of G. The order of G is a multiple of the
[2] Kaplansky, I. (1972). “Fields and Rings”. University of
order of H. Thus the order of H divides the order of G. Chicago Press, Chicago.
Proof. Suppose that G has order n and that H has [3] Kwasi Baah Gyam (2021). “Abraham Aidoo, and
order m. We prove that m divides n. Since the cosets Emmanuel Akweittey: Some Applications of Lagranges
Theorem in Group Theory Using Numerical Examples”.
of H partition G, each element of G lies in exactly one
World Wide Journal of Multidisciplinary Research and
coset. Let the number of distinct cosets be k. Each Development 7: 32-34.
coset has exactly m elements, the same number as H. [4] Walker, E. A. (1987). “Introduction to Abstract Algebra”.
Thus, as each of the k cosets has m elements, there are Random House, New York.
[5] Pollard, H., and Diamond, H. G. (2010). “Theory of
km elements in all. Therefore, n = km, and m divides n
Algebraic Numbers”. Dover, Mineola, NY.
[7]. [6] Fraleigh, J. B. (2003). “A First Course in Abstract Algebra.
Pearson”. Upper Saddle River, NJ.
3.10 Example [7] Dean, R. A. (1966). “Elements of Abstract Algebra.” Wiley,
New York.
The symmetric group
{S3 = e, (12), (13), (23), (231), (312)}