Overview
- Why is irreducible, and why is its group ?
- How do reductions modulo two primes determine the quintic group?
- How does a power composition restrict the group of a trinomial?
The family xⁿ−x−1
Theorem (Selmer; Nart–Vila)
For every integer , is irreducible over , and its splitting field has Galois group .
Selmer proved irreducibility in 1956. Nart and Vila first proved the all-degree group statement in 1979; Osada obtained it independently as a consequence of a broader trinomial criterion.
References 3
- Selmer1956Irreducibility of x^n−x−1.Source
- NartVila1979The first all-degree symmetric-group result.Source
- Osada1987 · Corollary 3Independent proof through a general trinomial criterion.Source
Prime-degree irreducibility
Let be prime and let satisfy over . Then , where is read in . The least positive for which this equals is . Thus the Frobenius orbit has length , and is irreducible over . Reduction then proves irreducibility over .
This Artin–Schreier argument uses the equality of the degree and the residue characteristic. It does not cover composite degrees.
References 1
- LidlNiederreiter1997Frobenius orbits and irreducible polynomials over finite fields; the orbit computation is explicit.Source
Example
Example
For , reduction modulo gives a 5-cycle. Modulo ,
where the two factors are irreducible. The group therefore contains an element of type , whose cube is a transposition. Label the roots by so that the 5-cycle adds one. Conjugating the transposition by its powers gives all edges with a fixed nonzero difference. These edges form a connected graph. Edge transpositions of a connected graph generate , proving the claim.
References 2
- ConradModPFactorization patterns give Frobenius cycle types.Source
- ConradSnAnPermutation-group criteria; the graph proof is included here.Source
Ramification
For , the simultaneous equations modulo a prime give and . They force a unique possible multiple root. Such a prime divides neither nor , and , so that root is double. An inertia element fixes each root with simple reduction and can only exchange the two roots above the double root. Thus every nontrivial inertia group is generated by a transposition.
The normal subgroup generated by the finite inertia groups fixes an extension of unramified at all finite primes. Minkowski's discriminant bound implies that this extension is trivial. Hence the whole Galois group is generated by transpositions. Selmer's irreducibility makes its action transitive, and the connected-graph argument now gives .
References 2
- Osada1987 · Corollary 3 and its proof mechanismRamification and generation by transpositions.Source
- Neukirch1999Minkowski’s discriminant bound and the absence of nontrivial everywhere-finitely-unramified extensions of Q.Source
General trinomials
For , a common divisor of the exponents may give a power composition. Cyclotomic factors and the nonreciprocal part require separate analysis. Common roots of the polynomial and its derivative determine whether a bad prime produces a single double root or a more complicated multiplicity pattern. The latter may give inertia elements other than transpositions. Selmer, Ljunggren, and Cohen–Movahhedi–Salinier study factorization and Galois groups in these broader families.
References 2
- Ljunggren1960Factorization phenomena for trinomials and quadrinomials.Source
- CohenMovahhediSalinier1999Broader trinomial Galois-group analysis.Source
Degree twelve
Suppose is irreducible. Chen classifies all 16 possible Galois groups. The proof uses the decompositions
The groups of , followed by at most two additional rational-square tests, distinguish the possibilities. Theorem 3.8 gives the complete algorithm, including tests for rational cubes and reducibility of . Irreducibility of is an input hypothesis.
Example
For , Eisenstein at 2 proves irreducibility. Here , is not a rational cube, and has no rational root. The first branch of the algorithm gives , the transitive-group catalogue label.
References 1
- Chen2026Dodecic · Theorem 3.8; Table 2Source
Cubic power compositions
For and irreducible , Awtrey–Patane–Toone classify 11 possible transitive groups in degree nine. They use the discriminants of and , together with two further resolvents. Their work also addresses the converse problem: whether a given number field admits a defining polynomial of this compositional shape. As in the degree-twelve case, the power composition partitions the roots into blocks.
References 1
- AwtreyPataneToone2025 · Abstract and IntroductionSource
Small coefficients: a preprint result
Garmi’s version 3 preprint gives a uniform symmetric-group claim for a family with coefficients in . For coprime integers with , it states that
has Galois group over . The identity connects this claim to trinomials. The coprimality and degree conditions are essential to the cited statement. This is a preprint result; its proof has not been independently verified here.
References 1
- Garmi2026Trinomials · Corollary 1.3, p. 2; definitions preceding Theorem 1.1, p. 1; arXiv:2610.22764v3Source
Questions
Which sparse families admit a uniform ramification argument?
Scope. A specified family over .
The relevant data are the primes at which roots coincide and the resulting multiplicities. A uniform proof requires transitivity and sufficient inertia generators; modular cycle types computed in individual degrees do not suffice.
References 2
Related topics
Frobenius and factorization modulo primes
Small good primes provide finite certificates in individual degrees.
UsesTransitivity, primitivity, and cycle criteria
A transitive group generated by transpositions is symmetric.
GeneralizesSparse polynomials and factor reversal
Sparse families may require separating reciprocal and nonreciprocal factors.
Supplies examples forInverse Galois theory and generic polynomials
The family realizes every symmetric group over Q.
UsesCapelli’s theorem and polynomial composition
The factorization of a power composition is controlled over a root field; irreducibility must precede the classification.
Related familyTruncated binomial polynomials
Binomial truncations provide another family with local factor-degree methods.
Related familyFive-term Newman polynomials
Five-term polynomials lead to a cyclotomic-factor conjecture.
Linked from 2 articles
References
- On the irreducibility of certain trinomials
Selmer, Ernst S. Mathematica Scandinavica, 4, 287–302, 1956.
Read the source - Equations of the type X^n+aX+b with absolute Galois group S_n
Nart, Enric and Vila, Núria. Revista de la Universidad de Santander, 2, 821–825, 1979.
Read the source - The Galois groups of the polynomials X^n+aX^l+b
Osada, Hiroyuki. Journal of Number Theory, 25(2), 230–238, 1987.
Read the source - Finite Fields
Lidl, Rudolf and Niederreiter, Harald. Edition 2. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 20, 1997.
Read the source - Galois groups over Q and factorizations mod p
Conrad, Keith. Author-hosted expository note.
Read the source - Recognizing Galois groups S_n and A_n
Conrad, Keith. Author-hosted expository note.
Read the source - Algebraic Number Theory
Neukirch, Jürgen. Springer, Grundlehren der mathematischen Wissenschaften, vol. 322, 1999.
Read the source - On the irreducibility of certain trinomials and quadrinomials
Ljunggren, Wilhelm. Mathematica Scandinavica, 8, 65–70, 1960.
Read the source - Galois groups of trinomials
Cohen, Stephen D. and Movahhedi, A. and Salinier, Alain. Journal of Algebra, 222(2), 561–573, 1999.
Read the source - Elementary characterization of the Galois groups of x^12+ax^6+b
Chen, Malcolm Hoong Wai. Mathematica Slovaca, 2026.
Read the source - On Galois groups of power compositional nonic polynomials
Awtrey, Chad and Patane, Frank and Toone, Brian. Bulletin of the Australian Mathematical Society, 112(3), 458–472, 2025.
Read the source - Galois Groups of Trinomials with Small Coefficients
Garmi, Hilel. arXiv:2610.22764v3, 2026.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.