18 views

Uploaded by Sean Li

Notes from lecture. Cornell University, Spring 2013.

- Math 4340-Lecture 11
- Math 4340-Lecture 18
- Math 6710 Lec 01
- Math 4340-Lecture 2
- Math 4340-Lecture 4
- Math 4340-Lecture 15
- Math 4340-Lecture 24
- Math 4340-Lecture 19
- Math 4340-Lecture 1
- Math 4340-Lecture 17
- Math 4340-Lecture 3
- Math 4340-Lecture 20
- Math 7370-Lecture 22
- Math 7370-Lecture 24
- Math 4340-Lecture 24
- Math 4340-Lecture 19
- Math-6170-Lec-01
- Math 7370-Lecture 18
- Math 7370-Lecture 23
- Math 7370-Lecture 19

You are on page 1of 2

em last time. Note. HK denotes the set {hk|h H, k K}. If H, K are subgroups of G, it doesnt follow that HK is a subgroup. Note that in general (h1 k1 )(h2 k2 ) is not in HK. However, if one of H or K is normal, say K G, then HK is closed under multiplication. Second Isomorphism Theorem. Given subgroups H, K of G, K G, there is a natural isomorphism H/(H K) HK/K induced by the natural map : H HK/K, where h hK. Proof. First, is surjective, as an element of HK/K can be written (hk)K = hK, so hK = (h) by denition of . Secondly, ker = {h|(h) = K}, so (h) = e hK = K = h K h H K. So by the rst isomorphism theorem, we get H/(H K) HK/K. Third Isomorphism Theorem. Let H, K be normal subgroups of G. Suppose K Then G/H = (G/K)/(H/K). H.

Proof. There is a natural map : G G/H that is surjective and has kernel H, given by (x) = xH. Given a homomorphism f : G K, and H = ker f , H G, there exists an isomorphism f : G/H K. 1

G/K 2

(G/K)/(H/K)

Note that f is surjective because 1 , 2 are surjective. What about ker f ? Note that x ker f 1 (x) ker 2 . But ker 2 = H/K. But (x) = hK xK = hK x H. Therefore, ker f = H, so by the rst isomorphism theorem, we get G/H (G/K)/(H/K).

Fourth Theorem. Given the natural surjection : G G/K, K G, there is a natural bijection between the set of subgroups of G and the set of subgroups of G/K given by H H. Cyclic Groups. A group C is cyclic if there exists x C such that every element is a power of x. Can write C = (x), where C = {xn |n Z}. If C is nite with n elements then we write Cn (also Zn ). In Z, an innite cycle, the generators are 1 and 1.

Page 2

- Math 4340-Lecture 11Uploaded bySean Li
- Math 4340-Lecture 18Uploaded bySean Li
- Math 6710 Lec 01Uploaded bySean Li
- Math 4340-Lecture 2Uploaded bySean Li
- Math 4340-Lecture 4Uploaded bySean Li
- Math 4340-Lecture 15Uploaded bySean Li
- Math 4340-Lecture 24Uploaded bySean Li
- Math 4340-Lecture 19Uploaded bySean Li
- Math 4340-Lecture 1Uploaded bySean Li
- Math 4340-Lecture 17Uploaded bySean Li
- Math 4340-Lecture 3Uploaded bySean Li
- Math 4340-Lecture 20Uploaded bySean Li

- Math 7370-Lecture 22Uploaded bySean Li
- Math 7370-Lecture 24Uploaded bySean Li
- Math 4340-Lecture 24Uploaded bySean Li
- Math 4340-Lecture 19Uploaded bySean Li
- Math-6170-Lec-01Uploaded bySean Li
- Math 7370-Lecture 18Uploaded bySean Li
- Math 7370-Lecture 23Uploaded bySean Li
- Math 7370-Lecture 19Uploaded bySean Li
- Math 6210 Lec 01Uploaded bySean Li
- Math 7370-Lecture 20Uploaded bySean Li
- Math 7370-Lecture 21Uploaded bySean Li
- Math 4340-Lecture 20Uploaded bySean Li
- Math 7370-Lecture 13Uploaded bySean Li
- Math 4340-Lecture 14Uploaded bySean Li
- CS 4820-Lecture 18Uploaded bySean Li
- Math 7370-Lecture 16Uploaded bySean Li
- CS 4820-Lecture 15Uploaded bySean Li
- Math 7370-Lecture 15Uploaded bySean Li
- CS 4820-Lecture 16Uploaded bySean Li
- Math 7370-Lecture 17Uploaded bySean Li
- Math 4340-Lecture 17Uploaded bySean Li
- Math 7370-Lecture 14Uploaded bySean Li
- CS 4820-Lecture 17Uploaded bySean Li
- Math 4340-Lecture 15Uploaded bySean Li
- CS 4820-Lecture 14Uploaded bySean Li