Chapter 7 · Algebra

7.3 Fields, Finite Fields and Algebraic Extensions

Fields and their characteristic, the quotient fields $F[x]/\langle f\rangle$, the degree $[K:F]$ and the tower law, minimal polynomials and algebraic extensions, splitting fields, algebraically closed fields, and the complete structure of the finite fields $\mathbb{F}_{p^n}$ — the degree computations and counting results that GATE MA asks for.

Section 7.2 proved a remarkable fact: if $f$ is an irreducible polynomial over a field $F$, then the quotient ring $F[x]/\langle f\rangle$ is again a field, and in it the class of $x$ is a root of $f$. This is how mathematicians manufacture roots that do not yet exist — $\mathbb{R}[x]/\langle x^2+1\rangle$ is the complex numbers, $\mathbb{F}_2[x]/\langle x^2+x+1\rangle$ is a field with four elements. This section studies such bigger fields systematically. The key number is the degree $[K:F]$, the dimension of $K$ as a vector space over $F$: it multiplies along towers of fields, it equals the degree of the minimal polynomial for a field generated by one root, and it controls which numbers can live in which fields. With it we can decide quickly that $\sqrt[3]{2}$ is not in any field of degree $4$ over $\mathbb{Q}$, that the smallest field containing all roots of $x^3-2$ has degree $6$, and that a finite field has a prime-power number of elements, its nonzero elements form a cyclic group, and its subfields correspond to divisors.

GATE MA asks about this material in a few recurring forms: the degree of an extension such as $\mathbb{Q}(\sqrt2,\sqrt[3]{2},i)$ or of a splitting field (often a NAT question); "which of these quotient rings is a field"; the number of elements of a given order, of generators of $\mathbb{F}_q^\times$, of subfields of $\mathbb{F}_{p^n}$ or of monic irreducible polynomials of a given degree over $\mathbb{F}_q$; and MSQs about algebraic and algebraically closed fields ("every algebraic extension is finite", "no finite field is algebraically closed"). All of these come down to a handful of theorems, proved or carefully sketched below. Throughout, $F$, $K$, $L$ denote fields, $p$ a prime, $q=p^n$ a prime power, $\mathbb{F}_p=\mathbb{Z}_p=\mathbb{Z}/p\mathbb{Z}$, $\omega=e^{2\pi i/3}$ and $\zeta_n=e^{2\pi i/n}$.

Fields, Characteristic and Quotient Fields

📘 Definition 7.27 — Field, subfield, characteristic, prime subfield
A field is a commutative ring $F$ with $1\ne0$ in which every nonzero element has a multiplicative inverse; $F^\times=F\setminus\{0\}$ is then a group under multiplication. A subfield of $F$ is a subset that is a field under the same operations. The characteristic $\operatorname{char}F$ is the least $n\ge1$ with $n\cdot1=1+1+\cdots+1=0$ ($n$ terms), or $0$ if no such $n$ exists. The prime subfield of $F$ is the intersection of all subfields of $F$ — the smallest subfield.
📐 Theorem 7.39 — Characteristic and prime subfield; field homomorphisms are injective
  1. The characteristic of a field is $0$ or a prime $p$. If $\operatorname{char}F=p$, then $pa=0$ for every $a\in F$.
  2. The prime subfield of $F$ is isomorphic to $\mathbb{Q}$ if $\operatorname{char}F=0$ and to $\mathbb{F}_p$ if $\operatorname{char}F=p$.
  3. Every ring homomorphism $\varphi:F\to R$ from a field to a nonzero ring with $\varphi(1)=1$ is injective. In particular a field homomorphism $F\to K$ identifies $F$ with a subfield of $K$, and fields of different characteristic admit no homomorphisms between them.

Proof. (1) If $n\cdot1=0$ with $n=rs$, $1\lt r,s\lt n$, then $(r\cdot1)(s\cdot1)=0$, and since a field has no zero divisors, $r\cdot1=0$ or $s\cdot1=0$ — contradicting the minimality of $n$. So the least such $n$ is prime. Then $pa=(p\cdot1)a=0$. (2) The map $\mathbb{Z}\to F$, $m\mapsto m\cdot1$, is a ring homomorphism whose kernel is $p\mathbb{Z}$ or $0$. If the kernel is $p\mathbb{Z}$, its image is a copy of $\mathbb{Z}/p\mathbb{Z}=\mathbb{F}_p$, a field contained in every subfield (each subfield contains $1$). If the kernel is $0$, every subfield contains the quotients $(m\cdot1)(n\cdot1)^{-1}$, which form a copy of $\mathbb{Q}$. (3) The kernel is an ideal of $F$; the only ideals of a field are $0$ and $F$ (a nonzero ideal contains a unit), and the kernel is not $F$ because $\varphi(1)=1\ne0$. A homomorphism preserves $n\cdot1$, so characteristics must agree. ∎

The fields we meet are: the number fields inside $\mathbb{C}$ (characteristic $0$), the finite fields $\mathbb{F}_p$ and their extensions, and fields of rational functions such as $\mathbb{F}_p(t)$ — an infinite field of characteristic $p$. The standard way of making new fields is the following quotient construction (the ideal theory behind it is in §7.2: $F[x]$ is a PID, and $\langle f\rangle$ is maximal exactly when $f$ is irreducible).

📐 Theorem 7.40 — When is $F[x]/\langle f\rangle$ a field?
Let $f\in F[x]$ have degree $n\ge1$ and put $K=F[x]/\langle f\rangle$, $\theta=x+\langle f\rangle$.
  1. $K$ is a field $\iff$ $f$ is irreducible over $F$ $\iff$ $K$ is an integral domain.
  2. Every element of $K$ is uniquely $c_0+c_1\theta+\cdots+c_{n-1}\theta^{n-1}$ with $c_i\in F$; so $K$ is an $n$-dimensional vector space over $F$ (which sits inside $K$ as the constants), and $f(\theta)=0$.
  3. If $F=\mathbb{F}_q$ is finite and $f$ is irreducible, $K$ is a field with $q^n$ elements.
  4. For $\deg f=2$ or $3$: $f$ is irreducible over $F$ iff $f$ has no root in $F$.

Proof. (2) Division by $f$ gives every $g\in F[x]$ the form $g=qf+r$ with $\deg r\lt n$, and $g\equiv r$; two remainders of degree $\lt n$ that are congruent differ by a multiple of $f$ of degree $\lt n$, hence are equal. And $f(\theta)=f(x)+\langle f\rangle=0$. (1) If $f=gh$ with $1\le\deg g,\deg h\lt n$, then $g(\theta)h(\theta)=0$ with both factors nonzero (they are their own remainders): $K$ has zero divisors and is not a field. If $f$ is irreducible and $g(\theta)\ne0$, then $f\nmid g$, so $\gcd(f,g)=1$ (the only divisors of $f$ are units and associates of $f$), and Bézout's identity $uf+vg=1$ in the Euclidean domain $F[x]$ gives $v(\theta)g(\theta)=1$. A field is an integral domain, which closes the cycle. (3) There are $q$ choices for each of the $n$ coefficients in (2). (4) A factorisation of a quadratic or cubic into factors of positive degree contains a linear factor $x-a$, i.e. a root $a\in F$. ∎

Part (4) fails from degree $4$ on: $x^4+4=(x^2+2x+2)(x^2-2x+2)$ has no rational root but is reducible over $\mathbb{Q}$. For degree $\ge4$ use the tests of §7.2 (Eisenstein, reduction mod $p$, Gauss's lemma) or the degree arguments below.

✏️ Example 1 — Which quotient rings are fields?
Decide which of the following rings are fields, and give the number of elements when finite: (a) $\mathbb{Z}_3[x]/\langle x^2+1\rangle$; (b) $\mathbb{Z}_5[x]/\langle x^2+1\rangle$; (c) $\mathbb{Q}[x]/\langle x^4+4\rangle$; (d) $\mathbb{R}[x]/\langle x^2+x+1\rangle$; (e) $\mathbb{Z}[x]/\langle x^2+1\rangle$. Then (f) in $K=\mathbb{Q}[x]/\langle x^3-2\rangle=\mathbb{Q}(\sqrt[3]{2})$, write $(1+\sqrt[3]{2})^{-1}$ in the form $a+b\sqrt[3]2+c\sqrt[3]4$.
(a) Field, 9 elements $x^2+1$ takes the values $1,2,2$ at $x=0,1,2$ in $\mathbb{Z}_3$: no root, so the quadratic is irreducible (Theorem 7.40(4)) and the quotient is a field with $3^2=9$ elements.
(b) Not a field $2^2+1=5=0$ in $\mathbb{Z}_5$, so $x^2+1=(x-2)(x+2)$, and $(\theta-2)(\theta+2)=0$ with both factors nonzero. (In general $-1$ is a square mod an odd prime $p$ iff $p\equiv1\pmod4$ — see Theorem 7.50(4).)
(c) Not a field $x^4+4=(x^2+2x+2)(x^2-2x+2)$ (Sophie Germain's identity $a^4+4b^4=(a^2+2ab+2b^2)(a^2-2ab+2b^2)$), although it has no rational root.
(d) Field, $\cong\mathbb{C}$ The discriminant $1-4=-3\lt0$, so $x^2+x+1$ has no real root and is irreducible over $\mathbb{R}$. The quotient is a $2$-dimensional field extension of $\mathbb{R}$; sending $\theta\mapsto\omega$ identifies it with $\mathbb{R}(\omega)=\mathbb{C}$.
(e) Not a field $\mathbb{Z}[x]/\langle x^2+1\rangle\cong\mathbb{Z}[i]$, the Gaussian integers — an integral domain, but $2$ has no inverse ($\tfrac12\notin\mathbb{Z}[i]$). Theorem 7.40 needs a field of coefficients.
(f) Inverse Let $a=\sqrt[3]2$. From $a^3=2$: $(1+a)(1-a+a^2)=1+a^3=3$. Hence $(1+a)^{-1}=\tfrac13-\tfrac13a+\tfrac13a^2=\tfrac13\left(1-\sqrt[3]2+\sqrt[3]4\right)$.
General method To invert $g(\theta)$, run the extended Euclidean algorithm on $f$ and $g$ to find $uf+vg=1$; then $g(\theta)^{-1}=v(\theta)$. Here a factorisation identity did it in one line.

Field Extensions, Degree and the Tower Law

📘 Definition 7.28 — Extension, degree, generated subfield
If $F$ is a subfield of $K$, we call $K$ an extension of $F$ and write $K/F$ (or $F\subseteq K$). Then $K$ is a vector space over $F$, and its dimension $[K:F]$ is the degree of the extension; $K/F$ is finite if $[K:F]\lt\infty$. A field $L$ with $F\subseteq L\subseteq K$ is an intermediate field. For $\alpha_1,\dots,\alpha_k\in K$, $F(\alpha_1,\dots,\alpha_k)$ is the smallest subfield of $K$ containing $F$ and the $\alpha_i$; an extension $F(\alpha)/F$ is called simple.

Examples: $[\mathbb{C}:\mathbb{R}]=2$ with basis $1,i$; $[\mathbb{Q}(\sqrt2):\mathbb{Q}]=2$ with basis $1,\sqrt2$; $[K:F]=1$ iff $K=F$; $[\mathbb{R}:\mathbb{Q}]=\infty$, because a finite-dimensional $\mathbb{Q}$-vector space is countable.

📐 Theorem 7.41 — The tower law
If $F\subseteq K\subseteq L$ are fields, then $[L:F]=[L:K]\,[K:F]$, in the sense that $L/F$ is finite iff both $L/K$ and $K/F$ are finite, and then the degrees multiply. More precisely, if $\{u_i\}$ is a basis of $K$ over $F$ and $\{v_j\}$ is a basis of $L$ over $K$, then $\{u_iv_j\}$ is a basis of $L$ over $F$.

Proof. Spanning. Every $w\in L$ is $w=\sum_j b_jv_j$ with $b_j\in K$, and each $b_j=\sum_ia_{ij}u_i$ with $a_{ij}\in F$; so $w=\sum_{i,j}a_{ij}u_iv_j$. Independence. If $\sum_{i,j}a_{ij}u_iv_j=0$ with $a_{ij}\in F$, group it as $\sum_j\left(\sum_ia_{ij}u_i\right)v_j=0$. The inner sums lie in $K$, and the $v_j$ are independent over $K$, so $\sum_ia_{ij}u_i=0$ for each $j$; the $u_i$ are independent over $F$, so every $a_{ij}=0$. Counting the basis gives the product formula. Conversely, if $[L:F]\lt\infty$, then $K$ is a subspace of the finite-dimensional $F$-space $L$, so $[K:F]\lt\infty$, and an $F$-spanning set of $L$ also spans $L$ over $K$, so $[L:K]\lt\infty$. ∎

📘 Definition 7.29 — Algebraic and transcendental elements; minimal polynomial
Let $K/F$ be an extension. An element $\alpha\in K$ is algebraic over $F$ if $g(\alpha)=0$ for some nonzero $g\in F[x]$, and transcendental over $F$ otherwise. If $\alpha$ is algebraic, its minimal polynomial $m_{\alpha,F}$ (or $m_\alpha$) is the monic polynomial of least degree in $F[x]$ having $\alpha$ as a root, and $\deg_F\alpha=\deg m_{\alpha,F}$ is the degree of $\alpha$ over $F$. Complex numbers algebraic over $\mathbb{Q}$ are called algebraic numbers; the others are transcendental numbers.

The minimal polynomial of a matrix (§3.2) is the same idea for the ring of matrices instead of a field, and it behaves in the same way: it divides every polynomial that the object satisfies. The difference is that a field has no zero divisors, which makes the minimal polynomial of a field element irreducible.

📐 Theorem 7.42 — Minimal polynomials and simple extensions
Let $\alpha\in K$ be algebraic over $F$ with minimal polynomial $m=m_{\alpha,F}$ of degree $n$.
  1. $m$ is irreducible over $F$, and for $g\in F[x]$: $g(\alpha)=0\iff m\mid g$. Conversely, a monic irreducible polynomial in $F[x]$ with root $\alpha$ is $m$.
  2. $F(\alpha)=F[\alpha]=\{g(\alpha):g\in F[x]\}$, and $g(x)+\langle m\rangle\mapsto g(\alpha)$ is an isomorphism $F[x]/\langle m\rangle\cong F(\alpha)$.
  3. $1,\alpha,\dots,\alpha^{n-1}$ is a basis of $F(\alpha)$ over $F$, so $[F(\alpha):F]=\deg_F\alpha=n$.
  4. If $\alpha$ is transcendental over $F$, then $F(\alpha)\cong F(x)$, the field of rational functions, and $[F(\alpha):F]=\infty$.

Proof. (1) If $m=gh$ with $g,h$ of smaller positive degree, then $g(\alpha)h(\alpha)=m(\alpha)=0$ in the field $K$, so $g(\alpha)=0$ or $h(\alpha)=0$, contradicting the minimality of $\deg m$. If $g(\alpha)=0$, divide: $g=qm+r$ with $\deg r\lt n$; then $r(\alpha)=0$, so $r=0$ by minimality. If $p$ is monic irreducible with $p(\alpha)=0$, then $m\mid p$, and irreducibility of $p$ forces $p=m$. (2) The evaluation map $\mathrm{ev}_\alpha:F[x]\to K$, $g\mapsto g(\alpha)$, is a ring homomorphism with image $F[\alpha]$ and, by (1), kernel $\langle m\rangle$. So $F[\alpha]\cong F[x]/\langle m\rangle$, which is a field by Theorem 7.40. A field containing $F$ and $\alpha$ contains $F[\alpha]$; and $F[\alpha]$ is itself such a field; hence $F(\alpha)=F[\alpha]$. (3) Transport the basis $1,\theta,\dots,\theta^{n-1}$ of Theorem 7.40(2) through the isomorphism. (4) Now $\mathrm{ev}_\alpha$ is injective, so it extends to the fraction fields: $g/h\mapsto g(\alpha)/h(\alpha)$ is an isomorphism $F(x)\to F(\alpha)$, and $1,\alpha,\alpha^2,\dots$ are independent. ∎

📐 Theorem 7.43 — Consequences of the tower law; Kronecker's theorem
  1. If $[K:F]=n\lt\infty$, then every $\alpha\in K$ is algebraic over $F$ and $\deg_F\alpha$ divides $n$. In particular, if $[K:F]$ is prime, then $K=F(\alpha)$ for every $\alpha\in K\setminus F$, and there is no intermediate field other than $F$ and $K$.
  2. If $\alpha,\beta$ are algebraic over $F$ of degrees $m,n$, then $[F(\alpha,\beta):F]\le mn$, it is divisible by $\operatorname{lcm}(m,n)$, and it equals $mn$ when $\gcd(m,n)=1$.
  3. $[F(\alpha):F]$ does not depend on which polynomial we happen to know $\alpha$ satisfies — only on the irreducible one. If $\alpha$ is a root of an irreducible $g$ of degree $n$, then $[F(\alpha):F]=n$.
  4. Kronecker. Every nonconstant $f\in F[x]$ has a root in some extension $K$ of $F$ with $[K:F]\le\deg f$.

Proof. (1) The $n+1$ elements $1,\alpha,\dots,\alpha^n$ are dependent over $F$, which gives a nonzero polynomial with root $\alpha$. By the tower law $n=[K:F(\alpha)]\,[F(\alpha):F]$, and $[F(\alpha):F]=\deg_F\alpha$. If $n$ is prime and $\alpha\notin F$, then $[F(\alpha):F]\gt1$ divides $n$, so it is $n$, and $F(\alpha)=K$; an intermediate field $L$ has $[L:F]\in\{1,n\}$, i.e. $L=F$ or $L=K$. (2) $\beta$ is a root of $m_{\beta,F}$, which lies in $F(\alpha)[x]$, so $\deg_{F(\alpha)}\beta\le n$ and $[F(\alpha,\beta):F]=[F(\alpha)(\beta):F(\alpha)]\,[F(\alpha):F]\le nm$. Both $m$ and $n$ divide $[F(\alpha,\beta):F]$ by the tower law through $F(\alpha)$ and through $F(\beta)$; if they are coprime, $mn$ divides it, and with the upper bound it equals $mn$. (3) is Theorem 7.42(1),(3). (4) Let $g$ be an irreducible factor of $f$ (it exists because $F[x]$ is a UFD, §7.2). Then $K=F[x]/\langle g\rangle$ is a field of degree $\deg g\le\deg f$ over $F$ in which $\theta$ is a root of $g$, hence of $f$. ∎

🧭 Computing a degree $[K:F]$
  1. Simple extension: find a polynomial with root $\alpha$, prove it irreducible (no roots for degree $\le3$; Eisenstein, possibly after $x\mapsto x+1$; reduction mod $p$), and read off its degree.
  2. Several generators: climb a tower $F\subseteq F(\alpha)\subseteq F(\alpha,\beta)\subseteq\cdots$ and multiply. At each step ask: is the new element already in the field I have? If not, what is its degree over that field (often $2$: show a square root is not in the current field)?
  3. Use divisibility both ways: the degree of every intermediate field divides the total. If $m$ and $n$ both divide $d$ and $d\le mn$ with $\gcd(m,n)=1$, then $d=mn$. A field of degree $d$ contains no element of degree not dividing $d$.
  4. Real versus non-real: if the field so far lies in $\mathbb{R}$ and the new element is non-real and satisfies a quadratic over it, the step has degree exactly $2$.
  5. Look for a primitive element: often $K=F(\alpha+\beta)$, which reduces everything to one minimal polynomial (e.g. $\mathbb{Q}(\sqrt2,\sqrt3)=\mathbb{Q}(\sqrt2+\sqrt3)$).
✏️ Example 2 — Degrees by the tower law
Find (a) $[\mathbb{Q}(\sqrt2,\sqrt3):\mathbb{Q}]$, a basis, and the minimal polynomial of $\sqrt2+\sqrt3$; (b) $[\mathbb{Q}(\sqrt[3]2,\omega):\mathbb{Q}]$; (c) $[\mathbb{Q}(\sqrt2,\sqrt[3]2):\mathbb{Q}]$, and show this field is $\mathbb{Q}(\sqrt[6]2)$; (d) $[\mathbb{Q}(\sqrt[4]2):\mathbb{Q}(\sqrt2)]$.
(a) Tower $[\mathbb{Q}(\sqrt2):\mathbb{Q}]=2$. Is $\sqrt3\in\mathbb{Q}(\sqrt2)$? If $\sqrt3=a+b\sqrt2$ with $a,b\in\mathbb{Q}$, then $3=a^2+2b^2+2ab\sqrt2$, so $ab=0$ (as $\sqrt2\notin\mathbb{Q}$). $b=0$ gives $\sqrt3=a\in\mathbb{Q}$, and $a=0$ gives $\sqrt6=2b\in\mathbb{Q}$ — both false. So $x^2-3$ is irreducible over $\mathbb{Q}(\sqrt2)$ and $[\mathbb{Q}(\sqrt2,\sqrt3):\mathbb{Q}]=2\cdot2=4$, with basis $1,\sqrt2,\sqrt3,\sqrt6$ (products of the two bases, Theorem 7.41).
(a) Primitive element Let $\gamma=\sqrt2+\sqrt3$. Then $\gamma^2=5+2\sqrt6$, so $(\gamma^2-5)^2=24$: $\gamma$ is a root of $x^4-10x^2+1$. Also $\gamma^{-1}=\sqrt3-\sqrt2$ (since $(\sqrt3+\sqrt2)(\sqrt3-\sqrt2)=1$), so $\sqrt3=\tfrac12(\gamma+\gamma^{-1})$ and $\sqrt2=\tfrac12(\gamma-\gamma^{-1})$ lie in $\mathbb{Q}(\gamma)$. Hence $\mathbb{Q}(\gamma)=\mathbb{Q}(\sqrt2,\sqrt3)$ has degree $4$, and the monic quartic $x^4-10x^2+1$ with root $\gamma$ must be the minimal polynomial (degree $4$ = degree of $\gamma$).
(b) $x^3-2$ is irreducible (Eisenstein, $p=2$): $[\mathbb{Q}(\sqrt[3]2):\mathbb{Q}]=3$. The field $\mathbb{Q}(\sqrt[3]2)$ is real and $\omega$ is a non-real root of $x^2+x+1$, so $[\mathbb{Q}(\sqrt[3]2,\omega):\mathbb{Q}(\sqrt[3]2)]=2$. Total $6$. (Or: $3$ and $2$ both divide the degree, which is at most $6$, and $\gcd(2,3)=1$.)
(c) Degrees $2$ and $3$ are coprime, so by Theorem 7.43(2) $[\mathbb{Q}(\sqrt2,\sqrt[3]2):\mathbb{Q}]=6$. With $\beta=\sqrt[6]2$: $\beta^3=\sqrt2$ and $\beta^2=\sqrt[3]2$, so $\mathbb{Q}(\sqrt2,\sqrt[3]2)\subseteq\mathbb{Q}(\beta)$; conversely $\beta=\sqrt2/\sqrt[3]2=2^{1/2-1/3}$. Both fields have degree $6$ ($x^6-2$ is Eisenstein), and they are equal.
(d) $[\mathbb{Q}(\sqrt[4]2):\mathbb{Q}]=4$ ($x^4-2$ is Eisenstein) and $\sqrt2=(\sqrt[4]2)^2\in\mathbb{Q}(\sqrt[4]2)$, so by the tower law $[\mathbb{Q}(\sqrt[4]2):\mathbb{Q}(\sqrt2)]=4/2=2$; the minimal polynomial of $\sqrt[4]2$ over $\mathbb{Q}(\sqrt2)$ is $x^2-\sqrt2$.
Check A computer algebra system confirms that $\sqrt2+\sqrt[3]2$ has a minimal polynomial of degree $6$ over $\mathbb{Q}$ — a primitive element for (c).

Algebraic Extensions and Algebraically Closed Fields

📘 Definition 7.30 — Algebraic extension
An extension $K/F$ is algebraic if every element of $K$ is algebraic over $F$. Otherwise it is transcendental (it contains at least one element transcendental over $F$).
📐 Theorem 7.44 — Finite, finitely generated and algebraic extensions
  1. Every finite extension is algebraic.
  2. If $\alpha_1,\dots,\alpha_k$ are algebraic over $F$, then $F(\alpha_1,\dots,\alpha_k)/F$ is finite, of degree at most $\prod\deg_F\alpha_i$. So: $K/F$ is finite $\iff$ $K$ is generated over $F$ by finitely many algebraic elements.
  3. For any extension $K/F$, the set $\overline{F}_K=\{\alpha\in K:\alpha\text{ algebraic over }F\}$ is a subfield of $K$ — sums, differences, products and quotients of algebraic elements are algebraic. In particular the algebraic numbers $\overline{\mathbb{Q}}\subset\mathbb{C}$ form a field.
  4. Transitivity. If $L/K$ and $K/F$ are algebraic, then $L/F$ is algebraic.
  5. The converse of (1) fails: $\overline{\mathbb{Q}}/\mathbb{Q}$ is algebraic but $[\overline{\mathbb{Q}}:\mathbb{Q}]=\infty$. Moreover $\overline{\mathbb{Q}}$ is countable, so almost all real and complex numbers are transcendental.

Proof. (1) Theorem 7.43(1). (2) Induction along the tower $F\subseteq F(\alpha_1)\subseteq F(\alpha_1,\alpha_2)\subseteq\cdots$: $\alpha_{j}$ is algebraic over $F(\alpha_1,\dots,\alpha_{j-1})$ of degree at most $\deg_F\alpha_j$ (its minimal polynomial over $F$ still works), and degrees multiply. If $K/F$ is finite, a basis generates $K$ and consists of algebraic elements by (1). (3) If $\alpha,\beta$ are algebraic, $F(\alpha,\beta)$ is finite over $F$ by (2), hence algebraic by (1); it contains $\alpha\pm\beta$, $\alpha\beta$ and $\alpha/\beta$ ($\beta\ne0$). (4) Let $\gamma\in L$, with $\gamma^m+c_{m-1}\gamma^{m-1}+\cdots+c_0=0$, $c_j\in K$. Each $c_j$ is algebraic over $F$, so $M=F(c_0,\dots,c_{m-1})$ is finite over $F$, and $[M(\gamma):M]\le m$. Hence $[M(\gamma):F]\lt\infty$ and $\gamma$ is algebraic over $F$ by (1). (5) For each $n$, $x^n-2$ is irreducible (Eisenstein), so $\sqrt[n]2\in\overline{\mathbb{Q}}$ has degree $n$; by Theorem 7.43(1) a finite $[\overline{\mathbb{Q}}:\mathbb{Q}]$ would be divisible by every $n$. Countability: there are countably many polynomials with rational coefficients, each with finitely many roots. ∎

Which specific numbers are transcendental is much harder. Hermite (1873) proved that $e$ is transcendental and Lindemann (1882) that $\pi$ is; we use these as known facts. A useful consequence of (3): if $\alpha$ is transcendental and $\beta$ algebraic, then $\alpha+\beta$ and (for $\beta\ne0$) $\alpha\beta$ are transcendental — otherwise $\alpha=(\alpha+\beta)-\beta$ would be algebraic.

📘 Definition 7.31 — Algebraically closed field; algebraic closure
A field $F$ is algebraically closed if every nonconstant polynomial in $F[x]$ has a root in $F$. An algebraic closure of $F$ is an extension $\overline{F}$ that is algebraic over $F$ and algebraically closed.
📐 Theorem 7.45 — Algebraically closed fields
  1. For a field $F$ the following are equivalent: (i) $F$ is algebraically closed; (ii) every nonconstant $f\in F[x]$ splits into linear factors over $F$; (iii) the irreducible polynomials over $F$ are exactly those of degree $1$; (iv) $F$ has no algebraic extension other than $F$ itself; (v) $F$ has no finite extension of degree $\gt1$.
  2. Fundamental theorem of algebra. $\mathbb{C}$ is algebraically closed. Hence the irreducible polynomials over $\mathbb{R}$ have degree $1$ or $2$.
  3. Every algebraically closed field is infinite. In particular no finite field is algebraically closed.
  4. Every field $F$ has an algebraic closure, unique up to an isomorphism fixing $F$ (Steinitz). The algebraic closure of $\mathbb{Q}$ is the field $\overline{\mathbb{Q}}$ of algebraic numbers: it is algebraically closed, countable, and of infinite degree over $\mathbb{Q}$. $\mathbb{C}$ is algebraically closed but is not an algebraic closure of $\mathbb{Q}$.

Proof. (1) (i)$\Rightarrow$(ii): induct on the degree, splitting off a linear factor $x-a$ for a root $a$ each time. (ii)$\Rightarrow$(iii): an irreducible polynomial that splits has one factor only, of degree $1$. (iii)$\Rightarrow$(iv): if $K/F$ is algebraic and $\alpha\in K$, then $m_{\alpha,F}$ is irreducible, so it is $x-\alpha$ and $\alpha\in F$. (iv)$\Rightarrow$(v): finite extensions are algebraic. (v)$\Rightarrow$(i): a nonconstant $f$ has an irreducible factor $g$, and $F[x]/\langle g\rangle$ is a finite extension of degree $\deg g$; by (v) $\deg g=1$, say $g=c(x-a)$, and $a\in F$ is a root of $f$. (2) The fundamental theorem of algebra is proved in complex analysis via Liouville's theorem (§5.1): a root-free polynomial $f$ would make $1/f$ bounded and entire, hence constant. Over $\mathbb{R}$, the non-real roots of a real polynomial come in conjugate pairs $\lambda,\bar\lambda$, and $(x-\lambda)(x-\bar\lambda)=x^2-2(\operatorname{Re}\lambda)x+|\lambda|^2$ is real; so every real polynomial is a product of real linear and quadratic factors. (3) If $F=\{a_1,\dots,a_q\}$ is finite, the polynomial $f(x)=1+(x-a_1)(x-a_2)\cdots(x-a_q)$ satisfies $f(a_i)=1\ne0$ for all $i$: it has no root in $F$. (4) Existence and uniqueness of algebraic closures use Zorn's lemma (see the 📚 box). For $\overline{\mathbb{Q}}$: if $f\in\overline{\mathbb{Q}}[x]$ is nonconstant, it has a root $\gamma\in\mathbb{C}$ by (2); $\gamma$ is algebraic over $\overline{\mathbb{Q}}$, which is algebraic over $\mathbb{Q}$, so $\gamma$ is algebraic over $\mathbb{Q}$ by transitivity (Theorem 7.44(4)), i.e. $\gamma\in\overline{\mathbb{Q}}$. Countability and infinite degree are Theorem 7.44(5). $\mathbb{C}$ is not algebraic over $\mathbb{Q}$, as $\pi\in\mathbb{C}$. ∎

✏️ Example 3 — Prove or disprove: algebraic elements and algebraically closed fields
(a) Every algebraic extension of $\mathbb{Q}$ is finite. (b) If $\alpha\in\mathbb{C}$ and $\alpha^5+\sqrt2\,\alpha+\sqrt[3]{7}=0$, then $\alpha$ is algebraic over $\mathbb{Q}$ of degree at most $30$. (c) No field $K$ with $[K:\mathbb{Q}]=4$ contains $\sqrt[3]2$. (d) $\pi+\sqrt2$ and $\pi^2$ are transcendental. (e) The field $\overline{\mathbb{Q}}\cap\mathbb{R}$ of real algebraic numbers is algebraically closed. (f) There is an algebraically closed field of characteristic $2$.
(a) False $\overline{\mathbb{Q}}$ is algebraic over $\mathbb{Q}$ of infinite degree; a smaller example is $\mathbb{Q}(\sqrt2,\sqrt3,\sqrt5,\sqrt7,\dots)$ (square roots of all primes), whose degree is infinite because it contains $\mathbb{Q}(\sqrt{p_1},\dots,\sqrt{p_k})$ of degree $2^k$ for every $k$.
(b) True Put $M=\mathbb{Q}(\sqrt2,\sqrt[3]7)$, of degree $2\cdot3=6$ (coprime degrees). Then $\alpha$ is a root of a degree-$5$ polynomial over $M$, so $[M(\alpha):M]\le5$ and $[M(\alpha):\mathbb{Q}]\le30$. Since $\mathbb{Q}(\alpha)\subseteq M(\alpha)$, $\deg_{\mathbb{Q}}\alpha$ divides $[M(\alpha):\mathbb{Q}]$ and is at most $30$.
(c) True $\deg_{\mathbb{Q}}\sqrt[3]2=3$ would have to divide $4$ (Theorem 7.43(1)).
(d) True If $\pi+\sqrt2$ were algebraic, so would be $\pi=(\pi+\sqrt2)-\sqrt2$ (Theorem 7.44(3)). If $\pi^2$ were algebraic, $\pi$ would be a root of $x^2-\pi^2\in\overline{\mathbb{Q}}[x]$, hence algebraic by transitivity.
(e) False $x^2+1$ has rational coefficients and no real root. (Algebraically closed fields cannot be ordered: $-1$ would be a square.)
(f) True The algebraic closure $\overline{\mathbb{F}}_2$ of $\mathbb{F}_2$ exists by Theorem 7.45(4); it has characteristic $2$ (it contains $\mathbb{F}_2$) and it is infinite by Theorem 7.45(3). Concretely it is the union of the increasing chain of finite fields $\mathbb{F}_{2^{1!}}\subseteq\mathbb{F}_{2^{2!}}\subseteq\mathbb{F}_{2^{3!}}\subseteq\cdots$ (see the subfield theorem in the finite-field subsection below).

Splitting Fields

📘 Definition 7.32 — Splitting field
A nonconstant $f\in F[x]$ splits over an extension $K$ if $f=c(x-\alpha_1)\cdots(x-\alpha_n)$ with all $\alpha_i\in K$. A splitting field of $f$ over $F$ is an extension $K$ over which $f$ splits and which is generated by the roots: $K=F(\alpha_1,\dots,\alpha_n)$. For $F\subseteq\mathbb{C}$ it is the subfield of $\mathbb{C}$ generated by $F$ and all complex roots of $f$.
📐 Theorem 7.46 — Existence, size and uniqueness of splitting fields
Let $f\in F[x]$ have degree $n\ge1$.
  1. A splitting field $K$ of $f$ over $F$ exists, and $[K:F]\le n!$. (In fact $[K:F]$ divides $n!$.)
  2. Any two splitting fields of $f$ over $F$ are isomorphic by an isomorphism that fixes $F$ pointwise. So "the" splitting field and its degree are well defined.
  3. If $f$ is irreducible of degree $n$, then $n$ divides $[K:F]$.
  4. The splitting field depends on the base field: $x^2+1$ has splitting field of degree $2$ over $\mathbb{Q}$ and $\mathbb{R}$, but degree $1$ over $\mathbb{C}$ and over $\mathbb{F}_5$.

Proof. (1) Induction on $n$, for all fields at once. By Kronecker (Theorem 7.43(4)) there is $F_1=F(\alpha_1)$ with $f(\alpha_1)=0$ and $[F_1:F]\le n$. Over $F_1$, $f=(x-\alpha_1)g$ with $\deg g=n-1$; by induction $g$ has a splitting field $K$ over $F_1$ with $[K:F_1]\le(n-1)!$. Then $f$ splits over $K$, $K=F_1(\alpha_2,\dots,\alpha_n)=F(\alpha_1,\dots,\alpha_n)$, and $[K:F]\le n\cdot(n-1)!=n!$. (The divisibility needs Galois theory: the automorphisms of $K/F$ permute the roots.) (2) Sketch. One proves more generally: if $\sigma:F\to F'$ is an isomorphism, $f'$ is the image of $f$, and $K,K'$ are splitting fields of $f,f'$, then $\sigma$ extends to an isomorphism $K\to K'$. Take an irreducible factor $g$ of $f$ with root $\alpha\in K$ and a root $\alpha'\in K'$ of the image $g'$; then $F(\alpha)\cong F[x]/\langle g\rangle\cong F'[x]/\langle g'\rangle\cong F'(\alpha')$ extends $\sigma$ (Theorem 7.42(2)), and induction on $[K:F]$ finishes the job. (3) $F(\alpha_1)\subseteq K$ has degree $n$ (Theorem 7.42(3)); apply the tower law. (4) In $\mathbb{F}_5$, $x^2+1=(x-2)(x-3)$. ∎

📐 Theorem 7.47 — Repeated roots and the derivative
For $f\in F[x]$ with formal derivative $f'$:
  1. $f$ has a repeated root in its splitting field iff $f$ and $f'$ have a common factor of positive degree, i.e. $\gcd(f,f')\ne1$ (a gcd computed in $F[x]$).
  2. If $\operatorname{char}F=0$, or $F$ is finite, every irreducible polynomial over $F$ has distinct roots. In characteristic $p$, an irreducible $f$ has a repeated root iff $f'=0$, i.e. $f(x)=g(x^p)$.
  3. For $q=p^n$, the polynomial $x^q-x$ has $q$ distinct roots in its splitting field over $\mathbb{F}_p$.

Proof. (1) If $f=(x-\alpha)^2h$, then $f'=2(x-\alpha)h+(x-\alpha)^2h'$ also vanishes at $\alpha$, so $m_{\alpha,F}$ divides both $f$ and $f'$. Conversely, if $\alpha$ is a common root, write $f=(x-\alpha)h$; then $f'=h+(x-\alpha)h'$ gives $h(\alpha)=0$, so $(x-\alpha)^2\mid f$. Common factors in $F[x]$ have common roots in the splitting field, and conversely the minimal polynomial of a common root is a common factor; the gcd does not change when the field grows, because it is computed by the Euclidean algorithm. (2) If $f$ is irreducible, $\gcd(f,f')$ is $1$ or $f$ (up to a unit); it is $f$ only if $f\mid f'$, which forces $f'=0$ since $\deg f'\lt\deg f$. In characteristic $0$, $f'=0$ means $f$ is constant. In characteristic $p$, $f'=\sum ka_kx^{k-1}=0$ means $a_k=0$ unless $p\mid k$. Over a finite field, $g(x^p)=\sum b_jx^{pj}=\left(\sum b_j^{1/p}x^j\right)^p$ (every element of $\mathbb{F}_q$ is a $p$-th power, Theorem 7.49(3)), which is not irreducible. (3) $(x^q-x)'=qx^{q-1}-1=-1$, coprime to everything. ∎

The standard non-example lives in the infinite field $F=\mathbb{F}_p(t)$: $x^p-t$ is irreducible (Eisenstein at the prime $t$ of $\mathbb{F}_p[t]$), yet $(x^p-t)'=0$, and in its splitting field $x^p-t=(x-t^{1/p})^p$ has a single root of multiplicity $p$. Such inseparable polynomials never occur over $\mathbb{Q}$ or over finite fields, which is why GATE never needs them.

📐 Theorem 7.48 — The splitting fields GATE asks about (over $\mathbb{Q}$)
  1. Quadratics: $x^2+bx+c$ has splitting field $\mathbb{Q}(\sqrt{b^2-4c})$, of degree $1$ or $2$.
  2. Irreducible cubics: if $f$ is an irreducible cubic with discriminant $D$ ($D=-4a^3-27b^2$ for $x^3+ax+b$), its splitting field has degree $3$ if $D$ is the square of a rational number and $6$ otherwise. A reducible cubic has degree $1$ or $2$.
  3. Roots of unity: the splitting field of $x^n-1$ is the cyclotomic field $\mathbb{Q}(\zeta_n)$, and $[\mathbb{Q}(\zeta_n):\mathbb{Q}]=\varphi(n)$ (the minimal polynomial of $\zeta_n$ is the cyclotomic polynomial $\Phi_n$, which is irreducible over $\mathbb{Q}$). For a prime $p$: $\Phi_p=x^{p-1}+\cdots+x+1$ and the degree is $p-1$.
  4. Pure equations: if $p$ is prime and $a\in\mathbb{Q}$ is not a $p$-th power in $\mathbb{Q}$, then $x^p-a$ is irreducible and its splitting field $\mathbb{Q}(\sqrt[p]a,\zeta_p)$ has degree $p(p-1)$. For example $x^3-2$: $6$; $x^5-2$: $20$. Also $x^4-2$ has splitting field $\mathbb{Q}(\sqrt[4]2,i)$ of degree $8$.

Proof. (1) The roots are $\tfrac12(-b\pm\sqrt{b^2-4c})$. (2) Let $\alpha_1,\alpha_2,\alpha_3$ be the roots, $K$ the splitting field. $[\mathbb{Q}(\alpha_1):\mathbb{Q}]=3$ and $f=(x-\alpha_1)g$ over $\mathbb{Q}(\alpha_1)$ with $g$ quadratic, so $[K:\mathbb{Q}]=3$ or $6$ according as $g$ splits over $\mathbb{Q}(\alpha_1)$ or not, i.e. as $\alpha_2-\alpha_3\in\mathbb{Q}(\alpha_1)$ or not (the roots of $g$ are $\alpha_2,\alpha_3=s\pm t$ with $s=\tfrac12(\alpha_2+\alpha_3)$ and $t=\tfrac12(\alpha_2-\alpha_3)$, and $\alpha_2+\alpha_3=-a_2-\alpha_1\in\mathbb{Q}(\alpha_1)$ for $f=x^3+a_2x^2+\cdots$). Now

$$\sqrt D=(\alpha_1-\alpha_2)(\alpha_1-\alpha_3)(\alpha_2-\alpha_3)$$

equals $f'(\alpha_1)\,(\alpha_2-\alpha_3)$, with $f'(\alpha_1)\in\mathbb{Q}(\alpha_1)$ nonzero (distinct roots, Theorem 7.47). So $g$ splits over $\mathbb{Q}(\alpha_1)$ iff $\sqrt D\in\mathbb{Q}(\alpha_1)$. Finally $[\mathbb{Q}(\sqrt D):\mathbb{Q}]\in\{1,2\}$ divides $3$ only if it is $1$: $\sqrt D\in\mathbb{Q}(\alpha_1)$ iff $\sqrt D\in\mathbb{Q}$. (3) The roots of $x^n-1$ are the powers of $\zeta_n$, so the splitting field is $\mathbb{Q}(\zeta_n)$; the irreducibility of $\Phi_n$ is a theorem of Gauss (for prime $n$) and Dedekind (in general) — for $n=p$ prime, Eisenstein applies to $\Phi_p(x+1)$ (§7.2). (4) The roots are $\sqrt[p]a\,\zeta_p^k$, so the splitting field is $\mathbb{Q}(\sqrt[p]a,\zeta_p)$, which contains subfields of degrees $p$ and $p-1$; these are coprime, so the degree is divisible by $p(p-1)$, and it is at most $p(p-1)$ by Theorem 7.43(2). (The irreducibility of $x^p-a$ for prime $p$ is a classical lemma, proved in the 📚 box; for $a=2$ it is Eisenstein.) For $x^4-2$: the roots are $\pm\sqrt[4]2$, $\pm i\sqrt[4]2$, the splitting field is $\mathbb{Q}(\sqrt[4]2,i)$, and $[\mathbb{Q}(\sqrt[4]2):\mathbb{Q}]=4$ with a real field, to which the non-real $i$ adds degree $2$. ∎

✏️ Example 4 — Degrees of splitting fields
Find the degree over $\mathbb{Q}$ of the splitting field of: (a) $x^4+4$; (b) $x^3-3x+1$; (c) $x^3-x-1$; (d) $x^6+x^3+1$; (e) $(x^3-2)(x^2-3)$.
(a) 2 $x^4+4=(x^2+2x+2)(x^2-2x+2)$ with roots $-1\pm i$ and $1\pm i$. All lie in $\mathbb{Q}(i)$, and $i=(1+i)-1$ lies in the splitting field: degree $2$ — not $4$ and not $8$.
(b) 3 No rational root ($\pm1$ give $-1$ and $3$), so it is an irreducible cubic. $D=-4(-3)^3-27\cdot1^2=108-27=81=9^2$, a square: degree $3$. Concretely the roots are $2\cos\frac{2\pi}9$, $2\cos\frac{4\pi}9$, $2\cos\frac{8\pi}9$, and if $\alpha=2\cos\theta$ is one root then $\alpha^2-2=2\cos2\theta$ is another: all three lie in $\mathbb{Q}(\alpha)$.
(c) 6 Irreducible ($\pm1$ give $-1$, $-1$). $D=-4(-1)^3-27=-23$, not a square: degree $6$. (It has one real root and two non-real ones, so $\mathbb{Q}(\alpha_{\text{real}})\subset\mathbb{R}$ cannot contain the others — consistent.)
(d) 6 $(x^3-1)(x^6+x^3+1)=x^9-1$, so the roots of $x^6+x^3+1$ are the primitive $9$-th roots of unity: it is $\Phi_9$ and the splitting field is $\mathbb{Q}(\zeta_9)$, of degree $\varphi(9)=6$.
(e) 12 The splitting field is $K=\mathbb{Q}(\sqrt[3]2,\omega,\sqrt3)$, and $L=\mathbb{Q}(\sqrt[3]2,\omega)$ has degree $6$ (Example 2(b)). If $\sqrt3\in L$, then $L$ would contain $\sqrt3$ and $\sqrt{-3}=2\omega+1$, hence $i=\sqrt{-3}/\sqrt3$ and $\mathbb{Q}(\sqrt3,i)$ of degree $4$ — but $4\nmid6$. So $[K:L]=2$ and $[K:\mathbb{Q}]=12$.

Finite Fields

📘 Definition 7.33 — Frobenius map; primitive element of a finite field
For a field $F$ of characteristic $p$, the Frobenius map is $\phi:F\to F$, $\phi(a)=a^p$. If $F$ is finite, a primitive element of $F$ is a generator of the multiplicative group $F^\times$ — an element whose powers are all the nonzero elements. A monic irreducible polynomial over $\mathbb{F}_p$ whose roots are primitive elements is a primitive polynomial.
📐 Theorem 7.49 — Size of a finite field; the Frobenius automorphism
Let $F$ be a finite field.
  1. $\operatorname{char}F=p$ is prime, $F$ is a vector space over its prime subfield $\mathbb{F}_p$, and $|F|=p^n$ with $n=[F:\mathbb{F}_p]$. There is no field with $6$, $10$, $12$, $\dots$ elements.
  2. Freshman's dream. In characteristic $p$: $(a+b)^p=a^p+b^p$, and hence $(a+b)^{p^k}=a^{p^k}+b^{p^k}$.
  3. The Frobenius map is an automorphism of $F$ fixing $\mathbb{F}_p$ pointwise; so every element of a finite field of characteristic $p$ is a $p$-th power (in characteristic $2$, every element is a square).
  4. The additive group of $F$ is $(\mathbb{Z}_p)^n$ — not cyclic when $n\ge2$.

Proof. (1) A finite field cannot contain $\mathbb{Q}$, so its characteristic is a prime $p$ (Theorem 7.39), and its prime subfield is $\mathbb{F}_p$. As a vector space over $\mathbb{F}_p$ of finite dimension $n$, $F\cong\mathbb{F}_p^n$ has $p^n$ elements. (2) $(a+b)^p=\sum_{k=0}^p\binom pka^kb^{p-k}$, and for $0\lt k\lt p$ the integer $\binom pk=\frac{p!}{k!(p-k)!}$ is divisible by $p$ ($p$ divides the numerator but not the denominator), so those terms vanish. Iterate for $p^k$. (3) $\phi$ preserves products trivially and sums by (2), and $\phi(1)=1$; it is injective (Theorem 7.39(3)), hence surjective on the finite set $F$. It fixes $\mathbb{F}_p$ by Fermat's little theorem $a^p=a$ — or because the set of fixed points is a subfield, which must contain the prime subfield. (4) $F\cong\mathbb{F}_p^n$ as an additive group, and every nonzero element has additive order $p$. ∎

📐 Theorem 7.50 — The multiplicative group of a finite field is cyclic
More generally, every finite subgroup $G$ of the multiplicative group of a field is cyclic. In particular $\mathbb{F}_q^\times\cong\mathbb{Z}_{q-1}$, and:
  1. $\mathbb{F}_q$ has exactly $\varphi(q-1)$ primitive elements, and for each $d\mid q-1$ exactly $\varphi(d)$ elements of order $d$;
  2. the equation $x^k=1$ has exactly $\gcd(k,q-1)$ solutions in $\mathbb{F}_q$;
  3. every $a\in\mathbb{F}_q^\times$ satisfies $a^{q-1}=1$, and every $a\in\mathbb{F}_q$ satisfies $a^q=a$;
  4. for odd $q$, exactly $\tfrac{q-1}2$ elements of $\mathbb{F}_q^\times$ are squares, and $-1$ is a square iff $q\equiv1\pmod4$;
  5. the product of all elements of $\mathbb{F}_q^\times$ is $-1$ (Wilson's theorem for $q=p$), and for $q\gt2$ the sum of all elements of $\mathbb{F}_q$ is $0$.

Proof. Let $|G|=N$ and, for $d\mid N$, let $\psi(d)$ be the number of elements of order $d$ in $G$. If $\psi(d)\ge1$, take $g$ of order $d$: the $d$ distinct powers $1,g,\dots,g^{d-1}$ are roots of $x^d-1$, which has at most $d$ roots in a field, so they are all the roots, and every element of order $d$ is among them. In the cyclic group $\langle g\rangle$ of order $d$ exactly $\varphi(d)$ elements have order $d$ (§7.1). Hence $\psi(d)\in\{0,\varphi(d)\}$, so $\psi(d)\le\varphi(d)$ for all $d\mid N$. Every element has some order dividing $N$ (Lagrange), so

$$N=\sum_{d\mid N}\psi(d)\le\sum_{d\mid N}\varphi(d)=N,$$

using Gauss's identity $\sum_{d\mid N}\varphi(d)=N$ (count the elements of $\mathbb{Z}_N$ by their order). Equality forces $\psi(d)=\varphi(d)$ for every $d$; in particular $\psi(N)=\varphi(N)\ge1$: $G$ has an element of order $N$ and is cyclic. (1) is what we just proved. (2) In a cyclic group of order $N$, the solutions of $x^k=1$ form the unique subgroup of order $\gcd(k,N)$. (3) Lagrange in $\mathbb{F}_q^\times$; multiply by $a$, and note $0^q=0$. (4) With a generator $g$, the squares are the even powers $g^{2j}$, half of the group; $-1$ is the unique element of order $2$, namely $g^{(q-1)/2}$, which is an even power iff $4\mid q-1$. (5) Pair each $a$ with $a^{-1}$; only $a=\pm1$ are their own inverses, so the product is $1\cdot(-1)=-1$ (in characteristic $2$, $-1=1$). The sum: $\sum_{a}a=\sum_a ca$ for any $c\ne0,1$, so $(c-1)\sum a=0$. ∎

📐 Theorem 7.51 — Existence and uniqueness of $\mathbb{F}_{p^n}$
For every prime $p$ and every $n\ge1$ there is a field with $q=p^n$ elements, and any two such fields are isomorphic; we write $\mathbb{F}_q$ (or $\mathrm{GF}(q)$). Precisely: $\mathbb{F}_q$ is the splitting field of $x^q-x$ over $\mathbb{F}_p$, its elements are exactly the $q$ roots of $x^q-x$, and $$x^q-x=\prod_{a\in\mathbb{F}_q}(x-a).$$ If $f$ is any irreducible polynomial of degree $n$ over $\mathbb{F}_p$, then $\mathbb{F}_p[x]/\langle f\rangle\cong\mathbb{F}_{p^n}$.

Proof. Uniqueness. If $|F|=q$, every element is a root of $x^q-x$ (Theorem 7.50(3)), which has at most $q$ roots; so $F$ consists precisely of the $q$ roots, $x^q-x$ splits over $F$ as $\prod_{a\in F}(x-a)$, and $F$ is generated by these roots: $F$ is a splitting field of $x^q-x$ over $\mathbb{F}_p$. Splitting fields are unique up to isomorphism (Theorem 7.46(2)). Existence. Let $K$ be a splitting field of $x^q-x$ over $\mathbb{F}_p$ and $S\subseteq K$ its set of roots. By Theorem 7.47(3), $|S|=q$. $S$ is a subfield: if $a^q=a$ and $b^q=b$, then $(a\pm b)^q=a^q\pm b^q=a\pm b$ (freshman's dream), $(ab)^q=ab$, and $(a^{-1})^q=a^{-1}$. So $S$ is a field with $q$ elements. Finally, $\mathbb{F}_p[x]/\langle f\rangle$ is a field with $p^n$ elements (Theorem 7.40(3)), hence it is $\mathbb{F}_{p^n}$. ∎

📐 Theorem 7.52 — The subfields of $\mathbb{F}_{p^n}$
$\mathbb{F}_{p^n}$ contains a subfield with $p^m$ elements if and only if $m\mid n$, and then exactly one: $\{a:a^{p^m}=a\}$. So the subfields correspond to the divisors of $n$ (there are $d(n)$ of them, $d(n)$ the number of divisors), and $\mathbb{F}_{p^m}\subseteq\mathbb{F}_{p^k}$ inside $\mathbb{F}_{p^n}$ iff $m\mid k$. For instance $\mathbb{F}_{2^{12}}$ has the $6$ subfields $\mathbb{F}_2,\mathbb{F}_4,\mathbb{F}_8,\mathbb{F}_{16},\mathbb{F}_{64},\mathbb{F}_{4096}$, and $\mathbb{F}_8\not\subseteq\mathbb{F}_{16}$.

Proof. If $L\subseteq\mathbb{F}_{p^n}$ has $p^m$ elements, the tower law gives $n=[\mathbb{F}_{p^n}:\mathbb{F}_p]=[\mathbb{F}_{p^n}:L]\cdot m$, so $m\mid n$; and $L$ consists of roots of $x^{p^m}-x$ (Theorem 7.50(3)), of which there are at most $p^m$, so $L=\{a:a^{p^m}=a\}$ is unique. Conversely, if $n=mk$, then $p^m-1$ divides $p^n-1=(p^m)^k-1$, so $x^{p^m-1}-1$ divides $x^{p^n-1}-1$, which splits into distinct linear factors over $\mathbb{F}_{p^n}$. Thus $x^{p^m}-x$ has $p^m$ distinct roots in $\mathbb{F}_{p^n}$, and they form a subfield by the argument in the proof of Theorem 7.51. ∎

📐 Theorem 7.53 — Irreducible polynomials over $\mathbb{F}_q$
Let $q$ be a prime power and $N_q(d)$ the number of monic irreducible polynomials of degree $d$ over $\mathbb{F}_q$.
  1. $x^{q^n}-x$ is the product of all monic irreducible polynomials over $\mathbb{F}_q$ whose degree divides $n$.
  2. Counting degrees: $\displaystyle\sum_{d\mid n}d\,N_q(d)=q^n$, and by Möbius inversion $\displaystyle N_q(n)=\frac1n\sum_{d\mid n}\mu(d)\,q^{n/d}$. For $n$ prime, $N_q(n)=\dfrac{q^n-q}{n}$.
  3. If $f$ is irreducible of degree $n$ over $\mathbb{F}_q$ and $\alpha$ is one root, its roots are $\alpha,\alpha^q,\alpha^{q^2},\dots,\alpha^{q^{n-1}}$, all distinct, and all lie in $\mathbb{F}_q(\alpha)=\mathbb{F}_{q^n}$: an irreducible polynomial over a finite field splits in the field generated by one root. Its splitting field has degree $n$ over $\mathbb{F}_q$.
  4. The elements $\alpha\in\mathbb{F}_{q^n}$ with $\mathbb{F}_q(\alpha)=\mathbb{F}_{q^n}$ number $n\,N_q(n)$: all elements minus those lying in a proper subfield $\mathbb{F}_{q^d}$, $d\mid n$, $d\lt n$.
  5. The automorphisms of $\mathbb{F}_{p^n}$ are $\phi^0,\phi,\dots,\phi^{n-1}$ (powers of Frobenius); they form a cyclic group of order $n$.

Proof. (1) $x^{q^n}-x$ has distinct roots (Theorem 7.47(3)), so it is a product of distinct monic irreducibles. If $f$ is monic irreducible of degree $d$ and $f\mid x^{q^n}-x$, a root $\alpha$ of $f$ lies in $\mathbb{F}_{q^n}$, and $\mathbb{F}_q(\alpha)$ is a subfield of size $q^d$, so $d\mid n$ by Theorem 7.52 (applied to $\mathbb{F}_{q^n}\supseteq\mathbb{F}_q(\alpha)$, comparing degrees over $\mathbb{F}_q$ by the tower law). Conversely, if $d\mid n$, then $K=\mathbb{F}_q[x]/\langle f\rangle$ has $q^d$ elements, so its element $\theta$ satisfies $\theta^{q^d}=\theta$, hence $\theta^{q^n}=\theta$ (apply $a\mapsto a^{q^d}$ repeatedly); thus $f=m_\theta\mid x^{q^n}-x$. (2) Compare degrees in (1); Möbius inversion of $g(n)=\sum_{d\mid n}h(d)$ is $h(n)=\sum_{d\mid n}\mu(d)g(n/d)$. For prime $n$ the divisors are $1$ and $n$: $nN_q(n)=q^n-q$. (3) $a\mapsto a^q$ fixes $\mathbb{F}_q$ and preserves sums and products, so $f(\alpha^{q^j})=f(\alpha)^{q^j}=0$. If $\alpha^{q^i}=\alpha^{q^j}$ with $0\le i\lt j\lt n$, applying $a\mapsto a^{q^{n-j}}$ gives $\alpha^{q^r}=\alpha^{q^n}=\alpha$ with $r=n-j+i$, $0\lt r\lt n$. The elements $a$ with $a^{q^r}=a$ form a subfield containing $\mathbb{F}_q$ and $\alpha$ (same argument as in Theorem 7.51) with at most $q^r\lt q^n$ elements, so it cannot contain $\mathbb{F}_q(\alpha)$, which has $q^n$ elements — a contradiction. So $f$ has the $n$ distinct roots $\alpha^{q^j}$, all in $\mathbb{F}_q(\alpha)$. (4) Each such $\alpha$ has degree $n$, so its minimal polynomial is one of the $N_q(n)$ irreducibles of degree $n$, each of which has $n$ roots in $\mathbb{F}_{q^n}$. (5) Sketch. An automorphism $\sigma$ is determined by $\sigma(g)$ for a primitive element $g$, and $\sigma(g)$ must be a root of $m_{g,\mathbb{F}_p}$, which has $n$ roots $g^{p^j}$; so there are at most $n$ automorphisms, and $\phi^j$, $0\le j\lt n$, are $n$ distinct ones ($\phi^j=\mathrm{id}$ means every element satisfies $a^{p^j}=a$, impossible for $0\lt j\lt n$). Details in the 📚 box. ∎

🧭 The finite-field toolkit for GATE
  1. Sizes: $|F|=p^n$; $\mathbb{F}_p[x]/\langle f\rangle$ has $p^{\deg f}$ elements and is a field iff $f$ is irreducible.
  2. Orders of elements: $\mathbb{F}_q^\times\cong\mathbb{Z}_{q-1}$, so everything is the arithmetic of a cyclic group: $\varphi(q-1)$ generators, $\varphi(d)$ elements of order $d\mid q-1$, $\gcd(k,q-1)$ solutions of $x^k=1$, $\tfrac{q-1}{\gcd(k,q-1)}$ nonzero $k$-th powers.
  3. Subfields: $\mathbb{F}_{p^m}\subseteq\mathbb{F}_{p^n}$ iff $m\mid n$; count with the divisors of $n$, and use inclusion–exclusion over the maximal proper subfields $\mathbb{F}_{p^{n/r}}$, $r$ a prime divisor of $n$.
  4. Irreducibles: $N_q(n)=\frac1n\sum_{d\mid n}\mu(d)q^{n/d}$; for small $n$ just subtract: $N_2(4)=\frac{16-4}{4}=3$.
  5. Arithmetic: represent $\mathbb{F}_{p^n}$ as $\mathbb{F}_p[\alpha]$ with $f(\alpha)=0$; list the powers of a primitive element ("log table") to multiply and invert quickly.
✏️ Example 5 — Arithmetic in $\mathbb{F}_8$
Let $\mathbb{F}_8=\mathbb{F}_2[x]/\langle x^3+x+1\rangle$ and $\alpha=x+\langle x^3+x+1\rangle$. (a) Explain why this is a field with $8$ elements. (b) List the powers of $\alpha$ and show that $\alpha$ is a primitive element. (c) Find $(\alpha^2+1)^{-1}$. (d) Find all roots of $x^3+x+1$ and of $x^3+x^2+1$ in $\mathbb{F}_8$. (e) Does $\mathbb{F}_8$ contain a subfield with $4$ elements?
(a) $x^3+x+1$ takes the value $1$ at both $0$ and $1$, so the cubic has no root in $\mathbb{F}_2$ and is irreducible (Theorem 7.40(4)); the quotient is a field with $2^3=8$ elements $c_0+c_1\alpha+c_2\alpha^2$.
(b) Log table Using $\alpha^3=\alpha+1$ (signs do not matter in characteristic $2$): $$\begin{aligned}\alpha^3&=\alpha+1, & \alpha^4&=\alpha^2+\alpha,\\ \alpha^5&=\alpha^2+\alpha+1, & \alpha^6&=\alpha^2+1,\end{aligned}$$ and $\alpha^7=\alpha^3+\alpha=1$. The seven powers $\alpha^0,\dots,\alpha^6$ are the seven nonzero elements. (Faster: $\mathbb{F}_8^\times$ has prime order $7$, so every element other than $1$ is primitive.)
(c) $\alpha^2+1=\alpha^6$, so its inverse is $\alpha^{-6}=\alpha$. Check: $\alpha(\alpha^2+1)=\alpha^3+\alpha=(\alpha+1)+\alpha=1$ ✓.
(d) By Theorem 7.53(3), the roots of $x^3+x+1$ are $\alpha,\alpha^2,\alpha^4=\alpha^2+\alpha$. The other irreducible cubic $x^3+x^2+1$ is the reciprocal $x^3f(1/x)$, so its roots are the inverses $\alpha^{-1}=\alpha^6$, $\alpha^{-2}=\alpha^5$, $\alpha^{-4}=\alpha^3$, i.e. $\alpha^2+1$, $\alpha^2+\alpha+1$, $\alpha+1$. Check $\alpha+1$: $(\alpha+1)^3=\alpha^3+\alpha^2+\alpha+1$ and $(\alpha+1)^2=\alpha^2+1$, so $(\alpha+1)^3+(\alpha+1)^2+1=\alpha^3+\alpha+1=0$ ✓. Together with the roots $0,1$ of $x^2+x$, these are all eight elements: $x^8-x=x(x+1)(x^3+x+1)(x^3+x^2+1)$ (Theorem 7.53(1)).
(e) No $2\nmid3$ (Theorem 7.52). Directly: a subfield of $4$ elements would make $\mathbb{F}_8$ a vector space over it, of size $4^k\ne8$. The only subfields are $\mathbb{F}_2$ and $\mathbb{F}_8$.
✏️ Example 6 — Counting in finite fields
(a) How many monic irreducible polynomials of degree $4$ are there over $\mathbb{F}_2$? List them. (b) How many primitive elements does $\mathbb{F}_{16}$ have, and how many of the quartics in (a) are primitive polynomials? (c) How many elements $\alpha\in\mathbb{F}_{64}$ satisfy $\mathbb{F}_2(\alpha)=\mathbb{F}_{64}$, and how many monic irreducible sextics are there over $\mathbb{F}_2$? (d) How many solutions does $x^{10}=1$ have in $\mathbb{F}_{31}$ and in $\mathbb{F}_{27}$?
(a) 3 $4N_2(4)+2N_2(2)+N_2(1)=16$ with $N_2(1)=2$, $N_2(2)=1$: $N_2(4)=\tfrac{16-2-2}{4}=3$. They are $x^4+x+1$, $x^4+x^3+1$ and $x^4+x^3+x^2+x+1$ (the quartics with constant term $1$, an odd number of terms — so no root — other than $(x^2+x+1)^2=x^4+x^2+1$).
(b) 8 and 2 $\varphi(15)=8$ primitive elements; each primitive polynomial of degree $4$ accounts for $4$ of them, so there are $8/4=2$. Indeed $x^4+x^3+x^2+x+1=\dfrac{x^5-1}{x-1}$ has roots of order $5$ (the $\varphi(5)=4$ elements of order $5$), while $x^4+x+1$ and $x^4+x^3+1$ are primitive.
(c) 54 and 9 The proper subfields of $\mathbb{F}_{64}$ are $\mathbb{F}_2,\mathbb{F}_4,\mathbb{F}_8$, and $\mathbb{F}_4\cap\mathbb{F}_8=\mathbb{F}_2$, so $|\mathbb{F}_4\cup\mathbb{F}_8|=4+8-2=10$ and $64-10=54$ elements generate $\mathbb{F}_{64}$. Each irreducible sextic has $6$ of them as roots: $N_2(6)=54/6=9$. (Möbius: $\tfrac16(64-8-4+2)=9$ ✓.)
(d) 10 and 2 $\gcd(10,30)=10$ and $\gcd(10,26)=2$ (Theorem 7.50(2)). In $\mathbb{F}_{27}$ the only solutions are $\pm1$.
✏️ Example 7 — Prove or disprove: finite fields
(a) $\mathbb{Z}_4$ is a field with four elements. (b) For every prime power $q$ and every $n\ge1$ there is an irreducible polynomial of degree $n$ over $\mathbb{F}_q$. (c) An infinite field cannot have characteristic $p$. (d) In $\mathbb{F}_{3^5}$, the map $a\mapsto a^3$ is a field automorphism, but $a\mapsto a^2$ is not even additive. (e) The polynomial $x^4+1$ is irreducible over $\mathbb{Q}$, so it is irreducible over $\mathbb{F}_3$.
(a) False $2\cdot2=0$ in $\mathbb{Z}_4$: a zero divisor. The field with four elements is $\mathbb{F}_4=\mathbb{F}_2[\alpha]$, $\alpha^2=\alpha+1$, whose additive group is $\mathbb{Z}_2\times\mathbb{Z}_2$, not $\mathbb{Z}_4$.
(b) True $\mathbb{F}_{q^n}$ exists (Theorem 7.51); a primitive element $g$ of it generates it over $\mathbb{F}_q$, so $m_{g,\mathbb{F}_q}$ is irreducible of degree $[\mathbb{F}_{q^n}:\mathbb{F}_q]=n$. (Or: $N_q(n)\ge\frac1n\left(q^n-\sum_{d\le n/2}q^d\right)\gt0$.)
(c) False $\mathbb{F}_p(t)$ (rational functions) and $\overline{\mathbb{F}}_p$ are infinite of characteristic $p$.
(d) True $a\mapsto a^3$ is the Frobenius automorphism (Theorem 7.49(3)). $(1+1)^2=4=1$ but $1^2+1^2=2$ in characteristic $3$.
(e) False Over $\mathbb{F}_3$: $x^4+1=(x^2+x+2)(x^2+2x+2)$. Expanding, the product is $x^4+3x^3+6x^2+6x+4$, and modulo $3$ this is $x^4+1$ ✓. In fact $x^4+1$ is reducible modulo every prime (its roots have order $8$, and $8\mid p^2-1$ for every odd $p$, so they lie in $\mathbb{F}_{p^2}$), although it is irreducible over $\mathbb{Q}$. Irreducibility mod $p$ implies irreducibility over $\mathbb{Q}$ (for monic integer polynomials), not conversely.
⚠️ Counterexamples and pitfalls
  1. Algebraic does not mean finite. $\overline{\mathbb{Q}}/\mathbb{Q}$ and $\mathbb{Q}(\sqrt2,\sqrt3,\sqrt5,\dots)/\mathbb{Q}$ are algebraic of infinite degree. Finite $\Rightarrow$ algebraic, not conversely.
  2. Degrees of compositums do not simply multiply. $[\mathbb{Q}(\sqrt2,\sqrt8):\mathbb{Q}]=2$, not $4$; $[\mathbb{Q}(\sqrt[3]2,\omega\sqrt[3]2):\mathbb{Q}]=6$, not $9$. The product $mn$ is an upper bound, attained for coprime degrees.
  3. The degree of $\alpha$ is the degree of its minimal polynomial. $\sqrt2$ is a root of $x^4-4$, but $\deg\sqrt2=2$; $1+i$ is a root of $x^4+4$, but has degree $2$.
  4. The minimal polynomial depends on the base field: $\sqrt2+\sqrt3$ has degree $4$ over $\mathbb{Q}$ and $2$ over $\mathbb{Q}(\sqrt2)$ (minimal polynomial $x^2-2\sqrt2x-1$).
  5. "No roots" proves irreducibility only in degrees $2$ and $3$: $x^4+4$ over $\mathbb{Q}$ and $x^4+x^2+1=(x^2+x+1)^2$ over $\mathbb{F}_2$ have no roots but factor.
  6. Isomorphic as vector spaces $\ne$ isomorphic as fields. $\mathbb{Q}(\sqrt2)$ and $\mathbb{Q}(\sqrt3)$ both have degree $2$, but a field isomorphism would send $\sqrt2$ to an element of $\mathbb{Q}(\sqrt3)$ with square $2$, and there is none.
  7. $\mathbb{F}_4\ne\mathbb{Z}_4$, and $\mathbb{F}_{p^n}\ne\mathbb{Z}_{p^n}$ for $n\ge2$. $\mathbb{Z}_{p^n}$ has zero divisors.
  8. $\mathbb{F}_{p^m}\subseteq\mathbb{F}_{p^n}$ needs $m\mid n$, not $m\le n$: $\mathbb{F}_4\not\subseteq\mathbb{F}_8$, $\mathbb{F}_8\not\subseteq\mathbb{F}_{16}$.
  9. Cyclic multiplicatively, not additively. $\mathbb{F}_q^\times\cong\mathbb{Z}_{q-1}$, but $(\mathbb{F}_{p^n},+)\cong\mathbb{Z}_p^n$.
  10. A root of an irreducible polynomial need not be primitive: $x^2+1$ is irreducible over $\mathbb{F}_3$, but its root $i$ in $\mathbb{F}_9$ has order $4$, not $8$; $x^4+x^3+x^2+x+1$ over $\mathbb{F}_2$ has roots of order $5$ in $\mathbb{F}_{16}$.
  11. Irreducible over $\mathbb{Q}$ does not mean irreducible mod $p$: $x^4+1$ factors modulo every prime.
  12. Characteristic $p$ does not mean finite: $\mathbb{F}_p(t)$, $\overline{\mathbb{F}}_p$. And over $\mathbb{F}_p(t)$ the irreducible $x^p-t$ has only one root (multiplicity $p$).
  13. Algebraically closed fields are infinite — no finite field is algebraically closed ($1+\prod_a(x-a)$ has no root) — and $\mathbb{C}$ is not the algebraic closure of $\mathbb{Q}$ ($\overline{\mathbb{Q}}$ is, and it is countable). $\mathbb{R}$ and $\overline{\mathbb{Q}}\cap\mathbb{R}$ are not algebraically closed.
  14. The splitting field depends on the base field and on the factors: $x^4+4$ has splitting field of degree $2$ over $\mathbb{Q}$, $x^4-2$ degree $8$, $x^4+1$ degree $4$; over $\mathbb{F}_q$ every irreducible of degree $n$ has splitting field of degree exactly $n$.
  15. $N_q(n)\ne\frac{q^n-q}{n}$ in general. That formula holds for prime $n$; for $n=4$, $q=2$ it gives $\tfrac{16-2}{4}$, not even an integer — Möbius gives the correct $\tfrac14(16-4)=3$.
📚 Go deeper — full proofs in the CSIR NET course
  • CSIR Unit 2 · §8.1 Field Extensions and Splitting Fields — the tower law and Kronecker's theorem in detail, extension of isomorphisms and the complete uniqueness proof for splitting fields, existence of algebraic closures, ruler-and-compass constructions, the irreducibility of $x^p-a$, separability, perfect fields and the primitive element theorem.
  • CSIR Unit 2 · §8.2 Finite Fields — full proofs of existence and uniqueness of $\mathbb{F}_{p^n}$, cyclicity of $\mathbb{F}_q^\times$, the subfield lattice, factorisation of $x^{q^n}-x$, the automorphism group, cyclotomic polynomials mod $p$, and the trace map with quadratics in characteristic $2$.
  • CSIR Unit 2 · §8.3 Galois Theory — automorphisms and fixed fields, normal and Galois extensions, the fundamental theorem, why $[K:F]$ divides $n!$, the discriminant criterion for cubics via $A_3$, and solvability by radicals.

Two Labs

Interactive 1 — The Clock of $\mathbb{F}_q^\times$: Orders and Primitive Elements

The $q-1$ nonzero elements of $\mathbb{F}_q$ sit round a clock in the order $g_0^0,g_0^1,g_0^2,\dots$ of a fixed primitive element $g_0$ — possible because $\mathbb{F}_q^\times$ is cyclic. Choose $s$ and watch the powers of $g=g_0^s$ jump $s$ places at a time. They return to $1$ after $\operatorname{ord}(g)=\dfrac{q-1}{\gcd(s,q-1)}$ steps, tracing a star polygon through the unique subgroup of that order; $g$ is primitive exactly when the star visits every element. For $\mathbb{F}_8,\mathbb{F}_9,\mathbb{F}_{16},\mathbb{F}_{25}$ the elements are written as polynomials in a root of the defining polynomial. Press Play to step through the powers and then through the values of $s$.

g = g₀ˢ—
ord(g)—
primitive?—
φ(q − 1) generators—
Interactive 2 — Building a Splitting Field One Root at a Time

Left: the complex roots of a polynomial over $\mathbb{Q}$. Roots that already lie in the current field $K$ are green, the others hollow; the root just adjoined is ringed in red. Right: the tower $\mathbb{Q}\subseteq K_1\subseteq K_2\subseteq\cdots$ with the degree of each step — the degree of the new root over the field below it — and the running product (tower law). Adjoining one root often brings others for free; the final field is the splitting field. Compare $x^4-10x^2+1$ with $(x^2-2)(x^2-3)$: different towers, the same field.

current field K—
this step—
[K : ℚ]—
roots in K—

Exercises

I
Fields, quotient fields and degrees.
  • 1 Show that $\mathbb{Z}_n$ is a field if and only if $n$ is prime, and that a finite integral domain is a field.
  • 2 Which of these are fields? Give the number of elements of the finite ones. (a) $\mathbb{Z}_3[x]/\langle x^3+2x+1\rangle$; (b) $\mathbb{Z}_2[x]/\langle x^3+x^2+x+1\rangle$; (c) $\mathbb{Q}[x]/\langle x^2-2x-1\rangle$; (d) $\mathbb{R}[x]/\langle x^2+4\rangle$; (e) $\mathbb{Z}_5[x]/\langle x^2+x+1\rangle$.
  • 3 With $a=\sqrt[3]2$, find $(1+a+a^2)^{-1}$ in the form $c_0+c_1a+c_2a^2$.
  • 4 Find $[\mathbb{Q}(\sqrt2,\sqrt3,\sqrt5):\mathbb{Q}]$. (You may use that $\sqrt5\notin\mathbb{Q}(\sqrt2,\sqrt3)$; prove it if you can.)
  • 5 Find $[\mathbb{Q}(\sqrt[4]2,i):\mathbb{Q}]$ and $[\mathbb{Q}(\sqrt[4]2,i):\mathbb{Q}(i)]$.
  • 6 Show that $[\mathbb{C}:\mathbb{R}]=2$ and that there is no field $K$ with $\mathbb{R}\subsetneq K\subsetneq\mathbb{C}$.
  • 7 Let $[K:F]=p$ be prime. Show that $K=F(\alpha)$ for every $\alpha\in K\setminus F$.
  • 8 Show that $\mathbb{Q}(\sqrt2)$ and $\mathbb{Q}(\sqrt3)$ are not isomorphic as fields. Are $\mathbb{Q}(\sqrt2)$ and $\mathbb{Q}(\sqrt8)$?
  • 9 Prove that $[\mathbb{Q}(\sqrt2+\sqrt[3]2):\mathbb{Q}]=6$ without computing a minimal polynomial. (Hint: show $\mathbb{Q}(\sqrt2+\sqrt[3]2)$ has degree divisible by $2$ and by $3$ — or show $\sqrt2,\sqrt[3]2$ lie in it.)
1 If $n=rs$ with $1\lt r,s\lt n$, then $rs=0$ in $\mathbb{Z}_n$: zero divisors. If $n=p$ is prime and $p\nmid a$, then $\gcd(a,p)=1$ and Bézout gives $ua+vp=1$, so $u$ is the inverse of $a$. A finite integral domain $D$: for $a\ne0$, $x\mapsto ax$ is injective (cancellation), hence surjective, so $ax=1$ is solvable.
2 (a) Field, $27$ elements: $f(0)=1$, $f(1)=4=1$, $f(2)=13=1$, so the cubic has no root in $\mathbb{Z}_3$. (b) Not: $x^3+x^2+x+1=(x+1)(x^2+1)=(x+1)^3$ over $\mathbb{Z}_2$. (c) Field: the roots $1\pm\sqrt2$ are irrational, so the quadratic is irreducible over $\mathbb{Q}$; it is $\mathbb{Q}(\sqrt2)$. (d) Field, isomorphic to $\mathbb{C}$ ($\theta\mapsto2i$). (e) Field, $25$ elements: $x^2+x+1$ takes the values $1,3,2,3,1$ at $0,\dots,4$ — no root.
3 $(a-1)(a^2+a+1)=a^3-1=1$, so $(1+a+a^2)^{-1}=a-1=-1+\sqrt[3]2$.
4 $8$. $[\mathbb{Q}(\sqrt2,\sqrt3):\mathbb{Q}]=4$ (Example 2). If $\sqrt5=a+b\sqrt3$ with $a,b\in\mathbb{Q}(\sqrt2)$, squaring gives $ab=0$ (as $\sqrt3\notin\mathbb{Q}(\sqrt2)$), so $\sqrt5\in\mathbb{Q}(\sqrt2)$ or $\sqrt{15}=3b\in\mathbb{Q}(\sqrt2)$; each is excluded by the same argument one level down ($\sqrt5=c+d\sqrt2$ forces $\sqrt5$ or $\sqrt{10}$ rational). So the last step has degree $2$: total $8$.
5 $8$ and $4$. $[\mathbb{Q}(\sqrt[4]2):\mathbb{Q}]=4$ with a real field, and $i$ adds degree $2$: total $8$. Then $[\mathbb{Q}(\sqrt[4]2,i):\mathbb{Q}(i)]=8/2=4$, so $x^4-2$ stays irreducible over $\mathbb{Q}(i)$.
6 $1,i$ is a basis. An intermediate $K$ has $[K:\mathbb{R}]\in\{1,2\}$ dividing $2$; degree $1$ gives $K=\mathbb{R}$, degree $2$ gives $K=\mathbb{C}$ by the tower law ($[\mathbb{C}:K]=1$).
7 $[F(\alpha):F]$ divides $p$ and is $\gt1$ since $\alpha\notin F$; so it is $p$, and $[K:F(\alpha)]=1$.
8 An isomorphism $\sigma:\mathbb{Q}(\sqrt2)\to\mathbb{Q}(\sqrt3)$ fixes $\mathbb{Q}$ (it fixes $1$), so $\sigma(\sqrt2)^2=2$; but $(a+b\sqrt3)^2=2$ forces $ab=0$ and then $a^2=2$ or $3b^2=2$, impossible in $\mathbb{Q}$. $\mathbb{Q}(\sqrt8)=\mathbb{Q}(\sqrt2)$ since $\sqrt8=2\sqrt2$ — equal, not just isomorphic.
9 Let $\gamma=\sqrt2+\sqrt[3]2$ and $M=\mathbb{Q}(\gamma)\subseteq L=\mathbb{Q}(\sqrt2,\sqrt[3]2)$, $[L:\mathbb{Q}]=6$. From $(\gamma-\sqrt2)^3=2$: $\gamma^3+6\gamma-2=\sqrt2\,(3\gamma^2+2)$, so $\sqrt2=\dfrac{\gamma^3+6\gamma-2}{3\gamma^2+2}\in M$ (the denominator is positive, hence nonzero), and then $\sqrt[3]2=\gamma-\sqrt2\in M$. So $M=L$ has degree $6$.
II
Minimal polynomials and algebraic extensions.
  • 1 Find the minimal polynomial of $\sqrt2+\sqrt5$ over $\mathbb{Q}$.
  • 2 Find the minimal polynomial of $\sqrt2+\sqrt3$ over $\mathbb{Q}(\sqrt2)$ and over $\mathbb{Q}(\sqrt6)$.
  • 3 Show that $\alpha=2\cos\frac{2\pi}7$ is a root of $x^3+x^2-2x-1$ (use $\zeta=\zeta_7$, $\alpha=\zeta+\zeta^{-1}$ and $1+\zeta+\cdots+\zeta^6=0$) and deduce $[\mathbb{Q}(\cos\frac{2\pi}7):\mathbb{Q}]=3$.
  • 4 Find the minimal polynomial of $\zeta_{12}=e^{i\pi/6}$ over $\mathbb{Q}$ and $[\mathbb{Q}(\zeta_{12}):\mathbb{Q}]$.
  • 5 Find the minimal polynomial of $1+\sqrt[3]2$ over $\mathbb{Q}$, and prove that it is irreducible.
  • 6 Prove or disprove: if $\alpha^3$ is algebraic over $\mathbb{Q}$, then $\alpha$ is; if $\alpha+\beta$ and $\alpha\beta$ are algebraic, then $\alpha$ and $\beta$ are; if $\alpha+\beta$ is algebraic, then $\alpha$ and $\beta$ are.
  • 7 Can $\sqrt[3]2$ lie in a field $K$ with $[K:\mathbb{Q}]=8$? Can $\sqrt2$ lie in a field of degree $9$? Can $\sqrt[3]2$ lie in a field of degree $12$?
  • 8 Show that $\cos1^\circ$ is algebraic, and that $\mathbb{Q}(\pi)$ is isomorphic to the field $\mathbb{Q}(x)$ of rational functions.
  • 9 Let $\alpha$ be algebraic over $F$ of odd degree. Show that $F(\alpha)=F(\alpha^2)$.
1 $\gamma^2=7+2\sqrt{10}$, so $(\gamma^2-7)^2=40$: $x^4-14x^2+9$. As in Example 2, $\mathbb{Q}(\gamma)=\mathbb{Q}(\sqrt2,\sqrt5)$ has degree $4$ ($\gamma^{-1}=\tfrac13(\sqrt5-\sqrt2)$), so this monic quartic is the minimal polynomial.
2 Over $\mathbb{Q}(\sqrt2)$: $(x-\sqrt2)^2=3$, i.e. $x^2-2\sqrt2\,x-1$ (degree $2=4/2$). Over $\mathbb{Q}(\sqrt6)$: $\gamma^2=5+2\sqrt6\in\mathbb{Q}(\sqrt6)$, so $x^2-(5+2\sqrt6)$; it is irreducible since $\gamma\notin\mathbb{Q}(\sqrt6)$ (otherwise $\mathbb{Q}(\gamma)$ of degree $4$ would sit in a field of degree $2$).
3 $\alpha^2=\zeta^2+2+\zeta^{-2}$ and $\alpha^3=\zeta^3+3\zeta+3\zeta^{-1}+\zeta^{-3}$. Then $\alpha^3+\alpha^2-2\alpha-1$ equals $(\zeta^3+\zeta^{-3})+(\zeta^2+\zeta^{-2})+(\zeta+\zeta^{-1})+1$, which is $\sum_{k=0}^6\zeta^k=0$ (using $\zeta^{-k}=\zeta^{7-k}$). The cubic has no rational root ($\pm1$ give $-1$, $1$), so it is irreducible, and $\mathbb{Q}(\cos\frac{2\pi}7)=\mathbb{Q}(\alpha)$ has degree $3$.
4 $\Phi_{12}=x^4-x^2+1$: indeed $\zeta^2=e^{i\pi/3}$ is a root of $y^2-y+1$. Degree $\varphi(12)=4$. Check irreducibility: $\mathbb{Q}(\zeta_{12})=\mathbb{Q}(i,\sqrt3)$ (since $\zeta_{12}=\tfrac{\sqrt3}2+\tfrac i2$), which has degree $4$.
5 $(x-1)^3=2$: $x^3-3x^2+3x-3$, Eisenstein at $p=3$. (Or: $\mathbb{Q}(1+\sqrt[3]2)=\mathbb{Q}(\sqrt[3]2)$ has degree $3$.)
6 True: $\alpha$ is a root of $x^3-\alpha^3$ over $\overline{\mathbb{Q}}$; transitivity. True: $\alpha,\beta$ are the roots of $x^2-(\alpha+\beta)x+\alpha\beta$, whose coefficients are algebraic. False: $\alpha=\pi$, $\beta=-\pi$.
7 No ($3\nmid8$); no ($2\nmid9$); yes, e.g. $K=\mathbb{Q}(\sqrt[3]2,\sqrt[4]2)=\mathbb{Q}(\sqrt[12]2)$ of degree $12$, which contains $\sqrt[3]2=(\sqrt[12]2)^4$.
8 $\cos1^\circ=\tfrac12(\zeta+\zeta^{-1})$ with $\zeta=e^{2\pi i/360}$ a root of $x^{360}-1$; sums and products of algebraic numbers are algebraic. $\pi$ is transcendental (Lindemann), so Theorem 7.42(4) gives $\mathbb{Q}(\pi)\cong\mathbb{Q}(x)$.
9 $F(\alpha^2)\subseteq F(\alpha)$ and $\alpha$ is a root of $x^2-\alpha^2\in F(\alpha^2)[x]$, so $[F(\alpha):F(\alpha^2)]\in\{1,2\}$. It divides the odd number $[F(\alpha):F]$, so it is $1$.
III
Splitting fields and algebraically closed fields.
  • 1 Find the degree of the splitting field of $x^4-2$ over $\mathbb{Q}$, over $\mathbb{Q}(i)$ and over $\mathbb{R}$.
  • 2 Find the degree of the splitting field of $x^4+1$ over $\mathbb{Q}$ and over $\mathbb{F}_3$.
  • 3 Find the degree over $\mathbb{Q}$ of the splitting field of $x^6-1$, of $x^4+x^2+1$, and of $x^8-1$.
  • 4 Find the degree over $\mathbb{Q}$ of the splitting field of $x^3-7x+7$ and of $x^3+3x+1$.
  • 5 Find the degree over $\mathbb{Q}$ of the splitting field of $x^5-2$ and of $(x^2-2)(x^2-3)(x^2-6)$.
  • 6 Show that $x^3-2$ is irreducible over $\mathbb{F}_7$ and find the degree of its splitting field over $\mathbb{F}_7$. Compare with Example 2(b).
  • 7 Show that every algebraically closed field is infinite, and that $\mathbb{R}$ is not algebraically closed. Is $\mathbb{Q}(i)$?
  • 8 Let $F$ be algebraically closed and $K/F$ algebraic. Show that $K=F$, and deduce that $\mathbb{C}$ has no finite extension of degree $\gt1$.
  • 9 Prove or disprove: (a) $\overline{\mathbb{Q}}$ is countable; (b) every subfield of $\mathbb{C}$ containing $\overline{\mathbb{Q}}$ is algebraically closed; (c) the algebraic closure of $\mathbb{F}_p$ is a finite extension of $\mathbb{F}_p$.
1 $8$ over $\mathbb{Q}$ (Theorem 7.48(4)); $4$ over $\mathbb{Q}(i)$ (the splitting field is still $\mathbb{Q}(\sqrt[4]2,i)$, and $8/2=4$); $2$ over $\mathbb{R}$ (the splitting field is $\mathbb{R}(i)=\mathbb{C}$).
2 Over $\mathbb{Q}$: $4$ — the roots are $\zeta_8^{1,3,5,7}$, all powers of $\zeta_8$, and $[\mathbb{Q}(\zeta_8):\mathbb{Q}]=\varphi(8)=4$; $\mathbb{Q}(\zeta_8)=\mathbb{Q}(i,\sqrt2)$. Over $\mathbb{F}_3$: $x^4+1=(x^2+x+2)(x^2+2x+2)$, both quadratics split in $\mathbb{F}_9$ (its elements of order $8$, since $8=9-1$): degree $2$.
3 $x^6-1=(x^2-1)(x^2+x+1)(x^2-x+1)$: splitting field $\mathbb{Q}(\omega)$, degree $2$. $x^4+x^2+1=(x^2+x+1)(x^2-x+1)$: also $\mathbb{Q}(\omega)=\mathbb{Q}(\sqrt{-3})$, degree $2$. $x^8-1$: $\mathbb{Q}(\zeta_8)$, degree $4$.
4 $x^3-7x+7$: irreducible (Eisenstein at $7$), $D=-4(-7)^3-27\cdot49$, which is $1372-1323=49=7^2$: degree $3$. $x^3+3x+1$: no rational root ($\pm1$ give $5,-3$), $D=-4\cdot27-27=-135$, not a square: degree $6$.
5 $x^5-2$: $5\cdot4=20$. $(x^2-2)(x^2-3)(x^2-6)$: the splitting field is $\mathbb{Q}(\sqrt2,\sqrt3)$, which already contains $\sqrt6=\sqrt2\sqrt3$: degree $4$.
6 The cubes in $\mathbb{F}_7$ are $0,1,6$ ($1^3=1$, $2^3=1$, $3^3=6$, $4^3=1$, $5^3=6$, $6^3=6$), so $2$ is not a cube and $x^3-2$ has no root: irreducible. By Theorem 7.53(3) one root generates $\mathbb{F}_{7^3}$, which contains all three: degree $3$ — over $\mathbb{Q}$ it was $6$, because over a finite field the "missing" $\omega$ is already in $\mathbb{F}_{7}$ ($3\mid7-1$).
7 Theorem 7.45(3): for $F=\{a_1,\dots,a_q\}$, $1+\prod(x-a_i)$ has no root. $\mathbb{R}$: $x^2+1$. $\mathbb{Q}(i)$: no — $x^2-2$ has no root there ($\mathbb{Q}(i)\ne\mathbb{Q}(\sqrt2)$; or $\mathbb{Q}(i)$ is countable of degree $2$ while $\overline{\mathbb{Q}}$ has infinite degree).
8 For $\alpha\in K$, $m_{\alpha,F}$ is irreducible over the algebraically closed $F$, hence linear: $m_{\alpha,F}=x-\alpha$, so $\alpha\in F$. A finite extension of $\mathbb{C}$ is algebraic, hence equal to $\mathbb{C}$: $\mathbb{C}$ has no extension of finite degree $\gt1$.
9 (a) True (Theorem 7.44(5)). (b) False: take $\overline{\mathbb{Q}}(\pi)$; it contains $\overline{\mathbb{Q}}$, but $x^2-\pi$ has no root in it (a root $\sqrt\pi=g(\pi)/h(\pi)$ with $g,h\in\overline{\mathbb{Q}}[x]$ would give $g(\pi)^2=\pi h(\pi)^2$, a polynomial identity in the transcendental $\pi$ over $\overline{\mathbb{Q}}$ that is impossible by comparing degrees). (c) False: it is infinite (Theorem 7.45(3)), and an extension of finite degree $n$ of $\mathbb{F}_p$ is finite, with $p^n$ elements.
IV
Finite fields.
  • 1 Construct $\mathbb{F}_4=\mathbb{F}_2[\alpha]$ with $\alpha^2=\alpha+1$. Write its multiplication table and show that its additive group is not cyclic.
  • 2 In $\mathbb{F}_8=\mathbb{F}_2[\alpha]$, $\alpha^3=\alpha+1$, compute $(\alpha^2+\alpha)^{-1}$ and $\alpha^{10}$.
  • 3 In $\mathbb{F}_9=\mathbb{F}_3[i]$, $i^2=-1$, find the order of $i$ and all primitive elements.
  • 4 Find the number of monic irreducible polynomials of degree $2$ and of degree $3$ over $\mathbb{F}_5$.
  • 5 How many elements $\alpha\in\mathbb{F}_{2^{12}}$ satisfy $\mathbb{F}_2(\alpha)=\mathbb{F}_{2^{12}}$? Deduce $N_2(12)$.
  • 6 Show that $\phi(a)=a^p$ is an automorphism of $\mathbb{F}_{p^n}$ of order exactly $n$, with fixed field $\mathbb{F}_p$.
  • 7 How many elements of $\mathbb{F}_{125}^\times$ are squares? Is $-1$ a square in $\mathbb{F}_{125}$? In $\mathbb{F}_{49}$?
  • 8 Show that the product of all nonzero elements of $\mathbb{F}_q$ is $-1$ and the sum of all elements is $0$ for $q\gt2$. Check both in $\mathbb{F}_8$ with the log table of Example 5.
  • 9 Show that $x^4+x+1$ is irreducible over $\mathbb{F}_2$ and that its roots are primitive elements of $\mathbb{F}_{16}$.
  • 10 Applied. A Reed–Solomon code used in a storage system works over $\mathbb{F}_{16}$ and needs an element $\beta$ of order exactly $5$ to define a short code of length $5$. How many choices of $\beta$ are there, and what is the minimal polynomial of each over $\mathbb{F}_2$?
1 Elements $0,1,\alpha,\alpha+1$. Products: $\alpha\cdot\alpha=\alpha+1$, $\alpha(\alpha+1)=\alpha^2+\alpha=1$, $(\alpha+1)^2=\alpha^2+1=\alpha$; everything times $1$ is itself and times $0$ is $0$. Every element satisfies $a+a=0$, so no element has additive order $4$: $(\mathbb{F}_4,+)\cong\mathbb{Z}_2\times\mathbb{Z}_2$.
2 $\alpha^2+\alpha=\alpha^4$, so $(\alpha^2+\alpha)^{-1}=\alpha^3=\alpha+1$ (check: $(\alpha^2+\alpha)(\alpha+1)=\alpha^3+\alpha=1$). $\alpha^{10}=\alpha^{10-7}=\alpha^3=\alpha+1$.
3 $i^2=-1$, $i^4=1$: order $4$, not primitive. $\varphi(8)=4$ primitive elements: $1+i$, $1+2i$, $2+i$, $2+2i$. E.g. $(1+i)^2=2i$, $(1+i)^4=(2i)^2=-4=2=-1\ne1$, so the order of $1+i$ is $8$. The remaining nonzero elements $\pm1,\pm i$ have orders $1,2,4,4$.
4 $N_5(2)=\tfrac{25-5}2=10$, $N_5(3)=\tfrac{125-5}3=40$.
5 The maximal proper subfields are $\mathbb{F}_{2^6}$ and $\mathbb{F}_{2^4}$ (from the primes $2,3$ dividing $12$), meeting in $\mathbb{F}_{2^2}$. Their union has $64+16-4=76$ elements, so $4096-76=4020$ elements generate, and $N_2(12)=4020/12=335$.
6 Automorphism: Theorem 7.49(3). $\phi^k(a)=a^{p^k}$; $\phi^n=\mathrm{id}$ because $a^{p^n}=a$; for $0\lt k\lt n$, $x^{p^k}-x$ has at most $p^k\lt p^n$ roots, so $\phi^k\ne\mathrm{id}$. Fixed points are the roots of $x^p-x$, i.e. $\mathbb{F}_p$.
7 $124/2=62$ squares. $125\equiv1\pmod4$, so $-1$ is a square in $\mathbb{F}_{125}$; $49\equiv1\pmod4$, so it is one in $\mathbb{F}_{49}$ too (indeed $-1\in\mathbb{F}_7$ is not a square in $\mathbb{F}_7$, but every element of $\mathbb{F}_7$ is a square in $\mathbb{F}_{49}$, since $x^2-a$ has its roots in $\mathbb{F}_{7^2}$).
8 Theorem 7.50(5). In $\mathbb{F}_8$: $\prod_{k=0}^6\alpha^k=\alpha^{21}=(\alpha^7)^3=1=-1$ ✓. The sum: the coefficient of $x^{7}$ in $x^8-x=\prod(x-a)$ is $0=-\sum a$ ✓ (or add up: each of $1,\alpha,\alpha^2$ occurs in $4$ of the $8$ elements, an even number of times).
9 No root ($f(0)=f(1)=1$), and the only irreducible quadratic is $x^2+x+1$, with $(x^2+x+1)^2=x^4+x^2+1\ne f$: irreducible. $\mathbb{F}_{16}^\times$ has order $15$; the order of a root $\alpha$ divides $15$, and $\alpha^3\ne1$ (as $1,\alpha,\alpha^2,\alpha^3$ are independent), $\alpha^5=\alpha\cdot\alpha^4=\alpha(\alpha+1)=\alpha^2+\alpha\ne1$. So the order is $15$.
10 $5\mid15$, so there are $\varphi(5)=4$ elements of order $5$. They are the roots of $\Phi_5=x^4+x^3+x^2+x+1$, which is irreducible over $\mathbb{F}_2$ (Example 6), so all four have this minimal polynomial. In terms of a primitive $\alpha$: $\beta\in\{\alpha^3,\alpha^6,\alpha^9,\alpha^{12}\}$.
🎯 GATE corner GATE MA · MCQGATE MA · MSQGATE MA · NAT

E1. GATE MA · MCQ The degree $[\mathbb{Q}(\sqrt2,\sqrt[3]2,i):\mathbb{Q}]$ is (A) $6$; (B) $8$; (C) $12$; (D) $18$.

Idea Tower $\mathbb{Q}\subseteq\mathbb{Q}(\sqrt2,\sqrt[3]2)\subseteq\mathbb{Q}(\sqrt2,\sqrt[3]2,i)$.
Compute $[\mathbb{Q}(\sqrt2,\sqrt[3]2):\mathbb{Q}]=6$ (coprime degrees $2,3$; it is $\mathbb{Q}(\sqrt[6]2)$). This field is real, and $i$ is a non-real root of $x^2+1$: the last step has degree $2$. Total $12$.
Options (A) forgets $i$; (B) is impossible because the field contains $\sqrt[3]2$, so its degree is divisible by $3$; (D) $18=6\cdot3$ would need a further step of degree $3$, but adjoining $i$ adds degree at most $2$.
Answer (C).

E2. GATE MA · MCQ Which of the following rings is a field? (A) $\mathbb{Z}_5[x]/\langle x^2+1\rangle$; (B) $\mathbb{Z}_7[x]/\langle x^2+1\rangle$; (C) $\mathbb{Q}[x]/\langle x^4+4\rangle$; (D) $\mathbb{Z}_2[x]/\langle x^4+x^2+1\rangle$.

Idea $F[x]/\langle f\rangle$ is a field iff $f$ is irreducible (Theorem 7.40).
(A) No $2^2+1=0$ in $\mathbb{Z}_5$.
(B) Yes The squares in $\mathbb{Z}_7$ are $0,1,2,4$, and $-1=6$ is not among them, so $x^2+1$ has no root: a field with $49$ elements ($7\equiv3\pmod4$).
(C), (D) No $x^4+4=(x^2+2x+2)(x^2-2x+2)$; $x^4+x^2+1=(x^2+x+1)^2$ over $\mathbb{Z}_2$ — neither has a root, a reminder that the root test stops at degree $3$.
Answer (B).

E3. GATE MA · MSQ Let $F$ be a field with $81$ elements. Which of the following is/are true? (One or more options may be correct.) (A) $F$ has a subfield with $9$ elements. (B) $F$ has a subfield with $27$ elements. (C) The multiplicative group $F^\times$ has exactly $32$ generators. (D) The polynomial $x^2+x+1$ has no root in $F$.

Idea $F=\mathbb{F}_{3^4}$: subfields $\mathbb{F}_{3^m}$ with $m\mid4$; $F^\times\cong\mathbb{Z}_{80}$.
(A) True; (B) False $2\mid4$ but $3\nmid4$ (Theorem 7.52).
(C) True $\varphi(80)=\varphi(16)\varphi(5)=8\cdot4=32$.
(D) False In characteristic $3$, $x^2+x+1=x^2-2x+1=(x-1)^2$, so $1$ is a root. (The trap: "cube roots of unity need $3\mid q-1$" — but here $\omega$ collapses to $1$.)
Answer (A) and (C).

E4. GATE MA · MSQ Which of the following statements is/are true? (One or more options may be correct.) (A) Every algebraically closed field is infinite. (B) The set of complex numbers that are algebraic over $\mathbb{Q}$ is a countable field. (C) Every algebraic extension of $\mathbb{Q}$ is a finite extension. (D) If $K$ is an algebraically closed field containing $\mathbb{Q}$, then $K$ is an algebraic closure of $\mathbb{Q}$.

(A) True A finite field $\{a_1,\dots,a_q\}$ misses a root of $1+\prod(x-a_i)$ (Theorem 7.45(3)).
(B) True $\overline{\mathbb{Q}}$ is a field (Theorem 7.44(3)) and countable: countably many rational polynomials, finitely many roots each.
(C) False $\overline{\mathbb{Q}}$ itself, which contains $\sqrt[n]2$ of degree $n$ for every $n$.
(D) False $K=\mathbb{C}$ is algebraically closed and contains $\mathbb{Q}$, but it is not algebraic over $\mathbb{Q}$ ($\pi$, $e$); an algebraic closure must be algebraic.
Answer (A) and (B).

E5. GATE MA · NAT The number of monic irreducible polynomials of degree $4$ over the field $\mathbb{F}_3$ is ______.

Idea Count the elements of $\mathbb{F}_{81}$ that generate it over $\mathbb{F}_3$ and divide by $4$ (Theorem 7.53(4)).
Compute The only maximal proper subfield is $\mathbb{F}_9$ ($4$ has the single prime divisor $2$). So $81-9=72$ elements have degree $4$, and $N_3(4)=72/4=18$. (Möbius: $\tfrac14(3^4-3^2)=18$.)
Answer $18$ (an integer; accept exactly $18$).

E6. GATE MA · NAT The degree over $\mathbb{Q}$ of the splitting field of $(x^3-2)(x^2-3)$ is ______.

Idea The splitting field is $\mathbb{Q}(\sqrt[3]2,\omega,\sqrt3)$. Start from $L=\mathbb{Q}(\sqrt[3]2,\omega)$, the splitting field of $x^3-2$, of degree $6$.
Is $\sqrt3\in L$? $L$ contains $\sqrt{-3}=2\omega+1$. If it also contained $\sqrt3$, it would contain $i=\sqrt{-3}/\sqrt3$ and so $\mathbb{Q}(\sqrt3,i)$, of degree $4$ — impossible, since $4\nmid6$. Hence the last step has degree $2$.
Answer $6\cdot2=12$. Answer: $12$. (The tempting $6$ comes from thinking $\sqrt3$ "is already there because $\omega$ involves $\sqrt3$" — it is $\sqrt{-3}$ that is there.)
🧑‍🏫 For the teacher

Suggested plan — 3 lectures × 60 min.

  1. Fields and degrees. Definition 7.27, Theorem 7.39 (why the characteristic is prime), Theorem 7.40 and Example 1 as a quick-fire "field or not?" round — make the class find the factorisation of $x^4+4$. Definition 7.28, the tower law (Theorem 7.41) with the basis-product proof on the board, Definition 7.29 and Theorem 7.42. Example 2 in full, emphasising the question "is the new element already in my field?".
  2. Algebraic extensions and splitting fields. Theorem 7.43 (degree of an element divides the degree), Theorem 7.44 with the transitivity proof, Hermite–Lindemann as facts, Definition 7.31 and Theorem 7.45 (the one-line proof that finite fields are not algebraically closed is a favourite). Example 3 as a prove-or-disprove discussion. Then Definition 7.32, Theorems 7.46 and 7.48; project Interactive 2 on $x^3-2$, $x^4-2$ and the pair $x^4-10x^2+1$ / $(x^2-2)(x^2-3)$. Example 4, ending with GATE corner E6.
  3. Finite fields. Theorem 7.49 (freshman's dream), Theorem 7.50 with the counting proof of cyclicity, Theorems 7.51–7.53. Project Interactive 1: on $\mathbb{F}_{16}$ step $s=1,\dots,14$ and ask the class to predict each order before it appears; on $\mathbb{F}_9$ point out that $i$ has order $4$. Examples 5 and 6 on the board, the toolkit box, and GATE corner E3 and E5.

Discussion questions. (1) Why must the minimal polynomial of a field element be irreducible, while the minimal polynomial of a matrix (§3.2) need not be? (2) The splitting field of $x^3-2$ has degree $6$ over $\mathbb{Q}$, degree $3$ over $\mathbb{F}_7$, and degree $2$ over $\mathbb{F}_5$ (there $3\nmid4$ makes cubing a bijection, so $2=3^3$ is a cube, yet the other two roots are missing). Explain all three answers through the cube roots of unity: where do they live in each case? (3) $\mathbb{Q}(\sqrt2)\cong\mathbb{Q}(\sqrt3)$ as vector spaces but not as fields; $\mathbb{F}_p[x]/\langle f\rangle\cong\mathbb{F}_p[x]/\langle g\rangle$ as fields for any two irreducibles of the same degree. Why the difference?

Misconceptions to watch for. Taking the degree of any polynomial $\alpha$ satisfies as $\deg\alpha$; multiplying degrees of generators without checking whether one is already in the field below; "no roots $\Rightarrow$ irreducible" for quartics; confusing $\mathbb{F}_4$ with $\mathbb{Z}_4$; "$\mathbb{F}_{p^m}\subseteq\mathbb{F}_{p^n}$ iff $m\le n$"; "algebraic $\Rightarrow$ finite"; "$\mathbb{C}$ is the algebraic closure of $\mathbb{Q}$"; assuming every root of an irreducible polynomial over $\mathbb{F}_p$ is primitive; using $\frac{q^n-q}{n}$ for composite $n$.

Suggested homework. I(2, 4, 5, 7, 9), II(1, 3, 6, 7, 9), III(1, 2, 4, 6, 7), IV(2, 3, 5, 7, 9, 10); GATE corner E1, E4, E5.

🔬 Research–Teaching NexusResearch-tutored · optional, about 60–90 minutes

Research question. The encryption standard AES, used worldwide in Wi-Fi, online banking and messaging apps, and the error-correcting codes in QR codes and data storage, all compute in a field with $256$ elements, so that one byte is one field element. Which field, which polynomial, and why does the choice of polynomial matter?

Why it matters. A byte $b_7b_6\dots b_0$ is read as the polynomial $b_7x^7+\cdots+b_0$ over $\mathbb{F}_2$; addition is XOR, and multiplication is polynomial multiplication reduced modulo a fixed polynomial of degree $8$. AES uses $m(x)=x^8+x^4+x^3+x+1$ (the hexadecimal number 0x11B) and needs inverses in this field for its "S-box"; the Reed–Solomon codes of QR codes use $x^8+x^4+x^3+x^2+1$ (0x11D) and need a primitive element to build their code. By Theorem 7.51 every irreducible choice gives "the same" field $\mathbb{F}_{256}$ — but not the same arithmetic tables.

What to do.

  1. Show that $m(x)=x^8+x^4+x^3+x+1$ is irreducible over $\mathbb{F}_2$: check that it has no root and is not divisible by any of the $1+2+3=6$ irreducible polynomials of degrees $2,3,4$. (Why is that enough?)
  2. Write a short program that multiplies bytes modulo $m(x)$ (shift-and-XOR). Compute the multiplicative order of $x$ (byte 0x02) and of $x+1$ (byte 0x03). Which is a primitive element? Explain why the order of 0x02 must divide $255=3\cdot5\cdot17$.
  3. Using a primitive element $g$, build the "log" and "antilog" tables ($k\mapsto g^k$). Use them to compute the inverse of the byte 0x53, and check by multiplying.
  4. Count the primitive elements of $\mathbb{F}_{256}$ and the primitive polynomials of degree $8$ over $\mathbb{F}_2$ (Theorem 7.50, Theorem 7.53). Is 0x11D primitive? Is 0x11B?

Tools: Python (integers with bitwise ^, <<, &), or a spreadsheet with the BITXOR function.

Hand in: the irreducibility check; the orders of 0x02 and 0x03; your log table (first $16$ entries) and the inverse of 0x53; the two counts of step 4 with a one-paragraph explanation of why QR-code designers prefer a primitive polynomial.

Going further. Read how a Reed–Solomon code of length $255$ uses the powers $g,g^2,\dots,g^{2t}$ of a primitive element to correct $t$ byte errors (as on CDs, DVDs and deep-space probes), and how AES combines the inversion $a\mapsto a^{-1}=a^{254}$ in $\mathbb{F}_{256}$ with an affine map over $\mathbb{F}_2$ to resist linear and differential attacks.

Instructor note: $N_2(2)+N_2(3)+N_2(4)=1+2+3=6$ quadratic, cubic and quartic irreducibles; a reducible octic without roots must have an irreducible factor of degree $\le4$. In the AES field the order of 0x02 is $51$ (so $m$ is irreducible but not primitive) and 0x03 has order $255$ (primitive). The inverse of 0x53 is 0xCA. $\varphi(255)=128$ primitive elements, hence $128/8=16$ primitive polynomials of degree $8$; 0x11D is primitive ($x$ has order $255$ there), 0x11B is not.

🧪 Self-check quiz

0/5 correct

Q1. $[\mathbb{Q}(\sqrt2,\sqrt5):\mathbb{Q}]$ equals

Q2. The number of generators of the cyclic group $\mathbb{F}_{125}^\times$ is

Q3. Which of the following fields is algebraically closed?

Q4. Which of the following is not (isomorphic to) a subfield of $\mathbb{F}_{64}$?

Q5. The degree over $\mathbb{Q}$ of the splitting field of $x^3-2$ is