 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.

Slides:



Advertisements
Similar presentations
Chapter 4 Finite Fields. Introduction of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key concern operations on “numbers”
Advertisements

Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.
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.
1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.
Math 3121 Abstract Algebra I
Groups TS.Nguyễn Viết Đông.
 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.
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.
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
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:
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
M. Khalily Dermany Islamic Azad University.  finite number of element  important in number theory, algebraic geometry, Galois theory, cryptography,
Rings,Fields TS. Nguyễn Viết Đông Rings, Integral Domains and Fields, 2. Polynomial and Euclidean Rings 3. Quotient Rings 2.
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Unit – IV Algebraic Structures
Monoids, Groups, Rings, Fields
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation(denoted · such that.
By S. Joshi. Content Binary Structures & Group Subgroup Isomorphism Rings Fields.
 Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder notion, Recursive definition  , ,  
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 344 Winter 07 Group Theory Part 2: Subgroups and Isomorphism
Math 3121 Abstract Algebra I
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
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.
Chapter 13 Mathematic Structures 13.1 Modular Arithmetic Definition 1 (modulo). Let a be an integer and m be a positive integer. We denoted by a mod m.
6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation (denoted ·) such that.
Math 3121 Abstract Algebra I Lecture 15 Sections
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.
Math 3121 Abstract Algebra I
Unit-III Algebraic Structures
Chapter 3 The Real Numbers.
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
Chapter 3 The Real Numbers.
B.Sc. III Year Mr. Shrimangale G.W.
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}
B.Sc. III Year Mr. Shrimangale G.W.
I. Finite Field Algebra.
Theorem 6.29: Any Field is an integral domain
Chapter 6 Abstract algebra
Rings,Fields TS. Nguyễn Viết Đông.
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
DR. MOHD AKHLAQ ASSISTANT PROFESSOR DEPARTMENT OF MATHEMATICS GOVT. P
Presentation transcript:

 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) g -1 hg  H for  g  G and h  H  For  g  G, Hg?=gH

 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|

6.5 The fundamental theorem of homomorphism for groups  Homomorphism kernel and homomorphism image  Lemma 4: Let [G;*] and [G';  ] be groups, and  be a homomorphism function from G to G'. Then  (e) is identity element of [G';  ].  Proof: Let x  (G)  G'. Then  a  G such that x=  (a).

 Definition 20: Let  be a homomorphism function from group G with identity element e to group G' with identity element e’. {x  G|  (x)= e'} is called the kernel of homomorphism function . We denoted by Ker  ( K(  ),or K).

 Example: [R-{0};*] and [{-1,1};*] are groups.

 Theorem 6.23 : Let  be a homomorphism function from group G to group G'. Then following results hold.  (1)[Ker  ;*] is a normal subgroup of [G;*].  (2)  is one-to-one iff K={e G }  (3)[  (G);  ] is a subgroup of [G';  ].  proof:(1)i) Ker  is a subgroup of G  For  a,b  Ker , a*b  ?Ker ,  i.e.  (a*b)=?e G‘  Inverse element: For  a  Ker , a -1  ?Ker   ii)For  g  G,a  Ker , g -1 *a*g  ?Ker 

 The fundamental theorem of homomorphism for groups  Theorem 6.24 Let H be a normal subgroup of group G, and let [G/H;  ] be quotient group. Then f: G  G/H defined by f(g)=Hg is an onto homomorphism, called the natural homomorphism.  Proof: homomorphism  Onto

 Theorem 6.25 : Let  be a homomorphism function from group [G;*] to group [G';  ]. Then [G/Ker(  );  ]  [  (G);  ]  isomorphism function f:G/ Ker(  )  (G).  Let K= Ker(  ). For  Ka  G/K , f(Ka)=  (a)  f is an isomorphism function 。  Proof: For  Ka  G/K , let f(Ka)=  (a)  (1)f is a function from G/K to  (G)  For Ka=Kb,  (a)=?  (b)  (2)f is a homomorphism function  For  Ka,Kb  G/K, f(Ka  Kb)=?f(Ka)  f(Kb)  (3) f is a bijection  One-to-one  Onto

 Corollary 6.2: If  is a homomorphism function from group [G;*] to group [G';  ], and it is onto, then [G/K;  ]  [G';  ]  Example: Let W={e i  |  R}. Then [R/Z;  ]  [W;*].  Let  (x)=e 2  ix   is a homomorphism function from [R;+] to [W;*],   is onto  Ker  ={x|  (x)=1}=Z

6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation(denoted · such that for all a, b, c  R,  (1) a · (b + c) = a · b + a · c,  (2) (b + c) · a = b · a + c · a.  We write 0  R for the identity element of the group [R, +].  For a  R, we write -a for the additive inverse of a.  Remark: Observe that the addition operation is always commutative while the multiplication need not be.  Observe that there need not be inverses for multiplication.

 Example: The sets Z,Q, with the usual operations of multiplication and addition form rings,  [Z;+,  ],[Q;+,  ] are rings  Let M={(a ij )n  n|a ij is real number}, Then [M;+,  ]is a ring  Example: S ,[P(S); ,∩] ,  Commutative ring

 Definition 23: A ring R is a commutative ring if ab = ba for all a, b  R. A ring R is an unitary ring if there is 1  R such that 1a = a1 = a for all a  R. Such an element is called a multiplicative identity.

 Example: If R is a ring, then R[x] denotes the set of polynomials with coefficients in R. We shall not give a formal definition of this set, but it can be thought of as: R[x] = {a 0 + a 1 x + a 2 x 2 + …+ a n x n |n  Z +, a i  R}.  Multiplication and addition are defined in the usual manner; if then One then has to check that these operations define a ring. The ring is called polynomial ring.

 Theorem 6.26: Let R be a commutative ring. Then for all a,b  R,  where n  Z +.

 Quiz:1.Let G be a cyclic group generated by the element g, where |G|=18. Then g 6 is not a generator of G  2.Let Q be the set of all rational numbers. Define & on Q by  a&b=a+b+a  b  (1)Prove [ Q;& ] is a monoid.  (2)Is [Q;&] a group ? Why?  Exercise:P367 6  1.Prove Theorem 6.23(2)(3)  2.Let W={e i  |  R}. Then [C * /W;  ]  [R + ;*].  3.Let X be any non-empty set. Show that  [P(X); ∪, ∩] is not a ring.