Profinite Geometric Iterated Monodromy Groups

• Profinite geometric iterated monodromy groups are closed self-similar subgroups of automorphism groups of rooted trees, defined by the monodromy of iterated covers of rational maps.
• Their structure is classified via combinatorial invariants such as postcritical graphs, ramification portraits, and recursive generators, enabling explicit computation of properties like Hausdorff dimension.
• They exhibit diverse dynamical and arithmetic behaviors that link discrete dynamics, self-similarity, and growth phenomena in profinite and arithmetic settings.

Profinite geometric iterated monodromy groups are closed self-similar subgroups of automorphism groups of rooted preimage trees arising from the geometric monodromy of iterated covers attached to rational maps. For a postcritically finite or more generally an iterated dynamical covering, the geometric étale fundamental group, or equivalently the geometric Galois group of the generic splitting tower, acts on the rooted tree of preimages of a basepoint and produces a profinite group inside $\operatorname{Aut}(T)$. In the postcritically finite setting this profinite group is naturally identified with the profinite completion of the corresponding discrete iterated monodromy group, and in a number of families its conjugacy class is controlled by finite combinatorial data such as the postcritical graph or ramification portrait (Pink, 2013, Hlushchanka et al., 7 Jul 2025, Ejder, 2022).

1. Definition and ambient rooted-tree formalism

Let $f\in K(z)$ be a rational map of degree $d$, let $P(f)$ be its postcritical set, and choose a basepoint $x_0\notin P(f)$. The rooted tree of iterated preimages

$T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$

is a regular $d$-ary tree after choosing an identification with $X^*=\bigsqcup_{n\ge 0}X^n$, where $\#X=d$. The geometric iterated monodromy group is the image of the geometric fundamental group on this tree; in Galois-theoretic language, if $K_n$ is the splitting field of $f\in K(z)$0 over $f\in K(z)$1 and $f\in K(z)$2 for $f\in K(z)$3, then

$f\in K(z)$4

The arithmetic iterated monodromy group is defined similarly over $f\in K(z)$5, and $f\in K(z)$6 is a closed normal subgroup of $f\in K(z)$7 (Hlushchanka et al., 7 Jul 2025).

The ambient automorphism group is itself profinite, as an inverse limit of the automorphism groups of the truncated trees. Its basic structure is wreath recursion. For the binary tree one has

$f\in K(z)$8

and for the ternary tree

$f\in K(z)$9

with elements written as $d$0, where $d$1 is the permutation induced on the first level and the $d$2 are the sections. This recursion is the formal basis for self-similarity, explicit generator formulas, normalizer computations, and finite-level growth estimates (Pink, 2013, Hlushchanka et al., 7 Jul 2025).

For postcritically finite maps, the profinite geometric group recovers the completion of the classical discrete iterated monodromy group defined from topological monodromy on $d$3. In particular, for $d$4, the profinite group is the closure of the usual discrete iterated monodromy group in $d$5 (Pink, 2013). The same completion statement is recorded for postcritically finite cubic polynomials, where $d$6 (Hlushchanka et al., 7 Jul 2025).

2. Quadratic polynomials with finite postcritical orbit

For a quadratic polynomial over a field of characteristic different from $d$7, one critical point is $d$8, fixed by $d$9, and the other is a finite point $P(f)$0. Writing $P(f)$1, the postcritical set has the form $P(f)$2 with $P(f)$3. The profinite geometric iterated monodromy group is topologically generated by inertia elements attached to postcritical points, and after discarding the redundant generator at $P(f)$4 one obtains recursion relations depending only on the combinatorics of the directed postcritical graph. In the periodic case the model generators satisfy

$P(f)$5

while in the strictly pre-periodic case

$P(f)$6

A central semirigidity theorem states that any closed subgroup of $P(f)$7 generated by elements satisfying the same weak recursive conjugacy relations is conjugate to the model group $P(f)$8. In this precise sense, the conjugacy class, hence the isomorphism class, depends only on the combinatorial type of the postcritical orbit (Pink, 2013).

The combinatorial type distinguishes the infinite case, the finite periodic case of length $P(f)$9, and the strictly pre-periodic case with preperiod $x_0\notin P(f)$0 and eventual period $x_0\notin P(f)$1. Once the directed graph structure of the critical orbit is fixed, the profinite geometric group is determined up to conjugacy in $x_0\notin P(f)$2. This is one of the strongest classification principles available in the quadratic polynomial setting, because it replaces transcendental constructions by a purely profinite and group-theoretic analysis (Pink, 2013).

The same work computes several basic invariants explicitly. In the periodic case,

$x_0\notin P(f)$3

In the strictly pre-periodic case,

$x_0\notin P(f)$4

and the Hausdorff dimension is

$x_0\notin P(f)$5

The normalizer $x_0\notin P(f)$6 is also explicit: $x_0\notin P(f)$7 in the periodic case, whereas the strictly pre-periodic case yields $x_0\notin P(f)$8 in most cases, with an exceptional quotient $x_0\notin P(f)$9 for $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$0 (Pink, 2013).

Odometers play a distinguished role. The standard odometer is defined by

$T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$1

and odometers are exactly the elements conjugate to $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$2, equivalently those acting transitively on every level, equivalently those with sign $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$3 on every level. In the periodic quadratic model, the product $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$4 is an odometer, the set of odometers has Haar measure $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$5, and all odometers in $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$6 are conjugate under the normalizer (Pink, 2013).

3. Infinite postcritical orbits and exceptional binary models

For quadratic morphisms $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$7 of degree $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$8 with infinite postcritical orbit, the relevant critical points are $T_f=\bigsqcup_{n\ge 0} f^{-n}(x_0)$9 and $d$0, with forward images $d$1 and $d$2. Pink isolates several combinatorial types for the infinite postcritical orbit. In the generic situations, the profinite geometric iterated monodromy group is as large as possible: $d$3 This occurs when the two critical orbits do not first collide in the exceptional “diagonal collision” pattern (Pink, 2013).

The exceptional case arises when $d$4 is minimal such that

$d$5

Then the geometric group is conjugate to an explicitly defined model $d$6, generated by recursively defined elements $d$7 and $d$8. The classification theorem states that the geometric group is determined, up to conjugacy in $d$9, by this combinatorial datum. Thus the infinite-orbit classification has the same formal shape as the finite quadratic-polynomial classification: generic dynamics give the full tree automorphism group, while the exceptional collision pattern yields a canonical closed self-similar subgroup (Pink, 2013).

The exceptional groups $X^*=\bigsqcup_{n\ge 0}X^n$0 admit precise finite-level and dimensional formulas. If $X^*=\bigsqcup_{n\ge 0}X^n$1 denotes the image in $X^*=\bigsqcup_{n\ge 0}X^n$2, then

$X^*=\bigsqcup_{n\ge 0}X^n$3

Hence

$X^*=\bigsqcup_{n\ge 0}X^n$4

Their normalizers are again explicit: if $X^*=\bigsqcup_{n\ge 0}X^n$5, then

$X^*=\bigsqcup_{n\ge 0}X^n$6

This quotient is realized by recursively defined normalizing elements $X^*=\bigsqcup_{n\ge 0}X^n$7 with $X^*=\bigsqcup_{n\ge 0}X^n$8 and $X^*=\bigsqcup_{n\ge 0}X^n$9 (Pink, 2013).

These results show that the infinite postcritical setting is not merely an uncontrolled limit of the postcritically finite case. The exceptional groups still carry rigid recursive structure, level transitivity, explicit normalizer theory, and a clean Hausdorff dimension formula. A plausible implication is that the combinatorics of the first critical collision, rather than finiteness of the postcritical set itself, is the decisive structural parameter in the binary degree-$\#X=d$0 theory (Pink, 2013).

4. Higher-degree and non-polynomial families

For postcritically finite cubic polynomials over number fields satisfying Assumption (Y), the profinite geometric iterated monodromy group is studied as a subgroup of the automorphism group of the ternary rooted tree. Standard generators come from $\#X=d$1-petals around postcritical points, and the generator corresponding to $\#X=d$2 is an odometer acting transitively on every level. The main theorem gives two classification statements: $\#X=d$3 is finitely invariably generated by the standard generating set, and it is determined up to conjugacy in $\#X=d$4 by the isomorphism class of the ramification portrait. The associated model groups are regular branch over the closure of the commutator subgroup and contain torsion elements of every order realizable in $\#X=d$5, namely every order $\#X=d$6 (Hlushchanka et al., 7 Jul 2025).

A separate higher-degree family is provided by normalized single-cycle genus-zero dynamical Belyi maps. Here the geometric group is completely described by two explicit profinite groups. If at least one ramification index $\#X=d$7 is even, then

$\#X=d$8

while if all $\#X=d$9 are odd, then

$K_n$0

where $K_n$1 is the iterated wreath product of $K_n$2 and $K_n$3 is defined recursively by a sign condition on level $K_n$4. The normalizer quotients satisfy

$K_n$5

Thus the geometric group is again not an arbitrary closed subgroup of $K_n$6, but one of two explicit inverse-limit groups determined by the parity pattern of the ramification indices (Ejder, 2022).

Non-polynomial quadratic rational maps show that the profinite geometric theory is not confined to polynomial dynamics. For

$K_n$7

the postcritical cycle $K_n$8 yields recursively defined generators

$K_n$9

with $f\in K(z)$00; the finite-level images satisfy $f\in K(z)$01 for $f\in K(z)$02 and $f\in K(z)$03. The same paper proves that there are no odometers in this group, and under Conjecture 7.15 deduces the Hausdorff dimension $f\in K(z)$04 (Ejder et al., 2023). For

$f\in K(z)$05

the geometric group is generated by

$f\in K(z)$06

with $f\in K(z)$07. The resulting profinite group is a pro-$f\in K(z)$08 group with

$f\in K(z)$09

$f\in K(z)$10

and

$f\in K(z)$11

This family also contains no odometers (Ejder et al., 21 May 2026).

5. Arithmetic quotients, normalizers, and specialization

In all of these settings the arithmetic iterated monodromy group is constrained by the normalizer of the geometric one. For quadratic polynomials with finite postcritical orbit, the arithmetic quotient $f\in K(z)$12 is described using the normalizer and explicit maps from cyclotomic data. In the periodic case the induced map

$f\in K(z)$13

is the cyclotomic character followed by the diagonal embedding $f\in K(z)$14. In the strictly pre-periodic cases the quotient is small: of order dividing $f\in K(z)$15 in some cases, dividing $f\in K(z)$16 in the exceptional $f\in K(z)$17-case, and equal to $f\in K(z)$18 whenever the field contains enough roots of unity (Pink, 2013).

For quadratic morphisms with infinite postcritical orbit, the arithmetic/geometric gap is even more rigid. When $f\in K(z)$19, the quotient $f\in K(z)$20 is determined by the Galois action on the two critical points. If both critical points are $f\in K(z)$21-rational, then $f\in K(z)$22; otherwise the arithmetic group is an index-$f\in K(z)$23 extension of the geometric group generated by one extra involution from the normalizer (Pink, 2013). For dynamical Belyi maps of arbitrary degree in the normalized single-cycle genus-zero family, the quotient has order either $f\in K(z)$24 or $f\in K(z)$25, so the arithmetic group is either equal to the geometric group or differs by a quadratic twist (Ejder, 2022).

Specialization results sharpen this picture for fixed basepoints. For the map $f\in K(z)$26, if $f\in K(z)$27 denotes the arboreal Galois group over $f\in K(z)$28, then the following are equivalent: $f\in K(z)$29

$f\in K(z)$30

and

$f\in K(z)$31

The same paper identifies the Frattini subgroup by

$f\in K(z)$32

with $f\in K(z)$33 (Ejder et al., 2023). For $f\in K(z)$34, maximality of the arboreal Galois group is already decided at level $f\in K(z)$35, and for $f\in K(z)$36 the constant field satisfies

$f\in K(z)$37

The arithmetic iterated monodromy group in this family has Hausdorff dimension zero (Ejder et al., 21 May 2026).

6. Boundary dynamics, Cantor actions, and growth-theoretic phenomena

The action of a profinite geometric iterated monodromy group extends from finite tree levels to the boundary $f\in K(z)$38 of the rooted tree, viewed as the space of ends. This produces a compact totally disconnected dynamical system endowed with Haar measure. For a post-critically finite complex polynomial $f\in K(z)$39, let $f\in K(z)$40 and $f\in K(z)$41. The quantity

$f\in K(z)$42

measures the Haar proportion of boundary-fixing elements. If $f\in K(z)$43 is not exceptional, then

$f\in K(z)$44

The exceptional cases are highly constrained: the two-point exceptional family is linearly conjugate to $f\in K(z)$45, and in those cases the measure is $f\in K(z)$46 for $f\in K(z)$47 with even $f\in K(z)$48 and $f\in K(z)$49 for $f\in K(z)$50 with odd $f\in K(z)$51 (Jones, 2012).

A complementary topological invariant is the asymptotic discriminant of the associated Cantor action. For quadratic polynomials, the geometric action is stable only in very small cases: if the critical orbit is strictly periodic with $f\in K(z)$52, the action is LQA with trivial discriminant group; if it is strictly pre-periodic with $f\in K(z)$53, the action is LQA with finite discriminant group. In the periodic case with $f\in K(z)$54 and in the strictly pre-periodic case with $f\in K(z)$55, the geometric action is wild. The infinite critical-orbit case is also wild, since Pink’s results imply $f\in K(z)$56 there. The arithmetic action is stable only in the $f\in K(z)$57 periodic case and the $f\in K(z)$58 strictly pre-periodic case, and in those stable cases the discriminant group is infinite (Lukina, 2018).

Growth theory supplies a further discrete counterpart. Certain invertible reduced kneading automata over the binary alphabet define groups of intermediate growth, and by Nekrashevych’s theorem the planar no-bad-isotropy cases among them are iterated monodromy groups of post-critically finite quadratic polynomials. The paper on intermediate growth treats the kneading sequences

$f\in K(z)$59

proves subexponential and superpolynomial growth, and exhibits a further example $f\in K(z)$60 admitting no admissible length function. These results concern discrete groups, but they belong to the same self-similar rooted-tree setting whose profinite closures yield geometric iterated monodromy groups (Dougherty et al., 2012).

Taken together, these developments show that profinite geometric iterated monodromy groups form a rigid yet varied class of self-similar profinite groups. In the best-understood families they are classified by postcritical or ramification combinatorics, admit explicit recursive generators, and have computable invariants such as Hausdorff dimension, abelianization, normalizer quotient, branch structure, torsion spectrum, fixed-point statistics, and asymptotic discriminant. The recurrent theme is that the rooted-tree action retains enough dynamical information to make geometric monodromy simultaneously arithmetic, combinatorial, and group-theoretic (Pink, 2013, Hlushchanka et al., 7 Jul 2025, Pink, 2013).