0.1 Notation.

We use the standard (Bourbaki) notation:

\displaystyle\mathbb{N}
={0,1,2,},\displaystyle=\{0,1,2,\ldots\},
\displaystyle\mathbb{Z}
=ring of integers,\displaystyle=\text{ring of integers,}
\displaystyle\mathbb{R}{}
=field of real numbers,\displaystyle=\text{field of real numbers,}
\displaystyle\mathbb{C}{}
=field of complex numbers,\displaystyle=\text{field of complex numbers,}
𝔽p\displaystyle\mathbb{F}_{p}
=/p=field with p elements, p a prime number.\displaystyle=\mathbb{Z}{}/p\mathbb{Z}{}=\text{field with }p\text{ elements, }p\text{ a prime number.}

Given an equivalence relation, [][\ast] denotes the equivalence class containing \ast. The cardinality of a set SS is denoted by |S|\left|S\right| (so |S|\left|S\right| is the number of elements in SSwhen SS is finite). Let II and AA be sets. A family of elements of AA indexed by II, denoted by (ai)iI(a_{i})_{i\in I}, is a function iai:IAi\mapsto a_{i}\colon I\rightarrow A. Throughout the notes, pp is a prime number: p=2,3,5,7,11,p=2,3,5,7,11,\ldots.

XYX is a subset of Y (not necessarily proper).X=defYX is defined to be Y, or equals Y by definition.XYX is isomorphic to Y.XYX and Y are canonically isomorphic (or there is a given or unique isomorphism).\begin{array}[c]{ll}X\subset Y&X\text{ is a subset of }Y\text{ (not % necessarily proper).}\\ X\overset{\smash{\lower 1.31395pt\hbox{{def}}}}{=}Y&X\text{ is defined to be }% Y\text{, or equals }Y\text{ by definition.}\\ X\approx Y&X\text{ is isomorphic to }Y\text{.}\\ X\simeq Y&X\text{ and }Y\text{ are canonically isomorphic (or there is a given or unique isomorphism).}\end{array}

0.1.1 Prerequisites

Group theory (for example, GT), basic linear algebra, and some elementary theory of rings.