---
title: Deck Groups in Bicritical Dynamics
url: https://www.emergentmind.com/topics/deck
type: topic
---

# Deck Groups in Bicritical Dynamics

In complex dynamics, the deck group of a rational map \(f:\widehat{\mathbb C}\to\widehat{\mathbb C}\) is the group of Möbius transformations \(\mu\) satisfying \(f\circ\mu=f\). For a bicritical rational map—one with exactly two critical points—the paper "On the deck groups of iterates of bicritical rational maps" gives a complete description, up to isomorphism, of the groups that occur as \(\Deck(f^k)\) for iterates \(f^k\) [2210.03148]. The classification separates sharply by the parity of the degree and by whether the map is a power map, and it shows that the symmetries of iterates are highly constrained.

## 1. Definitions and basic setting

A bicritical rational map is a rational map \(f:\widehat{\mathbb C}\to\widehat{\mathbb C}\) with exactly two critical points, that is, \(|\mathcal{C}_f|=2\) [2210.03148]. A bicritical map is a power map if its set of critical points coincides with its set of critical values, \(\mathcal{C}_f=\mathcal{V}_f\). Such maps are conjugate to \(z\mapsto z^{\pm d}\) for \(d\geq 2\) [2210.03148].

For any rational map \(f\), the deck group is
\[
\Deck(f):=\{\mu\in M\mid f\circ \mu=f\},
\]
where \(M\) is the group of Möbius transformations [2210.03148]. The object of study is not only \(\Deck(f)\) itself, but the full sequence of deck groups of iterates,
\[
\Deck(f^k),\qquad k\geq 1.
\]

The central problem is to determine which abstract groups arise as \(\Deck(f^k)\) when \(f\) ranges over bicritical rational maps and \(k\) is arbitrary. The paper resolves this completely [2210.03148].

## 2. Classification by degree parity

The classification depends first on whether the degree \(d\) of \(f\) is odd or even [2210.03148].

For odd degree, the situation is rigid. If \(f\) is a bicritical map of odd degree \(d\), then \(\Deck(f^k)\cong \mathbb{Z}_d\) for all \(k\in\mathbb{N}\) if and only if \(f\) is not a power map. Moreover, \(f\) is a power map if and only if there exists \(k\) such that \(\Deck(f^k)\cong \mathbb{Z}_n\) for some \(n>d\) [2210.03148]. Thus, in odd degree, non-power maps exhibit no growth in deck-group type under iteration, whereas power maps are exactly those for which larger cyclic groups appear.

For even degree, the range of possibilities expands, but only modestly. If \(f\) is a bicritical map of even degree \(d\), then for each \(k\), \(\Deck(f^k)\) is isomorphic to either \(D_{2d}\), \(D_{4d}\), or \(\mathbb{Z}_{d^n}\) for some \(n\geq 1\) [2210.03148]. If \(f\) is not a power map, then \(|\Deck(f^k)|\leq 4d\) for all \(k\) [2210.03148]. This bound is sharp: for even degrees, both \(D_{2d}\) and \(D_{4d}\) are realized as deck groups of some iterate of some bicritical map [2210.03148].

The resulting classification can be summarized as follows.

| Degree of \(f\) | If \(f\) is a power map | If \(f\) is not a power map |
|---|---|---|
| Odd (\(d\)) | \(\mathbb{Z}_{d^k}\) | \(\mathbb{Z}_d\) for all \(k\) |
| Even (\(d\)) | \(\mathbb{Z}_{d^k}\) | \(\mathbb{Z}_d\), \(D_{2d}\), or \(D_{4d}\) |
| \(d=2\) | \(\mathbb{Z}_{2^n}\) | \(\mathbb{Z}_2, V_4, D_8\) |

This suggests that iteration creates new symmetries only in tightly controlled circumstances, with the power-map case providing the only unbounded cyclic growth [2210.03148].

## 3. The quadratic and low-order cases

The quadratic case \(d=2\) is singled out explicitly in the classification [2210.03148]. Here the possible deck groups are
\[
\Deck(f^k)\cong \mathbb{Z}_{2^n}\ (n\geq 1),\qquad V_4,\quad\text{or}\quad D_8.
\]
If \(f\) is not a power map, then \(|\Deck(f^k)|\leq 8\) for all \(k\) [2210.03148].

This case illustrates the even-degree pattern in its smallest instance. The cyclic possibilities \(\mathbb{Z}_{2^n}\) correspond to the power-map behavior, while the non-power possibilities are uniformly bounded and reduce to the Klein four-group \(V_4\) or the dihedral group \(D_8\) [2210.03148]. A plausible implication is that quadratic bicritical dynamics already displays the full structural dichotomy of the general theory: power maps allow iterative growth, whereas non-power maps allow only bounded symmetry enlargement.

## 4. Structural constraints on deck groups

A key structural theorem is the fixed-critical-point property: for a bicritical rational map \(f\) and any \(\phi\in\Deck(f^k)\) for any \(k\),
\[
\phi(\mathcal{C}_f)=\mathcal{C}_f.
\]
Thus every deck transformation of every iterate permutes the critical points of the original map [2210.03148]. This is the basic mechanism restricting the allowable symmetry groups.

The group-theoretic reduction uses the classification of finite subgroups of Möbius transformations: they are cyclic, dihedral, or polyhedral (\(A_4\), \(S_4\), \(A_5\)). For bicritical maps and their iterates, however, only cyclic and dihedral groups arise [2210.03148]. In odd degree, dihedral and polyhedral groups cannot occur, because these would require existence of involutions, which would force the degree to be even [2210.03148].

Another constraint comes from the geometry of the critical and critical-value sets. The set of Möbius transformations simultaneously preserving the 2-point sets of critical values and critical points is very limited, with at most four such transformations possible, namely the Klein four-group \(V_4\), and most often only the identity if \(|\mathcal{C}_f\cup\mathcal{V}_f|=3\) [2210.03148]. This sharply limits the amount of symmetry that can persist across iterates.

## 5. Iteration, stabilization, and growth of \(\Deck(f^k)\)

The sequence \(k\mapsto \Deck(f^k)\) does not grow arbitrarily. The paper shows that the deck group of an iterate strictly contains that of the previous iterate only under very restrictive circumstances tied to the action on critical values [2210.03148]. In particular, if \(\Deck(f^k)\) ever stabilizes in the sense that
\[
\Deck(f^k)=\Deck(f^{k+1}),
\]
then it remains constant for all further iterates [2210.03148].

For non-power bicritical maps, this stabilization phenomenon combines with the parity-based classification to give especially strong rigidity. In odd degree, the deck groups remain \(\mathbb{Z}_d\) for all \(k\); in even degree, they remain within the bounded list \(\mathbb{Z}_d\), \(D_{2d}\), or \(D_{4d}\), with order at most \(4d\) [2210.03148].

By contrast, for power maps the explicit model \(f(z)=z^d\) satisfies
\[
\Deck(f^k)\cong \mathbb{Z}_{d^k}
\]
for all \(k\) [2210.03148]. This is the canonical example of iterative growth. The classification therefore separates bicritical maps into two dynamical symmetry regimes: bounded symmetry for non-power maps, and exponentially growing cyclic symmetry for power maps.

## 6. Examples, methods, and consequences

The paper gives explicit examples realizing the extremal even-degree possibilities. For
\[
f(z)=\frac{z^d-a}{z^d+a},\qquad a\neq 0,
\]
one has
\[
\Deck(f^2)\cong D_{2d},
\]
and for
\[
g(z)=\frac{z^d-1}{z^d+1},
\]
one has
\[
\Deck(g^3)\cong D_{4d}
\]
[2210.03148]. These constructions show that the upper bounds in the even-degree classification are not merely formal.

The proofs combine dynamical and group-theoretic methods. Dynamically, the action of Möbius transformations on critical points, critical values, and iterate structure controls the possible symmetries. Group-theoretically, the argument uses properties of finite subgroups of \(\operatorname{PSL}_2(\mathbb{C})\). Commutative diagrams are used heavily to analyze when deck groups can grow in size with increasing \(k\) [2210.03148].

The broader consequence is a precise classification of automorphism types possible in the iterated dynamics of bicritical maps [2210.03148]. The only possible symmetries of iterates are cyclic or, when the degree is even, small dihedral extensions; in the generic non-power-map case, the deck group does not grow with iteration and symmetries are highly constrained [2210.03148]. This suggests a strong rigidity principle for bicritical dynamics on the Riemann sphere: the presence of additional iterative symmetry is exceptional and is essentially characterized by the power-map condition.

Source: https://www.emergentmind.com/topics/deck