math.wiki
Abstract algebra › Homomorphisms › Group actions, orbits and stabilizers
Sign in

Group actions, orbits and stabilizers

A group of symmetries moves the points of a set among themselves. What can be counted from where one point can be sent, and from which elements leave it in place?

Where you are 6 in Homomorphisms

Why this exists

Groups first appear as collections of moves: rotations of a solid, rearrangements of a list, invertible matrices acting on vectors. A group action makes “a group moves the points of a set” precise. Each point then has an orbit, the places it can be sent, and a stabilizer, the elements that leave it in place; for a finite group the two sizes multiply to the order of the group. That one count finds the order of a symmetry group without listing it, shows that a group of prime-power order has a center larger than \{e\}, and counts patterns up to symmetry. It is the main tool of the The Sylow theorems.

Definition

Let G be a group and X a set. An action of G on X is a map G \times X \to X, (g, x) \mapsto g \cdot x (Cartesian product), such that for all g, h \in G and x \in X

e \cdot x = x \qquad \text{and} \qquad g \cdot (h \cdot x) = (gh) \cdot x.

For x \in X and g \in G:

  • the orbit of x is \operatorname{Orb}(x) = \{g \cdot x : g \in G\};
  • the stabilizer of x is \operatorname{Stab}(x) = \{g \in G : g \cdot x = x\};
  • the fixed set of g is \operatorname{Fix}(g) = \{x \in X : g \cdot x = x\}.

The action is transitive if it has one orbit, X itself. A point fixed by every element of G is a fixed point of the action; X_0 denotes the set of them.

Every group acts on itself by conjugation, g \cdot x = gxg^{-1} (Normal subgroups). The orbit of x is its conjugacy class \operatorname{cl}(x) = \{gxg^{-1} : g \in G\}, and its stabilizer is the centralizer C_G(x) = \{g \in G : gx = xg\} (Subgroups, Exercise 12), since gxg^{-1} = x exactly when gx = xg. Z(G) is the center (Subgroups, Example 3).

Intuition

Think of g \cdot x as the position g carries x to. If g sends x to y, then so does gh for every h that leaves x in place, and nothing else does. So the elements sending x to y form one left coset g\operatorname{Stab}(x), and G is cut into one coset per point of the orbit. Lagrange's theorem turns this into an equation.

Results

Lemma 1 (each element permutes X). If G acts on X and g \in G, then \lambda_g : X \to X, \lambda_g(x) = g \cdot x, is a bijection with inverse \lambda_{g^{-1}}, and \lambda_{gh} = \lambda_g \circ \lambda_h.

So an action gives a map G \to \operatorname{Sym}(X) (Permutation groups and cycle notation) that respects products, a homomorphism in the language of Homomorphisms and kernels; conversely such a map gives an action by g \cdot x = \lambda_g(x).

Theorem 2 (orbits partition). The relation x \sim y \iff y = g \cdot x for some g \in G is an equivalence relation on X whose classes are the orbits. So the orbits partition X.

Theorem 3 (stabilizers). For every x \in X, \operatorname{Stab}(x) \le G, and for every g \in G,

\operatorname{Stab}(g \cdot x) = g \operatorname{Stab}(x) g^{-1}.

Theorem 4 (orbit-stabilizer). Let G act on X and x \in X. The rule g\operatorname{Stab}(x) \mapsto g \cdot x is a well-defined bijection from the set of left cosets of \operatorname{Stab}(x) onto \operatorname{Orb}(x). Hence |\operatorname{Orb}(x)| = [G : \operatorname{Stab}(x)] whenever either side is finite, and if G is finite,

|\operatorname{Orb}(x)| \cdot |\operatorname{Stab}(x)| = |G|,

so every orbit size divides |G|.

Theorem 5 (the class equation). Let G be finite. Then |\operatorname{cl}(x)| = [G : C_G(x)], and \operatorname{cl}(x) = \{x\} exactly when x \in Z(G). If x_1, \dots, x_m are one element from each conjugacy class with more than one element, then

|G| = |Z(G)| + \sum_{i=1}^{m} [G : C_G(x_i)],

where each [G : C_G(x_i)] divides |G| and is greater than 1.

Theorem 6 (fixed points of a p-group). Let p be prime, let |G| = p^k, and let G act on a finite set X. Then |X| \equiv |X_0| \pmod{p}.

Corollary 7 (centers of p-groups). If |G| = p^k with p prime and k \ge 1, then p divides |Z(G)|; in particular Z(G) \ne \{e\}.

Theorem 8 (counting orbits, often called Burnside’s lemma). Let a finite group G act on a finite set X. The number of orbits is the average size of a fixed set:

\frac{1}{|G|} \sum_{g \in G} |\operatorname{Fix}(g)|.
Why it is true

Proof of Lemma 1. By the axioms, \lambda_g(\lambda_{g^{-1}}(x)) = (gg^{-1}) \cdot x = e \cdot x = x, and likewise \lambda_{g^{-1}}(\lambda_g(x)) = x. A map with a two-sided inverse is a bijection (Composing functions between sets, and when an inverse exists). The second axiom says \lambda_g(\lambda_h(x)) = \lambda_{gh}(x) for every x. \square

Proof of Theorem 2. Reflexive: x = e \cdot x. Symmetric: if y = g \cdot x, then g^{-1} \cdot y = (g^{-1}g) \cdot x = x. Transitive: if y = g \cdot x and z = h \cdot y, then z = (hg) \cdot x. The class of x is \operatorname{Orb}(x), and the classes of an equivalence relation partition the set (Relations, equivalence classes and partitions). \square

Proof of Theorem 3. e \cdot x = x. If g, h \in \operatorname{Stab}(x), then (gh) \cdot x = g \cdot (h \cdot x) = x and g^{-1} \cdot x = g^{-1} \cdot (g \cdot x) = x. So \operatorname{Stab}(x) \le G (Subgroups, Theorem 2). If h \in \operatorname{Stab}(x), then (ghg^{-1}) \cdot (g \cdot x) = (gh) \cdot x = g \cdot x, so g\operatorname{Stab}(x)g^{-1} \subseteq \operatorname{Stab}(g \cdot x). The same inclusion for the point g \cdot x and the element g^{-1} gives g^{-1}\operatorname{Stab}(g \cdot x)g \subseteq \operatorname{Stab}(x); conjugating by g gives the reverse inclusion. \square

Proof of Theorem 4. Write S = \operatorname{Stab}(x). For g, h \in G, gS = hS exactly when g^{-1}h \in S (Cosets, Lemma 2), that is, (g^{-1}h) \cdot x = x, which (acting by g or by g^{-1}) holds exactly when h \cdot x = g \cdot x. One direction says the rule does not depend on the representative; the other says it is one to one. It is onto by the definition of the orbit. If G is finite, [G : S] = |G|/|S| (Lagrange's theorem, Theorem 1). \square

Proof of Theorem 5. Conjugation is an action: exe^{-1} = x and g(hxh^{-1})g^{-1} = (gh)x(gh)^{-1}. Its orbits are the classes and its stabilizers the centralizers, so Theorem 4 gives |\operatorname{cl}(x)| = [G : C_G(x)], a divisor of |G|. The class of x is \{x\} exactly when gxg^{-1} = x for all g, that is, x \in Z(G). The classes partition G (Theorem 2): the one-element classes hold the |Z(G)| central elements, and the others have sizes [G : C_G(x_i)] > 1. Add the sizes. \square

Proof of Theorem 6. A point lies in X_0 exactly when its orbit is \{x\}. Every other orbit has size greater than 1 dividing p^k (Theorem 4), so a positive power of p. The orbits partition X, so |X| = |X_0| + (\text{a sum of multiples of } p). \square

Proof of Corollary 7. Let G act on X = G by conjugation. Then X_0 = Z(G), and by Theorem 6, |Z(G)| \equiv |G| \equiv 0 \pmod{p}. Since e \in Z(G), |Z(G)| \ge 1, so |Z(G)| \ge p. \square

Proof of Theorem 8. Count P = \{(g, x) \in G \times X : g \cdot x = x\} in two ways. For each g there are |\operatorname{Fix}(g)| pairs, so |P| = \sum_g |\operatorname{Fix}(g)|. For each x there are |\operatorname{Stab}(x)| = |G|/|\operatorname{Orb}(x)| pairs (Theorem 4), and over the points of one orbit O these add to |O| \cdot |G|/|O| = |G|. As the orbits partition X, |P| = |G| times the number of orbits. \square

Worked examples

Example 1

Pairs from four

S_4 acts on the set X of the six 2-element subsets of \{1, 2, 3, 4\} by \sigma \cdot \{a, b\} = \{\sigma(a), \sigma(b)\}. Check that this is an action, find the orbit and stabilizer of \{1, 2\}, and find the orbits of \langle (1\ 2\ 3\ 4) \rangle on X.

Solution

Since \sigma is one to one, \{\sigma(a), \sigma(b)\} has two elements. Also e \cdot \{a, b\} = \{a, b\}, and (\sigma\tau)(a) = \sigma(\tau(a)) gives \sigma \cdot (\tau \cdot \{a, b\}) = (\sigma\tau) \cdot \{a, b\}.

A permutation with 1 \mapsto a and 2 \mapsto b sends \{1, 2\} to \{a, b\}, so the action is transitive: the orbit has 6 points. A permutation fixes \{1, 2\} exactly when it maps \{1, 2\} onto itself, and then also \{3, 4\}, so

\operatorname{Stab}(\{1, 2\}) = \{e, (1\ 2), (3\ 4), (1\ 2)(3\ 4)\}.

Theorem 4 checks: 6 \cdot 4 = 24 = |S_4|. The stabilizer of \{1, 3\} is \{e, (1\ 3), (2\ 4), (1\ 3)(2\ 4)\}, a different subgroup: as Theorem 3 says, it is \sigma \operatorname{Stab}(\{1, 2\}) \sigma^{-1} for \sigma = (2\ 3), which sends \{1, 2\} to \{1, 3\} (by the cycle formula, Permutation groups and cycle notation, Exercise 14).

For \gamma = (1\ 2\ 3\ 4): \{1, 2\} \to \{2, 3\} \to \{3, 4\} \to \{4, 1\} \to \{1, 2\} and \{1, 3\} \to \{2, 4\} \to \{1, 3\}. So \langle \gamma \rangle has two orbits, of sizes 4 and 2, both dividing 4; the stabilizer of \{1, 3\} there is \{e, \gamma^2\}, as \gamma^2 = (1\ 3)(2\ 4).

Example 2

The rotations of a cube

Let R be the group of rotations of space that carry a cube onto itself (a composite of two such rotations is another, a fact from geometry). Find |R| without listing R, and check the answer with the vertices and the edges.

Solution

R acts on the six faces. A quarter turn about the vertical axis cycles the four side faces, and a quarter turn about a horizontal axis carries the top face to a side face, so the faces form one orbit. A rotation keeping the top face fixes its center and the center of the cube, so it turns about the vertical axis and carries the top square onto itself: a turn by 0^\circ, 90^\circ, 180^\circ or 270^\circ. By Theorem 4,

|R| = 6 \cdot 4 = 24.

Likewise the eight vertices form one orbit, each kept by the three turns about its long diagonal (8 \cdot 3 = 24), and the twelve edges form one orbit, each kept by the identity and one half-turn (12 \cdot 2 = 24). By axis, R consists of the identity, 6 quarter turns and 3 half-turns about the three face axes, 8 turns by 120^\circ or 240^\circ about the four long diagonals, and 6 half-turns about the six axes through midpoints of opposite edges: 1 + 6 + 3 + 8 + 6 = 24.

Example 3

Vectors and lines over Z_5

G = \operatorname{GL}_2(\mathbb{Z}_5) acts on the nonzero vectors of \mathbb{Z}_5^2 by A \cdot v = Av, and on the lines through the origin by A \cdot L = \{Av : v \in L\}. Use each action to find |G|.

Solution

Both are actions, since I_2v = v and A(Bv) = (AB)v, and an invertible matrix sends nonzero vectors to nonzero vectors and lines to lines.

Vectors. There are 25 - 1 = 24. Any nonzero v extends to a basis v, w, and the matrix with columns v, w sends e_1 = (1, 0) to v: one orbit. The stabilizer of e_1 is the set of invertible matrices with first column e_1, that is \begin{pmatrix} 1 & b \\ 0 & d \end{pmatrix} with d \ne 0: 5 \cdot 4 = 20 of them. So |G| = 24 \cdot 20 = 480, the count Lagrange's theorem took from Integers mod n, symmetries and matrices as groups, found here with no formula.

Lines. Each line holds 4 nonzero vectors and two lines share only 0, so there are 6 lines, again one orbit. A matrix keeps the line through e_1 exactly when Ae_1 = (a, 0) with a \ne 0: the upper triangular \begin{pmatrix} a & b \\ 0 & d \end{pmatrix} with a, d \ne 0, 4 \cdot 5 \cdot 4 = 80 of them. Again 6 \cdot 80 = 480.

Example 4

Conjugacy classes of A_4

Find the conjugacy classes of the alternating group A_4 and its class equation.

Solution

A_4 consists of e, the three products of two disjoint transpositions, and the eight 3-cycles (Permutation groups and cycle notation, Theorem 8). By the cycle formula, \sigma(a\ b\ c)\sigma^{-1} = (\sigma(a)\ \sigma(b)\ \sigma(c)).

Let x = (1\ 2\ 3). An element \sigma \in A_4 commutes with x exactly when (\sigma(1)\ \sigma(2)\ \sigma(3)) = (1\ 2\ 3), which forces \sigma(4) = 4, so \sigma is e, x or x^2. Conjugating x by the three double transpositions gives

\begin{aligned} \operatorname{cl}((1\ 2\ 3)) = \{&(1\ 2\ 3), (1\ 4\ 2), \\ &(1\ 3\ 4), (2\ 4\ 3)\}, \end{aligned}

the last three different from x; for instance (1\ 2)(3\ 4) gives (2\ 1\ 4) = (1\ 4\ 2). So C_{A_4}(x) = \langle x \rangle, and indeed |\operatorname{cl}(x)| = 12/3 = 4 (Theorem 5). The same for x^{-1} = (1\ 3\ 2) gives the other four 3-cycles. For y = (1\ 2)(3\ 4), the subgroup V of e and the double transpositions is abelian, so V \le C_{A_4}(y), while (1\ 2\ 3) \notin C_{A_4}(y). The order of C_{A_4}(y) is a multiple of 4 dividing 12 and not 12, so C_{A_4}(y) = V and |\operatorname{cl}(y)| = 3. Only e is central, and

12 = 1 + 3 + 4 + 4.

In S_4 all eight 3-cycles are conjugate (Normal subgroups, Example 6); in A_4 they split.

Example 5

Groups of order p squared

Let p be prime. Prove that every group of order p^2 is abelian.

Solution

Proof. By Corollary 7 and Lagrange's theorem, |Z(G)| is p or p^2. Suppose |Z(G)| = p, and take x \notin Z(G). The subgroup C_G(x) contains Z(G) and also x, so |C_G(x)| > p; it divides p^2, so C_G(x) = G. Then x commutes with every element, so x \in Z(G), a contradiction. So Z(G) = G, and G is abelian. \square

\mathbb{Z}_{p^2} and \mathbb{Z}_p \times \mathbb{Z}_p are two such groups, and Direct products and finite abelian groups shows there are no others up to isomorphism.

Example 6

Glazed tiles

In a ceramics workshop, Priya glazes square floor tiles whose top face is cut by its two diagonals into four triangles, each in one of three glazes. A tile can be turned but not flipped, so two glazings give the same design when one is a rotation of the other. Mateo cuts each design as a stencil from a clear sheet, which can also be turned over, so for him any symmetry of the square counts. How many designs does each count?

Solution

Number the triangles 1 (top), 2 (right), 3 (bottom), 4 (left). A glazing is a function f from \{1, 2, 3, 4\} to the three glazes, so there are 3^4 = 81. A symmetry g of the square permutes the triangles, and (g \cdot f)(t) = f(g^{-1}(t)) is the glazing moved by g. This is an action: (g \cdot (h \cdot f))(t) = f(h^{-1}g^{-1}(t)) = f((gh)^{-1}(t)).

1 2 3 4
Figure 1The four triangles of a tile, and the four axes of reflection of the square (Example 6). A reflection in a midline fixes two triangles and swaps the other two; a reflection in a diagonal swaps the triangles in two pairs.

A glazing is fixed by g exactly when it is constant on each cycle of g on the triangles (fixed triangles count as cycles of length 1), so |\operatorname{Fix}(g)| = 3^{c} for g with c cycles. The identity has 4 cycles, each quarter turn one, the half-turn (1\ 3)(2\ 4) two. Priya’s count, by Theorem 8, is

\frac{81 + 3 + 9 + 3}{4} = \frac{96}{4} = 24.

Mateo’s group adds four reflections. One in a midline fixes two triangles and swaps two, for 3 cycles; one in a diagonal swaps the triangles in two pairs, for 2 cycles. So

\frac{96 + 27 + 27 + 9 + 9}{8} = \frac{168}{8} = 21.
orbit of size 4 orbit of size 2 orbit of size 1
Figure 2Three orbits of the rotation group of the square on glazed tiles (Example 6), of sizes 4, 2 and 1. Every orbit size divides 4, as Theorem 4 requires.
Example 7

A move that fixes nothing

Let a finite group G act transitively on a finite set X with |X| \ge 2. Prove that some g \in G fixes no point of X.

Solution

Proof. There is one orbit, so Theorem 8 gives \sum_{g \in G} |\operatorname{Fix}(g)| = |G|. The identity contributes |X| \ge 2. If every other g fixed at least one point, the sum would be at least |X| + (|G| - 1) > |G|. So some g has \operatorname{Fix}(g) = \varnothing. \square In Example 1, (1\ 2\ 3\ 4) fixes none of the six pairs.

Boundaries

  • Infinite groups. For infinite G the product form of Theorem 4 means nothing, but the bijection survives: |\operatorname{Orb}(x)| = [G : \operatorname{Stab}(x)] (Exercise 2). Theorem 8 needs G and X finite.
  • One orbit, many stabilizers. Points of one orbit have conjugate stabilizers of equal size, not equal stabilizers (Example 1). They are equal when G is abelian.
  • The prime-power hypothesis. Theorem 6 fails for other groups: S_3, of order 6, acts on \{1, 2, 3\} with X_0 = \varnothing, and 3 \not\equiv 0 \pmod{2}.

Where this goes next

The The Sylow theorems apply Theorem 6 to p-groups acting on cosets and on subgroups by conjugation, where the stabilizer of a subgroup H is its normalizer N_G(H) (Normal subgroups). Isomorphisms proves Cayley’s theorem, which in this language says that in the action of G on itself by g \cdot x = gx, distinct elements act differently.

Exercises

Orbits and stabilizers

  1. S_5 acts on the 2-element subsets of \{1, \dots, 5\}. (a) Find the orbit and stabilizer of \{1, 2\} and check Theorem 4. (b) Find the orbits of \langle (1\ 2\ 3\ 4\ 5) \rangle.
  2. \mathbb{R}^\times acts on \mathbb{R}^2 by c \cdot v = cv. Find every orbit and every stabilizer, and say what Theorem 4 gives.
  3. Let T be the rotation group of a regular tetrahedron. Find |T| from its action on the four vertices, and check it with the six edges.
  4. Find the order of the rotation group of a regular octahedron from its six vertices, and check it with its eight faces.
  5. \operatorname{GL}_2(\mathbb{Z}_3) acts on the nonzero vectors of \mathbb{Z}_3^2. Find the orbit and stabilizer of e_1 and the order of the group.
  6. (a) The faces of a cube are labeled 1 to 6, one label each. Up to rotation, how many different dice are there? (b) How many if opposite faces must add to 7?
  7. (a) A group of order 49 acts on a set of 10 points. Show that at least 3 points are fixed by every element. (b) A group of order 16 acts on the 2-element subsets of \{1, \dots, 6\}. Show that some subset is fixed by every element.

Conjugacy classes

  1. Find the conjugacy classes of D_5 and its class equation.
  2. In S_4, find |C_{S_4}(x)| and list C_{S_4}(x) for x = (1\ 2)(3\ 4) and for x = (1\ 2\ 3\ 4).
  3. Find the conjugacy classes of Q_8 and its class equation.
  4. Which of these could be the class equation of a group? (a) 10 = 1 + 1 + 4 + 4; (b) 9 = 1 + 2 + 3 + 3; (c) 21 = 1 + 3 + 3 + 7 + 7; (d) 16 = 1 + 1 + 2 + 4 + 8.

Counting orbits

  1. How many ways are there to paint the faces of a cube with two colors, up to rotation?
  2. Priya adds two more glazes, for five in all. How many designs do she and Mateo now count?
  3. With five glazes and rotations only, how many of Priya’s designs have an orbit of size 1, of size 2 and of size 4?

Proofs

  1. Let H \le G. Prove that g \cdot aH = gaH is a well-defined, transitive action of G on the left cosets of H, and that \operatorname{Stab}(aH) = aHa^{-1}.
  2. Let G be finite and H a proper subgroup. Prove that some element of G lies in no conjugate aHa^{-1}.
  3. Prove that the number of conjugacy classes of a finite group G is \displaystyle \frac{1}{|G|}\,|\{(g, x) \in G \times G : gx = xg\}|, and check it for S_3.
  4. Let |G| = p^3, p prime, with G not abelian. Prove that |Z(G)| = p.
  5. Let G be a finite group of odd order. Prove that no x \ne e is conjugate to x^{-1}.
Answers
  1. (a) The orbit is all \binom{5}{2} = 10 pairs, as in Example 1. A stabilizing \sigma maps \{1, 2\} and \{3, 4, 5\} onto themselves: 2! \cdot 3! = 12 elements, and 10 \cdot 12 = 120 = |S_5|. (b) \{1, 2\} \to \{2, 3\} \to \{3, 4\} \to \{4, 5\} \to \{5, 1\} and \{1, 3\} \to \{2, 4\} \to \{3, 5\} \to \{4, 1\} \to \{5, 2\}: two orbits of size 5, with trivial stabilizers.
  2. 1v = v and c(dv) = (cd)v. \operatorname{Orb}(0) = \{0\}, with stabilizer \mathbb{R}^\times. For v \ne 0, \operatorname{Orb}(v) is the line through 0 and v with 0 removed, and \operatorname{Stab}(v) = \{1\}, since cv = v gives (c - 1)v = 0. Theorem 4 matches the cosets of \{1\}, the elements c of \mathbb{R}^\times, with the points cv.
  3. A rotation keeping a vertex turns about the axis through it and the center of the opposite face: 3 rotations. The turns about one vertex’s axis cycle the other three vertices, so all four form one orbit: |T| = 4 \cdot 3 = 12. The edges form one orbit of 6, and a rotation keeping edge 12 either fixes vertices 1 and 2, hence is e, or swaps them and swaps 3 and 4: one half-turn. 6 \cdot 2 = 12.
  4. A rotation keeping a vertex turns about the axis through it and the opposite vertex, carrying the square of the other four to itself: 4 rotations, and the six vertices form one orbit, so the order is 6 \cdot 4 = 24. A face is kept by the 3 turns about the axis through its center, and the faces form one orbit: 8 \cdot 3 = 24.
  5. As in Example 3, the orbit is all 9 - 1 = 8 nonzero vectors and the stabilizer is \begin{pmatrix} 1 & b \\ 0 & d \end{pmatrix} with b \in \{0, 1, 2\} and d \in \{1, 2\}, 6 matrices. So |\operatorname{GL}_2(\mathbb{Z}_3)| = 8 \cdot 6 = 48.
  6. (a) R (Example 2) acts on the 6! = 720 labelings. Every rotation except e moves some face, so it changes every labeling; stabilizers are trivial and each orbit has 24 elements: 720/24 = 30 dice. (b) Place 1 (6 ways), then 2 (4 ways), then 3 (2 ways), their partners opposite: 48 labelings, so 48/24 = 2 dice, mirror images of each other.
  7. (a) 49 = 7^2, so |X_0| \equiv 10 \equiv 3 \pmod{7} by Theorem 6. As 0 \le |X_0| \le 10, |X_0| is 3 or 10. (b) There are \binom{6}{2} = 15 subsets and 16 = 2^4, so |X_0| \equiv 1 \pmod{2} and |X_0| \ge 1.
  8. From srs = r^{-1}, sr^ks^{-1} = r^{-k} and r^ksr^{-k} = r^{2k}s. So \operatorname{cl}(r) = \{r, r^4\} and \operatorname{cl}(r^2) = \{r^2, r^3\}, and as 2k runs through every class mod 5, \operatorname{cl}(s) is all five reflections. 10 = 1 + 2 + 2 + 5.
  9. The classes of (1\ 2)(3\ 4) and (1\ 2\ 3\ 4) have 3 and 6 elements (Normal subgroups, Example 6), so by Theorem 5 the centralizers have orders 24/3 = 8 and 24/6 = 4. The first is e, (1\ 2), (3\ 4), (1\ 2)(3\ 4), (1\ 3)(2\ 4), (1\ 4)(2\ 3), (1\ 3\ 2\ 4), (1\ 4\ 2\ 3), each checked by the cycle formula. The second contains \langle (1\ 2\ 3\ 4) \rangle, of order 4, so it equals it.
  10. Z(Q_8) = \{1, -1\}. jij^{-1} = ji(-j) = -i, so \operatorname{cl}(i) \supseteq \{i, -i\}; C_{Q_8}(i) contains \langle i \rangle but not j, so it has order 4 and |\operatorname{cl}(i)| = 2. Likewise \{j, -j\} and \{k, -k\}: 8 = 1 + 1 + 2 + 2 + 2.
  11. (a) No: 4 \nmid 10. (b) No: 2 \nmid 9. (c) Possible: the maps x \mapsto ux + c of \mathbb{Z}_7 with u \in \{1, 2, 4\} form a group of order 21 with exactly these class sizes. (d) No: if |Z(G)| = 2 and x \notin Z(G), then C_G(x) contains Z(G) and x, so its order is a multiple of 2 above 2, and |\operatorname{cl}(x)| \le 16/4 = 4.
  12. 10. With the types of Example 2, |\operatorname{Fix}| = 2^c, c the number of face cycles: 6 for e, 3 for quarter turns, 4 for face half-turns, 2 for vertex turns, 3 for edge half-turns. The sum is 64 + 48 + 48 + 32 + 48 = 240, and \displaystyle \frac{240}{24} = 10.
  13. Priya: \displaystyle \frac{5^4 + 5 + 5^2 + 5}{4} = \frac{660}{4} = 165. Mateo: \displaystyle \frac{660 + 2 \cdot 5^3 + 2 \cdot 5^2}{8} = \frac{960}{8} = 120.
  14. Size 1: the 5 one-glaze tiles. Size 2: glazings fixed by the half-turn but not a quarter turn, 5^2 - 5 = 20, in 10 orbits. Size 4: the other 625 - 25 = 600, in 150 orbits. 5 + 10 + 150 = 165.
  15. Proof. If aH = bH then a^{-1}b \in H, and (ga)^{-1}(gb) = a^{-1}b, so gaH = gbH: well defined. eaH = aH and g(haH) = (gh)aH. (ba^{-1}) \cdot aH = bH: transitive. Finally gaH = aH \iff a^{-1}ga \in H \iff g \in aHa^{-1} (Cosets, Lemma 2). \square
  16. Proof. G acts transitively on the [G : H] \ge 2 left cosets (Exercise 15), so by Example 7 some g fixes no coset. By Exercise 15, g fixes aH exactly when g \in aHa^{-1}, so g lies in no conjugate. \square
  17. Proof. Apply Theorem 8 to conjugation on X = G: the orbits are the classes and \operatorname{Fix}(g) = C_G(g), so the number of classes is \displaystyle \frac{1}{|G|}\sum_g |C_G(g)|, and the sum counts the commuting pairs. In S_3, |C(e)| = 6, each transposition has |C| = 2 and each 3-cycle |C| = 3: 6 + 6 + 6 = 18 pairs, and 18/6 = 3 classes. \square
  18. Proof. |Z(G)| divides p^3, is at least p (Corollary 7), and is not p^3, as G is not abelian. Suppose |Z(G)| = p^2 and take x \notin Z(G). Then C_G(x) contains Z(G) and x, so its order is a multiple of p^2 above p^2, hence p^3, and x \in Z(G), a contradiction. So |Z(G)| = p. \square
  19. Proof. Suppose gxg^{-1} = x^{-1}. Then g^2xg^{-2} = gx^{-1}g^{-1} = (gxg^{-1})^{-1} = x, so g^2 \in C_G(x). As \operatorname{ord}(g) divides |G|, it is odd, say 2m + 1, and g = g^{2m + 2} = (g^2)^{m + 1} \in C_G(x). Then x^{-1} = gxg^{-1} = x, so x^2 = e, and \operatorname{ord}(x) divides both 2 and the odd number |G|: x = e. \square
math.wiki · updated 2026-11-17 · CC-BY-SA-4.0