Polynomials and field extensions
Introduced| English | Meaning |
|---|---|
| irreducible/ɪrɪˈdjuːsɪbl/ | Not expressible as a product of two polynomials of smaller positive degree over the stated field. |
| minimal polynomial/ˈmɪnɪml ˌpɒlɪˈnəʊmɪəl/ | The monic polynomial of least degree over that field which vanishes at the element; it is irreducible. |
| tower law/ˈtaʊə lɔː/ | The rule that finite extension degrees multiply along a chain of fields. |
Four symbols need the right arithmetic
- Two binary digits give four possible symbols, but labels alone do not define a field. In $\mathbb Z/4\mathbb Z$, $2\cdot2=0$, so the nonzero element $2$ has no inverse. A field with four elements must use different arithmetic.
- We will construct it from polynomials over $\mathbb F_2=\mathbb Z/2\mathbb Z$. Then we will connect polynomial degrees, field extensions and complex roots of unity.
Name the coefficient field
- A nonconstant polynomial is irreducible 不可约的 over a field when it cannot be written as a product of two polynomials of smaller positive degree with coefficients in that field. Nonzero constant factors do not count as a reduction.
- The polynomial $x^2-2$ is irreducible over $\mathbb Q$, but factors as $(x-\sqrt2)(x+\sqrt2)$ over $\mathbb R$. A factorisation using coefficients outside the named field does not establish reducibility there.
What the root test can decide
- Over a field, $r$ is a root exactly when $x-r$ is a factor. A reducible polynomial of degree $2$ or $3$ must have a linear factor, so in those degrees irreducibility is equivalent to having no root in the field.
- From degree $4$ onward, no root is insufficient. The polynomial $x^4+3x^2+2$ has no real root, yet equals $(x^2+1)(x^2+2)$ and is reducible over $\mathbb R$. Over $\mathbb F_2$, $x^2+x+1$ has no root because its value is $1$ at both $0$ and $1$; being quadratic, it is irreducible.
Which polynomial is irreducible over $\mathbb F_2$?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
The quadratic x² + x + 1 takes value 1 at both elements 0 and 1 of $\mathbb F_2$, so has no root and is irreducible. The other choices factor as (x + 1)², x(x + 1), and x·x.
A degree-4 polynomial over $\mathbb Q$ with no rational root can still be reducible over $\mathbb Q$.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
True. It may factor into two quadratics with no rational roots, such as $(x^2 + 1)(x^2 + 2)$.
A quartic needs one more check
- For $f=x^4+x+1$ over $\mathbb F_2$, the values at $0$ and $1$ are both $1$, excluding linear factors. A reducible quartic without a linear factor would have to factor into two irreducible quadratics.
- The only monic (leading coefficient $1$) irreducible quadratic over $\mathbb F_2$ is $q=x^2+x+1$. Modulo $q$, we have $x^2=x+1$, $x^3=1$ and $x^4=x$, so $f$ leaves remainder $1$. Thus $q$ does not divide $f$, and $f$ is irreducible.
Irreducible over which field?
Decide irreducibility relative to the named field.
A quartic over a field is always irreducible if it has no root in that field.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
A quartic can factor as two quadratics without a linear factor. For example, (x² + 1)(x² + 2) has no real root but is reducible over ℝ.
Prove that $x^4+x+1$ is irreducible over $\mathbb F_2$. Explain why testing its two possible roots is not the whole proof.
The values at 0 and 1 are both 1, so there is no linear factor. A reducible quartic with no linear factor would be a product of two irreducible quadratics. The four monic quadratics over $\mathbb F_2$ are $x^2$, $x^2+1$, $x^2+x$ and $x^2+x+1$; the first three have a root, so only the last can be an irreducible quadratic factor. Write $q=x^2+x+1$. In $\mathbb F_2$[x], $x^4+x+1=q(x^2+x)+1$, so q does not divide the quartic. Both possible factor-degree patterns have now been excluded.
Quotients, bases and size
- If $p\in F[x]$ is nonconstant and irreducible of degree $d$, then $F[x]/(p)$ is a field. Writing $\alpha$ for the class of $x$, every element has a unique representative $a_0+a_1\alpha+\cdots+a_{d-1}\alpha^{d-1}$, with coefficients in $F$.
- The classes $1,\alpha,\ldots,\alpha^{d-1}$ form a basis, so the extension degree is $d$. If the base field $F$ has $q$ elements, there are $q^d$ coefficient lists and hence $q^d$ elements. Without irreducibility, the quotient can have the same size while failing to be a field.
$p$ is irreducible of degree 3 over $\mathbb F_5$. How many elements does $\mathbb F_5[x]/(p)$ have?
Difficulty 2/5 · 140 coins + a small bonus on first completion today
An irreducible p of degree 3 makes $\mathbb F_5$[x]/(p) a field whose elements are the remainders a + bx + cx² with a, b, c ∈ $\mathbb F_5$: 5³ = 125 elements.
Why is $\mathbb F_2[x]/(x^2)$ not a field, although it has four elements?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
The nonzero class t of x satisfies t² = 0, so t is a zero divisor and cannot have an inverse. The count of four remainders does not establish the field property.
Addition in the four-element field
- Set $\mathbb F_4=\mathbb F_2[x]/(x^2+x+1)$. Its four elements are $0,1,\alpha,\alpha+1$, with $\alpha^2=\alpha+1$ because minus and plus agree in characteristic $2$.
- Add coefficients modulo $2$: for example, $\alpha+(\alpha+1)=1$. Also $\alpha+\alpha=0$. The characteristic is $2$, not $4$: $1+1=0$. Every nonzero element has additive order $2$.
What is the characteristic of the field $\mathbb F_4$?
Difficulty 2/5 · 140 coins + a small bonus on first completion today
The coefficients come from $\mathbb F_2$, so 1 + 1 = 0. The characteristic is 2; the number of elements is 4.
Multiply, reduce, then find inverses
- Expand first: $\alpha(\alpha+1)=\alpha^2+\alpha$. Using $\alpha^2=\alpha+1$ and $\alpha+\alpha=0$, this product equals $1$. Thus $\alpha^{-1}=\alpha+1$ and $(\alpha+1)^{-1}=\alpha$; the remaining nonzero element $1$ is its own inverse.
- Squaring $\alpha+1$ gives $\alpha^2+2\alpha+1=\alpha$. All three nonzero elements are units. In contrast, the four-element ring $\mathbb F_2[x]/(x^2)$ has a nonzero class $t$ with $t^2=0$, so size alone does not determine whether a ring is a field.
In $\mathbb F_4=\mathbb F_2[\alpha]$ with $\alpha^2=\alpha+1$, the inverse of $\alpha$ has the form $\alpha+c$. Enter $c\in\mathbb F_2$.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
α(α + 1) = 1.
Additive order and multiplicative order differ
- Multiplication by $\alpha$ cycles through $1\to\alpha\to\alpha+1\to1$, while zero stays zero. Hence $\alpha^3=1$ and the multiplicative order of $\alpha$ is $3$; reduce powers of $\alpha$ modulo $3$.
- This does not contradict $\alpha+\alpha=0$, which concerns addition. For example, $\alpha^8=\alpha^2=\alpha+1$, but eight copies of $\alpha$ added together give zero. State which operation an order refers to.
Which statements hold in 𝔽₄?
Separate addition and multiplication using α² = α + 1.
In $\mathbb F_4$ with $\alpha^2=\alpha+1$, what is $\alpha^8$?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
The multiplicative order of α is 3, so α⁸ = α² = α + 1. This is a product of eight factors, not a sum of eight copies.
Explain why $\mathbb F_4$ is not isomorphic to $\mathbb Z/4\mathbb Z$. Compare characteristic, additive orders and multiplicative inverses.
In $\mathbb F_4$, $1+1=0$ and every nonzero element has additive order 2. In ℤ/4ℤ, 1 has additive order 4 and $2\cdot2=0$ with $2\ne0$. A ring isomorphism preserves addition and multiplication, so these differences rule one out. The nonzero elements of $\mathbb F_4$ are 1, α and α+1, with inverses 1, α+1 and α respectively. Thus $\mathbb F_4$ is a field while ℤ/4ℤ has a nonzero zero divisor. Having the same four-element cardinality is insufficient.
Minimal polynomials measure algebraic degree
- An element is algebraic over a field if some nonzero polynomial over that field vanishes at it. Its minimal polynomial 极小多项式 is the monic polynomial of least degree over that field which vanishes at the element; it is irreducible.
- If the minimal polynomial of $\beta$ over $F$ has degree $d$, then $[F(\beta):F]=d$, with basis $1,\beta,\ldots,\beta^{d-1}$. A transcendental element has no minimal polynomial and generates an extension of infinite degree; do not assign it a finite degree by this rule.
Use the tower law with a chain
- The tower law 塔律 is the rule that finite extension degrees multiply along a chain of fields. For $K\subseteq L\subseteq M$ with both stages finite, $[M:K]=[M:L][L:K]$; each degree is a vector-space dimension over its stated base field.
- If $\beta\in M$, then $K\subseteq K(\beta)\subseteq M$, so $[K(\beta):K]$ divides $[M:K]$. Thus an extension of degree $2$ cannot contain an element of degree $3$. The minimal polynomial can change when the base field changes.
Two square roots do not always double twice
- The extension $\mathbb Q(\sqrt2,\sqrt3)$ has degree $4$: first adjoin $\sqrt2$ with degree $2$, then $\sqrt3$ with degree $2$. To justify the second step, suppose $\sqrt3=a+b\sqrt2$ for rational $a,b$.
- Squaring and comparing coefficients gives $2ab=0$. If $b=0$, then $a^2=3$; if $a=0$, then $b^2=3/2$. Neither is a rational square, so $\sqrt3\notin\mathbb Q(\sqrt2)$. By contrast, $\sqrt8=2\sqrt2$, so $\mathbb Q(\sqrt2,\sqrt8)$ still has degree $2$.
Find $[\mathbb Q(\sqrt2,\sqrt8):\mathbb Q]$.
Difficulty 2/5 · 140 coins + a small bonus on first completion today
Since √8 = 2√2, adjoining √8 adds no new elements after adjoining √2. The field is ℚ(√2), of degree 2.
Coprime degrees give a useful bound
- Let $M=\mathbb Q(\sqrt[3]2,\sqrt2)$. The polynomials $x^3-2$ and $x^2-2$ are irreducible over $\mathbb Q$, so the tower law makes $[M:\mathbb Q]$ divisible by both $3$ and $2$, hence by $6$.
- Adjoining $\sqrt2$ to $\mathbb Q(\sqrt[3]2)$ has degree at most $2$, giving $[M:\mathbb Q]\leq3\cdot2=6$. The lower and upper bounds agree. Multiplying the two individual degrees without a chain or a bound would not have justified the answer.
What is $[\mathbb Q(\sqrt[3]{2}, \sqrt 2) : \mathbb Q]$?
Difficulty 2/5 · 140 coins + a small bonus on first completion today
The cubic x³ − 2 and quadratic x² − 2 are irreducible over ℚ. The total degree is therefore divisible by 3 and by 2, hence by 6. Adjoining √2 to ℚ(∛2) has degree at most 2, so the total degree is at most 3·2 = 6. The matching bounds force degree 6.
Find the degrees over $\mathbb Q$ of $\mathbb Q(\sqrt2,\sqrt3)$ and $\mathbb Q(\sqrt2,\sqrt8)$. Justify any new degree in your tower rather than multiplying the individual degrees automatically.
First $[\mathbb Q(\sqrt2):\mathbb Q]=2$. If $\sqrt3=a+b\sqrt2$ with rational a,b, squaring gives $3=a^2+2b^2+2ab\sqrt2$. Irrationality of √2 forces ab=0. Then either a²=3 or b²=3/2; neither rational square is possible because a rational square has even exponents in its prime factorisation. Thus √3 is not already in ℚ(√2), so adjoining it has degree 2 and the first total degree is 4. By contrast, √8=2√2 is already in the first field, making the second stage degree 1 and the second total degree 2.
Complex roots of unity
- In $\mathbb C$, the $n$th roots of unity are $\zeta_n^k$ for $k=0,\ldots,n-1$, where $\zeta_n=e^{2\pi i/n}$. The order of $\zeta_n^k$ is $n/\gcd(n,k)$; it is primitive exactly when that order is $n$.
- For $n=10$, the primitive roots have exponents $1,3,7,9$. The root $-1=\zeta_{10}^5$ has order $2$ and is not primitive; a root of $x^{10}-1$ need not be a primitive tenth root.
For $\zeta_{12}=e^{2\pi i/12}$ in $\mathbb C$, what is the multiplicative order of $\zeta_{12}^4$?
Difficulty 2/5 · 140 coins + a small bonus on first completion today
The order is 12/gcd(12, 4) = 3. This is a twelfth root of unity, but not a primitive twelfth root.
Cyclotomic polynomials select primitive roots
- Over $\mathbb Q$, the cyclotomic polynomial $\Phi_n$ is monic and irreducible, with the primitive complex $n$th roots as its roots and degree $\varphi(n)$. Here $\varphi(n)$ counts the integers from $1$ to $n$ that are coprime to $n$.
- The polynomial $x^5+1$ has $-1$ and the four primitive tenth roots as its roots. Removing $x+1$ gives $\Phi_{10}=x^4-x^3+x^2-x+1$. Therefore a primitive tenth root has degree $4$ over $\mathbb Q$, not degree $10$.
Vieta: normalise and check the sign
- For $a_dx^d+a_{d-1}x^{d-1}+\cdots+a_0$ with $a_d\ne0$, list all complex roots with multiplicity. Their sum is $-a_{d-1}/a_d$ and their product is $(-1)^d a_0/a_d$; the leading coefficient matters when the polynomial is not monic.
- In $\Phi_{10}$, the four primitive roots sum to $1$ and multiply to $1$. For $x^{10}-1$, all ten roots sum to $0$ and multiply to $-1$. First decide which roots the question includes, then read the corresponding polynomial.
What is the product of all three complex roots, counted with multiplicity, of $3x^3-6x^2+5x-9$?
Difficulty 2/5 · 140 coins + a small bonus on first completion today
The product is (−1)³a₀/a₃ = −(−9)/3 = 3. Dividing by the leading coefficient is essential.
Compare the sums and products of all complex tenth roots of unity with those of just the primitive tenth roots. State the polynomial and the number of roots used in each calculation.
All tenth roots are the ten roots of $x^{10}-1$. Its x⁹ coefficient is 0 and its constant term is −1, so their sum is 0 and product is −1. The primitive tenth roots have exponents 1,3,7,9 relative to $\zeta_{10}$, and are the four roots of $\Phi_{10}=x^4-x^3+x^2-x+1$. Their sum is 1 and product is 1 by Vieta. The root −1 has order 2, so must not enter the primitive-root calculation. The cyclotomic degree 4 is the degree over ℚ of any primitive tenth root.
Keep the base field and operation visible
- Name the coefficient field before using irreducibility or a minimal polynomial. The no-root test is decisive only in degrees $2$ and $3$; a field quotient requires a nonconstant irreducible polynomial, and the count $q^d$ requires a base field with $q$ elements.
- Distinguish additive from multiplicative order, build a field chain before multiplying degrees, and separate primitive complex roots from all roots of unity before applying Vieta.