Profinite Iterated Monodromy Group (pfIMG)

• pfIMG is a closed self-similar group defined on the rooted tree of iterated preimages, encoding recursive monodromy and critical-orbit combinatorics.
• It distinguishes geometric and arithmetic variants through explicit recursive presentations and Galois-theoretic formulations in dynamical systems.
• The structure exhibits rich properties such as branch behavior, semirigidity, and measurable fixed-point dynamics on the tree boundary.

A profinite iterated monodromy group (pfIMG) is a closed self-similar group attached to the rooted tree of iterated preimages of a dynamical system. In the classical complex setting, it is the closure of the iterated monodromy group $\mathrm{IMG}(f)$ inside the automorphism group of the preimage tree; in arithmetic settings, it is defined directly as a profinite Galois image, with geometric and arithmetic variants reflecting whether constants are algebraically closed. Across these formulations, pfIMGs encode recursive monodromy, critical-orbit combinatorics, and arithmetic information such as constant field extensions, cyclotomic quotients, and arboreal specializations (Godillon, 2014, Adams et al., 17 Apr 2025, Adams, 16 Aug 2025).

1. Definition and basic frameworks

For a postcritically finite branched covering or partial self-covering, the tree of preimages is formed by the iterated fibers over a basepoint, with level $n$ consisting of the points in $f^{-n}(t)$. The fundamental group acts on this rooted tree by path lifting, and the discrete iterated monodromy group is the image

$\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$

viewed as a self-similar subgroup of $\mathrm{Aut}(T)$ (Godillon, 2014). For a Thurston map $f:S^2\to S^2$, the same construction appears as

$$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$

where $T_f$ is the dynamical preimage tree (Hlushchanka et al., 2016).

The profinite version is obtained by passing from the discrete action to a closed action on the full tree. For post-critically finite complex polynomials, the closure $\overline{\mathrm{IMG}(f)}$ in the natural profinite topology on $\mathrm{Aut}(T)$ acts continuously on the tree and on its boundary $n$0 (Jones, 2012). In arithmetic language, one distinguishes the geometric pfIMG and the arithmetic pfIMG. For a unicritical polynomial $n$1 with $n$2 coprime to $n$3, the geometric pfIMG is denoted $n$4, the arithmetic pfIMG is

$n$5

and there is a short exact sequence

$n$6

where $n$7 is the constant field extension inside $n$8 (Adams et al., 17 Apr 2025).

A related but important distinction concerns whether the closure in tree automorphisms agrees with the abstract profinite completion. In the rooted-tree setting of classical IMGs, the closure is the profinite completion because the group is residually finite (Godillon, 2014). For post-singularly finite exponential maps, by contrast, the discrete IMG is not residually finite, so its profinite completion is strictly larger than the IMG, while the pfIMG is defined as the closure in the group of tree automorphisms (Reinke, 2020).

2. Self-similarity, wreath recursion, and semirigidity

The defining structural feature of pfIMGs is self-similarity. After choosing a labeling of the rooted $n$9-ary tree by words over a $f^{-n}(t)$0-letter alphabet, an automorphism admits a wreath-recursive description

$f^{-n}(t)$1

or, in degree $f^{-n}(t)$2,

$f^{-n}(t)$3

where $f^{-n}(t)$4 is the action on the first level and the components are sections on rooted subtrees (Godillon, 2014, Hlushchanka et al., 7 Jul 2025). This allows pfIMGs to be studied as closed self-similar subgroups of iterated wreath products.

For quadratic polynomials over fields of characteristic different from two, the geometric pfIMG is generated by recursively defined inertia-type elements attached to the postcritical orbit, and its conjugacy class depends only on the combinatorial type of that orbit (Pink, 2013). The same pattern persists for quadratic morphisms with infinite postcritical orbit: the geometric pfIMG is a self-similar closed subgroup of the automorphism group of the regular rooted binary tree, and in the proper non-full cases it is conjugate to an explicit subgroup $f^{-n}(t)$5 determined by the first collision in the critical orbits (Pink, 2013).

A central rigidity phenomenon is semirigidity. For quadratic polynomials, arbitrary generators satisfying the recursion relations up to conjugacy generate a subgroup conjugate to the standard model (Pink, 2013). For the quadratic non-polynomial map $f^{-n}(t)$6, the geometric group is modeled by explicit generators

$f^{-n}(t)$7

and a rigidity statement shows that any triple conjugate levelwise to these generators and satisfying $f^{-n}(t)$8 is itself conjugate into the model group (Ejder et al., 2023).

For unicritical polynomials, the closed self-similar subgroup can be presented explicitly inside the infinite iterated wreath product $f^{-n}(t)$9. In the post-critically infinite case, $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$0. In the periodic and preperiodic cases, the group is generated by recursively defined tuples whose precise form is controlled by the critical orbit and, in the preperiodic case, by the parameter $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$1 such that $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$2 (Adams et al., 17 Apr 2025).

3. Geometric versus arithmetic pfIMGs

The distinction between geometric and arithmetic pfIMGs is most transparent in Galois-theoretic formulations. For $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$3 over a number field $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$4, the arithmetic iterated monodromy group is the image of $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$5 in $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$6, and the geometric group is the image of $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$7 (Ejder et al., 2023). The field generated by all iterated preimages contains all $\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$8-power roots of unity, and the constant field subextension is

$\mathrm{IMG}(f)=\pi_1(\mathcal{M},t)/\ker\Phi,$9

Assuming Conjecture 7.15 of that paper, the quotient satisfies

$\mathrm{Aut}(T)$0

and the geometric group is exactly the kernel of the cyclotomic character on $\mathrm{Aut}(T)$1 (Ejder et al., 2023).

The same arithmetic-geometric pattern is systematic for unicritical polynomials. The short exact sequence

$\mathrm{Aut}(T)$2

shows that the arithmetic pfIMG is an extension of the geometric pfIMG by the constant field Galois group (Adams et al., 17 Apr 2025). The constant field extension is controlled by inertia at infinity and the cyclotomic character. In the periodic case, the constant field is the full pro-$\mathrm{Aut}(T)$3 cyclotomic extension $\mathrm{Aut}(T)$4. In the preperiodic case, the level-$\mathrm{Aut}(T)$5 constant field $\mathrm{Aut}(T)$6 is explicitly described by cyclotomic formulas depending on $\mathrm{Aut}(T)$7, and is always finite except for certain exceptional cases, including the Chebyshev polynomial (Adams et al., 17 Apr 2025).

Arithmetic specialization produces arboreal Galois groups. For $\mathrm{Aut}(T)$8 and $\mathrm{Aut}(T)$9, the arboreal Galois group $f:S^2\to S^2$0 equals the arithmetic pfIMG if and only if

$f:S^2\to S^2$1

equivalently if and only if $f:S^2\to S^2$2 (Ejder et al., 2023). This identifies a concrete maximality criterion for specialization inside a PCF non-polynomial example.

4. Structural properties and subgroup theory

Many pfIMGs are branch-type profinite groups. For degree $f:S^2\to S^2$3 postcritically finite polynomials over a number field satisfying the condition that each finite postcritical point has at least one preimage outside the critical orbits, the profinite geometric iterated monodromy group is finitely invariably generated, determined up to conjugation by the isomorphism class of the ramification portrait, regular branch over the closure of its commutator subgroup, and contains torsion elements of any order realizable in the ternary tree (Hlushchanka et al., 7 Jul 2025).

Recent work on unicritical polynomials gives a uniform structural picture. The geometric pfIMG has explicitly described abelianization, and in the periodic and preperiodic cases—except for a small exceptional case corresponding to Chebyshev-like maps—it is a regular branch group (Adams et al., 17 Apr 2025). For arithmetic pfIMGs of post-critically infinite unicritical polynomials $f:S^2\to S^2$4, the arithmetic group is regular branch and has positive Hausdorff dimension

$f:S^2\to S^2$5

(Radi, 13 Feb 2026).

The relationship between a discrete IMG and its profinite closure is controlled by congruence-type phenomena. For $f:S^2\to S^2$6, the group is just-infinite, regular branch, and does not have the congruence subgroup property. In branch-group terms, this means the profinite completion $f:S^2\to S^2$7 is not isomorphic to the closure $f:S^2\to S^2$8 in $f:S^2\to S^2$9. The congruence kernel and the branch kernel are both isomorphic to

$$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$0

while the rigid kernel is trivial (Radi, 26 May 2025).

Open self-similar subgroups of pfIMGs are highly constrained. Proper open self-similar subgroups correspond to induced pullback quotients, or dynamical pullbacks, of the underlying dynamical system. For polynomials, only twisted Chebyshev maps can give rise to such nontrivial proper open self-similar subgroups. The same work defines self-similar closures of subgroups of pfIMGs and shows that many group-theoretic properties are preserved under this operation. As consequences, unicritical polynomials of composite degree do not have an open Frattini subgroup, and a polynomial with an open Frattini subgroup is often pro-$$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$1 (Adams, 16 Aug 2025).

5. Boundary action, fixed points, and measure

A pfIMG acts not only on the rooted tree $$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$2 but also on its boundary $$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$3, the space of infinite rays. For a closed subgroup $$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$4, the proportion of elements fixing at least one end is encoded by

$$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$5

which is also the Haar measure of the set of elements of $$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$6 fixing at least one point of $$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$7 (Jones, 2012).

For a post-critically finite complex polynomial of degree at least two, if the polynomial is not exceptional, then $$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$8. Thus, in the profinite closure, elements having fixed points on the boundary form a Haar-null set (Jones, 2012). The exceptional cases are those linearly conjugate to Chebyshev polynomials or one unresolved class with a non-critical fixed point having many critical preimages. In the Chebyshev cases, the measure can be computed explicitly: $$IMG(f):=\pi_1(S^2\setminus \operatorname{post}(f),t)/\ker(\phi_f)\cong \phi_f\big(\pi_1(S^2\setminus \operatorname{post}(f),t)\big)<\mathrm{Aut}(T_f),$$9 The proof uses finite automata, wreath recursion, and a martingale built from the fixed-point counts on finite levels; a key input is that every polynomial IMG contains a spherically transitive element coming from monodromy at infinity (Jones, 2012).

Arithmetic pfIMGs can display the opposite behavior. For the arithmetic profinite iterated monodromy group of a post-critically infinite unicritical polynomial $T_f$0, the fixed-point proportion is positive when $T_f$1 is odd. More precisely,

$T_f$2

where $T_f$3 is the image of $T_f$4 and $T_f$5 is a primitive $T_f$6-th root of unity. Over $T_f$7 this becomes

$T_f$8

which is positive for all odd $T_f$9 (Radi, 13 Feb 2026). This gives examples, outside the binary rooted tree, of level-transitive groups with both positive Hausdorff dimension and positive fixed-point proportion.

6. Representative families, rigidity phenomena, and extensions

The current literature exhibits several recurrent templates for pfIMG behavior.

Family	Tree/action model	Main profinite feature
Quadratic polynomials	Binary rooted tree	Conjugacy class depends only on postcritical combinatorics (Pink, 2013)
Quadratic morphisms with infinite postcritical orbit	Binary rooted tree	Either full $\overline{\mathrm{IMG}(f)}$0 or conjugate to an explicit proper subgroup $\overline{\mathrm{IMG}(f)}$1 (Pink, 2013)
Unicritical polynomials $\overline{\mathrm{IMG}(f)}$2	Closed subgroup of $\overline{\mathrm{IMG}(f)}$3	Explicit recursive presentation and constant field classification (Adams et al., 17 Apr 2025)
Degree $\overline{\mathrm{IMG}(f)}$4 PCF polynomials under Assumption (Y)	Ternary rooted tree	Finitely invariably generated; regular branch over $\overline{\mathrm{IMG}(f)}$5 (Hlushchanka et al., 7 Jul 2025)

Rigidity by combinatorial data is particularly strong. For quadratic polynomials, the isomorphism class of the geometric pfIMG depends only on the combinatorial type of the post-critical orbit (Pink, 2013). For quadratic morphisms with infinite postcritical orbit, the conjugacy class of the geometric pfIMG depends only on the combinatorial type of the postcritical orbit in the non-full case as well (Pink, 2013). For cubic PCF polynomials under the stated hypothesis, the profinite geometric group is determined, up to conjugation in the ternary tree automorphism group, by the isomorphism class of the ramification portrait (Hlushchanka et al., 7 Jul 2025).

The discrete theory continues to inform the profinite one. Exponential growth of IMGs has been proved for several non-polynomial Thurston maps, including rational maps with Julia set equal to the whole sphere, rational maps with Sierpiński carpet Julia sets, obstructed Thurston maps, and a non-renormalizable degree-$\overline{\mathrm{IMG}(f)}$6 polynomial with dendrite Julia set (Hlushchanka et al., 2016). The constructions are combinatorial and use explicit wreath recursions, flowers, and invariant edges. The summary accompanying that work states that the regular branch property extends to the closure and that exponential growth persists to the closure when the discrete group is dense in its profinite completion (Hlushchanka et al., 2016). This suggests a broad continuity between discrete IMG constructions and their profinite counterparts.

Beyond algebraic maps of finite degree, iterated monodromy theory extends to transcendental dynamics. For post-singularly finite exponential maps, the IMG acts on a $\overline{\mathrm{IMG}(f)}$7-regular rooted tree, is amenable, not elementary subexponentially amenable, left-orderable, residually solvable but not residually finite, and has pfIMG given by its closure in the tree automorphism group; exact properties of that closure are not worked out in detail (Reinke, 2020). For post-singularly finite entire transcendental functions, the IMG can be described by bounded activity dendroid automata, and the paper concludes that the IMG is amenable if and only if the monodromy group is (Reinke, 2022). These developments indicate that pfIMG methods are no longer confined to postcritically finite rational dynamics, although the profinite structure is presently most explicit in the polynomial and arboreal Galois settings.