Overview
- Why does an irreducible polynomial define a field?
- How are minimal polynomials and extension degrees related?
- When does a field generated by one root contain all the roots?
- When does irreducibility survive an extension of the ground field?
Minimal polynomials
Let be a field extension and let be algebraic over . Among the nonzero polynomials in that vanish at , choose a monic one of least degree. This is the minimal polynomial .
It is irreducible: a factorization into positive degrees would force one factor to vanish at , contradicting minimality. The division algorithm also shows that every polynomial vanishing at is divisible by . These properties prove uniqueness.
For example, is the minimal polynomial of over . The polynomial also vanishes at , but it is not minimal:
Over , the minimal polynomial is instead . The coefficient field is part of the definition.
References 2
- ConradRootsIrreducibles · Theorem 3.1Source
- Lang2002 · Chapter VAlgebraic extensions and minimal polynomials.Source
Arithmetic modulo an irreducible polynomial
Theorem
For a field and a nonconstant polynomial , the quotient is a field if and only if is irreducible. If is monic of degree , this field has basis , where is the class of .
Proof
When is irreducible, a nonzero class has a representative of degree less than with . Bézout’s identity gives , so the class of is its inverse. Conversely, if with both degrees positive, the nonzero classes of multiply to zero; the quotient cannot be a field. The basis assertion follows from division with remainder.
Evaluation at an algebraic element gives an isomorphism . Thus
Example
In , with , multiplication reduces using this relation. In particular,
References 1
- Milne2022 · 1.25 and the discussion of stem fields, pp. 14–16Author’s book page
The tower law
Theorem
For finite extensions ,
If is a basis of and is a basis of , then the products form a basis of . This proves the formula and shows how to construct a basis through successive adjunctions.
Example
Set . Its degree is at most . Since it contains subfields of degrees two and three, the tower law shows that both two and three divide . Hence . The six elements are a basis.
In particular, the degree of every intermediate field divides the degree of the full extension. A prime-degree extension therefore has no proper intermediate field.
References 1
- Milne2022 · Proposition 1.20Multiplicativity of extension degrees.Author’s book page
Roots and embeddings
A -embedding is determined by the image of , which must be a root of . Conversely, every root of this polynomial gives such an embedding. Thus the number of embeddings equals the number of distinct roots of the minimal polynomial.
An element is separable when its minimal polynomial has distinct roots. A finite extension is separable when every element of is separable over ; equivalently, it has exactly embeddings into . In characteristic zero, all finite extensions are separable.
An embedding need not be an automorphism of the original field. The three embeddings of into send to its three conjugate roots. Only the real root lies in , so this field has no nonidentity -automorphism.
References 2
- Milne2022 · Proposition 2.1 and Corollary 2.14; Chapter 3, separable extensions (2022 book)Author’s book page
- ConradGaloisCorrespondence · Example 1.2Source
Splitting fields and normality
A splitting field of is an extension generated over by all roots of . It exists by adjoining roots successively, and any two splitting fields are isomorphic over . An algebraic extension is normal when every irreducible polynomial in having a root in splits completely there. A finite extension is normal exactly when it is the splitting field of some polynomial.
A finite extension is Galois when it is both normal and separable. Its automorphism group has order . In particular, the splitting field of a separable polynomial is Galois. For a degree- separable polynomial, the faithful action on its roots embeds this group in , so the splitting-field degree divides .
Example ·
Let . Eisenstein gives . The splitting field is , and because is real. The automorphisms
satisfy and . They generate the dihedral group of order eight, acting on the four roots as the symmetries of a square.
References 2
- Milne2022 · Theorem 3.10; Chapter 2, splitting fieldsAuthor’s book page
- ConradGaloisCorrespondence · Example 4.7The splitting field and dihedral group of x⁴−2.Source
Characteristic and separability
For an irreducible polynomial , a repeated root occurs exactly when . Indeed, would force , which is possible only when the derivative vanishes. In characteristic , this means that every exponent with a nonzero coefficient is divisible by .
Over a finite field, the map is bijective. If an irreducible polynomial of degree greater than one had zero derivative, taking -th roots of its coefficients would express it as a -th power, a contradiction. This proves that finite fields are perfect.
The field is not perfect: is not a -th power there. The polynomial is Eisenstein at in , hence irreducible over . Its derivative is zero, and it has only one distinct root. This is why irreducibility alone does not ensure a transitive action on as many distinct roots as the degree.
References 2
- Milne2022 · Example 2.18; Propositions 2.21 and 2.24Author’s book page
- Lang2002Gauss’s lemma over a unique factorization domain.Source
A single generator
The primitive element theorem states that every finite separable extension has the form for one element . For an infinite ground field, a useful form says that if is finite and separable, then generates the extension for all but finitely many . The exceptional choices occur when two distinct embeddings have the same value on .
Example
Take . Since ,
Consequently , an extension of degree four. Squaring gives , and therefore
The degree calculation proves that is its minimal polynomial and is irreducible. This field already contains the four roots , so it is also the splitting field.
References 2
- Milne2022 · Theorem 5.1 and Remark 5.2, pp. 78–79Author’s book page
- ConradAllPrimes · Theorem 1The quartic example and its roots.Source
Trace and norm
For a finite extension , multiplication by is a -linear map on . Its trace and determinant are the field trace and field norm . The norm is multiplicative because determinants are multiplicative.
For a separable extension, these quantities are the sum and product of over all -embeddings . In particular, if and the minimal polynomial is , then
Example
In , the norm of is . Thus . Since a square has square norm, is not a square in this field. This gives an irreducibility test for .
The converse fails: , but is not a square in . Indeed, , with , would give , and then either or , both impossible.
Norms therefore detect some power obstructions in Capelli’s composition theorem. They also connect irreducibility with discriminants: for a monic separable irreducible polynomial of degree and a root ,
The product formula for the norm turns this into the usual product of squared root differences.
References 1
- Milne2022 · Proposition 5.44, Corollary 5.45, Remark 5.47, and Proposition 5.49, pp. 106–108Author’s book page
Irreducibility after extending the ground field
Proposition
Let be irreducible of degree , and let be a finite extension of degree . If , then remains irreducible over .
Proof
Choose a root of in an algebraic closure containing , and put . The two towers give
Thus . Coprimality gives , while because . Hence , which is the required irreducibility.
For example, an irreducible cubic over remains irreducible over every quadratic extension. Its Galois group can nevertheless change: adjoining a primitive cube root of unity changes the group of from to . More generally, the intersection with the splitting field determines the new group.
References 2
- Milne2022 · Proposition 1.20The displayed consequence is proved directly by the tower law.Author’s book page
- ConradGaloisComposita · Theorem 2.6Galois groups after extending the coefficient field.Source
Related topics
Connected diagrams
- Subgroup index and the smallest defining equation · Classical
- Which new primes create a prescribed Fekete factor? · Published
Foundations: polynomials, fields, and Galois groups
Field extensions give the algebra behind the overview.
Leads toThe Galois correspondence and intermediate fields
Normal and separable extensions admit the field–subgroup correspondence.
Applies toCapelli’s theorem and polynomial composition
The tower law proves Capelli’s composition theorem.
Applies toIrreducibility over finite fields
An irreducible polynomial constructs a finite extension field.
Leads toSpecialization and Hilbert irreducibility
Polynomials over K(t) define function-field extensions before specialization.
References
- Roots and irreducibles
Conrad, Keith. Author-hosted expository notes.
Read the source - Algebra
Lang, Serge. Edition 3. Springer, Graduate Texts in Mathematics, vol. 211, 2002.
Read the source - Fields and Galois Theory
Milne, James S. Kea Books, 2022.
Author’s book page - The Galois correspondence
Conrad, Keith. Author-hosted expository notes.
Read the source - An irreducible that factors modulo all primes
Conrad, Keith. Author-hosted expository note.
Read the source - The Galois correspondence at work
Conrad, Keith. Author-hosted expository notes.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.