Overview
- When is a composition irreducible?
- When are all iterates irreducible?
- How large are the Galois groups of iterates?
- How do critical orbits affect these questions?
Composition and factorization
For polynomials , their composition is . A decomposition , with both degrees greater than one, is different from a factorization . For example, is decomposable but irreducible over by Eisenstein’s criterion. Conversely, is reducible but cannot be decomposed into two polynomials of smaller positive degree.
Ritt’s 1922 work describes decompositions over . Its connection with Galois theory is the correspondence between right composition factors, intermediate function fields, and blocks in the action on the roots of . The article on polynomial decomposition develops this correspondence.
Irreducibility of a composition
Let be irreducible, let have degree at least one, and let be a root of . Capelli’s lemma reduces the composition problem to one extension field:
Thus a degree- problem can become a degree- problem over a field of degree . For quadratics, the latter is a square test; norms can then give a sufficient condition in the ground field. See the proof and examples.
References 1
- Schinzel2000 · Chapter 1, composition and Capelli’s theoremSource
Irreducibility of iterates
Write and . A polynomial is stable over if every , , is irreducible over . It is eventually stable if the numbers of irreducible factors of these iterates, counted with multiplicity, are bounded.
Stability concerns one factor at every depth. Eventual stability allows several factors, but bounds their number. Both depend on the field and, for the equations , on the target . The stability article treats Capelli’s lemma, critical-orbit tests, local criteria, and open cases.
References 1
- JonesLevy2017Eventual · Definition 1.1 and §2Source
Galois groups on a tree
Fix and let . Assume that every is separable. Place its roots at level , using a separate copy at each level, and join to . This gives a regular rooted tree with children at each vertex. Galois automorphisms preserve these edges.
The resulting group lies in the automorphism group of the tree. Through level , this is the -fold iterated wreath product of , of order
Irreducibility at every level means transitivity on every level. Equality with the full tree group is a stronger condition. See arboreal Galois groups.
References 2
- Odoni1985 · Introduction and the Galois groups of iteratesSource
- Jones2013Arboreal · §1.1Source
Example
For , the adjusted critical values begin
Stoll’s criterion expresses maximality through level as independence of the first values in . In particular, and are independent, so the second iterate has group , the dihedral group of order . Stoll also proves maximality at every level for this polynomial; the calculation above illustrates the finite-level criterion.
Critical orbits
A polynomial is postcritically finite if every critical point has finite forward orbit. The polynomial has the critical orbit . Its iterates are all irreducible over , but their Galois groups are cyclic of order , far smaller than the full binary tree groups. The cyclotomic calculation proves both assertions.
Critical-orbit equations also define polynomials in the parameter. For , periodic critical points give Gleason polynomials; strictly preperiodic critical points give Misiurewicz polynomials. Their irreducibility is a separate arithmetic problem.
References 2
- BenedettoGhiocaJuulTucker2026Preperiodic · §1.4, the Chebyshev caseSource
- Ramadas2024Moduli · IntroductionSource
Development of the subject
Odoni proved that a generic monic polynomial in characteristic zero has the full iterated wreath product at every finite level. Arithmetic specialization asks for one polynomial over a number field that retains this property at all levels simultaneously. Looper proved existence in every prime degree over . Benedetto–Juul prove existence over a number field when is even, or when and are not both squares in . In particular, all degrees are covered when is odd. Specter’s preprint gives every degree over every number field.
The base field matters: Dittmann–Kadets construct Hilbertian fields of characteristic zero over which no polynomial of degree at least two has finite-index arboreal image. This does not contradict the number-field results.
References 5
- Odoni1985 · Generic polynomial theoremSource
- Looper2019 · Theorem 1.1Source
- BenedettoJuul2019 · Theorem 1.1 in the author manuscript; Theorem 1.2 in arXiv:1803.01987v1Source
- Specter2018 · Theorem 1.2; arXiv:1803.00434v2, preprintSource
- DittmannKadets2022 · Theorem 1.2Source
Current questions
The main open problems ask when finitely many iterates certify stability or maximality, and when the arboreal image has finite index.
Recent work includes explicit quadratic representations at strictly preperiodic targets, descriptions of postcritically finite groups, and Stoll’s November 2026 finite-level criteria. See Arboreal Galois groups.
References 3
- HendersonJuulLattinMercadoSchaefer2026 · Theorems 1–2; arXiv:2603.25899v1Source
- BenedettoGhiocaJuulTucker2025Periodic · Theorem 1.5Source
- Stoll2026Arboreal · Theorem 6.1 and Conjecture 8.1; arXiv:2611.14014v1Source
Further reading
Silverman’s The Arithmetic of Dynamical Systems develops the background on critical points, reduction, heights, and dynatomic polynomials. Jones’s 2013 survey organizes the arboreal questions and their arithmetic applications. His 2007: An Arboreal Odyssey, posted in 2026, is an unchanged historical manuscript; its open questions describe the subject as it stood in 2007.
References 3
- Silverman2007Dynamics · Chapters 1–4; §§3.9 and 4.1–4.2Source
- Jones2013Arboreal · Introduction and §§1–5Source
- Jones2026HistoricalOdyssey · Abstract and §§2–8; manuscript written in 2007, posted 20 May 2026Source
Questions
Can one fixed iterate detect the full arboreal group?
Scope. f_a=x²+a with a∈Q∖{−1,0}; target point 0; Stoll, November 2026.
Is there a fixed such that maximality of implies maximality at every level, for every ? Hindes proposed ; Stoll repeats this as Conjecture 8.1. The values and rule out . Stoll reports the implication from level to level for all of height , in lowest terms with . The conjecture concerns every level and every rational parameter.
References 2
- Hindes2015IterationCurves · §3, Remark 3.4 and following discussion, p. 26Asks whether the first failure of maximality can occur at arbitrarily large levels, and whether all first failures occur before level 5.Source
- Stoll2026Arboreal · Conjecture 8.1, Proposition 8.2, and Remark 8.5; arXiv:2611.14014v1 (10 November 2026)Source
Does every Hilbertian field admit a surjective polynomial arboreal representation of degree at least two?
Scope. Polynomials of degree d≥2 over Hilbertian fields of characteristic zero
No. Dittmann–Kadets give counterexample fields. These counterexamples are compatible with the positive existence results over number fields and with generic maximality at each fixed finite level.
References 1
- DittmannKadets2022 · Theorem 1.2Source
Do iterates of x²+1/c always have at most four irreducible factors?
Scope. c∈Z∖{0,−1}; factorization over Q; all iterate depths
Conjecture 1.7 predicts this uniform bound and gives a precise list of factor counts. The bound is attained in known cases.
References 1
- DeMarkEtAl2020Stability · Conjecture 1.7 and Theorem 1.5Source
Does irreducibility of the second iterate imply stability for x²+1/c?
Scope. c∈Z∖{0,−1}; all irreducibility statements over Q
If is irreducible, must every be irreducible? This is Conjecture 1.8, distinct from the conjecture on maximal Galois groups.
References 1
- DeMarkEtAl2020Stability · Conjecture 1.8Source
Does every quadratic polynomial with infinite critical orbit have finite-index arboreal image?
Scope. f=x²+c over a number field K; the forward orbit of 0 is infinite; target point 0
Jones’s conjecture predicts when over a number field has infinite critical orbit. It allows a proper group at early levels. This is the polynomial case of Conjecture 3.11; the 2026 quadratic preprint still cites the finite-index problem as conjectural.
References 2
- Jones2013Arboreal · Conjecture 3.11, specialized to x²+cSource
- HendersonJuulLattinMercadoSchaefer2026 · Introduction; arXiv:2603.25899v1Source
Related topics
Connected diagrams
Browse all diagrams →Polynomial decomposition
Composition, intermediate fields, and blocks.
RelatedIrreducibility of iterates
Irreducibility of successive iterates.
RelatedArboreal Galois groups
Galois actions on preimage trees.
RelatedGleason and Misiurewicz polynomials
Parameters defined by critical-orbit relations.
RelatedSpecialization and Hilbert irreducibility
Passing from a generic polynomial to arithmetic examples.
Linked from 12 articles
- The Galois correspondence and intermediate fields
- Sparse polynomials and factor reversal
- Capelli’s theorem and polynomial composition
- Transitivity, primitivity, and cycle criteria
- Bernoulli and Euler polynomials
- Specialization and Hilbert irreducibility
- Critical points and polynomial monodromy
- Inverse Galois theory and generic polynomials
- Polynomial decomposition
- Irreducibility of iterates
- Arboreal Galois groups
- Gleason and Misiurewicz polynomials
References
- Prime and composite polynomials
Ritt, Joseph F. Transactions of the American Mathematical Society, 23(1), 51–66, 1922.
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 - Eventually stable rational functions
Jones, Rafe and Levy, Alon. International Journal of Number Theory, 13(9), 2299–2318, 2017.
Read the source - The Galois Theory of Iterates and Composites of Polynomials
Odoni, R. W. K. Proceedings of the London Mathematical Society (3), 51(3), 385–414, 1985.
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 - Galois groups over Q of some iterated polynomials
Stoll, Michael. Archiv der Mathematik, 59, 239–244, 1992.
Read the source - Arboreal Galois groups of postcritically finite quadratic polynomials: The strictly preperiodic case
Benedetto, Robert L. and Ghioca, Dragos and Juul, Jamie and Tucker, Thomas J. Canadian Journal of Mathematics, 2026.
Read the source - Moduli Spaces of Quadratic Maps: Arithmetic and Geometry
Ramadas, Rohini. International Mathematics Research Notices, 2024(15), 11364–11370, 2024.
Read the source - Dynamical Galois groups of trinomials and Odoni's conjecture
Looper, Nicole R. Bulletin of the London Mathematical Society, 51(2), 278–292, 2019.
Read the source - Odoni's conjecture for number fields
Benedetto, Robert L. and Juul, Jamie. Bulletin of the London Mathematical Society, 51(2), 237–250, 2019.
Read the source - Polynomials with Surjective Arboreal Galois Representations Exist in Every Degree
Specter, Joel. arXiv preprint, 2018.
Read the source - Odoni's conjecture on arboreal Galois representations is false
Dittmann, Philip and Kadets, Borys. Proceedings of the American Mathematical Society, 150(8), 3335–3343, 2022.
Read the source - Examples of Quadratic Polynomials over Q with Surjective Arboreal Galois Representations
Henderson, Luck and Juul, Jamie and Lattin, Brenner and Mercado, Enrique and Schaefer, Mia. arXiv preprint, 2026.
Read the source - Arboreal Galois groups of postcritically finite quadratic polynomials: The periodic case
Benedetto, Robert L. and Ghioca, Dragos and Juul, Jamie and Tucker, Thomas J. Journal of the London Mathematical Society, 112(2), e70257, 2025.
Read the source - When do all iterates of x²+a have maximal Galois group?
Stoll, Michael. arXiv preprint, 2026.
Read the source - The Arithmetic of Dynamical Systems
Silverman, Joseph H. Graduate Texts in Mathematics 241, Springer, vol. 241, x+511, 2007.
Read the source - 2007: An Arboreal Odyssey: A View of Arboreal Galois Representations and Applications, from Early in the Subject’s History
Jones, Rafe. arXiv historical survey manuscript, 2026.
Read the source - The arithmetic of curves defined by iteration
Hindes, Wade. Acta Arithmetica, 169(1), 1–27, 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
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.