Definition N is a normal subgroup of G, written N⊴G, when ∀g∈G,gN=Ng. Note! This relation is not transitive.
Theorem Let φ:G→H be a group homomorphism, its kernel is a normal subgroup of G.
proof: Both gker(φ) and ker(φ)g are the set of all elements of G which get mapped to φ(g).
Definition Let N⊴G then G/N is the group of cosets of the form Ng.
Lemma GG=G. proof: gG=G.
Theorem (Noether(-1)) Let θ:G→K be a surjective homomorphism and H≤G (H⊴G) then θ(H)≤K (θ(H)⊴K).
Theorem Let φ:G→H be a group homomorphism, its kernel is a normal subgroup of G.
proof: Both gker(φ) and ker(φ)g are the set of all elements of G which get mapped to φ(g).
Definition Let N⊴G then G/N is the group of cosets of the form Ng.
Lemma GG=G. proof: gG=G.
Theorem (Noether(-1)) Let θ:G→K be a surjective homomorphism and H≤G (H⊴G) then θ(H)≤K (θ(H)⊴K).
proof: First part is easy, let's just show the bit about normality. H⊴G means (equivalent to the definition we gave) ∀g∈G,h∈H, g−1hg∈H. So let ∀k∈K,h∈θ(H), write these elements in the form k=θ(ˉk), h=θ(ˉh) now ˉg−1ˉhˉg∈H so applying the homomorphism we get k−1hk∈θ(H) proving θ(H)⊴K.
Theorem (Noether0) Let N⊴G then the natural map x↦Nx:G↦G/N is a surjective homomorphism with kernel N.
Lemma For H≤G (meaning a subgroup, not necessarily normal) then for g∈G, gH=H implies g∈H.
proof: Suppose not, then neither is g−1 so 1∉H, contradiction.
Theorem (Noether1a) Let φ be surjective, then H≃G/ker(φ).
proof: If gker(φ)=g′ker(φ) then φ(g)=φ(g′) because g−1g′∈ker(φ) so gker(φ)↦φ(g) is well defined and in fact it is a bijection because it's (clearly) surjective on a finite set.
Corollary (Noether1b) Let φ:G→H be any group homomorphism, then G/ker(φ)≃im(φ).
Lemma Let A and B be subgroups of G then A∩B is a subgroup of them both.
Theorem (Noether2) Let H≤G (just a subgroup) and N⊴G then N∩H⊴H and H/(N∩H)≃NH/N.
proof: Any x∈H may be considered an element of NH since 1∈N, so the map x↦Nx is an surjective homomorphism from H to NH/N with kernel N∩H.
Theorem (Noether3) Let M and N be normal subgroups of G and N≤M then N⊴M, M/N⊴G/N and (G/N)/(M/N)≃G/M.
proof: Define α:G/N→G/M by α(Nx)=Mx (this is well defined since if Nx=Nx′ then by M⊴G we get Mx=Mx′), the kernel is M/N so this must be a group which implies N⊴M because ???. As α is surjective we get the theorem.
Theorem (Noether0) Let N⊴G then the natural map x↦Nx:G↦G/N is a surjective homomorphism with kernel N.
Lemma For H≤G (meaning a subgroup, not necessarily normal) then for g∈G, gH=H implies g∈H.
proof: Suppose not, then neither is g−1 so 1∉H, contradiction.
Theorem (Noether1a) Let φ be surjective, then H≃G/ker(φ).
proof: If gker(φ)=g′ker(φ) then φ(g)=φ(g′) because g−1g′∈ker(φ) so gker(φ)↦φ(g) is well defined and in fact it is a bijection because it's (clearly) surjective on a finite set.
Corollary (Noether1b) Let φ:G→H be any group homomorphism, then G/ker(φ)≃im(φ).
Lemma Let A and B be subgroups of G then A∩B is a subgroup of them both.
Theorem (Noether2) Let H≤G (just a subgroup) and N⊴G then N∩H⊴H and H/(N∩H)≃NH/N.
proof: Any x∈H may be considered an element of NH since 1∈N, so the map x↦Nx is an surjective homomorphism from H to NH/N with kernel N∩H.
Theorem (Noether3) Let M and N be normal subgroups of G and N≤M then N⊴M, M/N⊴G/N and (G/N)/(M/N)≃G/M.
proof: Define α:G/N→G/M by α(Nx)=Mx (this is well defined since if Nx=Nx′ then by M⊴G we get Mx=Mx′), the kernel is M/N so this must be a group which implies N⊴M because ???. As α is surjective we get the theorem.
- Nice proofs here: [Ash] Abstract Algebra: The Basic Graduate Year
- Really nice presentation: math.uc.edu/~tsmith/Math610/isothm.pdf
- Loads of properties of normal subgroups: ProofWiki:Normal_Subgroups
- Even better.. GroupProps:Normal_subgroup
No comments:
Post a Comment