Pith. sign in

REVIEW 4 major objections 4 minor 25 references

Overgroups of the arboreal representation of PCF polynomial

T0 review · 4 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Every PCF polynomial's Galois tree image sits in a small sign-kernel overgroup, and one new polynomial hits it exactly.

desk verdict Plausible overgroup theorem for PCF arboreal images, but Theorem 1.1 needs a postcritical-avoidance hypothesis and several proof fixes. read the letter →

arxiv 2506.00456 v1 pith:GSJ76LW6 submitted 2025-05-31 math.NT math.DS

Wayne Peng This is my paper
classification math.NTmath.DS MSC 11R3237P0511R58
keywords arborealGaloisrepresentationpostcriticallyfinitepolynomialPCFd-arytreesign-kernelovergroupwreathproductchiefseriesdynamicalBelyi
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper tries to show that the arboreal Galois image of any postcritically finite (PCF) polynomial is never the full automorphism group of the d-ary tree; instead it must lie inside one of finitely many explicitly defined sign-kernel overgroups determined only by the tail length and period of the critical set. The author then isolates a concrete cubic polynomial whose entire arboreal image is exactly one of these overgroups, giving the first sharp realization result for a PCF polynomial with the critical portrait 0 maps to 1, 1 maps to 0. A sympathetic reader would care because this turns a recurring observation in arithmetic dynamics, that PCF images have infinite index, into a precise structural statement about where the image must sit, and because it provides a group-theoretic template for computing dynamical Galois groups.

What carries the argument

The machinery is the sign-kernel overgroups of the d-ary tree automorphism group: $E^{{(m,m')}}$_n(d) and $F^{{(m,m')}}$_n(d) are defined as kernels of sign functions $sgn^{{(m,m')}}$_1 and $sgn^{{(m,m')}}$_2, which combine the natural sign on level m with the sign on level m'. For PCF polynomials, the refined discriminant formula of Proposition 2.7 shows that disc(f^n(z)-$\alpha$) is a square in the ground field (or a fixed small extension) once n passes a bound depending only on the critical set's tail and period; this produces the sign conditions that force the Galois image into the overgroup. A second mechanism is the chief-series analysis of $E^{2}$_n(d), where the layers M_n, ker(res_n), and quotients isomorphic to C_2 wreath Aut(T_{n-1}) give a unique tower of normal subgroups and the rank bound two.

What would settle it

For a specific degree-3 PCF polynomial whose critical set has tail length L = 0 and period O = 1, compute the index-two sign-kernel group $E^{2}$_n(3) and the order of Gal^n_f($\alpha$) for one small n; if Gal^n_f($\alpha$) contains an element of odd sign at level 2 while also failing to lie in ker(sgn_2), the containment in $E^{2}$_n(3) fails. More directly, choose $\alpha$ equal to a critical value of f, so f(z) - $\alpha$ has a repeated root; then $Gal^{1}$_f($\alpha$) is not even well-defined as a subgroup of Aut(T_1(d)), and the claimed embedding, as stated, breaks.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.1: if f is a degree d PCF polynomial over a number field K and $\alpha$ is not periodic under f, then Gal^n_f($\alpha$) is isomorphic to a subgroup of one of the sign-kernel groups $E^{{(m,m')}}$_n(d) or $F^{{(m,m')}}$_n(d), where m and m' are computed from the critical set's tail length L and period O. Odd-degree maps with L <= 1 land in $E^{{2O}}$_n(d); odd-degree maps with L > 1 land in $F^{{(L+2O-1, L-1)}}$_n(d); even-degree maps land in $E^{{(m,m')}}$_n(d) with (m,m') = (O+1,1) when L=0 and (L+O, L) when L>1. The proof mechanism is that for a PCF map, the discriminants disc(f^n(z) - $\alpha$) become squares after a bounded number of levels, so quadratic sign conditions along the tree hold from some level onward and force the image into the kernel of a suitable sign homomorphism. The paper also proves that the group $E^{2}$_n(d) is generated by two elements and has a unique chief series for odd d, and exhibits f(z) = $2z^{3}$ - $3z^{2}$ + 1 as the first proven exact realization: under a mild arithmetic condition on the basepoint, Gal^n_f($\alpha$) is isomorphic to $E^{2}$_n(3) for every n.

Load-bearing premise

The theorem assumes that the basepoint $\alpha$ is not periodic, but the containment statement relies on f^n(z) - $\alpha$ being squarefree for every n, namely that $\alpha$ avoids the forward orbits of all critical points; without that the tree collapses and the embedding into Aut(T_n(d)) is not defined.

Editorial extensions

If this is right

  • The Odoni index of every PCF polynomial arboreal representation is infinite, now as a corollary of containment in sign-kernel overgroups whose orders are strictly smaller than the full tree automorphism group.
  • For PCF polynomials, the infinite tree image is constrained by finitely many quadratic conditions, so one can hope to compute the exact image once those quadratic extensions and a finite base level are understood.
  • The exact realization Gal^n_f(alpha) = E^2_n(3) for f(z) = 2z^3 - 3z^2 + 1 shows that at least one natural overgroup is not merely an upper bound but the true image, validating the overgroup framework as a classification tool.
  • Since E^2_n(d) needs only two generators for every n and has a unique chief series, the profinite limit of the realized image is a finitely generated pro-2-type group with a rigid normal-subgroup structure.
  • For odd-degree normalized dynamical Belyi polynomials, the image is automatically a subgroup of E^{2}_n(d), giving a uniform structural result across that whole family.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper's Theorem 1.1 likely holds under the additional hypothesis that alpha avoids the postcritical set of f, since the embedding of Gal^n_f(alpha) into Aut(T_n(d)) requires f^n(z) - alpha to be squarefree at every level; the stated 'alpha not periodic' condition alone does not guarantee this.
  • The exact realization for the portrait 0 -> 1, 1 -> 0 suggests that other non-conjugate critical portraits, such as 0 -> 1, 1 -> 0 with different ramification, could produce exact realizations of E^{(m,m')}_n or F^{(m,m')}_n for other small parameters, providing a testable family of examples.
  • The chief-series technique for E^2_n may generalize to E^m_n only at the cost of losing uniqueness of the minimal normal subgroup; the paper's own final section identifies why m >= 3 breaks the tower argument, so the rank question for those groups is open and the methods here do not transfer directly.
  • The semiconjugate observation that f = -B(z) + 1 with f^2 = B^2 suggests that arboreal images may be compared through functional equations, hinting at a dynamical isogeny principle for Galois images of twisted Belyi maps that the paper leaves for future work.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper introduces two families of subgroups E and F of Aut(T_n(d)), defined as kernels of sign functions on the tree automorphism group, and claims (Theorem 1.1) that the n-th arboreal Galois group of any postcritically finite polynomial over a number field embeds into one of these groups, with parameters determined by the tail length L and period O of the critical set. The paper further studies the group E^2_n(d), proving it has rank 2 and a unique chief series (Theorem 1.2), and presents f(z)=2z^3-3z^2+1 as an example whose arboreal image is exactly E^2_n(3) under certain arithmetic conditions (Theorem 1.3). The manuscript is written from the author's thesis and leans heavily on earlier work, especially [2], for both framework and proof details.

Significance. If the main theorem were fully established, it would be a valuable structural result: all PCF arboreal representations would be constrained by finitely many quadratic sign conditions, and the exact realization E^2_n(3) would be a concrete new example of an arboreal image equal to one of the overgroups. The parameter-free construction of the sign-kernel groups is a strength, and the group-theoretic analysis of E^2_n is potentially of independent interest. However, the current manuscript has several load-bearing gaps: Theorem 1.1 omits the standard postcritical-avoidance hypothesis, its proof contains an internal parameter inconsistency and an omitted even-degree case, Theorem 1.3 is essentially delegated to [2], and Lemma 3.6 appears false. These issues prevent acceptance in the present form, though most appear fixable.

major comments (4)
  1. [Theorem 1.1; §3.1 proof] Theorem 1.1 as stated omits the standard hypothesis that alpha avoids the postcritical set of f. The proof begins "Since alpha is not periodic, the dynamical tree of f at alpha is isomorphic to a full d-ary tree," which is false: a full d-ary tree requires f^n(z)-alpha to be squarefree for every n, equivalently alpha not in f^n(C_f) for any n. For example, f(z)=z^2-2 over Q has C_f={0}, f(0)=-2, f(-2)=2=f(2), and alpha=-2 is strictly preperiodic but not periodic; however f(z)-alpha=z^2 has a double root, so Gal^1_f(alpha) does not embed in Aut(T_1(2)) in the usual sense. Moreover Lemma 2.9's discriminant formula contains the factor (f(c)-alpha), so the square-discriminant conclusion becomes vacuous when alpha is a critical value. The theorem must add the hypothesis that alpha is not in the postcritical set P_f (or at least alpha is not in f^n(C_f) for any n), as the Introduction's vague "under certain conditions" hints but does not state. This is load-bearing because the induction and the containment are defined only on a full d-ary tree.
  2. [Theorem 1.1(2)-(3); §3.1 proof] The statement and proof of Theorem 1.1 do not match in two places. For odd L>1, the proof chooses m=L+2O+1 and cites Lemma 2.9.(2), but the theorem states F^{(L+2O-1,L-1)}_n(d), and the applicable Lemma 2.9.(3) gives exponent L+2O-1. In the same paragraph the conclusion is phrased as containment in E^{(m,m')}_m, although the theorem requires F for this case. For even degree, the theorem only lists L=0 and L>1, omitting L=1; Lemma 2.9.(4) covers L=1 and would give (m,m')=(O+1,1). This is not an empty case: for f(z)=z^4-2z^2, C_f={0,±1}, f(C_f)={0,-1} is periodic, but C_f itself is not, so L=1. The theorem needs a complete case split, and the proof must use the matching parameters.
  3. [Theorem 1.3; §3.3 proof] The proof of Theorem 1.3 consists of the sentence "In [2], the authors showed that the existence of elements of order 2 and 3 implies the presence of a two-cycle permutation in Gal(K^2_f/K) and a three-cycle permutation in Gal(K^3_f/K) that fixes f^{-1}(x). The same proof works in our case." This is not a proof of the exact isomorphism Gal^n_f(alpha) ≅ E^2_n(3). The preceding lemmas establish irreducibility and the existence of elements of order 2 and 3 in certain extensions, and Theorem 1.1 gives containment in E^2_n(3), but equality requires an order computation or an explicit argument that the group generated has order |E^2_n(3)|. The appeal to [2] does not verify that its hypotheses transfer to f(z)=2z^3-3z^2+1 and to Condition (3.1). Please provide the missing details, or state Theorem 1.3 as conditional on the argument in [2] applying verbatim.
  4. [Lemma 3.6; §3.2] Lemma 3.6 claims H_i=H_1 for all i with k_i=d^{i-1}+1. This is not proved and appears false. The group Aut(T_n) preserves the level-1 block partition of the leaves, so the pair {1,k_1} lies inside a single level-1 block, while {1,k_2} with k_2=d+1 lies in two different level-1 blocks; these pairs are in different orbits. For n=2 and d=3, the subgroup generated by X_1 is contained in the tuples that have even parity in each level-1 block, whereas X_2 contains the cross-block vector e_1+e_4, which is not in that subspace; hence H_1≠H_2. Since Lemma 3.8 invokes Lemma 3.6 to identify ker(res_{n-1})/M_n as the unique minimal normal subgroup of E^2_n/M_n, the proof of Theorem 1.2 depends on this step and needs to be repaired or replaced.
minor comments (4)
  1. [Lemma 2.1] The statement says "with m>n," but the proof uses Aut(T_{n-m}), so the intended hypothesis is m≤n.
  2. [Proposition 2.3 proof] In the induction step, "the last equality follows from n being even" should read "d being even."
  3. [Corollary 3.11] The proof says "The proof follows by induction, and more details can be found in [2]." Please provide the induction or a precise statement of which result in [2] is being transferred and why it applies here.
  4. [Throughout] There are numerous typos and formatting issues, including "proof Theorem 1.1" in the section heading, "a f n" in the abstract, and the acknowledgments thanking "the anonymous referee ... and its eventual publication," which is inappropriate for a submitted manuscript. A careful editorial pass is needed.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: the overgroups and discriminant constraints are derived independently; the only self-citation is in open questions and is not load-bearing.

full rationale

The paper's central claims are not circular. The groups E^{(m,m')}_n(d) and F^{(m,m')}_n(d) are defined directly in Section 2.1 as kernels of sign functions on Aut(T_n(d)), independently of any Galois group. Theorem 1.1 then proves containment of Gal^n_f(alpha) in these groups using the discriminant computations of Lemma 2.9, which are derived from the PCF hypothesis and the factorization of disc(f^n - alpha). No parameter is fitted to the target examples, and no prediction is obtained by renaming an input. The proof of Theorem 1.3 relies on the method of the external paper [2] (Benedetto-Faber-Hutz-Juul-Yasufuku), not on a self-citation. The only self-citation to the author's own thesis [23] appears in the concluding open questions, where it is explicitly described as future research and does not support any theorem. The manuscript does contain a genuine correctness gap that is not circularity: the proof of Theorem 1.1 states 'Since α is not periodic, the dynamical tree of f at α is isomorphic to a full d-ary tree,' but a full tree also requires that α avoid the forward orbits of finite critical points so that f^n(z)-alpha has distinct roots; the Introduction's 'under certain conditions' hints at this, while the theorem statement omits it. This affects whether the embedding into Aut(T_n(d)) is well-defined in the stated generality, but it is not a case of the argument reducing to its own assumptions. Accordingly, no circular step is identified and the circularity score is 1.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

No free parameters are fitted. The central results depend on standard group theory, on the squarefree-tree assumption, and on the cited argument from [2] for the example.

assumptions (3)
  • domain assumption The dynamical preimage tree at alpha is a full d-ary tree; i.e., f^n(z)-alpha is squarefree for every n.
    The paper's Introduction mentions 'under certain conditions' but Theorem 1.1 only states alpha is not periodic; this is a standing assumption for the embedding into Aut(T_n(d)).
  • standard math Dalla Volta-Lucchini bound on generator number for groups with a unique minimal normal subgroup.
    Used in Lemma 3.2 and in the proof of Theorem 1.2 to bound d(E^2_n).
  • domain assumption The argument in [2] that, for the Belyi family, the presence of 2-cycles and 3-cycles forces Gal^n_f(alpha) to be the full E^2_n(3) applies verbatim to f(z)=2z^3-3z^2+1.
    The proof of Theorem 1.3 is a citation to this argument; if the analogy fails, the equality result is unproved.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Overgroups of the arboreal representation of PCF polynomial." pith.science (2026). https://pith.science/paper/GSJ76LW6

@misc{pith2026250600456,
  author       = {Pith},
  title        = {Pith review of: Overgroups of the arboreal representation of PCF polynomial},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/GSJ76LW6}},
  note         = {Machine review of arXiv:2506.00456}
}
abstract

Consider a number field $K$ and a rational function $f$ of degree greater than 1 over $K$. By taking preimages of $\alpha\in K$ under successive iterates of $f$, an infinite $d$-ary tree $T_\infty$ rooted at $\alpha$ can be constructed. An edge is assigned between two preimages $x$ and $y$ if $f(x)=y$. The absolute Galois group of $K$, acting on $T_\infty$ through tree automorphisms, generates a subgroup $\text{Gal}_f^\infty(\alpha)$ in the group of all automorphisms of $T_\infty$, $\text{Aut}(T_\infty)$. We have discovered a new class of natural overgroups in which the image of the Galois representation attached to a PCF polynomial must reside. Moreover, we have found that the image of the Galois representation of a new PCF polynomial is isomorphic to one of these overgroups. We also investigate the structure of these overgroups for specific maps, such as normalized dynamical Belyi polynomials, and show that the normal subgroups of these overgroups form a unique chief series. This allows us to bound the number of generators through group-theoretic analysis.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

25 extracted references · 24 canonical work pages

  1. [2]

    Benedetto, Xander Faber, Benjamin Hutz, Jamie Juul, and Yu Yasufuku

    Robert L. Benedetto, Xander Faber, Benjamin Hutz, Jamie Juul, and Yu Yasufuku. A large arboreal Galois representation for a cubic postcritically finite polynomial.Res. Number Theory, 3:Art. 29, 21, 2017

    2017

  2. [3]

    I.I. Bouw, Ö. Ejder, and V . Karemaker. Dynamical belyi maps and arboreal galois groups. manuscripta math, 2020

    work page 2020

  3. [1]

    Benedetto, Jennifer Cain, Gregory Carroll, and Lily Fang

    Faseeh Ahmad, Robert L. Benedetto, Jennifer Cain, Gregory Carroll, and Lily Fang. The arithmetic basilica: a quadratic pcf arboreal galois group, 2019

    work page 2019

  4. [4]

    Andrew Bridy and Thomas J. Tucker. Finite index theorems for iterated Galois groups of cubic polynomials. Math. Ann., 373(1-2):37–72, 2019

    work page 2019

  5. [5]

    Bush, Wade Hindes, and Nicole R

    Michael R. Bush, Wade Hindes, and Nicole R. Looper. Galois groups of iterates of some unicritical polynomials. Acta Arith., 181(1):57–73, 2017

    work page 2017

  6. [6]

    Ramification in iterated towers for rational functions

    John Cullinan and Farshid Hajir. Ramification in iterated towers for rational functions. Manuscripta Math., 137(3-4):273–286, 2012

    work page 2012

  7. [7]

    Finite groups that need more generators than any proper quotient

    Francesca Dalla Volta and Andrea Lucchini. Finite groups that need more generators than any proper quotient. J. Austral. Math. Soc. Ser. A, 64(1):82–91, 1998

    work page 1998

  8. [8]

    Detomi and A

    E. Detomi and A. Lucchini. Crowns and factorization of the probabilistic zeta function of a finite group. J. Algebra, 265(2):651–668, 2003

    work page 2003

Show all 25 references
  1. [9]

    Quadratic recurrences with a positive density of prime divisors

    Richard Gottesman and Kwokfung Tang. Quadratic recurrences with a positive density of prime divisors. Int. J. Number Theory, 6(5):1027–1045, 2010

    2010

  2. [10]

    Gratton, K

    C. Gratton, K. Nguyen, and T. J. Tucker. ABC implies primitive prime divisors in arithmetic dynamics. Bull. Lond. Math. Soc., 45(6):1194–1208, 2013

    2013

  3. [11]

    The density of primes in orbits of zd + c

    Spencer Hamblen, Rafe Jones, and Kalyani Madhu. The density of primes in orbits of zd + c. Int. Math. Res. Not. IMRN, (7):1924–1958, 2015

    1924

  4. [12]

    Points on elliptic curves parametrizing dynamical Galois groups.Acta Arith., 159(2):149– 167, 2013

    Wade Hindes. Points on elliptic curves parametrizing dynamical Galois groups.Acta Arith., 159(2):149– 167, 2013

    2013

  5. [13]

    Martin Isaacs

    I. Martin Isaacs. Algebra: a graduate course , volume 100 of Graduate Studies in Mathematics . American Mathematical Society, Providence, RI, 2009. Reprint of the 1994 original

    2009

  6. [14]

    The density of prime divisors in the arithmetic dynamics of quadratic polynomials

    Rafe Jones. The density of prime divisors in the arithmetic dynamics of quadratic polynomials. J. Lond. Math. Soc. (2), 78(2):523–544, 2008

    2008

  7. [15]

    Théorie des Nombres et Applications

    Rafe Jones. Galois representations from pre-image trees: an arboreal survey. In Actes de la Conférence “Théorie des Nombres et Applications” , volume 2013 of Publ. Math. Besançon Algèbre Théorie Nr. , pages 107–136. Presses Univ. Franche-Comté, Besançon, 2013

    2013

  8. [16]

    Galois theory of quadratic rational functions

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

    2014

  9. [17]

    J. Juul. Iterates of generic polynomials and generic rational functions. Trans. Amer. Math. Soc. , 371(2):809–831, 2019

    2019

  10. [18]

    Galois Groups of Iterated Rational Maps and their Applications

    Jamie Juul. Galois Groups of Iterated Rational Maps and their Applications. ProQuest LLC, Ann Arbor, MI. Thesis (Ph.D.)–University of Rochester

  11. [19]

    Arboreal Galois representation for a certain type of quadratic polynomials

    Hua-Chieh Li. Arboreal Galois representation for a certain type of quadratic polynomials. Arch. Math. (Basel), 114(3):265–269, 2020

    2020

  12. [20]

    Dynamical Galois groups of trinomials and Odoni’s conjecture

    Nicole Looper. Dynamical Galois groups of trinomials and Odoni’s conjecture. Bull. Lond. Math. Soc. , 51(2):278–292, 2019

    2019

  13. [21]

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

    1985

  14. [22]

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

    1985

  15. [23]

    Topics in Arithmetic Dynamical Systems

    Wayne Peng. Topics in Arithmetic Dynamical Systems . ProQuest LLC, Ann Arbor, MI, 2020. Thesis (Ph.D.)–University of Rochester

    2020

  16. [24]

    Profinite iterated monodromy groups arising from quadratic morphisms with infinite postcritical orbits, 2013

    Richard Pink. Profinite iterated monodromy groups arising from quadratic morphisms with infinite postcritical orbits, 2013. 24 OVERGROUPS OF THE ARBOREAL REPRESENTATION OF PCF POLYNOMIALS

    2013

  17. [25]

    Propriétés galoisiennes des points d’ordre fini des courbes elliptiques

    Jean-Pierre Serre. Propriétés galoisiennes des points d’ordre fini des courbes elliptiques. Invent. Math., 15(4):259–331, 1972

    1972

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.