deepdream of
          a sidewalk
Show Question
Math and science::Algebra::Aluffi

Groups. Kernel.

Kernel of a group homomorphism

Let φ:GG be a group homomorphism from group G to group G. The kernel of φ is the set of elements of G that map to eG through φ.

The kernel of φ is denoted as kerφ.


In other words, φ is the preimage of {eG} through φ.

kerφ=φ1({eG})

From kernel to (equal) cosets

For the below discussion, it's worth remembering that kernels form subgroups, and these subgroups are normal.

Let φ:GD be a group homomorphism. Consider the case if kerφ has 2 elements, (eG,h1). The fact that φ is a group homomorphism introduces some strong requirements on other elements of G. Let aG be an element not in ker(φ). Then consider:

aeG=aah1=xh1a=?

Note that ah1=h1a. This commutativity is required so that eDx=xeD in the group D.

In the group G, eG and h1 are distinct elements, and so a and x must also be distinct elements, by the nature of groups. As D is also a group and φ a group homomorphism, a and x must map through φ to the same element in D. This is required to satisfy the requirement of group homomorphisms:

w,vG,φ(wGv)=φ(w)Dφ(v)

This means that for any dD, the preimage of d through φ, imφ({d}), must have the same number of elements as kerφ! We can use these preimages to form the blocks in a partition and the resulting equivalence relation is exactly the one corresponding to the quotient G/ker(φ).

Below is a visualization of this idea.


Source

Aluffi p80