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.

Slides:



Advertisements
Similar presentations
Cayley’s Theorem & Automorphisms (10/16) Cayley’s Theorem. Every group is isomorphic to some permutation group. This says that in some sense permutation.
Advertisements

8.2 Kernel And Range.
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.
Even and Odd Permutations (10/2) Theorem. Every cycle, and hence every permutation, can be written as product of (usually non-disjoint) 2-cycles. Example.
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.
Subdirect Products of M* Groups Coy L. May and Jay Zimmerman We are interested in groups acting as motions of compact surfaces, with and without boundary.
Classification of Groups of Order 24
Group THeory Bingo You must write the slide number on the clue to get credit.
I. Homomorphisms & Isomorphisms II. Computing Linear Maps III. Matrix Operations VI. Change of Basis V. Projection Topics: Line of Best Fit Geometry of.
3.II. Homomorphisms 3.II.1. Definition 3.II.2. Range Space and Nullspace.
Coordinate Systems (11/4/05) It turns out that every vector space V which has a finite basis can be “realized” as one of the spaces R n as soon as we pick.
I. Isomorphisms II. Homomorphisms III. Computing Linear Maps IV. Matrix Operations V. Change of Basis VI. Projection Topics: Line of Best Fit Geometry.
MTH-376 Algebra Lecture 1. Instructor: Dr. Muhammad Fazeel Anwar Assistant Professor Department of Mathematics COMSATS Institute of Information Technology.
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,
External Direct Products (11/4) Definition. If G 1, G 2,..., G n are groups, then their external direct product G 1  G 2 ...  G n is simply the set.
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.
Chapter 6: Isomorphisms
Test Corrections You may correct the in-class portion of your test. You will get back 1/2 of the points you lost if you submit correct answers. This work.
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.
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.
Math 3121 Abstract Algebra I
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.
 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.
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
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.
Perfect Numbers (3/26) Definition. A number is called perfect if it is equal to the sum of its proper divisors. Examples: 6 and 28 are the first two (check!).
Math 3121 Abstract Algebra I
Chapter 5 Limits and Continuity.
Garis-garis Besar Perkuliahan
Unit-III Algebraic Structures
Group.
6.6.4 Subring, Ideal and Quotient ring
Abstract Algebra I.
Math 3121 Abstract Algebra I
Groups and Applications
Great Theoretical Ideas In Computer Science
Chapter 2 Sets and Functions.
Chapter 4: Cyclic Groups
Math 3121 Abstract Algebra I
Math 3121 Abstract Algebra I
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Chapter 8: External Direct Product
Let H be a normal subgroup of G, and let G/H={Hg|gG}
Theorem 6.29: Any Field is an integral domain
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.
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Chapter 3: Simplicial Homology Instructor: Yusu Wang
DR. MOHD AKHLAQ ASSISTANT PROFESSOR DEPARTMENT OF MATHEMATICS GOVT. P
A mapping that preserves algebraic structure
Presentation transcript:

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 a, b in G, (a b) = (a) (b). Example. Every isomorphism is automatically a homomorphism, but not conversely. Is : R*  R* given by (x) = x2 a homomorphism? Is it an automorphism? Is : R+  R+ given by (x) = x2 a homomorphism? Is it an automorphism? Is : R  R given by (x) = x2 a homomorphism? Note that for any pair of groups G and G’, there is always at least homomorphism between them. What is it?

Kernels and Images Definition. The kernel of a homomorphism : G  G’, denoted Ker , is {a  G| (a) = e’} , where e’ is the identity of G’. Theorem. Ker  is a normal subgroup of G. Proof. You did it (right?) on the hand-in. Definition. The image of , denoted (G) is {c  G’| (a) = c for some a  G}. Theorem. (G) is a subgroup of G’. Proof?? If  is an isomorphism from G to G’, then Ker  = ??? and (G) = ???

A Handy Theorem and Corollaries Theorem. If (a) = c, then {x  G| (x) = c} is exactly the coset a Ker . Proof. (How do we show two sets are equal?) Corollary. If |Ker | = k, then  is a k to 1 function. Corollary. If G is finite and if H  G, |(H)| = |H| / |Ker |. Corollary. If G and G’ are both finite, then |(G)| divides both |G| and |G’|. Example. How many homomorphisms are there from Z4 to Z3? What are they exactly? Example. How many homomorphisms are there from Z4 to Z2? What are they exactly? Example. How many homomorphisms are there from Z4 to Z6? What are they exactly?

More Examples and Assignment Example. How many homomorphisms are there from D5 to Z10? What are they exactly? Example. How many homomorphisms are there from D4 to Z7? What are they exactly? Example. How many homomorphisms are there from D4 to Z8? What are they exactly? For Friday, please read Chapter 10 to page 214 and do Exercises 1-5, 9, 14, 15, 16, 19.