lTHE UNIVERSITY OF MATHEMATICS

Semester – V
Group Theory II (Paper – XII)

➢ Normal Subgroup: If G be a group and H be a subgroup of G then H is said to be normal subgroup of G if

𝑥ℎ𝑥 −1 ∈ 𝐻 ∀ 𝑥 ∈ 𝐺, ℎ ∈ 𝐻

Note: 𝑥𝐻𝑥 −1 ⊆ 𝐻

➢ To prove that a subgroup H of a group G to be a normal subgroup of and only iff 𝒙𝑯𝒙−𝟏 = 𝑯

Proof: let us suppose G be a group and H be the subgroup of G

Case (i) let 𝑥𝐻𝑥 −1 = 𝐻

Then we have to show that H is a normal subgroup of G

For this, since 𝑥𝐻𝑥 −1 ⊂ 𝐻

⇒ 𝑥𝐻𝑥 −1 ⊆ 𝐻 ∀𝑥 ∈𝐺

Hence, by the definition H be a normal subgroup

Case (ii) let H be a normal subgroup then

We have to show that

1
 𝑥𝐻𝑥 −1 = 𝐻

For this,

Since H is a normal subgroup

⇒ 𝑥𝐻𝑥 −1 ⊆ 𝐻 ------------------(i)

And G be a group

So if 𝑥 ∈ 𝐺 ⇒ 𝑥 −1 ∈ 𝐺

⇒ 𝑥 −1 𝐻(𝑥 −1 )−1 ⊆ 𝐻

⇒ 𝑥 −1 𝐻𝑥 ⊆ 𝐻

Taking pre x and post 𝑥 −1 we have

(𝑥𝑥 −1 )𝐻(𝑥𝑥 −1 ) ⊆ 𝑥𝐻𝑥 −1 by associative

⇒ 𝑒𝐻𝑒 ⊆ 𝑥𝐻𝑥 −1

⇒ 𝐻 ⊆ 𝑥𝐻𝑥 −1 --------------------(ii)

Hence from equation (i) and (ii), we get

𝑥𝐻𝑥 −1 = 𝐻 Proved

2
➢ To prove that the intersection of two normal subgroup is also a normal subgroup of G

Proof: let us suppose 𝐻1 𝑎𝑛𝑑 𝐻2 are two normal subgroup of the group G

Then we have to show that

𝐻1 ∩ 𝐻2 is also a normal subgroup of G

For this,

Since 𝐻1 𝑎𝑛𝑑 𝐻2 are two normal subgroup of G

i.e., subgroup of G

Then 𝐻1 ∩ 𝐻2 be also a subgroup of G

Again let ℎ ∈ 𝐻1 ∩ 𝐻2 and 𝑥 ∈ 𝐺 be the arbitrary element

⇒ ℎ ∈ 𝐻1 𝑎𝑛𝑑 ℎ ∈ 𝐻1 , 𝑥∈𝐺

⇒ 𝑥ℎ𝑥 −1 ∈ 𝐻1 𝑎𝑛𝑑 𝑥ℎ𝑥 −1 ∈ 𝐻2

⇒ 𝑥ℎ𝑥 −1 ∈ 𝐻1 ∩ 𝐻2

Hence, by the definition of normal subgroup 𝐻1 ∩ 𝐻2 is also a normal subgroup of G Proved

3
➢ A subgroup H of a group G is a normal subgroup of G if and only if each left cosets of H in a G is a right cosets of H in G

Proof: let us suppose G be a group and H is a subgroup of G

Case (i) let H is a normal subgroup of G

Then 𝑥𝐻𝑥 −1 = 𝐻

Taking post x

xH = Hx

Hence, each left cosets of H is a right cosets of H

Hence, proved the first case

Case (ii) let each cosets of H is a right cosets of H in G

So if 𝑥 ∈ 𝐺 be an arbitrary element then

𝑥𝐻 = 𝐻𝑦 {for some 𝑦 ∈ 𝐺} ---------------(i)

Again by the property of cosets, we have

𝑥 ∈ 𝑥𝐻

⇒ 𝑥 ∈ 𝐻𝑦 {⸪ xH = Hy}

But if 𝑥 ∈ 𝐻𝑦

⇒ 𝐻𝑦 = 𝐻𝑥

4
 ⇒ 𝑥𝐻 = 𝐻𝑥 ; from (i)

Taking post 𝑥 −1

⇒ 𝑥𝐻𝑥 −1 = (𝐻𝑥)𝑥 −1

⇒ 𝑥𝐻𝑥 −1 = 𝐻(𝑥𝑥 −1 ) by associative law

⇒ 𝑥𝐻𝑥 −1 = 𝐻𝑒

⇒ 𝑥𝐻𝑥 −1 = 𝐻

Hence by the definition H is a normal subgroup of G Proved

➢ A subgroup H of a group G is a normal subgroup of G iff the product of two right cosets in G is again a right cosets in G

Proof: let us suppose G be a group and H be a subgroup of G

Case (ii) let H be a normal subgroup of G

And 𝑎, 𝑏 ∈ 𝐺 be the arbitrary elements

Then Ha, Hb be the right cosets of H in G

Then we have to show that their product is also a right of H in G

For this,

Ha.Hb = H(aH).b ; by associative law

Ha.Hb = H.(Ha).b ; ⸪ aH = Ha

5
 Ha.Hb = H.Hab

Ha.Hb = Hab ; ⸪ HH = H

Ha.Hb = Hd ; let ab = d

This shows that the product two cosets of H in G is also a right cosets of H in G

Case (ii) let us suppose product of two right cosets of H in G is again a right coset of H in G

So, let 𝑥 ∈ 𝐺 ⇒ 𝑥 −1 ∈ 𝐺

Here 𝐻𝑥, 𝐻𝑥 −1 be the right cosets of H in G

So, by our supposition 𝐻𝑥 . 𝐻𝑥 −1 is also a right coset.

Again, we have

𝑒∈𝐻

Then 𝑒𝑥𝑒𝑥 −1 ∈ 𝐻𝑥𝐻𝑥 −1

⇒ 𝑒 ∈ 𝐻𝑥𝐻𝑥 −1

⇒ 𝐻𝑥𝐻𝑥 −1 = 𝐻𝑒 = 𝐻 by the property of coset

⇒ 𝐻𝑥𝐻𝑥 −1 = 𝐻 ∀𝑥 ∈𝐺

Here if ℎ1 , ℎ ∈ 𝐻

Then, we have

6
 ℎ1 𝑥ℎ𝑥 −1 ∈ 𝐻𝑥𝐻𝑥 −1 = 𝐻

⇒ ℎ1 𝑥ℎ𝑥 −1 ∈ 𝐻

Taking pre ℎ1 −1

⇒ 𝑥ℎ𝑥 −1 ∈ ℎ1 −1 𝐻

⇒ 𝑥ℎ𝑥 −1 ∈ 𝐻 ; ⸪ ℎ1 −1 𝐻 = 𝐻

Hence by the definition H be a normal subgroup of G Proved

➢ Conjugate element

If G be a group and 𝑎, 𝑏 ∈ 𝐺 be the arbitrary element then b is said to conjugate to a if there exist an element 𝑥 ∈ 𝐺 such that b = 𝑥 −1 𝑎𝑥
It is denoted by 𝑏~𝑎

➢ Define normalizer of an element in a group

If G be a group and 𝑎 ∈ 𝐺 be an arbitrary element then normalizer of a is the collection of those elements of G which are commute with a. it is
generally denoted by N(a)

Symbolically N(a) = {𝑥 ∈ ℎ ∶ 𝑎𝑥 = 𝑥𝑎}

➢ To prove that the normalizer is a subgroup of G

Proof: let us suppose that G be a group and 𝑎 ∈ 𝐺 be an arbitrary element

Also N(a) be the normalizer of a in G

Then we have to show that N(a) is a subgroup of G

7
For this,

Let 𝑥1 , 𝑥2 ∈ 𝑁(𝑎) be the arbitrary elements

Then by the definition of normalizer, we have

𝑎𝑥1 = 𝑥1 𝑎 ----------------(i)

𝑎𝑥2 = 𝑥2 𝑎 ----------------(ii)

Taking pre and post 𝑥2−1 in (ii)

𝑥2−1 (𝑎𝑥2 )𝑥2−1 = 𝑥2−1 (𝑥2 𝑎)𝑥2−1

(𝑥2−1 𝑎)(𝑥2 𝑥2−1 ) = (𝑥2−1 𝑥2 )(𝑎𝑥2−1 ) by associative

(𝑥2−1 𝑎)𝑒 = 𝑒(𝑎𝑥2−1 )

(𝑥2−1 𝑎) = (𝑎𝑥2−1 )

𝑎𝑥2−1 = 𝑥2−1 𝑎 ------------------(iii)

𝑥2−1 ∈ 𝑁(𝑎) {since 𝑥2−1 is commute with a}

Now (𝑥1 𝑥2−1 )𝑎 = 𝑥1 (𝑥2−1 𝑎)

= 𝑥1 (𝑎𝑥2−1 ) ; from (iii)

= (𝑥1 𝑎)𝑥2−1 ; by associative

= (𝑎𝑥1 )𝑥2−1 ; from (i)

8
 ⸫ (𝑥1 𝑥2−1 )𝑎 = 𝑎(𝑥1 𝑥2−1 ) ; by associative

Hence 𝑥1 𝑥2−1 ∈ 𝑁(𝑎)

Thus by the necessary and sufficient condition

N(a) is a subgroup of G Proved

➢ Define centre of a group

If G be a group then the centre of group G is the set of those elements of G which are self conjugate. It is denoted by Z

i.e., if 𝑎 ∈ 𝑧 be an arbitrary element

then, 𝑎 = 𝑥 −1 𝑎𝑥 ∀ 𝑥 ∈ 𝐺

➢ If 𝒂 ∈ 𝒛 iff N(a) = G again if G is finite 𝒂 ∈ 𝒛 iff o{N(a)} = o(G)

Proof: let us suppose G be a group and z be the centre of group G

Now if 𝑎 ∈ 𝑧

⇒ 𝑎 = 𝑎𝑥 −1 𝑥 ∀𝑥 ∈𝐺

⇒ 𝑥𝑎 = 𝑎𝑥 -------------------(i) taking pre x on both side

Also by the definition of normalizer

𝑥 ∈ 𝑁(𝑎) ⇔ 𝑥𝑎 = 𝑎𝑥 -------------------(ii)

So 𝑥 ∈ 𝑁(𝑎)

Now ⸪ N(a) ⊆ G -------------------(iii)

9
 ⇒𝑥∈𝐺

Also 𝑥 ∈ 𝑁(𝑎)

⇒ 𝐺 ⊆ 𝑁(𝑎) -------------------(iv)

Hence from (iii) and (iv)

G = N(a) -------------------(v)

Again, let G be a finite group so, from (v)

o{N(a)} = o(G) Proved

➢ Quotient set and quotient group

If G be a group and H be a normal subgroup of G then the collections of all the possible right or left cosets of H in G is said to be quotient set
and denoted by G/H

Again, if G/H is a group itself then it is said to be quotient group.

➢ Homomorphism

If (G, o) and (G’, o’) are two group then a function f defined from G to G’ is said to be homomorphism if

𝑓(𝑎𝑜𝑏) = 𝑓(𝑎)𝑜 ′ 𝑓(𝑏) ∀ 𝑎, 𝑏 ∈ 𝐺

It is also written as

f(ab) = f(a).f(b)

Again, the homomorphism is said to be onto and into according as f is onto or into.

10
➢ Indomorphism

If the homomorphism f defined from the group G to G itself then f is said to be indomorphism.

➢ Isomorphism

If (G, o) and (G’, o’) are two group then a function f defined from G to G’ is said to be isomorphism if f is one-one and satisfy the condition
f(aob) = f(a) o’ f(b) ∀ 𝑎, 𝑏 ∈ 𝐺

➢ Automorphism

If (G, o) and (G’, o’) are two groups then a function f defined from G to G itself is said to be automorphism if

I. f is one-one and onto

II. f(aob) = f(a) o’ f(b) ∀ 𝑎, 𝑏 ∈ 𝐺

Kernel – If (G, o) and (G’, o’) are two groups and f is a function defined from G to G’ then the kernel of f is the set of those elements of G which
are associate with identify element of G’
f
G G’

a
a’
b
b’
c
d e’

11
➢ Show that the function f defined from 𝑰 → 𝑰 by 𝒇(𝒙) = −𝒙 ∀ 𝒙 ∈ 𝑰 is the automorphism of the additive group of integers.

Proof: let us suppose |I be the set of integers taken as

𝐼 = {−∞, … … … − 2, −1, 0, 1, 2, … … … ∞}

Then (I, +) be a group

Again f be a function defined from

𝐼 → 𝐼 by 𝑓(𝑥) = −𝑥 ∀𝑥 ∈𝐼

Then we have to show that f is an automorphism

So, for one-one

Let us suppose 𝑥, 𝑦 ∈ 𝐼 be the arbitrary elements for which

𝑓(𝑥) = 𝑓(𝑦)

⇒ −𝑥 = −𝑦

⇒𝑥=𝑦 taking -ve sign on both sides

Hence f is one-one

Again for onto

Since a positive integer with –ve sign is a negative integer which is the image of +ve integer according to the function.

So, f is onto

12
 Again, let 𝑥, 𝑦 ∈ 𝐼 be the arbitrary elements

Then, we have

𝑓(𝑥 + 𝑦) = −(𝑥 + 𝑦) {⸪ f(x) = - x}

⇒ 𝑓(𝑥 + 𝑦) = −𝑥 − 𝑦

⇒ 𝑓(𝑥 + 𝑦) = (−𝑥) + (−𝑦)

⸫ 𝑓(𝑥 + 𝑦) = 𝑓(𝑥) + 𝑓(𝑦) ∀ 𝑥, 𝑦 ∈ 𝐼

Thus, all the conditions are satisfied for automorphism so f is an automorphism. Proved

➢ To show that a function f define on a group G by 𝒇: 𝒂 → 𝒂−𝟏 ∀ 𝒂 ∈ 𝑮 i.e., 𝒂 → 𝒂−𝟏 is an automorphism iff G is abelian.

Proof: let us suppose G be a group and f be a function defined on G by

𝑓: 𝑎 → 𝑎−1 ∀ 𝑎 ∈ 𝐺

Then we have to show that f is an automorphism iff G is abelian group.

Case(i) let G is an abelian group then we have to show that f is an automorphism

So, foe one-one

Let 𝑥, 𝑦 ∈ 𝐺 be the arbitrary elements for which

𝑓(𝑥) = 𝑓𝑦)

⇒ 𝑥 −1 = 𝑦 −1

13
 ⇒ (𝑥 −1 )−1 = (𝑦 −1 )−1 taking inverse on both side

⇒𝑥=𝑦

So, f is one-one

Again, for onto

Let 𝑥 ∈ 𝐺 be an arbitrary element

⇒ 𝑥 −1 ∈ 𝐺 {by inverse law}

Then we have

𝑓(𝑥 −1 ) = (𝑥 −1 )−1 = 𝑥

i.e., f is onto

At last we have

𝑓(xy) = (xy)−1 = 𝑦 −1 𝑥 −1

⇒ 𝑓(𝑥𝑦) = 𝑦 −1 𝑥 −1

⇒ 𝑓(𝑥𝑦) = 𝑥 −1 𝑦 −1 {⸪ G is abelian}

⇒ 𝑓(𝑥𝑦) = f(x). f(y)

Hence all the conditions of automorphism for f are satisfied so f is an automorphism.

Case(ii) let f is an automorphism then we have to show G is abelian.

14
 For this, we have for every 𝑥, 𝑦 ∈ 𝐺

𝑓(𝑥𝑦) = (𝑥𝑦)−1

⇒ 𝑓(𝑥𝑦) = 𝑦 −1 𝑥 −1

⇒ 𝑓(𝑥𝑦) = f(y). f(x)

⇒ (𝑥𝑦) = 𝑦(𝑥)

Which satisfies the commutative law.

Hence G be an abelian group. Proved

➢ To prove that the set of all automorphism of a group forms a group with respect to composite of function as composition.

Proof: let us suppose G be a group and A(G) be the collections of all automorphism defined on G.

Then we have to show that A(G) be a group with respect composite of function as composition.
For this, let f and g are two arbitrary elements of A(G) then we have by the definition f and g both be one-one and onto.
Therefore, ‘gf’ is also one-one onto
Again,
(gf)(ab) = g{f(ab)}

= g{f(a).f(b)} {⸪ f is an automorphism}

(gf)(ab) g{f(a).g{f(b)} {⸪ g is an automorphism}

⇒ 𝑔𝑓 ∈ 𝐴(𝐺)

15
Hence closure law is satisfied.
Similarly associative law is also satisfied.
Again, for identity law
We have identity function ‘i’ defined
From G to G is always one-one and onto.
Also we have
i(ab) = ab

⇒ 𝑖(𝑎𝑏) = 𝑖(𝑎)𝑖(𝑏) {⸪ i(a) = a}

⇒ 𝑖 ∈ 𝐴(𝐺)
Hence i is also an automorphism.
At last for inverse law
We have f is defined and one-one & onto.
So, 𝑓 −1 must be defined also one-one & onto.
Let 𝑓 −1 (𝑎) = a′, 𝑓 −1 (𝑏) = b′
⇒ 𝑎 = 𝑓(𝑎′ ), 𝑏 = 𝑓(𝑏 ′ )

Now 𝑓 −1 (𝑎𝑏) = 𝑓 −1 {𝑓(𝑎′ ). 𝑓(𝑏 ′ )}

⇒ 𝑓 −1 (𝑎𝑏) = 𝑓 −1 {𝑓(𝑎′ )}. 𝑓 −1 {𝑓(𝑏 ′ )}

⇒ 𝑓 −1 (𝑎𝑏) = 𝑎′𝑏′

⸫ 𝑓 −1 (𝑎𝑏) = 𝑓 −1 (𝑎)𝑓 −1 (𝑏)

⇒ 𝑓 −1 ∈ 𝐴(𝐺)

16
 Hence inverse law is also satisfied
Thus all the condition of group are satisfied
So A(G) be a group with respect to composite of function as composition. Proved

➢ If ‘a’ be a fixed point of G then the mapping 𝒇𝒂 : 𝑮 → 𝑮 by 𝒇𝒏 (𝒙) = 𝒂−𝟏 𝒙𝒂 ∀ 𝒙 ∈ 𝑮 is an automorphism in a group G.

Proof: let us suppose G be a group and ‘a’ be a fixed point of G

Also 𝑓𝑎 is a function defined on G by

𝑓𝑎 (𝑥) = 𝑎−1 𝑥𝑎 ∀𝑥 ∈𝐺

Then we have to show that 𝑓𝑎 is an automorphism.

So for one-one

Let 𝑥, 𝑦 ∈ 𝐺 are two arbitrary elements

For which

𝑓𝑎 (𝑥) = 𝑓𝑎 (𝑦)

⇒ 𝑎−1 𝑥𝑎 = 𝑎−1 𝑦𝑎

⇒ 𝑥=𝑦 {by cancellation law}

Hence 𝑓𝑎 is one-one

Again for onto

17
 Let 𝑦 ∈ 𝐺 be a arbitrary element

Then 𝑎𝑦𝑎−1 ∈ 𝐺

Now 𝑓𝑎 (𝑎𝑦𝑎−1 ) = 𝑎−1 (𝑎𝑦𝑎−1 )𝑎

𝑓𝑎 (𝑎𝑦𝑎−1 ) = (𝑎−1 𝑎)𝑦(𝑎−1 𝑎) {by associative}

𝑓𝑎 (𝑎𝑦𝑎−1 ) = 𝑒𝑦𝑒

𝑓𝑎 (𝑎𝑦𝑎−1 ) = 𝑦

Hence 𝑓𝑎 is onto

At last we have 𝑥, 𝑦 ∈ 𝐺 be the arbitrary element

Then 𝑓𝑎 (𝑥𝑦) = 𝑎−1 (𝑥𝑦)𝑎

= 𝑎−1 𝑥𝑎𝑎−1 𝑦𝑎 {⸪ 𝑎𝑎−1 = 𝑒}

= (𝑎−1 𝑥𝑎)(𝑎−1 𝑦𝑎)

𝑓𝑎 (𝑥𝑦) = 𝑓𝑎 (𝑥)𝑓𝑎 (𝑦) ∀ 𝑥, 𝑦 ∈ 𝐺

Thus all the conditions of 𝑓𝑎 for automorphism are satisfied.

So 𝑓𝑎 is an automorphism. Proved

➢ Inner – Automorphism

If G be a group then an automorphism defined by 𝑓𝑎 (𝑥) = 𝑎−1 𝑥𝑎 ∀ 𝑥 ∈ 𝐺

where a is fixed point of G is said to be inner automorphism.

18
➢ Noe-trivial and trivial of an automorphism

An inner automorphism 𝑓𝑎 defined on a group G is said to be non-trivial of an automorphism if 𝑓𝑎 is not an identity function.
Again if 𝑓𝑎 become an identity function then it must be trivial automorphism.

➢ For an abelian group the only inner automorphism is the identity mapping where as for non-abelian group there exist non-trivial
automorphism.

Proof: let us suppose G be a group and 𝑓𝑎 is an inner automorphism defined on G

Case(i) let G be an abelian group for this let 𝑥 ∈ 𝐺 be an arbitrary element then

𝑓𝑎 (𝑥) = 𝑎−1 𝑥𝑎

= 𝑎−1 𝑎𝑥 ; since G is abelian

= ex

𝑓𝑎 (𝑥) = 𝑥

This shows that 𝑓𝑎 is an identity function.

So, 𝑓𝑎 is trivial automorphism.

Case(ii) let G is non-abelian

Then if 𝑎, 𝑏 ∈ 𝐺

𝑎𝑏 ≠ 𝑏𝑒

𝑎𝑏𝑎−1 ≠ 𝑏𝑎𝑎−1

19
 𝑎𝑏𝑎−1 ≠ 𝑏𝑒

𝑎𝑏𝑎−1 ≠ 𝑏

𝑓𝑎 (𝑏) ≠ 𝑏

Hence 𝑓𝑎 is non-trivial automorphism. Proved

➢ To prove that the set I(G) of all inner automorphism of a group G is normal subgroup of the group of its automorphism.

Proof: let us suppose G be a group and A(G) be the set of all automorphism defined on G.

Also I(G) be the set of all inner automorphism defined on G.

Then we have to show that I(G) be the normal subgroup of A(G).

For this, we have

𝐼(𝐺) ⊆ 𝐴(𝐺)

Now, at first we want to show that I(G) be the subgroup of A(G)

For this we need to show that

(i) 𝑓𝑎 −1 exist and belongs to I(G)

(ii) 𝑓𝑎 is also defined and belong to I(G)

Now for (i) let 𝑎 ∈ 𝐺 then 𝑎−1 ∈ 𝐺

𝑓𝑎 , 𝑓𝑎 −1 ∈ 𝐼(𝐺)

Now, for 𝑥 ∈ 𝐺, we have

20
𝑓𝑎 𝑓𝑎 −1 (𝑥) = 𝑓𝑎 , {𝑓𝑎 −1 (𝑥)}

= 𝑓𝑎 {(𝑎−1 )−1 𝑥𝑎−1 }

= 𝑓𝑎 {𝑎𝑥𝑎−1 }

= 𝑎−1 (𝑥𝑎−1 )𝑎

= (𝑎−1 𝑎)𝑥(𝑎𝑎−1 )

= e𝑥e

=𝑥

𝑓𝑎 𝑓𝑎 −1 (𝑥) =𝑥

This shows that 𝑓𝑎 𝑓𝑎 −1 is an identity function

So 𝑓𝑎 −1 = (𝑓𝑎 )−1

Now for (ii)

We want to find the composition of two inner automorphism for 𝑥 ∈ 𝐺

⸫ 𝑓𝑎 𝑓𝑏 (𝑥) = 𝑓𝑎 {𝑓𝑏 (𝑥)}

= 𝑓𝑎 {𝑏−1 𝑥𝑏}

= 𝑎−1 {𝑏 −1 𝑥𝑏}𝑎

21
 = 𝑎−1 𝑏−1 𝑥𝑏𝑎

= (𝑏𝑎)−1 𝑥𝑏𝑎

= 𝑐 −1 𝑥𝑐 ; since c = ba

= 𝑓𝑐 (𝑥)

𝑓𝑎 𝑓𝑏 (𝑥) = 𝑓𝑐 (𝑥)

⇒ 𝑓𝑎 𝑓𝑏 ∈ 𝐼(𝐺)

Again we have

𝑓𝑎 𝑓𝑏 −1 = 𝑓𝑎 𝑓𝑏 −1 ; since 𝑓𝑏 −1 = 𝑓𝑏 −1

= 𝑓𝑏−1 𝑎

= 𝑓𝑑 ; let 𝑏 −1 𝑎 = 𝑑

𝑓𝑎 𝑓𝑏 −1 ∈ 𝐼(𝐺)

Hence by the necessary and sufficient condition of subgroup

I(G) be the subgroup of A(G)

Again for normal subgroup we have

(𝑓𝑓𝑎 𝑓 −1 )𝑥 = 𝑓𝑓𝑎 {𝑓 −1 (𝑥)}

= 𝑓{𝑎−1 𝑓 −1 (𝑥)𝑎}

22
 = 𝑓(𝑎−1 )𝑓𝑓 −1 (𝑥)𝑓(𝑎)

−1
= (𝑓(𝑎)) 𝑥𝑓(𝑎)

= 𝑐 −1 𝑥𝑐

= 𝑓𝑐 (𝑥)

⸫ 𝑓𝑓𝑎 𝑓 −1 = 𝑓𝑐 ∈ 𝐼(𝐺)

𝑓𝑓𝑎 𝑓 −1 ∈ 𝐼(𝐺)

Hence by the definition of normal subgroup I(G) be a normal subgroup of G. Proved

➢ Define p-sylow subgroup

If G be a finite group of order 𝑃𝑚 . 𝑛 i.e., O(G) = 𝑃𝑚 . 𝑛 where p is a prime number and not a division on n. then a subgroup H of G is said to be
p-sylow subgroup of G if O(H) = 𝑃𝑚

Note: if H be a p-sylow subgroup of a group G then 𝑥 −1 𝐻𝑥 is also a p-sylow subgroup.

➢ If a group G has only one p-sylow subgroup H then H is a normal subgroup of G.

Proof: let us suppose G be a group haring only one p-sylow subgroup H.

Then we have to show that it is normal subgroup of G.

For this let 𝑥 ∈ 𝐺 be an arbitrary element then we have 𝑥 −1 𝐻𝑥 is also

But by supposition H is the only one p-sylow subgroup

So 𝐻 = 𝑥 −1 𝐻𝑥

23
Which show that H is a normal subgroup of G. proved

Typing by Nawanit Kumar Das

24