


Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Material Type: Notes; Professor: Huang; Class: INTRODUCTION TO ABSTRACT ALGEBRA I; Subject: Mathematics; University: Auburn University - Main Campus; Term: Unknown 1989;
Typology: Study notes
1 / 4
This page cannot be seen from the preview
Don't miss anything!



Isomorphism is a bijection between groups that satisfies the homomor- phism property. If we have an isomorphism φ : G → G′^ and we know the structure of G, then the structure of G′^ is just the same as G. More powerful tools are needed to study the structures of groups. Def 3.1. A Homomorphism is a map between groups (not necessary a bijection) that satisfies the homomorphism property: φ : G → G′, φ(ab) = φ(a)φ(b) for all a, b ∈ G. How homomorphisms preserve group structures? See the examples. Ex 3.2. Let φ : G → G′^ be defined by φ(g) = e′^ for g ∈ G, where e′^ is the identity of G′. Then φ is a trivial homomorphism. Ex 3.3. If H ≤ G, then τ : H → G defined by τ (h) := h for h ∈ H is a group homomorphism. Ex 3.4. A linear transformation φ : V → W between real vector spaces V and W is a homomorphism of abelian groups V and W. Ex 3.5 (Ex 13.2, p.126). 1 Let φ : G → G′^ be a group homomorphism of G onto G′^ (i.e. surjective). If G is abelian then so is G′. (^1) 1st HW: 2, 4, 6, 8, 10, 49 35
Ex 3.6. Let φ : G → G′^ be a group homomorphism, then φ(g−^1 ) = φ(g)−^1. Ex 3.7 (Ex 13.3, p.126). Let φ : Sn → Z 2 be defined by
φ(σ) :=
{ 0 , if σ is an even permutation, 1 , if σ is an odd permutation. Then φ is a homomorphism. Ex 3.8 (Ex 13.4, p.126, Evaluation Homomorphism). Let F be the additive group of all functions mapping R into R. For c ∈ R, the map φc : F → R defined by φc(f ) := f (c) is a homomorphism between 〈F, +〉 and 〈R, +〉, called the evaluation homomorphism (at c). Ex 3.9 (det). The determinant map of nonsingular n × n matrices det : GL(n, R) → R∗ is a homomorphism between 〈GL(n, R), ·〉 and 〈R∗, ·〉. Ex 3.10 (Ex 13.8 p.127, Hw 7 p.133). Let G = G 1 × G 2 × · · · × Gn be the direct product of groups. Let i = 1, 2 , · · · , n.
Thm 3.17. 3 Let φ : G → G′^ be a group homomorphism. Let H := ker(φ). Then for every a ∈ G, the inverse image of φ(a) is
φ−^1 [{φ(a)}] := {x ∈ G | φ(x) = φ(a)} = aH = Ha.
Ex 3.18 (Ex 13.17 p.131). Differentiation operation is a group homomor- phism. The kernel and the inverse image of x^2. Cor 3.19. A group homomorphism φ : G → G′^ is a one-to-one map if and only if ker(φ) = {e}. (Recall that φ is onto if and only if φ[G] = G′). Def 3.20. A subgroup H of G is normal if gH = Hg for all g ∈ G. Ex 3.21. If G is abelian, then every subgroup H of G is normal. Cor 3.22. If φ : G → G′^ is a group homomorphism, then ker(φ) is a normal subgroup. Proof. Let H := ker(φ). By Thm 3.17, aH = Ha for all a ∈ G. So H is normal.
1st: 2, 4, 6, 8, 10, 49 2nd: 18, 21, 29, 44, 45 3rd: 32 , 35, 36, 51, 52, opt: 46, 50, 55.
(^3) 2nd HW: 18, 21, 29, 44, 45