pith. sign in

arxiv: 2604.04524 · v1 · submitted 2026-04-06 · 🧮 math.NT · math.GR

Settled Elements in Arboreal Galois Groups of Quadratic PCF Polynomials

\"Ozlem Ejder , Dilber Kocak This is my paper

Pith reviewed 2026-05-10 20:12 UTC · model grok-4.3

classification 🧮 math.NT math.GR
keywords arboreal Galois groupspostcritically finite polynomialssettled elementsiterated monodromy groupsquadratic polynomialsbinary tree automorphismsGalois representations
0
0 comments X

The pith

Postcritically finite quadratic polynomials with periodic postcritical orbits have densely settled arithmetic iterated monodromy groups.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that for quadratic polynomials over a field of characteristic not 2 that are postcritically finite and have periodic postcritical orbits, the associated arithmetic iterated monodromy groups contain a dense set of settled elements. A settled automorphism of the rooted binary tree has the property that the proportion of vertices lying on stable cycles tends to one at deeper levels, where a stable cycle is one whose length strictly increases with each subsequent level. This establishes a case of the Boston-Jones conjecture for these maps. Over number fields the result implies that infinitely many associated arboreal Galois representations are densely settled, including the case of the Basilica polynomial x squared minus one.

Core claim

The authors prove that the arithmetic iterated monodromy groups of postcritically finite quadratic polynomials in K[x] with periodic postcritical orbits are densely settled. In the number field case, by a result of Benedetto-Ghioca-Juul-Tucker, it follows that for infinitely many a in K the associated arboreal Galois representations are densely settled. In particular, the results apply to the arithmetic IMG of the Basilica map f(x)=x^2-1.

What carries the argument

The arithmetic iterated monodromy group of the polynomial, acting on the regular rooted binary tree, with the settled property defined by the limiting proportion of vertices in stable cycles.

If this is right

  • The Boston-Jones conjecture holds for the class of quadratic postcritically finite polynomials with periodic postcritical orbits.
  • Over number fields, infinitely many parameters produce arboreal Galois representations that are densely settled.
  • The Basilica polynomial x^2-1 provides an explicit family where the density of settled elements occurs.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same density might hold after relaxing periodicity of the postcritical orbit or passing to higher-degree polynomials, though this lies outside the paper's scope.
  • Finite-level computations of the groups could be used to check the approach to density numerically for any given example.
  • Density of settled elements may imply that the image is topologically large inside the full automorphism group of the tree.

Load-bearing premise

The polynomials must be quadratic, postcritically finite, and have periodic postcritical orbits over a field of characteristic not equal to 2.

What would settle it

Compute the arithmetic iterated monodromy group for a concrete example such as the Basilica map and exhibit a positive lower bound strictly less than one on the proportion of vertices outside stable cycles at arbitrarily large levels.

read the original abstract

Let $f(x) \in K(x)$ be a quadratic polynomial where $K$ is a field of characteristic not equal to $2$. The associated arboreal Galois representation of the absolute Galois group of $K$ acts on a regular rooted binary tree. Boston and Jones conjectured that, for $f \in \mathbb{Z}[x]$, the image of this representation contains a dense set of settled elements. Roughly speaking, a cycle of an automorphism $\tau$ of the tree is called stable if its length strictly increases at each subsequent level, and $\tau$ is called settled if the proportion of vertices contained in stable cycles goes to $1$ as the level goes to infinity. In this article, we prove that the arithmetic iterated monodromy groups of postcritically finite quadratic polynomials in $K[x]$ with periodic postcritical orbits are densely settled. In the number field case, by a result of Benedetto--Ghioca--Juul--Tucker \cite{BGJT2025s}, it follows that for infinitely many $a \in K$, the associated arboreal Galois representations are densely settled. In particular, our results apply to the arithmetic IMG of the Basilica map $f(x)=x^2-1$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript proves that the arithmetic iterated monodromy groups of postcritically finite quadratic polynomials f ∈ K[x] (char K ≠ 2) with periodic postcritical orbits are densely settled. Here a tree automorphism is settled if the proportion of vertices lying in stable cycles tends to 1 as the level tends to infinity, where a cycle is stable when its length strictly increases upon passage to the next level of the binary tree. In the number-field case the result combines with the density theorem of Benedetto–Ghioca–Juul–Tucker (BGJT2025s) to conclude that infinitely many specializations a ∈ K yield densely settled arboreal Galois representations; the Basilica map f(x) = x² − 1 is exhibited as a concrete instance.

Significance. The theorem supplies a large, explicitly described family of quadratic PCF maps for which the Boston–Jones conjecture on dense settled elements holds. The periodicity hypothesis is used to produce a stabilizing combinatorial pattern on the tree that permits direct control of cycle lengths at successive levels; the appeal to BGJT2025s then converts the group-theoretic statement into an arithmetic density statement. The work therefore furnishes both a structural result inside the automorphism group of the rooted binary tree and concrete arithmetic applications.

minor comments (2)
  1. [Introduction] The introduction would benefit from a short paragraph recalling the precise definition of a stable cycle immediately before the statement of the main theorem, to aid readers who have not yet reached the technical sections.
  2. [Section 5] In the discussion of the Basilica example, it would be helpful to indicate explicitly which prior results on its monodromy group are being invoked and which new information is supplied by the present argument.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper establishes that arithmetic iterated monodromy groups of quadratic PCF polynomials with periodic postcritical orbits are densely settled by using the periodicity hypothesis to induce a stabilizing combinatorial pattern on the binary tree, allowing explicit control of stable cycle lengths at successive levels. This rests on standard definitions of settled elements and monodromy actions together with direct combinatorial arguments scoped to the stated class of polynomials (char K ≠ 2). The number-field application invokes an independent external result (BGJT2025s) whose authors do not overlap with the present paper; no parameter fitting, self-definitional reduction, ansatz smuggling, or load-bearing self-citation occurs. The central claim therefore does not reduce to its inputs by construction and remains falsifiable against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The result relies on standard background from Galois theory and arithmetic dynamics with no new free parameters or invented entities; the characteristic-not-2 assumption is a domain restriction rather than an ad-hoc choice.

axioms (2)
  • standard math Standard properties of absolute Galois groups and their actions on rooted trees
    Used to define the arboreal representation and the notion of settled elements.
  • domain assumption The base field K has characteristic not equal to 2
    Required for the quadratic polynomial to be separable and for the tree action to be well-defined.

pith-pipeline@v0.9.0 · 5527 in / 1220 out tokens · 40459 ms · 2026-05-10T20:12:15.727210+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Ahmad, R

    F. Ahmad, R. L. Benedetto, J. Cain, G. Carroll, L. Fang, The arithmetic basilica: a quadratic PCF arboreal Galois group.J. Number Theory, 238:842–868, 2022

    work page 2022

  2. [2]

    J. Juul, H. Krieger, N. Looper, M. Manes, B. Thompson, L. Walton, Arboreal representations for rational maps with few critical points. In Research directions in number theory—Women in Numbers IV, volume 19 ofAssoc. Women Math. Ser., pages 133–151. Springer, Cham,

    work page

  3. [3]

    Bartholdi, V

    L. Bartholdi, V . V . Nekrashevych, Iterated monodromy groups of quadratic polynomials. I.Groups Geom. Dyn., 2(3):309–336, 2008

    work page 2008

  4. [4]

    M. R. Bush, W. Hindes, N. R. Looper, Galois groups of iterates of some unicritical polynomials.Acta Arith., 181(1):57–73, 2017

    work page 2017

  5. [5]

    Boston, R

    N. Boston, R. Jones, Arboreal Galois representations.Geom. Dedicata, 124:27–35, 2007

    work page 2007

  6. [6]

    Boston, R

    N. Boston, R. Jones, The image of an arboreal Galois representation.Pure Appl. Math. Q., 5(1):213–225, 2009

    work page 2009

  7. [7]

    Boston, R

    N. Boston, R. Jones, Settled polynomials over finite fields.Proc. Amer. Math. Soc., 140(6):1849–1863, 2012

    work page 2012

  8. [8]

    I. I. Bouw, ¨O. Ejder, V . Karemaker. Dynamical Belyi maps and arboreal Galois groups,Manuscripta Math., 165(1-2):1–34, 2021

    work page 2021

  9. [9]

    R. L. Benedetto, X. Faber, B. Hutz, J. Juul, Y . Yasufuku. A large arboreal Galois representation for a cubic postcritically finite polynomial. Res. Number Theory, 3:Art. 29, 21, 2017

    work page 2017

  10. [10]

    M. I. Cortez, O. Lukina, Settled elements in profinite groups.Adv. Math., 404:Paper No. 108424, 56, 2022

    work page 2022

  11. [11]

    Ejder, Arithmetic monodromy groups of dynamical Belyi maps

    ¨O. Ejder, Arithmetic monodromy groups of dynamical Belyi maps. InArithmetic, geometry, cryptography, and coding theory 2021, volume 779 ofContemp. Math., pages 91–102. Amer. Math. Soc., [Providence], RI, [2022] ©2022

    work page 2021

  12. [12]

    Ejder, Y

    ¨O. Ejder, Y . Kara, E. Ozman, Iterated monodromy group of a pcf quadratic non-polynomial map.Manuscripta Math

    work page

  13. [13]

    Galois theory of Quadratic Rational functions with periodic critical points,

    ¨O. Ejder, “Galois theory of Quadratic Rational functions with periodic critical points,”Journal of Number Theory, 2025. doi:10.1016/j.jnt.2025.08.010

    work page doi:10.1016/j.jnt.2025.08.010 2025

  14. [14]

    Grothendieck, M

    A. Grothendieck, M. Raynaud,Rev ˆetements ´etales et groupe fondamental (SGA 1). Lecture Notes in Mathematics, V ol. 224, Springer-Verlag, Berlin–Heidelberg, 1971. 18

    work page 1971

  15. [15]

    Grigorchuk, Z

    R. Grigorchuk, Z. ˇSuni´c, Self-similarity and branching in group theory. InGroups St. Andrews 2005. Vol. 1, volume 339 ofLondon Math. Soc. Lecture Note Ser., pages 36–95. Cambridge Univ. Press, Cambridge, 2007

    work page 2005

  16. [16]

    Th´eorie des Nombres et Applications

    R. Jones, Galois representations from pre-image trees: an arboreal survey. InActes de la Conf ´erence “Th´eorie des Nombres et Applications”, volume 2013 ofPubl. Math. Besanc ¸on Alg`ebre Th´eorie Nr., pages 107–136. Presses Univ. Franche-Comt´e, Besanc ¸on, 2013

    work page 2013

  17. [17]

    Jones, A

    R. Jones, A. Levy, Eventually stable rational functions.Int. J. Number Theory, 13(9):2299–2318, 2017

    work page 2017

  18. [18]

    Jones, M

    R. Jones, M. Manes, Galois theory of quadratic rational functions.Comment. Math. Helv., 89(1):173–213, 2014

    work page 2014

  19. [19]

    R. L. Benedetto, D. Ghioca, J. Juul, and T. J. Tucker, Arboreal Galois groups of postcritically finite quadratic polynomials: the periodic case, J. Lond. Math. Soc. (2)112(2025), no. 2, Paper No. e70257, 24 pp

    work page 2025

  20. [20]

    R. L. Benedetto, D. Ghioca, J. Juul, and T. J. Tucker, Specializations of iterated Galois groups of PCF rational functions,Math. Ann.392 (2025), no. 1, 1031–1050

    work page 2025

  21. [21]

    A. A. Swaminathan, On arboreal Galois representations of rational functions.J. Algebra, 448:104–126, 2016

    work page 2016

  22. [22]

    Nekrashevych,Self-similar groups, volume 117 ofMathematical Surveys and Monographs

    V . Nekrashevych,Self-similar groups, volume 117 ofMathematical Surveys and Monographs. American Mathematical Society, Providence, RI, 2005

    work page 2005

  23. [23]

    R. W. K. Odoni, On the prime divisors of the sequencew n+1 = 1 +w 1 · · ·w n.J. London Math. Soc. (2), 32(1):1–11, 1985

    work page 1985

  24. [24]

    R. W. K. Odoni, The Galois theory of iterates and composites of polynomials.Proc. London Math. Soc. (3), 51(3):385–414, 1985

    work page 1985

  25. [25]

    Pink, Profinite iterated monodromy groups arising from quadratic polynomials, 2013

    R. Pink, Profinite iterated monodromy groups arising from quadratic polynomials, 2013

    work page 2013

  26. [26]

    Stoll, Galois groups overQof some iterated polynomials.Arch

    M. Stoll, Galois groups overQof some iterated polynomials.Arch. Math. (Basel), 59(3):239–244, 1992

    work page 1992

  27. [27]

    Szamuely,Galois Groups and Fundamental Groups

    T. Szamuely,Galois Groups and Fundamental Groups. Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2009

    work page 2009

  28. [28]

    Adams and T

    O. Adams and T. Hyde,Profinite Iterated Monodromy Groups of Unicritical Polynomials, arXiv:2504.13028 [math.NT], 2025

    work page arXiv 2025

  29. [29]

    Pink,Orbit length generating functions of automorphisms of a rooted regular binary tree, arXiv:1403.8019 [math.GR], 2014

    R. Pink,Orbit length generating functions of automorphisms of a rooted regular binary tree, arXiv:1403.8019 [math.GR], 2014. KOC¸ UNIVERSITY, COLLEGE OFSCIENCE Email address:ozejder@ku.edu.tr METU, DEPARTMENT OFMATHEMATICS Email address:dkocak@metu.edu.tr 19

    work page arXiv 2014