Isomorphism Theorems

1st isomorphism theorem: if is a homomorphism of groups, then ker(f) and .

Proof: Let be a homomorphism that sends x ker(f) f(n). This is a well defined map because x ker(f) = y ker(y) f(x) = f(y). Let ker(f), then . It is a well defined homomorphism because (x ker(f) y ker(y)) = (xy ker(f)) = (x ker(f))(y ker(f)). Let . Then y = f(n) = (n ker(n)) so it is surjective. Note that ker so is injective. This completes the proof.

Remark: the size of the image is . If G is finite, and .

2nd isomorphism theorem: let and , then and

Proof: let be a map defined by . It is well defined because if then so . It is a homomorphism because . By definition HK is a subgroup, and we know that . To show that it is normal see that if and hence and it is normal. Im() = , ker( so K = ker(), which means K is normal. By the first isomorphism theorem (here K = ker()), completing the proof.

Note that if then we would have .

3rd isomorphism theorem: let G be a group and let H and K be normal subgroups of G with . Then and .

Proof: the proof that is left as an exercise to the reader. Let be a map defined by . Assume then for some . Since so which means so it is well defined. ker By the first isomorphism theorem