Back to A Complete Introduction to Abstract Algebra

Group Actions

How a group acts on a set through identity and compatibility axioms, illustrated by permutations acting on points and a group acting on itself by conjugation.

A Complete Introduction to Abstract Algebra, Group Actions

Status
FlagsLoading your progress…

17 exercises

Exercise 1

Let GG be a group. Let the function α:G×G→G\alpha:G\times G\to G be such that α(g,x)=gxg−1\alpha(g,x)=gxg^{-1}. Show that α\alpha is a group action of GG on GG.

3.0

Exercise 2

Let X={1,2,3}X=\{1,2,3\}, and let S3\mathrm{S}_{3} act on XX. What are the fixed point(s) of each of the 6 permutations in S3\mathrm{S}_{3}?

3.0

Exercise 3

Let X={1,2,3}X=\{1,2,3\}, and let S3\mathrm{S}_{3} act on XX. What are the stabilizers of each of the 3 elements in XX?

3.0

Exercise 4

Let GG be a group that acts on a non-empty set XX. Let g,h∈Gg,h\in G and x∈Xx\in X. Prove that g⋅x=h⋅xg\cdot x=h\cdot x if and only if g−1h∈StabG(x)g^{-1}h\in\mathrm{Stab}_{G}(x).

3.0

Exercise 5

Let GG be a group that acts on a non-empty set XX. Prove that

  1. every orbit is non-empty;

  2. every element in XX is in some orbit; and

  3. if OrbG(x1)∩OrbG(x2)≠∅\mathrm{Orb}_{G}(x_{1})\cap\mathrm{Orb}_{G}(x_{2})\neq\varnothing where x1,x2∈Xx_{1},x_{2}\in X, then OrbG(x1)=OrbG(x2)\mathrm{Orb}_{G}(x_{1})=\mathrm{Orb}_{G}(x_{2}).

3.0

Exercise 6

Let GG be a group that acts on a non-empty set XX. Show that if the group action is transitive if and only if OrbG(x)=X\mathrm{Orb}_{G}(x)=X for all x∈Xx\in X.

3.0

Exercise 7

Let G=SnG=\mathrm{S}_{n} be a transformation group and consider the GG-set X={1,2,3,…,n}X=\{1,2,3,\dots,n\}.

  1. Show that the group action is transitive.

  2. Find the order of the stabilizer of x∈Xx\in X by GG.

3.0

Exercise 8

Let GG be a group and x∈Gx\in G. Prove that ∣Cl(x)∣=[G:CG(x)]|\mathrm{Cl}(x)|=[G:\mathrm{C}_{G}(x)].

3.0

Exercise 9

The Cayley table of D3D_{3} is in 1.29.

  1. Find Z(D3)\mathrm{Z}(D_{3}), the center of D3D_{3}.

  2. For each conjugacy class of D3D_{3} with more than 1 element, find a representative.

  3. Find the class equation of D3D_{3}.

3.0

Exercise 10

For a finite group GG with order npnp where pp is prime and nn is a positive integer, show that GG has a subgroup of order pp.

3.0

Problem 1

Let G=D5G=D_{5}, the dihedral group of order 10.

  1. What is/are the possible order(s) of a non-trivial proper subgroup of GG?

  2. For each of the possible order(s) identified in (i), find such a subgroup.

3.0

Problem 2

Suppose GG is a finite group with order n>1n>1 where g2=eg^{2}=e for all g∈Gg\in G. Prove that n=2kn=2^{k} where kk is a positive integer.

3.0

Problem 3

A group action is said to be free if g⋅x=xg\cdot x=x means that gg is the identity (i.e., only the identity fixes any xx).

Let GG be a group and SS be a non-empty GG-set. Suppose GG acts on SS freely and transitively. Prove that GG and SS have the same number of elements.

3.0

Problem 4

Let GG be a group of order 25 and XX be a GG-set of 24 elements. Show that there exists an element in GG with a fixed point.

3.0

Problem 5

A bracelet consists of 3 beads that each can be one of nn colours. Two bracelets are the same if the rotation of one yields the other, or if one can be obtained via reflecting about a line, or any combination of these two actions. How many distinct bracelets are there?

3.0

Problem 6

Let pp be a prime number. Prove that a group of order p2p^{2} must be abelian.(Hint: Consider 1.3 and 1.11.)

3.0

Problem 7

Let GG be a finite pp-group, and XX be a GG-set. Let the set

Prove that ∣X∣≡∣Ω∣(modp)|X|\equiv|\Omega|\pmod{p}.

3.0

Adapted from A Complete Introduction to Abstract Algebra © 2022–2026 Kan Onn Kit. Licensed under CC BY-SA 4.0. Source: A Complete Introduction to Abstract Algebra. Imported at revision a559e8b.