in which we meet group homomorphisms.
As a small add-on from last time, we started by proving that the subgroups of the integers are exactly the sets of multiples . We then had a detour on functions from domain (or source) to codomain (or target) . We saw how to compose functions, when they are the same, and what injective, surjective and bijective functions are. Our examples included the identity function and the inclusion map, as well as a few others. We noted (but didn’t prove) that bijective functions have inverses with and . Our main definition today was that of a group homomorphism: a function between two groups which preserves the group structure, meaning that for all . This means it does not matter whether we first combine two elements in and then send the result over to , or whether we send the elements separately to and combine them there. We call bijective group homomorphisms isomorphisms. Examples of homomorphisms include identity, inclusion of a subgroup, the exponential map , and the determinant of a matrix.
Understanding today’s lecture
Practice Sheet C is the last one you’ll get from me, so you should get used to making easy exercises like that for yourself if you need them. Playing around with functions seeing if they are homomorphisms or not is very useful. And you can also keep asking yourself if you meet a function “is it injective, surjective, bijective?” Perhaps you might investigate what the difference is between and . Are they the same function/homomorphism or do they have different properties? Does it matter which one we use? Sheet C asks you something about a constant function: that is a function that sends all the elements in the domain to the same element in the codomain, i.e. everything gets mapped to the same single element.
Preparing for Lecture 4:
Next time we will prove some properties of group homomorphisms (which we already stated today), and learn about images and kernels. These are special subgroups related to a group homomorphism. We are going to use the result that “The composite of bijective functions is bijective”, so it would be a good to try it before next lecture. Can you think of how you might go about proving the properties we stated today?
Going a little deeper
The style of proof we saw for the fact that the subgroups of are exactly is one we will meet again. It crucially uses the fact that any subset of natural numbers has a smallest element. This is a very special property of the natural numbers, and you will see more about it in Numbers and Sets, I expect. Look out for (or google) the Peano Axioms or why Proof by Induction works.
In modern mathematics, it is always important to know “what kind of functions belong to what kind of objects”. So when we study groups, one of the first questions we should ask ourselves is: what functions belong to groups, i.e. what functions preserve the group structure? We have asked a group homomorphism to preserve the group operation, and will see next time that this implies it also preserves identities and inverses. If you remember the example from the last blog about monoids, can you think whether a “monoid homomorphism” defined the same way would also preserve the identity?