<<

NOTES ON MATH 571 (ABSTRACT ALGEBRA), CHAPTER III: GROUPS AND

LI LI

3.1 Definitions and examples Start from the example Z → Z/nZ, point out the difference to the notion of a : there is no nontrivial Z/nZ → Z. Explain the notion “fiber”. Proposition 1. Let ϕ : G → H be a homomorphism of groups. (1) ϕ(1G) = 1H . (2) ϕ(g−1) = ϕ(g)−1 for all g ∈ G. n n (3) ϕ(g ) = ϕ(g) for all g ∈ G, n ∈ Z. (4) kerϕ is a subgroup of G. (5) imϕ is a subgroup of H. Definition 2. Let ϕ : G → H be a homomorphism with K. The quotient or factor group, G/K, is the group whose elements are the fibers of ϕ, and the group operation is: if X = ϕ−1(a) and Y = ϕ−1(b), then XY is defined to be ϕ−1(ab). Remark. G/K is “the same” as imϕ. Definition 3. For N ≤ G and g ∈ G, define gN = {gn|n ∈ N}, Ng = {ng|n ∈ N} called a left and a right coset of N in G. Any element in a coset is called a representative. Remark. For additive group, are written as g + N or N + g. Proposition 4. Let ϕ : G → H be a and K be the kernel. Let a be an element in imϕ and X = ϕ−1(a). Then (1) For any u ∈ X, X = uK. (2) For any u ∈ X, X = Ku. Remark. uK = Ku, i.e. uKu−1 = K. Definition 5. The element gng−1 is called the conjugate of of n by g. The set gNg−1 is called the conjugate of N by g. The element g is said to normalize N if gNg−1 = N. −1 A subgroup N of a group G is normal, denoted by N E G, if gNg = N for all a ∈ G. 1 2 LI LI

Kernel of a group homomorphism is a . On the other hand, we can always find a group homomorphism whose kernel is a pre- scribed normal subgroup. To see that, let us first be familiar with several equivalent descriptions of a normal subgroup. Theorem 6. Let N be a subgroup of G. TFAE (1) N E G (2) NG(N) = G (3) gN = Ng for all g ∈ N (4) the operation on left cosets defined by uN · vN = uvN makes the set of left cosets into a group (5) gNg−1 ⊆ N for all g ∈ N Proposition 7. A subgroup N of G is normal iff it is the kernel of some homomorphism. Exercise on class: × × 2 2 Example. Define C → R by ϕ(a+bi) = a +b . Show that ϕ is a and find the of ϕ. Describe the kernel and fibers of ϕ geometrically. Example. Any subgroup of an is normal. Example. The of a group is normal. Example. Show that any of a are cyclic.

Example. h(123)i E S3.

Example. Let D2n be the . (1) Prove that hri is a normal subgroup of D2n and describe D2n/hri. ∼ (= Z/2Z.) k ∼ k (2) Let k|n, describe D2n/hr i.(= D2k. Construct the map D2n/hr i → D2k, show it is a group .) 3.2 More on cosets and Lagrange’s Theorem Recall Lagrange’s Theorem. If H ≤ G, the number of left coset of H in G is |G|/|H|. (also recall the proof: |gH| = |H|, and G is partitioned into disjoint subsets, each of which has n elements.) Definition 8. Given H ≤ G, the number of left cosets of H in G is called the index of H in G, denoted by |G : H|. Example. |Z : 2Z| = 2. Two consequence of Lagrange’s Theorem: Corollary 9. If G is a finite group and x ∈ G, the of x divides the order of G. (Consider the subgroup hxi.) ∼ Corollary 10. If |G| = p is prime, then G = Z/pZ. NOTES ON MATH 571 (ABSTRACT ALGEBRA), CHAPTER III: QUOTIENT GROUPS AND HOMOMORPHISMS3

The reverse of Lagrange’s theorem is not true in general, but we have the following two theorem, whose proof will be postponed. Theorem 11. (Cauchy’s theorem) If G is a finite group and p is a prime number dividing |G|. Then G has an element of order p. Theorem 12. (Sylow) If G is a finite group of order pαm, where p is a prime and pP does not divide m, then G has a subgroup of order pα. Now we mention some important facts involving cosets. Definition 13. Given H,K of a given group, define HK = {hk|h ∈ H, k ∈ K}. Remark. HK may not be a subgroup. It is a subgroup iff HK = KH. Proposition 14. If H an K are subgroups of a group, HK is a subgroup iff HK = KH. (Two directions. “⇐” can be verified by subgroup criterion. “⇒”: to show KH ⊆ HK is straightforward; to show HK ⊂ KH we use a trick. −1 Take hk ∈ HK, write hk = (h1k1) .)

Corollary 15. If H and K are subgroups of G and H ≤ NG(K), then HK is a subgroup of G. ( Since any h ∈ H commutes with K, the subgroup H commutes with K. THen by the above proposition HK is a subgroup.)

Example. Fermat’s Little Theorem: if p is a prime then ap = a(mod p) for all a ∈ Z. Proposition 16. If H and K are finite subgroups of a group, then |H||K| |HK| = . |H ∩ K|

(Decompose HK as union of hK. Show that h1K = h2K iff h1(H ∩K) = h2(H ∩ K). Therefore the number of distinct cosets of the form hK is equal to the number of cosets of H ∩ K in H.)

3.3 The

Theorem 17. (The first isomorphism theorem) If ϕ : G → H is a homo- ∼ morphism of groups. Then kerϕ E G and G/kerϕ = ϕ(G). (Recall the definition of quotient group. Each coset gK sends to ϕ(g). Then ϕ : G → ϕ(G) is a group homomorphism and is surjective. Then show it is injective.) Theorem 18. (The second isomorphism theorem) Let G be a group. Let A, B be subgroups of G and assume A ≤ NG(B). Then AB is a subgroup ∼ of G, B E AB, A ∩ B E A and AB/B = A/A ∩ B. 4 LI LI

(First point out A ≤ NG(B) implies AB = BA implies AB is a subgroup. Then draw the picture G

AB normal

A B

normal A ∩ B

1 −1 −1 Use abBb a = B to prove that B E AB. Construct the group homomorphism ϕ : A → AB/B by ϕ(a) = aB. Point out the group operation on AB/B is well defined since B is a normal subgroup of AB. It follows that ϕ is a group homomorphism. Surjectivity follows from definition of AB. Compute the kernel of ϕ, which is A ∩ B. Use First Isomorphism Theorem to complete the proof. ) Theorem 19. (The third isomorphism theorem) Let G be a group and let H,K be normal subgroups of G with H ≤ G. Then K/H E G/H and (G/H)/(K/H) = G/K. (It is an easy exercise that K/H is a normal subgroup of G/H. Then consider the map ϕ : G/H → G/K sending gH to gK. Show that this is well-defined, is a group homomorphism, and is surjective. Then find its kernel is K/H.)

3.4 Composition Series and the H¨olderProgram

Definition 20. A group is called simple if |G| > 1 and the only normal subgroup of G are 1 and G. For example, if |G| is prime, then G is simple. The smallest non-abelian is A5, which has order 60. Definition 21. In a group G, a of subgroups

1 = N0 ≤ N1 ≤ N2 ≤ · · · ≤ Nk−1 ≤ Nk = G is called a composition series if Ni E Ni+1 and Ni+1/Ni is a simple group for 0 ≤ i ≤ k − 1. If the above sequence is a composition series, the quotient groups Ni+1/Ni are called composition factors of G. NOTES ON MATH 571 (ABSTRACT ALGEBRA), CHAPTER III: QUOTIENT GROUPS AND HOMOMORPHISMS5

2 2 Example. 1 ≤ hsi ≤ hs, r i ≤ D8 and 1 ≤ hr i ≤ hri ≤ D8. Theorem 22. (Jordan-H¨older)Let G be a finite group with G 6= 1. Then (1) G has a composition series, and (2) The composition factors in a composition series are unique, namely, if 1 = N0 ≤ N1 ≤ · · · ≤ Nr = G 1 = M0 ≤ M1 ≤ · · · ≤ Ms = G are two composition series of G, then r = s and there is some permutation π of 1...r such that Mπ(i)/Mπ(i)−1 = Ni/Ni−1.