Motivation
A finite separable extension has a primitive element: one element generates the whole field. The earlier trace-pairing chapter proves that theorem. The hypothesis matters, because a finite purely inseparable extension can require two generators. What structural feature distinguishes a finite extension that is simple from one that is not, even when separability fails?
The answer is its intermediate fields. A finite extension is simple exactly when it has only finitely many fields between base and top. One direction uses minimal-polynomial coefficients; the other uses an elementary pigeonhole argument when the base is infinite. We then revisit the two-independent-th-root example and exhibit infinitely many distinct intermediate fields.
Definitions and prerequisites
Let be a finite field extension. It is simple if for some . An intermediate field is a field with , including both endpoints. Finiteness of the degree means that has a finite -basis; it does not mean that has finitely many elements when is infinite.
For algebraic over an intermediate field , its monic minimal polynomial is the unique monic polynomial of least positive degree in with root . We use the tower law and unique factorization in a polynomial ring over a field. For the finite-base case we use the companion finite-field theorem that the multiplicative group of a finite field is cyclic.
From one generator to finitely many fields
Theorem 1.7.1
(A simple finite extension has finitely many intermediate fields)
If is finite, then only finitely many fields satisfy . No separability assumption is needed.
Proof
(Coefficient fields of minimal polynomials)
Let be the minimal polynomial of over . For an intermediate field , let be its monic minimal polynomial over . Since , the polynomial divides in , hence also in . The ring has unique factorization. A nonzero polynomial has only finitely many monic divisors: after factoring it into finitely many monic irreducibles, choose an exponent between zero and the multiplicity for each factor. Thus only finitely many polynomials can occur as , even if has repeated roots.
Why does knowing determine ? Let be the field generated over by its coefficients. Then . The polynomial is irreducible over , so it is also irreducible over the smaller field : a nontrivial factorization over would be one over . Because it is monic and has root , it is the minimal polynomial of over as well. Consequently
The tower law gives , so and . Hence distinct intermediate fields yield distinct monic divisors, proving finiteness. No claim is made that every divisor actually arises from an intermediate field.
Proof X-ray
A polynomial remembers its field
The minimal polynomial over has coefficients in , so their field starts out only as a subfield of . Irreducibility persists when coefficients are restricted from to . Since generates the top field over either base, the two extension degrees agree; the tower law forces .
Worked example 1.7.2
(A quadratic extension)
For , the degree is two. If , the tower law gives . Both factors are positive integers, so is either or . This small example can be counted directly; the theorem also handles much larger simple extensions without listing every intermediate field.
From finitely many fields to one generator
Theorem 1.7.3
(The finite-intermediate-field criterion)
A finite extension is simple if and only if it has finitely many intermediate fields.
Proof
(Pigeonhole over an infinite base, a cyclic group over a finite one)
It remains to prove the converse. Suppose first that is infinite and has finitely many intermediate fields. Choose . Each gives an intermediate field . Since there are infinitely many but only finitely many fields, two distinct scalars satisfy
Both and lie in . Subtracting and dividing by the nonzero scalar shows , and then . The reverse containment is immediate, so . Thus any two elements generate a simple extension together.
Choose a finite -basis of . Then . Repeatedly replace two generators by one using the two-element argument. After finitely many steps, for some . At each step the two elements being combined may be different from those in the preceding step, but their generated field is preserved exactly. This elementary existence argument uses infinitely many available scalar choices only to obtain two distinct choices with the same field; it does not claim that every linear combination is primitive. For instance, when combining and , the coefficient gives only , a proper subfield of their compositum.
If is finite, is a finite set because it is finite-dimensional over . Its nonzero multiplicative group is cyclic. A generator of , together with zero, already contains all elements of in , so . This handles the finite-base case without the infinite pigeonhole argument.
Worked example 1.7.4
(A finite field extension)
The field may be written with . Its nonzero elements are , and , . Thus generates both the multiplicative group and the extension. There are only two intermediate fields by the degree-two tower law.
Worked example 1.7.5
(Combining two quadratic generators)
Let and put . Since , we have
Thus . Also , so satisfies . The companion biquadratic Galois calculation identifies the five intermediate fields: , the three quadratic fields generated by , and .
Watching coefficients recover an intermediate field
In the preceding biquadratic example, the coefficient method can be made explicit. Over , the element satisfies
The degree is two: the displayed biquadratic extension has degree four over , while has degree two. Since , the quadratic is the minimal polynomial of over . Its coefficients generate , exactly as the general proof predicts.
Over , the relation gives the minimal polynomial . Its coefficient field is . Over , the analogous relation gives , whose coefficient field is . In both cases the degree is two by the same tower calculation. Over the bottom field the minimal polynomial is the quartic, and over it is . These five different coefficient fields agree with the five intermediate fields found by Galois correspondence.
This example also shows why a factorization alone is not the whole argument. A monic divisor with coefficients in an intermediate field need not be the minimal polynomial of the chosen generator over that field. The injection used in the proof selects exactly the minimal polynomial, then uses its irreducibility over its own coefficient field to recover the intermediate field. No enumeration of all divisors is needed to conclude that there are finitely many.
Concept lensStructural
Separable extensions through the Galois correspondence
The criterion gives a second route to the primitive element theorem. Let be finite separable and let be a normal closure of over ; then is finite Galois. By the Galois correspondence, the intermediate fields of correspond to the subgroups of the finite group , so there are finitely many. Every intermediate field of is among them, and the criterion makes simple. Without separability no such finite group is available, as the family below shows.
An inseparable extension with infinitely many intermediate fields
Theorem 1.7.6
(A concrete infinite family)
Let for independent indeterminates , and let , . The finite extension has degree and is not simple. More precisely, the fields are distinct for distinct .
Proof
(Degrees, th powers and coefficient comparison)
The -valuation shows that is not a th power in , so is irreducible and . The field is , where and are algebraically independent: a polynomial relation would yield one between and . Its -valuation shows that is not a th power there, so adjoining has degree . The tower law gives and a basis
We use the prime binomial test from the companion unit; it remains valid in characteristic .
Every satisfies : write it in the displayed basis and apply the characteristic- identity . Thus satisfies and . Since , no generates . This recovers the earlier nonsimple example.
Now let for . It is not in , because the basis elements are linearly independent. Also . Its minimal polynomial has degree : if a monic factor of had degree with , its coefficient of would be . Since is nonzero in , this would imply , a contradiction. Therefore is a -basis of .
Suppose . Write with . In the basis , the coefficient of for each is on the right and zero on the left. Hence these vanish. Comparing coefficients of and in then gives and . Thus distinct scalars give distinct intermediate fields. Since is infinite, there are infinitely many of them. Each is a proper intermediate field: its degree over is , whereas the degree of is . The family therefore gives a concrete witness to the failure of the finite-intermediate-field condition, not merely a nonconstructive appeal to the theorem.
Worked example 1.7.7
(Characteristic two)
Take . Each satisfies and generates a degree-two intermediate field. Every element of has the form with . If , comparing the basis elements forces , and . This makes the general coefficient comparison especially visible.
Common mistakes
Common mistake
(Intermediate fields, not elements)
A finite-degree extension of an infinite field always has infinitely many elements, since it contains the base field. The theorem counts intermediate fields, not elements or subspaces.
Common mistake
(Why determines )
The minimal polynomial over determines only because generates all of and the tower-degree argument applies.
Common mistake
(Simple does not imply separable)
Finite and separable implies simple, but simple does not imply separable: an irreducible over gives a simple purely inseparable extension of degree .
Summary
For a simple finite extension, each intermediate field is recovered from the coefficients of a monic divisor of one polynomial, so only finitely many can occur. Conversely, finitely many intermediate fields force two generators to combine into one over an infinite base; finite fields are handled by a multiplicative generator. The two-root purely inseparable extension shows explicitly how nonsimplicity produces infinitely many intermediate fields.
Exercises
Quick check
(What does it mean for to be simple?)
Solution · Answer
There is an element with .
Quick check
(Why does the minimal polynomial of over divide the one over ?)
Solution · Answer
The polynomial over also lies in and vanishes at , so the minimal polynomial over divides it.
Quick check
(Why are there finitely many monic divisors of a nonzero polynomial in ?)
Solution · Answer
Factor it into finitely many monic irreducibles; each divisor chooses one of finitely many possible exponents for each factor.
Quick check
(If is generated by the coefficients of , why is irreducible over ?)
Solution · Answer
A factorization over the smaller field would also be a factorization over , contradicting irreducibility there.
Quick check
(How does the tower law show ?)
Solution · Answer
Both and equal , so .
Quick check
(Where is infinitude of used in the converse?)
Solution · Answer
It supplies infinitely many choices of but only finitely many fields , forcing two different scalars to give the same field.
Quick check
(If for , how do we recover in that common field?)
Solution · Answer
Their difference is , so division gives and substitution gives .
Quick check
(Why is a finite extension of a finite field simple?)
Solution · Answer
Its multiplicative group is cyclic; a generator, together with zero, generates the entire field over the base.
Quick check
(What is the degree of , and how many intermediate fields does it have?)
Solution · Answer
The degree is two, and the tower law leaves only the base and top fields.
Quick check
(Why can no element of the two-root example generate ?)
Solution · Answer
Every element has its th power in , so its degree is at most , while .
Quick check
(Why does have degree over ?)
Solution
Its th power is in ; a proper factor of would have coefficient for and force .
Quick check
(Does simplicity of a finite extension imply separability?)
Solution · Answer
No. A simple extension defined by an irreducible in characteristic is purely inseparable.