100% found this document useful (1 vote)
840 views29 pages

20170321120320chapter 3 - Isomorphism and Homomorphism

This document provides information about isomorphisms and homomorphisms in algebraic structures. It begins by defining isomorphism and providing examples to show when two binary structures are isomorphic. It introduces the steps to show binary structures are isomorphic, including defining a function, showing it is one-to-one and onto, and showing it preserves operations. The document then presents theorems about properties preserved under isomorphism, such as if the domain group is abelian then the range group is also abelian. It concludes with an example problem applying the concept of isomorphism.

Uploaded by

Nashz Chance
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
840 views29 pages

20170321120320chapter 3 - Isomorphism and Homomorphism

This document provides information about isomorphisms and homomorphisms in algebraic structures. It begins by defining isomorphism and providing examples to show when two binary structures are isomorphic. It introduces the steps to show binary structures are isomorphic, including defining a function, showing it is one-to-one and onto, and showing it preserves operations. The document then presents theorems about properties preserved under isomorphism, such as if the domain group is abelian then the range group is also abelian. It concludes with an example problem applying the concept of isomorphism.

Uploaded by

Nashz Chance
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 29

ALGEBRAIC STRUCTURES

SMA 3033
SEMESTER 2 2016/2017

CHAPTER 3 : ISOMORPHISM &


HOMOMORPHISM
BY:
DR ROHAIDAH HJ MASRI
SMA3033 CHAPTER 3 Sem 2
1
2016/2017
3.1 ISOMORPHISM

Example 1
S = { a, T = { x, y,
b, c } zx} y
* a b c * z
a c a b x z x y
b a b c y x y z
c b c a z y z x

Note that, this two


tables are
structurally alike.
Compare
S & T are
isomorphic binary
structure. ( S T )
SMA3033 CHAPTER 3 Sem 2
2
2016/2017
3.1 ISOMORPHISM (Cont.)

Definition 1 (Isomorphism)

Let G be a group with operation * , and let H be a group with


operation #. An isomorphism of G onto H is a mapping : G
H that is one to one and onto satisfies
(a * b) = (a) # (b) for all a, b in G.

Note:
The condition An isomorphism from a group G
(a * b) = (a) # (b) to G itself :
is described as preserves :GG
the operation. is called an automorphism of G.

SMA3033 CHAPTER 3 Sem 2


3
2016/2017
3.1 ISOMORPHISM (Cont.)

Some steps to show that binary structures are


isomorphic :

Let < S, * > & < S, * > are two binary structures.

1.Define the function that gives the isomorphism of S with


S .
2.Show that is a one to one function.
3.Show that is onto S.
4.Show that ( a * b ) = (a) * (b) for all a, b in S.

Example 2

Let 2Z = { 2n | nZ } and : Z 2Z. Show that a binary


structure < Z, + > is isomorphic to the structure < 2Z, + >.

SMA3033 CHAPTER 3 Sem 2


4
2016/2017
3.1 ISOMORPHISM (Cont.)

Solution:

1.To show is 1-1.

Let m, n Z.
(m) = (n)
2m = 2n
m=n
Then, is 1-1.

2.To show is onto.


(To show n2Z mZ such that (m) = n )

Let n2Z.
(m) = n
2m = n
SMA3033 CHAPTER 3 Sem 2
5
2016/2017
3.1 ISOMORPHISM (Cont.)

m = n/2Z
Then,
is onto.

3.To show (m + n) = (m) + (n).

Let m, n Z.
LHS:
(m + n) = 2(m + n)
= 2m + 2n
= (m) + (n) : RHS

Therefore, is isomorphism

SMA3033 CHAPTER 3 Sem 2


6
2016/2017
3.1 ISOMORPHISM (Cont.)

Example 3

Let RP denote the positive real numbers @ R+ , and define


: RP R by
(x) = log10(x) for each xRP
Show that < RP, . > is isomorphic to < R, + >.

Solution :

1.To show is 1-1.


(For all x, yRP, (x)=(y) then x = y )

Let x, yRP .
(x)=(y)
log10(x) = log10(y)
= y. is 1-1.
x Then,
SMA3033 CHAPTER 3 Sem 2
7
2016/2017
3.1 ISOMORPHISM (Cont.)

2. To show is onto.
(yR , xRP such that (x) = y )

Let yR.
(x) = y
log10(x) = y
x = 10y R.
then,
is onto.
3. To show (xy) = (x) + (y).
Let x, y RP.
LHS : (xy) = log10(xy)
= log10(x) + log10(y)
= (x) + (y) : RHS
Therefore, < Rp, . > < R, + >.
SMA3033 CHAPTER 3 Sem 2
8
2016/2017
3.1 ISOMORPHISM (Cont.)

Exercise:

1.Show that the binary structure < R, + > is isomorphic to


the structure < R+, . >. Mapping : R R+ is defined by
(x) = ex.

SMA3033 CHAPTER 3 Sem 2


9
2016/2017
3.1 ISOMORPHISM (Cont.)

Theorem 1

If G and H are isomorphic groups and G is abelian, then H is


abelian.

Proof:

Let * be the operation of G


and
let # be the operation of H.

Hypothesis
Suppose : G H be an isomorphism.
Also, let G is Abelian. Hypothesis
If x, y H.
Then, there are elements a, b G such that,
SMA3033 CHAPTER 3 Sem 2
10
2016/2017
3.1 ISOMORPHISM (Cont.)

(a) = x
(b) = y.
(To show H is abelian).
(To show x # y = y # x ).

x # y = (a) # (b)
b ) iso
= (a *Since
preserves
= (b * a) Since G is
abelian
= (b) # (a)
Since iso
= y # x. preserves
Then, H is abelian.

SMA3033 CHAPTER 3 Sem 2


11
2016/2017
3.1 ISOMORPHISM (Cont.)

Theorem 2

Suppose <G, *> has identity e for *. If : G G is an


isomorphism of <G, * > and <G, *>, then (e) is the
identity for the binary operation * on G.

Proof:

(To show (e) is the identity in <G, * > )


(To show (e) * x = x = x * (e) )

Let x G .
is
Since is an isomorphism 1-1, onto & preserves
operation
SMA3033 CHAPTER 3 Sem 2
12
2016/2017
3.1 ISOMORPHISM (Cont.)

Since is onto
x G x G such that (x)
= x.
x = (x)
= (e * x) By def. identity
element
= (e) * (x)
Since is
= (e) * x isomorphism(1)

x = (x)
= (x * e)
= (x) * (e)
= x * (e) (2)

By Eq. (1) & (2);


(e) * x = x = x * (e).
Therefore,
(e) is the identity element in G
SMA3033 CHAPTER 3 Sem 2
13
2016/2017
3.1 ISOMORPHISM (Cont.)

Theorem 3

Let G be a group with operation * . Let G be a group with


operation # and : G G is an isomorphism. Then,
( a-1) = [(a)]-1 for all aG.

Proof: By
Theorem
2
Let aG.
Since (e) is identity in G ;
Then,
(e) = ( a * a-1 ) By def. of inverse
= (a) # ( a-1) element
(1) Since
isomorphism

SMA3033 CHAPTER 3 Sem 2


14
2016/2017
3.1 ISOMORPHISM (Cont.)

Also,
(e) = (a-1 * a)
= (a-1) (a) (2)

From Eq. (1) & (2);


(a) # ( a-1) = (a-1) (a) = (e)

Take, (a-1) (a) = (e)


Since G group
[(a ) (a)] # [(a)] = (e) # [(a)]-1
-1 -1
G3
(a-1) [ (a) # [(a)]-1 ] = [(a)]-1 By G1 & G2
(a-1) (e) = [(a)]-1 By def. of G3
(a-1) = [(a)]-1

Note: If : < G, . > < G, * > iso. then ( x . y) =


(x) * (y)
SMA3033 CHAPTER 3 Sem 2
15
2016/2017
3.1 ISOMORPHISM (Cont.)

Example 4

Assume that H = { u, v, w, x, y, z } is a group with respect


to multiplication and that : Z6 H is an isomorphism with
(0) = u (3) = x
(1) = v (4) = y
(2) = w (5) = z
Replace each the following by the appropriate letter, either
u, v, w, x, y or z.

(a)xw (c) y2 v -1
(b)z-1 (d) (xy) -1 z

SMA3033 CHAPTER 3 Sem 2


16
2016/2017
3.1 ISOMORPHISM (Cont.)

Solution:

(a) xw = (3)(2)
= ( 3 +6 2 )
= (5) Recall: Table of
=z integer modulo Z

(b) z-1 = [ (5) ]-1 By theorem


+ 0 1 2 3 4 5
= (5 -1 ) 3
= (1) 6 0 1 2 3 4 5
How to get 0 1 2 3 4 5 0
this?? 1 2 3 4 5 0 1
2 3 4 5 0 1 2
Try (c) & (d) ! 3 4 5 0 1 2 3
4 5 0 1 2 3 4
5
SMA3033 CHAPTER 3 Sem 2
17
2016/2017
3.2 HOMOMORPHISMS

Definition 1 (Homomorphism)

Let < G, * > and < G, * > be groups and a function


from G into G. Then is called a homomorphism of G into
G if for all a, b in G,
( a * b ) = (a) * (b).

Definition 2 ( Trivial Homomorphism)

Let e be the identity of the group G. Define : G G by


(a) = e for all a in G.
Since (a*b) = e = e * e = (a) * (b) for all a, b in G,
we find that is a homomorphism from G to G.
Here , is called a trivial homomorphism.

SMA3033 CHAPTER 3 Sem 2


18
2016/2017
3.2 HOMOMORPHISMS

Example 1

Let rZ and let r : < Z, + > < Z, + > be defined by


r(n) = r n for all nZ.
Show that r is a homomorphism.

Solution:

Let m, n in Z.
LHS : r (m + n)
= r (m + n)
= rm + rn
= r (m) + r (n) : RHS
Then,
r is a homomorphism.
SMA3033 CHAPTER 3 Sem 2
19
2016/2017
3.2 HOMOMORPHISMS

Example 2

Let

be the group under matrix multiplication. Let R* be the


group of all nonzero real numbers under multiplication.
Define : M R* by

Determine whether is a homomorphism.

SMA3033 CHAPTER 3 Sem 2


20
2016/2017
3.2 HOMOMORPHISMS

Solution:

LHS:

Since . & +
comm. on R

RHS
SMA3033 CHAPTER 3 Sem 2
21
2016/2017
3.2 HOMOMORPHISMS

Example 3

Define a function f : < Z, + > < Z, + > by f(a) = a + 1 for


all a in Z. Determine whether f is a homomorphism.

Solution:

Let a, b in Z.
(To show f(a + b) = f(a) + f(b) )

LHS : f(a + b) = (a + b) + 1
RHS : f(a) + f(b) = (a + 1 ) + (b + 1)
= a + b + 2.
See that, LHS RHS. Then f is not a homomorphism.
SMA3033 CHAPTER 3 Sem 2
22
2016/2017
3.2 HOMOMORPHISMS

Example 4

Let R* be the group of all nonzero real numbers under


multiplication. Define : R* R* by (a) = | a |. Show that
is a homomorphism.

Solution:

Let a, b in R*.
LHS : (ab) = |ab|
= | a || b |
= (a) (b) : RHS

SMA3033 CHAPTER 3 Sem 2


23
2016/2017
3.2 HOMOMORPHISMS

3.2.1 Properties of Homomorphism

Definition 3 (Inverse Image)

Let be a function of a set X into a set Y, and let A X


and B Y. The image [A] of A in Y under is
{ (a) | aA }.
The set [ X ] is the range of .
The inverse image -1[B] of B in X is { xX | (x)B }.

X
[B]
-1
B Y
The inverse
image of B
x . . (x)
SMA3033 CHAPTER 3 Sem 2
24
2016/2017
3.2 HOMOMORPHISMS

Theorem 1

Let be a homomorphism of a group G into group G.


(a)If e is the identity element in G, then (e) is the identity
element e in G.
(b)If aG, then (a-1) = [(a)]-1.
(c)If H is a subgroup of G, then [H] is a subgroup of G.
(d)If K is a subgroup of G, then -1[K] is a subgroup of G.

Proof:

(a)Let be a homomorphism of G into G.


Then,
(a) = (ae) = (a) (e)
(1)

SMA3033 CHAPTER 3 Sem 2


2016/2017 25
3.2 HOMOMORPHISMS

Multiplying on the left of (1) by [(a)]-1:


Then,
[(a)]-1 (a) = (ae) = [(a)]-1 (a) (e)
e = (e)

(b)To show (a-1) = [(a)]-1.


By (a),
e = (e) .
Then,
e = (e) = (a a-1) = (a)(a-1).

e = (a)(a-1)
Then by multiplying [(a)]-1 on both sides,
(a-1) = [(a)]-1
SMA3033 CHAPTER 3 Sem 2
26
2016/2017
3.2 HOMOMORPHISMS

Definition 4 ( Kernel of )

Let be a homomorphism of a group G into a group G. The


kernel of , denoted by Ker() is defined to be the set
Ker() = { aG | (a) = e }.

Example 5

Determine whether and are elements


of ker(), where

is the homomorphism defined in example 2.

SMA3033 CHAPTER 3 Sem 2


27
2016/2017
3.2 HOMOMORPHISMS

Solution:

Note that : 1 is the identity for the group R* under


multiplication.
From the definition of ker(),

but 1(3) 1(0) = 3, so is not an element


of ker().

and 2(1) 1(1) = 1, so, is an element


of ker().
SMA3033 CHAPTER 3 Sem 2
28
2016/2017
3.2 HOMOMORPHISMS

Theorem 2

Let be a homomorphism of a group G into a group G. Then,


is one to one if and only if ker() = {e}.

Note:

Monomorphism - one to one homomorphism.

Epimorphism onto homomorphism.

SMA3033 CHAPTER 3 Sem 2


29
2016/2017

You might also like