Quotient groups

The cosets of a normal subgroup multiply like elements. Do they form a group of their own, and what does that group remember about the one it came from?

Where you are 4 in Cosets and quotients

Why this exists

By Theorem 7 of Normal subgroups, when N \trianglelefteq G the set product of two cosets is again a coset: (aN)(bN) = abN. So the cosets themselves can be multiplied, and this lesson shows they then form a group. Its elements are whole blocks of the coset partition, and multiplying them is multiplying in G while ignoring everything inside N.

The integers mod n are the first case: Relations, equivalence classes and partitions built \mathbb{Z}_n by adding the cosets of n\mathbb{Z}. A quotient keeps what N cannot see, such as the parity of a permutation or the determinant of a matrix, so a large group can be studied through a smaller one.

Definition

Let N \trianglelefteq G. The quotient group (or factor group) of G by N, written G/N and read “G mod N”, is the set of left cosets of N in G with the operation

(aN)(bN) = abN.

Theorem 1 shows that this rule is well defined and makes G/N a group, with identity N = eN. Since gN = Ng for a normal subgroup, left and right cosets give the same set. The natural map is \pi : G \to G/N, \pi(g) = gN.

An element of G/N is a set with many names: aN = a'N exactly when a^{-1}a' \in N (Cosets, Lemma 2). Any a with aN = X is a representative of the coset X. A rule on G/N stated through representatives is well defined when its result does not depend on which representatives are used.

In an additive group the cosets are a + N and the rule reads (a + N) + (b + N) = (a + b) + N, with identity 0 + N = N and -(a + N) = (-a) + N. In \mathbb{Z}, the coset a + n\mathbb{Z} is the class [a]_n of Relations, equivalence classes and partitions and the rule is the addition of classes there, so \mathbb{Z}/n\mathbb{Z} is \mathbb{Z}_n. Every later lesson writes \mathbb{Z}_n.

Intuition

Treat each block of the coset partition as one point. Then G/N is G seen by an observer who cannot tell the elements of N from e. For that observer to multiply consistently, elements that look alike must have products that look alike, and normality is exactly what makes this happen (Theorems 1 and 3).

0 1 2 3 4 5 6 7 8 9 10 11
Figure 1The four cosets of N = \{0, 4, 8\} in \mathbb{Z}_{12} are four triangles (Example 1). Adding 1 turns each triangle one step to the next, so the four triangles form a cyclic group of order 4.

In the figure, adding 1 to every number turns each triangle into the next, whichever corner names it. The quotient forgets the corner and remembers the triangle.

Results

Throughout, N \trianglelefteq G unless stated otherwise.

Theorem 1 (the quotient group). (a) If aN = a'N and bN = b'N, then abN = a'b'N. (b) With (aN)(bN) = abN, the set G/N is a group: the identity is N, the inverse of gN is g^{-1}N, and (gN)^k = g^kN for every integer k. (c) |G/N| = [G : N]; if G is finite, |G/N| = |G|/|N|.

Theorem 2 (the natural map). \pi : G \to G/N is onto, \pi(ab) = \pi(a)\pi(b) for all a, b \in G, and \pi(g) = N if and only if g \in N.

Theorem 3 (normality is needed). Let H \le G be any subgroup. If aH = a'H and bH = b'H always imply abH = a'b'H, then H \trianglelefteq G.

Theorem 4 (orders in a quotient). Let g \in G. (a) For each integer k, (gN)^k = N if and only if g^k \in N. So gN has finite order exactly when g^k \in N for some k \ge 1, and then \operatorname{ord}(gN) is the least such k. (b) If \operatorname{ord}(g) is finite, then \operatorname{ord}(gN) divides it.

Corollary 5. If [G : N] = m is finite, then g^m \in N for every g \in G.

Theorem 6 (abelian and cyclic quotients). (a) If G is abelian, so is G/N. (b) If G = \langle g \rangle, then G/N = \langle gN \rangle. (c) G/N is abelian if and only if aba^{-1}b^{-1} \in N for all a, b \in G.

Theorem 7. If G/Z(G) is cyclic, then G is abelian.

Why it is true

Proof of Theorem 1. (a) By Normal subgroups, Theorem 7, the set product (aN)(bN) equals abN. A set product depends only on the two sets, so abN = (aN)(bN) = (a'N)(b'N) = a'b'N.

(b) Associativity comes from G:

\begin{aligned} (aN)\big((bN)(cN)\big) &= a(bc)N = (ab)cN \\ &= \big((aN)(bN)\big)(cN). \end{aligned}

Next, (eN)(gN) = gN = (gN)(eN), and (gN)(g^{-1}N) = eN = (g^{-1}N)(gN). For powers, (gN)^0 = N = g^0N and (gN)^{k + 1} = (gN)^k(gN) = g^kN\,gN = g^{k + 1}N, which proves k \ge 0 by induction (Proof by induction). For k < 0, (gN)^k = \big((gN)^{-1}\big)^{-k} = (g^{-1}N)^{-k} = (g^{-1})^{-k}N = g^kN by the laws of exponents (Cyclic groups, Lemma 1).

(c) The elements of G/N are the left cosets, and there are [G : N] of them. For finite G, Lagrange’s theorem (Lagrange's theorem, Theorem 1) gives [G : N] = |G|/|N|. \square

Proof of Theorem 2. Every coset is gN = \pi(g) for some g, so \pi is onto. By definition \pi(ab) = abN = (aN)(bN) = \pi(a)\pi(b). Finally gN = N if and only if g \in N (Cosets, Lemma 2). \square

Proof of Theorem 3. Let h \in H and g \in G. Since hH = eH and g^{-1}H = g^{-1}H, the hypothesis gives hg^{-1}H = g^{-1}H. By Cosets, Lemma 2, (g^{-1})^{-1}(hg^{-1}) = ghg^{-1} lies in H. So gHg^{-1} \subseteq H for every g, and H \trianglelefteq G. \square

Proof of Theorem 4. (a) (gN)^k = g^kN by Theorem 1, and g^kN = N if and only if g^k \in N. The order of gN is the least k \ge 1 with (gN)^k = N. (b) If \operatorname{ord}(g) = n, then g^n = e \in N, so (gN)^n = N, and \operatorname{ord}(gN) divides n by Cyclic groups, Theorem 4(a), applied in G/N. \square

Proof of Corollary 5. G/N is a group of order m, so (gN)^m = N (Lagrange's theorem, Corollary 2), and g^m \in N by Theorem 4(a). \square

Proof of Theorem 6. (a) (aN)(bN) = abN = baN = (bN)(aN). (b) Each element of G is some g^k, so each coset is g^kN = (gN)^k. (c) (aN)(bN) = (bN)(aN) means abN = baN, which by Cosets, Lemma 2, holds exactly when (ba)^{-1}ab = a^{-1}b^{-1}ab \in N. So G/N is abelian if and only if a^{-1}b^{-1}ab \in N for all a, b \in G. As a and b run over G, so do a^{-1} and b^{-1}; putting them in place of a and b turns the condition into aba^{-1}b^{-1} \in N for all a, b. \square

Proof of Theorem 7. Write Z = Z(G), normal by Normal subgroups, Theorem 5(c), and say G/Z = \langle gZ \rangle. Each x \in G lies in some coset (gZ)^i = g^iZ, so x = g^iz with z \in Z; likewise y = g^jw with w \in Z. Since z and w commute with everything,

\begin{aligned} xy &= g^izg^jw = g^{i + j}zw \\ &= g^{j + i}wz = g^jwg^iz = yx. \quad \square \end{aligned}

Worked examples

Example 1

Four triangles on a clock

In \mathbb{Z}_{12}, writing k for [k]_{12}, let N = \langle 4 \rangle. List the cosets of N, write the addition table of \mathbb{Z}_{12}/N, add (7 + N) + (10 + N), and find the orders of 1 + N and 2 + N.

Solution

N = \{0, 4, 8\}, normal because \mathbb{Z}_{12} is abelian (Normal subgroups, Theorem 5(a)). By Theorem 1(c) there are 12/3 = 4 cosets:

\begin{aligned} N &= \{0, 4, 8\}, & 1 + N &= \{1, 5, 9\}, \\ 2 + N &= \{2, 6, 10\}, & 3 + N &= \{3, 7, 11\}. \end{aligned}

These are the four triangles of the figure. Using representatives 0, 1, 2, 3 and the rule (a + N) + (b + N) = (a + b) + N:

+N1 + N2 + N3 + N
NN1 + N2 + N3 + N
1 + N1 + N2 + N3 + NN
2 + N2 + N3 + NN1 + N
3 + N3 + NN1 + N2 + N

With other names: (7 + N) + (10 + N) = 17 + N = 5 + N = 1 + N, and the table, reading 7 + N as 3 + N and 10 + N as 2 + N, gives 1 + N too, as Theorem 1(a) promises.

By Theorem 4(a), \operatorname{ord}(1 + N) is the least k \ge 1 with k \cdot 1 \in N, which is 4; so \mathbb{Z}_{12}/N = \langle 1 + N \rangle is cyclic, as Theorem 6(b) predicts. And 2 \notin N, 4 \in N, so \operatorname{ord}(2 + N) = 2.

Example 2

The real line wound up

The integers form a subgroup of (\mathbb{R}, +), normal since \mathbb{R} is abelian. Describe \mathbb{R}/\mathbb{Z} by representatives in [0, 1), compute (0.7 + \mathbb{Z}) + (0.6 + \mathbb{Z}), and find which elements of \mathbb{R}/\mathbb{Z} have finite order.

Solution

The coset x + \mathbb{Z} is the class of x under “differ by an integer”, which holds exactly one number in [0, 1), the fractional part x - \lfloor x \rfloor (proved in Relations, equivalence classes and partitions). So \mathbb{R}/\mathbb{Z} is [0, 1) with “add, then drop the whole part” as its operation. For instance (0.7 + \mathbb{Z}) + (0.6 + \mathbb{Z}) = 1.3 + \mathbb{Z} = 0.3 + \mathbb{Z}.

By Theorem 4(a), \operatorname{ord}(x + \mathbb{Z}) is the least k \ge 1 with kx \in \mathbb{Z}. If x is irrational, kx is never an integer, so x + \mathbb{Z} has infinite order. If \displaystyle x = \frac{p}{q} in lowest terms with q \ge 1, then kx \in \mathbb{Z} means q \mid kp. By Bezout’s identity (Bezout's identity and the extended Euclidean algorithm), 1 = up + vq for some integers u, v, so k = u(kp) + v(kq) is a multiple of q. Conversely \displaystyle q \cdot \frac{p}{q} = p. So \displaystyle \operatorname{ord}\big(\frac{p}{q} + \mathbb{Z}\big) = q: the coset of \displaystyle \frac{5}{12} has order 12, and 0.3 + \mathbb{Z} has order 10.

The elements of finite order are the cosets of the rationals, which form \mathbb{Q}/\mathbb{Z}. Winding the line around a circle of circumference 1 sends all of x + \mathbb{Z} to one point, (\cos 2\pi x, \sin 2\pi x), matching \mathbb{R}/\mathbb{Z} with S^1.

Example 3

The quaternions mod their center

In Q_8 (as in Normal subgroups, Example 3), let N = \{\pm 1\}. Write the table of Q_8/N and decide whether it is abelian and whether it is cyclic.

Solution

-1 commutes with every element, so N \le Z(Q_8) and N \trianglelefteq Q_8 (Normal subgroups, Theorem 5(c)). There are 8/2 = 4 cosets: N, iN = \{\pm i\}, jN = \{\pm j\} and kN = \{\pm k\}. Since -1 \in N, a sign never changes the coset, so jiN = -kN = kN, and so on:

\cdotNiNjNkN
NNiNjNkN
iNiNNkNjN
jNjNkNNiN
kNkNjNiNN

The diagonal holds N because i^2 = j^2 = k^2 = -1 \in N. The table is symmetric, so Q_8/N is abelian, although Q_8 is not. By Theorem 6(c) this says that every commutator of Q_8 lies in N; for instance iji^{-1}j^{-1} = ij(-i)(-j) = (ij)(ij) = k^2 = -1 \in N. Every element other than N has order 2, so no element has order 4 and Q_8/N is not cyclic.

Example 4

A quotient of S_4 that behaves like S_3

V = \{e, (1\ 2)(3\ 4), (1\ 3)(2\ 4), (1\ 4)(2\ 3)\} \trianglelefteq S_4 (Normal subgroups, Example 4). Let H be the set of permutations in S_4 that fix 4. Show that each coset of V contains exactly one element of H, and that S_4/V multiplies like H. Then find the elements of H in (1\ 4)V and (1\ 2\ 4)V, and the coset of (1\ 4)(1\ 2\ 4).

Solution

H is a subgroup of order 3! = 6 (the permutations of \{1, 2, 3\}), and H \cap V = \{e\}, since each other element of V moves 4. If \sigma V = \tau V with \sigma, \tau \in H, then \sigma^{-1}\tau \in H \cap V, so \sigma = \tau. So the six cosets \sigma V, \sigma \in H, are distinct, and since [S_4 : V] = 24/4 = 6 they are all of them. Their products are (\sigma V)(\tau V) = \sigma\tau V with \sigma\tau \in H, so S_4/V multiplies exactly as H does. In particular it is a nonabelian group of order 6, as (1\ 2)(1\ 3) = (1\ 3\ 2) and (1\ 3)(1\ 2) = (1\ 2\ 3).

To find the element of H in \sigma V, look for v \in V with \sigma v(4) = 4, that is v(4) = \sigma^{-1}(4). For \sigma = (1\ 4), \sigma^{-1}(4) = 1, so v = (1\ 4)(2\ 3) and (1\ 4)(1\ 4)(2\ 3) = (2\ 3); thus (1\ 4)V = (2\ 3)V. For \sigma = (1\ 2\ 4), \sigma^{-1}(4) = 2, so v = (1\ 3)(2\ 4), and (1\ 2\ 4)(1\ 3)(2\ 4) = (1\ 3\ 2); thus (1\ 2\ 4)V = (1\ 3\ 2)V. The quotient now predicts

(1\ 4)(1\ 2\ 4)V = (2\ 3)(1\ 3\ 2)V = (1\ 2)V.

Directly, (1\ 4)(1\ 2\ 4) sends 1 \mapsto 2, 2 \mapsto 1 and fixes 3 and 4: it is (1\ 2) itself.

Example 5

The center of a group of order eight

Prove that a nonabelian group G of order 8 has |Z(G)| = 1 or |Z(G)| = 2, and check this on D_4 and Q_8.

Solution

Proof. Z(G) \le G, so |Z(G)| divides 8 by Lagrange’s theorem. It is not 8, since then Z(G) = G and G would be abelian. If |Z(G)| = 4, then G/Z(G) has order 8/4 = 2 by Theorem 1(c), so it is cyclic (Lagrange's theorem, Corollary 3), and G is abelian by Theorem 7, a contradiction. So |Z(G)| is 1 or 2. \square

In Q_8 the center is \{\pm 1\}. In D_4 it is \{e, r^2\}: r^2 commutes with r and sr^2 = r^{-2}s = r^2s, while sr^k = r^{-k}s \ne r^ks for k = 1, 3 and r(r^ks) = r^{k + 1}s \ne r^{k - 1}s = (r^ks)r. Both have order 2. The class equation of Group actions, orbits and stabilizers rules out |Z(G)| = 1 for every group of order 8.

Example 6

Elements of order prime to the index

Let N \trianglelefteq G with [G : N] = m finite, and let g \in G have finite order k with \gcd(k, m) = 1. Prove that g \in N. Deduce that every permutation of odd order is even.

Solution

Proof. By Theorem 4(b), \operatorname{ord}(gN) divides k. As G/N has order m, \operatorname{ord}(gN) divides m (Lagrange's theorem, Corollary 2). So it divides \gcd(k, m) = 1, hence gN = N and g \in N by Theorem 2. \square

For n \ge 2, A_n \trianglelefteq S_n with index 2 (Normal subgroups, Example 4). An odd k has \gcd(k, 2) = 1, so every \sigma \in S_n of odd order lies in A_n. For instance (1\ 2\ 3)(4\ 5\ 6\ 7\ 8) has order 15 (Permutation groups and cycle notation, Theorem 4), so it is even. The converse fails: (1\ 2)(3\ 4) is even and has order 2.

Boundaries

  • Only normal subgroups. By Theorem 3, if H is not normal, the rule (aH)(bH) = abH depends on representatives (Exercise 10), and G/H is only a set.
  • Every map out of G/N needs a check. In \mathbb{R}/\mathbb{Z}, the rule x + \mathbb{Z} \mapsto x^2 + \mathbb{Z} is not a function: \displaystyle \frac{1}{3} + \mathbb{Z} = \frac{4}{3} + \mathbb{Z}, but \displaystyle \frac{16}{9} - \frac{1}{9} = \frac{5}{3} is not an integer.
  • A quotient is not a subgroup. Q_8/\{\pm 1\} has three elements of order 2 (Example 3), but Q_8 has only one, so no subgroup of Q_8 multiplies like Q_8/\{\pm 1\}. Likewise \mathbb{Z}_n is a quotient of \mathbb{Z}, whose only finite subgroup is \{0\}.
  • N and G/N do not determine G. In D_4, N = \{e, r^2\} has order 2 and every element of D_4/N other than N has order 2, just as for \{\pm 1\} in Q_8. Yet D_4 has five elements of order 2 and Q_8 has one.
  • Properties of G/N need not lift. Q_8/\langle i \rangle has order 2, so it is cyclic, but Q_8 is not even abelian. Theorem 7 is special to the center.

Where this goes next

Theorem 2 says \pi is a homomorphism whose kernel is N, so every normal subgroup is a kernel; Homomorphisms and kernels shows that every kernel is normal. The first of the The isomorphism theorems says that a homomorphism \psi : G \to K gives G/\ker\psi \cong \operatorname{im}\psi, which turns the “multiplies like” of Examples 2 and 4 into isomorphisms. Quotients of finite abelian groups drive the classification in Direct products and finite abelian groups, and Ideals and quotient rings repeats this construction for rings, where R/I must also carry a multiplication.

Exercises

Computing in a quotient

  1. In \mathbb{Z}_{20} let N = \langle 8 \rangle. List the elements of N and the cosets of N, find (13 + N) + (15 + N), and find the orders of 6 + N and 7 + N.
  2. In a physics lab, Yuna and Omar mark a gyroscope rotor and record a turn of x revolutions as x + \mathbb{Z} \in \mathbb{R}/\mathbb{Z}, since whole revolutions bring the mark back. Yuna turns it \displaystyle \frac{5}{6} of a revolution and Omar then turns it \displaystyle \frac{3}{4}. Find the net turn as a number in [0, 1) and its order, and show that repeating a turn of \displaystyle \sqrt{2} revolutions never brings the mark back.
  3. In \mathbb{Z}_{21}^\times let N = \{1, 8, 13, 20\}. Show N is a subgroup, list its cosets, find \operatorname{ord}(2N), and find the coset of 5 \cdot 11 two ways.
  4. In D_6 (r^6 = e) let N = \{e, r^3\}. Show N \trianglelefteq D_6, find |D_6/N|, \operatorname{ord}(rN) and \operatorname{ord}(sN), and decide whether D_6/N is abelian.
  5. In D_6 let N = \{e, r^2, r^4\}. Show N \trianglelefteq D_6 and that D_6/N is not cyclic.
  6. In A_4, with V \trianglelefteq A_4 (Normal subgroups, Exercise 8), find the cosets of V that contain (1\ 3\ 4) and (2\ 4\ 3), use A_4/V to find the coset of (1\ 3\ 4)(2\ 4\ 3), and check by multiplying.
  7. Let S = \operatorname{SL}_2(\mathbb{R}) \trianglelefteq \operatorname{GL}_2(\mathbb{R}). Show AS = BS if and only if \det A = \det B. For A = \begin{pmatrix} 3 & 1 \\ 4 & 2 \end{pmatrix}, B = \begin{pmatrix} 1 & 5 \\ 0 & 2 \end{pmatrix} and C = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, decide whether AS = BS, find \operatorname{ord}(CS), and find the determinant shared by every matrix in (AS)(CS).
  8. With V and H as in Example 4, let a = (1\ 2\ 3\ 4) and b = (1\ 2). Find the elements of H in aV and bV, predict the one in abV, and check by computing ab.

Well defined or not

  1. Show that x + \mathbb{Z} \mapsto 2x + \mathbb{Z} is a well-defined map \mathbb{R}/\mathbb{Z} \to \mathbb{R}/\mathbb{Z}, but \displaystyle x + \mathbb{Z} \mapsto \frac{x}{2} + \mathbb{Z} is not.
  2. In S_3 let H = \{e, (1\ 2)\}. Show that eH = (1\ 2)H but e(1\ 3)H \ne (1\ 2)(1\ 3)H, and say what this shows.
  3. Refute with a counterexample: if N and G/N are both abelian, then G is abelian.

Proofs

  1. Let N \trianglelefteq G and G = \langle S \rangle. Prove that G/N is generated by \{sN : s \in S\}.
  2. Let G be cyclic of order n and K \le G of order d. Prove that G/K is cyclic of order \displaystyle \frac{n}{d}.
  3. Let N \trianglelefteq G with G/N abelian, and let N \le M \le G. Prove that M \trianglelefteq G.
  4. Prove that [G : Z(G)] is never a prime.
  5. Let N \trianglelefteq G with |N| = n, [G : N] = m and \gcd(m, n) = 1. Prove that N is the only subgroup of G of order n.
  6. Prove that every element of \mathbb{Q}/\mathbb{Z} has finite order, and that for each n \ge 1, \mathbb{Q}/\mathbb{Z} has exactly one subgroup of order n, which is cyclic.
  7. Let N \trianglelefteq G. Suppose every element of N has order dividing a and every element of G/N has order dividing b. Prove that every element of G has order dividing ab.
Answers
  1. N = \{0, 8, 16, 4, 12\} = \{0, 4, 8, 12, 16\}. There are 20/5 = 4 cosets: N, 1 + N, 2 + N, 3 + N. (13 + N) + (15 + N) = 28 + N = 8 + N = N. A class lies in N exactly when it is a multiple of 4: 6 \notin N, 12 \in N, so \operatorname{ord}(6 + N) = 2; 7k is a multiple of 4 exactly when 4 \mid k, so \operatorname{ord}(7 + N) = 4 and 7 + N generates.
  2. \displaystyle \frac{5}{6} + \frac{3}{4} = \frac{19}{12}, so the net turn is \displaystyle \frac{7}{12} + \mathbb{Z}, of order 12 by Example 2, as \gcd(7, 12) = 1. If \displaystyle k\sqrt{2} \in \mathbb{Z} for some k \ge 1, then \displaystyle \sqrt{2} would be rational; so \displaystyle \sqrt{2} + \mathbb{Z} has infinite order.
  3. 8^2 = 64 \equiv 1, 13 \equiv -8 and 20 \equiv -1, so N = \{\pm 1, \pm 8\} is closed, a subgroup by the finite test, normal as the group is abelian. |\mathbb{Z}_{21}^\times| = 12, so there are 3 cosets: N, 2N = \{2, 5, 16, 19\} and 4N = \{4, 10, 11, 17\}. 2 \notin N, 4 \notin N, 8 \in N, so \operatorname{ord}(2N) = 3. Directly 5 \cdot 11 = 55 \equiv 13 \in N; in the quotient (2N)(4N) = 8N = N.
  4. sr^3 = r^{-3}s = r^3s, so r^3 \in Z(D_6) and N \trianglelefteq D_6. |D_6/N| = 12/2 = 6. r^k \in N exactly when 3 \mid k, so \operatorname{ord}(rN) = 3; s \notin N and s^2 = e, so \operatorname{ord}(sN) = 2. Since sr^{-1}s = r, rsr^{-1}s^{-1} = r(sr^{-1}s) = r^2 \notin N, so D_6/N is not abelian (Theorem 6(c)).
  5. The elements of order 3 in D_6 are r^2 and r^4 (reflections have order 2), so N is the only subgroup of order 3 and is normal (Normal subgroups, Corollary 4). |D_6/N| = 4, with cosets N, rN, sN, rsN. Each nonidentity coset has order 2: r^2 \in N, s^2 = e, (rs)^2 = e. No element of order 4, so not cyclic.
  6. (1\ 2\ 3)(1\ 2)(3\ 4) = (1\ 3\ 4) and (1\ 2\ 3)(1\ 3)(2\ 4) = (2\ 4\ 3), so both lie in (1\ 2\ 3)V. Then (1\ 3\ 4)(2\ 4\ 3)V = (1\ 2\ 3)^2V = (1\ 3\ 2)V. Directly, (1\ 3\ 4)(2\ 4\ 3) = (1\ 3\ 2).
  7. AS = BS iff A^{-1}B \in S iff \displaystyle \det(A^{-1}B) = \frac{\det B}{\det A} = 1. Here \det A = 6 - 4 = 2 = \det B, so AS = BS. \det C = -1, so CS \ne S, and C^2 = I_2, so \operatorname{ord}(CS) = 2. (AS)(CS) = ACS, and every matrix in it has determinant \det A \det C = -2.
  8. a^{-1}(4) = 3, and a(1\ 2)(3\ 4) = (1\ 3), so aV = (1\ 3)V; b \in H, so bV = (1\ 2)V. Prediction: abV = (1\ 3)(1\ 2)V = (1\ 2\ 3)V. Directly ab = (1\ 3\ 4), and by Exercise 6, (1\ 2\ 3)(1\ 2)(3\ 4) = (1\ 3\ 4), so (1\ 3\ 4) \in (1\ 2\ 3)V.
  9. If x + \mathbb{Z} = x' + \mathbb{Z}, then x' = x + n with n \in \mathbb{Z}, and 2x' - 2x = 2n \in \mathbb{Z}, so 2x' + \mathbb{Z} = 2x + \mathbb{Z}. Halving: 0 + \mathbb{Z} = 1 + \mathbb{Z}, but \displaystyle 0 + \mathbb{Z} \ne \frac{1}{2} + \mathbb{Z}.
  10. (1\ 2) \in H, so (1\ 2)H = H = eH. (1\ 3)H = \{(1\ 3), (1\ 2\ 3)\}, while (1\ 2)(1\ 3) = (1\ 3\ 2) \notin (1\ 3)H. The product rule depends on representatives, as Theorem 3 says it must: H is not normal, since (1\ 3)(1\ 2)(1\ 3)^{-1} = (2\ 3) \notin H.
  11. G = D_5, N = \langle r \rangle. N is cyclic, so abelian; [D_5 : N] = 2, so N is normal and D_5/N has order 2, so it is abelian. But sr = r^4s \ne rs.
  12. Proof. Let K = \langle sN : s \in S \rangle \le G/N and L = \{g \in G : gN \in K\}. Then e \in L; if a, b \in L, then abN = (aN)(bN) \in K and a^{-1}N = (aN)^{-1} \in K. So L \le G, and S \subseteq L, hence L = G. Every gN is in K. \square
  13. Proof. G = \langle a \rangle is abelian, so K \trianglelefteq G. By Theorem 1(c), \displaystyle |G/K| = \frac{n}{d}, and by Theorem 6(b), G/K = \langle aK \rangle. \square
  14. Proof. Let g \in G and m \in M. By Theorem 6(c), gmg^{-1}m^{-1} \in N \subseteq M, so gmg^{-1} = (gmg^{-1}m^{-1})m \in M. \square
  15. Proof. Suppose [G : Z(G)] = p is prime. Then G/Z(G) has order p, so it is cyclic (Lagrange's theorem, Corollary 3), and G is abelian by Theorem 7. Then Z(G) = G and the index is 1, not prime, a contradiction. \square
  16. Proof. Let K \le G with |K| = n, and h \in K. Then \operatorname{ord}(h) divides n (Lagrange's theorem, Corollary 2), so \gcd(\operatorname{ord}(h), m) = 1, and h \in N by Example 6. So K \subseteq N, and both have n elements, so K = N. \square
  17. Proof. For \displaystyle \frac{p}{q} with q \ge 1, \displaystyle q \cdot \frac{p}{q} = p \in \mathbb{Z}, so \displaystyle \frac{p}{q} + \mathbb{Z} has finite order. Fix n and let \displaystyle C = \langle \frac{1}{n} + \mathbb{Z} \rangle = \{\frac{k}{n} + \mathbb{Z}\}; \displaystyle \frac{k}{n} \in \mathbb{Z} exactly when n \mid k, so C is cyclic of order n. If K \le \mathbb{Q}/\mathbb{Z} has order n, each x + \mathbb{Z} \in K has order dividing n, so nx \in \mathbb{Z} (Theorem 4(a)), that is, \displaystyle x = \frac{k}{n} with k = nx. So K \subseteq C, and equal sizes give K = C. \square
  18. Proof. Let g \in G. Since \operatorname{ord}(gN) divides b, (gN)^b = N, so g^b \in N (Theorem 4(a)). Then \operatorname{ord}(g^b) divides a, so g^{ab} = (g^b)^a = e, and \operatorname{ord}(g) divides ab (Cyclic groups, Theorem 4(a)). \square
math.wiki · updated 2026-11-17 · CC-BY-SA-4.0