## Group homomorphisms

At last we come to the notion of a homomorphism of groups. These are really, in my view, the most important parts of the theory. They show up everywhere, and the structure of group theory is intimately bound up with the way homomorphisms work.

So what is a homomorphism? It’s a function from the set of members of one group to the set of members of another that “preserves the composition”. That is, a homomorphism takes an element of and gives back an element of . It has the further property that . The product of and uses the composition from , while the product of and uses the composition of .

Let’s consider an example very explicitly: a homomorphism . Remember that is the group of rearrangements of 3 objects (I’ll use a, b, and c), while is the group of “addition modulo 2″.

0 | |

1 | |

1 | |

0 | |

1 | |

0 |

If we consider the permutations and in , each one is sent to 1 in the group , and 1+1 = 0 there. On the other hand, , which is sent to 0. The composition of the images is the image of the composition. We can pick any two permutations on the right and see the same thing.

Another example: with . The homomorphism property says that , and indeed we see that .

Another: . By . I mean the real numbers with addition as composition, and by . I mean the positive.*nonzero* real numbers with multiplication. I define . The laws of exponents tell us that .

As we continue we will see many more examples of homomorphisms. For now, there are a few definitions we will find useful later. Recall from the discussion about functions that a surjection is a function between functions that hits every point in its codomain at least once. A group homomorphism that is also a surjection we call an “epimorphism”. Similarly, an injection is a function that hits every point in its codomain at most once. A group homomorphism that is also an injection we call a “monomorphism”. A homomorphism that is both — the function is a bijection — we call an “isomorphism”. In the above examples, is an epimorphism, is a monomorphism, and is an isomorphism.

If a homomorphism’s domain and codomain group are the same, as in above, we call it an “endomorphism” on the group. If it’s also an isomorphism we call it an “automorphism”. The homomorphism is not an automorphism, since it doesn’t hit any point that’s not a multiple of 3.

And finally, a few things to think about.

- Can you construct a homomorphism from to similar to above, but for other values of ?
- What homomorphisms can you construct from to ? to ? to an arbitrary group ?
- What homomorphisms can you construct from to ?

*UPDATE: I just remembered that I left off another technical requirement. A homomorphism has to send the identity of the first group to the identity of the second. It usually doesn’t cause a problem, but I should include it to be thorough. It isn’t hard to verify that all the homomorphisms I mentioned satisfy this property too.*