Skip to main content
\(\newcommand{\identity}{\mathrm{id}} \newcommand{\notdivide}{\nmid} \newcommand{\notsubset}{\not\subset} \newcommand{\lcm}{\operatorname{lcm}} \newcommand{\gf}{\operatorname{GF}} \newcommand{\inn}{\operatorname{Inn}} \newcommand{\aut}{\operatorname{Aut}} \newcommand{\Hom}{\operatorname{Hom}} \newcommand{\cis}{\operatorname{cis}} \newcommand{\chr}{\operatorname{char}} \newcommand{\Null}{\operatorname{Null}} \newcommand{\transpose}{\text{t}} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \setcounter{chapter}{-1}\)

Section10.4Exercises

1

Prove that \(\det( AB) = \det(A) \det(B)\) for \(A, B \in GL_2( {\mathbb R} )\text{.}\) This shows that the determinant is a homomorphism from \(GL_2( {\mathbb R} )\) to \({\mathbb R}^*\text{.}\)

2

Which of the following maps are homomorphisms? If the map is a homomorphism, what is the kernel?

  1. \(\phi : {\mathbb R}^\ast \rightarrow GL_2 ( {\mathbb R})\) defined by

    \begin{equation*} \phi( a ) = \begin{pmatrix} 1 & 0 \\ 0 & a \end{pmatrix} \end{equation*}
  2. \(\phi : {\mathbb R} \rightarrow GL_2 ( {\mathbb R})\) defined by

    \begin{equation*} \phi( a ) = \begin{pmatrix} 1 & 0 \\ a & 1 \end{pmatrix} \end{equation*}
  3. \(\phi : GL_2 ({\mathbb R}) \rightarrow {\mathbb R}\) defined by

    \begin{equation*} \phi \left( \begin{pmatrix} a & b \\ c & d \end{pmatrix} \right) = a + d \end{equation*}
  4. \(\phi : GL_2 ( {\mathbb R}) \rightarrow {\mathbb R}^\ast\) defined by

    \begin{equation*} \phi \left( \begin{pmatrix} a & b \\ c & d \end{pmatrix} \right) = ad - bc \end{equation*}
  5. \(\phi : {\mathbb M}_2( {\mathbb R}) \rightarrow {\mathbb R}\) defined by

    \begin{equation*} \phi \left( \begin{pmatrix} a & b \\ c & d \end{pmatrix} \right) = b, \end{equation*}

    where \({\mathbb M}_2( {\mathbb R})\) is the additive group of \(2 \times 2\) matrices with entries in \({\mathbb R}\text{.}\)

3

Let \(A\) be an \(m \times n\) matrix. Show that matrix multiplication, \(x \mapsto Ax\text{,}\) defines a homomorphism \(\phi : {\mathbb R}^n \rightarrow {\mathbb R}^m\text{.}\)

4

Let \(\phi : {\mathbb Z} \rightarrow {\mathbb Z}\) be given by \(\phi(n) = 7n\text{.}\) Prove that \(\phi\) is a group homomorphism. Find the kernel and the image of \(\phi\text{.}\)

5

Describe all of the homomorphisms from \({\mathbb Z}_{24}\) to \({\mathbb Z}_{18}\text{.}\)

6

Describe all of the homomorphisms from \({\mathbb Z}\) to \({\mathbb Z}_{12}\text{.}\)

7

In the group \({\mathbb Z}_{24}\text{,}\) let \(H = \langle 4 \rangle\) and \(N = \langle 6 \rangle\text{.}\)

  1. List the elements in \(HN\) (we usually write \(H + N\) for these additive groups) and \(H \cap N\text{.}\)

  2. List the cosets in \(HN/N\text{,}\) showing the elements in each coset.

  3. List the cosets in \(H/(H \cap N)\text{,}\) showing the elements in each coset.

  4. Give the correspondence between \(HN/N\) and \(H/(H \cap N)\) described in the proof of the Second Isomorphism Theorem.

8

If \(G\) is an abelian group and \(n \in {\mathbb N}\text{,}\) show that \(\phi : G \rightarrow G\) defined by \(g \mapsto g^n\) is a group homomorphism.

9

If \(\phi : G \rightarrow H\) is a group homomorphism and \(G\) is abelian, prove that \(\phi(G)\) is also abelian.

10

If \(\phi : G \rightarrow H\) is a group homomorphism and \(G\) is cyclic, prove that \(\phi(G)\) is also cyclic.

11

Show that a homomorphism defined on a cyclic group is completely determined by its action on the generator of the group.

12

If a group \(G\) has exactly one subgroup \(H\) of order \(k\text{,}\) prove that \(H\) is normal in \(G\text{.}\)

13

Prove or disprove: \({\mathbb Q} / {\mathbb Z} \cong {\mathbb Q}\text{.}\)

14

Let \(G\) be a finite group and \(N\) a normal subgroup of \(G\text{.}\) If \(H\) is a subgroup of \(G/N\text{,}\) prove that \(\phi^{-1}(H)\) is a subgroup in \(G\) of order \(|H| \cdot |N|\text{,}\) where \(\phi : G \rightarrow G/N\) is the canonical homomorphism.

15

Let \(G_1\) and \(G_2\) be groups, and let \(H_1\) and \(H_2\) be normal subgroups of \(G_1\) and \(G_2\) respectively. Let \(\phi : G_1 \rightarrow G_2\) be a homomorphism. Show that \(\phi\) induces a natural homomorphism \(\overline{\phi} : (G_1/H_1) \rightarrow (G_2/H_2)\) if \(\phi(H_1) \subset H_2\text{.}\)

16

If \(H\) and \(K\) are normal subgroups of \(G\) and \(H \cap K = \{ e \}\text{,}\) prove that \(G\) is isomorphic to a subgroup of \(G/H \times G/K\text{.}\)

17

Let \(\phi : G_1 \rightarrow G_2\) be a surjective group homomorphism. Let \(H_1\) be a normal subgroup of \(G_1\) and suppose that \(\phi(H_1) = H_2\text{.}\) Prove or disprove that \(G_1/H_1 \cong G_2/H_2\text{.}\)

18

Let \(\phi : G \rightarrow H\) be a group homomorphism. Show that \(\phi\) is one-to-one if and only if \(\phi^{-1}(e) = \{ e \}\text{.}\)

19

Given a homomorphism \(\phi :G \rightarrow H\) define a relation \(\sim\) on \(G\) by \(a \sim b\) if \(\phi(a) = \phi(b)\) for \(a, b \in G\text{.}\) Show this relation is an equivalence relation and describe the equivalence classes.

Additional exercises on automorphisms

20

Let \(\aut(G)\) be the set of all automorphisms of \(G\text{;}\) that is, isomorphisms from \(G\) to itself. Prove this set forms a group and is a subgroup of the group of permutations of \(G\text{;}\) that is, \(\aut(G) \leq S_G\text{.}\)

21

An inner automorphism of \(G\text{,}\)

\begin{equation*} i_g : G \rightarrow G, \end{equation*}

is defined by the map

\begin{equation*} i_g(x) = g x g^{-1}, \end{equation*}

for \(g \in G\text{.}\) Show that \(i_g \in \aut(G)\text{.}\)

22

The set of all inner automorphisms is denoted by \(\inn(G)\text{.}\) Show that \(\inn(G)\) is a subgroup of \(\aut(G)\text{.}\)

23

Find an automorphism of a group \(G\) that is not an inner automorphism.

24

Let \(G\) be a group and \(i_g\) be an inner automorphism of \(G\text{,}\) and define a map

\begin{equation*} G \rightarrow \aut(G) \end{equation*}

by

\begin{equation*} g \mapsto i_g. \end{equation*}

Prove that this map is a homomorphism with image \(\inn(G)\) and kernel \(Z(G)\text{.}\) Use this result to conclude that

\begin{equation*} G/Z(G) \cong \inn(G). \end{equation*}
25

Compute \(\aut(S_3)\) and \(\inn(S_3)\text{.}\) Do the same thing for \(D_4\text{.}\)

26

Find all of the homomorphisms \(\phi : {\mathbb Z} \rightarrow {\mathbb Z}\text{.}\) What is \(\aut({\mathbb Z})\text{?}\)

27

Find all of the automorphisms of \({\mathbb Z}_8\text{.}\) Prove that \(\aut({\mathbb Z}_8) \cong U(8)\text{.}\)

28

For \(k \in {\mathbb Z}_n\text{,}\) define a map \(\phi_k : {\mathbb Z}_n \rightarrow {\mathbb Z}_n\) by \(a \mapsto ka\text{.}\) Prove that \(\phi_k\) is a homomorphism.

29

Prove that \(\phi_k\) is an isomorphism if and only if \(k\) is a generator of \({\mathbb Z}_n\text{.}\)

30

Show that every automorphism of \({\mathbb Z}_n\) is of the form \(\phi_k\text{,}\) where \(k\) is a generator of \({\mathbb Z}_n\text{.}\)

31

Prove that \(\psi : U(n) \rightarrow \aut({\mathbb Z}_n)\) is an isomorphism, where \(\psi : k \mapsto \phi_k\text{.}\)

Sage Exercises

32Sage Exercise 1

An automorphism is an isomorphism between a group and itself. The identity function (\(x\mapsto x\)) is always an isomorphism, which we consider trivial. Use Sage to construct a nontrivial automorphism of the cyclic group of order \(12\text{.}\) Check that the mapping is both onto and one-to-one by computing the image and kernel and performing the proper tests on these subgroups. Now construct all of the possible automorphisms of the cyclic group of order \(12\) without any duplicates.

33Sage Exercise 2

The four homomorphisms created by the direct product construction are each an example of a more general construction of homomorphisms involving groups \(G\text{,}\) \(H\) and \(G\times H\text{.}\) By using the same groups as in the example in the previous subsection, see if you can discover and describe these constructions with exact definitions of the four homomorphisms in general.

Your tools for investigating a Sage group homomorphism are limited, you might take each generator of the domain and see what its image is. Here is an example of the type of computation you might do repeatedly. We'll investigate the second homomorphism. The domain is the dihedral group, and we will compute the image of the first generator.

34Sage Exercise 3

Consider two permutation groups. The first is the subgroup of \(S_7\) generated by \((1, 2, 3)\) and \((4, 5, 6, 7)\text{.}\) The second is a subgroup of \(S_{12}\) generated by \((1, 2, 3)(4, 5, 6)(7, 8, 9)(10, 11, 12)\) and \((1, 10, 7, 4)(2, 11, 8, 5)(3, 12, 9, 6)\text{.}\) Build these two groups and use the proper Sage command to see that they are isomorphic. Then construct a homomorphism between these two groups that is an isomorphism and include enough details to verify that the mapping is really an isomorphism.

35Sage Exercise 4

The second paragraph of this chapter informally describes a homomorphism from \(S_n\) to \({\mathbb Z}_2\text{,}\) where the even permutations all map to one of the elements and the odd permutations all map to the other element. Replace \(S_n\) by \(S_6\) and replace \({\mathbb Z}_2\) by the permutation version of the cyclic subgroup of order \(2\text{,}\) and construct a nontrivial homomorphism between these two groups. Evaluate your homomorphism with enough even and odd permutations to be convinced that it is correct. Then construct the kernel and verify that it is the group you expect.

Hints: First, decide which elements of the group of order \(2\) will be associated with even permutations and which will be associated with odd permutations. Then examine the generators of \(S_6\) to help decide just how to build the homomorphism.

36Sage Exercise 5

The dihedral group \(D_{20}\) has several normal subgroups, as seen below. Each of these is the kernel of a homomorphism with \(D_{20}\) as the domain. For each normal subgroup of \(D_{20}\) construct a homomorphism from \(D_{20}\) to \(D_{20}\) that has the normal subgroup as the kernel. Include in your work verifications that you are creating the desired kernels. There is a pattern to many of these, but the three of order \(20\) will be a challenge.