Homomorphisms and kernels
The sign of a permutation and the determinant of a matrix both turn a product into a product of values. What is true of every map between groups that respects the operation, and what do the elements it sends to the identity tell us?
Where you are 6 in Homomorphisms
Why this exists
Several maps in earlier lessons carry one group’s operation into another’s: the sign, with \operatorname{sgn}(\sigma\tau) = \operatorname{sgn}(\sigma)\operatorname{sgn}(\tau) (Permutation groups and cycle notation, Theorem 7); the determinant, with \det(AB) = \det A \det B (Properties of determinants: row operations, products, transposes); conjugation, with c_g(xy) = c_g(x)c_g(y) (Normal subgroups, Theorem 1); every Linear transformation. For a matrix, the vectors sent to \mathbf{0} form the kernel, and the solutions of A\mathbf{x} = \mathbf{b}, when there are any, form one coset of it (Cosets, Exercise 16). Groups follow the same pattern. A map that respects the operation is a homomorphism; the elements it sends to the identity form its kernel; the elements sharing an output form a coset of the kernel. Kernels are always normal subgroups, and every normal subgroup is a kernel.
Definition
Let G and H be groups. A homomorphism from G to H is a map \psi : G \to H with
The product on the left is taken in G, the one on the right in H. For an additive group the condition is written to match: \psi : \mathbb{Z}_n \to H needs \psi([a] + [b]) = \psi([a])\psi([b]), and \psi : G \to \mathbb{Z}_m needs \psi(ab) = \psi(a) + \psi(b).
Write e for the identity of G and e_H for that of H. The kernel and image of \psi are
For L \subseteq H, the preimage of L is \psi^{-1}(L) = \{g \in G : \psi(g) \in L\}; the notation does not ask \psi to have an inverse. The preimage of \{h\} is the fiber of \psi over h. The trivial homomorphism sends everything to e_H. “One to one” and “onto” mean what they mean in One-to-one, onto and bijective functions; a homomorphism that is both is an isomorphism.
Intuition
A homomorphism may glue different elements together, but it glues consistently: if \psi(a) = \psi(a') and \psi(b) = \psi(b'), then \psi(ab) = \psi(a'b'). The sign keeps only whether a permutation is even or odd; the determinant keeps one number of a matrix.
Consistency forces the fibers into one shape. The fiber over e_H is the kernel K, and the fiber through a is aK: multiplying a on the right by an element of K leaves the value unchanged, and nothing else does. So the fibers, the classes of the “same output” relation of Relations, equivalence classes and partitions, Theorem 6, are the cosets of the kernel, all of one size (Theorem 5). A homomorphism that glues nothing has kernel \{e\}, and conversely (Corollary 6), as for linear maps.
Results
Throughout, \psi : G \to H is a homomorphism and K = \ker \psi.
Theorem 1 (identity, inverses, powers). \psi(e) = e_H, and for every g \in G and every integer n, \psi(g^{-1}) = \psi(g)^{-1} and \psi(g^n) = \psi(g)^n.
Theorem 2 (building homomorphisms). If \theta : H \to J is a homomorphism, so is \theta \circ \psi : G \to J. The identity map \mathrm{id}_G is a homomorphism, and so is the restriction of \psi to any subgroup of G.
Theorem 3 (subgroups and preimages). (a) If A \le G, then \psi(A) = \{\psi(a) : a \in A\} \le H; in particular \operatorname{im} \psi \le H. (b) If L \le H, then \psi^{-1}(L) \le G and K \subseteq \psi^{-1}(L). If L \trianglelefteq H, then \psi^{-1}(L) \trianglelefteq G.
Theorem 4 (kernels are normal). K \trianglelefteq G.
Theorem 5 (fibers are cosets). For a, b \in G: \psi(a) = \psi(b) if and only if a^{-1}b \in K, if and only if aK = bK. So the fiber over \psi(a) is aK = Ka, and aK \mapsto \psi(a) is a well-defined bijection from the set G/K of left cosets of K onto \operatorname{im} \psi.
Corollary 6 (one to one). \psi is one to one if and only if K = \{e\}.
Corollary 7 (counting). If G is finite, then |G| = |K| \cdot |\operatorname{im} \psi|. So |\operatorname{im} \psi| divides |G|, and if H is finite it also divides |H|.
Theorem 8 (orders). If \operatorname{ord}(g) = n is finite, then \operatorname{ord}(\psi(g)) divides n, with equality when \psi is one to one.
Theorem 9 (maps out of cyclic groups). Let h \in H. (a) There is exactly one homomorphism \psi : \mathbb{Z} \to H with \psi(1) = h, namely \psi(k) = h^k. (b) Let n \ge 1. There is a homomorphism \psi : \mathbb{Z}_n \to H with \psi([1]) = h if and only if h^n = e_H, that is, if and only if \operatorname{ord}(h) divides n. It is then unique, and \psi([k]) = h^k.
Theorem 10 (the natural map). Let N \trianglelefteq G, and let G/N be the quotient group of Quotient groups, with product (aN)(bN) = abN. Then \pi : G \to G/N, \pi(g) = gN, is a homomorphism onto G/N with kernel N.
Corollary 11. A subgroup of G is normal if and only if it is the kernel of some homomorphism with domain G.
Why it is true
Proof of Theorem 1. \psi(e) = \psi(ee) = \psi(e)\psi(e); multiplying on the left by \psi(e)^{-1} gives e_H = \psi(e). Next, \psi(g)\psi(g^{-1}) = \psi(gg^{-1}) = e_H, so \psi(g^{-1}) = \psi(g)^{-1}, as inverses are unique (Binary operations and the group axioms). For n \ge 0, \psi(g^n) = \psi(g)^n by induction, using \psi(g^{n+1}) = \psi(g^n)\psi(g). For n < 0, \psi(g^n) = \psi((g^{-n})^{-1}), which is (\psi(g)^{-n})^{-1} = \psi(g)^n. \square
Proof of Theorem 2. \theta(\psi(ab)) = \theta(\psi(a)\psi(b)), and this is \theta(\psi(a))\,\theta(\psi(b)). For \mathrm{id}_G the condition reads ab = ab; a restriction satisfies the condition for \psi on fewer pairs. \square
Proof of Theorem 3. (a) By the subgroup test (Subgroups, Theorem 2): e_H = \psi(e) \in \psi(A), and for a, b \in A, \psi(a)\psi(b) = \psi(ab) \in \psi(A) and \psi(a)^{-1} = \psi(a^{-1}) \in \psi(A) (Theorem 1).
(b) \psi(e) = e_H \in L. If \psi(a), \psi(b) \in L, then \psi(ab) = \psi(a)\psi(b) \in L and \psi(a^{-1}) = \psi(a)^{-1} \in L. Each k \in K has \psi(k) = e_H \in L. If L \trianglelefteq H, \psi(a) \in L and g \in G, then \psi(gag^{-1}) = \psi(g)\psi(a)\psi(g)^{-1} \in L. \square
Proof of Theorem 4. For k \in K and g \in G, \psi(gkg^{-1}) = \psi(g)\,e_H\,\psi(g)^{-1} = e_H. (Or apply Theorem 3(b) to L = \{e_H\}.) \square
Proof of Theorem 5. By Theorem 1,
and a^{-1}b \in K if and only if aK = bK, if and only if b \in aK (Cosets, Lemma 2). So the fiber over \psi(a) is aK, which equals Ka as K is normal (Theorem 4 and Normal subgroups, Theorem 2). Read from right to left, the equivalence says two names of one coset give one value, so aK \mapsto \psi(a) is well defined; read from left to right, different cosets give different values, so it is one to one. It is onto \operatorname{im} \psi by definition. \square
Proof of Corollary 6. If \psi is one to one, \psi(g) = e_H = \psi(e) forces g = e. If K = \{e\} and \psi(a) = \psi(b), then a^{-1}b \in K by Theorem 5, so a = b. \square
Proof of Corollary 7. By Theorem 5, [G : K] = |\operatorname{im} \psi|, and Lagrange’s theorem (Lagrange's theorem, Theorem 1) gives |G| = [G : K]\,|K|. As \operatorname{im} \psi \le H, Lagrange’s theorem in H gives the last claim. \square
Proof of Theorem 8. Let m = \operatorname{ord}(\psi(g)). Since \psi(g)^n = \psi(g^n) = e_H, m divides n (Cyclic groups, Theorem 4(a)). If \psi is one to one, \psi(g^m) = \psi(g)^m = e_H puts g^m in K = \{e\}, so n divides m. \square
Proof of Theorem 9. (a) k \mapsto h^k is a homomorphism by the law h^{j + k} = h^j h^k (Cyclic groups, Lemma 1). If \psi(1) = h, then, as k is the k-th power of 1 written additively, \psi(k) = \psi(1)^k = h^k by Theorem 1.
(b) If \psi exists, then h^n = \psi([1])^n = \psi([n]) = \psi([0]) = e_H, and as in (a), \psi([k]) = h^k, so it is unique. Conversely, let h^n = e_H and set \psi([k]) = h^k. The rule names a class by one of its members, so it must be shown well defined: if [j] = [k], then j = k + qn for an integer q, and h^j = h^k(h^n)^q = h^k. Then \psi([j] + [k]) = \psi([j + k]) = h^{j + k}, which is \psi([j])\psi([k]). Finally, h^n = e_H if and only if \operatorname{ord}(h) divides n (Cyclic groups, Theorem 4(a)). \square
Proof of Theorem 10. \pi(ab) = abN = (aN)(bN) = \pi(a)\pi(b), the middle step being the equation of sets proved for normal N in Normal subgroups, Theorem 7. Each coset gN is \pi(g), so \pi is onto. The identity of G/N is N, and gN = N if and only if g \in N (Cosets, Lemma 2), so \ker \pi = N. \square
Proof of Corollary 11. Kernels are normal (Theorem 4); a normal N is \ker \pi (Theorem 10). \square
Worked examples
Three maps
Decide which maps are homomorphisms, and find the kernel and image of each one that is. (a) \psi : \mathbb{R} \to \mathbb{R}^\times, \psi(x) = 2^x, with \mathbb{R} under addition. (b) f : \mathbb{Z}_6 \to \mathbb{Z}_6, f([k]) = [k + 1]. (c) f, \psi : \operatorname{GL}_2(\mathbb{R}) \to \operatorname{GL}_2(\mathbb{R}), f(A) = A^T and \psi(A) = (A^T)^{-1}.
Solution(a) \psi(x + y) = 2^{x + y} = 2^x 2^y = \psi(x)\psi(y): a homomorphism from an additive group to a multiplicative one. 2^x = 1 only for x = 0, so \ker \psi = \{0\} and \psi is one to one (Corollary 6). Every y > 0 is 2^{\log_2 y}, and 2^x > 0, so \operatorname{im} \psi = \mathbb{R}_{>0}.
(b) f([0]) = [1] is not the identity [0], so f is not a homomorphism (Theorem 1).
(c) The transpose reverses products, (AB)^T = B^TA^T, so f(AB) = f(B)f(A). With A = \begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} and B = \begin{pmatrix} 1 & 0 \\ 1 & 1 \end{pmatrix},
so f is not a homomorphism. Inverting reverses the order once more: \psi(AB) = (B^TA^T)^{-1}, which is (A^T)^{-1}(B^T)^{-1} = \psi(A)\psi(B). Since \psi(A) = I_2 only when A = I_2, \ker \psi = \{I_2\}; and each C is \psi((C^{-1})^T), so \operatorname{im} \psi = \operatorname{GL}_2(\mathbb{R}).
Turning the plane
For real t let R_t = \begin{pmatrix} \cos t & -\sin t \\ \sin t & \cos t \end{pmatrix}, the rotation by t (Finding the matrix of a transformation). Show that \theta : \mathbb{R} \to \operatorname{GL}_2(\mathbb{R}), \theta(t) = R_t, is a homomorphism, find its kernel and the fiber over R_{\pi/3}, and show that [k] \mapsto R_{2\pi k/5} is a one-to-one homomorphism \mathbb{Z}_5 \to \operatorname{GL}_2(\mathbb{R}).
Solution\det R_t = \cos^2 t + \sin^2 t = 1. In R_sR_t, both diagonal entries are \cos s \cos t - \sin s \sin t = \cos(s + t), the lower left entry is \sin s \cos t + \cos s \sin t = \sin(s + t), and the upper right is its negative, by the angle addition formulas. So R_sR_t = R_{s + t}: \theta(s + t) = \theta(s)\theta(t).
R_t = I_2 exactly when \cos t = 1 and \sin t = 0, so \ker \theta = 2\pi\mathbb{Z}, the integer multiples of 2\pi. By Theorem 5 the fiber over R_{\pi/3} is the coset \displaystyle \frac{\pi}{3} + 2\pi\mathbb{Z}: the angles that differ from \displaystyle \frac{\pi}{3} by whole turns.
Let h = R_{2\pi/5}. By Theorem 1, \displaystyle h^k = \theta(\frac{2\pi k}{5}) = R_{2\pi k/5}, so h^5 = R_{2\pi} = I_2, and Theorem 9(b) makes [k] \mapsto h^k a homomorphism on \mathbb{Z}_5. Its kernel has order 1 or 5 by Lagrange’s theorem, and is not all of \mathbb{Z}_5, since \displaystyle \cos \frac{2\pi}{5} \ne 1. So the map is one to one: the rotations of a regular pentagon form a copy of \mathbb{Z}_5 inside \operatorname{GL}_2(\mathbb{R}).
Every homomorphism from Z_12 to Z_18
Find all homomorphisms \psi : \mathbb{Z}_{12} \to \mathbb{Z}_{18}, and the kernel, image and fibers of the one with \psi([1]_{12}) = [15]_{18}. Is [k]_{12} \mapsto [k]_{18} a homomorphism?
SolutionEvery class carries its modulus, as two are in play. By Theorem 9(b), written additively, \psi([1]_{12}) = [h]_{18} is possible exactly when 12[h]_{18} = [0]_{18}, that is, 18 \mid 12h. Dividing by 6, this is 3 \mid 2h, and as the prime 3 does not divide 2, it is 3 \mid h. So there are exactly six homomorphisms, \psi([k]_{12}) = [hk]_{18} with h = 0, 3, 6, 9, 12, 15.
For h = 15: 18 \mid 15k iff 6 \mid 5k iff 6 \mid k, so \ker \psi = \{[0]_{12}, [6]_{12}\}. By Corollary 7 the image has 12/2 = 6 elements, all multiples of 3, and there are six of those: the image is \{[0]_{18}, [3]_{18}, \dots, [15]_{18}\}. The fibers are the cosets \{[k]_{12}, [k + 6]_{12}\} (Theorem 5):
| fiber in \mathbb{Z}_{12} | value in \mathbb{Z}_{18} |
|---|---|
| \{0, 6\} | 0 |
| \{1, 7\} | 15 |
| \{2, 8\} | 12 |
| \{3, 9\} | 9 |
| \{4, 10\} | 6 |
| \{5, 11\} | 3 |
The rule [k]_{12} \mapsto [k]_{18} is not even a function: [0]_{12} = [12]_{12}, but [0]_{18} \ne [12]_{18}; in Theorem 9(b), h = 1 is not a multiple of 3. None of the six is one to one or onto: by Corollary 7 the size of the image divides 12 and 18, hence 6.
From S_3 to Z_6
Find every homomorphism \psi : S_3 \to \mathbb{Z}_6.
SolutionBy Theorem 4, K = \ker \psi is normal, of order 1, 2, 3 or 6. A subgroup of order 2 is \{e, (a\ b)\} for a transposition, and it is not normal: with c the third point, the cycle formula of Normal subgroups gives (a\ c)(a\ b)(a\ c)^{-1} = (c\ b). The only subgroup of order 3 is A_3 = \{e, (1\ 2\ 3), (1\ 3\ 2)\}, as the 3-cycles are the only elements of order 3. So K is \{e\}, A_3 or S_3.
If K = \{e\}, \psi is one to one (Corollary 6). With \sigma = (1\ 2) and \tau = (1\ 3), \psi(\sigma\tau) = \psi(\sigma) + \psi(\tau) = \psi(\tau\sigma), as \mathbb{Z}_6 is abelian, forcing \sigma\tau = \tau\sigma; but S_3 is not abelian (Permutation groups and cycle notation, Theorem 1). If K = S_3, \psi is trivial.
If K = A_3, then |\operatorname{im} \psi| = 2 (Corollary 7), and \{[0], [3]\} is the only subgroup of order 2 in \mathbb{Z}_6 (Cyclic groups, Theorem 10). The fibers are A_3 and the coset of the three transpositions, so \psi(\sigma) = [0] for even \sigma and [3] for odd \sigma. This rule is a homomorphism: by the product rule for the sign, a product is odd exactly when one factor is, matching [0] + [0] = [3] + [3] = [0] and [0] + [3] = [3].
So there are exactly two homomorphisms.
Coprime orders
Let G and H be finite groups with \gcd(|G|, |H|) = 1. Prove that the only homomorphism from G to H is the trivial one. For instance, every homomorphism from S_4 to \mathbb{Z}_{35} is trivial.
SolutionProof. Let \psi : G \to H be a homomorphism. By Corollary 7, |\operatorname{im} \psi| divides |G| and |H|, so it divides their greatest common divisor, 1. Hence \operatorname{im} \psi = \{e_H\}. \square
For the instance, |S_4| = 24 = 2^3 \cdot 3 and 35 = 5 \cdot 7 share no prime factor.
The three pairings
The set \{1, 2, 3, 4\} splits into two pairs in three ways:
A permutation \sigma \in S_4 sends \{\{a, b\}, \{c, d\}\} to \{\{\sigma(a), \sigma(b)\}, \{\sigma(c), \sigma(d)\}\}. Define \psi(\sigma) \in S_3 by: \sigma sends P_i to P_{\psi(\sigma)(i)}. Show that \psi is a homomorphism onto S_3 and find its kernel.
SolutionAs \sigma is one to one, the image of a pairing is a pairing, and \sigma^{-1} undoes \sigma, so \psi(\sigma) is a permutation of \{1, 2, 3\}. If \tau sends P_i to P_j and \sigma sends P_j to P_k, then \sigma\tau, with \tau first, sends P_i to P_k; so \psi(\sigma\tau) = \psi(\sigma)\psi(\tau). This is the action of S_4 on the three pairings, read as a homomorphism into \operatorname{Sym}(X) (Group actions, orbits and stabilizers, Lemma 1).
(1\ 2) fixes P_1 and sends P_2 to \{\{2, 3\}, \{1, 4\}\} = P_3, so \psi((1\ 2)) = (2\ 3). (1\ 2\ 3) sends P_1 to \{\{2, 3\}, \{1, 4\}\} = P_3, P_3 to \{\{2, 4\}, \{3, 1\}\} = P_2 and P_2 to \{\{2, 1\}, \{3, 4\}\} = P_1, so \psi((1\ 2\ 3)) = (1\ 3\ 2). The image is a subgroup of S_3 (Theorem 3) with elements of orders 2 and 3, so by Lagrange’s theorem its order is a multiple of 6: \operatorname{im} \psi = S_3.
By Corollary 7, |\ker \psi| = 24/6 = 4. A product (a\ b)(c\ d) of two disjoint transpositions keeps the pairs \{a, b\} and \{c, d\}, and swaps \{a, c\} with \{b, d\} and \{a, d\} with \{b, c\}, so it fixes all three pairings. So \ker \psi is the group V of e, (1\ 2)(3\ 4), (1\ 3)(2\ 4), (1\ 4)(2\ 3) from Normal subgroups, Example 4, and Theorem 4 proves again that V \trianglelefteq S_4. The fibers are the six cosets \sigma V.
Boundaries
- Images of normal subgroups. Preimages of normal subgroups are normal (Theorem 3(b)); images need not be. The inclusion of \{e, s\} into D_4 is a homomorphism whose image is not normal (Normal subgroups, Example 1). For an onto \psi they are (Exercise 16).
- Well defined first. A rule on \mathbb{Z}_n given through representatives is a function only if it ignores the choice; [k]_{12} \mapsto [k]_{18} does not (Example 3).
- Orders can drop. In Example 3, \operatorname{ord}([1]_{12}) = 12 but \operatorname{ord}([15]_{18}) = 6. Only a one-to-one \psi keeps orders (Theorem 8).
- Infinite groups. Corollary 7 needs G finite, but Theorem 5 does not: in Example 2 the cosets t + 2\pi\mathbb{Z} match the rotation matrices one to one.
Where this goes next
A homomorphism that is one to one and onto is an isomorphism. The bijection G/K \to \operatorname{im} \psi of Theorem 5 is itself a homomorphism, the first of the The isomorphism theorems: every image of G is a quotient of G. Group actions are homomorphisms into \operatorname{Sym}(X), as in Example 6. Ring homomorphisms also respect multiplication, and their kernels are Ideals and quotient rings.
Exercises
Testing maps
- Show that \psi : \mathbb{R}^\times \to \mathbb{R}^\times, \psi(x) = x^2, is a homomorphism, and find its kernel and image.
- Show that \psi([k]) = [4k] is a well-defined homomorphism \mathbb{Z}_{10} \to \mathbb{Z}_{10}, and find its kernel, its image and the fiber over [2].
- Find the kernel and image of \psi : \mathbb{C}^\times \to \mathbb{C}^\times, \psi(z) = z^4, and the fiber over 16.
- Decide whether \sigma \mapsto \sigma^2 is a homomorphism S_3 \to S_3.
- Explain why x \mapsto x^2 is a homomorphism \mathbb{Z}_{15}^\times \to \mathbb{Z}_{15}^\times, and find its kernel and image.
Maps out of cyclic groups
- Find every homomorphism \mathbb{Z}_8 \to \mathbb{Z}_{20}, with the kernel and image of each.
- Find every homomorphism \mathbb{Z}_6 \to S_3. Is any of them one to one?
- Let \psi : \mathbb{Z} \to S_5 be the homomorphism with \psi(1) = (1\ 2\ 3)(4\ 5). Find \ker \psi and |\operatorname{im} \psi|.
- Yuna, a watchmaker, meshes a driving wheel of 24 teeth with a smaller wheel. A wheel’s position is the number of the tooth at the contact point, counted from a marked start modulo its number of teeth, and turning the driving wheel on by one tooth turns the other on by one. Samir says the small wheel’s position is a function of the driving wheel’s. Is he right when the small wheel has 8 teeth? 9? For 8, find the kernel of the map.
Kernels and counting
- Find every homomorphism from D_4 onto \mathbb{Z}_2.
- Show that there is no homomorphism from S_3 onto \mathbb{Z}_3.
- For the \psi of Example 6, find \psi((1\ 2\ 3\ 4)) and list the four elements of the fiber over it.
Proofs
- Prove that G is abelian if and only if g \mapsto g^{-1} is a homomorphism G \to G.
- Let \psi, \theta : G \to H be homomorphisms and let S generate G. Prove that if \psi(s) = \theta(s) for every s \in S, then \psi = \theta.
- Let \psi : G \to H be a homomorphism. Prove that if G is abelian, so is \operatorname{im} \psi, and that if G = \langle a \rangle, then \operatorname{im} \psi = \langle \psi(a) \rangle.
- Let \psi : G \to H be an onto homomorphism and N \trianglelefteq G. Prove that \psi(N) \trianglelefteq H.
- Prove that for positive integers n and m there are exactly \gcd(n, m) homomorphisms \mathbb{Z}_n \to \mathbb{Z}_m.
- Let \psi : G \to H be a homomorphism with G finite and kernel K, and let L \le H. Prove that |\psi^{-1}(L)| = |K| \cdot |L \cap \operatorname{im} \psi|.
Answers
- \mathbb{R}^\times is abelian, so (xy)^2 = x^2y^2. x^2 = 1 exactly for x = \pm 1: \ker \psi = \{1, -1\}. Squares are positive and each y > 0 is \displaystyle (\sqrt{y})^2: \operatorname{im} \psi = \mathbb{R}_{>0}.
- If [j] = [k], then 10 \mid j - k, so 10 \mid 4j - 4k. \psi([j] + [k]) = [4j + 4k], which is \psi([j]) + \psi([k]). 10 \mid 4k iff 5 \mid k: \ker \psi = \{[0], [5]\}. The image is \{[0], [2], [4], [6], [8]\}, and 2 \cdot 5 = 10. As [4 \cdot 3] = [2], the fiber over [2] is [3] + \ker \psi = \{[3], [8]\}.
- (zw)^4 = z^4w^4. \ker \psi = \mu_4 = \{1, i, -1, -i\}. Every nonzero complex number has a fourth root (Roots of a complex number and roots of unity), so \operatorname{im} \psi = \mathbb{C}^\times. As 2^4 = 16, the fiber over 16 is 2\mu_4 = \{2, 2i, -2, -2i\}.
- No. For \sigma = (1\ 2) and \tau = (1\ 3), \sigma\tau = (1\ 3\ 2) and (\sigma\tau)^2 = (1\ 2\ 3), while \sigma^2\tau^2 = e.
- The group is abelian, so (xy)^2 = x^2y^2. The units 1, 2, 4, 7, 8, 11, 13, 14 square to 1, 4, 1, 4, 4, 1, 4, 1. So \ker = \{1, 4, 11, 14\} and \operatorname{im} = \{1, 4\}, and 4 \cdot 2 = 8.
- By Theorem 9(b), [1] \mapsto [h] works iff 20 \mid 8h, iff 5 \mid h. Four homomorphisms [k] \mapsto [hk]: h = 0, kernel \mathbb{Z}_8, image \{[0]\}; h = 5 and h = 15, kernel \{[0], [4]\}, image \{[0], [5], [10], [15]\}; h = 10, kernel \{[0], [2], [4], [6]\}, image \{[0], [10]\}.
- Every element of S_3 has order 1, 2 or 3, dividing 6, so by Theorem 9(b) each h \in S_3 gives one homomorphism [k] \mapsto h^k: six in all. None is one to one: the image is \langle h \rangle, with \operatorname{ord}(h) \le 3 elements.
- \operatorname{ord}((1\ 2\ 3)(4\ 5)) = \operatorname{lcm}(3, 2) = 6 (Permutation groups and cycle notation, Theorem 4), so \psi(k) = e iff 6 \mid k: \ker \psi = 6\mathbb{Z}, and |\operatorname{im} \psi| = 6.
- With 8 teeth, yes: after k teeth the wheels are at [k]_{24} and [k]_8, and 24 \mid j - k gives 8 \mid j - k. The map [k]_{24} \mapsto [k]_8 is a homomorphism (Theorem 9(b), as 24[1]_8 = [0]_8) with kernel \{[0]_{24}, [8]_{24}, [16]_{24}\}. With 9, no: after 24 teeth the driving wheel is back at [0]_{24}, but the small wheel is at [24]_9 = [6]_9, not [0]_9.
- Exactly three. An onto \psi has a normal kernel N with 8/2 = 4 elements (Theorem 4, Corollary 7): \langle r \rangle, \{e, r^2, s, r^2s\} or \{e, r^2, rs, r^3s\}, each of index 2 (Normal subgroups, Exercise 7). By Theorem 5, \psi sends N to 0 and the rest to 1. This rule is a homomorphism: if a, b \notin N, then a^{-1}N is the coset other than N, so it contains b, and ab \in N, matching 1 + 1 = 0; if exactly one of a, b lies in N, then ab \notin N, as otherwise a^{-1}(ab) or (ab)b^{-1} would, matching 0 + 1 = 1.
- An onto \psi would have |\ker \psi| = 6/3 = 2 (Corollary 7) and a normal kernel (Theorem 4), but no subgroup of order 2 in S_3 is normal (Example 4).
- (1\ 2\ 3\ 4) sends P_1 to \{\{2, 3\}, \{4, 1\}\} = P_3, P_2 to \{\{2, 4\}, \{3, 1\}\} = P_2 and P_3 to P_1, so \psi((1\ 2\ 3\ 4)) = (1\ 3). The fiber is the coset (1\ 2\ 3\ 4)V, whose elements are (1\ 2\ 3\ 4), (1\ 3), (1\ 4\ 3\ 2) and (2\ 4).
- Proof. If G is abelian, (ab)^{-1} = b^{-1}a^{-1} = a^{-1}b^{-1}. Conversely, if inversion is a homomorphism, then ba = (a^{-1}b^{-1})^{-1}, which is (a^{-1})^{-1}(b^{-1})^{-1} = ab. \square
- Proof. Let E = \{g \in G : \psi(g) = \theta(g)\}. Then e \in E (Theorem 1); for g, h \in E, \psi(gh) = \psi(g)\psi(h) = \theta(g)\theta(h) = \theta(gh) and \psi(g^{-1}) = \psi(g)^{-1} = \theta(g)^{-1} = \theta(g^{-1}). So E is a subgroup containing S, hence E \supseteq \langle S \rangle = G. \square
- Proof. \psi(a)\psi(b) = \psi(ab) = \psi(ba) = \psi(b)\psi(a). If G = \langle a \rangle, each element of \operatorname{im} \psi is \psi(a^k) = \psi(a)^k (Theorem 1); and \langle \psi(a) \rangle \subseteq \operatorname{im} \psi, a subgroup containing \psi(a) (Cyclic groups, Theorem 2). \square
- Proof. \psi(N) \le H by Theorem 3(a). Let h \in H and n \in N. As \psi is onto, h = \psi(g) for some g, and h\psi(n)h^{-1} = \psi(gng^{-1}) \in \psi(N), since gng^{-1} \in N. \square
- Proof. By Theorem 9(b), the homomorphisms match the h \in \{0, 1, \dots, m - 1\} with m \mid nh. Let d = \gcd(n, m), n = dn', m = dm'; then \gcd(n', m') = 1, so 1 = um' + vn' for integers u, v (Bezout's identity and the extended Euclidean algorithm). Now m \mid nh iff m' \mid n'h. If m' \mid n'h, then h = um'h + v(n'h) is a multiple of m'; the converse is clear. The multiples of m' in \{0, \dots, m - 1\} are 0, m', \dots, (d - 1)m': d of them. \square
- Proof. \psi^{-1}(L) is the union of the fibers over the elements of L \cap \operatorname{im} \psi, as elements of L outside the image have empty fibers. Fibers over different values are disjoint, and by Theorem 5 each is a coset of K, with |K| elements (Cosets, Theorem 4). \square