Skip to main content
Contents
Dark Mode Prev Up Next
\( \renewcommand{\Re}{\operatorname{Re}}
\renewcommand{\Im}{\operatorname{Im}}
\newcommand{\N}{{\mathbb N}}
\newcommand{\Z}{{\mathbb Z}}
\newcommand{\Q}{{\mathbb Q}}
\newcommand{\R}{{\mathbb R}}
\newcommand{\C}{{\mathbb C}}
\newcommand{\T}{{\mathbb T}}
\newcommand{\F}{{\mathbb F}}
\newcommand{\PP}{{\mathbb P}}
\newcommand{\HH}{{\mathbb H}}
\newcommand{\compose}{\circ}
\newcommand{\bolda}{{\mathbf a}}
\newcommand{\boldb}{{\mathbf b}}
\newcommand{\boldc}{{\mathbf c}}
\newcommand{\boldd}{{\mathbf d}}
\newcommand{\bolde}{{\mathbf e}}
\newcommand{\boldi}{{\mathbf i}}
\newcommand{\boldj}{{\mathbf j}}
\newcommand{\boldk}{{\mathbf k}}
\newcommand{\boldn}{{\mathbf n}}
\newcommand{\boldp}{{\mathbf p}}
\newcommand{\boldq}{{\mathbf q}}
\newcommand{\boldr}{{\mathbf r}}
\newcommand{\bolds}{{\mathbf s}}
\newcommand{\boldt}{{\mathbf t}}
\newcommand{\boldu}{{\mathbf u}}
\newcommand{\boldv}{{\mathbf v}}
\newcommand{\boldw}{{\mathbf w}}
\newcommand{\boldx}{{\mathbf x}}
\newcommand{\boldy}{{\mathbf y}}
\newcommand{\boldz}{{\mathbf z}}
\newcommand{\boldzero}{{\mathbf 0}}
\newcommand{\boldmod}{\boldsymbol{ \bmod }}
\newcommand{\boldT}{{\mathbf T}}
\newcommand{\boldN}{{\mathbf N}}
\newcommand{\boldB}{{\mathbf B}}
\newcommand{\boldF}{{\mathbf F}}
\newcommand{\boldS}{{\mathbf S}}
\newcommand{\boldE}{{\mathbf E}}
\newcommand{\boldG}{{\mathbf G}}
\newcommand{\boldK}{{\mathbf K}}
\newcommand{\boldL}{{\mathbf L}}
\DeclareMathOperator{\ch}{char}
\DeclareMathOperator{\lns}{lns}
\DeclareMathOperator{\lcm}{lcm}
\DeclareMathOperator{\Span}{span}
\DeclareMathOperator{\tr}{tr}
\DeclareMathOperator{\NS}{null}
\DeclareMathOperator{\RS}{row}
\DeclareMathOperator{\CS}{col}
\DeclareMathOperator{\im}{im}
\DeclareMathOperator{\range}{range}
\DeclareMathOperator{\rank}{rank}
\DeclareMathOperator{\nullity}{nullity}
\DeclareMathOperator{\sign}{sign}
\DeclareMathOperator{\Arg}{Arg}
\DeclareMathOperator{\Log}{Log}
\DeclareMathOperator{\Ext}{Ext}
\DeclareMathOperator{\Int}{Int}
\DeclareMathOperator{\Aut}{Aut}
\DeclareMathOperator{\Arcsin}{Arcsin}
\DeclareMathOperator{\Arccos}{Arccos}
\DeclareMathOperator{\Arctan}{Arctan}
\DeclareMathOperator{\Res}{Res}
\DeclareMathOperator{\res}{res}
\DeclareMathOperator{\Fix}{Fix}
\DeclareMathOperator{\Aff}{Aff}
\DeclareMathOperator{\Frac}{Frac}
\DeclareMathOperator{\Ann}{Ann}
\DeclareMathOperator{\Tor}{Tor}
\DeclareMathOperator{\id}{id}
\DeclareMathOperator{\mdeg}{mdeg}
\DeclareMathOperator{\Lt}{Lt}
\DeclareMathOperator{\Lc}{Lc}
\DeclareMathOperator{\disc}{disc}
\DeclareMathOperator{\Frob}{Frob}
\DeclareMathOperator{\adj}{adj}
\DeclareMathOperator{\ord}{ord}
\DeclareMathOperator{\curl}{curl}
\DeclareMathOperator{\grad}{grad}
\DeclareMathOperator{\diver}{div}
\DeclareMathOperator{\flux}{flux}
\DeclareMathOperator{\Hom}{Hom}
\DeclareMathOperator{\End}{End}
\DeclareMathOperator{\Isom}{Isom}
\DeclareMathOperator{\GL}{GL}
\DeclareMathOperator{\SL}{SL}
\DeclareMathOperator{\ML}{M}
\DeclareMathOperator{\Syl}{Syl}
\DeclareMathOperator{\Gal}{Gal}
\DeclareMathOperator{\ab}{ab}
\DeclareMathOperator{\sgn}{sgn}
\DeclareMathOperator{\len}{len}
\DeclareMathOperator{\proj}{proj}
\newcommand{\surjects}{\twoheadrightarrow}
\newcommand{\injects}{\hookrightarrow}
\newcommand{\bijects}{\leftrightarrow}
\newcommand{\isomto}{\overset{\sim}{\rightarrow}}
\newcommand{\floor}[1]{\lfloor#1\rfloor}
\newcommand{\ceiling}[1]{\left\lceil#1\right\rceil}
\newcommand{\mclass}[2][m]{[#2]_{#1}}
\newcommand{\val}[2][]{\left\lvert #2\right\rvert_{#1}}
\newcommand{\abs}[2][]{\left\lvert #2\right\rvert_{#1}}
\newcommand{\valuation}[2][]{\left\lvert #2\right\rvert_{#1}}
\newcommand{\norm}[1]{\left\lVert#1\right\rVert}
\newcommand{\anpoly}{a_nx^n+a_{n-1}x^{n-1}\cdots +a_1x+a_0}
\newcommand{\anmonic}{x^n+a_{n-1}x^{n-1}\cdots +a_1x+a_0}
\newcommand{\bmpoly}{b_mx^m+b_{m-1}x^{m-1}\cdots +b_1x+b_0}
\newcommand{\pder}[2]{\frac{\partial#1}{\partial#2}}
\newcommand{\normalin}{\trianglelefteq}
\newcommand{\angvec}[1]{\langle #1\rangle}
\newcommand{\varpoly}[2]{#1_{#2}x^{#2}+#1_{#2-1}x^{#2-1}\cdots +#1_1x+#1_0}
\newcommand{\varpower}[1][a]{#1_0+#1_1x+#1_1x^2+\cdots}
\newcommand{\limasto}[2][x]{\lim_{#1\rightarrow #2}}
\newcommand{\abcdmatrix}[4]{\begin{bmatrix}#1\amp #2\\ #3\amp #4 \end{bmatrix}
}
\newenvironment{amatrix}[1][ccc|c]{\left[\begin{array}{#1}}{\end{array}\right]}
\newenvironment{linsys}[2][m]{
\begin{array}[#1]{@{}*{#2}{rc}r@{}}
}{
\end{array}}
\newcommand{\eqsys}{\begin{array}{rcrcrcr}
a_{11}x_{1}\amp +\amp a_{12}x_{2}\amp +\cdots+\amp a_{1n}x_{n}\amp =\amp b_1\\
a_{21}x_{1}\amp +\amp a_{22}x_{2}\amp +\cdots+\amp a_{2n}x_{n}\amp =\amp b_2\\
\amp \vdots\amp \amp \vdots \amp \amp \vdots \amp \\
a_{m1}x_{1}\amp +\amp a_{m2}x_{2}\amp +\cdots +\amp a_{mn}x_{n}\amp =\amp b_m
\end{array}
}
\newcommand{\numeqsys}{\begin{array}{rrcrcrcr}
e_1:\amp a_{11}x_{1}\amp +\amp a_{12}x_{2}\amp +\cdots+\amp a_{1n}x_{n}\amp =\amp b_1\\
e_2: \amp a_{21}x_{1}\amp +\amp a_{22}x_{2}\amp +\cdots+\amp a_{2n}x_{n}\amp =\amp b_2\\
\amp \vdots\amp \amp \vdots \amp \amp \vdots \amp \\
e_m: \amp a_{m1}x_{1}\amp +\amp a_{m2}x_{2}\amp +\cdots +\amp a_{mn}x_{n}\amp =\amp b_m
\end{array}
}
\newcommand{\homsys}{\begin{array}{rcrcrcr}
a_{11}x_{1}\amp +\amp a_{12}x_{2}\amp +\cdots+\amp a_{1n}x_{n}\amp =\amp 0\\
a_{21}x_{1}\amp +\amp a_{22}x_{2}\amp +\cdots+\amp a_{2n}x_{n}\amp =\amp 0\\
\amp \vdots\amp \amp \vdots \amp \amp \vdots \amp \\
a_{m1}x_{1}\amp +\amp a_{m2}x_{2}\amp +\cdots +\amp a_{mn}x_{n}\amp =\amp 0
\end{array}
}
\newcommand{\vareqsys}[4]{
\begin{array}{ccccccc}
#3_{11}x_{1}\amp +\amp #3_{12}x_{2}\amp +\cdots+\amp #3_{1#2}x_{#2}\amp =\amp #4_1\\
#3_{21}x_{1}\amp +\amp #3_{22}x_{2}\amp +\cdots+\amp #3_{2#2}x_{#2}\amp =\amp #4_2\\
\vdots \amp \amp \vdots \amp \amp \vdots \amp =\amp \\
#3_{#1 1}x_{1}\amp +\amp #3_{#1 2}x_{2}\amp +\cdots +\amp #3_{#1 #2}x_{#2}\amp =\amp #4_{#1}
\end{array}
}
\newcommand{\genmatrix}[1][a]{
\begin{bmatrix}
#1_{11} \amp #1_{12} \amp \cdots \amp #1_{1n} \\
#1_{21} \amp #1_{22} \amp \cdots \amp #1_{2n} \\
\vdots \amp \vdots \amp \ddots \amp \vdots \\
#1_{m1} \amp #1_{m2} \amp \cdots \amp #1_{mn}
\end{bmatrix}
}
\newcommand{\varmatrix}[3]{
\begin{bmatrix}
#3_{11} \amp #3_{12} \amp \cdots \amp #3_{1#2} \\
#3_{21} \amp #3_{22} \amp \cdots \amp #3_{2#2} \\
\vdots \amp \vdots \amp \ddots \amp \vdots \\
#3_{#1 1} \amp #3_{#1 2} \amp \cdots \amp #3_{#1 #2}
\end{bmatrix}
}
\newcommand{\augmatrix}{
\begin{amatrix}[cccc|c]
a_{11} \amp a_{12} \amp \cdots \amp a_{1n} \amp b_{1}\\
a_{21} \amp a_{22} \amp \cdots \amp a_{2n} \amp b_{2}\\
\vdots \amp \vdots \amp \ddots \amp \vdots \amp \vdots\\
a_{m1} \amp a_{m2} \amp \cdots \amp a_{mn}\amp b_{m}
\end{amatrix}
}
\newcommand{\varaugmatrix}[4]{
\begin{amatrix}[cccc|c]
#3_{11} \amp #3_{12} \amp \cdots \amp #3_{1#2} \amp #4_{1}\\
#3_{21} \amp #3_{22} \amp \cdots \amp #3_{2#2} \amp #4_{2}\\
\vdots \amp \vdots \amp \ddots \amp \vdots \amp \vdots\\
#3_{#1 1} \amp #3_{#1 2} \amp \cdots \amp #3_{#1 #2}\amp #4_{#1}
\end{amatrix}
}
\newcommand{\spaceforemptycolumn}{\makebox[\wd\boxofmathplus]{\ }}
\newcommand{\generalmatrix}[3]{
\left(
\begin{array}{cccc}
#1_{1,1} \amp #1_{1,2} \amp \ldots \amp #1_{1,#2} \\
#1_{2,1} \amp #1_{2,2} \amp \ldots \amp #1_{2,#2} \\
\amp \vdots \\
#1_{#3,1} \amp #1_{#3,2} \amp \ldots \amp #1_{#3,#2}
\end{array}
\right) }
\newcommand{\colvec}[2][c]{\begin{amatrix}[#1] #2 \end{amatrix}}
\newcommand{\rowvec}[1]{\begin{bmatrix} #1 \end{bmatrix}}
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 1.17 Group actions: stabilizer
Definition 1.17.1 . G-sets.
Let
\(G\) be a group. A
G-set is a nonempty set
\(A\) together with a group action
\(G\times A\rightarrow A\text{.}\)
Given \(G\) -sets \(A\) and \(B\text{,}\) a \(G\) -set morphism is a function \(f\colon A\rightarrow B\) satisfying
\begin{equation}
f(g\cdot a)=g\cdot f(a)\tag{1.17.1}
\end{equation}
for all \(g\in G\) and \(a\in A\text{.}\) A \(G\) -set isomorphism is a bijective \(G\) -set morphism.
Definition 1.17.2 . Stabilizers and kernels of actions.
Let \(G\) be a group, and let \(A\) be a \(G\) -set. Given a \(G\) -set \(A\) and nonempty subset \(X\subseteq A\text{,}\) the stabilizer of \(X\) is the set \(G_X\) of all elements of \(G\) that fix every element of \(X\text{:}\) i.e.,
\begin{equation}
G_X=\{g\in G\mid g\cdot x=x \text{ for all } x\in X\}\text{.}\tag{1.17.2}
\end{equation}
In the case of a singleton \(\{a\}\text{,}\) we write \(G_a\) instead of \(G_{\{a\}}\text{.}\)
The kernel of a a group action \(G\times A\rightarrow A\) is
\begin{equation*}
G_A=\{g\in G\mid g\cdot a=a \text{ for all } a\in A\}\text{.}
\end{equation*}
Theorem 1.17.3 . Stabilizers.
Let \(G\) be a group, and let \(A\) be a \(G\) -set.
Given any nonempty subset
\(X\subseteq A\text{,}\) the stabilizer
\(G_X\) is a subgroup of
\(G\text{.}\)
For all \(a\in A\) and \(g\in G\text{,}\) letting \(a'=g\cdot a\text{,}\) we have
\begin{equation*}
G_{a'}=gG_ag^{-1}
\end{equation*}
The kernel of the action \(G_A\) is a normal subgroup of \(G\text{.}\) In fact, letting \(\phi\colon G\rightarrow S_A\) be the homomorphism associated to the group action \(G\times A\rightarrow A\text{,}\) we have
\begin{equation}
G_A=\ker\phi\text{.}\tag{1.17.3}
\end{equation}
Proof.
Let \(a'=g\cdot a\text{.}\) We have
\begin{align*}
g'\in G_{a'} \amp \iff g'\cdot (g\cdot a)=g\cdot a \\
\amp \iff (g^{-1}g'g)\cdot a=a\\
\amp \iff g^{-1}g'g\in G_a\\
\amp \iff g'\in gG_ag^{-1}\text{.}
\end{align*}
This proves \(G_{a'}=gG_ag^{-1}\text{.}\)
The fact that
\(G_A=\ker\phi\) follows essentially from the definition of
\(G_A\) and
\(\phi\text{:}\) \(g\in G_A\) if and only if
\(g\cdot a=a\) for all
\(a\in A\text{,}\) if and only if its associated permutation
\(\phi_g\in S_A\text{,}\) defined as
\(\phi_g(a)=g\cdot a\) for all
\(a\in A\text{,}\) is the identity map.
Definition 1.17.4 . Permutation representation and faithfulness.
Given a group action \(G\times A\rightarrow A\text{,}\) the corresponding homomorphism
\begin{align*}
\phi\colon G \amp \rightarrow S_A\\
g \amp \mapsto \phi_g\text{,}
\end{align*}
where \(\phi_g(a)=g\cdot a\) for all \(a\in A\text{,}\) is called the permutation representation associated to the group action. The homomorphism
\begin{equation*}
\phi\colon G\rightarrow S_G
\end{equation*}
associated to the the action of \(G\) on itself by left multiplication is called the regular permutation representation .
A group action
\(G\times A\rightarrow A\) is
faithful if
\(G_A=\{e\}\text{:}\) equivalently, if its associated permutation representation is injective.
Corollary 1.17.5 . Action on coset space.
Let \(H\) be a subgroup of the group \(G\text{,}\) and consider the group action of \(G\) on \(G/H\) given by left multiplication
\begin{equation*}
g\cdot g'H=(gg')H\text{.}
\end{equation*}
This action is transitive.
Let \(A=G/H\text{.}\) We have
\begin{equation}
G_A=\bigcap_{g\in G}gHg^{-1}\text{.}\tag{1.17.4}
\end{equation}
As a result, \(G_A\) is the largest normal subgroup contained in \(H\text{.}\)
Proof.
Given any elements \(gH, g'H\in G/H\text{,}\) we have
\begin{equation*}
g'H=(g'g^{-1})\cdot gH\text{.}
\end{equation*}
We have
\begin{align*}
G_A \amp =\bigcap_{g\in G}G_{gH}\\
\amp = \bigcap_{g\in G}gG_Hg^{-1}\\
\amp = \bigcap_{g\in G}gHg^{-1}\text{,}
\end{align*}
where the last line follows from the fact that \(g'\cdot H=H\) if and only if \(g'\in H\text{.}\)
Lastly, if \(N\) is a normal subgroup of \(H\text{,}\) then by definition we must have \(N=gNg^{-1}\leq gHg^{-1}\) for all \(g\in G\text{.}\) It follows that
\begin{equation*}
N\leq \bigcap_{g\in G}gHg^{-1}=G_A\text{.}
\end{equation*}
Theorem 1.17.6 . Cayleyβs theorem.
Every group
\(G\) is isomorphic to a subgroup of
\(S_G\text{.}\) If
\(\abs{G}=n< \infty\text{,}\) then
\(G\) is isomorphic to a subgroup of
\(S_n\text{.}\)
Proof.
Consider the action of \(G\) on itself by left multiplication, and corresponding regular permutation representation
\begin{equation*}
\phi\colon G\rightarrow S_G\text{.}
\end{equation*}
Since this action is faithful, \(\ker\phi=\{e\}\) and \(\phi\) is injective. We conclude that \(\phi\) is an isomorphism between \(G\) and the subgroup \(\phi(G)\leq S_G\text{.}\)
In the case where
\(\abs{G}=n< \infty\text{,}\) composing
\(\phi\) with an isomorphism
\(\alpha\colon S_G\rightarrow S_n\) yields an isomorphism between
\(G\) and a subgroup of
\(S_n\text{.}\)
Theorem 1.17.7 . Subgroups of prime index.
Let
\(G\) be a finite group and let
\(p\) be the smallest prime divisor of
\(\abs{G}\text{.}\) If
\(H\) is a subgroup of
\(G\) of index
\(p\text{,}\) then
\(H\) is normal.
Proof.
Consider the left multiplication action of \(G\) on the coset space \(A=G/H\) and the corresponding permutation representation
\begin{equation*}
\phi\colon G\rightarrow S_A\text{.}
\end{equation*}
By the first isomorphism theorem, we have
\begin{equation*}
G/\ker\phi\cong \phi(G)\text{,}
\end{equation*}
where \(\phi(G)\) is a subgroup of \(S_A\text{.}\) Note that since \(A=G/H\text{,}\) we have \(\abs{A}=[G\colon H]=p\text{,}\) and thus \(\abs{S_A}=p!\text{.}\)
We claim
\(\ker\phi=H\text{,}\) whence the result follows. From
TheoremΒ 1.17.3 we know that
\(\ker\phi\leq H\text{.}\) It follows that
\begin{equation*}
\abs{\phi(G)}=[G\colon \ker\phi]=[G\colon H][H\colon \ker \phi=pq\text{.}
\end{equation*}
Next, since \(pq=\abs{\phi(G)}\mid p!\text{,}\) \(q\mid (p-1)!\text{.}\) Since furthermore \(q\mid \abs{G}\text{,}\) we see that \(q\) is a common divisor of \((p-1)!\) and \(\abs{G}\text{.}\) But since all prime divisors of \((p-1)!\) are less than \(p\text{,}\) we see that \((p-1)!\) and \(\abs{G}\) are relatively prime! Thus \(q=1\) and \(K=\im\phi\text{,}\) as claimed.