Skip to main content
Mathematics LibreTexts

5.3: Normal Subgroups

  • Page ID
    98002
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    We’ve seen an example where the left and right cosets of a subgroup were different and a few examples where they coincided. In the latter case, the subgroup has a special name.

    Definition: Normal Subgroup

    Let \(G\) be a group and let \(H\leq G\). If \(aH=Ha\) for all \(a\in G\), then we say that \(H\) is a normal subgroup. If \(H\) is a normal subgroup of \(G\), then we write \(H\trianglelefteq G\).

    Problem \(\PageIndex{1}\)

    Provide an example of group that has a subgroup that is not normal.

    Problem \(\PageIndex{2}\): Checkerboard

    Suppose \(G\) is a finite group and let \(H \leq G\). If \(H\trianglelefteq G\) and we arrange the rows and columns of the group table for \(G\) according to the left cosets of \(H\) and then color the corresponding cosets, what property will the table have? Is the converse true? That is, if the table has the property you discovered, will \(H\) be normal in \(G\)?

    There are a few instances where we can guarantee that a subgroup will be normal.

    Theorem \(\PageIndex{1}\)

    Suppose \(G\) is a group. Then \(\{e\}\trianglelefteq G\) and \(G\trianglelefteq G\).

    Theorem \(\PageIndex{2}\): Abelian Implies Normal

    If \(G\) is an abelian group, then all subgroups of \(G\) are normal.

    A group does not have to be abelian in order for all the proper subgroups to be normal.

    Problem \(\PageIndex{3}\)

    Argue that all of the proper subgroups of \(Q_8\) are normal in \(Q_8\).

    Theorem \(\PageIndex{3}\): Index

    Suppose \(G\) is a group and let \(H\leq G\) such that \([G:H]=2\). Then \(H\trianglelefteq G\).

    It turns out that normality is not transitive.

    Problem \(\PageIndex{4}\)

    Consider \(\langle s\rangle=\{e,s\}\) and \(\langle r^2,sr^2\rangle =\{e,r^2,sr^2,s\}\). It is clear that \[\langle s\rangle\leq \langle r^2,sr^2\rangle\leq D_4.\] Show that \(\langle s\rangle\trianglelefteq \langle r^2,sr^2\rangle\) and \(\langle r^2,sr^2\rangle\trianglelefteq D_4\), but \(\langle s\rangle\not\trianglelefteq D_4\).

    The previous problem illustrates that \(H\trianglelefteq K \trianglelefteq G\) does not imply \(H\trianglelefteq G\).

    Definition: Conjugate of \(H\) by \(g\)

    Suppose \(G\) is a group and let \(H\leq G\). For \(g\in G\), we define the conjugate of \(H\) by \(g\) to be the set \[gHg^{-1}:=\{ghg^{-1}\mid h\in H\}.\]

    Theorem \(\PageIndex{4}\): Closed Under Conjugation Normal

    Suppose \(G\) is a group and let \(H\leq G\). Then \(H\trianglelefteq G\) if and only if \(gHg^{-1}\subseteq H\) for all \(g\in G\).

    Another way of thinking about normal subgroups is that they are “closed under conjugation." It’s not too hard to show that if \(gHg^{-1}\subseteq H\) for all \(g\in G\), then we actually have \(gHg^{-1}=H\) for all \(g\in G\). This implies that \(H\trianglelefteq G\) if and only if \(gHg^{-1}=H\) for all \(g\in G\). This seemingly stronger version of Theorem \(\PageIndex{4}\) is sometimes used as the definition of normal subgroup. This discussion motivates the following definition.

    Definition: Normalizer of \(H\) in \(G\)

    Let \(G\) be a group and let \(H\leq G\). The normalizer of \(H\) in \(G\) is defined via \[N_G(H):=\{g\in G\mid gHg^{-1}=H\}.\]

    Theorem \(\PageIndex{5}\)

    If \(G\) is a group and \(H\leq G\), then \(N_G(H)\) is a subgroup of \(G\).

    Theorem \(\PageIndex{6}\)

    If \(G\) is a group and \(H\leq G\), then \(H\trianglelefteq N_G(H)\). Moreover, \(N_G(H)\) is the largest subgroup of \(G\) in which \(H\) is normal.

    It is worth pointing out that the “smallest" \(N_G(H)\) can be is \(H\) itself—certainly a subgroup is a normal subgroup of itself. Also, the “largest" that \(N_G(H)\) can be is \(G\), which happens precisely when \(H\) is normal in \(G\).

    Problem \(\PageIndex{5}\)

    Find \(N_{D_4}(V_4)\).

    Problem \(\PageIndex{6}\)

    Find \(N_{D_3}(\langle s\rangle)\).

    We conclude this chapter with a few remarks. We’ve seen examples of groups that have subgroups that are normal and subgroups that are not normal. In an abelian group, all the subgroups are normal. It turns out that there are examples of groups that have no normal subgroups. These groups are called simple groups. The smallest simple group is \(A_5\), which has 60 elements and lots of proper nontrivial subgroups, none of which are normal.

    The classification of the finite simple groups is a theorem stating that every finite simple group belongs to one of four categories:

    1. A cyclic group with prime order;
    2. An alternating group of degree at least 5;
    3. A simple group of Lie type, including both
      1. the classical Lie groups, namely the simple groups related to the projective special linear, unitary, symplectic, or orthogonal transformations over a finite field;
      2. the exceptional and twisted groups of Lie type (including the Tits group);
    4. The 26 sporadic simple groups.

    These groups can be seen as the basic building blocks of all finite groups, in a way reminiscent of the way the prime numbers are the basic building blocks of the natural numbers.

    The classification theorem has applications in many branches of mathematics, as questions about the structure of finite groups (and their action on other mathematical objects) can sometimes be reduced to questions about finite simple groups. Thanks to the classification theorem, such questions can sometimes be answered by checking each family of simple groups and each sporadic group. The proof of the theorem consists of tens of thousands of pages in several hundred journal articles written by about 100 authors, published mostly between 1955 and 2004.

    The classification of the finite simple groups is a modern achievement in abstract algebra and I highly encourage you to go learn more about it. You might be especially interested in learning about one of the sporadic groups called the Monster Group.


    This page titled 5.3: Normal Subgroups is shared under a CC BY-SA 4.0 license and was authored, remixed, and/or curated by Dana Ernst via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon request.