Skip to main content

Section 16.1 Pre-read

Recall that an isomorphism between groups G1,G2 is an operation-preserving bijective correspondence between the two groups.

What if we relax the bijective correspondence bit?

You will be asked to look at a number of examples of homomorphisms in the Discovery guide following this Pre-read section.

Warning 16.1.2.

Since a homomorphism is not necessarily a bijective correspondence, we must now keep the following in mind.

  • It may be possible for two (or more!) elements in G1 to correspond to the same element in G2. That is, we might find φ(x)=φ(y) to be true for some xy in G1.

  • There may exist elements in G2 that have no corresponding element in G1. That is, we may find examples of an element z in G2 for which φ(x)=z never occurs.

Remark 16.1.3.

With this definition of homomorphism now in hand, an isomorphism becomes a special type of homomorphism. In particular, an isomorphism is a bijective homomorphism.

Definition 16.1.4. Image of a homomorphism.

The collection of all possible outputs of φ in G2. That is, the collection of all elements z in G2 for which it is possible to find at least one example of a corresponding element x in G1 with φ(x)=z.

We write imφ or φ(G) to denote the image of φ.

Definition 16.1.5. Kernel of a homomorphism.

The collection of all inputs in G1 that are mapped to the identity element in G2. That is, the collection of all elements x in G1 so that φ(x)=e2, where e2 represents the identity element in G1.

We write kerφ to denote the kernel of φ.

Warning 16.1.6. Keep it straight!

The image imφ is a subcollection of G2, while the kernel kerφ is a subcollection of G1.

Remark 16.1.7.

There was no need to define either concept of image or kernel when we studied isomorphisms, because, as an isomorphism is always a bijective correspondence, the image of an isomorphism G1G2 is always the full group G2, and the kernel always consists of just e1, the identity element in G1.