Fields and finite fields

At a Glance

• Frequency: 6 sub-parts across 5 of 14 years (2013, 2014, 2020, 2021, 2023)
• Priority tier: T2
• Marks (count): 10 (1), 15 (5)
• Average solve time: ~8 min
• Difficulty mix: easy 1, medium 5
• Section: A | Dominant type: proof

Why This Chapter Matters

Fields appear in 5 of the last 14 years with six questions — all Section A — making this one of the more reliable proof-writing atoms in Paper 2 Algebra. Every question follows one of five tight patterns: (1) show a concrete matrix ring or root-extension is a field by checking axioms and identifying an isomorphism to $\mathbb C$; (2) show $\mathbb Z_p$ is a field and compute explicit inverses; (3) show the Frobenius map $a\mapsto a^p$ is an automorphism of a finite field; (4) construct a field extension where a polynomial has a root (Kronecker); or (5) build a specific finite field as a quotient ring by an irreducible polynomial. Understanding these five patterns — not just as facts but with the underlying logic connecting PID, maximal ideal, and field — is sufficient to cover every question in the corpus.

Minimum Theory

Definition. A field is a set $F$ with operations $+$ and $\times$ such that $(F,+)$ is an abelian group, $(F\setminus\{0\},\times)$ is an abelian group, and multiplication distributes over addition. Equivalently: a commutative ring with unity $1\ne0$ in which every non-zero element has a multiplicative inverse.

Prime fields. $\mathbb Z_p=\{[0],[1],\ldots,[p-1]\}$ with operations mod $p$ is a field if and only if $p$ is prime. Proof ($\Rightarrow$): if $p$ prime and $[a]\ne[0]$, then $\gcd(a,p)=1$, so Bézout’s identity gives integers $b,c$ with $ab+pc=1$, hence $[a][b]=[1]$ in $\mathbb Z_p$. Proof ($\Leftarrow$): if $p=mn$ is composite ($1<m,n<p$), then $[m][n]=[0]$ with $[m],[n]\ne[0]$ — a zero-divisor, impossible in a field.

Characteristic. The characteristic $\operatorname{char}F$ is the smallest positive integer $n$ with $n\cdot 1_F=0_F$, or $0$ if no such $n$ exists. For a field, $\operatorname{char}F$ is $0$ or a prime (if $\operatorname{char}F=mn$ composite, then $(m\cdot1)(n\cdot1)=0$ but $m\cdot1\ne0$ and $n\cdot1\ne0$ — contradiction). Freshman’s Dream (characteristic $p$): for all $a,b\in F$, $(a+b)^p=a^p+b^p.$ Proof: the middle binomial coefficients $\binom{p}{k}=p!/(k!(p-k)!)$ are all divisible by $p$ for $1\le k\le p-1$ (the prime $p$ divides the numerator but not the denominator), so they vanish in characteristic $p$.

Quotient-field construction. Let $F$ be a field and $p(x)\in F[x]$ irreducible over $F$. Then $F[x]/(p(x))$ is a field. Proof: $F[x]$ is a Euclidean domain (with degree as the norm), hence a PID. In a PID, a non-zero element is prime iff it is irreducible, and a prime ideal is maximal. So $(p(x))$ is a maximal ideal, and $F[x]/(p(x))$ is a field. By the division algorithm, every element of $F[x]/(p(x))$ has a unique representative of degree $<\deg p$, so $|F[x]/(p(x))|=|F|^{\deg p}$.

Frobenius automorphism. For a finite field $F$ with $\operatorname{char}F=p$, the map $\phi:a\mapsto a^p$ is a field automorphism. Proof: (i) $\phi(ab)=a^pb^p=\phi(a)\phi(b)$; (ii) $\phi(a+b)=a^p+b^p=\phi(a)+\phi(b)$ (Freshman’s Dream); (iii) $\ker\phi=\{0\}$ (non-zero field homomorphism); (iv) $F$ finite + $\phi$ injective $\Rightarrow$ $\phi$ surjective by pigeonhole.

Kronecker’s theorem. For any field $F$ and non-constant $f\in F[x]$, there exists a field $F'\supseteq F$ in which $f$ has a root. Construction: take any irreducible factor $p$ of $f$; set $F'=F[x]/(p)$ and embed $F\to F'$ via $a\mapsto a+(p)$. The element $\alpha=x+(p)\in F'$ satisfies $f^q(\alpha)=f(x)+(p)=0_{F'}$.

Question Archetypes

Five patterns cover every field question in the corpus.

field-isomorphism (2 question(s); 2013, 2014)

Recognition Cues

• A set of the form $\left\{\begin{pmatrix}a&-b\\b&a\end{pmatrix}:a,b\in\mathbb R\right\}$ or $\{a+b\omega:\omega^3=1,\,a,b\in\mathbb R\}$.
• “Show this set is a field” plus “show it is isomorphic to $\mathbb C$.”
• The isomorphism is always to $\mathbb C$ viewed as a two-dimensional real algebra.

Solution Template

Matrix-ring type (2013):

1. Write out the product $A_1A_2$ of two generic elements and check it stays in $S$ — this is the only step requiring calculation; don’t just assert closure.
2. Check commutativity of $\times$ from the product formula (entries are symmetric in the subscripts).
3. Identify $0_S$ (zero matrix) and $1_S=I_2$.
4. Inverse: $\det A=a^2+b^2>0$ for $(a,b)\ne(0,0)$; compute $A^{-1}$ and check it is in $S$.
5. Define $f(a+ib)=\begin{pmatrix}a&-b\\b&a\end{pmatrix}$; verify $f$ preserves $+$ and $\times$; bijectivity is clear from coordinates.

Root-extension type (2014):

1. Take $\omega=e^{2\pi i/3}=-\tfrac12+i\tfrac{\sqrt3}{2}$ (the non-real cube root of unity).
2. The map $(a,b)\mapsto a+b\omega=(a-b/2)+ib\sqrt3/2$ from $\mathbb R^2$ to $\mathbb C$ has Jacobian $\sqrt3/2\ne0$, so it is a linear bijection: $S=\mathbb C$.
3. $\mathbb C$ is a field: done. (Alternatively, verify axioms directly using $\omega^2=-1-\omega$.)

Worked Example(s)

2013 Paper 2, 2013-P2-Q1a (10 marks)

Show $S=\left\{\begin{pmatrix}a&-b\\b&a\end{pmatrix}:a,b\in\mathbb R\right\}$ is a field under matrix operations. What are the identities and inverse of $\begin{pmatrix}1&-1\\1&1\end{pmatrix}$? Show $f(a+ib)=\begin{pmatrix}a&-b\\b&a\end{pmatrix}$ is an isomorphism.

Let $A_k=\begin{pmatrix}a_k&-b_k\\b_k&a_k\end{pmatrix}$.

Closure under $+$: $A_1+A_2=\begin{pmatrix}a_1+a_2&-(b_1+b_2)\\b_1+b_2&a_1+a_2\end{pmatrix}\in S$. ✓

Closure under $\times$: $A_1A_2=\begin{pmatrix}a_1a_2-b_1b_2&-(a_1b_2+b_1a_2)\\b_1a_2+a_1b_2&a_1a_2-b_1b_2\end{pmatrix}\in S.$ The entries are symmetric in the subscripts, so $A_1A_2=A_2A_1$ (commutativity). ✓

Identities: additive $0_S=\begin{pmatrix}0&0\\0&0\end{pmatrix}$, multiplicative $1_S=I_2$. ✓

Multiplicative inverse: $\det A=a^2+b^2$. For $(a,b)\ne(0,0)$ this is positive, so $A$ is invertible: $A^{-1}=\frac{1}{a^2+b^2}\begin{pmatrix}a&b\\-b&a\end{pmatrix}\in S.$ Every non-zero element has an inverse, so $S$ is a field.

For $A=\begin{pmatrix}1&-1\\1&1\end{pmatrix}$, $\det A=2$: $\boxed{\;A^{-1}=\frac{1}{2}\begin{pmatrix}1&1\\-1&1\end{pmatrix}=\begin{pmatrix}\tfrac{1}{2}&\tfrac{1}{2}\\[4pt]-\tfrac{1}{2}&\tfrac{1}{2}\end{pmatrix}.\;}$

Isomorphism. $f$ respects $+$ (clear) and $\times$: $(a_1+ib_1)(a_2+ib_2)=(a_1a_2-b_1b_2)+i(a_1b_2+b_1a_2)$ maps to $A_1A_2$ above. The map $(a,b)\leftrightarrow a+ib$ is a bijection. So $f:\mathbb C\xrightarrow{\;\sim\;}S$.

Common Traps

• The product $A_1A_2$ must be written out explicitly — “matrix multiplication preserves the form” is not self-evident and loses marks.
• Commutativity of $\times$ is not free for matrices in general; here it follows from the product formula being symmetric in the subscripts.
• $A^{-1}$ lies in $S$: re-read its structure — it has parameters $a/(a^2+b^2)$ and $-b/(a^2+b^2)$, which are real.

finite-field-arithmetic (1 question(s); 2014)

Recognition Cues

• “Show $\mathbb Z_p$ is a field” for an explicit prime $p$.
• Compute specific inverses like $([5]+[6])^{-1}$ or $(-[4])^{-1}$.

Solution Template

1. State: $\mathbb Z_p$ is a field iff $p$ is prime.
2. Proof: for $[a]\ne[0]$, $\gcd(a,p)=1$ (since $p$ prime), so Bézout gives $ab\equiv1\pmod p$, meaning $[b]=[a]^{-1}$.
3. To find a specific inverse: for small $p$, build the inverse table by brute force ($ab\equiv1\pmod p$ for $b=1,2,\ldots$).
4. Additive inverse: $-[n]=[p-n]$.

Worked Example(s)

2014 Paper 2, 2014-P2-Q2a (15 marks)

Show $\mathbb Z_7$ is a field. Find $([5]+[6])^{-1}$ and $(-[4])^{-1}$ in $\mathbb Z_7$.

$\mathbb Z_7$ is a field. 7 is prime. For any $[a]\ne[0]$, $\gcd(a,7)=1$, so Bézout gives $[a]^{-1}\in\mathbb Z_7$.

Inverse table (verify: $[2][4]=[8]=[1]$, $[3][5]=[15]=[1]$, $[6][6]=[36]=[1]$):

$([5]+[6])^{-1}$. $[5]+[6]=[11]=[4]$, so $([5]+[6])^{-1}=[4]^{-1}=$ $\boxed{[2].}$

$(-[4])^{-1}$. $-[4]=[7-4]=[3]$, so $(-[4])^{-1}=[3]^{-1}=$ $\boxed{[5].}$

Common Traps

• $-[n]$ in $\mathbb Z_p$ is the additive inverse, equal to $[p-n]$. Do not confuse with the multiplicative inverse.
• The key link in the proof is Bézout: $\gcd(a,p)=1\Rightarrow ab+pc=1\Rightarrow[a][b]=[1]$. State this chain.
• Building the complete inverse table takes about 2 minutes and is worth doing on a 15-mark question.

frobenius-automorphism (1 question(s); 2020)

Recognition Cues

• “Finite field $R$ of characteristic $p>0$; show $f(a)=a^p$ is an isomorphism.”
• The key phrase is finite field + characteristic $p$.

Solution Template

1. Multiplicativity: $(ab)^p=a^pb^p$ (commutativity of the field). $f(1)=1$.
2. Additivity: $(a+b)^p=a^p+b^p$. Proof: binomial middle terms $\binom{p}{k}$ for $1\le k\le p-1$ are divisible by $p$ (the prime cancels numerator factor but not the denominator factors), so they vanish in characteristic $p$.
3. Injective: $\ker f$ is an ideal of a field, so $\ker f=\{0\}$ (since $f(1)=1\ne0$).
4. Surjective: $R$ finite + $f$ injective self-map $\Rightarrow$ surjective by pigeonhole.
5. Conclude: bijective field homomorphism = automorphism.

Worked Example(s)

2020 Paper 2, 2020-P2-Q3a (15 marks)

Finite field $R$, $\operatorname{char}R=p>0$. Show $f(a)=a^p$ is an isomorphism $R\to R$.

Multiplicativity. $f(ab)=(ab)^p=a^pb^p=f(a)f(b)$, and $f(1)=1$. ✓

Additivity (Freshman’s Dream). $(a+b)^p=\sum_{k=0}^p\binom{p}{k}a^kb^{p-k}.$ For $1\le k\le p-1$: $\binom{p}{k}=p!/(k!(p-k)!)$ has $p$ in the numerator and $k!(p-k)!$ in the denominator; since $k,p-k<p$ and $p$ is prime, $p\nmid k!$ and $p\nmid(p-k)!$, so $p\mid\binom{p}{k}$. These terms vanish in characteristic $p$: $f(a+b)=(a+b)^p=a^p+b^p=f(a)+f(b). \;\checkmark$

So $f$ is a ring homomorphism.

Injective. $\ker f$ is an ideal of the field $R$; the only ideals of a field are $\{0\}$ and $R$. Since $f(1)=1\ne0$, $\ker f=\{0\}$.

Surjective. $R$ is finite and $f:R\to R$ is injective; an injective self-map of a finite set is surjective.

$\boxed{\;f(a)=a^p\text{ is a field automorphism (the Frobenius).}\;}$

Common Traps

• Surjectivity is not free from “homomorphism” — it requires $R$ finite. In an infinite setting (e.g., the rational function field $\mathbb F_p(t)$), $t$ has no $p$-th root, so Frobenius is injective but not surjective.
• The divisibility $p\mid\binom{p}{k}$ uses $p$ prime; it fails for composite moduli (e.g., $\binom{4}{2}=6$, not divisible by 4).
• $\operatorname{char}R=p>0$ forces $p$ prime since a field has no zero-divisors.

kronecker-extension (1 question(s); 2021)

Recognition Cues

• “Let $F$ be a field, $f(x)\in F[x]$ of degree $>0$. Show there exists $F'$ and embedding $q:F\to F'$ such that $f^q$ has a root in $F'$.”
• This is Kronecker’s theorem stated as a proof.

Solution Template

1. Factor $f$ into irreducibles in $F[x]$; WLOG take $p_1$ an irreducible factor (root of $p_1$ $\Rightarrow$ root of $f$).
2. Construct $F'=F[x]/(p_1)$. Since $F[x]$ is a PID and $p_1$ irreducible, $(p_1)$ is maximal, so $F'$ is a field.
3. Embed $q:F\to F'$ by $q(a)=a+(p_1)$; injectivity: if $a-b\in(p_1)$ and $\deg(a-b)=0<\deg p_1$, then $a=b$.
4. $\alpha=x+(p_1)\in F'$ is a root: $f^q(\alpha)=\sum a_i(x+(p_1))^i=f(x)+(p_1)=0_{F'}$.

Worked Example(s)

2021 Paper 2, 2021-P2-Q2b (15 marks)

Field $F$, $f(x)\in F[x]$ of degree $>0$. Show there exist $F'$ and embedding $q:F\to F'$ such that $f^q$ has a root in $F'$.

Step 1 (reduction). Factor $f=p_1\cdots p_k$ into irreducibles in $F[x]$. A root of $p_1$ is also a root of $f$, so WLOG $f$ is irreducible.

Step 2 (construction). Set $F'=F[x]/(f)$. Since $F[x]$ is a PID (Euclidean domain via degree), the ideal $(f)$ is maximal (irreducible $\Leftrightarrow$ prime in PID, and in PID, prime ideals are maximal). Hence $F'$ is a field.

Step 3 (embedding). Define $q(a)=a+(f)$ for $a\in F$. This is a ring homomorphism. If $q(a)=q(b)$, then $a-b\in(f)$; since $\deg(a-b)=0<\deg f$, we get $a=b$. So $q$ is injective.

Step 4 (root). Let $\alpha=x+(f)\in F'$: $f^q(\alpha)=\sum_i q(a_i)\alpha^i=\sum_i(a_i+(f))(x+(f))^i=f(x)+(f)=0_{F'}.$

$\boxed{\;F'=F[x]/(f),\quad q(a)=a+(f),\quad \alpha=x+(f)\text{ is a root of }f^q.\;}$

Common Traps

• The reduction to the irreducible case (“WLOG $f$ is irreducible”) must be stated explicitly.
• Cite “maximal ideal in a PID is generated by an irreducible” — don’t prove it; it’s standard theory.
• The root is literally the coset $x+(f)$, not some abstract element.

quotient-field-construction (1 question(s); 2023)

Recognition Cues

• “Prove $p(x)$ irreducible in $\mathbb Z_q[x]$; show $\mathbb Z_q[x]/(p(x))$ is a field of $q^n$ elements.”
• The pattern: irreducibility proof (root search for degree 2 or 3) + field structure + element count.

Solution Template

1. Irreducibility (degree 2 or 3): test all $q=|\mathbb Z_q|$ elements as potential roots. No root $\Rightarrow$ no linear factor $\Rightarrow$ irreducible.
2. Field: $\mathbb Z_q[x]$ is a PID; $(p(x))$ maximal (from irreducibility) $\Rightarrow$ quotient is a field.
3. Count: by the division algorithm, every element has a unique representative of degree $<\deg p$; there are $q^{\deg p}$ such.

Worked Example(s)

2023 Paper 2, 2023-P2-Q3a (15 marks)

Prove $x^2+1$ is irreducible in $\mathbb Z_3[x]$. Show $F=\mathbb Z_3[x]/\langle x^2+1\rangle$ is a field of 9 elements.

Irreducibility. Test all elements of $\mathbb Z_3$: $p(0)=1\ne0,\quad p(1)=1+1=2\ne0,\quad p(2)=4+1=5\equiv2\ne0.$ No root in $\mathbb Z_3$; since $\deg p=2$, no root $\Rightarrow$ no linear factor $\Rightarrow$ irreducible. $\blacksquare$

Field. $\mathbb Z_3[x]$ is a Euclidean domain (division algorithm with degree), hence a PID. An irreducible element generates a maximal ideal in a PID, so $\langle x^2+1\rangle$ is maximal and $F=\mathbb Z_3[x]/\langle x^2+1\rangle$ is a field.

Nine elements. By the division algorithm, every $f(x)$ has a unique remainder $a+bx$ (degree $<2$) modulo $x^2+1$. The cosets are parametrised by $(a,b)\in\mathbb Z_3\times\mathbb Z_3$: $|F|=3^2=\boxed{9.}$

In $F$, the class $x$ satisfies $x^2=-1\equiv2$, acting as a square root of $-1$ over $\mathbb F_3$. The field $F\cong\mathbb F_9$.

Common Traps

• “No root $\Rightarrow$ irreducible” is valid only for degree 2 or 3. For degree $\ge4$ a polynomial can factor into irreducible quadratics with no roots.
• The element-count argument must invoke the division algorithm explicitly — just asserting ”$a+bx$ form” without justification loses marks.
• The leading coefficient $1$ of $x^2+1$ is a unit in $\mathbb Z_3$, so the division algorithm proceeds without complication; for non-monic divisors one would need to check this.

Marks-Aware Writing

10-mark questions (2013-Q1a): Write out the matrix product explicitly (2–3 lines), identify identities, compute the specific inverse, and verify the isomorphism map preserves $\times$. Around 12 minutes; examiners penalise “by inspection” substitutions for the product.

15-mark questions (all others): Each archetype has a clear 4-step structure — introduce the setup (1 sentence), prove the property (3–4 labelled steps), state the conclusion. For the Frobenius, spell out the $p\mid\binom{p}{k}$ argument — it is the core idea, worth about 6 marks. For quotient fields, cite the PID/Euclidean-domain fact and then spend time on the irreducibility test and the element count — these are the steps examiners actually mark.

Practice Set