DR. MOHD AKHLAQ ASSISTANT PROFESSOR DEPARTMENT OF MATHEMATICS GOVT. P

Slides:



Advertisements
Similar presentations
Binary Operations Let S be any given set. A binary operation  on S is a correspondence that associates with each ordered pair (a, b) of elements of S.
Advertisements

Chapter 4 Finite Fields. Introduction of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key concern operations on “numbers”
Chapter 4 – Finite Fields. Introduction will now introduce finite fields of increasing importance in cryptography –AES, Elliptic Curve, IDEA, Public Key.
Cayley Theorem Every group is isomorphic to a permutation group.
Math 3121 Abstract Algebra I
 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.
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.
A. III. Molecular Symmetry and Group Theory
Permutations and Inverses. Definition Let A be a set. If f : A  A is a 1-1 correspondence then f is called a permutation of A. Notation: S(A): the set.
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:
Lecture # 8 Molecular Symmetry
Find all subgroups of the Klein 4- Group. How many are there?
Congruence Classes Z n = {[0] n, [1] n, [2] n, …, [n - 1] n } = the set of congruence classes modulo n.
2. Groups Basic Definitions Covering Operations Symmetric Groups
MATH10001 Project 2 Groups part 1 ugstudies/units/ /level1/MATH10001/
Properties of Real Numbers. Closure Property Commutative Property.
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.
1 Crystallographic Point Groups Elizabeth Mojarro Senior Colloquium April 8, 2010.
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.
General linear groups, Permutation groups & representation theory.
Permutation Groups Part 1. Definition A permutation of a set A is a function from A to A that is both one to one and onto.
17. Group Theory 1.Introduction to Group Theory 2.Representation of Groups 3.Symmetry & Physics 4.Discrete Groups 5.Direct Products 6.Symmetric Groups.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Chapter 6: Isomorphisms
6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation(denoted · such that.
Properties of Real Numbers List of Properties of Real Numbers Commutative Associative Distributive Identity Inverse.
Chapter 5: Permutation Groups  Definitions and Notations  Cycle Notation  Properties of Permutations.
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 Lecture 7: Finish Section 7 Sections 8.
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems.
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
Jeanine “Joni” Pinkney Central Washington University
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
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.
 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.
Great Theoretical Ideas in Computer Science.
6.6 Rings and fields Rings  Definition 21: A ring is an Abelian group [R, +] with an additional associative binary operation (denoted ·) such that.
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.
MTH376: Algebra For Master of Mathematics By Dr. M. Fazeel Anwar Assistant Professor Department of Mathematics, CIIT Islamabad 1.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
Chapter 7 Algebraic Structures
Finite Groups and Subgroups, Terminology
Group.
CS480 Cryptography and Information Security
Properties of Operations
Math 3121 Abstract Algebra I
Groups and Applications
Great Theoretical Ideas In Computer Science
Math 3121 Abstract Algebra I
Math 3121 Abstract Algebra I
Math 344 Winter 07 Group Theory Part 1: Basic definitions and Theorems
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.
B.Sc. III Year Mr. Shrimangale G.W.
FIELD.
PHY 745 Group Theory 11-11:50 AM MWF Olin 102 Plan for Lecture 1:
For g2G2, (n)(N), g1G1 s.t (g1)=g2 ? surjection homomorphism.
3. Group Representations
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
WELCOME.
3. Group Representations
Presentation transcript:

DR. MOHD AKHLAQ ASSISTANT PROFESSOR DEPARTMENT OF MATHEMATICS GOVT. P DR. MOHD AKHLAQ ASSISTANT PROFESSOR DEPARTMENT OF MATHEMATICS GOVT. P. G. COLLEGE RAJOURI (J & k)

2.1 Basic Definitions and Simple Examples Definition 2.1: Group { G, • } is a group if  a , b , c Î G 1. a • b ÎG ( closure ) 2. ( a • b ) • c = a • ( b • c ) ( associativity ) 3. $ e Î G ' e • a = a • e = a ( identity ) 4. $ a–1 Î G ' a–1 • a = a • a–1 = e ( inverse ) Definition in terms of multiplication table (abstract group): G e a b  e • e e • a e • b a • e a • a a • b b • e b • a b • b   e a b  a • a a • b b • a b • b  

C1 e Realizations: {e} = { 1 } Example 1: C1 Realizations: {e,a} = { 1, –1} Reflection group: C = { E, σ } Rotation group: C2 = { E, C2 } e a Example 2: C2 Cn = Rotation of angle 2π/n e a b Realizations: Rotation group: C3 = { E, C3 , C3–1 } Cyclic group: C3 = { e, a, a2 ; a3=e } { 1, e i 2π/3, e i 4π/3 } Cyclic permutation of 3 objects { (123), (231), (312) } Example 3: C3 Cyclic group : Cn = { e, a, a2, a3, … an-1 ; an = e }

Definition 2.2: Abelian (commutative) Group G is Abelian if a b = b a  a,b  G Common notations: • → + e → 0 Definition 2.3: Order Order g of group G = Number of elements in G Example 4: Dihedral group D2 Simplest non-cyclic group is D2 = { e, a = a–1, b = b–1, c = a b } ( Abelian, order = 4 ) e a b c Realizations: D2 = { symmetries of a rectangle } = { E , C2, σx, σy } = { E, C2 , C2' , C2" }

Definition 2.4: Subgroup { H  G, • } is a subgroup of { G , • } . Example 1: D2 = { e, a, b, c } 3 subgroups: { e, a }, { e, b } , { e, c } Example 2: D3  S3  { e, a, b = a–1, c = c–1, d = d–1, f = f–1 } 4 subgroups: { e, a, b } , { e, c }, { e, d }, { e, f }

Example 1: C3 = { e, a, b = a2 ; a3=e } = { g1, g2, g3 } C3  { e, (123), (321) }, subgroup of S3 e a b c 1 2 3 4 Example 2: D2 = { e, a = a–1, b = b–1, c = a b } D2  { e, (12)(34), (13)(24), (14)(23) }, subgroup of S4

2.6 Homomorphisms Definition 2.11: Homomorphism G is homomorphic to G' ( G ~ G' ) if  a group structure preserving mapping from G to G', i.e.   : G  G' g  g' = (g)  a b = c  a' b' = c' Isomomorphism:  is invertible ( 1-1 onto ). Example: : S3  C2 with (e) = [(123)] = [(321)] = e [(23)] = [(31)] = [(12)] = a is a homorphism S3 ~ C2.

Theorem 2.5: Let : G  G' be a homomorphism and Kernel = K = { g | (g) = e' } Then K is an invariant subgroup of G and G/K  G' Proof 1 ( K is a subgroup of G ):  is a homomorphism:  a, b  K  (ab) = (a) (b) = e' e' = e'  ab  K (closure) (ae) = (a) (e) = e' (e) = (e) = (a) = e'  (e) = e'  e  K (identity) (a–1a) = (a–1 ) ( a) = (a–1 ) e' = (a–1 ) = (e) = e'  a–1  K (inverse) Associativity is automatic. QED

Kernel G/K  G'