Abstract Algebra
posted: 01-Aug-2025 & updated: 03-Aug-2025
\[% \newcommand{\algA}{\algk{A}} \newcommand{\algC}{\algk{C}} \newcommand{\bigtimes}{\times} \newcommand{\compl}[1]{\tilde{#1}} \newcommand{\complexes}{\mathbb{C}} \newcommand{\dom}{\mathop{\bf dom {}}} \newcommand{\ereals}{\reals\cup\{-\infty,\infty\}} \newcommand{\field}{\mathbb{F}} \newcommand{\integers}{\mathbb{Z}} \newcommand{\lbdseqk}[1]{\seqk{\lambda}{#1}} \newcommand{\meas}[3]{({#1}, {#2}, {#3})} \newcommand{\measu}[2]{({#1}, {#2})} \newcommand{\meast}[3]{\left({#1}, {#2}, {#3}\right)} \newcommand{\naturals}{\mathbb{N}} \newcommand{\nuseqk}[1]{\seqk{\nu}{#1}} \newcommand{\pair}[2]{\langle {#1}, {#2}\rangle} \newcommand{\rationals}{\mathbb{Q}} \newcommand{\reals}{\mathbb{R}} \newcommand{\seq}[1]{\left\langle{#1}\right\rangle} \newcommand{\powerset}{\mathcal{P}} \newcommand{\pprealk}[1]{\reals_{++}^{#1}} \newcommand{\ppreals}{\mathbb{R}_{++}} \newcommand{\prealk}[1]{\reals_{+}^{#1}} \newcommand{\preals}{\mathbb{R}_+} \newcommand{\tXJ}{\topos{X}{J}} % \newcommand{\relint}{\mathop{\bf relint {}}} \newcommand{\boundary}{\mathop{\bf bd {}}} \newcommand{\subsetset}[1]{\mathcal{#1}} \newcommand{\Tr}{\mathcal{\bf Tr}} \newcommand{\symset}[1]{\mathbf{S}^{#1}} \newcommand{\possemidefset}[1]{\mathbf{S}_+^{#1}} \newcommand{\posdefset}[1]{\mathbf{S}_{++}^{#1}} \newcommand{\ones}{\mathbf{1}} \newcommand{\Prob}{\mathop{\bf Prob {}}} \newcommand{\prob}[1]{\Prob\left\{#1\right\}} \newcommand{\Expect}{\mathop{\bf E {}}} \newcommand{\Var}{\mathop{\bf Var{}}} \newcommand{\Mod}[1]{\;(\text{mod}\;#1)} \newcommand{\ball}[2]{B(#1,#2)} \newcommand{\generates}[1]{\langle {#1} \rangle} \newcommand{\isomorph}{\approx} \newcommand{\isomorph}{\approx} \newcommand{\nullspace}{\mathcalfont{N}} \newcommand{\range}{\mathcalfont{R}} \newcommand{\diag}{\mathop{\bf diag {}}} \newcommand{\rank}{\mathop{\bf rank {}}} \newcommand{\Ker}{\mathop{\mathrm{Ker} {}}} \newcommand{\Map}{\mathop{\mathrm{Map} {}}} \newcommand{\End}{\mathop{\mathrm{End} {}}} \newcommand{\Img}{\mathop{\mathrm{Im} {}}} \newcommand{\Aut}{\mathop{\mathrm{Aut} {}}} \newcommand{\Gal}{\mathop{\mathrm{Gal} {}}} \newcommand{\Irr}{\mathop{\mathrm{Irr} {}}} \newcommand{\arginf}{\mathop{\mathrm{arginf}}} \newcommand{\argsup}{\mathop{\mathrm{argsup}}} \newcommand{\argmin}{\mathop{\mathrm{argmin}}} \newcommand{\ev}{\mathop{\mathrm{ev} {}}} \newcommand{\affinehull}{\mathop{\bf aff {}}} \newcommand{\cvxhull}{\mathop{\bf Conv {}}} \newcommand{\epi}{\mathop{\bf epi {}}} \newcommand{\injhomeo}{\hookrightarrow} \newcommand{\perm}[1]{\text{Perm}(#1)} \newcommand{\aut}[1]{\text{Aut}(#1)} \newcommand{\ideal}[1]{\mathfrak{#1}} \newcommand{\bigset}[2]{\left\{#1\left|{#2}\right.\right\}} \newcommand{\bigsetl}[2]{\left\{\left.{#1}\right|{#2}\right\}} \newcommand{\primefield}[1]{\field_{#1}} \newcommand{\dimext}[2]{[#1:{#2}]} \newcommand{\restrict}[2]{#1|{#2}} \newcommand{\algclosure}[1]{#1^\mathrm{a}} \newcommand{\finitefield}[2]{\field_{#1^{#2}}} \newcommand{\frobmap}[2]{\varphi_{#1,{#2}}} % %\newcommand{\algfontmode}{} % %\ifdefined\algfontmode %\newcommand\mathalgfont[1]{\mathcal{#1}} %\newcommand\mathcalfont[1]{\mathscr{#1}} %\else \newcommand\mathalgfont[1]{\mathscr{#1}} \newcommand\mathcalfont[1]{\mathcal{#1}} %\fi % %\def\DeltaSirDir{yes} %\newcommand\sdirletter[2]{\ifthenelse{\equal{\DeltaSirDir}{yes}}{\ensuremath{\Delta #1}}{\ensuremath{#2}}} \newcommand{\sdirletter}[2]{\Delta #1} \newcommand{\sdirlbd}{\sdirletter{\lambda}{\Delta \lambda}} \newcommand{\sdir}{\sdirletter{x}{v}} \newcommand{\seqk}[2]{#1^{(#2)}} \newcommand{\seqscr}[3]{\seq{#1}_{#2}^{#3}} \newcommand{\xseqk}[1]{\seqk{x}{#1}} \newcommand{\sdirk}[1]{\seqk{\sdir}{#1}} \newcommand{\sdiry}{\sdirletter{y}{\Delta y}} \newcommand{\slen}{t} \newcommand{\slenk}[1]{\seqk{\slen}{#1}} \newcommand{\ntsdir}{\sdir_\mathrm{nt}} \newcommand{\pdsdir}{\sdir_\mathrm{pd}} \newcommand{\sdirnu}{\sdirletter{\nu}{w}} \newcommand{\pdsdirnu}{\sdirnu_\mathrm{pd}} \newcommand{\pdsdiry}{\sdiry_\mathrm{pd}} \newcommand\pdsdirlbd{\sdirlbd_\mathrm{pd}} % \newcommand{\normal}{\mathcalfont{N}} % \newcommand{\algk}[1]{\mathalgfont{#1}} \newcommand{\collk}[1]{\mathcalfont{#1}} \newcommand{\classk}[1]{\collk{#1}} \newcommand{\indexedcol}[1]{\{#1\}} \newcommand{\rel}{\mathbf{R}} \newcommand{\relxy}[2]{#1\;\rel\;{#2}} \newcommand{\innerp}[2]{\langle{#1},{#2}\rangle} \newcommand{\innerpt}[2]{\left\langle{#1},{#2}\right\rangle} \newcommand{\closure}[1]{\overline{#1}} \newcommand{\support}{\mathbf{support}} \newcommand{\set}[2]{\{#1|#2\}} \newcommand{\metrics}[2]{\langle {#1}, {#2}\rangle} \newcommand{\interior}[1]{#1^\circ} \newcommand{\topol}[1]{\mathfrak{#1}} \newcommand{\topos}[2]{\langle {#1}, \topol{#2}\rangle} % topological space % \newcommand{\alg}{\algk{A}} \newcommand{\algB}{\algk{B}} \newcommand{\algF}{\algk{F}} \newcommand{\algR}{\algk{R}} \newcommand{\algX}{\algk{X}} \newcommand{\algY}{\algk{Y}} % \newcommand\coll{\collk{C}} \newcommand\collB{\collk{B}} \newcommand\collF{\collk{F}} \newcommand\collG{\collk{G}} \newcommand{\tJ}{\topol{J}} \newcommand{\tS}{\topol{S}} \newcommand\openconv{\collk{U}} % \newenvironment{my-matrix}[1]{\begin{bmatrix}}{\end{bmatrix}} \newcommand{\colvectwo}[2]{\begin{my-matrix}{c}{#1}\\{#2}\end{my-matrix}} \newcommand{\colvecthree}[3]{\begin{my-matrix}{c}{#1}\\{#2}\\{#3}\end{my-matrix}} \newcommand{\rowvecthree}[3]{\begin{bmatrix}{#1}&{#2}&{#3}\end{bmatrix}} \newcommand{\mattwotwo}[4]{\begin{bmatrix}{#1}&{#2}\\{#3}&{#4}\end{bmatrix}} % \newcommand\optfdk[2]{#1^\mathrm{#2}} \newcommand\tildeoptfdk[2]{\tilde{#1}^\mathrm{#2}} \newcommand\fobj{\optfdk{f}{obj}} \newcommand\fie{\optfdk{f}{ie}} \newcommand\feq{\optfdk{f}{eq}} \newcommand\tildefobj{\tildeoptfdk{f}{obj}} \newcommand\tildefie{\tildeoptfdk{f}{ie}} \newcommand\tildefeq{\tildeoptfdk{f}{eq}} \newcommand\xdomain{\mathcalfont{X}} \newcommand\xobj{\optfdk{\xdomain}{obj}} \newcommand\xie{\optfdk{\xdomain}{ie}} \newcommand\xeq{\optfdk{\xdomain}{eq}} \newcommand\optdomain{\mathcalfont{D}} \newcommand\optfeasset{\mathcalfont{F}} % \newcommand{\bigpropercone}{\mathcalfont{K}} % \newcommand{\prescript}[3]{\;^{#1}{#3}} % %\]Introduction
Preamble
Notations
-
sets of numbers
- $\naturals$ - set of natural numbers
- $\integers$ - set of integers
- $\integers_+$ - set of nonnegative integers
- $\rationals$ - set of rational numbers
- $\reals$ - set of real numbers
- $\preals$ - set of nonnegative real numbers
- $\ppreals$ - set of positive real numbers
- $\complexes$ - set of complex numbers
-
sequences $\seq{x_i}$ and the like
- finite $\seq{x_i}_{i=1}^n$, infinite $\seq{x_i}_{i=1}^\infty$ - use $\seq{x_i}$ whenever unambiguously understood
- similarly for other operations, e.g., $\sum x_i$, $\prod x_i$, $\cup A_i$, $\cap A_i$, $\bigtimes A_i$
- similarly for integrals, e.g., $\int f$ for $\int_{-\infty}^\infty f$
-
sets
- $\compl{A}$ - complement of $A$
- $A\sim B$ - $A\cap \compl{B}$
- $A\Delta B$ - $(A\cap \compl{B}) \cup (\compl{A} \cap B)$
- $\powerset(A)$ - set of all subsets of $A$
-
sets in metric vector spaces
- $\closure{A}$ - closure of set $A$
- $\interior{A}$ - interior of set $A$
- $\relint A$ - relative interior of set $A$
- $\boundary A$ - boundary of set $A$
-
set algebra
- $\sigma(\subsetset{A})$ - $\sigma$-algebra generated by $\subsetset{A}$, i.e., smallest $\sigma$-algebra containing $\subsetset{A}$
-
norms in $\reals^n$
- $\|x\|_p$ ($p\geq1$) - $p$-norm of $x\in\reals^n$, i.e., $(|x_1|^p + \cdots + |x_n|^p)^{1/p}$
- e.g., $\|x\|_2$ - Euclidean norm
-
matrices and vectors
- $a_{i}$ - $i$-th entry of vector $a$
- $A_{ij}$ - entry of matrix $A$ at position $(i,j)$, i.e., entry in $i$-th row and $j$-th column
- $\Tr(A)$ - trace of $A \in\reals^{n\times n}$, i.e., $A_{1,1}+ \cdots + A_{n,n}$
-
symmetric, positive definite, and positive semi-definite matrices
- $\symset{n}\subset \reals^{n\times n}$ - set of symmetric matrices
- $\possemidefset{n}\subset \symset{n}$ - set of positive semi-definite matrices; $A\succeq0 \Leftrightarrow A \in \possemidefset{n}$
- $\posdefset{n}\subset \symset{n}$ - set of positive definite matrices; $A\succ0 \Leftrightarrow A \in \posdefset{n}$
-
sometimes,
use Python script-like notations
(with serious abuse of mathematical notations)
-
use $f:\reals\to\reals$ as if it were $f:\reals^n \to \reals^n$,
e.g.,
$$
\exp(x) = (\exp(x_1), \ldots, \exp(x_n)) \quad \mbox{for } x\in\reals^n
$$
and
$$
\log(x) = (\log(x_1), \ldots, \log(x_n)) \quad \mbox{for } x\in\ppreals^n
$$
which corresponds to Python code
numpy.exp(x)
ornumpy.log(x)
wherex
is instance ofnumpy.ndarray
, i.e.,numpy
array -
use $\sum x$ to mean $\ones^T x$ for $x\in\reals^n$,
i.e.
$$
\sum x = x_1 + \cdots + x_n
$$
which corresponds to Python code
x.sum()
wherex
isnumpy
array -
use $x/y$ for $x,y\in\reals^n$ to mean
$$
\rowvecthree{x_1/y_1}{\cdots}{x_n/y_n}^T
$$
which corresponds to Python code
x / y
wherex
andy
are $1$-dnumpy
arrays -
use $X/Y$ for $X,Y\in\reals^{m\times n}$ to mean
$$
\begin{my-matrix}{cccc}
X_{1,1}/Y_{1,1} & X_{1,2}/Y_{1,2} & \cdots & X_{1,n}/Y_{1,n}
\\
X_{2,1}/Y_{2,1} & X_{2,2}/Y_{2,2} & \cdots & X_{2,n}/Y_{2,n}
\\
\vdots & \vdots & \ddots & \vdots
\\
X_{m,1}/Y_{m,1} & X_{m,2}/Y_{m,2} & \cdots & X_{m,n}/Y_{m,n}
\end{my-matrix}
$$
which corresponds to Python code
X / Y
whereX
andY
are $2$-dnumpy
arrays
-
use $f:\reals\to\reals$ as if it were $f:\reals^n \to \reals^n$,
e.g.,
$$
\exp(x) = (\exp(x_1), \ldots, \exp(x_n)) \quad \mbox{for } x\in\reals^n
$$
and
$$
\log(x) = (\log(x_1), \ldots, \log(x_n)) \quad \mbox{for } x\in\ppreals^n
$$
which corresponds to Python code
Some definitions
Some conventions
-
(for some subjects) use following conventions
- $0\cdot \infty = \infty \cdot 0 = 0$
- $(\forall x\in\ppreals)(x\cdot \infty = \infty \cdot x = \infty)$
- $\infty \cdot \infty = \infty$
Abstract Algebra
Why Abstract Algebra?
Why abstract algebra?
- it's fun!
- can understand instrict structures of algebraic objects
-
allow us to solve extremely practical problems
(depending on your definition of practicality)
- e.g., can prove why root formulas for polynomials of order $n\geq 5$ do not exist
-
prepare us for pursuing further math topics such as
- differential geometry
- algebraic geometry
- analysis
- representation theory
- algebraic number theory
Some history
- by the way, historically, often the case that application of an idea presented before extracting and presenting the idea on its own right
- e.g., Galois used “quotient group'' only implicitly in his 1830's investigation, and it had to wait until 1889 to be explicitly presented as “abstract quotient group'' by Hölder
Groups
Monoids
- when $(\forall x, y, z \in S)((xy)z = x(yz))$, composition is said to be associative
- $e\in S$ such that $(\forall x\in S)(ex = xe = x)$, called unit element - always unique for any two unit elements $e$ and $f$, $e = ef = f,$ hence, $e=f$
- monoid $M$ with $\left( \forall x, y \in M \right) \left( xy = yx \right)$, called commutative or abelian monoid
- subset $H\subset M$ which has the unit element $e$ and is itself monoid, called submonoid
Groups
- for $x\in G$, $y\in G$ with $xy=yx=e$, called inverse of $x$
- group derived from commutative monoid, called abelian group or commutative group
- group $G$ with $|G|<\infty$, called finite group
- (similarly as submonoid) $H\subset G$ that has unit element and is itself group, called subgroup
- subgroup consisting only of unit element, called trivial
Cyclic groups, generators, and direct products
Homeomorphism and isomorphism
- group homeomorphism $f:G\to G'$ is similarly monoid-homeomorphism
- homeomorphism $f:G\to G'$ where exists $g:G\to G'$ such that $f\circ g:G'\to G'$ and $g\circ f:G\to G$ are identity mappings, called isomorphism, sometimes denoted by $G\isomorph G'$
- homeomorphism of $G$ into itself, called endomorphism
- isomorphism of $G$ onto itself, called automorphism
- set of all automorphisms of $G$ is itself group, denoted by \aut{G}
Kernel, image, and embedding of homeomorphism
- for group-homeomorphism $f:G\to G'$, $f(G)\subset G'$ is subgroup of $G'$
- homeomorphism whose kernel is trivial is injective, often denoted by special arrow $$ f:G \injhomeo G' $$
- surjective homeomorphism whose kernel is trivial is isomorphism
- for group $G$, its generators $S$, and another group $G'$, map $f:S\to G'$ has at most one extension to homeomorphism of $G$ into $G'$
Orthogonal subgroups
Cosets of groups
- for $a\in G$, $x\mapsto ax$ induces bijection of $H$ onto $aH$, hence all left cosets have same cardinality
- $aH \cap bH \neq \emptyset$ for $a,b\in G$ implies $aH=bH$
- hence, $G$ is disjoint union of left cosets of $H$
- same statements can be made for right cosets
Indices and orders of groups
hence, if $(G:1)<\infty$, both $(G:H)$ and $(H:1)$ divide $(G:1)$
Normal subgroup
- set of cosets $\set{xH}{x\in G}$ with law of composition defined by $(xH)(yH) = (xy)H,$ forms group with unit element $H$, denoted by $G/H$, called factor group of $G$ by $H$, read $G$ modulo $H$ or $G$ mod $H$
- $x \mapsto xH$ induces homeomorphism of $X$ onto $\set{xH}{x\in G}$, called canonical map , kernel of which is $H$
- kernel of (every) homeomorphism of $G$ is normal subgroups of $G$
- for family of normal subgroups of $G$, $\seq{N_\lambda}$, $\bigcap N_\lambda$ is also normal subgroup
- every subgroup of abelian group is normal
- factor group of abelian group is abelian
- factor group of cyclic group is cyclic
Normalizers and centralizers
- e.g., $A \mapsto \det A$ of multiplicative group of square matrices in $\reals^{n\times n}$ into $\reals\sim\{0\}$ is homeomorphism, kernel of which called special linear group, and (of course) is normal
Normalizers and congruence
- subgroup $H\subset G$ of group $G$ is normal subgroup of its normalizer $N_H$
- subgroup $K\subset G$ with $H\subset K$ where $H$ is normal in $K$ is contained in $N_H$
- for subgroup $K\subset N_H$, $KH$ is group and $H$ is normal in $KH$
- normalizer of $H$ is largest subgroup of $G$ in which $H$ is normal
Exact sequences of homeomorphisms
- for normal subgroup $H\subset G$ of group $G$, sequence $H \overset{j}{\to} G \overset{\varphi}{\to} G/H$ is exact where $j$ is inclusion and $\varphi$
- $0 \overset{}{\to} G' \overset{f}{\to} G \overset{g}{\to} G'' \overset{}{\to} 0$ is exact if and only if $f$ injective, $g$ surjective, and $\Img f = \Ker g$
- if $H=\Ker g$ above, $0 \overset{}{\to} H \overset{}{\to} G \overset{}{\to} G/H \overset{}{\to} 0$
- more precisely, exists commutative diagram as in the figure, in which vertical mappings are isomorphisms and rows are exact
Canonical homeomorphism examples
all homeomorphisms described below called canonical
-
for two groups $G$ & $G'$ and homeomorphism $f:G\to G'$ whose kernel is $H$,
exists unique homeomorphism $f_*: G/H \to G'$ with
$$
f=f_*\circ \varphi
$$
where $\varphi:G\to G/H$ is canonical map,
and $f_*$ is injective
- $f_*$ can be defined by $xH\mapsto f(x)$
- $f_*$ said to be induced by $f$
- $f_*$ induces isomorphism $\lambda: G/H \to \Img f$
- below sequence summarizes above statements $$ G \overset{\varphi}{\to} G/H \overset{\lambda}{\to} \Img f \overset{j}{\to} G $$ where $j$ is inclusion
-
for group $G$,
subgroup $H\subset G$,
and
homeomorphism $f:G\to G'$ whose kernel contains $H$,
intersection of all normal subgroups containing $H$, $N$,
which is the smallest normal subgroup containing $H$,
is contained in $\Ker f$,
i.e.,
$N\subset \Ker f$,
and exists unique homeomorphism, $f_*:G/N\to G'$
such that
$$
f = f_* \circ \varphi
$$
where $\varphi:G\to G/H$ is canonical map
- $f_*$ can be defined by $xN\mapsto f(x)$
- $f_*$ said to be induced by $f$
- for subgroups of $G$, $H$ and $K$ with $K\subset H$, $xK \mapsto xH$ induces homeomorphism of $G/K$ into $G/H$, whose kernel is $\set{xK}{x\in H}$, thus canonical isomorphism $$ (G/K)/(H/K) \isomorph (G/K) $$ this can be shown in the figure where rows are exact
- for subgroup $H\subset G$ and $K\subset G$ with $H$ contained in normalizer of $K$, $H\cap K$ is normal subgroup of $H$, $HK=KH$ is subgroup of $G$, exists surjective homeomorphism $$ H \to HK / K $$ with $x \mapsto xK$, whose kernel is $H\cap K$, hence canonical isomorphism $$ H/(H\cap K) \isomorph HK/K $$
- for group homeomorphism $f:G\to G'$, normal subgroup of $G'$, $H'$, $$ H=f^{-1}(H')\subset G $$ as shown in the figure, $H$ is normal in $G$ and kernel of homeomorphism $$ G \overset{f}{\to} G'\overset{\varphi}{\to} G'/H' $$ is $H$ where $\varphi$ is canonical map, hence we have injective homeomorphism $$ \bar{f}:G/H \to G'/H' $$ again called canonical homeomorphism, giving commutative diagram in the figure; if $f$ is surjective, $\bar{f}$ is isomorphism
Towers
- said to be normal if every $G_{i+1}$ is normal in $G_i$
- said to be abelian if normal and every factor group $G_i/G_{i+1}$ is abelian
- said to be cyclic if normal and every factor group $G_i/G_{i+1}$ is cyclic
- normal if $G'_i$ form normal tower
- abelian if $G'_i$ form abelian tower
- cyclic if $G'_i$ form cyclic tower
Refinement of towers and solvability of groups
- abelian tower of finite group admits cyclic refinement
- finite solvable group admits cyclic tower, whose last element is trivial subgroup
Commutators and commutator subgroups
- $G^C$ is normal in $G$
- $G/G^C$ is commutative
- $G^C$ is contained in kernel of every homeomorphism of $G$ into commutative group
- of above statements
- commutator group is at the heart of solvability and non-solvability problems!
Simple groups
Butterfly lemma
- indeed $$ (U\cap V)/((u\cap V)(U\cap v)) \isomorph\ u(U\cap V) / u(U\cap v) \isomorph\ (U\cap V)v / (u\cap V)v $$
Equivalent towers
Schreier and Jordan-Hölder theorems
Cyclic groups
Properties of cyclic groups
- infinity cyclic group has exactly two generators; if $a$ is one, $a^{-1}$ is the other
- for cyclic group $G$ of order $n$ and generator $x$, set of generators of $G$ is $$ \set{x^m}{m \mbox{ is relatively prime to }n} $$
- for cyclic group $G$ and two generators $a$ and $b$, exists automorphism of $G$ mapping $a$ onto $b$; conversely, every automorphism maps $a$ to some generator
- for cyclic group $G$ of order $n$ and $d\in\naturals$ dividing $n$, exists unique subgroup of order $d$
- for cyclic groups $G_1$ and $G_2$ of orders $n$ and $m$ respectively with $n$ and $m$ relatively prime, $G_1\times G_2$ is cyclic group
- for non-cyclic finite abelian group $G$, exists subgroup isomorphic to $C\times C$ with $C$ cyclic with prime order
Symmetric groups and permutations
Operations of group on set
- $S$, called $G$-set
- denote $\pi(x)$ for $x\in G$ by $\pi_x$, hence homeomorphism denoted by $x\mapsto \pi_x$
- obtain mapping from such operation, $G\times S \to S$, with $(x,s)\mapsto \pi_x(s)$
-
often abbreviate $\pi_x(s)$ by $xs$, with which the following two properties satisfied
- $\left( \forall x,y\in G, s\in S \right) \left( x(ys) = (xy)s \right)$
- $\left( \forall s\in S \right) \left( es = s \right)$
- conversely, for mapping $G\times S\to S$ with $(x,s)\mapsto xs$ satisfying above two properties, $s\mapsto xs$ is permutation for $x\in G$, hence $\pi_x$ is homeomorphism of $G$ into $\perm{S}$
- thus, operation of $G$ on $S$ can be defined as mapping $S\times G\to S$ satisfying above two properties
Conjugation
- $\gamma_x$, called inner
- kernel of conjugation is center of $G$
- to avoid confusion, instead of writing $xy$ for $\gamma_x(y)$, write $$ \gamma_x(y) = xyx^{-1} = \prescript{x}{}{y} \mbox{ and } \gamma_{x^{-1}}(y) = x^{-1}yx = {y}^x $$
- for subset $A\subset G$, map $(x,A) \mapsto xAx^{-1}$ is operation of $G$ on set of subsets of $G$
- similarly for subgroups of $G$
- two subsets of $G$, $A$ and $B$ with $B= x A x^{-1}$ for some $x\in G$, said to be conjugate
Translation
-
for subgroup $H\subset G$,
$T_x(H) = xH$ is left coset
- denote set of left cosets also by $G/H$ even if $H$ is not normal
- denote set of right cosets also by $H\backslash G$
-
examples of translation
-
$G=GL(V)$, group of linear automorphism of vector space with field $F$,
for which, map $(A,v)\mapsto Av$ for $A\in G$ and $v\in V$
defines operation of $G$ on $V$
- $G$ is subgroup of group of permutations, $\perm{V}$
- for $V=F^n$, $G$ is group of nonsingular $n$-by-$n$ matrices
-
$G=GL(V)$, group of linear automorphism of vector space with field $F$,
for which, map $(A,v)\mapsto Av$ for $A\in G$ and $v\in V$
defines operation of $G$ on $V$
Isotropy
- for conjugation operation of group $G$, $G_s$ is normalizer of $s\in G$
- isotropy groups are conjugate, e.g., for $s,s'\in S$ and $y\in G$ with $ys=s'$, $$ G_{s'} = yG_s y^{-1} $$
- by definition, kernel of operation of $G$ on $S$ is $$ K = \bigcap_{s\in S} G_s \subset G $$
- operation with trivial kernel, said to be faithful
- $s\in G$ with $G_s = G$, called fixed point
Orbits of operation
- for $x,y\in G$ in same coset of $G_s$, $xs = ys$, i.e. $\left( \exists z\in G \right) \left( x,y \in zG_s \right) \Leftrightarrow xs = ys$
- hence, mapping $G/G_s \to S$ with $x \mapsto x G_s$ is morphism of $G$-sets, thus
Orbit decomposition and class formula
- orbits are disjoint $$ S = \coprod_{\lambda \in \Lambda} Gs_\lambda $$ where $s_\lambda$ are elements of distinct orbits
Sylow subgroups
- number of fixed points of $H$ is congruent to size of $S$ modulo $p$, i.e. $$ \mbox{\# fixed points of }H \equiv |S| \Mod{p} $$
- if $H$ has exaxctly one fixed point, $|S| \equiv 1\Mod{p}$
- if $p$ divides $|S|$, $|S| \equiv 0\Mod{p}$
Sylow subgroups and solvability
- now can prove following
Rings
Rings
- $A$ is commutative group with respect to addition - unit element denoted by $0$
- $A$ is monoid with respect to multiplication - unit element denoted by $1$
- multiplication is distributive over addition, i.e. $$ \left( \forall x, y, z \in A \right) \left( (x+y)z = xz + yz \mbox{ \& } z(x+y) = zx + zy \right) $$
- do not assume $1\neq 0$
-
can prove, e.g.,
- $\left( \forall x \in A \right) \left( 0x = 0 \right)$ because $0x + x = 0x + 1x = (0+1)x = 1x = x$
- if $1=0$, $A=\{0\}$ because $x = 1x = 0x = 0$
- $\left( \forall x,y\in A \right) \left( (-x)y = -(xy) \right)$ because $xy + (-x)y = (x+ -x)y = 0y = 0$
More on ring
Fields
General distributivity
- general distributivity - for ring $A$, $\seq{x_i}_{i=1}^n\subset A$ and $\seq{y_i}_{i=1}^n\subset A$ $$ \left( \sum x_i \right) \left( \sum y_j \right) = \sum_i \sum_j x_iy_j $$
Ring examples
-
for set $S$ and ring $A$,
set of all mappings of $S$ into $A$ $\Map(S,A)$
whose addition and multiplication are defined as below,
is ring
$$
\begin{eqnarray*}
&
\left(
\forall f,g\in \Map(S,A)
\right)
\left(
\forall x\in S
\right)
\left(
(f+g)(x) = f(x)+g(x)
\right)
&
\\
&
\left(
\forall f,g\in \Map(S,A)
\right)
\left(
\forall x\in S
\right)
\left(
(fg)(x) = f(x)g(x)
\right)
&
\end{eqnarray*}
$$
- additive and multiplicative unit elements of $\Map(S,A)$ are constant maps whose values are additive and multiplicative unit elements of $A$ respectively
- $\Map(S,A)$ is commutative if and only if $A$ is commutative
- for set $S$, $\Map(S,\reals)$ (page~) is a commutative ring
-
for abelian group $M$,
set $\End(M)$ of group homeomorphisms of $M$ into itself
is ring with normal addition and mapping composition as multiplication
- additive and multiplicative unit elements of $\End(M)$ are constant map whose value is the unit element of $M$ and identity mapping respectively
- not commutative in general
- for ring $A$, set $A[X]$ of polynomials over $A$ is ring, ()
-
for field $K$,
$K^{n\times n}$,
i.e.,
set of $n$-by-$n$ matrices with components in $K$,
is ring
- $\left(K^{n\times n}\right)^\ast$, i.e., multiplicative group of units of $K^{n\times n}$, consists of non-singular matrices, i.e., those whose determinants are nonzero
Group ring
- $\sum_{xy=z} a_xb_y$ above defines what is called convolution product
Convolution product
- one may restrict this definition to functions which are $0$ except at finite number of elements
-
for $f,g\in L^1(\reals)$, can define convolution product $f\ast g$ by
$$
(f\ast g) (x) = \int_{\reals} f(x-y)g(y)dy
$$
- satisfies all axioms of ring except that there is not unit element
- commutative (essentially because $\reals$ is commutative)
- more generally, for locally compact group $G$ wiht Haar measure $\mu$, can define convolution product by $$ (f\ast g) (x) = \int_{G} f(xy^{-1})g(y)d\mu(y) $$
Ideals of ring
- for ring $A$, $(0)$ are $A$ itself area ideals
- $a$, said to be generator of $\ideal{a}=Aa$ (over $A$)
Principle rings
- $\integers$ (set of integers) is principal ring
- $k[X]$ (ring of polynomials) for field $k$ is principal ring
-
ring of algebraic integers in number field $K$
is not necessarily principal
- let $\ideal{p}$ be prime ideal, let $R_\ideal{p}$ be ring of all elements $a/b$ with $a,b\in R$ and $b\not\in\ideal{p}$, then $R_\ideal{p}$ is principal, with one prime ideal $\ideal{m}_\ideal{p}$ consisting of all elements $a/b$ as above but with $a\in\ideal{p}$
-
let $A$
be set of entire functions on complex plane,
then $A$ is commutative ring,
and every finitely generated ideal is principal
- given discrete set of complex numbers $\{z_i\}$ and nonnegative integers $\{m_i\}$, exists entire function $f$ having zeros at $z_i$ of multiplicity $m_i$ and no other zeros
- every principal ideal is of form $Af$ for some such $f$
- group of units $A^\ast$ in $A$ consists of functions having no zeros
Ideals as both additive and multiplicative monoids
-
ideals form additive monoid
- for left ideals $\ideal{a}$, $\ideal{b}$, $\ideal{c}$ of ring $A$, $\ideal{a}+\ideal{b}$ is left ideal, $(\ideal{a}+\ideal{b})+\ideal{c} =\ideal{a}+(\ideal{b}+\ideal{c})$, hence form additive monoid with $(0)$ as the unit elemenet
- similarly for right ideals & two-sided ideals
-
ideals form multiplicative monoid
- for left ideals $\ideal{a}$, $\ideal{b}$, $\ideal{c}$ of ring $A$, define $\ideal{a}\ideal{b}$ as $$ \ideal{a}\ideal{b} = \bigcup_{i=1}^\infty \bigsetl{\sum_{i=1}^n x_i y_i}{x_i \in \ideal{a},y_i\in \ideal{b}} $$ then $\ideal{a}\ideal{b}$ is also left ideal, $(\ideal{a}\ideal{b})\ideal{c} =\ideal{a}(\ideal{b}\ideal{c})$, hence form multiplicative monoid with $A$ itself as the unit elemenet; for this reason, this unit element $A$, i.e., the ring itself, often written as $(1)$
- similarly for right ideals & two-sided ideals
- ideal multiplication is also distributive over addition
- however, set of ideals does not form ring (because the additive monoid is not group)
Generators of ideal
- above equal to smallest ideals containing $a_i$, i.e., intersection of all ideals containing $a_i$ $$ \cap_{a_1,\ldots, a_n\in\ideal{a}} \ideal{a} $$ - just like set ($\sigma$-)algebras in set theory
Entire rings
Ring-homeomorphism
- kernel of ring-homeomorphism $f:A\to B$ is ideal of $A$
- conversely, for ideal $\ideal{a}$, can construct factor ring $A/\ideal{a}$
- simply say “homeomorphism'' if reference to ring is clear
Factor ring and canonical map
-
for ring $A$ and ideal $\ideal{a}$
- for subset $S\subset \ideal{a}$, write $S \equiv 0 \Mod{\ideal{a}}$
- for $x,y\in A$, if $x-y\in\ideal{a}$, write $x \equiv y \Mod{\ideal{a}}$
- if $\ideal{a} = (a)$ for $a\in A$, for $x,y\in A$, if $x-y\in\ideal{a}$, write $x \equiv y \Mod{a}$
Factor ring induced ring-homeomorphism
- the ring canonical map $f:A\to A/\ideal{a}$ is universal in category of homeomorphisms whose kernel contains $\ideal{a}$
Prime ideal and maximal ideal
- equivalently, ideal $\ideal{p}\neq A$ is prime if and only if $\left( \forall x,y \in A \right) \left( xy \in \ideal{p} \Rightarrow x \in \ideal{p} \mbox{ or } y \in \ideal{p} \right)$
- every maximal ideal is prime
- every ideal is contained in some maximal ideal
- ideal $\{0\}$ is prime if and only if $A$ is entire
- ideal $\ideal{m}$ is maximal if and only if $A/\ideal{m}$ is field
- inverse image of prime ideal of commutative ring homeomorphism is prime
Embedding of ring
- indeed, for bijective ring-isomorphism $f:A\to B$, exists set-theoretic inverse $g:B\to A$ of $f$, which is ring-homeomorphism
Characteristic of ring
-
for ring $A$,
consider ring-homeomorphism
$$
\lambda:\integers \to A
$$
such that
$$
\lambda(n) = ne
$$
where $e$ is multiplicative unit element of $A$
- kernel of $\lambda$ is ideal $(n)$ for some $n\geq0$, i.e., ideal generated by some nonnegative integer $n$
- hence, canonical injective ring-homeomorphism $\integers/n\integers \to A$, which is ring-isomorphism between $\integers/n\integers$ and subring of $A$
- when $n\integers$ is prime ideal, exist two cases; either $n=0$ or $n=p$ for prime number $p$
Prime fields and prime rings
- field $K$ has characteristic $0$ or $p$ for prime number $p$
-
$K$ contains as subfield (isomorphic image of)
- $\rationals$ if characteristic is $0$
- $\primefield{p}$ if characteristic is $p$
$\integers/n\integers$
- $\integers$ is ring
- every ideal of $\integers$ is principal, i.e., either $\{0\}$ or $n\integers$ for some $n\in\naturals$ (refer to page~)
-
ideal of $\integers$ is prime if and only if is $p\integers$ for some prime number $p\in\naturals$
- $p\integers$ is maximal ideal
- $\integers/p\integers$ for prime $p$ is field and denoted by \primefield{p}
Euler phi-function
Chinese remainder theorem
Isomorphism of endomorphisms of cyclic groups
- ring isomorphism $$ \integers/n\integers \isomorph \End(A) $$
- group isomorphism $$ (\integers/n\integers)^\ast \isomorph \Aut(A) $$
- e.g., for group of $n$-th roots of unity in $\complexes$, all automorphisms are given by $$ \xi \mapsto \xi^k $$ for $k\in(\integers/n\integers)^\ast$
Irreducibility and factorial rings
Greatest common divisor
Polynomials
Why (ring of) polynomials?
- lays ground work for polynomials in general
-
needs polynomials over arbitrary rings for diverse purposes
- polynomials over finite field which cannot be identified with polynomial functions in that field
- polynomials with integer coefficients; reduce them mod $p$ for prime $p$
- polynomials over arbitrary commutative rings
- rings of polynomial differential operators for algebraic geometry & analysis
- e.g., ring learning with errors (RLWE) for cryptographic algorithms
Ring of polynomials
- exist many ways to define polynomials over commutative ring; here's one
- for every $a\in A$, define function which has value $a$ on $X^n$, and value $0$ for every other element of $S$, by $aX^r$
- then, a polynomial can be uniquely written as $$ f(X) = a_0X^0 + \cdots + a_nX^n $$ for some $n\in\integers_+$, $a_i\in A$
- $a_i$, called coefficients of $f$
Polynomial functions
- hence, for $x\in B$, subring $A[x]$ of $B$ generated by $x$ over $A$ is ring of all polynomial values $f(x)$ for $f\in A[X]$
- in particular, $X$ is variable over $A$
Polynomial examples
-
consider $\alpha=\sqrt{2}$ and $\bigset{a+b\alpha}{a,b\in\integers}$,
subring of $\integers[\alpha]\subset \reals$
generated by $\alpha$.
- $\alpha$ is not transcendental because $f(\alpha)=0$ for $f(X)=X^2-1$
- hence kernel of evaluation map of $\integers[X]$ into $\integers[\alpha]$ is not injective, hence not isomorphism
- indeed $$ \integers[\alpha] = \bigset{a+b\alpha}{a,b\in\integers} $$
-
consider $\primefield{p}$ for prime number $p$
- $f(X) = X^p - X\in \primefield{p}[X]$ is not zero polynomial, but because $x^{p-1} \equiv 1$ for every nonzero $x\in\primefield{p}$ by (Euler's theorem), $x^p\equiv x$ for every $x\in\primefield{p}$, thus for polynomial function, $f_{\primefield{p}}$, $f_{\primefield{p}}(x)=0$ for every $x$ in $\primefield{p}$
- i.e., non-zero polynomial induces zero polynomial function
Reduction map
- for homeomorphism $\varphi:A\to B$ of commutative rings, exists associated homeomorphisms of polynomial rings $A[X]\to B[X]$ such that $$ f(X) = \sum a_i X^i \mapsto \sum \varphi(a_i) X^i = (\varphi f)(X) $$
- e.g., for complex conjugate $\varphi: \complexes \to \complexes$, homeomorphism of $\complexes[X]$ into itself can be obtained by reduction map $f \mapsto \varphi f$, which is complex conjugate of polynomials with complex coefficients
Basic properties of polynomials in one variable
Constant, monic, and irreducible polynomials
Roots or zeros of polynomials
Induction of zero functions
Reduced polynomials and uniqueness
- for field $k$ with $q$ elements, polynomial in $n$ variables over $k$ can be expressed as $$ f(X_1,\ldots,X_n) = \sum a_i X_1^{\nu_{i,1}} \cdots X_n^{\nu_{i,n}} $$ for finite sequence, $\seqscr{a_i}{i=1}{m}$, and $\seqscr{\nu_{i,1}}{i=1}{m}$, , $\seqscr{\nu_{i,n}}{i=1}{m}$ where $a_i\in k$ and $\nu_{i,j} \geq 0$
- because $X_i^q=X_i$ for any $X_i$, any $\nu_{i,j}\geq q$ can be (repeatedly) replaced by $\nu_{i,j}-(q-1)$, hence $f$ can be rewritten as $$ f(X_1,\ldots,X_n) = \sum a_i X_1^{\mu_{i,1}} \cdots X_n^{\mu_{i,n}} $$ where $0\leq \mu_{i,j} < q$ for all $i,j$
Multiplicative subgroups and $n$-th roots of unity
Algebraic closedness
- e.g., complex numbers are algebraically closed
- every field is contained in some algebraically closed field ()
-
for algebraically closed field $k$
- (of course) every irreducible polynomial in $k[X]$ is of degree $1$
- unique factorization of polynomial of nonnegative degree can be written in form $$ f(X) = c \prod_{i=1}^{r} (X-\alpha_i)^{m_i} $$ with nonzero $c\in k$, distinct roots, $\alpha_1,\ldots,\alpha_r \in k$, and $m_1,\ldots,m_r \in \naturals$
Derivatives of polynomials
- for $f,g\in A[X]$ with commutative ring $A$, and $a\in A$ $$ (f+g)' = f' + g' \quad \mbox{\&} \quad (fg)' = f'g + fg' \quad \mbox{\&} \quad (af)' = af' $$
Multiple roots and multiplicity
- nonzero polynomial $f(X)\in k[X]$ in one variable over field $k$ having $a\in k$ as root can be written of form $$ f(X) = (X-a)^m g(X) $$ with some polynomial $g(X)\in A[X]$ relatively prime to $(X-a)$ (hence, $g(a)\neq0$)
Frobenius endomorphism
- homeomorphism of $K$ into itself $x\mapsto x^p$ has trivial kernel, hence injective
- hence, iterating $r\geq 1$ times yields endomorphism, $x\mapsto x^{p^r}$
Roots with multiplicity $p^r$ in fields having characteristic $p$
-
for field $K$ having characteristic $p$
- $p | {p \choose \nu}$ for all $0< \nu < p$ because $p$ is prime, hence, for every $a,b\in K$ $$ (a+b)^p = a^p + b^p $$
- applying this resurvely $r$ times yields $$ (a+b)^{p^r} = (a^p + b^p)^{p^{r-1}} = (a^{p^2} + b^{p^2})^{p^{r-2}} = \cdots = a^{p^r} + b^{p^r} $$ hence $$ (X-a)^{p^r} = X^{p^r} - a^{p^r} $$
- if $a,c\in K$ satisfy $a^{p^r} = c$ $$ X^{p^r} - c = X^{p^r} - a^{p^r} = (X-a)^{p^r} $$ hence, polynomial $X^{p^r}-c$ has precisely one root $a$ of multiplicity $p^r$!
Algebraic Extension
Algebraic extension
-
will show
- for polynomial over field, always exists some extension of that field where the polynomial has root
- existence of algebraic closure for every field
Extension of field
- can view $E$ as vector space over $F$
- if dimension of the vector space is finite, extension called finite extension of $F$
- if infinite, called infinite extension of $F$
Algebraic over field
- for algebraic $\alpha\neq0$, can always find such equation like above that $a_0\neq0$
-
equivalent statements to
- exists homeomorphism $\varphi: F[X] \to E$ such that $$ \left(\forall x\in F\right) \left(\varphi(x) = x\right) \mbox{ \& } \varphi(X) = \alpha \mbox{ \& } \Ker \varphi \neq \{0\} $$
- exists evaluation homeomorphism $\ev_\alpha: F[X] \to E$ with nonzero kernel (refer to for definition of evaluation homeomorphism)
- in which case, $\Ker \varphi$ is principal ideal (by ), hence generated by single element, thus exists nonzero $p(X) \in F[X]$ (with normalized leading coefficient being $1$) so that $$ F[X] / (p(X)) \isomorph F[\alpha] $$
- $F[\alpha]$ entire (), hence $p(X)$ irreducible (refer to )
Algebraic extensions
- converse is not true, e.g., subfield of complex numbers consisting of algebraic numbers over $\rationals$ is infinite extension of $\rationals$
Dimension of extensions
- if $\seqscr{x_i}{i\in I}{}$ is basis for $F$ over $k$, and $\seqscr{y_j}{j\in J}{}$ is basis for $E$ over $F$, $\seqscr{x_iy_j}{(i,j)\in I\times J}{}$ is basis for $E$ over $k$
Generation of field extensions
- $k(\alpha_1,\ldots, \alpha_n)$ consists of all quotients $f(\alpha_1,\ldots,\alpha_n)/g(\alpha_1,\ldots, \alpha_n)$ where $f,g\in k[X]$ and $g(\alpha_1,\ldots, \alpha_n)\neq0$, i.e. $$ \begin{eqnarray*} &=& k(\alpha_1,\ldots,\alpha_n) \\ &=& \bigset{f(\alpha_1,\ldots, \alpha_n)/g(\alpha_1,\ldots,\alpha_n)}{f,g\in f[X], g(\alpha_1,\ldots,\alpha_n)\neq0} \end{eqnarray*} $$
- any field extension $E$ over $k$ is union of smallest subfields containing $\alpha_1,\ldots, \alpha_n$ where $\alpha_1,\ldots, \alpha_n$ range over finite set of elements of $E$, i.e. $$ E = \bigcup_{n\in\naturals} \bigcup_{\alpha_1, \ldots, \alpha_n \in E} k(\alpha_1,\ldots,\alpha_n) $$
Tower of fields
Algebraicness of finitely generated subfields
- indeed, $\Irr(\alpha,k,X)$ has a fortiori coefficients in $F$
- assume tower of fields $$ k \subset k(\alpha_1) \subset k(\alpha_1, \alpha_2) \subset \cdots \subset k(\alpha_1,\ldots, \alpha_n) $$ where $\alpha_i$ is algebraic over $k$
- then, $\alpha_{i+1}$ is algebraic over $k(\alpha_1,\ldots,\alpha_i)$ (by )
Compositum of subfields and lifting
- cannot define compositum if $E$ and $F$ are not embedded in common field $L$
- could define compositum of set of subfields of $L$ as smallest subfield containing subfields in the set
Lifting
- often draw diagram as in the figure
Finite generation of compositum
- refer to diagra in the figure
Distinguished classes
- for tower of fields $k\subset F\subset E$, extension $k\subset E$ is in $\classk{C}$ if and only if both $k\subset F$ and $F\subset E$ are in $\classk{C}$
- if $k\subset E$ is in $\classk{C}$, $F$ is any extension of $k$, and both $E$ and $F$ are subfields of common field, then $F\subset EF$ is in $\classk{C}$
- if $k\subset F$ and $k\subset E$ are in $\classk{C}$ and both $E$ and $F$ are subfields of common field, $k\subset EF$ is in $\classk{C}$
Both algebraic and finite extensions are distinguished
- true that finitely generated extensions form distinguished class (not necessarily algebraic extensions or finite extensions)
Field embedding and embedding extension
- assuming $F$, $E$, $\sigma$, and $\tau$ same as in , if $\alpha\in E$ is root of $f\in F[X]$, then $\alpha^\tau$ is root of $f^\sigma$ for if $f(X) = \sum_{i=0}^n a_i X^i$, then $f(\alpha) = \sum_{i=0}^n a_i \alpha^i = 0$, and $0 = f(\alpha)^\tau = \sum_{i=0}^n (a_i^\tau ) (\alpha^\tau)^i = \sum_{i=0}^n a_i^\sigma (\alpha^\tau)^i = f^\sigma(\alpha^\tau)$
Embedding of field extensions
Existence of roots of irreducible polynomial
- assume $p(X) \in k[X]$ irreducible polynomial and consider canonical map, which is ring homeomorphism $$ \sigma: k[X] \to k[X] / ((p(X)) $$
-
consider $\Ker \restrict{\sigma}{k}$
- every kernel of ring homeomorphism is ideal, hence if nonzero $a \in \Ker \restrict{\sigma}{k}$, $1\in \Ker \restrict{\sigma}{k}$ because $a^{-1} \in \Ker \restrict{\sigma}{k}$, but $1\not\in (p(X))$
- thus, $\Ker \restrict{\sigma}{k} = \{0\}$, hence $p^\sigma\neq0$
- now for $\alpha = X^\sigma$ $$ p^\sigma(\alpha) = p^\sigma(X^\sigma) = (p(X))^\sigma = 0 $$
- thus, $\alpha$ is algebraic in $k^\sigma$, i.e., $\alpha \in k[X]^\sigma$ is root of $p^\sigma$ in $k^\sigma(\alpha)$
Existence of algebraically closed algebraic field extensions
Isomorphism between algebraically closed algebraic extensions
- thus, algebraically closed algebraic extension is determined up to isomorphism
Algebraic closure
-
examples
- complex conjugation is automorphism of $\complexes$ (which is the only continuous automorphism of $\complexes$)
- subfield of $\complexes$ consisting of all numbers which are algebraic over $\rationals$ is algebraic closure of $\rationals$, i.e., $\algclosure{\rationals}$
- $\algclosure{\rationals} \neq \complexes$
- $\algclosure{\reals} = \complexes$
- \algclosure{\rationals}\ is countable
Splitting fields
- for field, $k$, every $f\in k[X]$ has splitting field in $\algclosure{k}$
Splitting fields for family of polynomials
- in most applications, deal with finite $\Lambda$
- becoming increasingly important to consider infinite algebraic extensions
- various proofs would not be simpler if restricted ourselves to finite cases
Normal extensions
- every embedding of $K$ into $\algclosure{k}$ over $k$ induces automorphism
- $K$ is splitting field of family of polynomials in $k[X]$
- every irreducible polynomial of $k[X]$ which has root in $K$ splits into linear factors in $K$
-
not true that class of normal extensions is distinguished
- e.g., below tower of fields is tower of normal extensions $$ \rationals \subset \rationals(\sqrt{2}) \subset \rationals(\sqrt[4]{2}) $$
- but, extension $\rationals \subset \rationals(\sqrt[4]{2})$ is not normal because complex roots of $X^4-2$ are not in $\rationals(\sqrt[4]{2})$
Retention of normality of extensions
Separable degree of field extensions
-
for field, $F$, and its algebraic extension, $E$
- let $L$ be algebraically closed field and assume embedding, $\sigma:F\to L$
- let $L'$ be another algebraically closed field and assume another embedding, $\tau:F\to L'$ - assume as before that $L'$ is algebraic closure of $F^\tau$
- then implies, exists isomorphism, $\lambda:L\to L'$ extending $\tau\circ \sigma^{-1}$ applied to $F^\sigma$
- let $S_\sigma$ & $S_\tau$ be sets of embedding extensions of $\sigma$ to $E$ in $L$ and $L'$ respectively
- then $\lambda$ induces map from $S_\sigma$ into $S_\tau$ with $\tilde{\sigma} \mapsto \lambda \circ \tilde{\sigma}$ and $\lambda^{-1}$ induces inverse map from $S_\tau$ into $S_\sigma$, hence exists bijection between $S_\sigma$ and $S_\tau$, hence have same cardinality
Multiplicativity of and upper bound on separable degree of field extensions
- i.e., separable degree is at most equal to degree (i.e., dimension) of field extension
Finite separable field extensions
Arbitrary separable field extensions
Separable closure and conjugates
- smallest normal extension of $k$ containing $E$ is compositum of all conjugates of $E$ in $\algclosure{E}$
- $\alpha^{\sigma_1}$, , $\alpha^{\sigma_r}$ are simply distinct roots of $\Irr(\alpha, k, X)$
- smallest normal extension of $k$ containing one of these conjugates is simply $k(\alpha^{\sigma_1}, \ldots, \alpha^{\sigma_r})$
Prime element theorem
Finite fields
Automorphisms of finite fields
- is (ring) homeomorphism with $\Ker \frobmap{p}{n} = \{0\}$ since is field, thus is injective (), and surjective because is finite,
- thus, is isomorphism leaving \primefield{p}\ fixed
Galois Theory
What we will do to appreciate Galois theory
-
study
- group of automorphisms of finite (and infinite) Galois extension (at length)
- give examples, e.g., cyclotomic extensions, abelian extensions, (even) non-abelian ones
- leading into study of matrix representation of Galois group & classifications
-
have
tools to prove
- fundamental theorem of algebra
- insolvability of quintic polynomials
-
mention unsolved problems
- given finite group, exists Galois extension of $\rationals$ having this group as Galois group?
Fixed fields
-
$K^G$ is subfield of $K$ because for every $x,y\in K^G$
- $0^\sigma = 0 \Rightarrow 0\in K^G$
- $(x+y)^\sigma = x^\sigma + y^\sigma = x + y \Rightarrow x+y \in K^G$
- $(-x)^\sigma = - x^\sigma = - x \Rightarrow -x \in K^G$
- $1^\sigma = 1 \Rightarrow 1\in K^G$
- $(xy)^\sigma = x^\sigma y^\sigma = xy \Rightarrow xy\in K^G$
- $(x^{-1})^\sigma = (x^\sigma)^{-1} = x^{-1} \Rightarrow x^{-1} \in K^G$
- $0,1\in K^G$, hence $K^G$ contains prime field
Galois extensions and Galois groups
Fundamental theorem for Galois theory
- map $H \mapsto K^H$ induces isomorphism between set of subgroups of $G(K/k)$ & set of intermediate fields
- subgroup, $H$, of $G(K/k)$, is normal if and only if $K^H/k$ is Galois
- for normal subgroup, $H$, $\sigma\mapsto \restrict{\sigma}{K^H}$ induces isomorphism between $G(K/k)/H$ and $G(K^H/k)$
- shall prove step by step
Galois subgroups association with intermediate fields
- $K/F$ is Galois & $K^{G(K/F)} = F$, hence, $K^G = k$
- map $$ F \mapsto G(K/F) $$ induces injective homeomorphism from set of intermediate fields to subgroups of $G$
- $F/k$ is normal extension if and only if $G(K/F)$ is normal subgroup of $G(K/k)$
- if $F/k$ is normal extension, map, $\sigma \mapsto \restrict{\sigma}{F}$, induces homeomorphism of $G(K/k)$ onto $G(F/k)$ of which $G(K/F)$ is kernel, thus $$ G(F/k) \isomorph G(K/k)/G(K/F) $$
Proof for fundamental theorem for Galois theory
- finally, we prove fundamental theorem for Galois theory ()
-
assume $K/k$ is finite Galois extension
and $H$ is subgroup of $G(K/k)$
- implies $K^H$ is intermediate field, hence implies $K/K^H$ is Galois, implies $G(K/K^H) = H$, thus, every $H$ is Galois
- map, $H\mapsto K^H$, induces homeomorphism, $\sigma$, of set of all subgroups of $G(K/k)$ into set of intermediate fields
- $\sigma$ is injective since for any two subgroups, $H$ and $H'$, of $G(K/k)$, if $K^H=K^{H'}$, then $H=G(K/K^H)=G(K/K^{H'})=H'$
- $\sigma$ is surjective since for every intermediate field, $F$, implies $K/F$ is Galois, $G(K/F)$ is subgroup of $G(K/k)$, and $K^{G(K/F)}=F$, thus, $\sigma(G(K/F)) = K^{G(K/F)}= F$
- therefore, $\sigma$ is isomorphism between set of all subgroups of $G(K/k)$ and set of intermediate fields
- since implies separable extensions are distinguished, $H^K/k$ is separable, thus implies that $K^H/k$ is Galois if and only if $G(K/K^H)$ is normal
- lastly, implies that if $K^H/k$ is Galois, $G(H^K/k) \isomorph G(K/k) / H$
Abelian and cyclic Galois extensions and groups
- if $K/k$ is abelian, $F/k$ is Galois and abelian
- if $K/k$ is cyclic, $F/k$ is Galois and cyclic
Theorems and corollaries about Galois extensions
- $KF / F$ and $K/(K\cap F)$ are Galois extensions
- map $$ \sigma \mapsto \sigma|K $$ induces isomorphism between $G(KF / F)$ and $G(K/(K\cap F))$
- $K_1K_2/k$ is Galois extension
- map $$ \sigma \mapsto (\restrict{\sigma}{K_1}, \restrict{\sigma}{K_2}) $$ of $G(K_1K_2/k)$ into $G(K_1/k) \times G(K_2/k)$ is injective; if $K_1\cap K_2=k$, map is isomorphism
- $K_1\cdots K_n/k$ is Galois extension
- map $$ \sigma \mapsto (\restrict{\sigma}{K_1}, \ldots, \restrict{\sigma}{K_n}) $$ induces isomorphism of $G(K_1\cdots K_n/k)$ onto $G(K_1/k) \times \cdots \times G(K_n/k)$
- $K_1/k$, , $K_n/k$ are Galois extensions
- $G(K_i/k)=G_i$ for $i=1,\ldots,n$
- $K_{i+1}\cap(K_1\cdots K_i) = k$ for $i=1,\ldots,n-1$
- $K=K_1\cdots K_n$
- for two abelian Galois extensions, $K/k$ and $L/k$, $KL/k$ is abelian Galois extension
- for abelian Galois extension, $K/k$, and any extension, $E/k$, $KE/E$ is abelian Galois extension
- for abelian Galois extension, $K/k$, and intermediate field, $E$, both $K/E$ and $E/k$ are abelian Galois extensions
Solvable and radical extensions
- unity, or
- $X^n=a$ with $a\in E_i$, and $n$ prime to characteristic, or
- $X_p-X-a$ with $a\in E_i$ if $p$ is positive characteristic