math.wiki
Abstract algebra › Homomorphisms › Direct products and finite abelian groups
Sign in

Direct products and finite abelian groups

Two groups can run side by side, each in its own coordinate. When is a group really two smaller groups working independently, and can every finite abelian group be built that way from cyclic pieces?

Where you are 6 in Homomorphisms

Why this exists

Subgroups and quotients cut a group down. Direct products build a large group from small ones, each acting on its own coordinate. The Chinese remainder theorem met this for arithmetic: when \gcd(m, n) = 1, counting mod mn is counting mod m and mod n side by side. When does a group split this way, and how far can splitting go? For finite abelian groups, all the way: each is a product of cyclic groups of prime power order, in exactly one way.

Definition

The direct product G_1 \times \cdots \times G_k of groups G_1, \dots, G_k is the Cartesian product of the sets with the operation done in each coordinate, in its own group:

(g_1, \dots, g_k)(h_1, \dots, h_k) = (g_1h_1, \dots, g_kh_k).

For additive groups it is written +, as in \mathbb{Z}_m \times \mathbb{Z}_n. The inclusion \iota_i puts g \in G_i in coordinate i and e everywhere else.

A group G is the internal direct product of subgroups H and K if H \trianglelefteq G, K \trianglelefteq G, H \cap K = \{e\} and HK = G, where HK = \{hk : h \in H, k \in K\}.

For a prime p, a p-group is a group of order p^n, n \ge 0. For finite abelian G, the p-part G(p) is the set of elements whose order is a power of p.

A finite abelian group written \mathbb{Z}_{q_1} \times \cdots \times \mathbb{Z}_{q_s}, each q_i > 1 a prime power, is in elementary divisor form; the q_i are its elementary divisors. Written \mathbb{Z}_{d_1} \times \cdots \times \mathbb{Z}_{d_t} with 1 < d_1 \mid d_2 \mid \cdots \mid d_t, it is in invariant factor form, with invariant factors d_j. The trivial group is the empty product.

Intuition

An element of G \times H is a pair of independent dials; multiplying turns each dial separately. A pair is back at (e, e) exactly when both dials are, so orders combine by least common multiple, as the figure shows.

0 8 4 1 9 5 6 2 10 7 3 11 0 1 2 3 4 5 0 1 2 3
\mathbb{Z}_4 \times \mathbb{Z}_6
0 9 6 3 4 1 10 7 8 5 2 11 0 1 2 3 0 1 2
\mathbb{Z}_3 \times \mathbb{Z}_4
Figure 1The multiples k(1, 1), row the first coordinate and column the second. In \mathbb{Z}_4 \times \mathbb{Z}_6 they return to (0, 0) after \operatorname{lcm}(4, 6) = 12 steps and miss half the group; in \mathbb{Z}_3 \times \mathbb{Z}_4 they fill it, so that group is cyclic (Theorem 3).

A finite abelian group splits first by primes, then each p-part into cyclic pieces.

Results

Theorem 1 (the direct product). Let P = G_1 \times \cdots \times G_k. (a) P is a group with identity (e, \dots, e) and inverse (g_i)^{-1} = (g_i^{-1}); if each G_i is finite, |P| = |G_1| \cdots |G_k|. (b) P is abelian if and only if every G_i is. (c) The projection \pi_i(g_1, \dots, g_k) = g_i is a homomorphism onto G_i, and \iota_i is a one to one homomorphism whose image, isomorphic to G_i, is normal in P. (d) Reordering factors, regrouping them, and replacing factors by isomorphic groups give isomorphic products.

Theorem 2 (orders). If each g_i has finite order, then \operatorname{ord}(g_1, \dots, g_k) is the least common multiple of the \operatorname{ord}(g_i).

Theorem 3 (cyclic products). For positive integers n_1, \dots, n_k, the group \mathbb{Z}_{n_1} \times \cdots \times \mathbb{Z}_{n_k} is cyclic if and only if the n_i are pairwise coprime, and then it is isomorphic to \mathbb{Z}_{n_1 \cdots n_k}. So \mathbb{Z}_m \times \mathbb{Z}_n \cong \mathbb{Z}_{mn} if and only if \gcd(m, n) = 1.

Theorem 4 (recognizing a product). If G is the internal direct product of H and K, then hk = kh for all h \in H, k \in K, and \mu(h, k) = hk is an isomorphism H \times K \to G. Conversely, G \times H is the internal direct product of \iota_1(G) and \iota_2(H).

Corollary 5. Let G be finite, H, K \trianglelefteq G, H \cap K = \{e\} and |H||K| = |G|. Then G \cong H \times K. In an abelian group normality is automatic (Normal subgroups, Theorem 5(a)).

Lemma 6 (Cauchy’s theorem, abelian case). If G is finite abelian and a prime p divides |G|, then G has an element of order p. (The Sylow theorems proves it for all finite groups.)

Theorem 7 (primary decomposition). Let G be finite abelian, |G| = p_1^{a_1} \cdots p_r^{a_r} with distinct primes p_i and a_i \ge 1. Then G(p_i) = \{g : g^{p_i^{a_i}} = e\} is a subgroup of order p_i^{a_i}, and (g_1, \dots, g_r) \mapsto g_1 \cdots g_r is an isomorphism G(p_1) \times \cdots \times G(p_r) \to G.

Lemma 8 (splitting off a cyclic factor). Let G be an abelian p-group and a \in G of largest order. Then some K \le G has \langle a \rangle \cap K = \{e\} and \langle a \rangle K = G, so G \cong \langle a \rangle \times K.

Theorem 9 (fundamental theorem of finite abelian groups). (a) Every finite abelian group is isomorphic to some \mathbb{Z}_{q_1} \times \cdots \times \mathbb{Z}_{q_s} with each q_i > 1 a prime power. (b) Two such products are isomorphic if and only if their lists agree after reordering. (c) If n = p_1^{a_1} \cdots p_r^{a_r}, there are P(a_1) \cdots P(a_r) abelian groups of order n up to isomorphism, where P(a) counts the ways to write a as a sum of positive integers, order ignored.

Corollary 10 (invariant factors). Every finite abelian G \ne \{e\} is isomorphic to \mathbb{Z}_{d_1} \times \cdots \times \mathbb{Z}_{d_t} for exactly one list 1 < d_1 \mid \cdots \mid d_t. Then d_1 \cdots d_t = |G|, and d_t is the largest order of an element.

Why it is true

Proof of Theorem 1. (a) Associativity, identity and inverses hold coordinatewise; the count is that of a Cartesian product. (b) If a, b \in G_j do not commute, neither do \iota_j(a) and \iota_j(b); the other direction is coordinatewise. (c) \pi_i and \iota_i visibly preserve products, \pi_i \circ \iota_i = \mathrm{id}, and conjugating \iota_i(x) by (g_1, \dots, g_k) gives \iota_i(g_ixg_i^{-1}). (d) Permuting coordinates, removing parentheses and applying isomorphisms \psi_i coordinatewise are bijections that preserve coordinatewise products. \square

Proof of Theorem 2. (g_1, \dots, g_k)^n = (g_1^n, \dots, g_k^n) is the identity if and only if \operatorname{ord}(g_i) \mid n for every i (Cyclic groups, Theorem 4(a)); the least such n \ge 1 is the least common multiple. \square

Proof of Theorem 3. Let N = n_1 \cdots n_k and L = \operatorname{lcm}(n_1, \dots, n_k). Orders in \mathbb{Z}_{n_i} divide n_i (Lagrange's theorem, Corollary 2), so by Theorem 2 every order divides L, and (1, \dots, 1) has order L. So the group is cyclic if and only if L = N. If a prime p divides n_i and n_j, i \ne j, then N/p is a common multiple, so L < N. If the n_i are pairwise coprime, each prime power exactly dividing N divides one n_i (Every number has exactly one prime factorization), hence L; so L = N. A cyclic group of order N is isomorphic to \mathbb{Z}_N (Isomorphisms, Theorem 4(b)). \square

For k = 2 the isomorphism sends [x]_{mn} to ([x]_m, [x]_n), the correspondence of The Chinese remainder theorem, Theorem 4.

Proof of Theorem 4. By Normal subgroups, Example 5, normal subgroups meeting in \{e\} commute elementwise, and each element of HK is hk for one pair only. So \mu is a bijection, and with kh' = h'k, \mu((h, k)(h', k')) = hh'kk' = hkh'k'. Conversely, \iota_1(G) and \iota_2(H) are normal, meet in (e, e), and (g, h) = (g, e)(e, h). \square

Proof of Corollary 5. |HK| = |H||K|/|H \cap K| = |G| (The isomorphism theorems, Theorem 4), so HK = G. \square

Proof of Lemma 6. By Strong induction and well-ordering on |G|. Take g \ne e, m = \operatorname{ord}(g). If p \mid m, then g^{m/p} has order p (Cyclic groups, Theorem 8). If not, G/\langle g \rangle is abelian of order |G|/m, smaller and divisible by p, so some x\langle g \rangle has order p. That order divides \operatorname{ord}(x) (Quotient groups, Theorem 4(b)), so x^{\operatorname{ord}(x)/p} has order p. \square

Proof of Theorem 7. As (gh)^n = g^nh^n, each G[n] = \{g : g^n = e\} is a subgroup (Subgroups, Theorem 2). Let |G| = mn with \gcd(m, n) = 1, A = G[m], B = G[n], and um + vn = 1 (Bezout). Since g^{|G|} = e (Lagrange's theorem, Corollary 2), g^{vn} \in A and g^{um} \in B, and g = g^{um}g^{vn}; so AB = G. If g \in A \cap B, then g = (g^m)^u(g^n)^v = e. Theorem 4 gives G \cong A \times B, so |A||B| = mn. A prime q \mid n cannot divide |A|: Lemma 6 would give an element of order q dividing m. So |A| divides m, likewise |B| \mid n, and |A| = m, |B| = n.

Induct on r (for r = 1, G(p_1) = G). With m = p_1^{a_1}, G \cong G(p_1) \times B, and for i \ge 2 every g with g^{p_i^{a_i}} = e has g^n = e, so the p_i-parts of B are those of G; induction on B and Theorem 1(d) finish. An order divides |G|, so it is a power of p_i exactly when g^{p_i^{a_i}} = e: this G(p_i) is the p-part of the Definition. \square

Proof of Lemma 8. Strong induction on |G|; if G = \langle a \rangle, take K = \{e\}. Let \operatorname{ord}(a) = p^n, so every order divides p^n. Choose b \notin \langle a \rangle of least order. Then b^p \in \langle a \rangle, say b^p = a^i, and a^{ip^{n-1}} = b^{p^n} = e gives p \mid i; write i = pj and c = a^{-j}b. Then c \notin \langle a \rangle and c^p = e, so C = \langle c \rangle has order p and C \cap \langle a \rangle = \{e\}.

In \bar G = G/C, with \bar x = xC: if \bar a^{p^{n-1}} = C, then a^{p^{n-1}} \in C \cap \langle a \rangle = \{e\}, false. So \bar a has order p^n, the largest in \bar G, and by induction some \bar K \le \bar G has \langle \bar a \rangle \cap \bar K = \{C\} and \langle \bar a \rangle \bar K = \bar G. Let K = \{x : \bar x \in \bar K\}, a subgroup containing C (Homomorphisms and kernels, Theorem 3(b)). If x \in \langle a \rangle \cap K, then \bar x \in \langle \bar a \rangle \cap \bar K, so x \in C \cap \langle a \rangle = \{e\}. Each g has \bar g = \bar a^t \bar y with y \in K, so g = a^tyz with z \in C \subseteq K. Apply Theorem 4. \square

Proof of Theorem 9. (a) By Theorem 7 it is enough to split an abelian p-group G \ne \{e\}. Lemma 8 gives G \cong \langle a \rangle \times K with \langle a \rangle \cong \mathbb{Z}_{p^n}, n \ge 1, and |K| < |G|; induct.

(b) Let N_p(k) count the g with g^{p^k} = e; isomorphisms preserve it. In \mathbb{Z}_q, with d = \gcd(q, p^k), p^kx = 0 if and only if \displaystyle \frac{q}{d} \mid x: d solutions, so 1 if q is a power of another prime and p^{\min(e, k)} if q = p^e. Solutions in a product are tuples of solutions, so N_p(k) = p^{c(k)}, c(k) the sum of \min(e_i, k) over the q_i = p^{e_i}. Then c(k) - c(k - 1) counts the q_i = p^{e_i} with e_i \ge k, and two such counts give how many q_i equal p^k. The converse is Theorem 1(d).

(c) The q_i multiply to n, so the exponents of the powers of p_i form a partition of a_i; by (a) and (b), isomorphism classes match the choices of these partitions. \square

Proof of Corollary 10. List each prime’s elementary divisors in decreasing order, padded with 1s to the longest length t; let d_t be the product of the first entries, d_{t-1} of the second, and so on. Theorem 3 merges coprime factors, so G \cong \mathbb{Z}_{d_1} \times \cdots \times \mathbb{Z}_{d_t}; then d_1 \mid \cdots \mid d_t, and d_1 > 1 as the longest list has no 1. Conversely, Theorem 3 splits any such list into the elementary divisors (Theorem 9(b)); a prime divides d_1, hence all d_j, so t is the longest length, and as exponents never decrease from d_1 to d_t, the list is the one built above. By Theorem 2 every order divides d_t, and (0, \dots, 0, 1) has order d_t. \square

Worked examples

Example 1

Orders in Z_4 × Z_6

In \mathbb{Z}_4 \times \mathbb{Z}_6, find the orders of (3, 2) and (2, 3), the largest order, and the number of elements of order 2. Is the group cyclic?

Solution

In \mathbb{Z}_n the class k has order n/\gcd(n, k) (Cyclic groups, Theorem 8). So 3 has order 4 in \mathbb{Z}_4, 2 has order 3 in \mathbb{Z}_6, and by Theorem 2, \operatorname{ord}(3, 2) = \operatorname{lcm}(4, 3) = 12. Both coordinates of (2, 3) have order 2, so \operatorname{ord}(2, 3) = 2.

Every order divides \operatorname{lcm}(4, 6) = 12, and (3, 2) reaches it, so the largest order is 12 < 24 and the group is not cyclic. Finally 2a = 0 and 2b = 0 hold for a \in \{0, 2\}, b \in \{0, 3\}: four pairs, so there are 3 elements of order 2, namely (2, 0), (0, 3), (2, 3).

Example 2

The units mod 40

Show that \mathbb{Z}_{40}^\times \cong \mathbb{Z}_2 \times \mathbb{Z}_2 \times \mathbb{Z}_4.

Solution

The 16 units are the classes prime to 2 and 5. The powers of 3 are 3, 9, 27, 81 \equiv 1, so A = \langle 3 \rangle = \{1, 3, 9, 27\}. As 11^2 = 121 \equiv 1 and 11 \notin A, B = \{1, 11\} meets A in \{1\}. The group is abelian, so H = AB is a subgroup of order 4 \cdot 2 = 8 and Corollary 5 gives H \cong \mathbb{Z}_4 \times \mathbb{Z}_2; explicitly 11A = \{11, 33, 19, 17\}, so H = \{1, 3, 9, 27, 11, 33, 19, 17\}.

Next 21^2 = 441 \equiv 1 and 21 \notin H, so C = \{1, 21\} meets H in \{1\}, and |H||C| = 16. By Corollary 5 and Theorem 1(d), \mathbb{Z}_{40}^\times \cong H \times C \cong \mathbb{Z}_2 \times \mathbb{Z}_2 \times \mathbb{Z}_4, in invariant factor form since 2 \mid 2 \mid 4. Check: that product has 8 solutions of 2x = 0, and x^2 \equiv 1 \pmod{40} for exactly x = 1, 9, 11, 19, 21, 29, 31, 39.

Example 3

Greatest common divisor and least common multiple

Prove that \mathbb{Z}_m \times \mathbb{Z}_n \cong \mathbb{Z}_{\gcd(m, n)} \times \mathbb{Z}_{\operatorname{lcm}(m, n)} for positive integers m, n, and apply it to \mathbb{Z}_{20} \times \mathbb{Z}_{30}.

Solution

Proof. For each prime p \mid mn let \alpha_p, \beta_p be the exponents of p in m and n. By Theorem 3, \mathbb{Z}_m is the product of the \mathbb{Z}_{p^{\alpha_p}}, and likewise \mathbb{Z}_n (a factor \mathbb{Z}_1 is trivial). Reordering by Theorem 1(d), the product is, over all p, the pairs \mathbb{Z}_{p^{\alpha_p}} \times \mathbb{Z}_{p^{\beta_p}}, and each pair is, up to order, \mathbb{Z}_{p^{\min}} \times \mathbb{Z}_{p^{\max}}. The p^{\min} multiply to \gcd(m, n) and the p^{\max} to \operatorname{lcm}(m, n), so collecting by Theorem 3 gives \mathbb{Z}_{\gcd(m, n)} \times \mathbb{Z}_{\operatorname{lcm}(m, n)}. \square

For 20 = 2^2 \cdot 5 and 30 = 2 \cdot 3 \cdot 5: \mathbb{Z}_{20} \times \mathbb{Z}_{30} \cong \mathbb{Z}_{10} \times \mathbb{Z}_{60}, both of order 600.

Example 4

All abelian groups of order 360

List the abelian groups of order 360 up to isomorphism, in both forms.

Solution

360 = 2^3 \cdot 3^2 \cdot 5. The exponent 3 has the partitions 3, 2 + 1, 1 + 1 + 1, the exponent 2 has 2 and 1 + 1, and 1 has one; by Theorem 9(c) there are 3 \cdot 2 \cdot 1 = 6 groups. For the invariant factors (Corollary 10) of, say, 4, 2, 3, 3, 5: the largest powers 4, 3, 5 give 60, the next ones 2, 3 give 6.

elementary divisorsinvariant factorslargest order
8, 9, 5\mathbb{Z}_{360}360
8, 3, 3, 5\mathbb{Z}_3 \times \mathbb{Z}_{120}120
4, 2, 9, 5\mathbb{Z}_2 \times \mathbb{Z}_{180}180
4, 2, 3, 3, 5\mathbb{Z}_6 \times \mathbb{Z}_{60}60
2, 2, 2, 9, 5\mathbb{Z}_2 \times \mathbb{Z}_2 \times \mathbb{Z}_{90}90
2, 2, 2, 3, 3, 5\mathbb{Z}_2 \times \mathbb{Z}_6 \times \mathbb{Z}_{30}30

By Theorem 9(b) no two are isomorphic.

Example 5

Invariant factors of a product

Write G = \mathbb{Z}_{12} \times \mathbb{Z}_{18} \times \mathbb{Z}_{30} in invariant factor form, and count its elements of order 2 and of order 3.

Solution

By Theorem 3, \mathbb{Z}_{12} \cong \mathbb{Z}_4 \times \mathbb{Z}_3, \mathbb{Z}_{18} \cong \mathbb{Z}_2 \times \mathbb{Z}_9 and \mathbb{Z}_{30} \cong \mathbb{Z}_2 \times \mathbb{Z}_3 \times \mathbb{Z}_5. Each prime’s elementary divisors in decreasing order are 4, 2, 2; 9, 3, 3; 5. Multiplying down the columns gives 4 \cdot 9 \cdot 5 = 180, 2 \cdot 3 = 6 and 2 \cdot 3 = 6, so G \cong \mathbb{Z}_6 \times \mathbb{Z}_6 \times \mathbb{Z}_{180}; check 6 \cdot 6 \cdot 180 = 6{,}480 = 12 \cdot 18 \cdot 30. Each invariant factor is divisible by 2 and 3, so each factor has 2 solutions of 2x = 0 and 3 of 3x = 0: G has 2^3 - 1 = 7 elements of order 2 and 3^3 - 1 = 26 of order 3.

Example 6

Finite subgroups of the nonzero complex numbers

Prove that every finite subgroup of \mathbb{C}^\times is cyclic, and equals the group \mu_n of nth roots of 1, where n is its order.

Solution

Proof. Let G \le \mathbb{C}^\times have n > 1 elements (n = 1 is clear). By Corollary 10, G \cong \mathbb{Z}_{d_1} \times \cdots \times \mathbb{Z}_{d_t} with 1 < d_1 \mid \cdots \mid d_t and d_1 \cdots d_t = n. Every tuple x has d_tx = 0, so every z \in G has z^{d_t} = 1, an equation with exactly d_t solutions in \mathbb{C} (Roots of a complex number and roots of unity); so n \le d_t. If t \ge 2, then n \ge d_1d_t \ge 2d_t; so t = 1 and G \cong \mathbb{Z}_n. Each z \in G has z^n = 1, so G \subseteq \mu_n, and both have n elements. \square

With Polynomial rings and the division algorithm (at most d roots in a field) the proof works in any field, so \mathbb{Z}_p^\times is cyclic too.

Boundaries

  • Both subgroups must be normal. In S_3, A_3 \cap \langle (1\ 2) \rangle = \{e\} and the orders multiply to 6, but \langle (1\ 2) \rangle is not normal, and the nonabelian S_3 is not the abelian A_3 \times \langle (1\ 2) \rangle (it is a semidirect product).
  • Not every subgroup of a product is a product. The diagonal \{(0, 0), (1, 1)\} of \mathbb{Z}_2 \times \mathbb{Z}_2 is no A \times B; Exercise 14 rules this out for coprime orders.
  • Finiteness. (\mathbb{Q}, +) is not cyclic (Cyclic groups, Example 4), and nonzero \displaystyle \frac{a}{b}, \displaystyle \frac{c}{d} have the common nonzero multiple ac, so no two nontrivial subgroups meet in \{0\}: \mathbb{Q} is no product of cyclic groups. Abelian groups with finitely many generators, which allow factors \mathbb{Z}, are beyond this lesson.

Where this goes next

For finite abelian G, G(p) is the only subgroup of order p^a; the The Sylow theorems find subgroups of that order in every finite group, using the counting of Group actions, orbits and stabilizers. The product ring of Rings and integral domains multiplies coordinatewise too, and the map of Theorem 3 also keeps products and 1: a ring isomorphism in the sense of Ring homomorphisms.

Exercises

Orders and cyclic products

  1. Find the order of (2, 3, 5) in \mathbb{Z}_8 \times \mathbb{Z}_9 \times \mathbb{Z}_{10}.
  2. In \mathbb{Z}_{10} \times \mathbb{Z}_{15}, find the largest order of an element and the number of elements of order 5. Is the group cyclic?
  3. How many generators does \mathbb{Z}_4 \times \mathbb{Z}_9 have?
  4. Naomi restores a split-flap sign with two drums, of 12 and 18 flaps, so a setting is an element of \mathbb{Z}_{12} \times \mathbb{Z}_{18}. A pulse P turns both drums one flap. How many pulses bring the sign back to its start, and how many of the 216 settings can pulses reach? Malik wires a switch Q that turns the 18-flap drum alone. Show that P and Q together reach every setting.

Internal direct products

  1. Show that \mathbb{Z}_{33}^\times is the internal direct product of \langle 2 \rangle and \langle 10 \rangle, and identify it.
  2. Show that \mathbb{R}^\times \cong \mathbb{Z}_2 \times \mathbb{R}_{>0} and \mathbb{C}^\times \cong S^1 \times \mathbb{R}_{>0}, with S^1 the unit circle.
  3. Find the elements of order 2 in \mathbb{Z}_{21}^\times, and decide which abelian group of order 12 it is.
  4. In D_6 (r^6 = e) let M = \{e, r^3\} and N = \{e, r^2, r^4, s, r^2s, r^4s\}. Show that D_6 \cong \mathbb{Z}_2 \times S_3.

Classifying finite abelian groups

  1. List the abelian groups of order 72 in both forms.
  2. Write \mathbb{Z}_6 \times \mathbb{Z}_{20} \times \mathbb{Z}_{36} in invariant factor form.
  3. Which abelian group of order 16 has exactly three elements of order 2 and none of order 8?
  4. Is \mathbb{Z}_6 \times \mathbb{Z}_{10} \times \mathbb{Z}_{15} isomorphic to \mathbb{Z}_{30} \times \mathbb{Z}_{30}? To \mathbb{Z}_{10} \times \mathbb{Z}_{90}?

Proofs

  1. Prove that Z(G \times H) = Z(G) \times Z(H).
  2. Let G and H be finite with \gcd(|G|, |H|) = 1. Prove that every subgroup of G \times H is A \times B with A \le G and B \le H.
  3. Prove that a finite abelian group is cyclic if and only if, for each prime p dividing its order, it has exactly p - 1 elements of order p.
  4. Prove that a finite abelian group has a subgroup of every order dividing its order.
  5. Let G and H be finite. Prove that G \times H is cyclic if and only if G and H are cyclic and \gcd(|G|, |H|) = 1.
  6. Prove that every abelian group of order n is cyclic if and only if no square of a prime divides n.
Answers
  1. The coordinates have orders 4, 3, 2; by Theorem 2 the order is \operatorname{lcm}(4, 3, 2) = 12.
  2. Orders divide \operatorname{lcm}(10, 15) = 30, which (1, 1) reaches: largest 30. 5x = 0 has 5 solutions in each factor, so 24 elements of order 5. Not cyclic: 30 < 150.
  3. 12. The group is \cong \mathbb{Z}_{36}, with \varphi(36) = 12 generators (Cyclic groups, Corollary 9).
  4. P = (1, 1) has order \operatorname{lcm}(12, 18) = 36: 36 pulses, reaching 36 settings. With Q = (0, 1), (a, b) = aP + (b - a)Q, so together they reach all 216.
  5. 2^5 = 32 \equiv -1, so \operatorname{ord}(2) = 10 and 32 is the only element of order 2 in \langle 2 \rangle. 10^2 \equiv 1 and 10 \ne 32, so the subgroups meet in \{1\}, and 10 \cdot 2 = 20 = \varphi(33). Corollary 5: \mathbb{Z}_{33}^\times \cong \mathbb{Z}_{10} \times \mathbb{Z}_2, not cyclic.
  6. \displaystyle x = \frac{x}{|x|} \cdot |x| with \displaystyle \frac{x}{|x|} = \pm 1, \{1, -1\} \cap \mathbb{R}_{>0} = \{1\}, and the group is abelian; Theorem 4 gives \mathbb{R}^\times \cong \{1, -1\} \times \mathbb{R}_{>0}. Likewise \displaystyle z = \frac{z}{|z|} \cdot |z| with \displaystyle \frac{z}{|z|} \in S^1 and S^1 \cap \mathbb{R}_{>0} = \{1\}.
  7. 8^2 = 64, 13^2 = 169, 20^2 = 400 are \equiv 1 \pmod{21}, and no other unit except 1: three elements of order 2. Of the two abelian groups of order 12, \mathbb{Z}_{12} has one and \mathbb{Z}_2 \times \mathbb{Z}_6 three, so \mathbb{Z}_{21}^\times \cong \mathbb{Z}_2 \times \mathbb{Z}_6.
  8. M \le Z(D_6) and [D_6 : N] = 2, so both are normal (Normal subgroups, Theorem 5 and Example 5); M \cap N = \{e\} and 2 \cdot 6 = 12, so D_6 \cong M \times N (Corollary 5). M \cong \mathbb{Z}_2, and N has order 6 and is not abelian (sr^2 = r^4s \ne r^2s), so N \cong D_3 (Isomorphisms, Example 6) \cong S_3 (Dihedral groups, Exercise 17).
  9. 72 = 2^3 \cdot 3^2, six groups: 8, 9 gives \mathbb{Z}_{72}; 8, 3, 3 gives \mathbb{Z}_3 \times \mathbb{Z}_{24}; 4, 2, 9 gives \mathbb{Z}_2 \times \mathbb{Z}_{36}; 4, 2, 3, 3 gives \mathbb{Z}_6 \times \mathbb{Z}_{12}; 2, 2, 2, 9 gives \mathbb{Z}_2 \times \mathbb{Z}_2 \times \mathbb{Z}_{18}; 2, 2, 2, 3, 3 gives \mathbb{Z}_2 \times \mathbb{Z}_6 \times \mathbb{Z}_6.
  10. Prime 2: 4, 4, 2; prime 3: 9, 3; prime 5: 5. Columns: 180, 12, 2, so \mathbb{Z}_2 \times \mathbb{Z}_{12} \times \mathbb{Z}_{180}.
  11. \mathbb{Z}_4 \times \mathbb{Z}_4. A product of s cyclic 2-groups has 2^s - 1 elements of order 2, so s = 2, and \mathbb{Z}_2 \times \mathbb{Z}_8 has (0, 1) of order 8.
  12. Yes, then no. The first has elementary divisors 2, 2, 3, 3, 5, 5, giving \mathbb{Z}_{30} \times \mathbb{Z}_{30}. \mathbb{Z}_{10} \times \mathbb{Z}_{90} has an element of order 90; orders in \mathbb{Z}_{30} \times \mathbb{Z}_{30} divide 30.
  13. Proof. If g \in Z(G), h \in Z(H), then (g, h)(x, y) = (gx, hy) = (xg, yh) = (x, y)(g, h). If (g, h) is central, the first coordinates of (g, h)(x, e) = (x, e)(g, h) give gx = xg for all x, so g \in Z(G); likewise h \in Z(H). \square
  14. Proof. Let S \le G \times H, A = \pi_1(S), B = \pi_2(S), subgroups by Homomorphisms and kernels, Theorem 3(a); S \subseteq A \times B. For (a, b) \in S, m = \operatorname{ord}(a) divides |G| and n = \operatorname{ord}(b) divides |H|, so \gcd(m, n) = 1, and The Chinese remainder theorem, Theorem 1, gives u \equiv 1 \pmod m, u \equiv 0 \pmod n. Then (a, b)^u = (a, e) \in S, and likewise (e, b) \in S. Every a \in A and b \in B occurs in such a pair, so (a, b) = (a, e)(e, b) \in S. \square
  15. Proof. Write G \cong \mathbb{Z}_{q_1} \times \cdots \times \mathbb{Z}_{q_s} and let s_p count the q_i that are powers of p. By the proof of Theorem 9(b), N_p(1) = p^{s_p}, so there are p^{s_p} - 1 elements of order p, which is p - 1 exactly when s_p = 1. If every s_p = 1, the q_i are pairwise coprime and G is cyclic (Theorem 3). If G \cong \mathbb{Z}_n, Theorem 3 splits it into one factor per prime, so every s_p = 1 by Theorem 9(b). \square
  16. Proof. Take an isomorphism \psi : \mathbb{Z}_{q_1} \times \cdots \times \mathbb{Z}_{q_s} \to G and m \mid |G|. For a prime p, let p^{e_1}, \dots, p^{e_j} be the p-power q_i and f the exponent of p in m; as f \le e_1 + \cdots + e_j, choose 0 \le c_l \le e_l with sum f. \langle p^{e_l - c_l} \rangle \le \mathbb{Z}_{p^{e_l}} has order p^{c_l} (Cyclic groups, Theorem 10). The product of these subgroups is a subgroup (coordinatewise) of order m, and \psi maps it onto a subgroup of G of order m. \square
  17. Proof. If G \times H = \langle (g, h) \rangle, each x \in G is \pi_1((g, h)^k) = g^k, so G = \langle g \rangle; likewise H = \langle h \rangle. Then G \times H \cong \mathbb{Z}_{|G|} \times \mathbb{Z}_{|H|} (Theorem 1(d)) is cyclic, so \gcd(|G|, |H|) = 1 by Theorem 3. The converse is Theorem 3 with Theorem 1(d). \square
  18. Proof. Let n = p_1^{a_1} \cdots p_r^{a_r}. Since \mathbb{Z}_n has order n, every abelian group of order n is cyclic exactly when there is one class, that is, P(a_1) \cdots P(a_r) = 1 (Theorem 9(c)). P(1) = 1, and for a \ge 2 the partitions a and 1 + (a - 1) differ, so P(a) \ge 2. So this holds exactly when every a_i = 1. \square
math.wiki · updated 2026-11-17 · CC-BY-SA-4.0