Section 34 Isomorphism theorems Instructor: Yifan Yang Fall 2006 - - PowerPoint PPT Presentation

section 34 isomorphism theorems
SMART_READER_LITE
LIVE PREVIEW

Section 34 Isomorphism theorems Instructor: Yifan Yang Fall 2006 - - PowerPoint PPT Presentation

Section 34 Isomorphism theorems Instructor: Yifan Yang Fall 2006 Instructor: Yifan Yang Section 34 Isomorphism theorems First isomorphism theorem Theorem (34.2, First isomorphism theorem) Let : G G be a homomorphism with


slide-1
SLIDE 1

Section 34 – Isomorphism theorems

Instructor: Yifan Yang Fall 2006

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-2
SLIDE 2

First isomorphism theorem

Theorem (34.2, First isomorphism theorem) Let φ : G → G′ be a homomorphism with kernel K. Then G/K ≃ φ[G], and a canonical isomorphism is µ : G/K → φ[G] defined by µ(gK) = φ(g). Proof. See Theorem 14.11.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-3
SLIDE 3

First isomorphism theorem

Theorem (34.2, First isomorphism theorem) Let φ : G → G′ be a homomorphism with kernel K. Then G/K ≃ φ[G], and a canonical isomorphism is µ : G/K → φ[G] defined by µ(gK) = φ(g). Proof. See Theorem 14.11.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-4
SLIDE 4

Join of two subgroups

Definition Let H and N be subgroups of a group G. The join H ∨ N of H and N is the smallest subgroup of G that contains both H and

  • N. Equivalently, H ∨ N is the intersection of all subgroups of G

containing H and N. Lemma (34.4) If N is a normal subgroup of G, and H is any subgroup of G, then H ∨ N = {hn : h ∈ H, n ∈ N} = {nh : n ∈ N, h ∈ H}. Remark If neither H nor N is normal in G, then HN may not be a subgroup at all. For example, let G = S3, H = {e, (1, 2)}, N = {e, (1, 3)}. Then HN = {e, (1, 2), (1, 3), (1, 3, 2)}, which is not a subgroup.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-5
SLIDE 5

Join of two subgroups

Definition Let H and N be subgroups of a group G. The join H ∨ N of H and N is the smallest subgroup of G that contains both H and

  • N. Equivalently, H ∨ N is the intersection of all subgroups of G

containing H and N. Lemma (34.4) If N is a normal subgroup of G, and H is any subgroup of G, then H ∨ N = {hn : h ∈ H, n ∈ N} = {nh : n ∈ N, h ∈ H}. Remark If neither H nor N is normal in G, then HN may not be a subgroup at all. For example, let G = S3, H = {e, (1, 2)}, N = {e, (1, 3)}. Then HN = {e, (1, 2), (1, 3), (1, 3, 2)}, which is not a subgroup.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-6
SLIDE 6

Join of two subgroups

Definition Let H and N be subgroups of a group G. The join H ∨ N of H and N is the smallest subgroup of G that contains both H and

  • N. Equivalently, H ∨ N is the intersection of all subgroups of G

containing H and N. Lemma (34.4) If N is a normal subgroup of G, and H is any subgroup of G, then H ∨ N = {hn : h ∈ H, n ∈ N} = {nh : n ∈ N, h ∈ H}. Remark If neither H nor N is normal in G, then HN may not be a subgroup at all. For example, let G = S3, H = {e, (1, 2)}, N = {e, (1, 3)}. Then HN = {e, (1, 2), (1, 3), (1, 3, 2)}, which is not a subgroup.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-7
SLIDE 7

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-8
SLIDE 8

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-9
SLIDE 9

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-10
SLIDE 10

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-11
SLIDE 11

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-12
SLIDE 12

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-13
SLIDE 13

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-14
SLIDE 14

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-15
SLIDE 15

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-16
SLIDE 16

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-17
SLIDE 17

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-18
SLIDE 18

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-19
SLIDE 19

Proof of Lemma 34.4

Let HN denote the set {hn : h ∈ H, n ∈ N}. We first prove that HN is a subgroup of G.

1

Closed: Let h1n1, h2n2 ∈ HN. Since N is a normal subgroup, h−1

2 n1h2 ∈ N, i.e., n1h2 = h2n3 for some n3 ∈ N.

Then h1n1h2n2 = h1h2n3n2 ∈ HN.

2

Identity: This is obvious.

3

Inverse: Let hn ∈ HN. We have (hn)−1 = n−1h−1. Again, since n is normal, n−1h−1 = h−1n1 for some n1 ∈ N. Thus, (hn)−1 ∈ HN. Now HN is a subgroup and clearly contains both H and N. Thus H ∨ N ⊂ HN. On the other hand, any subgroup containing both H and N must also contain all elements of the form hn, h ∈ H, n ∈ N. In particular, we have HN ⊂ H ∨ N. We conclude that H ∨ N = HN.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-20
SLIDE 20

Second isomorphism theorem

Theorem (Second isomorphism theorem) Let H be a subgroup of G and N be a normal subgroup of G. Then (HN)/N ≃ H/(H ∩ N). Proof. Define a function φ : H → (HN)/N by φ(h) = hN. We claim

1

φ is a homomorphism: This is clear.

2

Ker(φ) = H ∩ N: If h ∈ Ker(φ), then hN = N and thus h ∈ N. Because h is also in H, we find h ∈ H ∩ N. Conversely, every element of H ∩ N is in the kernel. Thus Ker(φ) = H ∩ N.

3

Im(φ) = (HN)/N: Given a = hn ∈ HN, we have aN = (hn)N = hN. Then aN = φ(h). Thus φ is onto. Then by the first isomorphism theorem H/(H ∩ N) ≃ (HN)/N.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-21
SLIDE 21

Second isomorphism theorem

Theorem (Second isomorphism theorem) Let H be a subgroup of G and N be a normal subgroup of G. Then (HN)/N ≃ H/(H ∩ N). Proof. Define a function φ : H → (HN)/N by φ(h) = hN. We claim

1

φ is a homomorphism: This is clear.

2

Ker(φ) = H ∩ N: If h ∈ Ker(φ), then hN = N and thus h ∈ N. Because h is also in H, we find h ∈ H ∩ N. Conversely, every element of H ∩ N is in the kernel. Thus Ker(φ) = H ∩ N.

3

Im(φ) = (HN)/N: Given a = hn ∈ HN, we have aN = (hn)N = hN. Then aN = φ(h). Thus φ is onto. Then by the first isomorphism theorem H/(H ∩ N) ≃ (HN)/N.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-22
SLIDE 22

Second isomorphism theorem

Theorem (Second isomorphism theorem) Let H be a subgroup of G and N be a normal subgroup of G. Then (HN)/N ≃ H/(H ∩ N). Proof. Define a function φ : H → (HN)/N by φ(h) = hN. We claim

1

φ is a homomorphism: This is clear.

2

Ker(φ) = H ∩ N: If h ∈ Ker(φ), then hN = N and thus h ∈ N. Because h is also in H, we find h ∈ H ∩ N. Conversely, every element of H ∩ N is in the kernel. Thus Ker(φ) = H ∩ N.

3

Im(φ) = (HN)/N: Given a = hn ∈ HN, we have aN = (hn)N = hN. Then aN = φ(h). Thus φ is onto. Then by the first isomorphism theorem H/(H ∩ N) ≃ (HN)/N.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-23
SLIDE 23

Second isomorphism theorem

Theorem (Second isomorphism theorem) Let H be a subgroup of G and N be a normal subgroup of G. Then (HN)/N ≃ H/(H ∩ N). Proof. Define a function φ : H → (HN)/N by φ(h) = hN. We claim

1

φ is a homomorphism: This is clear.

2

Ker(φ) = H ∩ N: If h ∈ Ker(φ), then hN = N and thus h ∈ N. Because h is also in H, we find h ∈ H ∩ N. Conversely, every element of H ∩ N is in the kernel. Thus Ker(φ) = H ∩ N.

3

Im(φ) = (HN)/N: Given a = hn ∈ HN, we have aN = (hn)N = hN. Then aN = φ(h). Thus φ is onto. Then by the first isomorphism theorem H/(H ∩ N) ≃ (HN)/N.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-24
SLIDE 24

Second isomorphism theorem

Theorem (Second isomorphism theorem) Let H be a subgroup of G and N be a normal subgroup of G. Then (HN)/N ≃ H/(H ∩ N). Proof. Define a function φ : H → (HN)/N by φ(h) = hN. We claim

1

φ is a homomorphism: This is clear.

2

Ker(φ) = H ∩ N: If h ∈ Ker(φ), then hN = N and thus h ∈ N. Because h is also in H, we find h ∈ H ∩ N. Conversely, every element of H ∩ N is in the kernel. Thus Ker(φ) = H ∩ N.

3

Im(φ) = (HN)/N: Given a = hn ∈ HN, we have aN = (hn)N = hN. Then aN = φ(h). Thus φ is onto. Then by the first isomorphism theorem H/(H ∩ N) ≃ (HN)/N.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-25
SLIDE 25

Second isomorphism theorem

Theorem (Second isomorphism theorem) Let H be a subgroup of G and N be a normal subgroup of G. Then (HN)/N ≃ H/(H ∩ N). Proof. Define a function φ : H → (HN)/N by φ(h) = hN. We claim

1

φ is a homomorphism: This is clear.

2

Ker(φ) = H ∩ N: If h ∈ Ker(φ), then hN = N and thus h ∈ N. Because h is also in H, we find h ∈ H ∩ N. Conversely, every element of H ∩ N is in the kernel. Thus Ker(φ) = H ∩ N.

3

Im(φ) = (HN)/N: Given a = hn ∈ HN, we have aN = (hn)N = hN. Then aN = φ(h). Thus φ is onto. Then by the first isomorphism theorem H/(H ∩ N) ≃ (HN)/N.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-26
SLIDE 26

Second isomorphism theorem

Theorem (Second isomorphism theorem) Let H be a subgroup of G and N be a normal subgroup of G. Then (HN)/N ≃ H/(H ∩ N). Proof. Define a function φ : H → (HN)/N by φ(h) = hN. We claim

1

φ is a homomorphism: This is clear.

2

Ker(φ) = H ∩ N: If h ∈ Ker(φ), then hN = N and thus h ∈ N. Because h is also in H, we find h ∈ H ∩ N. Conversely, every element of H ∩ N is in the kernel. Thus Ker(φ) = H ∩ N.

3

Im(φ) = (HN)/N: Given a = hn ∈ HN, we have aN = (hn)N = hN. Then aN = φ(h). Thus φ is onto. Then by the first isomorphism theorem H/(H ∩ N) ≃ (HN)/N.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-27
SLIDE 27

Second isomorphism theorem

Theorem (Second isomorphism theorem) Let H be a subgroup of G and N be a normal subgroup of G. Then (HN)/N ≃ H/(H ∩ N). Proof. Define a function φ : H → (HN)/N by φ(h) = hN. We claim

1

φ is a homomorphism: This is clear.

2

Ker(φ) = H ∩ N: If h ∈ Ker(φ), then hN = N and thus h ∈ N. Because h is also in H, we find h ∈ H ∩ N. Conversely, every element of H ∩ N is in the kernel. Thus Ker(φ) = H ∩ N.

3

Im(φ) = (HN)/N: Given a = hn ∈ HN, we have aN = (hn)N = hN. Then aN = φ(h). Thus φ is onto. Then by the first isomorphism theorem H/(H ∩ N) ≃ (HN)/N.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-28
SLIDE 28

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-29
SLIDE 29

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-30
SLIDE 30

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-31
SLIDE 31

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-32
SLIDE 32

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-33
SLIDE 33

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-34
SLIDE 34

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-35
SLIDE 35

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-36
SLIDE 36

Third isomorphism theorem

Theorem (Third isomorphism theorem) Let H and K be normal subgroup of G with K ≤ H. Then G/H ≃ (G/K)/(H/K). Proof. Define φ : G/K → G/H by φ(gK) = gH. We claim

1

φ is well-defined: Suppose that g1K = g2K. Then g−1

1 g2 ∈ K. Since K ⊂ H, g−1 1 g2 ∈ H and thus g1H = g2H.

2

φ is a homomorphism: Easy.

3

Ker(φ) = H/K: Suppose that gK ∈ Ker(φ). Then gH = H. That is, g ∈ H and gK ∈ H/K.

4

Im(φ) = G/H: For all gH ∈ G/H, we have gH = φ(gK). Thus, φ is onto. Then by the first isomorphism theorem, (G/K)/(H/K) ≃ G/H.

Instructor: Yifan Yang Section 34 – Isomorphism theorems

slide-37
SLIDE 37

Homework

Problems 2, 4, 6, 7, 8, 9 of Section 34.

Instructor: Yifan Yang Section 34 – Isomorphism theorems