Isomorphisms

The rotations of a triangle and the integers mod 3 have the same operation table once their elements are renamed. When should two groups count as the same group, and how can anyone prove that two groups are different?

Where you are 6 in Homomorphisms

Why this exists

Earlier lessons kept meeting groups whose operation tables agree after renaming: the symmetries of a rectangle and V_4 (Integers mod n, symmetries and matrices as groups, Example 3); a cyclic group and \mathbb{Z} or \mathbb{Z}_n (Cyclic groups, Theorem 5); any group with the dihedral relations and D_n (Dihedral groups, Theorem 5). Group theory studies only what the operation does, so such groups should count as one. An isomorphism turns “the same table after renaming” into a definition that also works for infinite groups, and it gives a way to prove two groups different. The word is the one Graph isomorphism: when two drawings are the same graph uses: there a renaming keeps the edges, here it keeps the products.

Definition

Let G and H be groups. An isomorphism from G to H is a homomorphism \psi : G \to H that is one to one and onto, that is, a bijection (One-to-one, onto and bijective functions) with

\psi(ab) = \psi(a)\psi(b) \quad \text{for all } a, b \in G.

G is isomorphic to H, written G \cong H, if there is an isomorphism from G to H. An isomorphism from G to itself is an automorphism of G, and \operatorname{Aut}(G) is the set of them. A property of groups is an invariant if, whenever G has it and G \cong H, H has it too.

For a finite group, replace every element g of its operation table, in the headings and the body, by \psi(g). The entry in row \psi(a) and column \psi(b) becomes \psi(ab), which the condition says is \psi(a)\psi(b), the entry of H’s table. So for finite groups, isomorphic means exactly: the same table after a renaming.

Intuition

An isomorphism is a dictionary: each element of G has one translation, every element of H is a translation, and the translation of a product is the product of the translations. So every sentence about G written with its operation alone (“a has order 4”, “the group is abelian”) translates into a true sentence about H. Sentences about what the elements are (“it is a matrix”) do not translate, and are not invariants.

So to prove G \cong H, exhibit a map and check it (Examples 1 and 3); to prove G \not\cong H, find an invariant that differs (Examples 2 and 7). One bijection failing proves nothing, since another might succeed. Cayley’s theorem (Theorem 6) says that every group is a renamed group of permutations: g is recorded by the shuffle x \mapsto gx of G.

Results

Throughout, G, H and K are groups.

Theorem 1 (the inverse). If \psi : G \to H is an isomorphism, so is \psi^{-1} : H \to G.

Theorem 2 (isomorphism behaves like an equivalence). G \cong G; if G \cong H, then H \cong G; and if G \cong H and H \cong K, then G \cong K.

Theorem 3 (invariants). Let \psi : G \to H be an isomorphism. (a) |G| = |H|. (b) For every g \in G, \operatorname{ord}(g) and \operatorname{ord}(\psi(g)) are both infinite or both finite and equal. So for each n, \psi maps the elements of order n in G one to one onto those in H. (c) G is abelian if and only if H is. (d) If G = \langle a \rangle, then H = \langle \psi(a) \rangle; so G is cyclic if and only if H is. (e) A \mapsto \psi(A) is a bijection from the subgroups of G onto those of H, with |\psi(A)| = |A|, and \psi(A) \trianglelefteq H if and only if A \trianglelefteq G. (f) \psi(Z(G)) = Z(H).

Theorem 4 (cyclic groups). Let G = \langle a \rangle. (a) If G is infinite, k \mapsto a^k is an isomorphism \mathbb{Z} \to G. (b) If |G| = n, [k] \mapsto a^k is an isomorphism \mathbb{Z}_n \to G. (c) Two cyclic groups are isomorphic if and only if they have the same order. (d) If |G| = n, the isomorphisms \mathbb{Z}_n \to G are exactly the maps [k] \mapsto b^k with b a generator of G; there are \varphi(n) of them.

Corollary 5 (prime order). If |G| = p for a prime p, then G \cong \mathbb{Z}_p.

Theorem 6 (Cayley’s theorem). For g \in G let \lambda_g : G \to G, \lambda_g(x) = gx. Then \Lambda : G \to \operatorname{Sym}(G), \Lambda(g) = \lambda_g, is a one-to-one homomorphism, so G is isomorphic to the subgroup \{\lambda_g : g \in G\} of \operatorname{Sym}(G). If |G| = n, then G is isomorphic to a subgroup of S_n.

Theorem 7 (automorphisms). \operatorname{Aut}(G) is a subgroup of \operatorname{Sym}(G), and the conjugation c_g(x) = gxg^{-1} lies in \operatorname{Aut}(G) for every g \in G.

Theorem 8 (automorphisms of \mathbb{Z}_n). Let n \ge 2. For [u] \in \mathbb{Z}_n^\times, \mu_u([k]) = [uk] is an automorphism of \mathbb{Z}_n, every automorphism of \mathbb{Z}_n is one of these, and [u] \mapsto \mu_u is an isomorphism \mathbb{Z}_n^\times \to \operatorname{Aut}(\mathbb{Z}_n).

Why it is true

Proof of Theorem 1. \psi^{-1} is a bijection (Composing functions between sets, and when an inverse exists). For h, k \in H put a = \psi^{-1}(h) and b = \psi^{-1}(k). Then \psi(ab) = \psi(a)\psi(b) = hk, so \psi^{-1}(hk) = ab = \psi^{-1}(h)\psi^{-1}(k). \square

Proof of Theorem 2. \mathrm{id}_G is a bijective homomorphism (Homomorphisms and kernels, Theorem 2). Symmetry is Theorem 1. If \psi : G \to H and \theta : H \to K are isomorphisms, then \theta \circ \psi is a homomorphism (Theorem 2 there) and a composition of bijections. \square (Groups do not form a set, so \cong is not a relation on a set as in Relations, equivalence classes and partitions, but it sorts groups into classes the same way.)

Proof of Theorem 3. (a) \psi is a bijection. (b) If \operatorname{ord}(g) = n is finite, then \operatorname{ord}(\psi(g)) = n, as \psi is one to one (Homomorphisms and kernels, Theorem 8). If \operatorname{ord}(\psi(g)) = m is finite, the same theorem for \psi^{-1} (Theorem 1) gives \operatorname{ord}(g) = m. So \psi carries the elements of order n into those of order n, \psi^{-1} carries them back, and the restriction is a bijection.

(c) If G is abelian, so is \operatorname{im} \psi = H (Homomorphisms and kernels, Exercise 15); for the converse apply this to \psi^{-1}. (d) By the same exercise, H = \operatorname{im} \psi = \langle \psi(a) \rangle; use \psi^{-1} for the converse.

(e) \psi(A) \le H, and for L \le H the preimage \psi^{-1}(L), which is the image of L under \psi^{-1}, is a subgroup of G (Homomorphisms and kernels, Theorem 3). As \psi is a bijection, \psi^{-1}(\psi(A)) = A and \psi(\psi^{-1}(L)) = L, so the two maps on subgroups are inverse to each other, and |\psi(A)| = |A|. If A \trianglelefteq G, then \psi(A) \trianglelefteq H because \psi is onto (Homomorphisms and kernels, Exercise 16); if \psi(A) \trianglelefteq H, then A = \psi^{-1}(\psi(A)) \trianglelefteq G (Theorem 3(b) there).

(f) Let z \in Z(G) and h \in H, say h = \psi(g). Then \psi(z)h = \psi(zg) = \psi(gz) = h\psi(z), so \psi(Z(G)) \subseteq Z(H). The same for \psi^{-1} gives \psi^{-1}(Z(H)) \subseteq Z(G); applying \psi, Z(H) \subseteq \psi(Z(G)). \square

Proof of Theorem 4. (a) and (b) are Cyclic groups, Theorem 5: each map is a bijection that turns sums into products. (c) Two infinite cyclic groups are both isomorphic to \mathbb{Z}, and two of order n both to \mathbb{Z}_n, so they are isomorphic by Theorem 2; groups of different orders are not, by Theorem 3(a).

(d) An isomorphism \psi sends [1], of order n, to b = \psi([1]) of order n (Theorem 3(b)), so |\langle b \rangle| = n = |G| and b generates G; and \psi([k]) = b^k (Homomorphisms and kernels, Theorem 9(b)). Conversely, if b generates G, then b^n = e, so [k] \mapsto b^k is a homomorphism (Theorem 9(b) there) onto \langle b \rangle = G, and an onto map between two sets of n elements is one to one. Different generators give maps that differ at [1], and there are \varphi(n) generators (Cyclic groups, Corollary 9). \square

Proof of Corollary 5. G is cyclic (Lagrange's theorem, Corollary 3); apply Theorem 4(b). \square

Proof of Theorem 6. \lambda_{g^{-1}} undoes \lambda_g on both sides, as g^{-1}gx = gg^{-1}x = x, so \lambda_g lies in the group \operatorname{Sym}(G) of Binary operations and the group axioms. By associativity, \lambda_{gh}(x) = (gh)x = g(hx) = \lambda_g(\lambda_h(x)), so \Lambda(gh) = \lambda_g \circ \lambda_h. If \lambda_g = \mathrm{id}_G, then g = \lambda_g(e) = e; so \ker \Lambda = \{e\}, \Lambda is one to one (Homomorphisms and kernels, Corollary 6), and it is an isomorphism onto its image, a subgroup (Theorem 3 there).

If |G| = n, number the elements by a bijection \beta : \{1, \dots, n\} \to G. Then \sigma \mapsto \beta^{-1}\sigma\beta is a homomorphism \operatorname{Sym}(G) \to S_n, since \beta^{-1}\sigma\tau\beta = (\beta^{-1}\sigma\beta)(\beta^{-1}\tau\beta), with inverse \pi \mapsto \beta\pi\beta^{-1}. Composed with \Lambda it is a one-to-one homomorphism G \to S_n. \square In the language of Group actions, orbits and stabilizers, \Lambda is the action of G on itself by left multiplication.

Proof of Theorem 7. \mathrm{id}_G \in \operatorname{Aut}(G); for \alpha, \beta \in \operatorname{Aut}(G), \alpha \circ \beta is an automorphism by the proof of Theorem 2, and \alpha^{-1} by Theorem 1. So \operatorname{Aut}(G) \le \operatorname{Sym}(G) by the subgroup test (Subgroups, Theorem 2). By Normal subgroups, Theorem 1, c_g is a bijection with c_g(xy) = c_g(x)c_g(y). \square

Proof of Theorem 8. [u] is a unit exactly when \gcd(u, n) = 1 (Integers mod n, symmetries and matrices as groups, Theorem 2), that is, exactly when [u] generates \mathbb{Z}_n (Cyclic groups, Corollary 9). Theorem 4(d) for G = \mathbb{Z}_n, written additively, says the automorphisms are the maps [k] \mapsto k[u] = [uk] for these [u]. Let \Theta([u]) = \mu_u, which depends only on the class [u] (Relations, equivalence classes and partitions, Theorem 8). Since \mu_u(\mu_v([k])) = [uvk], \Theta([u][v]) = \Theta([u]) \circ \Theta([v]). \Theta is onto, as just shown, and one to one, since \mu_u([1]) = [u]. \square

Worked examples

Example 1

Complex numbers as matrices

Let \theta : \mathbb{C}^\times \to \operatorname{GL}_2(\mathbb{R}), \theta(a + bi) = \begin{pmatrix} a & -b \\ b & a \end{pmatrix} for real a and b. Show that \theta is a one-to-one homomorphism, and conclude that \mathbb{C}^\times is isomorphic to a group of matrices. Is \theta onto \operatorname{GL}_2(\mathbb{R})?

Solution

For z = a + bi \ne 0, \det \theta(z) = a^2 + b^2 > 0, so \theta(z) \in \operatorname{GL}_2(\mathbb{R}). For w = c + di, by the Matrix multiplication,

\theta(z)\theta(w) = \begin{pmatrix} ac - bd & -(ad + bc) \\ ad + bc & ac - bd \end{pmatrix},

and zw = (ac - bd) + (ad + bc)i, so \theta(zw) = \theta(z)\theta(w). \theta(z) = I_2 exactly when a = 1 and b = 0, so \ker \theta = \{1\} and \theta is one to one (Homomorphisms and kernels, Corollary 6). So \theta is a bijective homomorphism onto its image M, a subgroup of \operatorname{GL}_2(\mathbb{R}): \mathbb{C}^\times \cong M.

\theta is not onto: \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} would need a = 1 and a = -1. A one-to-one homomorphism is an isomorphism onto its image. On S^1, \theta(\cos t + i \sin t) is the rotation R_t of Homomorphisms and kernels, Example 2.

Example 2

Five groups of order eight

Show that no two of \mathbb{Z}_8, \mathbb{Z}_{15}^\times, \mathbb{Z}_{24}^\times, D_4 and Q_8 are isomorphic.

Solution

Use two invariants: being abelian (Theorem 3(c)) and the number of elements of order 2 (Theorem 3(b)).

groupabelianorder 2
\mathbb{Z}_8yes1
\mathbb{Z}_{15}^\timesyes3
\mathbb{Z}_{24}^\timesyes7
D_4no5
Q_8no1

In \mathbb{Z}_8 only 4 has order 2. Mod 15 they are 4, 11, 14, while 2, 7, 8, 13 square to 4. Every element of \mathbb{Z}_{24}^\times squares to 1 (Cyclic groups, Example 4). In D_4 they are r^2, s, rs, r^2s, r^3s (Dihedral groups, Theorem 4), and sr = r^{-1}s \ne rs. In Q_8, \pm i, \pm j, \pm k square to -1, and ij = k \ne ji.

The five pairs (abelian, count) differ, so no two groups are isomorphic. Agreement would settle nothing: \mathbb{Z}_{16}^\times is also abelian with three elements of order 2 (7, 9, 15), and whether it is isomorphic to \mathbb{Z}_{15}^\times takes a map.

Example 3

Units mod 15 and mod 16

Find an isomorphism \mathbb{Z}_{15}^\times \to \mathbb{Z}_{16}^\times.

Solution

In \mathbb{Z}_{15}^\times, a = 2 has order 4, with \langle a \rangle = \{1, 2, 4, 8\}, and b = 14 has order 2 and lies outside it; the coset b\langle a \rangle = \{14, 13, 11, 7\} holds the other four elements. So every element is a^ib^j with 0 \le i \le 3 and 0 \le j \le 1 in exactly one way: the coset fixes j, then a^i fixes i (Cyclic groups, Theorem 4(a)). In \mathbb{Z}_{16}^\times, c = 3 has powers 3, 9, 11, 1, and d = 15 has order 2, with d\langle c \rangle = \{15, 13, 7, 5\}.

Define \psi(a^ib^j) = c^id^j: well defined by the uniqueness, and a bijection, since the eight pairs (i, j) list each group once. Both groups are abelian, so (a^ib^j)(a^kb^l) = a^{i + k}b^{j + l}; and as a^4 = c^4 = 1 and b^2 = d^2 = 1, exponents may be reduced mod 4 and mod 2 on both sides, so \psi of the product is c^{i + k}d^{j + l} = (c^id^j)(c^kd^l).

x\psi(x)x\psi(x)
111415
231313
49117
81175

Other choices of c and d give other isomorphisms; there are 8 in all.

Example 4

The automorphisms of Z_9

Identify \operatorname{Aut}(\mathbb{Z}_9) up to isomorphism, and find every automorphism that sends [3] to [6].

Solution

By Theorem 8, \operatorname{Aut}(\mathbb{Z}_9) \cong \mathbb{Z}_9^\times, whose elements are 1, 2, 4, 5, 7, 8. The powers of 2 mod 9 are 2, 4, 8, 7, 5, 1, so \mathbb{Z}_9^\times is cyclic of order 6, and by Theorems 4(b) and 2, \operatorname{Aut}(\mathbb{Z}_9) \cong \mathbb{Z}_6, generated by \mu_2.

\mu_u([3]) = [6] means 9 \mid 3u - 6, that is 3 \mid u - 2: u \in \{2, 5, 8\}. Three automorphisms send [3] to [6]: the image of a generator fixes an automorphism (Theorem 4(d)), but [3] is not a generator.

Example 5

The quaternion group in S_8

Number the elements 1, -1, i, -i, j, -j, k, -k of Q_8 as 1 to 8. Write \lambda_i and \lambda_j of Theorem 6 as permutations in S_8, and check that \lambda_i\lambda_j = \lambda_k.

Solution

\lambda_i sends 1 \mapsto i \mapsto -1 \mapsto -i \mapsto 1 and j \mapsto ij = k \mapsto ik = -j \mapsto -k \mapsto j. In numbers, \lambda_i = (1\ 3\ 2\ 4)(5\ 7\ 6\ 8). Likewise \lambda_j sends 1 \mapsto j \mapsto -1 \mapsto -j \mapsto 1 and i \mapsto ji = -k \mapsto -i \mapsto k \mapsto i, so \lambda_j = (1\ 5\ 2\ 6)(3\ 8\ 4\ 7).

1
i
-1
-i
j
k
-j
-k
\lambda_i
1
j
-1
-j
i
-k
-i
k
\lambda_j
Figure 1Cayley’s theorem for Q_8 (Example 5). Left multiplication by i and by j each shuffle the eight elements in two disjoint 4-cycles, and neither fixes any element.

With \lambda_j first, 1 \mapsto 5 \mapsto 7, 7 \mapsto 3 \mapsto 2, 2 \mapsto 6 \mapsto 8, 8 \mapsto 4 \mapsto 1, and similarly for 3, 5, 4, 6, so \lambda_i\lambda_j = (1\ 7\ 2\ 8)(3\ 5\ 4\ 6). Directly, \lambda_k sends 1 \mapsto k \mapsto -1 \mapsto -k and i \mapsto ki = j \mapsto -i \mapsto -j: the same permutation, as \Lambda(ij) = \lambda_i\lambda_j requires. Also \lambda_{-1} = (1\ 2)(3\ 4)(5\ 6)(7\ 8), and no \lambda_g with g \ne 1 fixes a number, since gx = x forces g = 1. The eight \lambda_g form a copy of Q_8 inside S_8.

Example 6

Groups of order six

Prove that every group of order 6 is isomorphic to \mathbb{Z}_6 or to S_3, and that these two are not isomorphic.

Solution

Proof. Let |G| = 6. If G is cyclic, G \cong \mathbb{Z}_6 (Theorem 4(b)). Otherwise G has an element a of order 3 and an element b of order 2 (Lagrange's theorem, Exercise 17). N = \langle a \rangle has index 2, so bN = Nb (Cosets, Exercise 13), and ba = nb for some n \in N = \{e, a, a^2\}; that is, bab^{-1} = n, and n \ne e as a \ne e.

If bab^{-1} = a, then ab = ba, and as \gcd(3, 2) = 1, \operatorname{ord}(ab) = 6 (Cyclic groups, Exercise 14): G would be cyclic. So bab^{-1} = a^{-1}, and as b^{-1} = b, bab = a^{-1}. Also b \notin \langle a \rangle, whose elements have orders 1 and 3. By Dihedral groups, Theorem 5 with n = 3, \langle a, b \rangle has 6 elements, so it is G, and G \cong D_3 (Theorem 1 turns that isomorphism around).

S_3 has order 6 and is not abelian, so not cyclic; the same argument gives S_3 \cong D_3, and G \cong S_3 by Theorem 2. Finally \mathbb{Z}_6 is abelian and S_3 is not, so \mathbb{Z}_6 \not\cong S_3 (Theorem 3(c)). \square

Example 7

Two infinite groups that differ

Prove that (\mathbb{Q}, +) and (\mathbb{Q}_{>0}, \cdot) are not isomorphic, although both are infinite and abelian and neither has an element of finite order other than its identity.

Solution

Proof. Suppose \psi : \mathbb{Q} \to \mathbb{Q}_{>0} is an isomorphism. As \psi is onto, 2 = \psi(x) for some x \in \mathbb{Q}. Then \displaystyle x = \frac{x}{2} + \frac{x}{2} with \displaystyle \frac{x}{2} \in \mathbb{Q}, so \displaystyle 2 = \psi(\frac{x}{2})^2 is the square of a positive rational number. But \displaystyle \sqrt{2} is irrational (Proof by contradiction). \square

The invariant is “every element is a square”, additively “every element is y + y”. Over the reals the groups match: x \mapsto 2^x maps (\mathbb{R}, +) one to one onto \mathbb{R}_{>0} (Homomorphisms and kernels, Example 1).

Boundaries

  • Agreeing invariants prove nothing. An abelian and a non-abelian group of order 16, the products of \mathbb{Z}_4 with itself and of Q_8 with \mathbb{Z}_2 (Direct products and finite abelian groups), both have one element of order 1, three of order 2 and twelve of order 4.
  • Both halves are needed. \mathbb{Z}_6 and S_3 are in bijection but not isomorphic; the \theta of Example 1 is a one-to-one homomorphism but not onto. \mathbb{Z} and \mathbb{Q} are in bijection (Countable sets), but \mathbb{Q} is not cyclic.
  • There is rarely one isomorphism. A cyclic group of order n is isomorphic to \mathbb{Z}_n in \varphi(n) ways, none preferred, and the isomorphisms G \to H, if any, match the elements of \operatorname{Aut}(G) (Exercise 15).
  • Cayley’s n is not the least. Theorem 6 puts S_3 inside S_6, though S_3 already permutes three points.

Where this goes next

The The isomorphism theorems show that the bijection from the cosets of a kernel onto the image (Homomorphisms and kernels, Theorem 5) is an isomorphism. Direct products and finite abelian groups classifies the finite abelian groups up to isomorphism. With Theorem 4(b), The Sylow theorems Exercise 16 makes every group of order pq, for primes p < q with p \nmid q - 1, isomorphic to \mathbb{Z}_{pq}. Automorphisms return in the Galois group of a field, and Ring homomorphisms defines isomorphism for rings.

Exercises

Checking isomorphisms

  1. Show that \theta : \mathbb{R} \to \operatorname{GL}_2(\mathbb{R}), \theta(t) = \begin{pmatrix} 1 & t \\ 0 & 1 \end{pmatrix}, with \mathbb{R} under addition, is a one-to-one homomorphism, so (\mathbb{R}, +) is isomorphic to a group of matrices.
  2. Show that k \mapsto 3k is an isomorphism from \mathbb{Z} onto 3\mathbb{Z}, both under addition, and that it and k \mapsto -3k are the only isomorphisms \mathbb{Z} \to 3\mathbb{Z}.
  3. How many isomorphisms \mathbb{Z}_{12} \to \mathbb{Z}_{13}^\times are there? For the one with \psi([1]) = 6, find \psi([5]).
  4. As in Example 3, find an isomorphism \mathbb{Z}_{15}^\times \to \mathbb{Z}_{20}^\times.

Telling groups apart

  1. Sort into isomorphism classes: \mathbb{Z}_6, \mathbb{Z}_7^\times, \mathbb{Z}_{14}^\times, S_3, \operatorname{GL}_2(\mathbb{Z}_2), D_3.
  2. Show that no two of (\mathbb{R}, +), \mathbb{R}^\times and \mathbb{C}^\times are isomorphic.
  3. Show that S_4 \not\cong D_{12} and A_4 \not\cong D_6.
  4. Jasmine, a lockmaker, builds two locks. The first has a dial with four click stops, and a move turns it clockwise by some number of clicks. The second has two bolts, and a move slides some of them to the other side: none, the first, the second, or both. In each lock the moves, done one after another, form a group of order 4. Isaac says the two locks are the same puzzle with the parts renamed. Is he right?

Automorphisms and Cayley’s theorem

  1. Show that \operatorname{Aut}(\mathbb{Z}_{10}) is cyclic and \operatorname{Aut}(\mathbb{Z}_{12}) is not.
  2. Find every automorphism of \mathbb{Z}_7^\times, and the one that sends 3 to 5.
  3. Number the elements 1, 5, 7, 11 of \mathbb{Z}_{12}^\times as 1 to 4. Write \lambda_5, \lambda_7 and \lambda_{11} of Theorem 6 in cycle notation.
  4. How many different maps c_g are there as g runs over D_4? Over S_3?

Proofs

  1. Prove that g \mapsto c_g is a homomorphism G \to \operatorname{Aut}(G) with kernel Z(G), and that a finite G has exactly [G : Z(G)] different maps c_g.
  2. Let |G| = n and \operatorname{ord}(g) = m. Prove that \lambda_g is a product of n/m disjoint m-cycles.
  3. Let \psi : G \to H be an isomorphism. Prove that \operatorname{Aut}(G) \cong \operatorname{Aut}(H), and that the isomorphisms G \to H are exactly the maps \psi \circ \alpha with \alpha \in \operatorname{Aut}(G), each given by one \alpha.
  4. Prove that every group of order 4 is isomorphic to \mathbb{Z}_4 or to V_4, and that these two are not isomorphic.
  5. Prove that \operatorname{Aut}(\mathbb{Z}) has exactly two elements and is isomorphic to \mathbb{Z}_2.
Answers
  1. \theta(s)\theta(t) = \begin{pmatrix} 1 & s + t \\ 0 & 1 \end{pmatrix} = \theta(s + t), and \det \theta(t) = 1. \theta(t) = I_2 only for t = 0, so \theta is one to one, an isomorphism onto its image.
  2. 3(j + k) = 3j + 3k; 3k = 0 only for k = 0; every element of 3\mathbb{Z} is 3k. An isomorphism \psi has 3\mathbb{Z} = \langle \psi(1) \rangle (Theorem 3(d)), so m = \psi(1) has m \mid 3 and 3 \mid m: m = \pm 3, and \psi(k) = km (Homomorphisms and kernels, Theorem 9(a)). Both signs work.
  3. Four. 2^4 \equiv 3 and 2^6 \equiv -1 \pmod{13}, so \operatorname{ord}(2) = 12 and \mathbb{Z}_{13}^\times is cyclic; by Theorem 4(d) there are \varphi(12) = 4, one per generator 2, 6, 7, 11. With \psi([1]) = 6: 6^2 \equiv 10, 6^4 \equiv 9, so \psi([5]) = 6^5 \equiv 54 \equiv 2.
  4. In \mathbb{Z}_{20}^\times, 3 has powers 3, 9, 7, 1, and 19 has order 2 with 19\langle 3 \rangle = \{19, 17, 11, 13\}. As in Example 3, \psi(2^i14^j) = 3^i19^j: 1 \mapsto 1, 2 \mapsto 3, 4 \mapsto 9, 8 \mapsto 7, 14 \mapsto 19, 13 \mapsto 17, 11 \mapsto 11, 7 \mapsto 13.
  5. \{\mathbb{Z}_6, \mathbb{Z}_7^\times, \mathbb{Z}_{14}^\times\} and \{S_3, \operatorname{GL}_2(\mathbb{Z}_2), D_3\}. The powers of 3 are 3, 2, 6, 4, 5, 1 mod 7 and 3, 9, 13, 11, 5, 1 mod 14, so both unit groups are cyclic of order 6 (Theorem 4). The other three are non-abelian of order 6 (Integers mod n, symmetries and matrices as groups, Example 5; srs = r^{-1} \ne r in D_3), so \cong S_3 (Example 6).
  6. In (\mathbb{R}, +), x + x = 0 only for x = 0: no element of order 2. In \mathbb{R}^\times, -1 has order 2, but a real x with x^4 = 1 has x^2 = 1: no element of order 4. In \mathbb{C}^\times, i has order 4. Apply Theorem 3(b).
  7. Z(S_4) = \{e\} (Permutation groups and cycle notation, Example 6) and Z(D_{12}) = \{e, r^6\} (Dihedral groups, Theorem 4); use Theorem 3(f). A_4 holds e, eight 3-cycles and three products of two disjoint transpositions, so no element of order 6; r \in D_6 has order 6.
  8. No. Dial moves add clicks mod 4, a copy of \mathbb{Z}_4, where one click has order 4. Any bolt move done twice puts every bolt back, so every element of that group has order at most 2. By Theorem 3(b) the groups differ. (The bolt group is a copy of V_4, by Exercise 16.)
  9. By Theorem 8, \operatorname{Aut}(\mathbb{Z}_{10}) \cong \mathbb{Z}_{10}^\times = \{1, 3, 7, 9\}, where 3 has powers 3, 9, 7, 1: cyclic. \operatorname{Aut}(\mathbb{Z}_{12}) \cong \mathbb{Z}_{12}^\times = \{1, 5, 7, 11\}, where 5^2, 7^2, 11^2 are all \equiv 1: no element of order 4, so not cyclic (Theorem 3(d)).
  10. \mathbb{Z}_7^\times = \langle 3 \rangle (powers 3, 2, 6, 4, 5, 1), with generators 3 and 3^5 = 5. An automorphism sends 3 to a generator and is fixed by that value (Theorem 4(d)), so there are two: the identity, and x \mapsto x^5 = x^{-1}, which sends 1 \mapsto 1, 2 \mapsto 4, 3 \mapsto 5, 4 \mapsto 2, 5 \mapsto 3, 6 \mapsto 6.
  11. 5 \cdot 5 \equiv 1 and 5 \cdot 7 \equiv 11, so \lambda_5 = (1\ 2)(3\ 4). 7 \cdot 7 \equiv 1 and 7 \cdot 5 \equiv 11, so \lambda_7 = (1\ 3)(2\ 4). 11 \cdot 11 \equiv 1 and 11 \cdot 5 \equiv 7, so \lambda_{11} = (1\ 4)(2\ 3). With e they form the group V of Homomorphisms and kernels, Example 6.
  12. c_h^{-1} \circ c_g = c_{h^{-1}g} is the identity exactly when h^{-1}g \in Z(G), so c_g = c_h exactly when gZ(G) = hZ(G). Z(D_4) = \{e, r^2\} gives 8/2 = 4 maps; Z(S_3) = \{e\} gives 6.
  13. Proof. c_g \in \operatorname{Aut}(G) (Theorem 7), and c_{gh}(x) = ghxh^{-1}g^{-1} = c_g(c_h(x)). c_g = \mathrm{id}_G means gx = xg for all x, that is g \in Z(G). By Homomorphisms and kernels, Theorem 5, the values match the cosets of the kernel: [G : Z(G)] of them. \square
  14. Proof. \lambda_g^k(x) = g^kx, and g^ix = g^jx exactly when i \equiv j \pmod m (Cyclic groups, Theorem 4(a)). So the cycle of \lambda_g through x is (x\ \ gx\ \ \cdots\ \ g^{m - 1}x), of length m, with set the right coset \langle g \rangle x. These cosets partition G into n/m sets of m elements (Cosets, Lagrange's theorem). \square
  15. Proof. For \alpha \in \operatorname{Aut}(G), \Psi(\alpha) = \psi\alpha\psi^{-1} is an automorphism of H (Theorems 1 and 2), \Psi(\alpha\beta) = \psi\alpha\psi^{-1}\psi\beta\psi^{-1} = \Psi(\alpha)\Psi(\beta), and \gamma \mapsto \psi^{-1}\gamma\psi is its inverse. Each \psi\alpha is an isomorphism G \to H; if \chi is one, then \alpha = \psi^{-1}\chi \in \operatorname{Aut}(G) and \chi = \psi\alpha; and \psi\alpha = \psi\beta forces \alpha = \beta. \square
  16. Proof. If G has an element of order 4, G \cong \mathbb{Z}_4. Otherwise every x \ne e has order 2 (Lagrange's theorem, Corollary 2), and G is abelian (Example 5 there). For distinct x, y \ne e: xy \ne e (else y = x^{-1} = x), and xy \ne x, y by cancellation, so G = \{e, x, y, xy\}, with x \cdot y = xy, x \cdot xy = y, y \cdot xy = x and all squares e. The table of V_4 in Binary operations and the group axioms has this pattern for a, b, c, so x \mapsto a, y \mapsto b, xy \mapsto c, e \mapsto e is an isomorphism. V_4 has no element of order 4, so \mathbb{Z}_4 \not\cong V_4. \square
  17. Proof. An automorphism \alpha has \mathbb{Z} = \langle \alpha(1) \rangle (Theorem 3(d)), and \mathbb{Z} has only the generators \pm 1 (Cyclic groups, Exercise 13). As \alpha(k) = k\alpha(1) (Homomorphisms and kernels, Theorem 9(a)), \alpha is k \mapsto k or k \mapsto -k, and both are automorphisms. A group of order 2 is \cong \mathbb{Z}_2 (Corollary 5). \square
math.wiki · updated 2026-11-17 · CC-BY-SA-4.0