Overview

  • Why is xn−x−1x^n-x-1 irreducible, and why is its group SnS_n?
  • 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 n≥2n\ge2, fn(x)=xn−x−1f_n(x)=x^n-x-1 is irreducible over Q\mathbb Q, and its splitting field has Galois group SnS_n.

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

Prime-degree irreducibility

Let pp be prime and let α\alpha satisfy αp−α−1=0\alpha^p-\alpha-1=0 over F‾p\overline{\mathbb F}_p. Then αpk=α+k\alpha^{p^k}=\alpha+k, where kk is read in Fp\mathbb F_p. The least positive kk for which this equals α\alpha is pp. Thus the Frobenius orbit has length pp, and xp−x−1x^p-x-1 is irreducible over Fp\mathbb F_p. Reduction then proves irreducibility over Q\mathbb Q.

This Artin–Schreier argument uses the equality of the degree and the residue characteristic. It does not cover composite degrees.

References 1

Example

Example

For x5−x−1x^5-x-1, reduction modulo 55 gives a 5-cycle. Modulo 22,

x5+x+1=(x2+x+1)(x3+x2+1),x^5+x+1=(x^2+x+1)(x^3+x^2+1),

where the two factors are irreducible. The group therefore contains an element of type (2,3)(2,3), whose cube is a transposition. Label the roots by Z/5Z\mathbb Z/5\mathbb Z 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 S5S_5, proving the claim.

References 2

Ramification

For fnf_n, the simultaneous equations fn(a)=fn′(a)=0f_n(a)=f_n'(a)=0 modulo a prime give nan−1=1na^{n-1}=1 and (n−1)a=−n(n-1)a=-n. They force a unique possible multiple root. Such a prime divides neither nn nor n−1n-1, and fn′′(a)=n(n−1)an−2≠0f_n''(a)=n(n-1)a^{n-2}\ne0, 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 Q\mathbb Q 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 SnS_n.

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 xn+axr+bx^n+ax^r+b, 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

Degree twelve

Suppose f=x12+ax6+b∈Q[x]f=x^{12}+ax^6+b\in\mathbb Q[x] is irreducible. Chen classifies all 16 possible Galois groups. The proof uses the decompositions

f=g4(x3)=g6(x2),g4=x4+ax2+b,g6=x6+ax3+b.f=g_4(x^3)=g_6(x^2),\qquad g_4=x^4+ax^2+b,\quad g_6=x^6+ax^3+b.

The groups of g4,g6g_4,g_6, 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 r=x3−3bx+abr=x^3-3bx+ab. Irreducibility of ff is an input hypothesis.

Example

For f=x12+4x6+2f=x^{12}+4x^6+2, Eisenstein at 2 proves irreducibility. Here b(a2−4b)=16b(a^2-4b)=16, b=2b=2 is not a rational cube, and r=x3−6x+8r=x^3-6x+8 has no rational root. The first branch of the algorithm gives 12T3912T39, the transitive-group catalogue label.

References 1

Cubic power compositions

For g=x3+ax2+bx+c∈Q[x]g=x^3+ax^2+bx+c\in\mathbb Q[x] and irreducible f=g(x3)f=g(x^3), Awtrey–Patane–Toone classify 11 possible transitive groups in degree nine. They use the discriminants of ff and gg, 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

Small coefficients: a preprint result

Garmi’s version 3 preprint gives a uniform symmetric-group claim for a family with coefficients in {−1,1}\{-1,1\}. For coprime integers n>k>0n>k>0 with n>8n>8, it states that

Pn,k(x)=∑j=kn−1xj−∑j=0k−1xjP_{n,k}(x)=\sum_{j=k}^{n-1}x^j-\sum_{j=0}^{k-1}x^j

has Galois group Sn−1S_{n-1} over Q\mathbb Q. The identity (x−1)Pn,k(x)=xn−2xk+1(x-1)P_{n,k}(x)=x^n-2x^k+1 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

Questions

Research directionPolynomial families

Which sparse families admit a uniform ramification argument?

Scope. A specified family xn+anxrn+bnx^n+a_nx^{r_n}+b_n over Q\mathbb Q.

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
Discuss this question →

Related topics

References

  1. On the irreducibility of certain trinomials

    Selmer, Ernst S. Mathematica Scandinavica, 4, 287–302, 1956.

    Read the source
  2. 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
  3. 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
  4. Finite Fields

    Lidl, Rudolf and Niederreiter, Harald. Edition 2. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 20, 1997.

    Read the source
  5. Galois groups over Q and factorizations mod p

    Conrad, Keith. Author-hosted expository note.

    Read the source
  6. Recognizing Galois groups S_n and A_n

    Conrad, Keith. Author-hosted expository note.

    Read the source
  7. Algebraic Number Theory

    Neukirch, Jürgen. Springer, Grundlehren der mathematischen Wissenschaften, vol. 322, 1999.

    Read the source
  8. On the irreducibility of certain trinomials and quadrinomials

    Ljunggren, Wilhelm. Mathematica Scandinavica, 8, 65–70, 1960.

    Read the source
  9. Galois groups of trinomials

    Cohen, Stephen D. and Movahhedi, A. and Salinier, Alain. Journal of Algebra, 222(2), 561–573, 1999.

    Read the source
  10. Elementary characterization of the Galois groups of x^12+ax^6+b

    Chen, Malcolm Hoong Wai. Mathematica Slovaca, 2026.

    Read the source
  11. 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
  12. Galois Groups of Trinomials with Small Coefficients

    Garmi, Hilel. arXiv:2610.22764v3, 2026.

    Read the source