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 be any field, let be irreducible of degree , and let have degree . For a root of , the composition is irreducible over if and only if is irreducible over .
Proof
Choose a root of . Since , we have , and
The polynomial , of degree , has root . It is irreducible exactly when the left side is , equivalently when the minimal polynomial of over has degree .
When , the new question is whether factors; power classes and norms give useful criteria.
References 2
- AyadMcQuillan2000 · Lemma 1, p. 87Capelli’s composition lemma, stated for arbitrary fields.Source
- Schinzel2000Composition and reducibility in extension fields.Source
Example
Example
Both and are irreducible over , but
For , we have , so splits in . Irreducibility of the two inputs over does not exclude this square in the root field.
References 1
- AyadMcQuillan2000 · Lemma 1The root-field criterion explains the explicitly verified example.Source
Capelli’s binomial criterion
Theorem · Capelli's binomial criterion
Let have characteristic zero, , and . Then is irreducible over exactly when
- for every prime ;
- if , then .
Here . 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
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 factors by the displayed identity even though is not a rational square. In contrast, is irreducible: is neither a square nor a cube. In fact is irreducible for every , because no prime divides both valuation exponents , and a positive rational number cannot be 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 , the Newton polygon at has one slope , allowing proper factor degrees . At , its slope is , allowing only degree . The empty intersection gives a second proof of irreducibility, complementing Capelli. Neither polygon individually forces the full degree.
Let the positive root be . The identities
show that the splitting field is . The splitting field of has group : the cubic is Eisenstein at , and its discriminant is . Its unique quadratic subfield is . Thus , and restriction gives
The discriminant is nonsquare, but the group is much smaller than . The explicit splitting field, rather than the discriminant alone, determines this group.
References 3
- dumas1906The slope-denominator principle applied to the explicitly computed two-prime certificate.Source
- Milne2022Galois correspondence, composita, and the quadratic subfield determined by a discriminant; the displayed sextic calculation is supplied here.Author’s book page
- capelli1901binomialsThe complementary binomial criterion.Source
Irreducibility of quadratic iterates
Example · every iterate of is irreducible over
Put and , with . Then , beginning . The base case is irreducible. Suppose is irreducible and let be a root. Capelli reduces the next step to showing that is not a square in .
Since is monic of even degree,
For , this integer lies strictly between and . It is therefore not a rational square. A square in 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
- AyadMcQuillan2000 · Lemma 1Capelli’s lemma underlying the supplied norm induction.Source
- AyadMcQuillan2001Correction · Theorem AThe corrected sufficient stability criterion and the failure of the original converse.Source
- Jones2013Arboreal · §5Stability and its relation to arboreal Galois representations.Source
Questions
Does composition preserve irreducibility?
Scope. Nonconstant polynomials over Q
No. The pair , 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
- AyadMcQuillan2000 · Lemma 1The exact criterion, applied here to an independently expanded example.Source
Related topics
Foundations: polynomials, fields, and Galois groups
The tower formula turns polynomial irreducibility into an equality of extension degrees.
Applies toComposition and iteration
Stability gives transitivity at every level of an arboreal action.
Supplies examples forNewton polygons and Galois groups
The sextic x⁶−72 has both a Capelli proof and a proof using Newton polygons at two primes.
UsesDiscriminants, parity, and ramification
The sextic example has nonsquare discriminant and a Galois group of order 12.
Applies toIrreducibility from integer values
Restrictions on integer values give irreducibility criteria for other composed families.
Contrasts withIrreducibility over finite fields
Finite-field irreducibility tests use the field size and Frobenius.
References
- 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 - Polynomials with Special Regard to Reducibility
Schinzel, Andrzej. Cambridge University Press, Encyclopedia of Mathematics and its Applications, vol. 77, 2000.
Read the source - Sulla riduttibilità della funzione x^n-A in un campo qualunque di razionalità
Capelli, Alfredo. Mathematische Annalen, 54, 602–603, 1901.
Read the source - Algebra
Lang, Serge. Edition 3. Springer, Graduate Texts in Mathematics, vol. 211, 2002.
Read the source - Fields and Galois Theory
Milne, James S. Kea Books, 2022.
Author’s book page - 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 - 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 - 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
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.