Overview

  • When is F(g(x)) irreducible over its coefficient field?
  • When is a binomial x^n−a irreducible in characteristic zero?
  • How can norms prove irreducibility of every iterate of x²+1?

Capelli’s composition theorem

Theorem · Capelli's composition lemma

Let KK be any field, let F∈K[x]F\in K[x] be irreducible of degree m≥1m\ge1, and let g∈K[x]g\in K[x] have degree d≥1d\ge1. For a root α\alpha of FF, the composition F(g(x))F(g(x)) is irreducible over KK if and only if g(x)−αg(x)-\alpha is irreducible over K(α)K(\alpha).

Proof

Choose a root β\beta of g(x)−αg(x)-\alpha. Since α=g(β)\alpha=g(\beta), we have K(α)⊆K(β)K(\alpha)\subseteq K(\beta), and

[K(β):K]=m [K(β):K(α)].[K(\beta):K]=m\,[K(\beta):K(\alpha)].

The polynomial F(g(x))F(g(x)), of degree mdmd, has root β\beta. It is irreducible exactly when the left side is mdmd, equivalently when the minimal polynomial of β\beta over K(α)K(\alpha) has degree dd.

When g=xr+cg=x^r+c, the new question is whether xr−(α−c)x^r-(\alpha-c) factors; power classes and norms give useful criteria.

References 2

Example

Example

Both F=x2−8F=x^2-8 and g=x2−3g=x^2-3 are irreducible over Q\mathbb Q, but

F(g(x))=x4−6x2+1=(x2−2x−1)(x2+2x−1).F(g(x))=x^4-6x^2+1=(x^2-2x-1)(x^2+2x-1).

For α=22\alpha=2\sqrt2, we have 3+α=(1+2)23+\alpha=(1+\sqrt2)^2, so g(x)−αg(x)-\alpha splits in Q(2)[x]\mathbb Q(\sqrt2)[x]. Irreducibility of the two inputs over Q\mathbb Q does not exclude this square in the root field.

References 1

Capelli’s binomial criterion

Theorem · Capelli's binomial criterion

Let KK have characteristic zero, a∈K×a\in K^\times, and n≥2n\ge2. Then xn−ax^n-a is irreducible over KK exactly when

  • a∉Kpa\notin K^p for every prime p∣np\mid n;
  • if 4∣n4\mid n, then a∉−4K4a\notin-4K^4.

Here Kp={bp:b∈K}K^p=\{b^p:b\in K\}. This statement is restricted to characteristic zero; finite-field questions are treated separately.

The first obstruction gives a difference-of-powers factorization. The exceptional fourth-power obstruction comes from

x4r+4b4=(x2r−2bxr+2b2)(x2r+2bxr+2b2).x^{4r}+4b^4=(x^{2r}-2bx^r+2b^2)(x^{2r}+2bx^r+2b^2).

These prove necessity. The proof of sufficiency uses successive prime-power extensions and excludes powers in the intermediate root fields. Odd-prime steps use norms; the power of two requires precisely the additional obstruction above.

Example

The polynomial x4+4x^4+4 factors by the displayed identity even though −4-4 is not a rational square. In contrast, x6−72x^6-72 is irreducible: 72=233272=2^3 3^2 is neither a square nor a cube. In fact xn−72x^n-72 is irreducible for every n≥2n\ge2, because no prime divides both valuation exponents 3,23,2, and a positive rational number cannot be −4-4 times a rational fourth power.

References 3
  • capelli1901binomialsThe classical binomial reducibility theorem, including the exceptional fourth-power case.Source
  • Lang2002 · Chapter VI, §9, Theorem 9.1, p. 297Locator corroborated by Milne, Aside 5.29; the original Lang page was not independently inspected.Source
  • Milne2022 · Aside 5.29(a), p. 95 (2022 book); p. 75 in course notes v5.10States the binomial criterion and gives the exact Lang reference.Author’s book page

Example

Example

For h=x6−72h=x^6-72, the Newton polygon at 22 has one slope −3/6=−1/2-3/6=-1/2, allowing proper factor degrees 2,42,4. At 33, its slope is −2/6=−1/3-2/6=-1/3, allowing only degree 33. The empty intersection gives a second proof of irreducibility, complementing Capelli. Neither polygon individually forces the full degree.

Let the positive root be α=233\alpha=\sqrt2\sqrt[3]{3}. The identities

2=α3/6,33=α4/12\sqrt2=\alpha^3/6,\qquad\sqrt[3]{3}=\alpha^4/12

show that the splitting field is L=Q(2,33,ζ3)L=\mathbb Q(\sqrt2,\sqrt[3]{3},\zeta_3). The splitting field MM of x3−3x^3-3 has group S3S_3: the cubic is Eisenstein at 33, and its discriminant is −243-243. Its unique quadratic subfield is Q(−3)\mathbb Q(\sqrt{-3}). Thus M∩Q(2)=QM\cap\mathbb Q(\sqrt2)=\mathbb Q, and restriction gives

Gal⁡(h/Q)≅S3×C2,∣Gal⁡(h/Q)∣=12.\operatorname{Gal}(h/\mathbb Q)\cong S_3\times C_2,\qquad |\operatorname{Gal}(h/\mathbb Q)|=12.

The discriminant 2213162^{21}3^{16} is nonsquare, but the group is much smaller than S6S_6. The explicit splitting field, rather than the discriminant alone, determines this group.

References 3

Irreducibility of quadratic iterates

Example · every iterate of f=x2+1f=x^2+1 is irreducible over Q\mathbb Q

Put Fr=f∘rF_r=f^{\circ r} and ar=Fr(0)a_r=F_r(0), with a0=0a_0=0. Then ar+1=ar2+1a_{r+1}=a_r^2+1, beginning 0,1,2,5,26,6770,1,2,5,26,677. The base case F1=x2+1F_1=x^2+1 is irreducible. Suppose FrF_r is irreducible and let α\alpha be a root. Capelli reduces the next step to showing that α−1\alpha-1 is not a square in Q(α)\mathbb Q(\alpha).

Since FrF_r is monic of even degree,

NQ(α)/Q(α−1)=Fr(1)=ar+1=ar2+1.N_{\mathbb Q(\alpha)/\mathbb Q}(\alpha-1)=F_r(1)=a_{r+1}=a_r^2+1.

For r≥1r\ge1, this integer lies strictly between ar2a_r^2 and (ar+1)2(a_r+1)^2. It is therefore not a rational square. A square in Q(α)\mathbb Q(\alpha) would have square norm, giving the contradiction and completing induction.

Remark

This argument proves stability: every iterate is irreducible. A nonsquare norm is sufficient for the induction; a square norm would leave the question undecided. The Galois groups of the iterates require additional arguments. For the broader stability criterion in Ayad–McQuillan, the 2001 correction must be read with the original paper; the claimed converse was withdrawn.

References 3

Questions

SettledIrreducibility methods

Does composition preserve irreducibility?

Scope. Nonconstant polynomials over Q

No. The pair x2−8x^2-8, x2−3x^2-3 above is a counterexample. Capelli identifies the missing condition: the inner polynomial minus a root of the outer one must remain irreducible over that root field.

References 1
Discuss this question →

Related topics

References

  1. Irreducibility of the iterates of a quadratic polynomial over a field

    Ayad, Mohamed and McQuillan, Donald L. Acta Arithmetica, 93(1), 87–97, 2000.

    Read the source
  2. Polynomials with Special Regard to Reducibility

    Schinzel, Andrzej. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 77, 2000.

    Read the source
  3. Sulla riduttibilità della funzione x^n-A in un campo qualunque di razionalità

    Capelli, Alfredo. Mathematische Annalen, 54, 602–603, 1901.

    Read the source
  4. Algebra

    Lang, Serge. Edition 3. Springer, Graduate Texts in Mathematics, vol. 211, 2002.

    Read the source
  5. Fields and Galois Theory

    Milne, James S. Kea Books, 2022.

    Author’s book page
  6. Sur quelques cas d'irréductibilité des polynômes à coefficients rationnels

    Dumas, Gustave. Journal de Mathématiques Pures et Appliquées, 6e série, 2, 191–258, 1906.

    Read the source
  7. Corrections to "Irreducibility of the iterates of a quadratic polynomial over a field" (Acta Arith. 93 (2000), 87--97)

    Ayad, Mohamed and McQuillan, Donald L. Acta Arithmetica, 99(1), 97, 2001.

    Read the source
  8. Galois representations from pre-image trees: an arboreal survey

    Jones, Rafe. Publications mathématiques de Besançon. Algèbre et théorie des nombres, 107–136, 2013.

    Read the source