 Definition 16: Let H be a subgroup of a group G, and let a  G. We define the left coset of H in G containing g,written gH, by gH ={g*h| h  H}. Similarity.

Slides:



Advertisements
Similar presentations
Section 11 Direct Products and Finitely Generated Abelian Groups One purpose of this section is to show a way to use known groups as building blocks to.
Advertisements

Math 344 Winter 07 Group Theory Part 3: Quotient Groups
Groups TS.Nguyễn Viết Đông.
Algebraic Structures: Group Theory II
Section 13 Homomorphisms Definition A map  of a group G into a group G’ is a homomorphism if the homomophism property  (ab) =  (a)  (b) Holds for.
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Group THeory Bingo You must write the slide number on the clue to get credit.
How do we start this proof? (a) Assume A n is a subgroup of S n. (b)  (c) Assume o(S n ) = n! (d) Nonempty:
Is ℤ 6 a cyclic group? (a) Yes (b) No. How many generators are there of ℤ 6 ?
How do we start this proof? (a) Let x  gHg -1. (b)  (c) Assume a, b  H (d) Show Nonempty:
Let G be a group. Define  : G ® G by  ( x ) = x. The First Isomorphism Theorem says: (a) j(ab) = j(a)j(b)(b) j is onto. (c) G  G(d) G  {e} (e) G/{e}
Find all subgroups of the Klein 4- Group. How many are there?
ⅠIntroduction to Set Theory 1. Sets and Subsets
MTH-376 Algebra Lecture 1. Instructor: Dr. Muhammad Fazeel Anwar Assistant Professor Department of Mathematics COMSATS Institute of Information Technology.
2. Basic Group Theory 2.1 Basic Definitions and Simple Examples 2.2 Further Examples, Subgroups 2.3 The Rearrangement Lemma & the Symmetric Group 2.4 Classes.
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Unit – IV Algebraic Structures
Let H be a normal subgroup of a group G. Define j: G ® G/H by: (a) j(ab) = j(a)j(b) (b) j(a) = Ha (c) j(Ha) = a (d) j(ab) = Hab (e) j(ab) = HaHb.
Lagrange's Theorem. The most important single theorem in group theory. It helps answer: –How large is the symmetry group of a volleyball? A soccer ball?
6.3 Permutation groups and cyclic groups  Example: Consider the equilateral triangle with vertices 1 , 2 , and 3. Let l 1, l 2, and l 3 be the angle bisectors.
Cyclic Groups (9/25) Definition. A group G is called cyclic if there exists an element a in G such that G =  a . That is, every element of G can be written.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,  
MATH10001 Project 2 Groups part 2 ugstudies/units/ /level1/MATH10001/
Math 3121 Abstract Algebra I Lecture 5 Finish Sections 6 + Review: Cyclic Groups, Review.
Math 3121 Abstract Algebra I Lecture 10 Finish Section 11 Skip 12 – read on your own Start Section 13.
Math 3121 Abstract Algebra I
Cosets and Lagrange’s Theorem (10/28)
Math 3121 Abstract Algebra I Lecture 11 Finish Section 13 Section 14.
UNIT - 2.  A binary operation on a set combines two elements of the set to produce another element of the set. a*b  G,  a, b  G e.g. +, -, ,  are.
Chapter 6 Abstract algebra
Questions on Direct Products (11/6) How many elements does D 4  Z 4 have? A. 4B. 8C. 16D. 32E. 64 What is the largest order of an element in D 4  Z 4.
Normal Subgroups and Factor Groups (11/11) Definition. A subgroup H of a group G is called normal if for every a  G, the left coset aH is the same set.
Section 14 Factor Groups Factor Groups from Homomorphisms. Theorem Let  : G  G’ be a group homomorphism with kernel H. Then the cosets of H form a factor.
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Math 3121 Abstract Algebra I Lecture 14 Sections
6.3.2 Cyclic groups §1.Order of an element §Definition 13: Let G be a group with an identity element e. We say that a is of order n if a n =e, and for.
SECTION 8 Groups of Permutations Definition A permutation of a set A is a function  ϕ : A  A that is both one to one and onto. If  and  are both permutations.
 Example: [Z m ;+,*] is a field iff m is a prime number  [a] -1 =?  If GCD(a,n)=1,then there exist k and s, s.t. ak+ns=1, where k, s  Z.  ns=1-ak.
SECTION 10 Cosets and the Theorem of Lagrange Theorem Let H be a subgroup of G. Let the relation  L be defined on G by a  L b if and only if a -1 b 
 Theorem 6.21: Let H be a subgroup of G. H is a normal subgroup of G iff g -1 hg  H for  g  G and h  H.  Proof: (1) H is a normal subgroup of G.
 2. Inverse functions  Inverse relation,  Function is a relation  Is the function’s inverse relation a function? No  Example: A={1,2,3},B={a,b}, f:A→B,
6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation (denoted ·) such that.
Garis-garis Besar Perkuliahan
Group A set G is called a group if it satisfies the following axioms. G 1 G is closed under a binary operation. G 2 The operation is associative. G 3 There.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Garis-garis Besar Perkuliahan
Group.
Sylow Theorems.
Permutation A permutation of the numbers 1,2, and 3 is a rearrangement of these numbers in a definite order. Thus the six possibilities are
6.6.4 Subring, Ideal and Quotient ring
Abstract Algebra I.
Math 3121 Abstract Algebra I
6.3.2 Cyclic groups 1.Order of an element
Groups and Applications
Great Theoretical Ideas In Computer Science
Math 3121 Abstract Algebra I
Math 3121 Abstract Algebra I
Cryptography Lecture 21.
Homomorphisms (11/20) Definition. If G and G’ are groups, a function  from G to G’ is called a homomorphism if it is operation preserving, i.e., for all.
Let H be a normal subgroup of G, and let G/H={Hg|gG}
I. Finite Field Algebra.
Theorem 6.29: Any Field is an integral domain
6.4.3 Lagrange's Theorem Theorem 6.19: Let H be a subgroup of the group G. Then {gH|gG} and {Hg|gG} have the same cardinal number Proof:Let S={Hg|gG}
Theorem 6.12: If a permutation of Sn can be written as a product of an even number of transpositions, then it can never be written as a product of an odd.
Definition 19: Let [H;. ] be a normal subgroup of the group [G;. ]
For g2G2, (n)(N), g1G1 s.t (g1)=g2 ? surjection homomorphism.
2. From Groups to Surfaces
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Presentation transcript:

 Definition 16: Let H be a subgroup of a group G, and let a  G. We define the left coset of H in G containing g,written gH, by gH ={g*h| h  H}. Similarity we define the right coset of H in G containing g,written Hg, by Hg ={h*g| h  H}.

 [E;+]  Example:S 3 ={e,  1,  2,  3,  4,  5 }  H 1 ={e,  1 }; H 2 ={e,  2 }; H 3 ={e,  3 };  H 4 ={e,  4,  5 } 。 H1H1

 Lemma 2 : Let H be a subgroup of the group G. Then |gH|=|H| and |Hg|=|H| for  g  G.  Proof:  :H  Hg,  (h)=h  g

6.4.3 Lagrange's Theorem  Theorem 6.19: Let H be a subgroup of the group G. Then {gH|g  G} and {Hg|g  G} have the same cardinal number  Proof : Let S= {Hg|g  G} and T= {gH|g  G}   : S→T,  (Ha)=a -1 H 。 (1)  is an everywhere function. for Ha=Hb, a -1 H?=b -1 H [a]  [b] iff [a] ∩[b]=  (2)  is one-to-one 。 For Ha,Hb,suppose that Ha  Hb , and  (Ha)=  (Hb) (3)Onto

 Definition 17 : Let H is a subgroup of the group G. The number of all right cosets(left cofets) of H is called index of H in G.  [E;+] is a subgroup of [Z;+].  E’s index? ?  Theorem 6.20: Let G be a finite group and let H be a subgroup of G. Then |G| is a multiple of |H|.  Example: Let G be a finite group and let the order of a in G be n. Then n| |G|.

 Example: Let G be a finite group and |G|=p. If p is prime, then G is a cyclic group.

6.4.4 Normal subgroups  Definition 18 : A subgroup H of a group is a normal subgroup if gH=Hg for  g  G.  Example: Any subgroups of Abelian group are normal subgroups  S 3 ={e,  1,  2,  3,  4,  5 } :  H 1 ={e,  1 }; H 2 ={e,  2 }; H 3 ={e,  3 }; H 4 ={e,  4,  5 } are subgroups of S 3.  H 4 is a normal subgroup

 (1) If H is a normal subgroup of G, then Hg=gH for  g  G  (2)H is a subgroup of G.  (3)Hg=gH, it does not imply hg=gh.  (4) If Hg=gH, then there exists h'  H such that hg=gh' for  h  H

 Theorem 6.21: Let H be a subgroup of G. H is a normal subgroup of G iff g -1 hg  H for  g  G and h  H.  Example:Let G ={ (x; y)| x,y  R with x  0}, and consider the binary operation ● introduced by (x, y) ● (z,w) = (xz, xw + y) for (x, y), (z, w)  G. Let H ={(1, y)| y  R}. Is H a normal subgroup of G? Why?  1. H is a subgroup of G  2. normal?

 Let H be a normal subgroup of G, and let G/H={Hg|g  G}  For  Hg 1 and Hg 2  G/H,  Let Hg 1  Hg 2 =H(g 1 *g 2 )  Lemma 3: Let H be a normal subgroup of G. Then [G/H;  ] is a algebraic system.  Proof:  is a binary operation on G/H.  For  Hg 1 =Hg 3 and Hg 2 =Hg 4  G/H,  Hg 1  Hg 2 =H(g 1 *g 2 ), Hg 3  Hg 4 =H(g 3 *g 4 ),  Hg 1  Hg 2 ?=Hg 3  Hg 4 ?  H(g 1 *g 2 )=?H(g 3 *g 4 )  g 3 *g 4  ?H(g 1 *g 2 ), i.e. (g 3  g 4 )  (g 1 *g 2 ) -1  ?H.

 Theorem 6.22: Let [H;  ] be a normal subgroup of the group [G;  ]. Then [G/H;  ] is a group.  Proof: associative  Identity element: Let e be identity element of G.  He=H  G/H is identity element of G/H  Inverse element: For  Ha  G/H, Ha -1  G/H is inverse element of Ha, where a -1  G is inverse element of a.

 Definition 19: Let [H;*] be a normal subgroup of the group [G;*]. [G/H;  ] is called quotient group, where the operation  is defined on G/H by Hg 1  Hg 2 = H(g 1 *g 2 ).  If G is a finite group, then G/H is also a finite group, and |G/H|=|G|/|H|

 Next: quotient group The fundamental theorem of homomorphism for groups  Exercise: P362 21, 22,23, 26,28,33,34