# Understanding the isomorphism theorems

YOU MAY ALSO BE INTERESTED IN:Understanding the definition of a homomorphism, Understanding the quotient map, Understanding the notions of order and index

The isomorphism theorems are basic results about the way homomorphisms and quotient maps behave for groups, and how they interact with intersections, products and other operations involving groups. This article looks at the isomorphism theorems from a number of perspectives, concentrating on some of the key aspects.

## Contents

## The natural choice aspect

### Explicit isomorphism, rather than just an assertion of isomorphism

A naive interpretation of the isomorphism theorems is to think of them as simply saying that certain groups, constructed in certain ways, are isomorphic. However, this does not capture the power of the theorems. The theorems explicitly *construct* isomorphisms that are the natural choice for such an isomorphism; in all cases, the isomorphism constructed by the theorem is effectively the only possible thing to write down.

The *map* that describes the isomorphism is the real power of the result, rather than the fact that the groups happen to be isomorphic.

### The left and right analogues

All the isomorphism theorems are stated with respect to certain assumptions of normality, but they all have analogues, often slightly weaker formulations, when the subgroups involved are not normal. These analogues have both left and right versions -- by the natural equivalence of left and right in groups (via the inverse map) the left and right formulations are equivalent.

The formulations involving non-normal subgroups, however, do not talk about isomorphisms between groups -- they talk of natural bijections between sets. What the isomorphism theorems tell us is that these bijections between sets become isomorphisms between groups when the subgroups involved are normal.

Analogous to the normal subgroups case, the map that describes the bijection is the real power of the result, rather than the fact that the fact that the sets have equal cardinalities.

In this article we shall review each isomorphism theorem, its left analogue for non-normal subgroups, and its many implications. The article starts with the second isomorphism theorem; the first isomorphism theorem is covered in the survey article understanding the quotient map.

## The second isomorphism theorem

### The version for non-normal subgroups: the product formula

`Further information: product formula`

Suppose are subgroups of a group . Let be the product of subgroups. Then, we have a natural bijection:

.

The intuition is that a coset of in is *enlarged* to the coset of containing it. This enlarged coset does not necessarily lie inside ; however, it does lie inside . Moreover, two different cosets of in give different cosets of .

The numerical version of the product formula states that:

.

On rearrangement, this gives:

.

### The second isomorphism theorem

`Further information: Second isomorphism theorem`

The second isomorphism theorem says that under certain conditions, we can interpret both sides of the natural bijection above as groups, and under those conditions, the natural bijection given above is an isomorphism of groups. The specific statement is as follows:

Suppose and are subgroups of a group such that every element of normalizes : for all . Then, is a subgroup, is normal in , is normal in , and further, the natural map:

is an isomorphism.

Note that we need to specify that is a subgroup, and further, that is a normal subgroup of , for the right side to make sense. If the right side makes sense, so does the left side, and we have an isomorphism of groups. However, being normal in does *not* guarantee either that is a group or that is normal in .

### An example: the lcm and gcd

If are natural numbers, we have the formula:

.

This formula is a special case of the product formula in the group of integers.

Let's first state the second isomorphism theorem for an abelian group.

Suppose and are subgroups of an abelian group . Then, the natural map:

is an isomorphism.

Let's apply this to the case where is the group of integers, is the cyclic subgroup generated by , and is the cyclic subgroup generated by . Then is the cyclic subgroup generated by , where is the cyclic subgroup generated by the gcd of and . Thus, we have an isomorphism:

.

Now, use the fact that the index of in is . This yields:

.

On rearrangement, this gives the desired result.

### An example: the inclusion-exclusion principle

If are sets:

.

This can also be viewed (for finite sets ) as a special case of the product formula. Suppose is any nontrivial finite group. Consider the group : this is the external direct product , with the positions indexed by elements of . The subgroup is defined as the subgroup comprising those elements such that all their non--coordinates are trivial. Similarly, define the subgroups and the subgroups . Clearly, we have:

The product formula now yields a bijection:

.

Taking cardinalities yields:

.

Taking logarithms to base .

## The third isomorphism theorem

### The version for non-normal subgroups: index is multiplicative

`Further information: Index is multiplicative`

Suppose are groups. There is a natural surjective map:

such that the inverse image of every point has the same size as <mah>K/H</math>. This yields that:

.

### The third isomorphism theorem

`Further information: Third isomorphism theorem`

This states that when and are both normal, the map from to is a surjective *homomorphism*, and the kernel of the homomorphism is precisely the subgroup .

### Example of the group of integers

If are integers, then . The third isomorphism theorem states that the kernel of the homomorphism:

is precisely .