This deck builds the field concept as the top of the ring ladder: division works everywhere, there are no zero divisors, and the characteristic is forced to be either zero or prime. It constructs the smallest genuinely new finite field, F_4, from scratch with full addition and multiplication tables, and hammers home the central trap that the field with four elements is NOT the ring of integers modulo four. It targets the misconceptions that the characteristic can be composite, that a finite ring with no obvious zero divisor must be a field, and that the multiplicative group need not be cyclic.
Subject: Foundations of Higher Mathematics · 108 slides · symbolic lesson
Open the interactive version of this deck · Homework for this lesson
Objectives
This deck sits at the very top of the ring ladder. A field is the structure where arithmetic behaves exactly like the rational numbers: you can add, subtract, multiply, and divide by anything nonzero.
By the end you can:
1. State the field axioms and prove that a field has no zero divisors.
2. Compute the characteristic of a field and prove it must be either zero or prime.
3. Construct the finite field with four elements from an irreducible polynomial, and write out its complete addition and multiplication tables.
4. Explain why the field with four elements is not the integers modulo four, and find a generator of a finite multiplicative group.
Warm-up
Discussion prompt
Before we open Fields, Characteristic & Finite Fields: without looking back, what was the main idea of Rings, Integral Domains & Ideals, and what could you do by the end of it that you could not do before?
Hint: One sentence for the idea, one for the skill. If the second one is blank, that is the part to revisit.
Answer:
That deck presents rings as sets carrying two compatible operations, then splits the elements into units and zero-divisors. It covers integral domains and cancellation, fields as the best case, and ideals as the ring analog of normal subgroups, together with quotient rings and the First Isomorphism Theorem. It targets the misconceptions that every ring is commutative or has a 1, that no ring has zero-divisors, and that an ideal is just a subring.
Concept
Recall the ladder: a commutative ring gives you addition, subtraction, and multiplication with distributivity. A field adds the one missing power: every nonzero element has a multiplicative inverse.
field — A commutative ring with a multiplicative identity, different from zero, in which every nonzero element has a multiplicative inverse. Equivalently, the nonzero elements form an abelian group under multiplication.
That single extra axiom is what turns solving equations into ordinary algebra: division is just multiplication by an inverse.
Concept
Written out, a set with two operations is a field when all of the following hold.
\[ (F, +) \text{ is an abelian group with identity } 0 \]
\[ (F \setminus \{0\}, \cdot) \text{ is an abelian group with identity } 1 \]
\[ a \cdot (b + c) = a\cdot b + a\cdot c \quad\text{and}\quad 0 \neq 1 \]
The last line is the distributive glue plus the promise that the field is not the trivial one-element ring.
Counterexample
Discussion prompt
Written out, a set with two operations is a field when all of the following hold.
That is stated as though it always holds. Do one of two things: produce a case where it fails, or say precisely what rules such a case out. "It just does" is not on the menu.
Hint: Hunt at the extremes first — zero, one, negative, empty, equal. If every extreme survives, the reason they survive is the proof.
Answer:
The last line is the distributive glue plus the promise that the field is not the trivial one-element ring.
Concept
Everything special about fields flows from this one line: pick any element that is not zero, and it has an inverse.
\[ \forall a \in F,\; a \neq 0 \;\Longrightarrow\; \exists\, a^{-1} \in F \text{ with } a \cdot a^{-1} = 1 \]
So when you meet a candidate field, the real question is never the easy axioms. It is: does every single nonzero element have an inverse inside the set?
Analogy
Discussion prompt
Explain The load-bearing axiom is invertibility of every nonzero element by analogy to something with no Foundations of Higher Mathematics in it at all — a queue, a recipe, a map, a bank balance, whatever fits. Then say where your analogy breaks.
Hint: An analogy that never breaks is not an analogy, it is the same idea wearing a hat. Find the seam — that is the part that is actually new.
Answer:
Everything special about fields flows from this one line: pick any element that is not zero, and it has an inverse.
Concept
The rationals, the reals, and the complex numbers are the standard infinite fields.
\[ \mathbb{Q} \subset \mathbb{R} \subset \mathbb{C} \]
The integers are the cautionary tale: they are a perfectly good commutative ring, but division fails.
\[ 2 \in \mathbb{Z}, \quad 2^{-1} = \tfrac{1}{2} \notin \mathbb{Z} \]
The only integers with integer inverses are plus and minus one, so the integers are a ring but not a field.
Explain it
Discussion prompt
Explain The familiar fields, and one famous non-field to a student a year behind you. No notation, no jargon they have not met — and it still has to be true.
Hint: If your explanation needs a symbol they have never seen, you are describing the notation rather than the idea.
Answer:
The rationals, the reals, and the complex numbers are the standard infinite fields.
Intuition
Think of a field as the smallest promise that lets you do school algebra without ever getting stuck. Given a nonzero coefficient, you can always isolate the variable.
\[ a x = b,\; a \neq 0 \;\Longrightarrow\; x = a^{-1} b \]
In the integers this breaks the moment you try to solve two times x equals three. In a field it never breaks. That is the whole psychological content of the word.
Concept
A zero divisor is a nonzero element that multiplies another nonzero element to give zero. Fields forbid this entirely.
\[ a b = 0 \;\Longrightarrow\; a = 0 \;\text{ or }\; b = 0 \]
This is why every field is automatically an integral domain, and it is the property that makes cancellation legal.
Ranking
Put in order
Put the moves of Worked example: prove a field has no zero divisors into the order they have to happen.
Why: These are the moves of the worked example in the order it makes them, and each one is set up by the one before it. We prove the disjunction by ruling out the bad case: suppose the first factor is not zero and show the second must vanish.
Worked example
Claim: in any field, if a product is zero then one of the factors is zero. This is short but it is the model for every proof that uses invertibility.
Assume the product is zero and one factor is nonzero
Why: We prove the disjunction by ruling out the bad case: suppose the first factor is not zero and show the second must vanish.
\[ a b = 0, \qquad a \neq 0 \]
Multiply both sides on the left by the inverse of a
Why: Because the field is a field and a is nonzero, the inverse exists. This is the only place the field axiom is used.
\[ a^{-1}(a b) = a^{-1} \cdot 0 \]
Simplify each side
Why: Associativity collapses the left side to b, and anything times zero is zero on the right.
\[ (a^{-1} a) b = b, \qquad a^{-1} \cdot 0 = 0 \]
Conclude the second factor is zero
Why: The two simplified sides are equal, so b is forced to be zero, which is exactly the surviving disjunct.
\[ b = 0 \]
Verify the logic covers both cases
Why: If instead a were zero the disjunction already holds; we only needed the nonzero case, and there invertibility forced b to vanish. The claim holds in every field.
\[ a b = 0 \;\Longrightarrow\; a = 0 \;\text{ or }\; b = 0 \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "prove a field has no zero divisors", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: If instead a were zero the disjunction already holds; we only needed the nonzero case, and there invertibility forced b to vanish. The claim holds in every field.
Anomaly
Predict first
A student writes this, and it looks reasonable:
A student sees a product equal to another product and cancels the common factor, as if every ring behaved like the rationals.
It is wrong. Say what breaks — and say it before you turn the page.
Correct: This silently assumes 2 is invertible, which is exactly the field property that may fail.
Cancellation is a field privilege. The integers modulo six are not a field, and two is a zero divisor there.
Why: This silently assumes 2 is invertible, which is exactly the field property that may fail.
Trap
A student sees a product equal to another product and cancels the common factor, as if every ring behaved like the rationals.
Cancel the factor of 2 from both sides in the integers modulo 6
Why: This silently assumes 2 is invertible, which is exactly the field property that may fail.
\[ 2 \cdot 1 \equiv 2 \cdot 4 \pmod 6 \;\Longrightarrow\; 1 \equiv 4 \;? \]
But one is not congruent to four modulo six, so the cancellation produced a false statement.
Cancellation is a field privilege. The integers modulo six are not a field, and two is a zero divisor there.
Expose the zero divisor
Why: Two times three is zero without either factor being zero, so cancellation by two is illegal in this ring.
\[ 2 \cdot 3 \equiv 0 \pmod 6, \quad 2 \neq 0,\; 3 \neq 0 \]
Only cancel by an element you have checked is invertible. In a field every nonzero element qualifies; in a general ring you must earn it.
Notation
Annotate
From Trap: assuming you can always cancel in any ring — read this one piece at a time. What is each part doing?
On: \( 2 \cdot 1 \equiv 2 \cdot 4 \pmod 6 \;\Longrightarrow\; 1 \equiv 4 \;? \)
Concept
Every field contains a copy of the whole numbers, obtained by adding the identity to itself over and over. The characteristic records when, if ever, this sum returns to zero.
\[ n \cdot 1 = \underbrace{1 + 1 + \cdots + 1}_{n \text{ terms}} \]
In the rationals this never returns to zero. In a finite field it must, because there are only finitely many values to land on.
Intuition
Forget the whole field for a second and stare only at the element 1. Keep adding it to a running total and watch the total cycle through the field.
If the running total eventually lands back on zero, the characteristic is the first step number where that happens. If it never does, the characteristic is defined to be zero, meaning no wraparound.
\[ \text{char}(F) = \text{additive order of } 1 \text{ in } (F, +), \text{ or } 0 \text{ if infinite} \]
Concept
Precisely, the characteristic is the smallest positive number of copies of the identity that sum to zero, and it is zero when no such number exists.
\[ \text{char}(F) = \min\{\, n > 0 : n \cdot 1 = 0 \,\} \]
\[ \text{char}(F) = 0 \;\text{ if } n \cdot 1 \neq 0 \text{ for all } n > 0 \]
So characteristic zero and characteristic prime are the only two worlds, as the next theorem shows.
Concept
There is no such thing as a field of characteristic four or six or nine. Whenever the characteristic is positive, it is forced to be a prime number.
\[ \text{char}(F) \in \{0\} \cup \{\, p : p \text{ prime} \,\} \]
The reason is exactly the no-zero-divisors property we just proved. A composite characteristic would manufacture a zero divisor out of the identity.
Step zero
Discussion prompt
Worked example: prove the characteristic is zero or prime — before any calculation: what is the plan? Name the moves in order, in plain English, without doing the arithmetic.
Hint: It starts with: Assume the characteristic is composite, and factor it
Answer:
Worked example
Suppose the characteristic is a positive number. We show it cannot be composite.
Assume the characteristic is composite, and factor it
Why: Set up a proof by contradiction: if the smallest positive n with n copies of 1 equal to zero factors nontrivially, we will find a zero divisor.
\[ \text{char}(F) = n = a b, \qquad 1 < a, b < n \]
Split the sum of n ones into a product of two smaller sums
Why: By distributivity, adding 1 to itself ab times equals the product of adding it a times and adding it b times. This is the algebraic heart of the argument.
\[ 0 = n \cdot 1 = (a \cdot 1)\,(b \cdot 1) \]
Apply no zero divisors
Why: A field has no zero divisors, so one of the two factors is already zero on its own.
\[ a \cdot 1 = 0 \quad\text{or}\quad b \cdot 1 = 0 \]
Reach the contradiction
Why: Either equation gives a positive multiple of 1 equal to zero that is strictly smaller than n, contradicting that n was the smallest such number.
\[ a < n \;\text{ and }\; b < n \;\Longrightarrow\; \text{contradicts minimality of } n \]
Verify the two surviving cases
Why: If some positive n works it cannot be composite, so it is prime; if no positive n works the characteristic is zero by definition. Both allowed outcomes, nothing else.
\[ \text{char}(F) = 0 \;\text{ or }\; \text{char}(F) = p \text{ prime} \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "prove the characteristic is zero or prime", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: If some positive n works it cannot be composite, so it is prime; if no positive n works the characteristic is zero by definition. Both allowed outcomes, nothing else.
Estimation
Predict first
Compute the characteristic of the rationals, the integers modulo five, and the four-element field.
Commit before you compute: what does Worked example: read off the characteristic of three fields come out to? A rough magnitude and the right form is enough — the point is to have something concrete to be wrong about.
Correct: Verify each is zero or prime
Why: A prediction you can defend turns the computation into a check rather than a leap of faith — and an answer that contradicts it is caught on the spot. Zero, five, and two are all allowed values; note the number of elements four does not equal the characteristic two.
Worked example
Compute the characteristic of the rationals, the integers modulo five, and the four-element field.
Rationals: add 1 to itself and watch it grow
Why: In the rationals a positive whole number is never zero, so no finite number of ones sums to zero.
\[ n \cdot 1 = n \neq 0 \text{ in } \mathbb{Q} \;\Longrightarrow\; \text{char}(\mathbb{Q}) = 0 \]
Integers modulo five: find the first wraparound
Why: Adding 1 five times lands on zero, and no fewer does, so five is the additive order of 1.
\[ 1,2,3,4 \neq 0, \quad 5 \cdot 1 \equiv 0 \pmod 5 \;\Longrightarrow\; \text{char} = 5 \]
Four-element field: the identity doubles to zero
Why: In this field, which we build later, one plus one is zero, so the characteristic is two even though the field has four elements.
\[ 1 + 1 = 0 \text{ in } \mathbb{F}_4 \;\Longrightarrow\; \text{char}(\mathbb{F}_4) = 2 \]
Verify each is zero or prime
Why: Zero, five, and two are all allowed values; note the number of elements four does not equal the characteristic two.
\[ 0,\; 5,\; 2 \text{ are all zero or prime} \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "read off the characteristic of three fields", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Zero, five, and two are all allowed values; note the number of elements four does not equal the characteristic two.
Anomaly
Predict first
A student writes this, and it looks reasonable:
A student meets the integers modulo four, adds 1 four times to get zero, and declares this a field of characteristic four.
It is wrong. Say what breaks — and say it before you turn the page.
Correct: The arithmetic is correct: four copies of 1 do sum to zero here.
The integers modulo four are a ring, not a field, and the theorem forbids composite characteristic in a field.
Why: The arithmetic is correct: four copies of 1 do sum to zero here.
Trap
A student meets the integers modulo four, adds 1 four times to get zero, and declares this a field of characteristic four.
Compute the additive order of 1 in the ring of integers modulo four
Why: The arithmetic is correct: four copies of 1 do sum to zero here.
\[ 4 \cdot 1 \equiv 0 \pmod 4, \quad 1,2,3 \neq 0 \]
The additive order really is four. The error is calling this structure a field at all.
The integers modulo four are a ring, not a field, and the theorem forbids composite characteristic in a field.
Expose the zero divisor that composite characteristic forces
Why: The element two multiplies itself to zero, so two has no inverse and the ring is not a field.
\[ 2 \cdot 2 \equiv 0 \pmod 4 \;\Longrightarrow\; 2 \text{ has no inverse} \]
Composite additive order of 1 is possible in a ring; it is impossible in a field, precisely because it would create a zero divisor like this one.
Concept
The multiples of the identity form the smallest subfield, called the prime field. Its shape is dictated entirely by the characteristic.
\[ \text{char} = 0 \Rightarrow \text{prime field} \cong \mathbb{Q}, \qquad \text{char} = p \Rightarrow \text{prime field} \cong \mathbb{F}_p \]
So a positive-characteristic field is built on top of a copy of the integers modulo a prime. Those base fields are our starting bricks.
Concept
When the modulus is prime, the integers modulo it form a field, written with a blackboard F. This is the first infinite family of finite fields.
\[ \mathbb{F}_p = \mathbb{Z}/p\mathbb{Z} = \{\, 0, 1, 2, \ldots, p-1 \,\} \]
prime field F_p — The integers modulo a prime p, with addition and multiplication reduced mod p. Because p is prime, every nonzero residue is coprime to p and therefore has a multiplicative inverse, so it is a field.
Definition probe
Sort into buckets
Every line below is part of the definition of field or of prime field F_p — one or the other, never both. Put each where it belongs.
Missing information
Discussion prompt
Find the multiplicative inverse of three in the field with seven elements, that is, solve three times x equals one.
What do you need to know — or decide — before the first line can be written? List everything the problem has to hand you.
Hint: Anything you would have to invent to get started is a thing the problem must supply.
Answer:
The inverse of three is the residue whose product with three is one modulo seven.
Worked example
Find the multiplicative inverse of three in the field with seven elements, that is, solve three times x equals one.
Set up the congruence to solve
Why: The inverse of three is the residue whose product with three is one modulo seven.
\[ 3x \equiv 1 \pmod 7 \]
Scan multiples of three modulo seven
Why: Since the field is small we can just list the products until one appears.
\[ 3\cdot 1=3,\; 3\cdot 2=6,\; 3\cdot 3=2,\; 3\cdot 4=5,\; 3\cdot 5=15\equiv 1 \]
Read off the inverse
Why: The multiple that hit one tells us x, so five is the inverse of three.
\[ 3^{-1} \equiv 5 \pmod 7 \]
Verify by multiplying back
Why: Plug the answer in: fifteen reduces to one modulo seven, confirming the inverse.
\[ 3 \cdot 5 = 15 = 2\cdot 7 + 1 \equiv 1 \pmod 7 \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "invert an element in the integers modulo seven", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Plug the answer in: fifteen reduces to one modulo seven, confirming the inverse.
Intuition
Invertibility modulo n is the same as being coprime to n, from the extended Euclidean algorithm. When n is prime, every nonzero residue is automatically coprime to it.
\[ a \text{ invertible mod } n \iff \gcd(a, n) = 1 \]
If the modulus is composite, some nonzero residue shares a factor with it, loses its inverse, and the structure collapses from field to mere ring.
Fill the middle
Fill in the blanks
From Trap: assuming integers modulo n is always a field — finish the line. Write what belongs on the right of the equals sign before you look.
\gcd(2,6) = 2 \neq 1 \;\Longrightarrow\; 2 \text{ not invertible}
Why: Producing the right-hand side unprompted is the difference between recognising this line and being able to use it. This assumes the residue two has an inverse, which requires two to be coprime to six.
Trap
A student treats every clock arithmetic ring as a field and tries to divide by two modulo six.
Attempt to invert two modulo six
Why: This assumes the residue two has an inverse, which requires two to be coprime to six.
\[ 2x \equiv 1 \pmod 6 \;? \]
No residue works: two times anything modulo six is always even, never one. The inverse does not exist.
Integers modulo n form a field exactly when n is prime; otherwise a shared factor kills some inverse.
Check the coprimality condition
Why: Two and six share the factor two, so two is a zero divisor modulo six and cannot be inverted.
\[ \gcd(2,6) = 2 \neq 1 \;\Longrightarrow\; 2 \text{ not invertible} \]
\[ \mathbb{Z}/n\mathbb{Z} \text{ is a field} \iff n \text{ is prime} \]
Break the constraint
Discussion prompt
The rule this trap just fixed:
Two and six share the factor two, so two is a zero divisor modulo six and cannot be inverted.
Now break it on purpose. Build a case that violates it and follow the consequences until something visibly fails. Where does the failure first show up — and would you have noticed it if you had not been looking?
Hint: The dangerous rules are the ones whose violation still produces an answer. If yours fails loudly, try to find one that fails quietly.
Answer:
This assumes the residue two has an inverse, which requires two to be coprime to six.
Concept
You cannot build a field with six elements or ten elements. The number of elements of any finite field is a prime raised to a whole-number power.
\[ |F| = p^n \quad\text{for some prime } p \text{ and integer } n \geq 1 \]
The prime p is the characteristic; the exponent n is the dimension of the field as a vector space over its prime subfield.
Concept
For each prime power there is exactly one field of that size, up to relabeling. This is a deep theorem we state and use.
\[ \forall\, p \text{ prime},\, n \geq 1 \; \exists!\; \text{field } \mathbb{F}_{p^n} \text{ with } p^n \text{ elements (up to isomorphism)} \]
The notation with a blackboard F and a prime-power subscript names this unique field. It is often called the Galois field of that order.
Concept
This is the single most important warning of the deck. When the exponent is bigger than one, these two structures of the same size are completely different.
\[ \mathbb{F}_{p^n} \;\neq\; \mathbb{Z}/p^n\mathbb{Z} \quad\text{for } n \geq 2 \]
The residue ring has composite characteristic and zero divisors, so it is never a field beyond the first power. The Galois field is a field with characteristic p.
Step zero
Discussion prompt
Worked example: the integers modulo four fail to be a field — before any calculation: what is the plan? Name the moves in order, in plain English, without doing the arithmetic.
Hint: It starts with: Test the element two for a zero-divisor collision
Answer:
Worked example
Show directly that the four-element residue ring is not a field, so it cannot be the field with four elements.
Test the element two for a zero-divisor collision
Why: A field has no zero divisors, so finding one immediately disqualifies the ring.
\[ 2 \cdot 2 = 4 \equiv 0 \pmod 4 \]
List every product of two to hunt for an inverse
Why: If two were invertible some multiple of it would equal one; we check all four residues.
\[ 2\cdot 0 = 0,\; 2\cdot 1 = 2,\; 2\cdot 2 = 0,\; 2\cdot 3 = 2 \]
Conclude two has no inverse
Why: The value one never appears among the products, so two cannot be inverted and the ring is not a field.
\[ \nexists\, x : 2x \equiv 1 \pmod 4 \]
Verify the contrast with the genuine field of order four
Why: The true four-element field, built next, has characteristic two and every nonzero element invertible, so the two structures are not the same.
\[ \mathbb{Z}/4\mathbb{Z} \text{ has char } 4 \text{ and zero divisors}; \; \mathbb{F}_4 \text{ has char } 2 \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "the integers modulo four fail to be a field", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: The true four-element field, built next, has characteristic two and every nonzero element invertible, so the two structures are not the same.
Anomaly
Predict first
A student writes this, and it looks reasonable:
A student wants the field with eight elements and reaches for the integers modulo eight, matching the count.
It is wrong. Say what breaks — and say it before you turn the page.
Correct: It has the right number of elements, which feels like enough.
Match the size with a genuine field construction, not a residue ring, whenever the exponent exceeds one.
Why: It has the right number of elements, which feels like enough.
Trap
A student wants the field with eight elements and reaches for the integers modulo eight, matching the count.
Pick the residue ring of the same size
Why: It has the right number of elements, which feels like enough.
\[ |\mathbb{Z}/8\mathbb{Z}| = 8 = 2^3 \]
But two times four is zero here, so there are zero divisors and no inverse for the even residues.
Match the size with a genuine field construction, not a residue ring, whenever the exponent exceeds one.
Build the field as a polynomial quotient by an irreducible polynomial
Why: Quotienting the polynomial ring over the prime field by an irreducible of the right degree yields a field, not a ring with zero divisors.
\[ \mathbb{F}_8 = \mathbb{F}_2[x] / (x^3 + x + 1) \]
Same eight elements, but now every nonzero element is a unit. The construction, not the count, is what makes a field.
Translation
\( |\mathbb{Z}/8\mathbb{Z}| = 8 = 2^3 \)
Draw it
Translate both ways. First write the expression above as a sentence with no symbols in it at all. Then cover it, and write your sentence back as notation. If the two versions disagree, the disagreement is the thing to fix.
Concept
The trick that turns integers modulo a prime into a field also works for polynomials: quotient by an irreducible polynomial instead of a prime number.
irreducible polynomial — A nonconstant polynomial over a field that cannot be factored into two nonconstant polynomials of lower degree over that same field. It plays the role of a prime in the polynomial ring.
\[ \mathbb{F}_p[x] / (f) \text{ is a field} \iff f \text{ is irreducible over } \mathbb{F}_p \]
Hypothesis
Predict first
Worked example: show x squared plus x plus one is irreducible over F two is about to be worked. State your hypothesis first: which rule or definition decides this one, and what is the first move it forces? Then watch whether the example agrees with you.
Correct: Recall the root test for low degree
Why: A quadratic or cubic over a field is irreducible exactly when it has no root in that field, since any factorization would give a linear factor and hence a root.
A hypothesis you wrote down is falsifiable; a vague sense of how it will go is not. If the example opens somewhere else, that gap is the thing worth chasing.
Worked example
To build the four-element field we need a degree-two irreducible over the two-element field. Test the candidate.
Recall the root test for low degree
Why: A quadratic or cubic over a field is irreducible exactly when it has no root in that field, since any factorization would give a linear factor and hence a root.
\[ \deg f \in \{2,3\}: \; f \text{ irreducible} \iff f \text{ has no root in the field} \]
Evaluate at zero
Why: Plug in the first element of the two-element field.
\[ f(0) = 0 + 0 + 1 = 1 \neq 0 \]
Evaluate at one, remembering one plus one is zero
Why: In characteristic two the two equal terms cancel, leaving one.
\[ f(1) = 1 + 1 + 1 = 1 \neq 0 \]
Verify no root exists, hence irreducible
Why: Both elements of the base field give a nonzero value, so there is no root and the quadratic cannot factor into linear pieces. It is irreducible.
\[ f(0) = f(1) = 1 \neq 0 \;\Longrightarrow\; x^2 + x + 1 \text{ irreducible over } \mathbb{F}_2 \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "show x squared plus x plus one is irreducible over F two", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Both elements of the base field give a nonzero value, so there is no root and the quadratic cannot factor into linear pieces. It is irreducible.
Concept
Take polynomials over the two-element field and work modulo the irreducible quadratic. Every polynomial reduces to a remainder of degree at most one.
\[ \mathbb{F}_4 = \mathbb{F}_2[x] / (x^2 + x + 1) \]
The remainders of degree at most one, with coefficients zero or one, are exactly the four elements.
\[ \mathbb{F}_4 = \{\, 0,\; 1,\; \alpha,\; \alpha + 1 \,\}, \quad \alpha = x \bmod (x^2+x+1) \]
Intuition
Think of alpha as an imaginary-number style invention. Just as i is defined by its square being minus one, alpha is defined by the polynomial we quotiented by being zero.
\[ \alpha^2 + \alpha + 1 = 0 \]
In characteristic two, adding is the same as subtracting, so this relation rearranges into a rule that rewrites alpha squared.
\[ \alpha^2 = -\alpha - 1 = \alpha + 1 \]
Concept
Two facts do all the work. First, coefficients live in the two-element field, so a plus a is zero. Second, any appearance of alpha squared is rewritten.
\[ 1 + 1 = 0, \qquad \alpha^2 = \alpha + 1 \]
Pushing the second rule once more gives the powers of alpha, which will cycle after three steps.
\[ \alpha^3 = \alpha \cdot \alpha^2 = \alpha(\alpha+1) = \alpha^2 + \alpha = (\alpha+1) + \alpha = 1 \]
Ranking
Put in order
Put the moves of Worked example: build the addition table of F four into the order they have to happen.
Why: These are the moves of the worked example in the order it makes them, and each one is set up by the one before it. Doubling any coefficient gives zero in characteristic two, so the diagonal of the table is all zeros.
Worked example
Addition just adds coefficients in the two-element field, so it is coordinate-wise, and every element is its own additive inverse.
Add each element to itself
Why: Doubling any coefficient gives zero in characteristic two, so the diagonal of the table is all zeros.
\[ 1 + 1 = 0, \quad \alpha + \alpha = 0, \quad (\alpha+1) + (\alpha+1) = 0 \]
Add the distinct nonzero pairs
Why: Combine the constant and alpha parts separately, reducing each coefficient mod two.
\[ 1 + \alpha = \alpha + 1, \quad 1 + (\alpha+1) = \alpha, \quad \alpha + (\alpha+1) = 1 \]
Assemble the full addition table
Why: Fill every cell from the sums above; the table is symmetric and each row is a permutation of the four elements.
| + | 0 | 1 | α | α+1 |
|---|---|---|---|---|
| 0 | 0 | 1 | α | α+1 |
| 1 | 1 | 0 | α+1 | α |
| α | α | α+1 | 0 | 1 |
| α+1 | α+1 | α | 1 | 0 |
Verify closure and the zero diagonal
Why: Every entry is one of the four elements and the main diagonal is all zeros, confirming characteristic two and that addition stays inside the set.
\[ \alpha + (\alpha+1) = 1 \in \mathbb{F}_4, \quad x + x = 0 \text{ on the diagonal} \quad\checkmark \]
Worked example
Multiplication multiplies the polynomials and then reduces any alpha squared using the reduction rule.
Multiply alpha by alpha
Why: Apply the reduction rule directly: alpha squared is alpha plus one.
\[ \alpha \cdot \alpha = \alpha^2 = \alpha + 1 \]
Multiply alpha by alpha plus one
Why: Expand, then reduce the alpha squared term and cancel the doubled alpha in characteristic two.
\[ \alpha(\alpha+1) = \alpha^2 + \alpha = (\alpha+1) + \alpha = 1 \]
Square alpha plus one
Why: Expand the product; the cross terms double to zero and the alpha squared reduces, leaving alpha.
\[ (\alpha+1)^2 = \alpha^2 + 1 = (\alpha+1) + 1 = \alpha \]
Assemble the full multiplication table
Why: The zero row and column are all zeros; the nonzero block is filled from the three products above plus the identity row.
| × | 0 | 1 | α | α+1 |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 1 | 0 | 1 | α | α+1 |
| α | 0 | α | α+1 | 1 |
| α+1 | 0 | α+1 | 1 | α |
Verify each nonzero row contains a 1
Why: A one appears in every nonzero row and column, which is the visual signature that every nonzero element has an inverse.
\[ \alpha \cdot (\alpha+1) = 1, \quad (\alpha+1)\cdot \alpha = 1 \quad\checkmark \]
Concept
Here are both operations side by side, with the shorthand that the two nonzero non-identity elements are alpha and alpha plus one.
Figure (svg): Two five by five operation tables for the four-element field F4. Left is the addition table with header row plus, 0, 1, a, b and the four-element field where a equals alpha and b equals alpha plus one; its main diagonal is all zeros. Right is the multiplication table with header row times, 0, 1, a, b; its zero row and column are all zeros and each nonzero row and column contains a 1, showing every nonzero element is invertible.
Notice the addition diagonal is all zeros, a fingerprint of characteristic two, and every nonzero multiplication row contains a one.
Step zero
Discussion prompt
Worked example: find every inverse in F four — before any calculation: what is the plan? Name the moves in order, in plain English, without doing the arithmetic.
Hint: It starts with: Invert the identity
Answer:
Worked example
A field must invert every nonzero element. Read the inverses straight from the multiplication table by locating the one in each row.
Invert the identity
Why: The identity is always its own inverse.
\[ 1 \cdot 1 = 1 \;\Longrightarrow\; 1^{-1} = 1 \]
Invert alpha
Why: The one in alpha's row sits under the column alpha plus one, so that is its inverse.
\[ \alpha \cdot (\alpha + 1) = 1 \;\Longrightarrow\; \alpha^{-1} = \alpha + 1 \]
Invert alpha plus one
Why: By the same product read the other way, alpha plus one inverts to alpha.
\[ (\alpha + 1) \cdot \alpha = 1 \;\Longrightarrow\; (\alpha + 1)^{-1} = \alpha \]
Verify all three nonzero elements are inverted
Why: Every nonzero element has an inverse inside the set, which is exactly the field axiom, so the construction really is a field.
\[ 1^{-1}=1,\; \alpha^{-1}=\alpha+1,\; (\alpha+1)^{-1}=\alpha \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "find every inverse in F four", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Every nonzero element has an inverse inside the set, which is exactly the field axiom, so the construction really is a field.
Concept
This bears repeating because it is the crux. The four-element field has four elements but its characteristic is two, since adding the identity to itself already gives zero.
\[ |\mathbb{F}_4| = 4, \qquad \text{char}(\mathbb{F}_4) = 2 \]
The size and the characteristic are different numbers here. The size is a power of the characteristic, never equal to it once the exponent exceeds one.
Intuition
Picture the four elements as the four points of a two-dimensional grid whose coordinates are each zero or one. The basis is the identity and alpha.
\[ \mathbb{F}_4 = \{\, c_1 \alpha + c_0 : c_0, c_1 \in \mathbb{F}_2 \,\}, \quad 2^2 = 4 \text{ points} \]
That is why the count is a power of two: it is the number of coordinate choices. Addition is grid addition, and only multiplication needs the reduction rule.
Anomaly
Predict first
A student writes this, and it looks reasonable:
Both have four elements, so a student writes down the residues zero through three and calls that the four-element field.
It is wrong. Say what breaks — and say it before you turn the page.
Correct: In the residue ring the identity has additive order four, giving characteristic four.
The genuine field has characteristic two, and its additive group is a plane over the two-element field, not a single cycle of length four.
Why: In the residue ring the identity has additive order four, giving characteristic four.
Trap
Both have four elements, so a student writes down the residues zero through three and calls that the four-element field.
Add 1 to itself inside the residue ring
Why: In the residue ring the identity has additive order four, giving characteristic four.
\[ 1+1+1+1 \equiv 0 \pmod 4, \quad \text{char} = 4 \]
But a field cannot have characteristic four, and here two is a zero divisor. Same size, wrong structure.
The genuine field has characteristic two, and its additive group is a plane over the two-element field, not a single cycle of length four.
Compare the additive orders of the identity
Why: In the true field one plus one is already zero, so the additive structure is two copies of the two-element group, not one four-cycle.
\[ \mathbb{F}_4: 1+1 = 0 \;(\text{char }2); \quad \mathbb{Z}/4\mathbb{Z}: 1+1+1+1 = 0 \;(\text{char }4) \]
Different characteristic, different additive group, and one has zero divisors while the other does not. They are not the same object.
Concept
A powerful theorem: the multiplicative group of any finite field is cyclic. A single element, raised to successive powers, produces every nonzero element.
\[ (\mathbb{F}_q)^\times \text{ is cyclic of order } q - 1 \]
So even though multiplication can look complicated, it is secretly just adding exponents on a single generator. Finite-field multiplication is a clock.
Concept
The element whose powers sweep out all the nonzero elements gets a special name.
primitive element — A generator of the multiplicative group of a finite field: an element whose successive powers run through every nonzero element exactly once before returning to the identity. For the integers modulo a prime it is also called a primitive root.
\[ g \text{ primitive} \iff \{\, g^1, g^2, \ldots, g^{q-1} \,\} = (\mathbb{F}_q)^\times \]
Estimation
Predict first
Check that alpha is a primitive element by listing its powers until they cycle.
Commit before you compute: what does Worked example: alpha generates the nonzero elements of F… come out to? A rough magnitude and the right form is enough — the point is to have something concrete to be wrong about.
Correct: Verify the order is three and cycles back
Why: A prediction you can defend turns the computation into a check rather than a leap of faith — and an answer that contradicts it is caught on the spot. The group has three nonzero elements and alpha has order three, so it is a generator and the powers repeat with period three.
Worked example
Check that alpha is a primitive element by listing its powers until they cycle.
First power
Why: The first power is alpha itself.
\[ \alpha^1 = \alpha \]
Second power via the reduction rule
Why: Apply the rule that alpha squared is alpha plus one.
\[ \alpha^2 = \alpha + 1 \]
Third power
Why: Multiply the previous result by alpha and reduce; we already computed this returns the identity.
\[ \alpha^3 = \alpha \cdot \alpha^2 = \alpha(\alpha+1) = 1 \]
Collect the powers
Why: The three powers are exactly the three nonzero elements, so alpha generates the whole multiplicative group.
\[ \{\alpha, \alpha^2, \alpha^3\} = \{\alpha, \alpha+1, 1\} = (\mathbb{F}_4)^\times \]
Verify the order is three and cycles back
Why: The group has three nonzero elements and alpha has order three, so it is a generator and the powers repeat with period three.
\[ \alpha^3 = 1, \quad |(\mathbb{F}_4)^\times| = 3 \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "alpha generates the nonzero elements of F four", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: The group has three nonzero elements and alpha has order three, so it is a generator and the powers repeat with period three.
Estimation
Predict first
The nonzero elements modulo seven form a cyclic group of order six. Find a generator by testing a candidate.
Commit before you compute: what does Worked example: find a primitive root of F seven come out to? A rough magnitude and the right form is enough — the point is to have something concrete to be wrong about.
Correct: Verify the cycle closes at six and not before
Why: A prediction you can defend turns the computation into a check rather than a leap of faith — and an answer that contradicts it is caught on the spot. The first return to one happens at the sixth power, with no earlier repeat, confirming three is a true primitive root.
Worked example
The nonzero elements modulo seven form a cyclic group of order six. Find a generator by testing a candidate.
Take three as the candidate and list its powers modulo seven
Why: A generator must produce all six nonzero residues; compute successive powers.
\[ 3^1 = 3,\; 3^2 = 2,\; 3^3 = 6,\; 3^4 = 4,\; 3^5 = 5,\; 3^6 = 1 \]
Check the powers cover every nonzero residue
Why: The six powers are all distinct and exhaust the nonzero residues, so three has order six.
\[ \{3,2,6,4,5,1\} = \{1,2,3,4,5,6\} \]
Conclude three is primitive
Why: Because its order equals the group size, three generates the whole multiplicative group modulo seven.
\[ \operatorname{ord}(3) = 6 = |(\mathbb{F}_7)^\times| \]
Verify the cycle closes at six and not before
Why: The first return to one happens at the sixth power, with no earlier repeat, confirming three is a true primitive root.
\[ 3^6 \equiv 1 \pmod 7, \quad 3^k \neq 1 \text{ for } 1 \le k \le 5 \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "find a primitive root of F seven", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: The six powers are all distinct and exhaust the nonzero residues, so three has order six.
Anomaly
Predict first
A student writes this, and it looks reasonable:
A student wants a primitive root modulo seven and grabs the smallest option, two, without checking its order.
It is wrong. Say what breaks — and say it before you turn the page.
Correct: The powers stop generating new elements much sooner than expected.
You must verify the order equals the group size. A generator has order six modulo seven; not every element does.
Why: The powers stop generating new elements much sooner than expected.
Trap
A student wants a primitive root modulo seven and grabs the smallest option, two, without checking its order.
List the powers of two modulo seven
Why: The powers stop generating new elements much sooner than expected.
\[ 2^1 = 2,\; 2^2 = 4,\; 2^3 = 1 \]
Two only produces the three residues one, two, and four. It has order three, not six, so it is not primitive.
You must verify the order equals the group size. A generator has order six modulo seven; not every element does.
Compare orders
Why: Two has order three, so it generates only a subgroup of size three; three has order six and generates everything.
\[ \operatorname{ord}(2) = 3 \neq 6, \qquad \operatorname{ord}(3) = 6 \]
The group is cyclic, so generators exist, but you must find one of the correct order rather than assume the first small number works.
Two truths and a lie
Sort into buckets
Some of these hold up and some are the exact mistakes this lesson is built to prevent. Sort them.
Concept
The same recipe scales up. For eight elements, quotient polynomials over the two-element field by an irreducible cubic.
\[ \mathbb{F}_8 = \mathbb{F}_2[x] / (x^3 + x + 1) \]
The cubic has no root in the two-element field, so it is irreducible, and the remainders of degree at most two give the eight elements.
\[ \beta^3 = \beta + 1, \quad \beta = x \bmod (x^3 + x + 1) \]
Step zero
Discussion prompt
Worked example: invert beta in the eight-element field — before any calculation: what is the plan? Name the moves in order, in plain English, without doing the arithmetic.
Hint: It starts with: Guess the product with a degree-two element and expand
Answer:
Worked example
Find the inverse of beta in the eight-element field by multiplying and reducing with the cubic relation.
Guess the product with a degree-two element and expand
Why: Try multiplying beta by beta squared plus one and see what reduces out.
\[ \beta \cdot (\beta^2 + 1) = \beta^3 + \beta \]
Apply the reduction rule for beta cubed
Why: Replace beta cubed by beta plus one using the defining relation.
\[ \beta^3 + \beta = (\beta + 1) + \beta \]
Cancel in characteristic two
Why: The two copies of beta add to zero, leaving just the identity.
\[ (\beta + 1) + \beta = 1 \]
Verify the inverse
Why: The product came out to one, so beta squared plus one is the multiplicative inverse of beta in the eight-element field.
\[ \beta^{-1} = \beta^2 + 1, \quad \beta(\beta^2+1) = 1 \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "invert beta in the eight-element field", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: The product came out to one, so beta squared plus one is the multiplicative inverse of beta in the eight-element field.
Concept
The elements zero and one inside the four-element field, with the same arithmetic, form a copy of the two-element field. It is a subfield.
\[ \mathbb{F}_2 = \{0, 1\} \subseteq \mathbb{F}_4 \]
In general one Galois field embeds in another exactly when the smaller exponent divides the larger. Since one divides two, the two-element field lives inside the four-element one.
Concept
A finite field of size q has a beautiful uniform law: raising any element to the q-th power returns the element itself.
\[ a^q = a \quad\text{for every } a \in \mathbb{F}_q \]
For nonzero elements this is the field version of Fermat's little theorem, coming straight from the multiplicative group having order q minus one.
\[ a \neq 0 \;\Longrightarrow\; a^{q-1} = 1 \]
Explain it
Discussion prompt
Explain Every element is a root of x to the q minus x to a student a year behind you. No notation, no jargon they have not met — and it still has to be true.
Hint: If your explanation needs a symbol they have never seen, you are describing the notation rather than the idea.
Answer:
A finite field of size q has a beautiful uniform law: raising any element to the q-th power returns the element itself.
Ranking
Put in order
Put the moves of Worked example: check the fourth-power law in F four into the order they have to happen.
Why: These are the moves of the worked example in the order it makes them, and each one is set up by the one before it. Zero to any positive power is zero and one to any power is one, so both are fixed.
Worked example
Confirm that raising every element of the four-element field to the fourth power returns the element, since here q is four.
Handle zero and one
Why: Zero to any positive power is zero and one to any power is one, so both are fixed.
\[ 0^4 = 0, \qquad 1^4 = 1 \]
Raise alpha to the fourth
Why: Use that alpha cubed is one, so the fourth power is alpha times one.
\[ \alpha^4 = \alpha \cdot \alpha^3 = \alpha \cdot 1 = \alpha \]
Raise alpha plus one to the fourth
Why: Since alpha plus one equals alpha squared, its fourth power is alpha to the eighth, which reduces using alpha cubed equals one.
\[ (\alpha+1)^4 = (\alpha^2)^4 = \alpha^8 = \alpha^{6}\alpha^{2} = \alpha^2 = \alpha + 1 \]
Verify all four are fixed
Why: Every element returns to itself under the fourth power, confirming the law that each element is a root of x to the fourth minus x.
\[ 0^4=0,\;1^4=1,\;\alpha^4=\alpha,\;(\alpha+1)^4=\alpha+1 \quad\checkmark \]
Picture it
Animation
Shows: Each line of the worked example "check the fourth-power law in F four", appearing one at a time.
The same working the example does, in the order a tutor would write it.
Takeaway: Every element returns to itself under the fourth power, confirming the law that each element is a root of x to the fourth minus x.
Concept
Why care about fields right before linear algebra? Because a vector space needs scalars you can divide by. Division is what lets you scale, normalize, and solve linear systems.
Over a field, row reduction always works: you can turn any nonzero pivot into a one by dividing. Over a mere ring this fails, which is why the theory is cleaner over fields.
\[ \text{vector space over } F \;\rightsquigarrow\; F \text{ must be a field} \]
Analogy
Discussion prompt
Explain Fields are exactly the scalars linear algebra needs by analogy to something with no Foundations of Higher Mathematics in it at all — a queue, a recipe, a map, a bank balance, whatever fits. Then say where your analogy breaks.
Hint: An analogy that never breaks is not an analogy, it is the same idea wearing a hat. Find the seam — that is the part that is actually new.
Answer:
Why care about fields right before linear algebra? Because a vector space needs scalars you can divide by. Division is what lets you scale, normalize, and solve linear systems.
Concept
The two-element field and its extensions are everywhere in computer science. Bytes are elements of the field with two hundred fifty-six elements.
\[ \text{one byte} \in \mathbb{F}_{256} = \mathbb{F}_{2^8} \]
Error-correcting codes, the AES block cipher, and many hash constructions all compute inside these finite fields, using exactly the polynomial-quotient arithmetic we just built by hand.
Counterexample
Discussion prompt
The two-element field and its extensions are everywhere in computer science. Bytes are elements of the field with two hundred fifty-six elements.
That is stated as though it always holds. Do one of two things: produce a case where it fails, or say precisely what rules such a case out. "It just does" is not on the menu.
Hint: Hunt at the extremes first — zero, one, negative, empty, equal. If every extreme survives, the reason they survive is the proof.
Answer:
Error-correcting codes, the AES block cipher, and many hash constructions all compute inside these finite fields, using exactly the polynomial-quotient arithmetic we just built by hand.
Intuition
You have been computing in the two-element field your whole programming life without naming it. Exclusive-or is addition and logical and is multiplication.
| a | b | a plus b (XOR) | a times b (AND) |
|---|---|---|---|
| 0 | 0 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 1 |
The self-inverse rule of characteristic two is just the fact that exclusive-or of a bit with itself is zero. Hardware does field arithmetic natively.
Pattern
Step through it
Step through In the two-element field, XOR is addition and AND is… one row at a time. What is driving the change, and what would the row after the last one be?
Pattern
1. Start from the prime field of the base characteristic
Why: The characteristic p is prime, and the integers modulo p give the ground field to build over.
2. Find an irreducible polynomial of the target degree
Why: A degree-n irreducible over the prime field exists for every n; for degree two or three, having no root in the base field is enough to guarantee irreducibility.
3. Quotient the polynomial ring by that irreducible
Why: Quotienting by an irreducible makes every nonzero remainder invertible, exactly as quotienting the integers by a prime does.
\[ \mathbb{F}_{p^n} = \mathbb{F}_p[x] / (f), \quad f \text{ irreducible of degree } n \]
4. Represent elements as low-degree remainders
Why: Every element is a polynomial of degree below n with coefficients in the prime field, giving exactly p to the n elements.
Pattern
1. Add coordinate-wise, reducing coefficients modulo p
Why: Addition never raises the degree, so you just add coefficients in the prime field.
2. Multiply as polynomials, then reduce using the defining relation
Why: Whenever the degree reaches n, rewrite the leading power using the relation from the irreducible polynomial, exactly as alpha squared became alpha plus one.
3. Invert with the extended Euclidean algorithm on polynomials
Why: Since the modulus is irreducible, every nonzero element is coprime to it, so the extended algorithm produces an inverse; in tiny fields just scan the table for a 1.
\[ a \cdot a^{-1} \equiv 1 \pmod{f} \]
4. Sanity-check against the field laws
Why: Confirm every nonzero element has an inverse and there are no zero divisors, which certifies the quotient really is a field.
Notation
Annotate
From Recipe: do arithmetic and invert inside the quotient — read this one piece at a time. What is each part doing?
On: \( a \cdot a^{-1} \equiv 1 \pmod{f} \)
Elimination
Eliminate the wrong options
What is the characteristic of the four-element field?
3 of these 4 are wrong. Strike them one at a time, and say what rules each one out before you strike the next. The survivor is the answer.
Survives elimination: A
Why: In the four-element field the identity added to itself is zero, so the additive order of one is two. The characteristic is that additive order, and it is prime as the theorem requires, even though the field has four elements.
Check
Recall how the identity behaves under repeated addition in the four-element field.
Check your understanding
What is the characteristic of the four-element field?
Answer: A
Why: In the four-element field the identity added to itself is zero, so the additive order of one is two. The characteristic is that additive order, and it is prime as the theorem requires, even though the field has four elements.
Check
Use that coefficients live in the two-element field, so they reduce modulo two.
Check your understanding
In the four-element field, what is the sum of alpha plus one with itself?
Answer: A
Why: Adding any element to itself doubles every coefficient, and doubling is zero in characteristic two, so the result is zero. Every element of this field is its own additive inverse.
Prediction
Predict first
In the four-element field, what is the multiplicative inverse of alpha?
Answer it in your own words, now, with nothing to choose from. The options are on the next slide — and picking the right one off a list is an easier skill than producing it.
Correct: alpha plus one
Why: The product of alpha with alpha plus one reduces to one, so alpha plus one is the inverse of alpha. Every nonzero element of this field is invertible, which is what makes it a field.
Check
Use the multiplication table: find the element whose product with alpha is one.
Check your understanding
In the four-element field, what is the multiplicative inverse of alpha?
Answer: A
Why: The product of alpha with alpha plus one reduces to one, so alpha plus one is the inverse of alpha. Every nonzero element of this field is invertible, which is what makes it a field.
Prediction
Predict first
Which statement about the field with four elements is correct?
Answer it in your own words, now, with nothing to choose from. The options are on the next slide — and picking the right one off a list is an easier skill than producing it.
Correct: It has characteristic two and is not the ring of integers modulo four.
Why: The four-element field has characteristic two and no zero divisors, while the integers modulo four have characteristic four and the zero divisor two. Same size, genuinely different structures.
Check
Distinguish the genuine four-element field from the integers modulo four.
Check your understanding
Which statement about the field with four elements is correct?
Answer: A
Why: The four-element field has characteristic two and no zero divisors, while the integers modulo four have characteristic four and the zero divisor two. Same size, genuinely different structures.
Check
A generator must have order six, sweeping out all six nonzero residues.
Check your understanding
Which element is a primitive root of the multiplicative group modulo seven?
Answer: A
Why: The successive powers of three modulo seven are three, two, six, four, five, one, which are all six nonzero residues, so three has order six and generates the group.
Elimination
Eliminate the wrong options
Which polynomial over the two-element field can be used to construct the four-element field as a quotient?
3 of these 4 are wrong. Strike them one at a time, and say what rules each one out before you strike the next. The survivor is the answer.
Survives elimination: A
Why: The polynomial x squared plus x plus one has no root in the two-element field, so it is an irreducible quadratic, and quotienting by it yields a field of four elements. It is the standard choice.
Check
To build the four-element field you need a degree-two irreducible over the two-element field.
Check your understanding
Which polynomial over the two-element field can be used to construct the four-element field as a quotient?
Answer: A
Why: The polynomial x squared plus x plus one has no root in the two-element field, so it is an irreducible quadratic, and quotienting by it yields a field of four elements. It is the standard choice.
Connect it up
Draw it
One page, no notation unless you need it: draw how these connect — Recipe: construct the field with p to the n elements · Recipe: do arithmetic and invert inside the quotient · A field is a commutative ring where you can always divide · The field axioms, laid out in full · The load-bearing axiom is invertibility of every nonzero element. Put an arrow wherever one of them is what makes another possible, and label the arrow with why.
Recap
A field is a commutative ring where every nonzero element has an inverse, so you can always divide. That single axiom rules out zero divisors and makes cancellation legal.
The characteristic is the additive order of the identity, and it is forced to be zero or prime, because a composite value would build a zero divisor from the identity.
Finite fields exist only in prime-power sizes, one for each size up to relabeling, and beyond the first power they are polynomial quotients, never residue rings.
\[ \mathbb{F}_4 = \mathbb{F}_2[x]/(x^2+x+1), \quad \alpha^2 = \alpha+1, \quad \alpha^{-1} = \alpha+1 \]
You built the four-element field by hand with both tables, saw why it is not the integers modulo four, found a primitive element, and connected it all to the two-element field arithmetic your hardware already runs.
Want this taught 1-on-1? Alexander tutors Foundations of Higher Mathematics — $55/session, free consultation.