Logo

Chapter 4: Group Actions

4.1 Group Actions and Permutation Representations

Definition: The kernel and stabilizer definitions follow similarly from 2.2. An action is faithful if its kernel is the identity.
Definition: The kernel of an action is the kernel of its permutation representation. In particular, an action of GG on AA induces a faithful action of G/ker  φG/\mathrm{ker\;\varphi} on AA, since g,h∈Gg,h\in G induce the same permutation on A  ⟺  g,hA\iff g,h are representatives of the same coset of ker  φ\mathrm{ker\;\varphi}. Note that ∀a∈A\forall a\in A, the kernel of the action is contained in GaG_{a}, i.e. ker  φ=⋂a∈AGa\mathrm{ker\;\varphi}=\bigcap_{a\in A}G_{a}. Conversely, given a set A≠∅A\neq \emptyset and any homomorphism φ\varphi of the group GG into SAS_{A} we obtain an action of GG on AA such that g⋅a=φ(g)(a)g\cdot a=\varphi(g)(a). The kernel of this action is the same as ker  φ\mathrm{ker\;\varphi}. The permutation representation associated to this action is precisely the given homomorphism φ\varphi.
Proposition 1: For any group GG and any nonempty set AA there is a bijection between the actions of GG on AA and the homomorphisms of GG into SAS_{A}.
Definition: If GG is a group, a permutation representation of GG is any homomorphism of GG into the symmetric group SAS_{A} for some nonempty set AA. We shall say a given action of GG on AA affords or induces the associated permutation representation of GG.
Proposition 2: Let GG be a group acting on A≠∅A\neq \emptyset. The relation on AA defined by a∼b  ⟺  a=g⋅ba\sim b\iff a=g\cdot b for some g∈Gg\in G is an equivalence relation. ∀a∈A\forall a\in A, the number of elements in the equivalence class containing aa is ∣G:Ga∣\lvert G:G_{a} \rvert.
Definition: Let GG be a group acting on A≠∅A\neq \emptyset. The equivalence class {g⋅a∣g∈G}\{ g\cdot a\mid g\in G \} is the orbit of GG containing aa. The action of GG on AA is called transitive if there is only one orbit for the whole set AA, i.e., ∀a,b∈A\forall a,b\in A, ∃g∈G\exists g\in G such that a=g⋅ba=g\cdot b.
Definition: Subgroups of symmetric groups are called permutation groups.

4.2 Groups Acting on Themselves by Left Multiplication (Cayley's Theorem)

Theorem 3: Let GG be a group, H≤GH\leq G, and let GG act by left multiplication on the set AA of left cosets of HH in GG. Let πH\pi_{H} be the associated permutation representation afforded by this action. Then, GG acts transitively on AA; G1HG_{1H} is the subgroup HH; the action's kernel (i.e. ker  πH\mathrm{ker\;}\pi_{H}) is ⋂x∈GxHx−1\bigcap_{x \in G}xHx ^{-1} and ker  πH\mathrm{ker\;}\pi_{H} is the largest normal subgroup of GG contained in HH.
Corollary 4: (Cayley's) A group GG of order nn is isomorphic to a subgroup of SnS_{n}.
Corollary 5: If GG is a finite group of order nn and pp is the smallest prime such that p∣np \mid n, then any subgroup of index pp is normal. (Note, however, that a group of order nn does not necessarily have a subgroup of index pp).

4.3 Groups Acting on Themselves by Conjugation (Class Equation)

Definition: Two elements a,b∈Ga,b\in G are conjugate if ∃g∈G\exists g\in G such that b=gag−1b=gag^{-1}, i.e. they are in the same orbit of GG acting on itself by conjugation. These orbits are called conjugacy classes.
Definition: Two subsets S,T⊆GS,T\subseteq G are conjugate if ∃g∈G\exists g\in G such that T=gSg−1T=gSg^{-1}.
Proposition 6: The number of conjugates of a subset S⊆GS\subseteq G (order of its orbit) is ∣G:NG(S)∣\lvert G:N_{G}(S) \rvert. The number of conjugates of an element s∈Gs \in G is ∣G:CG(s)∣\lvert G:C_{G}(s) \rvert.
Theorem 7: (Class Equation) Let GG be a finite group and g1,g2,…,grg_{1},g_{2},\dots,g_{r} be representatives of the distinct conjugacy classes of GG that are not in the center Z(G)Z(G). Then ∣G∣=∣Z(G)∣+∑i=1r∣G:CG(Gi)∣\lvert G \rvert=\lvert Z(G) \rvert+\sum_{i=1}^{r}\lvert G:C_{G}(G_{i}) \rvert.
Theorem 8: If pp is a prime and PP is a group of order pαp^{\alpha} then Z(P)≠1Z(P)\neq 1, i.e. is nontrivial.
Corollary 9: If ∣P∣=p2\lvert P \rvert=p^{2} for some prime pp, then PP is abelian, and either P≅Zp2P\cong Z_{p^{2}} or P≅Zp×ZpP\cong Z_{p}\times Z_{p}.
Proposition 10: Let σ,τ∈Sn\sigma,\tau \in S_{n} and let σ\sigma have cycle decomposition (a1  …  ak1)(b1  …  bk2)…(a_{1}\;\dots\;a_{k_{1}})(b_{1}\;\dots\;b_{k_{2}})\dots. Then τστ−1\tau\sigma \tau ^{-1} has cycle decomposition (τ(a1)  …  τ(ak1))(τ(b1)  …  τ(bk2))…(\tau(a_{1})\;\dots\;\tau(a_{k_{1}}))(\tau(b_{1})\;\dots\;\tau(b_{k_{2}}))\dots.
Definition: If σ∈Sn\sigma \in S_{n} is the product of disjoint cycles of lengths n1,…,nrn_{1},\dots,n_{r} with n1≤⋯≤nrn_{1}\leq \dots\leq n_{r}, then n1,…,nrn_{1},\dots,n_{r} is the cycle type of σ\sigma. If n∈Z+n\in \mathbb{Z}^+. A partition of nn is any nondecreasing sequence of positive integers whose sum is nn.
Proposition 11: Two elements of SnS_{n} are conjugate in SnS_{n}   ⟺  \iff they have the same cycle type.
Fact: If H⊴GH\trianglelefteq G, then ∀K\forall \mathcal{K} conjugacy classes of GG, either K⊆H\mathcal{K}\subseteq H or K∩H=∅\mathcal{K}\cap H=\emptyset.
Theorem 12: A5A_{5} is a simple group.
Fact: Conjugation is often written as a right group action with notation ag=g−1aga^{g}=g^{-1}ag.

4.4 Automorphisms

Definition: Let GG be a group. An isomorphism from GG onto itself is called an automorphism of GG, the group of which is denoted Aut(G)\mathrm{Aut}(G). Aut(G)≤SG\mathrm{Aut}(G)\leq S_{G}.
Proposition 13: Let H⊴GH\trianglelefteq G. Then GG acts by conjugation on HH as automorphisms of HH, i.e. the action of GG on HH by conjugation is an automorphism ∀g∈G\forall g\in G. The permutation representation afforded by this action is a homomorphism of GG into Aut(H)\mathrm{Aut}(H) with kernel CG(H)C_{G}(H). In particular, G/CG(H)≅FG/C_{G}(H)\cong F such that F≤Aut(H)F\leq \mathrm{Aut}(H).
Fact: Automorphisms must send subgroups to subgroups of the same order, elements of order nn to elements of order nn, etc.
Corollary 14: If K≤GK\leq G and g∈Gg\in G, then K≅gKg−1K\cong gKg^{-1}. Conjugate elements and conjugate subgroups have the same order.
Corollary 15: ∀H≤G\forall H\leq G, NG(H)/CG(H)≅FN_{G}(H)/C_{G}(H)\cong F such that F≤Aut(H)F\leq \mathrm{Aut}(H). In particular, G/Z(G)G/Z(G) is isomorphic to a subgroup of Aut(G)\mathrm{Aut}(G) (consider H=GH=G).
Definition: Let GG be a group and g∈Gg\in G. Conjugation by gg is called an inner automorphism of GG and the subgroup of Aut(G)\mathrm{Aut}(G) containing all inner automorphisms is denoted by Inn(G)\mathrm{Inn}(G).
Definition: Let H≤GH\leq G. Then HH is called characteristic in GG, denoted H  char  GH \mathrm{\;char\;}G, if ∀σ∈Aut(G)\forall\sigma \in \mathrm{Aut}(G) we have σ(H)=H\sigma(H)=H.
Fact:

Proposition 16: Aut(Zn)≅(Z/nZ)×\mathrm{Aut}(Z_{n})\cong(\mathbb{Z}/n\mathbb{Z})^\times, where (Z/nZ)×(\mathbb{Z}/n\mathbb{Z})^{\times} is an abelian group of order φ(n)\varphi(n).
Fact: Let GG be a group with ∣G∣=pq\lvert G \rvert=pq, with p,qp,q prime, p<qp<q, and p∤q−1p\nmid q-1. Then, GG is abelian.
Proposition 17:

Fact: The VV described in Prop. 17 is called the elementary abelian group of order pnp^{n}. For any prime pp, Vp2=Zp×ZpV_{p^{2}}=Z_{p}\times Z_{p}, and Aut(Vp2)≅GL2(Fp)\mathrm{Aut}(V_{p^{2}})\cong GL_{2}(\mathbb{F}_{p}) has order p(p−1)2(p+1)p(p-1)^{2}(p+1). Corr. 9 thus implies that ∣P∣=p2  ⟹  ∣Aut(P)∣=p(p−1) or p(p−1)2(p+1)\lvert P \rvert=p^{2}\implies \lvert \mathrm{Aut}(P) \rvert=p(p-1)\text{ or }p(p-1)^{2}(p+1), dependent on if PP is cyclic or elementary abelian, respectively.

4.5 Sylow's Theorem

Theorem 18: (Sylow's) Let GG be a group of order pαmp^{\alpha}m, where pp is a prime with p∤mp \nmid m. Then,

Lemma 19: Let P∈Sylp(G)P\in Syl_{p}(G). If QQ is any pp-subgroup of GG, then Q∩NG(P)=Q∩PQ\cap N_{G}(P)=Q\cap P.
Corollary 20: Let PP be a Sylow pp-subgroup of GG. Then the following are equivalent:

Facts:

Proposition 21: If ∣G∣=60\lvert G \rvert = 60 and ∣Syl5(G)∣>1\lvert Syl_{5}(G) \rvert > 1, then GG is simple.
Corollary 22: A5A_{5} is simple.
Proposition 23: If GG is a simple group of order 6060, then G≅A5G\cong A_{5}.
(4.6) Theorem 24: A5A_{5} is simple ∀n≥5\forall n\geq 5.