Motivation
A single quintic that is not solvable by radicals proves that degree five can behave differently from the cubic. It does not by itself explain the algebraic statement that a polynomial with independent coefficient parameters has no radical solution over the field of rational functions in those parameters. That generic statement needs a field, a polynomial over that field and a proof of its Galois group.
We will construct the generic coefficients from independent root variables. Every permutation of those roots leaves the coefficients unchanged. A degree bound then shows that no additional automorphisms can appear. The resulting group is , and the already proved radical criterion and nonsolvability of answer the generic question in characteristic zero. The claim is precise and field-theoretic: it does not assert that every particular degree- polynomial is nonsolvable or that every symbolic formula has a valid specialization at every coefficient value.
Independent variables and coefficients
Definition 7.3.1
(Elementary symmetric polynomials and the generic polynomial)
Let be a field and algebraically independent indeterminates, where . Work in the rational function field . For let be the th elementary symmetric polynomial in the : , , and is the sum of products over all -element index sets. Put . The generic polynomial of degree is
The polynomial has coefficients in . Calling its coefficients generic requires showing that the satisfy no polynomial relation over . Otherwise could be a specialized coefficient field in disguise.
Independence of the elementary coefficients
Theorem 7.3.2
(The elementary symmetric coefficients are independent)
The elements are algebraically independent over . Consequently is a rational function field in variables over .
Proof
(Proof by leading monomials)
Order monomials in lexicographically with . The leading monomial of is , with coefficient one. Thus the leading monomial of
is
The exponent vector determines every by taking consecutive differences. Distinct monomials in the therefore have distinct leading monomials in the .
Suppose a nonzero polynomial satisfied . Among the finitely many nonzero terms of , choose the one whose substituted leading monomial is largest. No other term has that leading monomial, so its nonzero coefficient cannot cancel. The substitution is therefore nonzero, a contradiction. The argument uses the monomial order and works in every characteristic; it does not divide by .
Worked example 7.3.3
(Two independent roots)
For , and . The leading monomial of is . From its exponent pair one recovers and then . Thus no nonzero polynomial in vanishes. The generic quadratic is over .
The splitting-field calculation
Theorem 7.3.4
(The generic Galois group)
For every field and , the splitting field over of is , and
In particular, is separable and irreducible over .
Proof
(Proof by matching the two degree bounds)
The are distinct elements of , so is separable. Its splitting field is : the left side contains and all the , while . Hence is a finite Galois extension once we establish finiteness.
Adjoin the roots one at a time. The first has degree at most over . After adjoining it, divide by its linear factor; the next root satisfies a polynomial of degree over the field already constructed. Continue: the tower law gives
This bound needs neither irreducibility of nor a prior identification of the group.
Every defines an -automorphism of the polynomial ring by ; it extends to the rational function field. Each is unchanged, so the automorphism fixes . Distinct permutations induce distinct automorphisms, because the are distinct. We have constructed distinct -automorphisms of .
For any finite extension, the number of distinct -embeddings into an algebraic closure is at most its degree. Thus . Together with the upper bound this forces , and the constructed permutations exhaust the Galois group. Equivalently, the group acts faithfully on the roots and already contains every permutation of them. The action is transitive, so all have the same minimal polynomial over . For this is the trivial one-element action, the field extension has degree one, and the statement still holds. For larger , transitivity follows because a permutation can send any chosen index to any other. That minimal polynomial divides and has all roots, hence equals . This proves irreducibility rather than assuming it.
Proof X-ray
The two inequalities meet
The root-by-root tower limits the splitting-field degree to . Explicit root permutations supply distinct automorphisms, and a finite extension has at least as large a degree as its number of embeddings. Since the lower and upper bounds coincide, both the degree and the full group are determined. The argument does not require the full theorem on symmetric rational functions.
The generic radical obstruction
Theorem 7.3.5
(Nonsolvability over the generic coefficient field)
Let have characteristic zero and . The generic polynomial above is not solvable by radicals over .
Proof
(Proof from the radical criterion)
The companion radical-criterion chapter proves that a separable polynomial over a characteristic-zero field is solvable by radicals if and only if the Galois group of its splitting field is solvable. The alternating-five continuation proves that is not solvable for . The preceding theorem identifies the generic Galois group as . All hypotheses of the criterion are therefore met, and its contrapositive proves the statement.
This is a statement about an extension of the rational function field . A radical tower may use elements of that field and successive radicals; it cannot contain a splitting field for the generic polynomial. The conclusion is not the claim that no particular coefficient choice yields solvable roots. Substitution into a rational function can also make a denominator zero, so an informal appeal to specialization is not a substitute for the generic-field proof.
Worked example 7.3.6
(The generic quadratic is solvable)
When , the generic quadratic has roots
Adjoining the displayed square root gives both roots. The group is solvable, consistent with the radical criterion. This calculation is not used to prove the theorem for all ; it shows how the coefficient field enters an explicit radical expression.
Worked example 7.3.7
(A generic quintic versus a special one)
Take and . The theorem gives Galois group over and no radical solution there. By contrast, over splits after adjoining a fifth root of two and a fifth root of unity. Its coefficients are specific constants, not independent variables. The specialization changes the base-field problem and can change the Galois group.
Worked example 7.3.8
(The generic cubic group)
For , there are six permutations of the independent roots, so the same tower-and-automorphism argument gives degree six and group . This group is solvable: has abelian quotients. The obstruction for therefore does not follow merely from having a full symmetric group; it depends on whether that group is solvable.
A characteristic-two check
Worked example 7.3.9
(Distinct generic roots in characteristic two)
Take and . The generic quadratic is , and its derivative is the nonzero rational function . The latter is nonzero because are independent indeterminates: their sum is a nonzero polynomial and remains nonzero in its fraction field. Consequently the derivative is a nonzero constant and the polynomial has distinct roots. The transposition fixes both coefficients, so its splitting-field group is still .
This example helps separate two ideas: characteristic two makes the usual sign/discriminant test unable to distinguish even and odd permutations, but it does not make every quadratic inseparable. The direct root-permutation argument remains valid. It also does not prove a positive-characteristic radical criterion; that is a separate theorem with its own hypotheses.
To see the degree bound concretely here, adjoining has degree at most two, and is already in . The nontrivial swap fixes and moves , so the degree is at least two. Both inequalities give without dividing by two in the field. The same degree-counting principle is what made the general argument characteristic-independent.
Coefficients, roots and specializations
The signs in the generic polynomial are conventional. Since multiplying an indeterminate by is an invertible change of variables, the coefficients are algebraically independent too. Thus one may rename them and write the usual monic polynomial over . The independence proof is what justifies this renaming.
A permutation acts on the roots while fixing every coefficient, so it fixes the coefficient field pointwise. It generally does not fix an individual root. Conversely, every automorphism fixing the coefficient field permutes the roots because it preserves the polynomial equation. A splitting-field automorphism is determined by the images of generators ; that explains why there cannot be hidden automorphisms acting trivially on all roots.
Concept lensStructural
The coefficient field as the field of symmetric functions
The Galois correspondence turns the group computation into a description of . Since is Galois with group , the fixed field of acting on is exactly : a rational function in unchanged by every permutation of the variables is a rational function of . For instance, . The degree count thus yields the rational-function form of the symmetric function theorem, without an explicit reduction algorithm.
The generic group computation holds in arbitrary characteristic, including characteristic dividing . The radical conclusion here is restricted to characteristic zero because that is the scope of the cited criterion. Algebraic independence of the roots ensures separability of the generic polynomial, but it does not by itself establish the same radical criterion in every positive characteristic.
Common mistakes
Common mistake
(A generic coefficient is not an unspecified number)
A generic coefficient is an indeterminate, not an unspecified fixed number. A claim about the quintic with arbitrary rational coefficients is a claim about many polynomials over ; the theorem is a claim about one polynomial over .
Common mistake
(Automorphisms alone give only a lower bound)
Showing that acts by automorphisms fixing gives only ; the separate upper bound is needed to prove that there is nothing more. Likewise, irreducibility follows from the transitive action on all roots, not simply from the coefficients being symbols.
Finally, nonsolvability of the generic polynomial says nothing directly about a particular specialization, and the next block shows that even the Galois group can change.
Counterexample mode
Specializing the coefficients can shrink the Galois group
Claim: substituting constants for yields a polynomial whose Galois group is still . Take and with , . The result is , which splits over , so its Galois group is trivial rather than . For , the values and give . Its splitting field , with a primitive fifth root of unity, contains of degree (Eisenstein at ) and of degree , so its degree is divisible by ; it is at most because has degree at most over . The group has order , not . The correct statement is weaker: for a specialization with distinct roots, the Galois group acts faithfully on the roots and is therefore isomorphic to a subgroup of . Equality with is proved here only over the generic field .
Summary
Independent root variables produce independent elementary coefficients. Adjoining all roots has degree at most , while permuting them gives coefficient-fixing automorphisms. The generic Galois group is therefore . In characteristic zero and degree at least five, the radical criterion and nonsolvability of that group exclude a radical solution over the generic coefficient field.
Exercises
Quick check
(What is the leading monomial of in lexicographic order ?)
Solution · Answer
It is , with coefficient one: every other term of omits some with and uses a variable of larger index instead.
Exercise 7.3.10
(Show that distinct exponent vectors give distinct leading monomials of .)
FoundationProof
Solution(3)
- 1
Compute the leading monomial of the product
Because: Lexicographic order is compatible with multiplication, and each has leading monomial with coefficient one.
- 2
Recover the exponents by consecutive differences
Key step
- 3
Conclude injectivity
∎The vector determines , so distinct exponent vectors give distinct leading monomials.
Quick check
(Why is separable over ?)
Solution · Answer
Its roots are distinct elements of the rational function field , so has no repeated root. This holds in every characteristic.
Exercise 7.3.11
(Show that adjoining the roots one at a time gives .)
CoreProof
Solution(3)
- 1
Bound the first step
The root satisfies of degree , so .
- 2
Divide off the roots already adjoined
Key step
Put . Over we have with monic of degree . Since and no factor with vanishes, , so .
Because: Division by a monic linear factor stays in , and differs from .
- 3
Multiply with the tower law
∎
Quick check
(Why does a permutation of the fix ?)
Solution · Answer
Each elementary symmetric polynomial is unchanged by reordering the variables, the automorphism fixes , and is generated by the over . A field automorphism fixing a set of generators fixes the field they generate.
Quick check
(Why are two different root permutations different automorphisms of ?)
Solution · Answer
If , there is an index with . The two automorphisms send to the distinct indeterminates and .
Quick check
(What theorem supplies the lower bound ?)
Solution · Answer
A finite extension has at most its degree many distinct embeddings over the base field into an algebraic closure. The automorphisms of fixing are such embeddings.
Exercise 7.3.12
(Prove that the generic polynomial is irreducible over .)
CoreProof
Solution(4)
- 1
Move to any root
For each choose with .
Because: The generic Galois group theorem puts every permutation of the in .
- 2
Transport the minimal polynomial
Key step
Let be the minimal polynomial of . Since fixes the coefficients of , we get for every .
- 3
Compare degrees
Thus has the distinct roots , so . Also divides because , and both are monic, so .
- 4
Conclude
∎The polynomial is a minimal polynomial, hence irreducible over .
Quick check
(What is the Galois group of the generic polynomial when ?)
Solution · Answer
It is , of order six, and . It is solvable, through .
Exercise 7.3.13
(State which hypotheses and theorems give the radical obstruction for , and where each enters.)
Synthesis
Solution(4)
- 1
Fix the scope
Assume . The polynomial is separable over in any case, since its roots are distinct.
Because: The radical criterion is stated for characteristic zero.
- 2
Identify the group
By the generic Galois group theorem, ; this part holds in every characteristic.
- 3
Use nonsolvability of the symmetric group
Key step
For , is not solvable.
- 4
Apply the criterion
If were solvable by radicals over , the radical criterion would make solvable. It is not, so is not solvable by radicals over .
Quick check
(Does generic nonsolvability imply that is not solvable by radicals?)
Solution · Answer
No. That special polynomial is solvable by adjoining a fifth root of and a primitive fifth root of unity; specialization changes the field problem, and here the Galois group has order .
Quick check
(Why might substituting particular constants into a rational expression in the coefficients fail to be defined?)
Solution · Answer
Its denominator can become zero at the chosen coefficient values. For example, is a valid element of , but it has no value at , .