Skip to Content
Math4302Modern Algebra (Lecture 20)

Math4302 Modern Algebra (Lecture 20)

Groups

Commutator of a group

Let GG be a group and a,bGa,b\in G, [a,b]=aba1b1[a,b]=aba^{-1}b^{-1}.

Let GGG'\leq G be the subgroup of GG generated by all commutators of GG, G={[a1,b1][a2,b2][an,bn]a1,a2,,an,b1,b2,,bnG}G'=\{[a_1,b_1][a_2,b_2]\ldots[a_n,b_n]\mid a_1,a_2,\ldots,a_n,b_1,b_2,\ldots,b_n\in G\}.

Last time we shed that GG' is a normal subgroup of GG and G/GG/G' is abelian.

Proposition for commutator subgroup

If NGN\trianglelefteq G is a normal subgroup of GG and G/NG/N is abelian, then GNG'\leq N.

Proof

We have aNbN=bNaNaNbN=bNaN for all a,bGa,b\in G.

so abN=baNabN=baN, a1b1abN=Na^{-1}b^{-1}abN=N, so a1b1Na^{-1}b^{-1}\in N, so for every a,b\iGa,b\i G, since a1,b1Na^{-1},b^{-1}\in N, (a1)1(b1)1a1b1N(a^{-1})^{-1}(b^{-1})^{-1}a^{-1}b^{-1}\in N, so [a,b]N[a,b]\in N.

So GNG'\leq N.

Example

Consider G=S3G=S_3. find GG'.

the trivial way is to enumerate all the commutators, but we can do better than that applying the proposition above to check if any normal group has an abelian factor group to narrow down the search

Let N={e,ρ,ρ2}N=\{e,\rho,\rho^2\}, ρ=(1,2,3)\rho=(1,2,3), then N=G/2|N|=|G|/2, so NN is normal and G/N=2so|G/N|=2 so G/N\simeq \mathbb{Z}_2siabelian,sosi abelian, soG’\subseteq N$.

Now let ρ=(1,2,3),σ=(1,2)\rho=(1,2,3),\sigma=(1,2), [ρ,σ]=(1,2,3)(1,2)(1,3,2)(1,2)=(1,3,2)[\rho,\sigma]=(1,2,3)(1,2)(1,3,2)(1,2)=(1,3,2)

So ρ2=(1,3,2)\rho^2=(1,3,2) is in GG' and ρ=(1,3,2)1G\rho=(1,3,2)^{-1}\in G, therefore NGN\subseteq G'.

So G=NG'=N.

Few additional exercises to for n5n\geq 5, we have G=AnG'=A_n. (relates to simple subgroup properties.) You may check it out.

Group acting on a set

Definition for group acting on a set

Let GG be a group, XX be a set, XX is a GG-set or GG acts on XX if there is a map

G×XXG\times X\to X (g,x)gx( or simply g(x))(g,x)\mapsto g\cdot x\, (\text{ or simply }g(x))

such that

  1. ex=x,xXe\cdot x=x,\forall x\in X
  2. g2(g1x)=(g2g1)xg_2\cdot(g_1\cdot x)=(g_2 g_1)\cdot x

There is always a trivial action defined on XX by gx=xg\cdot x=x satisfying the two properties.

Example

Let GG be a group,

GG acts on GG by gxghg\cdot x\coloneqq g h, g,xGg,x\in G


GG acts on GG via conjugation, gxgxg1g\cdot x\coloneqq g x g^{-1}, g,xGg,x\in G

Let’s check the two properties are satisfied.

ex=exe1=xe\cdot x=exe^{-1}=x

g2(g1x)=g2(g1xg11)=g2g1xg11g21=g2g1xg11g21=(g2g1)(x)(g11g21)=(g2g1)(x)\begin{aligned} g_2\cdot (g_1\cdot x)&= g_2\cdot (g_1xg_1^{-1})\\ &= g_2g_1xg_1^{-1} g_2^{-1}\\ &= g_2g_1xg_1^{-1} g_2^{-1}\\ &= (g_2 g_1)(x)(g_1^{-1}g_2^{-1})\\ &= (g_2 g_1)(x) \end{aligned}

Take SnS_n acts on {1,2,,n}\{1,2,\ldots,n\} via σxσ(x)\sigma\cdot x\coloneqq \sigma(x).


GL(n,R)GL(n,\mathbb{R}) (general linear group) acts on Rn\mathbb{R}^n by AxAxA\cdot x\coloneqq A x, AGL(n,R),xRnA\in GL(n,\mathbb{R}), x\in \mathbb{R}^n

Group action is a homomorphism

Let XX be a GG-set, gGg\in G, then the function

σg:XX,xgx\sigma_g:X\to X,x\mapsto g\cdot x

is a bijection, and the function ϕ:GSX,gσg\phi:G\to S_X, g\mapsto \sigma_g is a group homomorphism.

Proof

σg\sigma_g is onto: If yXy\in X, let x=g1yx=g^{-1}y, then σg(g1y)=g(g1y)=(gg1)y=ey=y\sigma_g(g^{-1}\cdot y)=g\cdot (g^{-1}\cdot y)=(gg^{-1})\cdot y=e\cdot y=y.

σg\sigma_g is one-to-one: If σg(x1)=σg(x2)\sigma_g(x_1)=\sigma_g(x_2), then gx1=gx2g\cdot x_1=g\cdot x_2.

So g1(gx1)=g1(gx2)=x1=x2g^{-1}\cdot (g\cdot x_1)=g^{-1}\cdot (g\cdot x_2)=x_1=x_2.

Then we need to show that ϕ\phi is a homomorphism.

ϕ(g1g2)=ϕ(g1)ϕ(g2)\phi(g_1g_2)=\phi(g_1)\cdot \phi(g_2)

Note that ϕ(g1g2)=σg1g2\phi(g_1g_2)=\sigma_{g_1g_2}, ϕ(g1)=σg1\phi(g_1)=\sigma_{g_1}, ϕ(g2)=σg2\phi(g_2)=\sigma_{g_2}.

For every xXx\in X, σg1g2(x)=(g1g2)x\sigma_{g_1g_2}(x)=(g_1g_2)\cdot x, σg1(x)=g1x\sigma_{g_1}(x)=g_1\cdot x, σg2(x)=g2x\sigma_{g_2}(x)=g_2\cdot x. By the second property of GG-sets, we have σg1σg2=g1(g2x)=(g1g2)x=σg1g2x\sigma_{g_1}\cdot \sigma_{g_2}=g_1\circ(g_2\circ x)=(g_1g_2)\circ x=\sigma_{g_1g_2}\circ x.

Note

ϕ\phi as above is general not injective and not surjective.

If GG acts trivially on xx (gx=x,gGg\cdot x=x,\forall g\in G), then ϕ(g)\phi(g) is the identity function for all gGg\in G.

Define a relation on XX by xy    y=gxx\sim y\iff y=g\cdot x for some gGg\in G.

This equivalence relation is well-defined.

  • Reflexive: xxx\sim x, take exe\cdot x
  • Symmetric: xy    yxx\sim y\implies y\sim x (g1Gg^{-1}\in G, g1(gx)=g1yg^{-1}\cdot (g\cdot x)=g^{-1}\cdot y)
  • Transitive: xy,yz    xzx\sim y, y\sim z\implies x\sim z take x=g1y=g1(g2z)=g1g2zx=g_1\cdot y=g_1\cdot (g_2\cdot z)=g_1g_2\cdot z and g1g2Gg_1g_2\in G.

This gives a orbit for xXx\in X!

Last updated on