MHZ5355 / MHZ5375

DISCRETE MATHEMATICS

C. P. S. Pathirana
Senior Lecturer
Department of Mathematics & Philosophy of Engineering.
The Open University of Sri Lanka.
Session 7
Group homomorphism and isomorphism

 Introduction

In this session we learn some definitions and concepts

about homomorphism and isomorphism of a group.
7.1 Group homomorphism and some
properties of homomorphism

• Homomorphism is a structure preserving map between

two groups.

Definition 2.1 – Homomorphism

Let (𝐺,∗) and (𝐺1 ,#) be two groups. A mapping

∅: 𝐺 → 𝐺1 is called homomorphism if,

∅ 𝑥 ∗ 𝑦 = ∅ 𝑥 #∅(𝑦) for all 𝑥, 𝑦 ∈ 𝐺

1. Let 𝑮 = (ℝ, +) and 𝑮𝟏 = ℝ+ ,⋅ . Show that
∅: (ℝ, +) → ℝ+ ,⋅ denoted by ∅ 𝒙 = 𝒆𝒙 is a
homomorphism.

Here are the steps.

• ∅ is well defined.
• ∅ 𝑥 + 𝑦 = ∅ 𝑥 ⋅ ∅(𝑦)

To show that ∅ is well defined, we must show that

∅ 𝑥 = ∅(𝑦) whenever 𝑥 = 𝑦 for all 𝑥, 𝑦 ∈ 𝐺.

Suppose 𝑥=𝑦
𝑒 𝑥 = 𝑒𝑦
∅ 𝑥 = ∅(𝑦)
Then ∅ is well defined.
Now show that ∅ 𝑥 + 𝑦 = ∅ 𝑥 ⋅ ∅ 𝑦 .

∅ 𝑥 + 𝑦 = 𝑒 𝑥+𝑦
= 𝑒 𝑥 ⋅ 𝑒𝑦
= ∅ 𝑥 ⋅ ∅(𝑦) for all 𝑥, 𝑦 ∈ 𝐺.

Hence ∅ is a homomorphism.
Theorem 2.1

Let (𝐺,∗) and (𝐺1 , #) be two groups with the identity

elements 𝑒 and 𝑒1 respectively. If ∅ is a homomorphism
of a group 𝐺 on to 𝐺1 , then

i. ∅ 𝑒 = 𝑒1 .
−1
ii. ∅ 𝑥 −1 = ∅ 𝑥 for all 𝑥 ∈ 𝐺.
Proof
i. Consider ∅(𝑎) where 𝑎 ∈ 𝐺.

∅ 𝑎 = ∅(𝑎 ∗ 𝑒)
= ∅ 𝑎 #∅ 𝑒
∅ 𝑎 # 𝑒1 = ∅ 𝑎 #∅ 𝑒

By right cancellation law, ∅ 𝑒 = 𝑒1 .

ii. We know, ∅ 𝑒 = 𝑒1 .
Then,
∅ 𝑥 ∗ 𝑥 −1 = 𝑒1 for any 𝑥 ∈ 𝐺
∅ 𝑥 # ∅ 𝑥 −1 = 𝑒1
−1 −1
∅ 𝑥 = ∅ 𝑥 for all 𝑥 ∈ 𝐺.
Definition 2.2 – The kernel of a homomorphism

The Kernel of a homomorphism ∅: 𝐺 → 𝐺1 (𝐺 into 𝐺1 )

is the set of all element of 𝑮 mapped onto the
identify elements of 𝑮𝟏 by ∅.

• The Kernel of ∅ is usually denoted by 𝐾𝑒𝑟 ∅.

• 𝐾𝑒𝑟 ∅ = {𝑥 ∈ 𝐺: ∅ 𝑥 = 𝑒1 } where 𝑒1 is the identity

of 𝐺1 .

∅ 𝑒1

Ker ∅
Definition 2.3 – Isomorphism

Let (𝐺,∗) and (𝐺1 , #) be two groups. An isomorphism

from (𝐺,∗) to (𝐺1 , #) is one to one homomorphism
∅: 𝐺 → 𝐺1 .

One to one functions

∅: 𝐺 → 𝐺1 is said to be one to one if, for all 𝑥, 𝑦 ∈ 𝐺

∅ 𝑥 =∅ 𝑦 ⟹ 𝑥=𝑦
or
𝑥 ≠ 𝑦 ⟹ ∅ 𝑥 ≠ ∅(𝑦)
Note:
Every isomorphism is also a homomorphism, but
not conversely.

Isomorphism Homomorphism
Homomorphism Isomorphism

C. P. S. Pathirana 10
Example:

C. P. S. Pathirana 11
Solution:
First we want to show that f is homomorphism,

C. P. S. Pathirana 12
C. P. S. Pathirana 13
THANK YOU

14