Let \(G\) be any group and define an action \(\cdot\) of \(G\) on itself by the rule
\begin{equation*}
g \cdot x = g x, \;\text{for}\; g \in G \;\text{and}\; x \in G.
\end{equation*}
This is also known as the left regular action
Self Conjugation Action.
Let \(G\) be any group and fix an element \(g \in G\text{.}\) Define the conjugation action of \(G\) on itself by setting
\begin{equation*}
g\cdot x=gxg^{-1} \;\text{for any}\; g,x\in G.
\end{equation*}
This is also known as self-conjugation
Lemma5.12.Kernel of the Conjugation Action.
The kernel of the permutation representation for the conjugation action is the center \(Z(G)\text{.}\)
Proof.
If \(\rho:G\to \operatorname{Perm}(G)\) is the permutation representation for \(G\) acting on \(G\) by Conjugation, then
\begin{equation*}
g\in \operatorname{Ker}\rho\iff g\cdot x=x, \forall x\in G \iff gxg^{-1}=x, \forall x\in G
\end{equation*}
\begin{equation*}
\iff gx=xg, \forall x\in G \iff g\in Z(G).
\end{equation*}
Theorem5.13.Faithful Self Actions.
The left regular action is faithful.
The self conjugation action is faithful if and only if \(Z(G)=\{e\}\text{.}\)
A group may also act on its cosets.
Example5.14.Actions on Cosets.
For a subgroup \(H \leq G\text{,}\) consider the set of left cosets \(G/H = \{gH : g \in G\}\text{.}\) Then \(G\) acts on \(G/H\) my left multiplication.
Lemma5.15.Largest Normal Subgroup.
Let \(H\) be a subgroup of a group \(G\text{,}\) and let \(G\) act on the set \(G/H\) of left cosets by left multiplication \(g \cdot (g'H) = (gg')H\text{.}\) Let \(\rho: G\to \Perm(G/H)\) denote the permutation representation associated to this action. Then
the subgroup described in (2) is the largest (with respect to containment) normal subgroup of \(G\) contained in \(H\text{.}\)
Qual Watch.
Proving Lemma 5.15 is extremely similar to Part (a) of [cross-reference to target(s) "june-2016-1" missing or not unique] on the [cross-reference to target(s) "june-2016" missing or not unique] qualifying exam.
Theorem5.16.Smallest Prime Index is Normal.
Let \(G\) be a finite group and let \(H\) be a subgroup of \(G\) of index \(p\text{,}\) where \(p\) is the smallest prime divisor of the order of \(G\text{.}\) Then \(H\) is normal in \(G\text{.}\)
Proof.
Let \(S=G/H\) and note that \(|S|=p\text{.}\) Let \(K\) denote the kernel of the permutation representation generated by \(G\) acting on \(S\) by left multiplication.
The First Isomorphism Theorem tells us that \(G/K\cong\im(\rho)\leq S_p\text{.}\) Thus \(|K|\big|p!\) by Lagrange’s Theorem. Let \(k\in K\text{.}\) Then \(kgH=gH\) for all \(g\in G\text{,}\) making \(k\in gHg\inv\) for all \(g\in G,\) including \(e\text{.}\) Thus \(K\nsg H\text{.}\)
This yields \([G:K]=[G:H][H:K]\text{.}\) Let \(h=[H:K]\text{,}\) giving us \([G:K]=ph\text{.}\) As \(|K|\big|p!\) we have \(h|(p-1)!\text{,}\) so \(h<p\text{.}\) But \(p\) is the smallest prime dividing the order of \(G\text{,}\) and thus \(h=1\text{,}\) making \(H=K\) and \(H\nsg G\text{.}\)
Qual Watch.
Proving Theorem 5.16 was [cross-reference to target(s) "jan-2023-1" missing or not unique] on the [cross-reference to target(s) "jan-2023" missing or not unique] qualifying exam and [cross-reference to target(s) "jan-2015-1" missing or not unique] on the [cross-reference to target(s) "jan-2015" missing or not unique] qualifying exam.
SubsectionConjugacy
“Words may inspire but only action creates change.”
―Simon Sinek
Definition5.17.Conjugate.
Let \(G\) be a group. Two elements \(g,g' \in G\) are conjugate if there is \(h \in G\) with \(g' = hgh^{-1}\text{.}\) Two subsets \(S,S' \subseteq G\) are conjugate if there is \(h \in G\) with \(S' = hSh^{-1}\text{.}\)
Definition5.18.Conjugacy Class.
The conjugacy class of an element \(x \in G\) is \(C_G(x) = \{gxg^{-1} \mid g \in G\}\text{.}\)
Proposition5.19.Conjugacy Class Partition.
The conjugacy classes of a group partition the group.
We will not prove this result here, as it is really a specific case of Theorem 5.26, which we examine in the next section.
Example5.20.
The conjugacy classes for \(S_4\) are
\(\{e\}\text{,}\)
all two cycles of which there are \({4 \choose 2} = 6\text{,}\)
all three cycles of which there are \(4 \cdot 2 = 8\text{,}\)
all four cycles of which there are \(3! = 6\text{,}\) and
all product of two disjoint two cycles of which there are \(3\text{.}\)
Here is a convenient way of checking the conjugacy of two permutations.
Proposition5.21.Conjugate Permutations.
Two elements of \(S_n\) are conjugate if and only if they have the same cycle type.
Proof.
If two elements of \(S_n\) are conjugate, say \(\beta = \sigma\alpha \sigma^{-1}\text{,}\) then they have the same cycle type, since we may write \(\alpha\) as a product of disjoint cycles \(\alpha = \alpha_1 \cdots \alpha_m\) and then apply Lemma 2.7. Indeed, \(\sigma\alpha \sigma^{-1} = (\sigma\alpha_1 \sigma^{-1}) \cdots (\sigma\alpha_m \sigma^{-1})\) and the Lemma 2.7 shows that the right-side is a product of disjoint cycles.
Theorem5.22.Normal Subgroups are Unions of Conjugacy Classes.
Let \(N\nsg G\text{.}\) Then \(N\) is the disjoint union of some of the conjugacy classes in \(G\text{.}\)
Proof.
Define the conjugation action of \(G\) on \(N\) by \(g\cdot n=gng^{-1}\) for all \(g\in G\) and \(n\in N\text{.}\) Since \(N\nsg G\) this is well defined. The two properties in the definition of the action hold for the action of \(G\) by Conjugation on \(N\) since they hold more generally for the action of \(G\) by conjugation on \(G\text{.}\) Therefore this is indeed an action. The orbits of elements \(n\in N\) under this action are \(C_G(n)\text{.}\) Thus the conjugacy classes of the elements of \(N\) partition \(N\text{.}\)
Summary
Groups may act on themselves by left multiplication and conjugation. 1
A Conjugacy Class of an element \(x\) is the set of all elements Conjugate to \(x\text{.}\) Normal subgroups are disjoint unions of conjugacy classes of \(G\text{.}\) 5