Professional Documents
Culture Documents
1
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
Example 6: Example 9:
G {1, i, j, k} Show that G {0, 1, 2, 3 , 4} is agroup of non-zero
where i. j k ; j.k i; k.i j residue class of modulo 5.
j.i k ; k. j i; i.k j Solution:
i j k 1
2 2 2
. 0 1 2 3 4
Solution: 0 0 1 2 3 4
All the properties of the group is satisfied, So, G is
1 1 2 3 4 0
the group under multiplication. But not abelion group
because, 2 2 3 4 0 1
j.i k i. j 3 3 4 0 1 2
k. j i j.k 4 4 0 1 2 3
i.k j k.i
i). G is closed under addition.
Example 7: ii). Associative law holds, for all 2, 3, 4 G
A22 {Set of all 2 2 non - singular real matrices}
2 ( 3 4) 2 2 4
under the usual multiplication is a group. e.g.,
( 2 3) 4 0 4 4
1 0 1 2 iii). Identity of every element of G is exist.
A &B iv). Inverse of every element of G exist.
2 1 0 1 Inverse of 0̅ is 0̅
are group under multiplication because A & B have Inverse of 1̅ is 4̅
their inverses(Non-singular). Inverse of 2̅ is 3̅.
But not abelion because,
Inverse of 3̅ is 2̅.
AB BA
Inverse of 4̅ is 1̅.
Example 8: Hence all the properties of group satisfied. So, G is
Show that G {1, 2, 3 , 4} is agroup of non-zero group under addition or (G,) .
residue class of modulo 5. Properties of group:
Solution: Theorem 2: (Cancellation laws)
. 1 2 3 4 For any element a, b, c in a group G.
1 1 2 3 4 i): ab ac b c (Left cancellation law)
2 2 4 1 3 ii): ba ca b c (Right cancellation law)
3 3 1 4 2 Proof:
For all a, b, c G
4 4 3 2 1
i): ab ac
i). G is closed under multiplication.
multiplying both sides by a 1 .
ii). Associative law holds, for all 2, 3, 4 G
a 1.(a.b) a 1.(a.c)
2.( 3 .4) 2.2 4
(a 1 .a).b ( a 1 .a).c (By associative law)
( 2. 3).4 1 .4 4 e.b e.c
iii). Identity of every element of G is exist. bc
iv). Inverse of every element of G exist. Hence proved.
Inverse of 1̅ is 1̅ ii): ba ca
Inverse of 2̅ is 3̅.
Inverse of 3̅ is 2̅. multiplying both sides by a 1 on right side .
Inverse of 4̅ is 4̅. (b.a).a 1 (c.a).a 1
Hence all the properties of group satisfied. So, G is b.(a.a 1 ) c.(a.a 1 ) (By associative law)
group under multiplication or (G,.) . b.e c.e
bc
Hence proved.
2
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
3
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
So, true. let, n p,
Case IV. (a m ) p ((a m ) 1 ) p
for m 0 & n 0 m n 0,
(a m ) p (a m ) p by (i)
and m n 0,
So, true.
a mn .a m a mnm a n (1) Case III.
a mn a mn .e for n 0,
a mn a mn .(a n .a n ) (a m ) 0 e a 0 a m ( 0 )
a mn a mn .(a mn .a m ).a n Hence, (a m ) n a mn m, n Z .
by (1), Order of a group:
a mn (a mn .a mn ).a m .a n The number of element in a group G is called order
a mn e.a m .a n of G. Which is denoted by | G | .
a mn a m .a n Note:
So, true. (i). A Group G is said to be finite if G is consist of
Case V. finite number of elements.
for m 0 & n 0 m n ? 0, (ii). A Group G is said to be infinite if G is consist of
infinite number of elements.
a m .a n a m .a 1.a 1.a 1...a 1 (n factor
Order of elements of group:
by (i), Let (G,) be a group and a G if there exist
a mn a mn .e
smallest positive integer n such that, a n e . Then n
a mn a mn .(a n .a n ) is called order of element n in G.
a mn a mn .(a mn .a m ).a n Theorem 6:
by (1), Let G be a group. Let a G have order n then for
a mn (a mn .a mn ).a m .a n any integer k , a k e iff k qn , where k is
a mn e.a m .a n any integer.
a mn a m .a n Proof:
So, true. Suppose that a G and order of a is n then,
Hence proved for all values of m, n Z , so, an e
a mn a m .a n . Now, by division algorithm,
iv). (a m ) n a mn k qn r; 0 r n (1)
Case I. we have to prove by induction method, Where r and q are any integers,
for n 1, as given,
(a m )1 a m m Z a k e; k Z
true for n 1, From (1),
now, for n k , a k a qnr
a k (a n ) q .a r
(a m ) k a mk
since order of a is n, so,
also true for n k ,
now for n k 1, e (e) q .a r
Hence,
(a m ) k 1 a mk m
ar e
(a m ) k 1 a ( mk ) .a1 Proved.
(a m ) k 1 a m( k 1) Conversely, suppose that k qn then we have to
Also true for n k 1, Hence true for all values of prove that order of a is k ,
n Z . k qn
So, (a m ) n a mn . a k a qn (a n ) q
Case II. since order of a is n, so,
for n 0, a k eq e
4
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
5
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
6
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
7
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
a m (a k ) q .a r xy yx
Hence, G is abelion cyclic group.
(a k ) q .a m .a r H ; r k
Which is contradiction because r 0.
Example 21:
If G is cyclic group of even order then prove that
Then,
there is only one subgroup of order 2 in G.
m qk
Proof:
a m (a k ) q Let, G be a cyclic group of even order such that,
Hence, H is cyclic. G a; a 2n e
Theorem 12: 2n show that the order of G is even.
Let G be a cyclic group of order n generated by a. (By using the theorem "If a positive integer d divides
Then for each positive divisor d of n, there is unique the order of G (|G|) then G has exactly one subgroup
subgroup (of G) of order d. of order d.")
Proof: Now,
Let, G a; a n e | G | 2n
Let d is the positive divisor of n then there is integer where 2 divides 2n. So, G has only one subgroup of
q such that, order 2.
n dq Example 22:
consider, Find all subgroups of a cyclic subgroup of order 12.
b aq Proof:
b d a dq The divisor of 12 are,
bd a n 1,2,3,4,6,12.
bd e subgroup of order 1 {e}
So, subgroup of order 12 G itself.
H b; b d e subgroup of order 2 (a 6 ) 2 {a 6 , a12 e}
is required subgroup. subgroup of order 3 (a 4 ) 3 {a 4 , a 8 , a12 e}
To show that H is unique suppose that K is another
subgroup of order 4 (a 3 ) 4 {a 3 , a 6 , a 9 , a12 e}
subgroup of G of order then K is generated by single
subgroup of order
element c a k . Where k is least positive integer.
6 (a ) {a , a , a , a , a , a e}
2 6 2 4 6 8 10 12
c ak
c d a dq Cosets:
cd an
Let H be the subgroup of G and a G . Then the set,
aH {ah; h H } Left coset
cd e
Ha {ha; h H } Right coset
where, dk n k dn q,
is said to coset of H in G.
Hence,
Note: The left or right cosets of H in G with identity
b aq ak c element is H itself.
bc
eH eh;h H H
So, H is unique.
Theorem 13: He he;h H H
Every cyclic group is abelion. If the binary operation is “+” then the coset can be
Proof: written as,
Let G be a cyclic group generated by a single element a H {a h; h H }
a. Example 23:
Let, x, y G, then there is positive integers m and G {0, 1, 2, 3, 4, 5} be the group of residue classes
k such that, modolu 6. Then, H {0, 2, 4} is subgroup G. There
x ak ; y am are only two left cosets of H in Gand these are
xy a k .a m 0 H H and 1 H {1, 3, 5}.
xy a k m a mk
xy a m .a k
8
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
9
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
10
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
11
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
Hence,
12
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
infinitely many ways. (By the above theorem). So, A permutation is called odd if it can be expressed
any element of S n can be expressed as a product of as a product of odd number of transpositions.
transposition in infinitely many ways. e.g.
Theorem 20: 1 2 3 4
Let a permutation in S n be written as a product 2 1 4 3
of m transpositions and as a product of p 1 23 4
transpositions. Then m-p is a multiple of 2. This Shows that even permutations.
implies that both m and p are even or both of them Similarly,
are odd. 1 2 3 4
OR
Let be the permutation as a product of 2 3 4 1
transposition, m p ( mod 2 ). 1 2 3 4
Proof: shows odd permutation.
Suppose the product of transpositions, Theorem 21:
n i). The product of even or odd permutations is an
p ( xi x j ) even permutations.
i j
13
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
1 , 2 ,.., m (2) n I.
are odd permutations in S n , So, k m n! . e.g.
Let be the transposition. then, S 3 {I , a, a 2 , b, ab, a 2 b}
1 , 2 ,.., k (3) where,
are all odd. (By corollary) 1 2 3 1 2 3 2 1 2 3
I ; a ; a
1 , 2 ,.., k (4) 1 2 3 2 3 1 3 1 2
are all even. 1 2 3
From (1) and (4), a 3 I
1 2 3
mk
Hence, order of S 3 is 3.
From (2) and (3),
km a b
Let,
So, m k n2! is required proof. b a
Note: a b
2 I
All even permutation in S n are denoted by An . From a b
the above theorem the number of element in An are So, the order of transposition is 2.
n!
2 . Theorem 24:
Theorem 23: The order of cyclic permutation of length m is m.
The set An of all even permutation in S n forms a Proof:
Suppose,
subgroup of S n .
(a1 , a2 ,.., am )
Proof: be a cyclic permutation of length m. Then under the
Suppose, 1 , 2 An then we have to prove that, action,
1 21 An (1) 2 : a1 a2 , a2 a4 ,.., am a2
By the theorem (if 1 2 is in even permutations) 3 : a1 a3 , a2 a5 ,.., am a3
Since, the inverse of transposition also transposition. .......................................................
Then the inverse of even transposition is even m : a1 a1 , a2 a2 ,.., am am
transposition. So, (1) satisfied and An is subgroup in So, that,
Sn . m I
Example 30: also for no-smaller power of k of ,
Find all the subgroups of S 3 . k I
Hence, order of is m.
Solution:
As we know that, Note:
S 3 {I , a, a 2 , b, ab, a 2 b} i). To find the order of permutation, convert into
cyclic permutation, 1 , 2 ,..., k of length
where,
1 2 3 1 2 3 2 1 2 3 m1 , m2 ,.., mk respectively. Ignore the cycle of length
I ; a ; a
2
1.
1 2 3 2 3 1 3 1 ii). The order of can be find by taking least
1 2 3 1 2 3 2 1 2 3 common multiple (L.C.M) of lengths of cycle.
b ; ab ; a b
1 3 2 3 2 1 2 1 3 Example 31:
Here, a b (ab) I
3 2 2 Find the order of
1 2 3 4 5 6 7 8 9 10 11 12
So, the subgroups of S 3 are,
{I },{I , a, a 2 },{I , b},{I , ab},{I , a 2 b} and S 3 . 2 3 4 1 7 9 6 5 8 12 11 10
1 2 3 45 7 6 9 810 12
Order of permutation:
Let be the permutation in S n then the order of Cycles 1 , 2 and 3 have length 4,5 and 2.
is at least positive integer n such that, L.C.M=20
So, 20 I
14
Group theory By: Muhammad Fiaz Hussain
Applied & Analytic Mathematics Research Center fiaz.hussain24@yahoo.com
1
M.sc, M.Phil. in Applied & Analytic Mathematics
Comsats Institute of Information Technology Islamabad.
15