## The First Isomorphism Theorem

Today I want to walk through what’s called the “First Isomorphism Theorem” for groups. There are two more, but the first is really more interesting in my view. I’ll start with a high-level sketch: kernels of homomorphisms are normal subgroups, images are quotient groups, and every homomorphism is a quotient followed by an isomorphism.

First I’m going to need a couple homomorphisms. If we’ve got a group and a normal subgroup , there’s immediately a homomorphism . Just send each to its coset . It should be clear that every coset gets hit at least once, so this is an epimorphism, and that its kernel is exactly . We call the “canonical projection” or the “canonical epimorphism” from to .

On the other hand, if is a group and is *any* subgroup, we have a homomorphism given by just sending every element of to itself inside . This is such a natural identification to make that it feels a little weird to think of it as a homomorphism at all, but it actually turns out to be quite useful. The kernel of is trivial, making it a monomorphism. We call it the “canonical injection” or “canonical monomorphism” from to .

Now consider any homomorphism . If is in the kernel of — is the identity of — and is any element of , we calculate

so is in the kernel as well. Thus the kernel is a normal subgroup.

So every kernel is a normal subgroup, and the canonical projection shows that every normal subgroup shows up as the kernel of *some* homomorphism.

Now we can write any homomorphism as a composition

where I’ve written the name of each composition next to its arrow. That is, we first project onto the quotient of the domain by the kernel of , then we send that to the image of by a homomorphism we call , and finally we inject the image into the codomain. As a bonus, is an isomorphism!

Okay, so how do we define ? If we write the kernel of as , we need to figure out what to do with a coset . If and are two elements of , then , so sends every element of to the same element of . We define .

Now let’s say . This means that , so is in already, and is the identity of . The kernel of is trivial, so is a monomorphism. On the other hand, every element in is for some , so each one is also for some . That makes an epimorphism, and thus an isomorphism. Q.E.D.

Every homomorphism works like this: you divide out some kernel, hit the quotient group with an isomorphism, and include the result into the target group. Since isomorphisms don’t really change anything about a group and the inclusion is pretty simple too, all the really interesting stuff goes on in the first step. The homomorphisms that can come out of are essentially determined by the normal subgroups of . Because of this, we call a group with no nontrivial normal subgroups “simple”. The kernel of an homomorphism from a simple group is either trivial or the whole group.

What we’re starting to see here is the tip of a much deeper approach to algebra. The internal structure of a group is intimately bound up with the external structure of the homomorphisms linking it to other groups. Each one determines, and is determined by the other, and this duality can be a powerful tool for answering questions on one side by turning them into questions on the other side.