Isomorphism Theorems

Isomorphism Theorems and Composition Series

Introduction

The isomorphism theorems are the fundamental tools for analyzing the structure of quotient groups and understanding the relationships between different groups. They function as the "conservation laws" of group theory, allowing us to relate subgroups, quotients, and homomorphisms in a precise way.

Group Homomorphisms and Isomorphisms

Definition

A homomorphism is a map ϕ:GH between two groups that preserves the group structure, meaning ϕ(g1g2)=ϕ(g1)ϕ(g2) for all g1,g2G.

Important Sets Associated with Homomorphisms

Two important sets associated with a homomorphism are:

  1. Kernel: ker(ϕ)={gGϕ(g)=eH}, which is always a normal subgroup of G
  2. Image: Im(ϕ)={ϕ(g)gG}, which is always a subgroup of H

Isomorphisms

An isomorphism is a bijective homomorphism. If an isomorphism exists between two groups, they are said to be isomorphic (denoted GH) and are considered structurally identical from an algebraic perspective.

The Isomorphism Theorems

The three main isomorphism theorems, sometimes attributed to Emmy Noether, describe the fundamental relationships between quotient groups, normal subgroups, and homomorphisms.

First Isomorphism Theorem

Theorem 3.1 (First Isomorphism Theorem): Let ϕ:GH be a group homomorphism. Then the quotient group G/ker(ϕ) is isomorphic to the image of ϕ.

G/ker(ϕ)Im(ϕ)

This theorem is arguably the most important in group theory. It provides a direct link between homomorphisms and quotient groups, showing that factoring a group by the kernel of a map precisely captures the structure of the map's image.

Example

Consider the homomorphism ϕ:ZZ6 defined by ϕ(n)=nmod6. Then:

Second Isomorphism Theorem

Theorem 3.2 (Second Isomorphism Theorem): Let G be a group, S a subgroup of G, and N a normal subgroup of G. Then the product SN={snsS,nN} is a subgroup of G, the intersection SN is a normal subgroup of S, and the following isomorphism holds:

(SN)/NS/(SN)

This theorem is often called the "Diamond Isomorphism Theorem" due to the shape of the corresponding subgroup lattice diagram.

Example

Let G=S4, S=(1,2,3) (cyclic subgroup of order 3), and N=A4 (alternating group). Then:

Third Isomorphism Theorem

Theorem 3.3 (Third Isomorphism Theorem): Let G be a group and let N and K be normal subgroups of G with NK. Then N is a normal subgroup of K, K/N is a normal subgroup of G/N, and the following isomorphism holds:

(G/N)/(K/N)G/K

This theorem provides a "cancellation" rule for quotients. It also establishes a one-to-one correspondence between the subgroups of G/N and the subgroups of G that contain N, known as the Correspondence Theorem or Lattice Theorem.

Example

Let G=Z, N=12Z, and K=4Z. Then:

Composition Series and Simple Groups

The isomorphism theorems allow us to deconstruct groups. This process of decomposition leads to the idea of fundamental, indivisible building blocks.

Simple Groups

Definition 3.4: A group G is simple if its only normal subgroups are the trivial subgroup {e} and the group G itself.

Simple groups are the "atoms" of group theory. They cannot be simplified further by forming non-trivial quotient groups. Key examples include:

Subnormal Series

Definition 3.5: A subnormal series of a group G is a finite sequence of subgroups:

{e}=H0H1Hn=G

where each Hi is a normal subgroup of Hi+1. The quotient groups Hi+1/Hi are called the factors of the series.

Composition Series

A composition series is a subnormal series where all the factors Hi+1/Hi are simple groups.

The existence of a composition series for every finite group can be shown by starting with G and finding a maximal normal subgroup Hn1; then finding a maximal normal subgroup of Hn1, and so on, until the trivial group is reached. The maximality at each step ensures the corresponding factor group is simple.

Analogy with Prime Factorization

This process is analogous to the prime factorization of an integer. An integer is factored into primes; a finite group is "factored" via a composition series into simple groups. This analogy provides the entire motivation for one of the monumental achievements of 20th-century mathematics: the classification of all finite simple groups.

Just as understanding prime numbers is key to number theory, understanding simple groups is key to understanding all finite groups.

Examples

Example 1: Composition Series of Z12

A composition series for Z12 is:

{0}62Z12

The factors are:

Example 2: Composition Series of S4

A composition series for S4 is:

{e}VA4S4

where V={e,(1,2)(3,4),(1,3)(2,4),(1,4)(2,3)} is the Klein four-group.

The factors are:

Example 3: Using the First Isomorphism Theorem

Consider the homomorphism ϕ:RR defined by ϕ(x)=x2. Then:

Applications

Application 1: Understanding Group Structure

The isomorphism theorems help us understand the structure of groups by relating them to simpler groups through quotients and homomorphisms.

Application 2: Proving Isomorphisms

The theorems provide powerful tools for proving that two groups are isomorphic without having to construct an explicit isomorphism.

Application 3: Classification of Groups

Composition series and simple groups are fundamental to the classification of finite groups, which is one of the major achievements of 20th-century mathematics.

Summary

The isomorphism theorems provide the fundamental tools for understanding group structure by relating homomorphisms, normal subgroups, and quotient groups. Composition series allow us to break down finite groups into simple building blocks, analogous to prime factorization of integers. These concepts are essential for the deeper study of group theory and its applications in Galois theory and other areas of mathematics.