Overview
- How does Capelli’s lemma reduce irreducibility of a composition?
- Which critical-orbit conditions imply stability?
- Can irreducibility fail after several successful iterates?
- When is the number of irreducible factors bounded?
Stability and eventual stability
Fix a field , a polynomial of degree , and a target . The pair is stable if is irreducible over for every . It is eventually stable if the number of irreducible factors, counted with multiplicity, is bounded independently of . When , one speaks of stability of .
If , then . Each old factor contributes at least one new factor. The factor count is therefore nondecreasing; boundedness means it eventually becomes constant.
References 1
- JonesLevy2017Eventual · Definition 1.1 and Proposition 2.1Source
Capelli’s lemma
Lemma
Let be irreducible of degree , let have degree , and let be a root of . Then is irreducible over if and only if is irreducible over .
Proof. Choose with . Since ,
The right side equals exactly when has degree over . This is the required equivalence.
References 1
- Schinzel2000 · Chapter 1, Capelli’s theoremSource
A quadratic criterion
Assume and put . If
are all nonsquares in , then is stable over .
To prove this, the first condition makes irreducible. Suppose is irreducible, with , and let be a root. Capelli’s lemma asks whether is irreducible over . Since is even,
A square has square norm. A nonsquare value on the right therefore proves the required irreducibility. Over general fields this is a sufficient criterion; a square norm alone does not prove that is a square.
References 1
- Jones2012EveryPrime · Theorem 2.2; arXiv:1012.2857v4Source
Example
For , let . Then and . Since , for every we have
The second inequality follows from . Thus lies strictly between consecutive integer squares. An integer that is a square in is already a square in , so every , , is a nonsquare in . Together with the nonsquare , the quadratic criterion proves that all iterates of are irreducible over .
References 1
- Jones2012EveryPrime · Theorem 2.2; applied here using the inequalities aboveSource
Eisenstein’s criterion at every level
Let be prime and , with . Modulo ,
Also : this holds at , and follows at the next step from . Every iterate is therefore Eisenstein at . This proves stability over , and even irreducibility of every iterate over .
References 1
- JonesLevy2017Eventual · Introduction before Theorem 1.7, Eisenstein stabilitySource
Irreducibility can fail later
For , the first two iterates reduce modulo to and , both irreducible. But
The quadratic reduction has no root. The quartic reduction has no root and is not divisible by the only irreducible binary quadratic, ; hence it is irreducible. Expanding the displayed product verifies the third-iterate factorization. Two successful levels do not prove stability for an arbitrary quadratic polynomial.
References 1
- Jones2013Arboreal · §5, p. 132; example x²−x−1The reductions and factorization are computed here.Source
Local criteria for eventual stability
Jones–Levy prove a useful extension of the Eisenstein argument. Let be a discrete valuation on , let have good reduction at , and suppose that the reduction has only one geometric preimage of the reduction of , namely . If , then is eventually stable over . Good reduction means that the degree does not fall after reduction.
In particular, if , , and , then the reduction is and the criterion applies at . For quadratic maps over , with odd integer , their finite-residue-field criterion also proves eventual stability at .
References 1
- JonesLevy2017Eventual · Theorem 1.7 and Corollary 1.5Source
Quadratic polynomials over Q
For , with nonzero not the reciprocal of an integer, eventual stability is known. The remaining family is , where . DeMark–Hindes–Jones–Misplon–Stoll–Stoneman prove that all iterates have at most four irreducible factors when . Their argument also verifies, for , that irreducibility of the second iterate implies stability.
The all-parameter statements remain conjectural in that work. The bound four is attained: for , every iterate of depth at least three has four irreducible factors. The methods combine critical values, Diophantine equations, and bounds that reduce infinitely many depths to finitely many checks.
References 2
- HamblenJonesMadhu2015 · Eventual-stability theorem and corollary; arXiv:1303.6513v1, Theorem 5 and Corollary 6Source
- DeMarkEtAl2020Stability · Theorems 1.2–1.5, Conjectures 1.7–1.8, and §5Source
A nonperiodic target need not suffice
The 2017 eventual-stability conjecture asked whether nonperiodicity of the target suffices over number fields. Tucker–Zhu’s October 2026 preprint gives a counterexample with and target . Here , so the target is not periodic. Yet
where is the -th cyclotomic polynomial. The factors are distinct and irreducible over . The identity follows from the divisors of that do not divide , and proves unbounded factor count directly.
This example concerns a strictly preperiodic target. It does not disprove a statement restricted to targets with infinite forward orbit.
References 2
- JonesLevy2017Eventual · Conjecture 1.2Source
- TuckerZhu2026Counterexample · arXiv:2610.28688v1, counterexampleThe cyclotomic factorization is verified directly here.Source
New reducible fibers under iteration
Write . Behajaina–König–Neftin’s March 2026 preprint claims that, if , , and has no composition factor of degree or , then for each fixed ,
The finite exceptional set may depend on . This statement does not assert stability for a fixed target at every depth.
References 1
- BehajainaKonigNeftin2026DLS · Corollary 1.3; arXiv:2603.27728v1Source
Related topics
Connected diagrams
- From critical square classes to every quadratic iterate · Claimed
- A complete proposed classification of reducible f(X) − g(Y) · Claimed
Composition and iteration
Overview and open questions.
RelatedSchönemann–Eisenstein and Dumas criteria
Local irreducibility criteria.
RelatedArboreal Galois groups
Stability gives transitivity, while maximality requires more.
RelatedPolynomials with separated variables
Composition controls exceptional reducible fibers.
RelatedIrreducible polynomials with coefficient restrictions
Irreducible polynomials and iteration over finite fields.
Linked from 2 articles
References
- Eventually stable rational functions
Jones, Rafe and Levy, Alon. International Journal of Number Theory, 13(9), 2299–2318, 2017.
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 - An iterative construction of irreducible polynomials reducible modulo every prime
Jones, Rafe. Journal of Algebra, 369, 114–128, 2012.
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 - The density of primes in orbits of z^d+c
Hamblen, Spencer and Jones, Rafe and Madhu, Kalyani. International Mathematics Research Notices, 2015(7), 1924–1958, 2015.
Read the source - Eventually stable quadratic polynomials over Q
DeMark, David and Hindes, Wade and Jones, Rafe and Misplon, Moses and Stoll, Michael and Stoneman, Michael. New York Journal of Mathematics, 26, 526–561, 2020.
Read the source - A Counterexample to the Eventual Stability Conjecture
Tucker, Thomas J. and Zhu, Zheng. arXiv:2610.28688 [math.NT], 2026.
Read the source - The Davenport–Lewis–Schinzel problem on the reducibility of f(X)−g(Y)
Behajaina, Angelot and König, Joachim and Neftin, Danny. arXiv, 2026.
Read the source
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.