Jump to content

Normal subgroup/Kernel/Introduction/Section

From Wikiversity


Let be a group, and let denote a subgroup. is called a normal subgroup if

holds for all , that is, if every left coset

of coincides with the right coset of .

For a normal subgroup, it is not necessary to distinguish between left cosets and right cosets; we just talk about cosets. Instead of or , we write usually . The equality does not mean that for all ; it only means that for every , there exists a fulfilling .


Let be a group, and let be a subgroup. Then the following statements are equivalent.

  1. is a normal subgroup of .
  2. We have for all and .
  3. is invariant under every inner automorphism of .

(1) means for given that we can write with some . Multiplication by from the right yields ; therefore, holds. Reading this argument backwards gives the implication . Moreover, is an explicit reformulation of .



We consider the permutation group for a set with three elements, that is, consists of all bijective mappings of the set to itself. The trivial group and the whole group are normal subgroups. The subset , where is the element that swops and and fixes , is a subgroup. However, it is not a normal subgroup. To show this, let denote the bijection that fixes and swops and . The inverse of is itself. The conjugation is the mapping that sends to , to , and to . This bijection does not belong to .


Let and be groups, and let

be a group homomorphism. Then the kernel is a normal subgroup

in .

By fact, we know that the kernel is a subgroup. We use fact. Hence, let be arbitrary, and . Then

therefore, belongs to the kernel.