Math 3121 Abstract Algebra I Lecture 15 Sections 34-35.

Slides:



Advertisements
Similar presentations
Math 3121 Abstract Algebra I
Advertisements

DEFINITION Let f : A  B and let X  A and Y  B. The image (set) of X is f(X) = {y  B : y = f(x) for some x  X} and the inverse image of Y is f –1 (Y)
Math 3121 Abstract Algebra I Lecture 8 Sections 9 and 10.
1 In this lecture  Number Theory ● Rational numbers ● Divisibility  Proofs ● Direct proofs (cont.) ● Common mistakes in proofs ● Disproof by counterexample.
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.
Cayley Theorem Every group is isomorphic to a permutation group.
(CSC 102) Lecture 21 Discrete Structures. Previous Lecture Summery  Sum/Difference of Two Functions  Equality of Two Functions  One-to-One Function.
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.
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.
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.
Slides 09 1 Counting the Inhabitants of a Type Given a type , how many closed -terms in  - normal form can receive the type  in TA ? There exists an.
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}
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.
Foundations of Measurement Ch 3 & 4 April 4, 2011 presented by Tucker Lentz April 4, 2011 presented by Tucker Lentz.
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
ⅠIntroduction to Set Theory 1. Sets and Subsets
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
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.
SECTION 3 ISOMORPHIC BINARY STRUCTURES Definition Let  S,  and  S’,  ’  be binary algebraic structures. An isomorphism of S with S’ is a one-to-one.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Chapter 6: Isomorphisms
FUNCTIONS.
 Ⅰ 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
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/27/2009.
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
Math 3121 Abstract Algebra I Lecture 11 Finish Section 13 Section 14.
Chapter 6 Abstract algebra
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
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.
 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.
 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.
FUNCTIONS COSC-1321 Discrete Structures 1. Function. Definition Let X and Y be sets. A function f from X to Y is a relation from X to Y with the property.
Section 3.3 Proving set properties. Element-wise set proofs Claim. For all sets A and B, (A  B)  A. Proof. Let sets A and B be given. Since every element.
Functions – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Functions Reading: Kolman, Section 5.1.
 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,
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
Section 2.5. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers (Z + ) is called countable.
9.3 Geometric Sequences and Series. Common Ratio In the sequence 2, 10, 50, 250, 1250, ….. Find the common ratio.
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 Lecture 6 Midterm back over+Section 7.
Math 3121 Abstract Algebra I
Group.
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
Abstract Algebra I.
Math 3121 Abstract Algebra I
Math 3121 Abstract Algebra I
Math 3121 Abstract Algebra I
Sequences and Summations
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}
Definition 19: Let [H;. ] be a normal subgroup of the group [G;. ]
2. From Groups to Surfaces
Rayat Shikshan Sanstha’s S.M.Joshi College, Hadapsar -28
Presentation transcript:

Math 3121 Abstract Algebra I Lecture 15 Sections 34-35

HW Section 15 Hand in Nov 25: Pages 151: 4, 6, 8, 14, 35, 36 Don’t hand in: Pages 151-: 1, 3, 5, 7, 9, 13, 15, 39

HW Section 16 Don’t hand in Page 159-: 1, 2, 3

Section 34: Isomorphism Theorems First Isomorphism Theorem Second Isomorphism Theorem Third Isomorphism Theorem

First Isomorphism Theorem Theorem (First Isomorphism Theorem): Let φ: G  G’ be a group homomorphism with kernel K, and let  K : G  G/K be the canonical homomorphism. There is a unique isomorphism μ: G/K  φ[G] such that φ(x) = μ(  K (x)) for each x in G. Proof: Section 14

Lemma: If N is a normal subgroup of G and if H is any subgroup of G, then H N = N H is a is subgroup of G. Further, if H is normal in G, then H N is normal in G.

Second Isomorphism Theorem Theorem (Second Isomorphism Theorem): Let H be a subgroup of a group G, and let N be a normal subgroup of G. Then (H N)/N ≃ H/(H ∩ N). Proof: Let  N : G  G/N be the canonical isomorphism, and let H be a subgroup of G. Then  N [H] is a subgroup of G/N. We will show that both factor groups are isomorphic to  N [H]. Let α be the restriction of  N to H. We claim that the kernel of α is H ∩ N: α ( x ) = e ⇔ x in H and x in N. Thus Ker[ α] = H ∩ N. By the first isomorphism theorem, H/H ∩ N is isomorphic to  N [H]. Let β be the restriction of  N to H N. The kernel of β is N since N is contained in H N. We claim that the image of β is  N [H]: y= β(h) with h in H ⇔ y= β(h) e ⇔ y = β(h x) for all x in N. Thus β[H N] is  N [H]. By the first isomorphism theorem, H N / N is isomorphic to  N [H].

Example Given: G = Z × Z × Z H = Z × Z ×{0} N = {0} × Z × Z Then H N = Z × Z × Z H ∩ N = {0} × Z × {0} Thus H N/N = Z × Z × Z/ {0} × Z × Z ≃ Z H/H ∩ N = Z × Z ×{0}/ {0} × Z × {0} ≃ Z

Third Isomorphism Theorem Theorem (Third Isomorphism Theorem): Let H and K be normal subgroups of a group G, and let K is a subgroup of H. Then G/H ≃ (G/K)/(H/K). Proof: Let φ: G  (G/K)/(H/K) be defined by φ(x) = (x K)/(H/K), for x in G. φ(x) is onto. It is a homomorphism: φ(x y) = ((x y) K)/(H/K) = ((x K) (y K))/(H/K) = ((x K) ))/(H/K))((y K))/(H/K) ) = φ(x) φ(y) The kernel of φ is H. Thus G/H ≃ (G/K)/(H/K).

Example Given K = 6Z H = 2Z G = Z Then G/H = Z/2Z ≃ Z 2 G/K = Z/6Z ≃ Z 6 H/K = 2Z/6Z ≃ Z 3 = {0, 2, 4} in Z 6 (G/K)/(H/K)

Example Given G = Z H = n Z K = m n Z Then G/H = Z/n Z ≃ Z n G/K = Z/(n m Z) ≃ Z n m H/K = n Z/(n m) Z ≃ Z m = {0, n, 2n, 3n, …} in Z n m (G/K)/(H/K) ≃ Z n

HW for Section 34 Do Hand in (Due Dec 2): Pages : 2, 4, 7 Don’t hand in: Pages : 1, 3

Section 36: Series of Groups Subnormal and normal series Refinements of series Isomorphic series The Schreier theorem Zassenhaus lemma (butterfly) The Jordan-Holder Theorem

Subnormal and Normal Series Definition: A subnormal series of a group G is a finite sequence H 0, H 1, …, H n of subgroups of G such that each H i is a normal subgroup of H i+1. Definition: A normal series of a group G is a finite sequence H 0, H 1, …, H n of normal subgroups of G such that each H i is a subgroup of H i+1.

Examples Normal series of Z: {0} < 8 Z < 4 Z < Z {0} < 9 Z < Z Subnormal series of D 4 {ρ 0 } < {ρ 0, μ 1 } < {ρ 0, ρ 2, μ 1, μ 2 } < D 4

Refinement Definition: A subnormal (normal) series {K j } is a refinement of a subnormal (normal) series {H i } of a group G if {H i } is a subset of {K j }.

Example Normal series of Z: {0} < 8 Z < 4 Z < Z {0} < 9 Z < Z Have refinements {0} < 72 Z < 8 Z < 4 Z < Z {0} < 72 Z < 9 Z < Z

Isomorphic Series Definition: Two series {K j } and {H i } of a group G are isomorphic is there is a one-to-one correspondence between {K j+1 /K j } and {H i+1 /H i } such that corresponding factor groups are isomorphic.

Example Normal series of Z: {0} < 8 Z < 4 Z < Z {0} < 9 Z < Z Have refinements {0} < 72 Z < 8 Z < 4 Z < Z {0} < 72 Z < 9 Z < Z

Butterfly Lemma Lemma (Zassenhaus) Let H and K be subgroups of a group G and let H* and K* be normal subgroups of H and K, respectively. Then 1)H*(H ∩ K*) is a normal subgroup of H*(H ∩ K). 2)K*(H* ∩ K) is a normal subgroup of K*(H ∩ K ). 3)(H ∩ K*) (H* ∩ K) is a normal subgroup of H ∩ K. All three factor groups H*(H ∩ K)/H*(H ∩ K*), K*(H ∩ K )/ K*(H* ∩ K), and H ∩ K/ (H ∩ K*) (H* ∩ K) are isomorphic. Proof: See the book. Needs lemma 34.4

Picture of the Butterfly H*(H ∩ K) HK (H ∩ K) H* K* H*(H ∩ K*) K*(H* ∩ K) (H* ∩K)(H* ∩ K) H* ∩ K H ∩ K*

The Schreier Theorem Theorem: Two subnormal (normal) series of a group G have isomorphic refinements. Proof: in the book. Sketch: Form refinements and use the butterfly lemma. Define H i,j = H i (H i+1 ∩ K j ) refines H i K j,i = K j (H i ∩ K j+1 ) refines K j

Composition Series Definition: A subnormal series {H i } of a group G is a composition series if all the factor group H i+1 /H i are simple. Definition: A normal series {H i } of a group G is a principal or chief series if all the factor group H i+1 /H i are simple.

The Jordan-Holder Theorem Theorem (Jordan-Holder): Any two composition (principle) series of a group are isomorphic. Proof: Use Schreier since these are maximally refined.

HW on Section 35 Don’t hand in: Pages : 1, 3, 5, 7 Do hand in: Pages : 2, 4, 6, 8