• Tidak ada hasil yang ditemukan

STRUCTURE OF ALGEBRA (Homomorphism and Factor Group)

N/A
N/A
Protected

Academic year: 2018

Membagikan "STRUCTURE OF ALGEBRA (Homomorphism and Factor Group)"

Copied!
54
0
0

Teks penuh

(1)

STRUCTURE OF ALGEBRA

(Homomorphism and Factor Group)

Drs. Antonius Cahya Prihandoko, M.App.Sc

Mathematics Education Study Program Faculty of Teacher Training and Education

the University of Jember Indonesia

(2)

Outline

1 Homomorphism

Properties of Homomorphism Isomorphism and Cayley’s Theorem

2 Factor Groups

(3)

Outline

1 Homomorphism

Properties of Homomorphism Isomorphism and Cayley’s Theorem

2 Factor Groups

(4)

Definition of Homomorphism

Definition

A mapφfrom group(G,∗)into group(G,#)is called homomorphismif

φ(ab) =φ(a)#φ(b)

for allaandbinG.

Example 1

(5)

Definition of Homomorphism

Definition

A mapφfrom group(G,∗)into group(G,#)is called homomorphismif

φ(ab) =φ(a)#φ(b)

for allaandbinG.

Example 1

Letα:Z → Zndefined byα(m) =r, wherer is the residue

(6)

Definition of Homomorphism

Example 2

LetSnis symmetric group ofnletters, and letφ:Sn→ Z2

defined by

φ(ρ) =

0 ifρis even permutation,

1 ifρis odd permutation

Show thatφis a homomorphism!

Example 3

(7)

Definition of Homomorphism

Example 2

LetSnis symmetric group ofnletters, and letφ:Sn→ Z2

defined by

φ(ρ) =

0 ifρis even permutation,

1 ifρis odd permutation

Show thatφis a homomorphism!

Example 3

(8)

Some Properties

Fundamental Properties

Letφis a homomorphism from groupg into groupG, then :

1 Ifeis the identity element ofG, thenφ(e)is the identity element ofG;

2 IfaG, thenφ(a−1) =φ(a)−1;

3 IfH is subgroup ofG, thenφ(H)is subgroup ofG;

(9)

Some Properties

Fundamental Properties

Letφis a homomorphism from groupg into groupG, then :

1 Ifeis the identity element ofG, thenφ(e)is the identity

element ofG;

2 IfaG, thenφ(a−1) =φ(a)−1;

3 IfH is subgroup ofG, thenφ(H)is subgroup ofG;

(10)

Some Properties

Fundamental Properties

Letφis a homomorphism from groupg into groupG, then :

1 Ifeis the identity element ofG, thenφ(e)is the identity

element ofG;

2 IfaG, thenφ(a−1) =φ(a)−1;

3 IfH is subgroup ofG, thenφ(H)is subgroup ofG;

(11)

Some Properties

Fundamental Properties

Letφis a homomorphism from groupg into groupG, then :

1 Ifeis the identity element ofG, thenφ(e)is the identity

element ofG;

2 IfaG, thenφ(a−1) =φ(a)−1;

3 IfH is subgroup ofG, thenφ(H)is subgroup ofG;

(12)

Some Properties

Fundamental Properties

Letφis a homomorphism from groupg into groupG, then :

1 Ifeis the identity element ofG, thenφ(e)is the identity

element ofG;

2 IfaG, thenφ(a−1) =φ(a)−1;

3 IfH is subgroup ofG, thenφ(H)is subgroup ofG;

(13)

Kernel

Definition of Kernel

Letφ:GGis a homomorphism, thenkernelofφ, denoted

byKer(φ), is defined as

Ker(φ) =φ−1({

e}) ={aG|φ(a) =e}

whereeis the identity element ofG.

Kernel as a subgroup

Ifφ:GGis a homomorphism, thenKer(φ)is a subgroup of

(14)

Kernel

Definition of Kernel

Letφ:GGis a homomorphism, thenkernelofφ, denoted

byKer(φ), is defined as

Ker(φ) =φ−1({

e}) ={aG|φ(a) =e}

whereeis the identity element ofG.

Kernel as a subgroup

Ifφ:GGis a homomorphism, thenKer(φ)is a subgroup of

(15)

Kernel

Cosets of the Kernel

Letφ:GGis a homomorphism andH =Ker(φ). LetaG.

Then

φ−1{φ(a)}={x G|φ(x) =φ(a)}

is the left coset,aH, and also the right coset,Ha.

Corollary

A homomorphismφ:GGis one-to-one function if and only

(16)

Kernel

Cosets of the Kernel

Letφ:GGis a homomorphism andH =Ker(φ). LetaG.

Then

φ−1{φ(a)}={x G|φ(x) =φ(a)}

is the left coset,aH, and also the right coset,Ha.

Corollary

A homomorphismφ:GGis one-to-one function if and only

(17)

Some Terminologies

On homomorphism

Letφ:GGis a homomorphism. Ifφis one-to-one then it is

called monomorphism. Ifφis onto then it is called

epimorphism. Ifφis both one-to-one and onto, it is called isomorphism

On Subgroup

(18)

Some Terminologies

On homomorphism

Letφ:GGis a homomorphism. Ifφis one-to-one then it is

called monomorphism. Ifφis onto then it is called

epimorphism. Ifφis both one-to-one and onto, it is called isomorphism

On Subgroup

A subgroupHof groupG)can be callednormalwhen

(19)

Isomorphism

Definition

Anisomorphismφ:GGis one-to-one homomorphism

fromGontoG. The notation for two groups that are isomorph

isGG.

Theorem

Letζ is a set of groups. ForGandGboth are inζ, we say

GG, if they are isomorph. Thenis an equivalence

(20)

Isomorphism

Definition

Anisomorphismφ:GGis one-to-one homomorphism

fromGontoG. The notation for two groups that are isomorph

isGG.

Theorem

Letζ is a set of groups. ForGandGboth are inζ, we say

GG, if they are isomorph. Thenis an equivalence

(21)

Isomorphism

How to show two groups are isomorph?

1 Define a functionφas a candidate of isomorphism fromG intoG.

2 Show thatφis one-to-one function.

3 Show thatφis onto.

4 Show thatφ(xy) =φ(x)φ(y),∀x,yG.

Theorem

All finite cyclic group,G, are isomorph to the group of integers,

(22)

Isomorphism

How to show two groups are isomorph?

1 Define a functionφas a candidate of isomorphism fromG

intoG.

2 Show thatφis one-to-one function.

3 Show thatφis onto.

4 Show thatφ(xy) =φ(x)φ(y),∀x,yG.

Theorem

All finite cyclic group,G, are isomorph to the group of integers,

(23)

Isomorphism

How to show two groups are isomorph?

1 Define a functionφas a candidate of isomorphism fromG

intoG.

2 Show thatφis one-to-one function.

3 Show thatφis onto.

4 Show thatφ(xy) =φ(x)φ(y),∀x,yG.

Theorem

All finite cyclic group,G, are isomorph to the group of integers,

(24)

Isomorphism

How to show two groups are isomorph?

1 Define a functionφas a candidate of isomorphism fromG

intoG.

2 Show thatφis one-to-one function.

3 Show thatφis onto.

4 Show thatφ(xy) =φ(x)φ(y),∀x,yG.

Theorem

(25)

Isomorphism

How to show two groups are isomorph?

1 Define a functionφas a candidate of isomorphism fromG

intoG.

2 Show thatφis one-to-one function.

3 Show thatφis onto.

4 Show thatφ(xy) =φ(x)φ(y),∀x,yG.

Theorem

(26)

Isomorphism

How to show two groups are isomorph?

1 Define a functionφas a candidate of isomorphism fromG

intoG.

2 Show thatφis one-to-one function.

3 Show thatφis onto.

4 Show thatφ(xy) =φ(x)φ(y),∀x,yG.

Theorem

All finite cyclic group,G, are isomorph to the group of integers,

(27)

Structural Properties

How to show two groups are not isomorph

We have to know that an isomorphism keeps structural properties of a group. Such properties can be shown below:

Cyclic; Commute; Infinity;

(28)

Structural Properties

How to show two groups are not isomorph

We have to know that an isomorphism keeps structural properties of a group. Such properties can be shown below:

Cyclic;

Commute; Infinity;

(29)

Structural Properties

How to show two groups are not isomorph

We have to know that an isomorphism keeps structural properties of a group. Such properties can be shown below:

Cyclic; Commute;

Infinity;

(30)

Structural Properties

How to show two groups are not isomorph

We have to know that an isomorphism keeps structural properties of a group. Such properties can be shown below:

Cyclic; Commute; Infinity;

(31)

Structural Properties

How to show two groups are not isomorph

We have to know that an isomorphism keeps structural properties of a group. Such properties can be shown below:

Cyclic; Commute; Infinity;

Order of group and order of element;

(32)

Structural Properties

How to show two groups are not isomorph

We have to know that an isomorphism keeps structural properties of a group. Such properties can be shown below:

Cyclic; Commute; Infinity;

Order of group and order of element; Number of elements of certain order.

(33)

Structural Properties

How to show two groups are not isomorph

We have to know that an isomorphism keeps structural properties of a group. Such properties can be shown below:

Cyclic; Commute; Infinity;

(34)

Non Structural Properties

On the other side

An isomorphism does not keep non structural properties. Such properties are:

Group containing 5;

All group elements are numbers; Binary operation on a group;

(35)

Non Structural Properties

On the other side

An isomorphism does not keep non structural properties. Such properties are:

Group containing 5;

All group elements are numbers; Binary operation on a group;

(36)

Non Structural Properties

On the other side

An isomorphism does not keep non structural properties. Such properties are:

Group containing 5;

All group elements are numbers;

Binary operation on a group;

(37)

Non Structural Properties

On the other side

An isomorphism does not keep non structural properties. Such properties are:

Group containing 5;

All group elements are numbers; Binary operation on a group;

(38)

Non Structural Properties

On the other side

An isomorphism does not keep non structural properties. Such properties are:

Group containing 5;

All group elements are numbers; Binary operation on a group;

All group elements are permutations;

(39)

Non Structural Properties

On the other side

An isomorphism does not keep non structural properties. Such properties are:

Group containing 5;

All group elements are numbers; Binary operation on a group;

(40)

Cayley’s Theorem

Cayley’s Theorem

Every group is isomorph to a group of permutations.

How to prove that theorem?

1 Start with a groupG, determine a permutations setG

2 Prove thatGforms a group under permutation

multiplication.

(41)

Cayley’s Theorem

Cayley’s Theorem

Every group is isomorph to a group of permutations.

How to prove that theorem?

1 Start with a groupG, determine a permutations setG

2 Prove thatGforms a group under permutation multiplication.

3 Define a functionφ:GGand show thatφis an

(42)

Cayley’s Theorem

Cayley’s Theorem

Every group is isomorph to a group of permutations.

How to prove that theorem?

1 Start with a groupG, determine a permutations setG

2 Prove thatGforms a group under permutation multiplication.

(43)

Cayley’s Theorem

Cayley’s Theorem

Every group is isomorph to a group of permutations.

How to prove that theorem?

1 Start with a groupG, determine a permutations setG

2 Prove thatGforms a group under permutation

multiplication.

(44)

Cayley’s Theorem

Cayley’s Theorem

Every group is isomorph to a group of permutations.

How to prove that theorem?

1 Start with a groupG, determine a permutations setG

2 Prove thatGforms a group under permutation

multiplication.

3 Define a functionφ:GGand show thatφis an

(45)

Factor Groups

Coming from Homomorphism

Letφ:GGis a homomorphism withKer(φ) =H. Then

R/H ={aH|aR}is a group under binary operation:

(aH)(bH) = (ab)H

(46)

Factor Groups

Coming from Normal Subgroup

LetHis a subgroup of groupG. Multiplication on cosets ofHis defined as(aH)(bH) = (ab)Hiswell-definedif and only

aH=Ha,∀aG

Coming from Normal Subgroup

As consequence.LetHis a normal subgroup normal on group G. ThenG/H ={aH|a∈G}is a group under binary operation

(47)

Factor Groups

Coming from Normal Subgroup

LetHis a subgroup of groupG. Multiplication on cosets ofHis defined as(aH)(bH) = (ab)Hiswell-definedif and only

aH=Ha,∀aG

Coming from Normal Subgroup

As consequence.LetHis a normal subgroup normal on group

G. ThenG/H ={aH|aG}is a group under binary operation

(48)

Characterize of a Normal Subgroup

Equivalence Characteristics

For a normal subgroupH in groupG.

1 ghg−1∈H,gGdanhH.

2 gHg−1=H,gG.

3 gH =Hg,g G.

Automorphism

An isomorphismφ:GGis calledautomorphisminG. AutomorphismIg :GGwhereIg(x) =gxg−1is calledinner

(49)

Characterize of a Normal Subgroup

Equivalence Characteristics

For a normal subgroupH in groupG.

1 ghg−1∈H,∀gGdanhH.

2 gHg−1=H,gG.

3 gH =Hg,g G.

Automorphism

An isomorphismφ:GGis calledautomorphisminG. AutomorphismIg :GGwhereIg(x) =gxg−1is calledinner

(50)

Characterize of a Normal Subgroup

Equivalence Characteristics

For a normal subgroupH in groupG.

1 ghg−1∈H,∀gGdanhH.

2 gHg−1=H,∀gG.

3 gH =Hg,g G.

Automorphism

(51)

Characterize of a Normal Subgroup

Equivalence Characteristics

For a normal subgroupH in groupG.

1 ghg−1∈H,∀gGdanhH.

2 gHg−1=H,∀gG.

3 gH =Hg,g G.

Automorphism

(52)

Characterize of a Normal Subgroup

Equivalence Characteristics

For a normal subgroupH in groupG.

1 ghg−1∈H,∀gGdanhH.

2 gHg−1=H,∀gG.

3 gH =Hg,g G.

Automorphism

An isomorphismφ:GGis calledautomorphisminG.

(53)

Fundamental Homomorphism Theorem

Prelimenary

LetHis a normal subgroup of groupG. Thenφ:GG/H, defined byφ(a) =aH, is a homomorphism with the kernel

Ker(φ) =H.

Fundamental Homomorphism Theorem

Letφ:GGbe a homomorphism withKer(φ) =H. Then

(54)

Fundamental Homomorphism Theorem

Prelimenary

LetHis a normal subgroup of groupG. Thenφ:GG/H, defined byφ(a) =aH, is a homomorphism with the kernel

Ker(φ) =H.

Fundamental Homomorphism Theorem

Letφ:GGbe a homomorphism withKer(φ) =H. Then φ(G)is a group, and mappingµ:G/H→φ(G), defined by

µ(aH) =φ(a), is a isomorphism. Ifγ :GG/Hbe a homomorphism defined byγ(a) =aH, then∀aG,

Referensi

Dokumen terkait

Kontribusi penelitian ini yakni, pertama adalah temuan yang menunjukkan (1) individu yang lebih berorientasi relativistik akan terdorong untuk mendukung praktik manajemen laba;

Specifically, we analyse the impact of the Board size, activity and independence on the online disclosure of strategic information through some hypotheses included within

[r]

Penelitian ini berguna untuk memperoleh data dalam penyusunan skripsi sebagai salah satu syarat untuk mendapatkan gelar sarjana teknologi pangan di Program Studi Ilmu dan

[r]

hari kalender, Karena yang dicatumkan dalam jadwal pengiriman barang terinci sebagai berikut : *) Untuk bulan Januari, Maret, Mei, Juli, Agustus, Oktober, Desember

Kebijakan fiskal juga dapat dipahami sebagai kebijakan ekonomi yang dilakukan oleh pemerintah melalui merubah-rubah (menaik- kan atau menurunkan) penerimaan negara dan atau

On a dry weight basis, the highest total SOD and total APX activities were observed in phyllode 1; thereafter, activities of these antiox- idant enzymes declined and they were