Skip to main content
Mathematics LibreTexts

2.4: Examples of Groups/Nongroups, Part I

  • Page ID
    84854
  • \( \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}}\)

    \( \newcommand{\vectorA}[1]{\vec{#1}}      % arrow\)

    \( \newcommand{\vectorAt}[1]{\vec{\text{#1}}}      % arrow\)

    \( \newcommand{\vectorB}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vectorC}[1]{\textbf{#1}} \)

    \( \newcommand{\vectorD}[1]{\overrightarrow{#1}} \)

    \( \newcommand{\vectorDt}[1]{\overrightarrow{\text{#1}}} \)

    \( \newcommand{\vectE}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{\mathbf {#1}}}} \)

    \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)

    \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)

    \(\newcommand{\avec}{\mathbf a}\) \(\newcommand{\bvec}{\mathbf b}\) \(\newcommand{\cvec}{\mathbf c}\) \(\newcommand{\dvec}{\mathbf d}\) \(\newcommand{\dtil}{\widetilde{\mathbf d}}\) \(\newcommand{\evec}{\mathbf e}\) \(\newcommand{\fvec}{\mathbf f}\) \(\newcommand{\nvec}{\mathbf n}\) \(\newcommand{\pvec}{\mathbf p}\) \(\newcommand{\qvec}{\mathbf q}\) \(\newcommand{\svec}{\mathbf s}\) \(\newcommand{\tvec}{\mathbf t}\) \(\newcommand{\uvec}{\mathbf u}\) \(\newcommand{\vvec}{\mathbf v}\) \(\newcommand{\wvec}{\mathbf w}\) \(\newcommand{\xvec}{\mathbf x}\) \(\newcommand{\yvec}{\mathbf y}\) \(\newcommand{\zvec}{\mathbf z}\) \(\newcommand{\rvec}{\mathbf r}\) \(\newcommand{\mvec}{\mathbf m}\) \(\newcommand{\zerovec}{\mathbf 0}\) \(\newcommand{\onevec}{\mathbf 1}\) \(\newcommand{\real}{\mathbb R}\) \(\newcommand{\twovec}[2]{\left[\begin{array}{r}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\ctwovec}[2]{\left[\begin{array}{c}#1 \\ #2 \end{array}\right]}\) \(\newcommand{\threevec}[3]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\cthreevec}[3]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \end{array}\right]}\) \(\newcommand{\fourvec}[4]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\cfourvec}[4]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \end{array}\right]}\) \(\newcommand{\fivevec}[5]{\left[\begin{array}{r}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\cfivevec}[5]{\left[\begin{array}{c}#1 \\ #2 \\ #3 \\ #4 \\ #5 \\ \end{array}\right]}\) \(\newcommand{\mattwo}[4]{\left[\begin{array}{rr}#1 \amp #2 \\ #3 \amp #4 \\ \end{array}\right]}\) \(\newcommand{\laspan}[1]{\text{Span}\{#1\}}\) \(\newcommand{\bcal}{\cal B}\) \(\newcommand{\ccal}{\cal C}\) \(\newcommand{\scal}{\cal S}\) \(\newcommand{\wcal}{\cal W}\) \(\newcommand{\ecal}{\cal E}\) \(\newcommand{\coords}[2]{\left\{#1\right\}_{#2}}\) \(\newcommand{\gray}[1]{\color{gray}{#1}}\) \(\newcommand{\lgray}[1]{\color{lightgray}{#1}}\) \(\newcommand{\rank}{\operatorname{rank}}\) \(\newcommand{\row}{\text{Row}}\) \(\newcommand{\col}{\text{Col}}\) \(\renewcommand{\row}{\text{Row}}\) \(\newcommand{\nul}{\text{Nul}}\) \(\newcommand{\var}{\text{Var}}\) \(\newcommand{\corr}{\text{corr}}\) \(\newcommand{\len}[1]{\left|#1\right|}\) \(\newcommand{\bbar}{\overline{\bvec}}\) \(\newcommand{\bhat}{\widehat{\bvec}}\) \(\newcommand{\bperp}{\bvec^\perp}\) \(\newcommand{\xhat}{\widehat{\xvec}}\) \(\newcommand{\vhat}{\widehat{\vvec}}\) \(\newcommand{\uhat}{\widehat{\uvec}}\) \(\newcommand{\what}{\widehat{\wvec}}\) \(\newcommand{\Sighat}{\widehat{\Sigma}}\) \(\newcommand{\lt}{<}\) \(\newcommand{\gt}{>}\) \(\newcommand{\amp}{&}\) \(\definecolor{fillinmathshade}{gray}{0.9}\)

    Let's look at some examples of groups/nongroups.

    Example \(\PageIndex{1}\)

    We claim that \(\mathbb{Z}\) is a group under addition. Indeed, \(\langle\mathbb{Z},+\rangle\) is a binary structure and that addition is associative on the integers. The integer \(0\) acts as an identity element of \(\mathbb{Z}\) under addition (since \(a+0=0+a=a\) for each \(a\in \mathbb{Z}\)), and each element \(a\) in \(G\) has inverse \(-a\) since \(a+(-a)=-a+a=0\text{.}\)

    Example \(\PageIndex{2}\)

    For each following binary structure \(\langle G,*\rangle\text{,}\) determine whether or not \(G\) is a group. For those that are not groups, determine the first group axiom that fails, and provide a proof that it fails.

    1. \(\langle \mathbb{Q},+\rangle\)
    2. \(\langle \mathbb{Z},-\rangle\)
    3. \(\langle \mathbb{R},\cdot\rangle\)
    4. \(\langle \mathbb{C}^*,\cdot\rangle\)
    5. \(\langle \mathbb{R},+\rangle\)
    6. \(\langle \mathbb{Z}^+,+\rangle\)
    7. \(\langle \mathbb{Z}^*,\cdot\rangle\)
    8. \(\langle \mathbb{M}_n(\mathbb{R}),+\rangle\)
    9. \(\langle \mathbb{C},+\rangle\)
    10. \(\langle \mathbb{Z},\cdot\rangle\)
    11. \(\langle \mathbb{R}^*,\cdot\rangle\)
    12. \(\langle \mathbb{M}_n(\mathbb{R}),\cdot\rangle\)

    If you have taken linear algebra, you have also probably seen a collection of matrices that is a group under matrix multiplication.

    Definition: General and Special Linear Groups

    Recall that given a square matrix \(A\text{,}\) the notation \(\det A\) denotes the determinant of \(A\text{.}\) Let

    \begin{equation*} GL(n,\mathbb{R})=\{M\in \mathbb{M}_n(\mathbb{R}):\det M \neq 0\} \end{equation*}

    (that is, let \(GL(n,\mathbb{R})\) be the set of all invertible \(n \times n\) matrices over \(\mathbb{R}\)) , and let

    \begin{equation*} SL(n,\mathbb{R})=\{M\in \mathbb{M}_n(\mathbb{R}):\det M =1\}\text{.} \end{equation*}

    These subsets of \(\mathbb{M}_n(\mathbb{R})\) are called, respectively, the general and special linear groups of degree \(n\) over \(\mathbb{R}\).

    Note that these definitions imply that these subsets of \(\mathbb{M}_n(\mathbb{R})\) are groups (under some operation). Sure enough, they are!

    Theorem \(\PageIndex{1}\)

    \(GL(n,\mathbb{R})\) is a group under matrix multiplication.

    Proof

    Let \(A,B∈GL(n,\mathbb{R})\). Then \(\text{det}(AB)=(\text{det}A)(\text{det}B)≠0\) (since \(\text{det}A, \text{det}B≠0\)), so \(AB∈GL(n,\mathbb{R})\). Thus, \( \langle GL(n,\mathbb{R}),\cdot \rangle\) \(\langle GL(n,\mathbb{R}), \cdot \rangle\) is a binary structure.

    We know that matrix multiplication is always associative, so \(\mathcal{G}_2\) holds. Next,

    \(\begin{bmatrix} 1 & 0 & 0 & \cdots & 0\\ 0 & 1 & 0 & \cdots & 0\\ 0 & 0 & 1 & \cdots & 0\\ \vdots & \vdots & \vdots & \ddots & \vdots\\ 0 & 0 & 0 & \cdots & 1 \end{bmatrix}\)

    the is in \(GL(n,\mathbb{R})\) since \(\text{det}I_n=1≠0\), and it acts as an identity element for \(\langle GL(n,\mathbb{R}),\cdot \rangle\) \(\langle GL(n,\mathbb{R}),\cdot \rangle\) since

    \(AI_n=I_nA=A\)

    for all \(A∈GL(n,\mathbb{R})\).

    Finally, let \(A∈GL(n,\mathbb{R})\). Since \(\text{det}A≠0\), \(A\) has (matrix multiplicative) inverse \(A^{−1}\) in \(\mathbb{M}_2(\mathbb{R})\). But we need to verify that \(A^{−1}\) is in \(G\). This is in fact the case, however, since \(A^{−1}\) is invertible (it has inverse \(A\)), hence \(\text{det}A^{−1}≠0\). Thus, \(A^{−1}\) is also in \(GL(n,\mathbb{R})\).

    So \(GL(n,\mathbb{R})\) is a group under multiplication.

    Theorem \(\PageIndex{2}\)

    \(SL(n,\mathbb{R})\text{,}\) is a group under matrix multiplication.

    Proof

    Let \(A,B∈SL(n,\mathbb{R})\). Then \(\text{det}(AB)=(\text{det}A)(\text{det}B)=1(1)=1\), so \(AB∈SL(n,\mathbb{R})\). Thus, \( \langle SL(n,\mathbb{R}),\cdot \rangle\) \(\langle SL(n,\mathbb{R}),\cdot \rangle\) is a binary structure.

    The rest of the proof is left as an exercise for the reader.

    We end this section with a final example.

    Example \(\PageIndex{3}\)

    Define \(*\) on \(\mathbb{Q}^*\) by \(a*b=(ab)/2\) for all \(a,b\in \mathbb{Q}^*\text{.}\) Prove that \(\langle \mathbb{Q}^*,*\rangle\) is a group.

    Solution

    First, \(\langle \mathbb{Q}^∗ \rangle, \;\) is a binary structure, since \((ab)/2\) is rational and nonzero whenever \(a,b\) are rational and nonzero.

    Next, we check that \(\mathbb{Q}^∗\) under \(∗\) satisfies the group axioms. Since multiplication is commutative on \(\mathbb{Q}, ∗\) is clearly commutative on \(\mathbb{Q}^∗\), and so our work to show \(\mathcal{G}_2\) and \(\mathcal{G}_3\) is marginally reduced.

    First, associativity of \(∗\) on \(\mathbb{Q}^∗\) is inherited from associativity of multiplication on \(\mathbb{Q}^∗\).

    Notice that the perhaps “obvious” choice, \(1\), is not an identity element for \(\mathbb{Q}^∗\) under \(∗\): for instance, \(1∗3= 3/2 ≠3\). Rather, \(e\) is such an identity element if and only if for all \(a∈\mathbb{Q}\) we have \(a=e∗a=(ea)/2\). We clearly have \(a=(2a)/2\) for all \(a∈\mathbb{Q}^∗\); so \(2\) acts as an identity element for \(\mathbb{Q}^∗\) under \(∗\).

    Finally, let \(a∈\mathbb{Q}^∗\). Since \(a≠0\), it makes sense to divide by \(a\); then \(4/a∈\mathbb{Q}^∗\), with \(a∗(4/a)=(a(4/a))/2=2\).

    Thus, \(\langle \mathbb{Q}^∗,∗\rangle\) is a group.


    This page titled 2.4: Examples of Groups/Nongroups, Part I is shared under a GNU Free Documentation License 1.3 license and was authored, remixed, and/or curated by Jessica K. Sklar via source content that was edited to the style and standards of the LibreTexts platform.