Levy and Thurston obstructions of finite subdivision rules
Abstract.
For a post-critically finite branched covering of the sphere that is a subdivision map of a finite subdivision rule, we define non-expanding spines which determine the existence of a Levy cycle in a non-exhaustive semi-decidable algorithm. Especially when a finite subdivision rule has polynomial growth of edge subdivisions, the algorithm terminates very quickly, and the existence of a Levy cycle is equivalent to the existence of a Thurston obstruction. In order to show the equivalence between Levy and Thurston obstructions, we generalize the arcs intersecting obstruction theorem by Pilgrim and Tan to a graph intersecting obstruction theorem. As a corollary, we prove that for a pair of post-critically finite polynomials, if at least one polynomial has core entropy zero, then their mating has a Levy cycle if and only if the mating has a Thurston obstruction.
1. Introduction
Obstructions for topological objects to have geometric structures are important subjects of study in topology and geometry. For example, the Geometrization Theorem is about topological obstructions for a 3-manifold to have one out of eight geometries. W. Thurston, who conjectured and proved a large part of the Geometrization Theorem, also proved a geometrization theorem, named Thurston’s characterization, in complex dynamics. He found obstructions, called Thurston obstructions, for a post-critically finite branched covering of the -sphere to be isotopic to a rational map [DH93]. Levy cycles were introduced at first as simple cases of Thurston obstructions in the study of the mating problem [Lev85, Tan92]. Recently, it turned out that a Levy cycle itself is an obstruction for a post-critically finite branched covering to be isotopic to an expanding dynamical system [BD18]. Therefore it is important to determine the existence of a Levy cycle as well as a Thurston obstruction for post-critically finite branched coverings. In this paper, we investigate a new method to detect the existence of a Levy cycle for a broad family of branched coverings, called subdivision maps of finite subdivision rules.
Obstructions of post-critically finite topological branched self-coverings of the sphere. A continuous map is a topological branched covering if it locally looks like for some integer . A point is a critical point if is not locally injective at . The collection of the critical points is the critical set of and its forward orbit is the post-critical set. If is finite, is a post-critically finite branched covering, or simply a Thurston map. A marked post-critically finite branched covering, is a map such that , , and . Every element is called a marked point and is called the set of marked points of . Since contains the information of being post-critically finite and the set of marked points, we often abbreviate it just as a branched covering and write more words when they are necessary.
Two branched coverings and are combinatorially equivalent ( by and ) if there exist homeomorphisms such that (1) , (2) is homotopic relative to to , and (3) the following diagram commutes.
A post-critically finite topological branched covering which is not doubly covered by a torus endomorphism is combinatorially equivalent to a post-critically finite rational map if and only if it does not have a Thurston obstruction [DH93], see Section 7.1.
Definition 1.1 (Levy cycle).
A Levy cycle, or a Levy obstruction, of a post-critically finite branched covering is a collection of simple closed curves that are essential relative to with the following property: For each there is a connected component of which is isotopic to relative to , and is a homeomorphism.
Since a Levy cycle is a homeomorphically periodic cycle, a branched covering cannot be expanding along a Levy cycle. Schwartz lemma implies that every post-critically finite rational map is expanding with respect to the conformal metric on , except for a few cases. Therefore, Levy cycle is an example of Thurston obstruction. Shishikura and Tan found an example of mating of cubic polynomials that has a Thurston obstruction but does not have a Levy cycle [ST00]. Although Shishikura and Tan’s example is not conjugate to a rational map, it has an expanding metric, and many objects in the study of rational maps, such as Julia sets, are still well defined. These branched coverings are called Böttcher expanding maps, see [BD18] for Böttcher expanding maps. Rational maps are Böttcher expanding maps by Schwartz lemma. Recently, it was shown that a post-critically finite topological branched covering which is not doubly covered by a torus endomorphism is combinatorially equivalent to a Böttcher expanding map if and only if it does not have a Levy cycle [BD18]. Therefore, Thurston and Levy obstructions can be viewed as obstructions for conformal structures and expanding dynamics on branched coverings of the sphere, respectively.
Analogy with surface diffeomorphisms. There are analogues between surface diffeomorphisms and branched coverings of the sphere. Pseudo-Anosov maps are geometric in a sense that they are affine maps expanding along one dimension and contracting along the other one dimension with respect to appropriate conned Euclidean structures; rational maps are conformal geometric and Böttcher expanding maps are metric geometrically defined. In a pseudo-Anosov mapping class, there is a unique pseudo-Anosov map up to conjugation; in an isotopy class of post-critically finite topological branched coverings, a rational map or a Böttcher expanding map is unique up to conjugation if exists [DH93, BD18]. For non-periodic mapping classes, reducing multicurves are obstructions to pseudo-Anosov mapping classes; Thurston obstructions and Levy cycles are also multicurves, which are obstructions to being isotopic to rational maps and Böttcher expanding maps respectively.
In spite of this analogy, however, algorithms to determine the existence of obstructions for branched coverings of the sphere are relatively less studied compared with surface diffeomorphisms. Let us review some results on algorithms about branched coverings of the sphere. Exhaustive searches for Levy cycles or Thurston obstructions are decidable [BBY12], [BD18]. For topological polynomials, a non-exhaustive algorithm, that finds either Levy cycles if exist or Hubbard trees otherwise, was developed in [BLMW19]. D. Thurston’s positive characterization also gives a non-exhaustive algorithm to detect both Levy cycles and Thurston obstructions for hyperbolic post-critically finite branched coverings [Thu20]. Although these algorithms work efficiently for many examples in practice, no theoretical upper bound of the complexity is known for any of these algorithms. An upper bound for the computational complexity was studied for nearly Euclidean Thurston maps in [FPP18a]. Poirier proved that an abstract Hubbard tree is a Hubbard tree of a polynomial if and only if is expanding [Poi10]. This gives an efficient algorithm to check whether a Thurston obstruction (equivalently a Levy cycle in this case) exists, and one can easily find an upper bound for the complexity of this algorithm, though it is not stated in [Poi10]. In this paper, Theorem 6.21 provides a new non-exhaustive algorithm to detect Levy cycles when post-critically finite branched coverings are given as subdivision maps of finite subdivision rules. When edges have polynomial growth of subdivisions, Theorem 8.6 implies that this algorithm terminates very quickly, and the complexity is polynomial about the number of cells. But we do not compute the complexity in this paper.






Finite subdivision rules. A finite subdivision rule consists of a partition of into polygons and its subdivision such that a subdivision map is homeomorpic on each open cell, see Figure 1 for an example and Section 4 for a precise definition. One can also see a finite subdivision rule as a sort of Markov partition. Because , the subdivision map is a post-critically finite topological branched covering. By iterating subdivisions, we have a further subdivision and an iterated map for each . It is an open question to determine which topological post-critically finite branched coverings are isotopic to subdivision maps of finite subdivision rules. See Section 4.1 for a list of topological branched coverings that can be represented as subdivision maps.
To detect a Levy cycle, for each we define a level- non-expanding spine which is a graph with a train-track structure encoding non-expanding parts of , see Section 6. A finite set is called a set of marked points of if . A point is called a Fatou point if its forward orbit contains a periodic critical point. Otherwise, is called a Julia point. We say that the level- non-expanding spine is essential relative to if it contains (more precisely carries as a train-track) a closed curve that is homotopic relative to neither to a point nor to some iterate of a peripheral loop of a Julia point in .
Theorem 6.21.
Let be a finite subdivision rule and be its subdivision map which is not doubly covered by a torus endomorphism. Let be a set of marked points, i.e., . Then the post-critically finite branched covering has a Levy cycle if and only if the level- non-expanding spine is essential relative to for every .
We first prove the equivalence between the existence of a Levy cycle and the existence of a sequence curves with certain properties in Section 5 using the theory of self-similar groups. Then we show in Section 6 the equivalence between the existence of such a sequence of curves and the level- non-expanding spine being essential at every level .
Algorithmic implication. Theorem 6.21 improves [BD18, Algorithm 5.5] by replacing the exhaustive semi-decidable search for nuclei of orbisphere bisets by checking if the non-expanding spines are essential, which terminates in finite time if there is no Levy cycle. There is an example showing that an arbitrarily higher level of non-expanding spine is required to be checked, see Proposition 9.9 in Section 9.3.
Question 1.2.
Is there an upper bound function such that has a Levy cycle if and only if is essential relative to for every where is the number of tiles in ?
Finite subdivision rules with polynomial growth of subdivisions. We will see that the growth of the subdivision of an edge is either exponential or polynomial in Theorem 3.6 and Proposition 8.2. If every edge has polynomial growth of subdivisions, then the level- non-expanding spines are independent of . Hence the existence of a Levy cycle is decidable very quickly.
Theorem 8.6.
Let be a finite subdivision rule with polynomial growth of edge subdivisions and be its subdivision map which is not doubly covered by a torus endomorphism. Let be a set of marked point, i.e., . Then the followings are equivalent.
-
(1)
The branched covering does not have a Levy cycle.
-
(2)
The level- non-expanding spine is essential relative to .
-
(3)
The branched covering is combinatorially equivalent to a unique rational map up to conjugation by Möbius transformations.
Equivalence between Levy cycles and Thurston obstructions. Another important implication of Theorem 8.6 is the equivalence between the existence of a Levy cycle and the existence of a Thurston obstruction. As explained earlier, there are topological branched coverings which do not have a Levy cycle but have a Thurston obstruction [ST00]. For some families of post-critically finite topological branched coverings, e.g., post-critically finite topological polynomials or branched coverings of degree , the existence of a Thurston obstruction implies the existence of a Levy cycle, by Levy, Rees, Tan, and Berstein [Tan92, Hub16]. We add two new families to this list: subdivision maps with polynomial growth of edge subdivisions (Theorem 8.6) and matings of polynomials one of which has core entropy zero (Corollary 7.10).
Corollary 7.10.
Let and be post-critically finite hyperbolic (resp. possibly non-hyperbolic) polynomials such that at least one of and has core entropy zero. Then and are mateable if and only if the formal mating (resp. degenerate mating) does not have a Levy cycle.
The equivalence between the existence of a Levy cycle and of a Thurston obstruction follows from the graph intersecting obstruction theorem, which is a generalization of the arcs intersecting obstruction theorem by Pilgrim and Tan [PT98]. Here, indicates the topological entropy.
Theorem 7.6 (Graph intersecting obstruction).
Let be a post-critically finite branched covering and be a forward invariant graph such that . Then every irreducible Thurston obstruction intersecting is a Levy cycle.
Examples: Critically fixed anti-holomorphic maps. In Section 9, we define an orientation reversing finite subdivision rule with no edge subdivision from every -vertex-connected planar graph . Then and are post-critically finite topological branched coverings, where is an orientation-reversing automorphism of . Then we show in Theorem 9.4 that these maps do not have Levy cycles (or equivalently, Thurston obstructions) if and only if is -edge-connected. While this article was being written, two papers [LLMM19] and [Gey20] were published where it is shown that every critically fixed anti-holomorphic map is constructed in this way and a theorem almost same as Theorem 9.4 is proved.
Notation for integer intervals. We introduce a non-standard but intuitive notation for integer intervals to distinguish them from real intervals. For ,
The interval without the subscript Z indicates the real interval .
Acknowledgements.
The author thanks Dylan Thurston and Kevin Pilgrim for helpful comments and discussions. Without their support and suggestions, this work would not have existed. The author also thanks Dzmitry Dudko for critical comments on the previous version of this article. The author thanks the reviewer for helpful comments and suggestions, which inspired the author to write Section 9.4. The author also thanks the developers of Xaos and Mathematica, which were used to draw Julia sets in the present article.
2. Monotonicity of lengths under subdivisions
In this section, we see combinatorial properties of CW-complex without dynamics. We follow some terminology defined in [FPP18b]. Let be a finite CW-complex structure on . A -gon, or a polygon if is not specified, is a -dimensional CW-complex structure on the closed -disc whose -skeleton consists of edges on . For every closed -cell of , there is a polygon and a characteristic map such that is cell-wise homeomorphic and .
Definition 2.1 (Bands and bones).
A band of is a triple , where is a closed -cell and and are edges on the boundary of . We allow only when two boundary edges of a polygon is are identified to by the characteristic map . We say that and are the sides of the band. The bone of is the homotopy class (or ambiguously a representative of the class) of curves which are properly embedded into with endpoints on the interiors of and .
Let denote the -skeleton of . Any curve transverse to is subdivided by into consecutive subcurves such that each is a maximal subcurve embedded in a closed -cell. The set is the -decomposition of and each curve is a -segment of .
If is not closed, then are called inner -segments. The terminal -segment or is an outer -segment if one of its endpoint is in the interior of a closed 2-cell; if both endpoints are on the 1-skeleton, then we still call them inner -segments. If is closed, all segments are called inner segments. A curve is -taut if every inner -segment is the bone of a band, i.e., it cannot be pushed away from the -cell it is contained by an isotopy relative to .
Definition 2.2.
Two curves in are combinatorially equivalent relative to , or simply -combinatorially equivalent, if they are isotopic by a cellular isotopy of , i.e., a isotopy from the identity map whose restriction to each cell is also an isotopy on .
Define the -length of , denoted by , to be the number of inner -segments. The -length of a curve is an invariant of a combinatorial equivalence class. The following criterion is straightforward from the bigon criterion [FM12].
Proposition 2.3.
Let be a finite CW-complex structure on . Let be a curve in transverse to . Then is minimized in its homotopy class within , relative to endpoints if is not closed, if and only if is taut. Moreover, in the homotopy class, the taut curve is unique up to -combinatorial equivalence.
The following lemma is immediate.
Lemma 2.4.
Let be a finite CW-complex structure on . For every , there are only finitely many, possibly closed or non-closed, curves in with up to combinatorial equivalence relative to .
Definition 2.5 (Subbands).
Assume is a finite CW-complex structure on and is its subdivision. A band of is a subband of of if and for .
Proposition 2.6 (Monotonicity of lengths under refinements of CW-complexes).
Let and be finite CW-complex structures of the -sphere such that is a subdivision of . Let be a -taut curve and be a -taut curve such that and are -combinatorially equivalent. Then
Let be the inner -segments of and be the inner -segments of . Then the equality holds if and only if, under a proper reordering of indices, is a bone of and is a bone of such that is a subband of for any
Proof.
Take unions of consecutive ’s to get such that each is a -segment of . If endpoints of are on the same edge of as below, then remove it by an isotopy pushing away from the -cell that it was contained so as to make be properly embedded into the -cell where the subcurves and were properly embedded as shown below.
Repeating this reduction, we obtain a -taut curve homotopic to . Let be its subcurves with respect to and be properly embedded into a band . Since taut curves are unique in the homotopy class up to combinatorial equivalence, after reordering indices, we have and . Then . The equality condition immediately follows from the constructions of and . ∎
3. Directed graphs and topological entropy of graph maps
A directed graph will be used throughout this article to understand the dynamics of branched coverings. In this section, we review basic notions of directed graphs and prove properties that we need in subsequent sections.
Let be a finite directed graph. A path is a sequence of edges such that the terminal vertex of is equal to the initial vertex of for every . The length of path is the number of edges in the sequence. The initial vertex of is the initial vertex of the path and the terminal vertex of is the terminal vertex of the path. If the initial and terminal vertices of a path are and , then we call a path from to . Let and be paths of length and with . If the first subsequence of edges of is equal to the sequence of edges of , we say that is an extension of and is the first -restriction of .
A cycle is a path whose initial and terminal vertices coincide. A vertex is periodic if it is contained in a cycle and preperiodic if it is not periodic but there is a path from the vertex to a periodic vertex. For a subset , the subgraph generated by is the subgraph of consisting of and edges connecting vertices in .
Definition 3.1 (Recurrent paths).
For a periodic vertex , a path from is recurrent if there exists a path from the terminal vertex of to , i.e., and are contained in one cycle. We also consider a periodic vertex as a recurrent path of length .
Definition 3.2 (Ideals).
Let be a directed graph. A subset is an ideal if the following condition hold: For every , if there is a path from to for some , then .
For , the ideal generated by , denoted by , is the collection of vertices where there is a path from to .
Example 3.3.
Assume we have a directed graph as below.
Vertices and are neither periodic or preperiodic; and are periodic; is preperiodic. Starting from , the paths and are recurrent, but the paths and are not recurrent. There are only ideals: and .
3.1. Adjacency matrices
Let be a finite directed graph and . The adjacency matrix of is defined by
where the is the entry of -row and -column of . The adjacency matrix depends on the choice of indices of ’s, and matrices defined by different choices of indices differ by conjugations by permutation matrices. In particular, if the index satisfies only when there exists a path from to , then the adjacency matrix is an upper triangular block matrix.
(UTB-form) |
where is irreducible or a matrix. A non-negative square matrix is irreducible if for every , there exists such that . An irreducible non-negative matrix has a simple eigenvalue, called the Perron-Frobenius eigenvalue, which is a positive real number and equal to the spectral radius of . The spectral radius of is equal to the maximum of Perron-Frobenius eigenvalues of the irreducible . See [BP94, Chapter 2].
Asymptotic growth of entries of .. Let be a non-negative irreducible matrix and denote by and the right and the left eigenvectors of which are normalized by . By the Perron-Frobenius theorem, for the Perron-Frobenius eigenvalue of , we have
Hence the -entry of is asymptotic to . This implies the following proposition. The proof is left to the reader.
Proposition 3.4.
Let be an non-negative upper triangular block matrix such that are blocks on the diagonal like (UTB-form). Let be an matrix so that . For , let such that contains the -entry of . Let (resp. ) be the -row (resp. column) sum of , i.e., the sum of the entries in the -row (resp. column) of . Then
where is the spectral radius of .
3.2. The growth rate of the number of paths
Polynomial and exponential growth rate. Suppose we have a sequence . We consider sequences which are uniformly bounded or diverge to the infinity when tends to the infinity. We say that the sequence has exponential growth, or grows exponentially fast, if there exists such that for any sufficiently large we have
and the sequence has polynomial growth of degree , or grows polynomially fast with degree , for a non-negative integer if there exists such that for any sufficiently large we have
Lemma 3.5.
Suppose is a non-decreasing sequence. If there exist such that (resp. ) for every , then there exists such that (resp. ) for any sufficiently large .
Proof.
Since the sequence is non-decreasing, we have for any . Then, for any sufficiently large , we have
where means the largest integer less than or equal to . The same argument also works for the inverse direction. ∎
Let be a directed graph. Two paths in are different if their sequences of edges are different. Let be the number of different paths of length exactly starting from . The following criterion on the growth rate of is well-known. See [Sid00, Ufn82]. We restate the criterion with a slight improvement for the case of polynomial growth.
Theorem 3.6.
Let be a directed graph and .
-
(1)
If there exist two different cycles passing through , then has exponential growth.
-
(2)
If there exists such that there are two different cycles starting from and a path from to , then has exponential growth.
-
(3)
If does not satisfy or , then has polynomial growth. Moreover, if the maximum number of (disjoint) cycles that a path from can intersect is , then the degree of the polynomial growth of is . When the maximum number of cycles is zero, then for every sufficiently large and we define the degree of polynomial growth to be .
Proof.
The number of paths of length is counted in [Ufn82] and we slightly modify it. If two cycles of lengths and pass through , then there are at least paths of length starting from . Let be the maximal number of outgoing edges from one vertex in . Then the number of paths with length is less than . This proves and is immediate from .
Assume that does not satisfy or . Let be the ideal generated by . There exist totally ordered finite subsets such that for each and . More precisely, we think of a directed graph obtained by collapsing each cycle in to a vertex. Since does not satisfy (1) or (2), the graph does not have any cycle. Let be the vertex of corresponding to . Then is the only minimal element of . Let be the maximal elements of . Choose any .
Then the subgraph generated by is isomorphic to the graph in Figure 4. Since every path from is supported in some , it suffices to show when is the graph of the type shown in Figure 4.
Assume is a graph of the type in Figure 4. Let it have cycles of lengths . Let and be the maximum and minimum of and and be the number of vertices and edges of respectively. Let be the set of -tuples of non-negative integers satisfying . The set has elements.
Claim: For any , .
Proof of claim.
For any , we define an injective map from to the set of paths from of length as follow. For any , we have a path from which goes around the -th cycle -times for . The path has length not greater than . There is a unique extension of the path which (1) does not further go around the first d cycles, i.e., the additional rotations occur only in the last cycle, and (2) has length exactly equal to . We assign the extended path to the element . Hence we have .
Similarly, we define another map from the set of paths of length to by assigning the numbers of times that each path goes around the first cycles. Suppose that two such paths and have the same image in . Since and start from the same vertex and have the same length, there terminal vertex are the same if and only if and are the same. It follows that the number of preimage of the map is less than . ∎
As is a degree polynomial in , it follows from Lemma 3.5 that the has polynomial growth of degree .as a sequence in . ∎
The polynomial growth rate of implies the recurrent extension is unique.
Proposition 3.7 (Extension of recurrent paths).
Let be a directed graph and . Let be a path from of length . If is recurrent, then for any , has at least one extension to a recurrent path of length . Moreover, if grows polynomially fast as tends to , then the extension is unique.
Proof.
Since is recurrent, the initial and the terminal points of belong to one cycle of . Then we can extend by repeatedly travelling along . If grows polynomially fast, then is the only cycle that passes through . Hence travelling along is the only way to extend . ∎
3.3. Graph maps with zero topological entropy
Let be a finite graph and be its vertex set. A continuous map Markov if and is a homeomorphism or constant on each component of . Then the edges form a Markov partition of . Denote by the edges of . Note that every edge is mapped to a union of edges. The adjacency matrix of is defined in such a way that covers as many as the -entry of . Under a suitable choice of indexing ’s, we may assume that is an upper triangular block matrix. Let be the block matrices on the diagonal as in (UTB-form).
The spectral radius of is either equal to zero if every is zero or equal to the maximum of Perron-Frobenius eigenvalues of the irreducible ’s. The topological entropy of is equal to zero if or equal to if . The relationship between the topological entropy and the Perron-Frobenius eigenvalue follows from [MS80].
There is a directed graph such that and the directed edges are defined as follow: For , if covers exactly -times, then we draw directed edges of from to . Then is equal to the adjacency matrix of . We refer to as the directed graph of the Markov map .
The following lemma is elementary, but we prove it for the sake of self-containedness.
Lemma 3.8.
Let be an irreducible non-negative integer matrix and be its Perron-Frobenius eigenvalue. Then and the equality holds if and only if is a permutation matrix.
Proof.
Because the characteristic polynomial of is a monic polynomial with integer coefficients, the absolute value of the product of eigenvalues is a positive integer. Hence the spectral radius is at least one. If is a permutation matrix, then trivially . Assume . Let be a directed graph whose adjacency matrix is . Since is irreducible, for any pair of vertices of there exists a path from to and a path from to . If there exists a vertex through which both paths and pass, there are two different cycles passing through . By Theorem 3.6, the number of length- paths grows exponentially fast. Since is the sum of entries in the row of corresponding to the vertex , it follows that . So and form a cycle which passes through vertices exactly once. If there is a vertex that is not contained in this cycle, then there is a path from to and a path from to . Then two different cycles pass through so grows exponentially fast and . Hence is a cycle passing through every vertex exactly once, and is a permutation matrix. ∎
Proposition 3.9.
Let be a Markov map. Then the followings are equivalent.
-
(1)
The topological entropy is zero.
-
(2)
Every irreducible block of the upper-triangular block form of the adjacency matrix is a permutation matrix.
-
(3)
The directed graph of the adjacency matrix has disjoint cycles, i.e., every pair of different cycles have disjoint vertices.
-
(4)
There exists a positive integer such that for all .
4. Finite subdivision rules
A finite subdivision rule consists of the following:
-
(1)
a subdivision complex which is a -dimensional finite CW-complex such that the underlying space is the union of its closed -cells, i.e., every or -cell is on the boundary of a -cell,
-
(2)
a subdivision of , that is a CW-complex for which every open cell is contained in an open cell of , and
-
(3)
a subdivision map which is continuous and cell-wise homeomorphic, i.e., its restriction to each open cell is a homeomorphism onto an open cell.
We say that is orientation-preserving if every -cell can be oriented in such a way that preserves the orientation. Similarly, is orientation-reversing if reverses the orientation on every cell. For any closed -cell of , there exist a -gon and the characteristic map is cell-wise homeomorphic. The CW-complex is called the tile type of the closed -cell . Similarly, for a characteristic map of a -cell , is the edge type of a closed -cell .
A -dimensional CW-complex is an -complex if it is the union of its closed -cells and there is a continuous cell-wise homeomorphism . By pulling back the subdivision of through for each , we also have a subdivision of and a cell-wise homeomorphism . For example, itself and any tile type are -complexes, so for any their level- subdivisions and are defined. For any edge type , its level- subdivision is also similarly defined.
We call a closed -cell (resp. a closed -cell, a -cell) a tile (resp. an edge, a vertex) of a -dimensional complex. Every level- tile or edge of an -complex is also a -complex. See [CFP01] for more details on finite subdivision rules.
Notation.. As we wrote in the previous paragraph, we use bold fonts for the domains of characteristic maps and normal fonts for the corresponding closed cells in the CW-complexes. For example, for a closed -cell in a CW-complex , we write for the characteristic map. Thus is always homeomorphic to the closed -disk, but may not.
Remark 4.1.
Subdivision maps as post-critically finite branched coverings. Throughout this article, we assume is homeomorphic to the -sphere . Considering and as different complexes on the same underlying -sphere, we may think of the subdivision map as a topological branched self covering of . Since the set of critical points is a subset of the set of vertices of , is post-critically finite.
A set of marked points of is a subsets of with . With a choice of a set of marked points , the subdivision map can be considered as a marked post-critically finite branched covering .
4.1. Branched coverings represented as subdivision maps
If is a subdivision map, then the -skeleton is a graph such that (1) it contains , (2) it is connected, and (3) it is forward invariant under . Conversely, if there is a graph satisfying the three conditions, then it defines a finite subdivision rule. Below is a list of some forward invariant graphs that are known to exist.
-
•
Spiders of polynomials [HS94].
-
•
Hubbard trees can be augmented to be invariant trees [ST19].
- •
- •
- •
-
•
Extended Newton graphs for post-critically finite Newton maps [LMS15].
-
•
A sufficiently large iterate of any post-critically finite branched covering without a Levy cycle is homotopic to a subdivision map [FPP20]. Its 1-skeleton is invariant up to homotopy.
There are post-critically finite branched coverings whose any iterates cannot be represented as subdivision maps [FPP20, Section 4].
4.2. Combinatorial properties of and Levy and Thurston obstructions
A finite subdivision rule is edge-separating if for every tile type and pair of disjoint closed edges and of , there exists a positive integer such that no subtile of in contains both a subedge of and a subedge of . Similarly, is vertex-separating if for every tile type and pair of vertices and of , there exists a positive integer such that no subtile of in contains both and . These two separating conditions are a part of sufficient condition for a subdivision map not having a Levy cycle or a Thurston obstruction.
- •
-
•
If is vertex-separating, edge-separating and conformal (we do not define this conformality in the article), then does not have a Thurston obstruction [CFKP03]. There is an example [CFKP03, Example 4.6] of finite subdivision rule which is not conformal but does not have a Thurston obstruction, thus it is combinatorially equivalent to a rational map. See [CFKP03] for a definition of conformal finite subdivision rules.
Example 4.2.
The finite subdivision rule given in Figure 5 is Example 5.3 of [FPP18b]. Its CW-complex of the -sphere consists of two square tiles. The edges of white and shaded tiles are glued to form a pillowcase. Since the shaded tile does not subdivide, is neither edge-separating or vertex-separating. However, it easily follows from Theorem 6.21 that the subdivision map does not have a Levy cycle.
4.3. Edges, bands, bones, and curves of subdivision complexes
For , a level- tile, edge, or band of is a tile, edge or band of . See Definition 2.1 for definitions of bands and their bones. There is a bijection between level- tiles (resp. edge) and tile types (resp. edge types); a level- tile is the image of the tile type under the characteristic map .
We will use superscripts to indicate the level of tiles, edges, etc. Since frequently considering level- objects, we sometimes omit the superscript 0 for simplicity.
For , a level- tile is a subtile of a level- tile if . Let be a tile type and be the corresponding level- tile. A level- tile is of type if . Subedges and their types are similarly defined. A band type is a level- band. For a band type , a level- band is of type if the -image of its bone is the bone of (or, equivalently, if is of type and is of type for . For , a level- band is a subband of a level- band if and for . If , there are level- tiles, edges, and bands of the same type.
Definition 4.3 (Abbreviations for level- bands and bones).
There are many level- bands that are not subbands of level- bands. However the only level- bands that we consider are level- subbands of level- bands. Since these objects will be very frequently used, for the sake of simple notation, by a level- band we mean a level- subband of a level- band. Similarly, by a level- bone we mean the bone of a level- subband of a level- band.
Definition 4.4 (Non-expanded level- curves).
Let be a finite subdivision rule. Let be a closed interval , , , or for . For , a curve is a non-expanded level- curve, if is a level- bone for every with . A non-expanded level- curve is recurrent if it consists of level- bones that are recurrent. The recurrent bands and bones are defined in Definition 4.8.
4.4. Two directed graphs defined from finite subdivision rules
4.4.1. Directed graphs of edge subdivisions
Let be a directed graph such that is the same as the set of level- edges. To avoid confusion, we denote by the vertex of corresponding to an edge . A directed edge from to corresponds to a level- subedge of of type . We call the directed graph of edge subdivision of . The next proposition is straightforward from the definitions.
Proposition 4.5.
There is an 1-1 correspondence between the paths in of length starting from and the level- subedges of . Thus, the number of level- subedges is equal to , the number of paths of length starting from .
Definition 4.6 (Periodic and recurrent edges).
Let be a finite subdivision rule and be the directed graph of edge subdivisions of . We define level- periodic edges and recurrent level- edges as follows.
-
•
A level- edge is periodically (resp. preperiodically) subdividing, or simply periodic (resp. preperiodic), if is periodic (resp. preperiodic). Equivalently, is periodic if and only if there exists a level- subedge of of type for some .
-
•
A level- edge is a recurrent subedge of if it corresponds, by Proposition 4.5, to a recurrent path in which starts from and has length , or equivalently if a further subdivision of contains a subedge of type . If is the type of a recurrent subedge of , then there is a cycle passing through both and . Only periodic level-0 edges have recurrent subedges.
-
•
We also refer to periodic level- edges as recurrent level- edges, which is sometimes useful for concise statements.
4.4.2. Directed graphs of bands
Let be a directed graph such that is the set of level- bands . To avoid confusion, we use bracket to denote vertices of . Every directed edge from to corresponds to a level- subband of of type . We call the directed graph of bands of . The following proposition is an analogue to Proposition 4.5.
Proposition 4.7.
There is an 1-1 correspondence between the paths in of length starting from and the level- subbands of .
Definition 4.8 (Periodic and recurrent bands and bones).
Let be a finite subdivision rule and be the directed graph of bands of . We define level- periodic bands and level- recurrent subbands as we did for edges.
-
•
A level- band is periodic (resp. preperiodic), if is periodic (resp. preperiodic). Equivalently, is periodic if and only if there exists a level- band of type which is a subband of for some .
-
•
A level- subband of is a recurrent subband of if it corresponds, by Proposition 4.7, to a recurrent path of length starting from , or, equivalently, if is a subband of and has a subband in its further subdivision which is also a subband of . If is the type of a recurrent subband of , then there is a cycle passing through both and . Only periodic level- bands have recurrent subbands.
-
•
We also refer to periodic level- bands as recurrent level- bands, which is sometimes useful for concise statements.
We say that a level- bone is recurrent if its corresponding level- band is recurrent.
A continuous map between two directed graphs is a graph homomorphism if it sends vertices to vertices and edges to edges preserving directions. From a finite subdivision rule , we have defined two directed graphs and . There are natural graph homomorphisms defined by and . The next lemma follows from the fact that and are homomorphisms.
Lemma 4.9.
If is a periodic level- band, then and are periodic edges. If is a level- recurrent subband of , then the sides and of are level- recurrent subedges of and .
4.5. Parents and children
We define parents and children for various objects regarding finite subdivision rules. The following are some important properties of the parent-child relationship. For any , stands for a level- object, which can be an edge, a band, or a curve consisting of the bones of bands.
-
(Transitivity) For , if is a child of and is a child of object , then is a child of . A similar statement holds for parents.
-
(Unique existence of parents) For every level- object has a unique level- parent . If is recurrent, then so is .
-
(Existence of recurrent children) For every level- recurrent has at least one level- child that is also recurrent. We note that it does not work for non-expanded curves consisting of more than one bones in general.
Edges. Suppose that a level- edge is a subedge of a level- edge where . Then we say that is a level- child of and is a level- parent of .
The transitivity is straightforward. If both and are subedges of a level- edge , then they correspond to directed paths in of length and , say and respectively, such that both and start from and is the first length- restriction of . Then the unique existence of parents follow. The existence of recurrent children follows from Proposition 3.7.
Bands and bones. Suppose that a level- band is a subband of a level- band for some . Then we say that is a child of and is a parent . The transitivity, the unique existence of parents, and the existence of recurrent children follow from a similar argument used in the case of edges.
We define parents and children for bones according to the parents-children relationship of their corresponding bands.
Non-expanded curves. Let be a closed interval with integer ends, such as , , , or for . For , let and be level- and level- non-expanded curves respectively. Recall that (resp. ) is a level- (resp. level-) bone for every with . If is a level- child of for every with , then we say that is a level- child of and is a level- parent of .
The transitivity and the unique existence of parents follow from a similar argument used before. However, the existence of recurrent children does not work for curves in general; The level- children of level- bones constituting may not be joined as they are at level-.
Definition 4.10 (Genealogical sequence of non-expanded curves).
Let be a finite subdivision rule. Let denote a closed interval , , , or for . A sequence of level- non-expanded curves is genealogical if is a child of for every .
5. Levy cycle and genealogical sequence of homotopically infinite curves
The purpose of this section is to prove the following theorem.
Theorem 5.1.
Let be a finite subdivision rule and be a set of marked points. Suppose that the subdivision map is not doubly covered by a torus endomorphism. Then has a Levy cycle if and only if there is a genealogical sequence of non-expanded recurrent bi-infinite curves such that each is homotopically infinite with respect to a hyperbolic orbisphere structure (hence with respect to any hyperbolic orbisphere structure because the definition of Levy cycles is independent of the choice of orbisphere structures).
The “ only if ” direction is not hard. We can use a Levy cycle to construct the desired genealogical sequence of non-expanded curves. The other direction, however, is non-trivial. Even if we have a genealogical sequence of non-expanded curves, it is difficult to explicitly find a Levy cycle. We prove the existence of a Levy cycle in a non-constructive way using an algebraic machinery, called self-similar groups [Nek05]. We use the term “orbisphere bisets” rather than self-similar groups in order to be consistent with our main reference [BD18].
5.1. Contracting orbisphere bisets
Let be a finite subset of the sphere . An orbisphere structure on is an order function . We say that is an orbisphere structure of a post-critically finite branched covering if it satisfies
-
(1)
for every where for , and
-
(2)
only if is a Fatou point.
In (1), is considered as a multiple of any integer or itself. It follows that for every in a periodic cycle containing a critical point. The triple is called an orbisphere.
The orbisphere group of an orbisphere is defined by
where is a peripheral loop of and if .
Remark 5.2.
When , the order of , , is usually defined as the least common multiple of . When contains periodic points which do not belong to , however, the least common multiples of their degrees equal to one so that it is not an orbisphere structure we care about. The reason that we require for every is that if then vanishes in so that algebraic properties of cannot carry any information of the .
The Euler characteristic of an orbisphere is defined by
(1) |
The orbisphere is hyperbolic if .
Let be a base point of . Define a set by
By the homotopy relative to we mean a homotopy relative to together with one more homotopy condition: For any with , the power of the peripheral loop of is considered to be homotopically trivial.
There is a natural -action on from both left and right. More precisely, for and for , the product is the concatenation of , , and the lift of through starting at the endpoint of , in order. The left action is free, and the right action is transitive. The set equipped with the left and right actions is called the orbisphere biset of . If an orbisphere structure is given, we implicitly assume that has the left and right -actions. When an orbisphere is understood in the context, we simply write for .
Caution 5.3.
There are two conventions depending on whether you concatenate curves from right to left or from left to right in the operation of orbisphere group. Many documents, including [Nek05], follow the “from right to left” convention, but we will follow the “from left to right” convention for the sake of convenience in citing [BD18]. Thus a biset has a free left action and a transitive right action, which is opposite to a bimodule in [Nek05].
A tensor square can be defined in two different ways. Topologically, the tensor product for is defined as a concatenation of and the lift of starting at the endpoint of . Algebraically, it is a quotient of by the relation . The left and right actions naturally extend to . Similarly, has a left free and a right transitive -actions for any .
A basis for is a collection of representatives of left orbits of the biset . Its cardinality is the same as the degree of . For any , the tensor power of is a basis for . Topologically, a basis is a choice of curves from the base point of to the preimages where . Let be a curve from to for . Then be a basis for , and every basis of is of this form. Fix . Let . We simply write
which gives a bijection .
Definition 5.4 (Contracting biset and nucleus).
Let be a marked post-critically finite branched covering and be an orbisphere structure. Let be a basis for . The orbisphere biset is contracting if there exists a finite subset satisfying the following: For every , the inclusion holds for every sufficiently large . The minimal satisfying this property is the nucleus of .
The contracting property does not depend on the choice of basis [Nek05, Corollary 2.11.7], but the nucleus does. See Remark 5.8 for the independence of the choice of orbisphere structures.
Definition 5.5 (Böttcher expanding map and Local rigidity).
Let be a post-critically finite branched covering and be an orbisphere structure. Denote by the subset of consisting of with . Then is Böttcher (metrically) expanding if there is a length metric on , satisfying the following conditions.
-
•
For every rectifiable curve , the length of any lift of through is strictly less the length of , and
-
•
(Local rigidity near critical cycles) For every periodic point , the first return map of near is locally topologically conjugate to , where is the period of .
Every Böttcher expanding map also has the Fatou set and the Julia set, which have similar properties of the Fatou and Julia sets of rational maps, see [BD18].
A post-critically finite rational map is Böttcher expanding since it has the Böttcher coordinates and enjoys the Schwarz lemma about the conformal metric. The next theorem, which follows from [BD18, Theorem A, Corollary 1.2], is an analogue of Thurston’s characterization and rigidity.
Theorem 5.6 ([BD18, Theorem A, Corollary 1.2]).
Let be a post-critically finite branched covering which is not doubly covered by a torus endomorphism and be an orbisphere structure. Then the following are equivalent
-
(1)
is combinatorially equivalent to a Böttcher expanding map.
-
(2)
The orbisphere biset is contracting.
-
(3)
has degree>1 and does not have a Levy-cycle.
Moreover, if exists, the Böttcher expanding map is unique in the combinatorial equivalent class up to topological conjugacy.
Remark 5.7.
In [BD18], the orbisphere structure used in Theorem A is required that if and only if is a periodic Fatou point, which is a little stronger than the definition of orbisphere structures in this paper. But this slight generalization follows almost immediately.
Remark 5.8.
The definition of depends on the orbisphere structure , but the definition of Levy cycles of doesn’t. Hence Theorem 5.6 implies that whether or not is contracting is also independent of the choice of orbisphere structure.
5.2. Semi-conjugacy to Böttcher expanding maps
The idea of semi-conjugacy was introduced by Rees [Ree92] and Shishikura [Shi00] to show that, for any mateable pair of post-critically finite polynomials, the topological mating is topologically conjugate to the corresponding rational map. Then the idea was further developed by Cui-Peng-Tan [CPT12] to a form that can be applied for not only matings but also general post-critically finite branched coverings and rational maps. We slightly further generalize the theorem of Cui-Peng-Tan by applying Bartholdi-Dudko’s recent work on Böttcher expanding maps [BD18].
The next theorem is a generalization of [CPT12, Theorem 1.1, Corollary 1.2] replacing rational maps by Böttcher expanding maps.
Theorem 5.9 (Semi-conjugacies to Böttcher expanding maps).
Let be a post-critically finite branched covering which is locally rigid near critical cycles. Suppose is combinatorially equivalent to a Böttcher expanding map . Let and denote the Fatou and the Julia sets of . Then there exists a semi-conjugacy from to , i.e., , such that the following properties are satisfied.
-
•
is a singleton for and a full continuum for .
-
•
For with , the set is a connected component of . Moreover, the degree of the map is equal to ; more precisely, for every we have
-
•
If is a continuum, then is a continuum.
-
•
for every .
-
•
for every , where .
Proof.
In [CPT12], the complex structure of the Riemann sphere was used for two purposes: (i) the conformal metric is expanding, and (ii) there are Böttcher coordinates near critical cycles. Since Böttcher expanding maps also have these two properties, the proof in [CPT12] still works for this setting. For example,
-
•
In [CPT12], they use post-critically finite branched coverings on the Riemann sphere that are holomorphic near critical cycles. Given a post-critically finite branched covering (on the topological sphere) which is locally rigid near critical cycles, we may define a holomorphic structure on the sphere so that the branched covering is holomorphic near critical cycles.
- •
∎
Definition 5.10 (Homotopic length).
Let be a metric space and be a curve joining to . Then the homotopic length is the infimum of the lengths of rectifiable curves that joins to and homotopic to relative to .
Lemma 5.11.
Let be a post-critically finite branched covering of degree which is not doubly covered by a torus endomorphism. Suppose is an orbisphere structure and be a basis for the biset . Suppose that does not have a Levy cycle such that there exists a semi-conjugacy where is a Böttcher expanding map, expanding about a metric , that is combinatorially equivalent to . Then there exists such that for every and . Here is considered as a curve joining the base point of to a point in the preimage , as described in Section 5.1.
Proof.
Since the metric blows up near marked points of infinite order, we should take a compact subset away the points of infinite order. Let where is the subset of consisting of elements having infinite order. There exists a small neighborhood of such that for and we have and being a branched covering which has a uniform expanding constant in the following sense: For every curve and any of its lifting through , we have
Let where each joins the base point of to one of the preimages . Define by
Let where . Then is the concatenation of , a lift of through , a lift of through , and so one. Every curve and its any lifting can be contained in up to homotopy. Hence we have
∎
5.3. Homotopically infinite non-expanded curves and Levy cycles
Definition 5.12 (Homotopically infinite curves).
Let be a hyperbolic orbisphere and is the orbifold universal covering map. A closed curve is homotopically infinite with respect to if for a connected component of , both ends of have a limit point on the boundary . A half-infinite curve (resp. bi-infinite curve ) is homotopically infinte with respect to if the end (resp. both ends) of its lift has a limit point.
The next proposition is immediate from standard properties of the hyperbolic geometry.
Proposition 5.13.
Let be a hyperbolic orbisphere. A closed curve is homotopically infinite if and only if is neither homotopically trivial in nor homotopic relative to to some iterate of the peripheral loop of with .
Each of the following two propositions is each direction of the equivalence in Theorem 5.1. We split them because the ideas of the proofs are quite different.
Proposition 5.14.
Let be a finite subdivision rule and be a set of marked points. Suppose that the subdivision map is not doubly covered by a torus endomorphism. If has a Levy cycle, then there is a genealogical sequence of non-expanded closed curves that are recurrent and homotopically infinite with respect to any hyperbolic orbisphere structure . Moreover, by iterating travelling along the closed curves, we may assume that each is a bi-infinite curve.
Proof.
Assume there exists a Levy cycle, i.e., there are an integer and an essential simple closed curve of such that a connected component of is isotopic to relative to and . We may assume is -taut so that is -taut.
Claim: We may assume that and are -combinatorially equivalent.
Proof of Claim.
It follows from the claim that we can parametrize and such that is a level- non-expanded closed curve and is the level-0 parent of for for some . Being essential relative to , and are, in particular, homotopically infinite relative to any hyperbolic orbisphere structure.
Let and . By lifting an isotopy between and through , we have an isotopy from to a level- non-expanded curve such that is the level- parent of . This way, we obtain a sequence of level- non-expanded curves such that (1) is the level- parent of for every and (2) is a homeomorphism. If we identify with via an isotopy preserving the 1-skeleton of , the map can be considered as a rotation of a circle of length by an integer. Hence, there exists such that for every the level- bone is mapped to by , which implies that is recurrent for every . For every that is not a multiple of , we define as the level- parent of for some with , which is well-defined up to -combinatorial equivalence.
Since each is homotopic to an essential simple closed curve of , it is homotopically infinite with respect to any hyperbolic orbisphere structure. ∎
Proposition 5.15.
Let be a finite subdivision rule and be a set of marked points. Suppose that the subdivision map is not doubly covered by a torus endomorphism. Let be a hyperbolic orbisphere structure. If there is a genealogical sequence of non-expanded bi-infinite curves that are recurrent and homotopically infinite with respect to , then has a Levy cycle.
Proof.
Suppose that does not have a Levy cycle. Then for any basis for the biset , there is a nucleus , which is a finite set. For every , we use the sequence of finite restrictions to obtain an element such that . Here is a distance on with respect to a generating set, which does not need to be specified. Then the nucleus has infinitely many elements, which contradicts to the assumption that the biset is contracting.
Recall that we use for the base point of , each element of a basis for is a curve from to one of its -preimages , and an element is a concatenation of curves connecting an -preimage to -preimage that are liftings of elements in .
Step 1: Construction of . Fix . There is an infinite sequence , which depends on , so that consists of the bones of the bands of the same types, i.e., there exists level- bands (possibly repeated) such that for every , is the bone of a level- band of type , which is independent of .
For every level- edge , we fix a point and call it the midpoint of . We assume that a bone of a level- band is chosen in the homotopy class in such a way that their endpoints are the midpoints of level- edges. For every level- edge , we also choose a path from to . Then, for each level- band , we can assign an element
where the overline means the reverse of the orientation of a curve and means the bone of a band .
For , we define by the collection of elements with the following property: For infinitely many there exist such that . We remark that .
Claim: There exists , independent of , such that contains at least one element with .
Proof of Claim.
Recall that for every and , is the bone of a level- band of type , which is independent of . Let and be level- edges such that their midpoints and are the endpoints of .
Let , which will be specified soon. Let and be defined by
Let be the lift of through starting from the terminal point of . Let and be the parts of where and are lifted. We specify as an element of satisfying the following: the curve with and being truncated is -combinatorially equivalent to with and being truncated. See Figure 6.
Then and differ by the pre- and post-composition with loops and . We have (1) a uniform upper bound on the homotopic length of and (in the projection to the Böttcher expanding map) by Lemma 5.11, (2) a uniform upper bound on the intersection between and , and (3) the upper bound in (2) is also an upper bound of the intersection between any level- lift and . Therefore, we have for some so that . Since there are only finitely many elements of within the distance from , there exists such that for infinitely many ’s. ∎
Step 2: Proof of . Let and be as defined in Step 1. Since , it suffices to show as tends to .
Let and be the level- edges whose midpoints are the endpoints of so that . Then follows from the condition that is homotopically infinite.
∎
6. Non-expanding spines
From Theorem 5.1, we know that the existence of a Levy cycle is equivalent to the existence of a genealogical sequence of homotopically infinite recurrent non-expanded curves. Then, how can we detect the existence such a sequence? The direct search for the genealogical sequence could be more complicated then the search for the Levy cycle. One motivation for non-expanding spines is to have a simpler object with which we can efficiently detect the genealogical sequence.
Since recurrent non-expanded level- curves are concatenations of level- recurrent bones, i.e., the bones of level- recurrent bands, it is natural to consider the union of level- recurrent bones. The level- non-expanding spine is, roughly speaking, the union of level- recurrent bones equipped with a natural train-track structure.
Motivation for the use of train-tracks. Let us see Figure 7. Let denote the hexagonal tile and denote three of its boundary edges. Suppose that and are level-0 recurrent bands so that each has two level-1 recurrent subbands of type and . Then each level-1 recurrent subband of type or has two level- recurrent subbands of type and . Assume that we draw the bones of these bands. At level-0, we have two curves each of which joins to or . As a “collection” of these two curves, we might consider a tripod whose leaves are on and . However, the tripod contains an unintended curve which joins to . To exclude such a curve, we use the idea of train-tracks, which makes the curve joining and illegal.
6.1. Train-track
Let be a graph and be a point, which could be a vertex or a point in the interior of an edge. A direction at is a germ of continuous curves starting from . The number of directions at is equal to the number of connected components of where is a sufficiently small neighborhood of . Denote the set of directions at by .
Definition 6.1 (Train-tracks and gates).
Let be a finite graph. For any vertex of . A train-track structure on is an assignment of an equivalence relation on for each . A train-track is a finite graph equipped with a train-track structure and denoted by . For any , has two directions and we define each equivalence class of to have each direction. Below is a list of definitions regarding train-tracks.
-
•
Each equivalence class of is called a gate at .
-
•
A train path is an oriented curve in such that at every vertex , the gate through which comes to is different from the gate through which goes out.
Definition 6.2 (Train-track map).
Let and be train-tracks. A train-track map is a continuous map that is locally injective on each edge such that for every and , and are in the same gate at if and are in the same gate.
Definition 6.3 (Homotopy relative to ).
Let be two continuous maps. We say that and are homotopic (resp. isotopic) relative to if there is a homotopy (resp. isotopy) such that
-
•
and ,
-
•
, and
-
•
For every , sends every connected component of to itself.
Definition 6.4 (Graphs properly embedded in ).
Let be a compact surface with a finite set of marked points . Some marked points may be on the boundary . A graph is properly embedded in if is properly embedded in and , where is the set of leaves of . We say that two graphs and properly embedded in are homotopic (resp. isotopic) if there is an ambient homotopy (resp. isotopy) relative to such that and .
Definition 6.5 (Train-tracks in surfaces).
Let be a compact surface possibly with boundary and a finite set of marked points . By a train-track in , we mean a train-track of a graph satisfying (1) is properly embedded in and (2) the train-track structure is compatible with the planar structure in the following sense: For every , has a cyclic order defined by a local orientation of near . Then every gate at consists of edges that are consecutive respect to the cycle order. We note that the consecutiveness is independent of the choice of local orientations, thus the definition also works for non-orientable surface .
Remark 6.6.
Train-tracks are commonly used to describe complicated curves or foliations. For these purposes, train-tracks are often assumed to have additional properties, such as that every vertex has degree , the number of gates at each vertex is always two, and the complement of a train-track is hyperbolic, all of which are not assumed in this article. See [PH92].
Definition 6.7 (Carrying between train-tracks).
Let be a compact surface with a finite set of marked points . Let and are train-tracks in . We say that carries if there is a train-track map such that can be extended to a map that is ambient homotopic relative to to the identity map. In particular, considering a possibly non-closed curve properly embedded in as a train-track with no vertex, we can say that a train-track carries if is contained in up to homotopy in .
Definition 6.8 (Homotopically infinite train-tracks).
Let be a hyperbolic orbisphere. A train-track in is homotopically infinite if carries a homotopically infinite closed curve with respect to the orbisphere structure .
6.2. Decomposition of graph with crossing condition on the unit disk
In this subsection, we investigate a graph theoretic property which will be used to define non-expanding spines.
Let us consider a unit disk in the Euclidean plane and its boundary circle. A chord is an Euclidean line segment joining to point on the circle. We say that two chords intersect if they intersect in the interior of the disk. Similarly, for two sets of chords and , we say that and intersect if there exist chords and so that and intersect.
Fix points on the boundary circle of a unit disk. There are different chords joining the points. Let be a collection of these chords. The collection can also be considered as a graph. We abuse notation and use to indicate the graph also. A decomposition of a graph is a collection of subgraphs which gives a partition on the set of edges.
Lemma 6.9.
Let be points on a circle. Let be a collection of chords joining pairs of ’s. Suppose satisfies the following crossing condition:
-
(Crossing condition) If two chords are intersecting, then all the six chords joining any pairs of four endpoints of are also contained in .
Then, as a graph, is decomposed into mutually non-intersecting (1) complete graphs with at least four vertices and (2) chords, which can also be considered as complete graphs with two vertices.
Proof.
The condition implies that if contains two intersecting chords, then it contains the complete graph of the four vertices. Suppose that a subset of forms a complete graph. We first show that if there is a chord in that intersects , then also contains the complete graph generated by . Denote by and the endpoints of . Since intersects , there exists that intersects . Let and denote the endpoints of . For any vertex of , as a graph, that is not or , either or intersects . In particular, by the crossing condition, the chords and are contained in . Since was taken arbitrarily, the complete graph with vertex set is also contained in .
Then every complete graph in can be extended until when it does not intersect other chords in , which proves the conclusion. ∎
Proposition 6.10.
Let be an -gon for . For a curve properly embedded in , we call the boundary edges of that contain the endpoints of the side edges of . Let be a collection of homotopy classes of properly embedded curves joining different boundary edges. Suppose that satisfies the crossing condition:
-
(Crossing condition) If , then contains the six homotopy classes of curves connecting any pairs of the four side edges of and .
Then there is a train-track properly embedded in such that for any curve properly embedded in , is carried by if and only if .
Proof.
We may consider as a closed disk. We also choose a point on each boundary edge and take a representative of a homotopy class of curves properly embedded in as a chord joining the chosen points on the edges. Then can be considered as a graph, see Figure 8. By Lemma 6.9, is decomposed into complete graphs (with at least 4 vertices) and curves that are mutually non-intersecting.
Suppose that forms a complete graph with vertices in the decomposition. Then we transform into a star-like tree whose leaves are the vertices of . We transform all the complete graphs in the decomposition of to star-like trees as above, see the second figure in Figure 8. Then we have a graph that is the union of some star-like trees and curves which can intersect only in the boundary of .
We define a train-track as follows:
-
(1)
Let be the center of a star-like tree. We define gates at in such a way that each gate has only one edge.
-
(2)
At each intersection in , we zip the intersecting curves up a little bit as the third figure in Figure 8. More precisely, assume that edges, say intersect at a boundary point . The transformation generates one vertex of degree ; the vertex is incident to the (deformed) edges , and to one new edge, say which joins to . There are two gates at : and .
It is immediate from the construction that the train-track satisfies the desired property. ∎
6.3. Non-expanding spines of tiles
Let be a level- tile of a finite subdivision rule and . For simplicity, we assume that is homeomorphic to a closed 2-disc, i.e., boundary edges are not identified. We will define the level- non-expanding spine of as a train-track properly embedded in which is roughly speaking the union of level- recurrent bones in . If boundary edges are identified, we first define a train-track in the closed 2-disc , which is the domain of the characteristic map , and then define the non-expanding spine as the image of the train-track by .
For a level- tile and a level- band , we say that is a subband of if and . We say that two level- subbands and of a level- tile intersect if their bones have non-zero intersection number, which must be one, of the homotopy classes of curves properly embedded in . It is immediate that if two level- subbands and intersect then they are bands of the same level- subtile of .
The next lemma, in particular the property (3), implies that the set of level- recurrent bones of satisfies the crossing condition in the statement of Lemma 6.9 or Proposition 6.10.
Lemma 6.11.
Let be a level-0 tile of a finite subdivision rule. For a level- recurrent band , let be the collection of level- recurrent bands that intersect . Suppose that is non-empty. Then we have the following properties.
-
(1)
For any and , there is a level- subtile of such that each has a unique level- subband , which is also recurrent. That is, in the directed graph of bands, belongs to only one cycle, say , and there is no directed path from to another cycle.
-
(2)
There exists such that is of type for every and any . Moreover, can be chosen as the common period of the cycles in containing ’s.
-
(3)
For every pair with , the band is a level- recurrent subband of for every .
Proof.
For any , every level- child of intersects any level- child of any . Hence, all the level- children of are bands of the same level- subtile, say , of .
For , we define a set as the collection of level- recurrent subbands of the level- bands in . Since every recurrent level- band has at least one recurrent child at each higher level, we have a sequence of surjections which map recurrent subbands to their parents.
To show the uniqueness in (1), it suffices to show that the surjections ()’s are actually bijections. Since is recurrent, for infinitely many the level- band has a level- recurrent subband of type . In particular, is of type . Then the types of level- subbands of for injectively correspond to for . This implies that is a sequence of bijections. Since there are infinitely many such ’s, is a sequence of bijections also.
(2) Let be the least positive integer satisfying that is of type . Such a exists because is recurrent. We claim that is of type for every . Here is a sketch of the proof and we left the details to the reader. Since tiles and bands are objects embedded in the sphere, we can define an order on according to how close is to . The order is preserved by the bijections ’s we discussed in (1), which implies is of type for every and . By exchanging the roles of with for any , we obtain that is the common period of the cycles in containing ’s.
(3) Let be the number determined in (2). It follows from (2) that for every and , the level- subtile is of type and its boundary edge is a subedge of and of type . Hence, for every pair with , the level- band has a level- subband which is of type . Then is recurrent for every . ∎
Proposition 6.12.
Let be a level-0 tile of a finite subdivision rule . Then there is a train-track whose underlying graph is properly embedded in such that any curve properly embedded in is carried by if and only if is the bone of a level- recurrent subband of .
Proof.
We first assume that the tile is a closed disk, i.e., its boundary edges are not identified. It follows from Lemma 6.11-(3) that the collection of spines satisfies the crossing condition in Proposition 6.10. Hence we have the desired train-tack by Proposition 6.10.
If is not a closed disk. We can use Proposition 6.10 for its domain , which is a closed disk, of the characteristic map to obtain a train-track in . Then we define as the -image of . If two level- edges that are identified by have boundary points of , then we also identify the boundary points when we define . ∎
Definition 6.13 (Non-expanding spine of a tile).
Let be a level-0 tile of a finite subdivision rule . The level- train-track of , denoted by , is a train-track properly embedded in defined in Proposition 6.12. Simply, defined is by the following procedure:
Definition 6.14.
(Non-expanding spines) Let be a finite subdivision rule. For every , the level- non-expanding spine of is a train-track that is defined by the union of level- non-expanding spines of all the level- tiles . When two tiles and have the common level- edge such that both and have boundary points on , then we identify the boundary points when we take the union to define .
Remark 6.15.
From the definition, we may consider bones of level- recurrent bands as curves contained in the level- non-expanding spine or non-expanding spine of tiles . We will in particular consider curves supported in as a concatenation of bones of bands.
Definition 6.16 (Essential non-expanding spines).
Let be a finite subdivision rule and be its subdivision map. Let be a set of marked points. We say that the level- non-expanding spine of is essential relative to if it contains (more precisely carries as a train-track) a closed curve that is homotopic relative to neither to a point nor to some iterate of a peripheral loop of a Julia point in .
Example 6.17.
See Figure 9. The upper two squares are level- tiles (or tile types). One tile is shaded and the other is not shaded. There are four level- edges (or edge types) and . The lower two squares are subdivisions at level-. The bi-recurrent components of level- and level- non-expanding spine are both homotopic to a peripheral loop of a Julia vertex. By Theorem 6.21, the subdivision map does not have a Levy cycle. Later, in Example 8.7, we will show that the subdivision map also does not have a Thurston obstruction.
Definition 6.18 (Nested sequence of non-expanding spines).
For any , there is a natural map sending every level- recurrent bone to its level- parent. Since is a subdivision of , we may consider and as train-tracks in the same complex . Then the map is ambient homotopic to the the identity map relative to the -skeleton of the level- subdivision complex, i.e., there is an extension that sends, possibly non-homeomorphically, every edge to the same edge and fixes vertices point-wisely. It is straightforward from definitions that the map is a train-track map. Then we have a sequence of train-track maps
We call this sequence the nested sequence of non-expanding spines.
For example, in Figure 7, each tripod is mapped to a curve by and .
Proposition 6.19.
Let be a finite subdivision rule and be the level- non-expanding spine of . For any , if is essential relative to then is also essential relative to
Proof.
Since is essential, there is a close curve supported in such that is neither homotopically trivial nor homotopic to some iterates of the peripheral loop of a Julia point in . Then is a closed curve supported in with the same property. Then is essential. ∎
Restriction of the ranges of non-expanded recurrent curves to . Let be a finite subdivision rule. Let be a set of marked points. It is straightforward from Proposition 6.12 that a closed curve is homotopic relative to to a level- recurrent non-expanded curve if and only if it is carried by in . Hence, when considering a level- non-expanded recurrent curve , we can restrict the range to and think of as a curve supported in .
Proposition 6.20.
Let be a finite subdivision rule and be the subdivision map where is a set of marked points. Let be a hyperbolic orbisphere structure of . Then the level- non-expanding spine is homotopically infinite for every if and only if there is a genealogical sequence of level- homotopically infinite non-expanded recurrent curves .
Proof.
If is not homotopically infinite, then every closed curve is homotopically finite, i.e., either trivial or some iterate of the peripheral loop of with . Since consists of finitely many bones, any infinite curve in is approximated by closed curves. Then any infinite curve supported in also cannot be homotopically infinite, so the desired genealogical sequence of curves does not exist.
Suppose that is homotopically infinite for every . We are going to define a set of homotopically infinite non-expanded recurrent curves supported with maps which send any level- non-expanded recurrent curves to their level- parents. We will also (1) define a metric on each for which the continuity of easily follows and (2) show that every is compact. Then the inverse limit of is non-empty whose every element yields a desired genealogical sequence of homotopically infinite non-expanded recurrent curves.
Recall that a level- non-expanded curve is defined to satisfy that for any , is a level- bone. Let us define the set as the collection of (parametrized) level- homotopically infinite non-expanded recurrent curves up to reparametrization such that does not contain a homotopically finite closed curve, which is a closed curve whose free homotopy class corresponds to the conjugate class of a torsion element of . Each is non-empty because is homotopically infinite. We define a metric on by where and is the minimal integer satisfying as unions of level- bones. It is easy to show that for ,
so that is indeed a metric. It is immediate from the definition that is distance non-increasing. Hence is uniformly continuous.
Lastly, let us show that is sequentially compact. Suppose that is any sequence in . Recall that is a bone of level- band so that, in particular, is a point in , which is a finite set. By dropping to a subsequence, we may assume that there exists such that for any . Let is the orbifold universal covering map of , where . Choose . For every , there exists a unique lifting with . Define .
Fix . Let denote the hyperbolic ball of radius with the center at . For any and some , we say that is the longest initial subcurve of staying in if and . The intersection has at most finitely many edges of . Since every element of does not contain a homotopically finite closed curve, any does not contain a closed curve. It follows that there exists such that every element of the subsequence of has the same longest initial subcurve staying in .
Take a sequence with . For any define as a subsequence of whose elements have the same longest initial subcurve staying in . By taking the diagonal of a sequence of subsequences , we have a subsequence of with the following property: There exist two strictly increasing sequences of positive integers and such that
-
(1)
is the longest initial subcurve staying in and
-
(2)
for any , i.e., the initial subcurves are accumulated.
We define a curve by for every , which is well-defined by (2). It follows from (1) that for any we have
where is the hyperbolic metric on . Hence, is homotopically infinite. Then , which implies is sequentially compact.
∎
Theorem 6.21.
Let be a finite subdivision rule and be its subdivision map which is not doubly covered by a torus endomorphism. Let be a set of marked points, i.e., . Then the post-critically finite branched covering has a Levy cycle if and only if the level- non-expanding spine is essential relative to for every .
Proof.
Let be an orbisphere structure. Any multiplication of by a positive integer gives rise to another orbisphere structure with strictly decreased Euler characteristic. Similarly, changing the order of every Fatou point in into the infinity also yields an orbisphere structure with strictly decreased Euler characteristic, if some order was actually changed. Hence, we always have a hyperbolic orbisphere structure with the property that if and only if is a Fatou point. Then a closed curve is homotopically infinite with respect to if and only if it is neither homotopic relative to to a point nor to some iterate of a peripheral loop of a Julia point in . Then the theorem follows from Proposition 5.14, 5.15, and 6.20. ∎
7. Graph intersecting obstruction
7.1. Graph intersecting obstructions
Suppose that is a post-critically finite branched covering. A graph is forward invariant under up to isotopy relative to if there exist a subgraph of and a homeomorphism such that and is isotopic to the identity map relative to . A graph is forward invariant under if . A multicurve on is forward invariant under up to isotopy relative to if it is so as a graph. A multicurve is backward invariant under up to isotopy relative to , or -stable, if every connected component of for is either isotopic relative to to an element of or peripheral to . When and are understood, we omit “under ” and “relative to ”.
Proposition 7.1.
Let be a post-critically finite branched covering and be a graph that is forward invariant up to isotopy. Then there exists which is isotopic to relative to , such that is forward invariant under a post-critically finite branched covering defined by . Especially, and are combinatorially equivalent by and .
Proof.
Let be a subgraph of isotopic to rel . By extending the isotopy to , we have such that and and are isotopic relative to . Let . Then and . ∎
Due to Proposition 7.1, we may consider forward invariant graphs instead of graphs that are forward invariant up to isotopy when discussing properties of combinatorial equivalence classes, such as Levy cycles and Thurston obstructions.
Let be a multicurve in . The Thurston linear transformation of is a linear map defined by
where is a connected component of and is an element of isotopic to if exists. If no such connected component exists, then the sum is defined to be zero. Since is a non-negative matrix, it has a non-negative real eigenvalue that is the spectral radius of . If , then is a Thurston obstruction. A non-negative square matrix is irreducible if for each with there exists such that the -entry of is positive. An irreducible multicurve is a multicurve whose Thurston linear transformation is irreducible. An irreducible Thurston obstruction is an irreducible multicurve that is a Thurston obstruction.
Remark 7.2.
A Thurston obstruction is usually assumed to be -stable. For any multicurve with , there exists a sub-multicurve such that is irreducible and . Such is determined as the multicurve of an irreducible diagonal block of the upper-triangular block form (UTB-form) of with . By Lemma 7.4, extends to a -invariant multicurve with . Hence we may drop the -condition condition from Thurston’s characterization.
Lemma 7.3.
If a multicurve is irreducible, then is forward invariant up to isotopy.
Proof.
For a contradiction, assume there exists such that for every no connected component of is isotopic to . Then , thus is not irreducible. ∎
Lemma 7.4 ([Tan92, Lemma 2.2]).
For any multicurve of that is forward invariant up to isotopy, there exists a multicurve which is backward invariant up to isotopy such that and .
Proof.
Let and be the set of homotopy classes of essential curves in . By the forward invariance up to isotopy, is an increasing sequence of multicurves. Note that is the maximal number of non-homotopic essential simple closed curves that can be disjointly embedded into . Hence there exists such that is -invariant. The inequality follows from the following: for non-negative square matrices and if for every then . ∎
Theorem 7.5 (Arcs intersecting obstructions [PT98, Theorem 3.2]).
Let be a post-critically finite branched covering and be an invariant graph such that is a graph automorphism. Then every irreducible Thurston obstruction intersecting is a Levy cycle.
We generalize it to a case when is an -invariant graph with .
Theorem 7.6 (Graph intersecting obstruction).
Let be a post-critically finite branched covering and be a forward invariant graph such that . Then every irreducible Thurston obstruction intersecting is a Levy cycle.
Remark 7.7.
An arc of is a curve embedded in such that its interior is embedded in and its endpoints are in . A geometric intersection number between curves (arcs and simple closed curves) is defined as the minimal number of intersection points in their isotopy classes relative to .
For a multicurve , the unweighted Thurston transformation is defined by
where is a connected component of and is an element of isotopic to if exists. If there is no such element, then the sum is defined to be zero. For every , (1) and (2) if and only if . So is irreducible if and only if is irreducible.
Proof of Theorem 7.6.
Let . For any simple closed curve , define
where means the geometric intersection number of and relative to . The and are linearly extended to weighted multicurves. Let be the incidence matrix of . Let be an irreducible Thurston obstruction. From , for every , we have
(2) |
The third term counts the intersection of with all connected components of , but the last term counts the intersection of with connected components of isotopic relative to to some connected components of .
It follows from Proposition 3.9 that entries of grows at most polynomially fast, so grows at most polynomially fast too. Since is an irreducible non-negative integer matrix, is a permutation by Lemma 3.8. Recall that (1) and (2) if and only if . Hence the only way to have is . Then is a Levy cycle. ∎
7.2. Application in the mating of polynomials
Formal mating. Let and be post-critically finite polynomials of degree . Consider and as maps from the complex plane to itself. Let be the compactification of by the circle each point of which corresponds to a linear direction to the infinity. Then, and extend to the boundary as the angle -times map. We can parametrize by where indicates the angle of an external ray. Let us use subscriptions and to distinguish two compactified complex planes where and act on respectively, such as , , and . Define a sphere by gluing two compactified planes and by the equivalence relation for any and with as numbers in . The dynamics of and also glue together to induce a dynamics , which is also a post-critically finite branched self-covering of the sphere. We call the formal mating of and .
Ray-equivalence class. Let be the formal mating of post-critically finite polynomials and . External rays of and forms a foliation on where and are filled Julia sets. Every leaf of the foliation is called a ray-equivalence class of the formal mating . Each ray-equivalence class consists of external rays of and of the same period and pre-period.
Degenerate mating. If or (or both) is non-hyperbolic, there could be an obvious Levy cycle of which could be removed by collapsing some ray equivalence classes.
Let . Suppose that is not hyperbolic. Then the post-critical set is in the Julia set so that each post-critical point of is contained in a ray-equivalence class. Suppose that there is a periodic ray-equivalence class that contains two points of such that is topologically a tree. Then the boundary of a small neighborhood of generates a Levy cycle. Hence, we will collapse to a point. To obtain a topological branched covering on the quotient sphere, we need a little more careful construction as follows, see [Shi00] for details.
Let be the set of ray-equivalence classes containing at least to points in . Define be the set of ray-equivalence class containing at least one point of such that for some and . If and every element of is topologically a tree, then we define as the quotient of by collapsing every ray-equivalence class in to a point. The map induces a degree self-map on which is not a branched covering near for . But we can take a homotopy near for to obtain a branched covering , which is called the degenerate mating of and . We also denote the degenerate mating by . When both and are hyperbolic, the degenerate mating is equal to the formal mating.
Example 7.8 ().
For , let denote the post-critically finite polynomial at the landing point of the external ray of angle in the parameter plane of the quadratic polynomials . Let and . Let us denote by and the external rays of and of angle .
The set defined above consists of 3 ray-equivalence class: , , and . The set has one more ray-equivalence class than .
Let be the formal mating. The boundary of a small disk neighborhood of is a Levy cycle of period one. Let us also use to indicate the collapsed points in . The degenerate mating maps to for , where and are critical points of degree two.
Definition 7.9.
For post-critically finite polynomials and of the same degree, we say that and are mateable if the degenerate mating is combinatorially equivalent to a post-critically finite rational map.
Corollary 7.10.
Let and be post-critically finite hyperbolic (resp. possibly non-hyperbolic) polynomials such that at least one of and has core entropy zero. Then and are mateable if and only if the formal mating (resp. degenerate mating) does not have a Levy cycle.
Proof.
Assume and are hyperbolic and the core entropy of is zero. Suppose the formal mating of and does not have a Levy cycle but has a Thurston obstruction . We may assume that is irreducible. We can think of Hubbard trees and of and as invariant trees in the glued sphere . By Theorem 7.6, is disjoint from . Then yields a Thurston obstruction of the polynomial , which is a contradiction.
Suppose that and may not be hyperbolic and has core entropy zero. Let denote the projection from the sphere of the formal mating to the sphere of the degenerate mating. Let and denote the Hubbard tress embedded in , and let and denote their -image in . Some points of and are identified by , but still has entropy zero. By the argument in the previous paragraph, if there is an irreducible Thurston obstruction of the degenerate mating that is not a Levy cycle, the is disjoint from . For , if is not a singleton, then . Hence the multicurve can be lifted to a Thurston obstruction of the formal mating with still being disjoint from . Then again yields a Thurston obstruction of the polynomial , which is a contradiction. ∎
8. Finite subdivision rules with polynomial growth of edge subdivisions
Definition 8.1 (Polynomial growth of edge subdivisions).
Let be a finite subdivision rule and be a level- edge. The edge has sub-exponential growth of subdivisions if
We say that has sub-exponential growth of edge subdivisions if every level- edge has sub-exponential growth of subdivisions. By Proposition 8.2, we can substitute the term “sub-exponential” for “polynomial ”.
Recall that we defined the directed graph of edge subdivisions in Section 4.4. Also recall that a level- edge is called periodic (or also called recurrent) if the corresponding vertex in is contained in a cycle.
Proposition 8.2.
A finite subdivision rule has sub-exponential growth of edge subdivisions if and only if the cycles in are disjoint. In this case, for each level- edge , grows polynomially fast as .
Let be the restriction of to the -skeleton . Then is a Markov map. The adjacency matrix of the directed graph of edge subdivision coincides with the incidence matrix of the Markov map . The following proposition is immediate from Proposition 3.9.
Proposition 8.3.
A finite subdivision rule has polynomial growth of edge subdivisions if and only if .
Let be a level- periodic edge. For every , has at least one level- child (subedge) that is recurrent, see Section 4.5. If has polynomial growth of subdivisions, then the recurrent subedges are unique at each level. The same statement also works for periodic bands.
Proposition 8.4 (Unique recurrent children).
Let be a finite subdivision rule and be a level- periodic edge with polynomial growth of subdivisions. For any , has a unique level- subedge that is recurrent. For a level- periodic band , if and have polynomial growth of subdivisions, then for any there exists a unique level- subband of that is recurrent.
Proof.
By Proposition 8.2, there exists a unique cycle in passing through . Hence, for any , there is only one path of length from and supported within the cycle, which determines a unique level- recurrent subedge by Proposition 4.5. The uniqueness of recurrent subedge can also follow from Proposition 8.4.
If is periodic, then it has at least one level- unique subband . By Lemma 4.9, the level- edges and are recurrent subedges of and , which are unique by the previous paragraph. Hence the recurrent subbands are unique at each level. ∎
Proposition 8.5.
Suppose a finite subdivision rule has polynomial growth of edge subdivisions. Then every train-track map in the nested sequence of non-expanding spines, defined in Definition 6.18,
is a homeomorphism.
Proof.
Let be a level- periodic band. It follows from Proposition 8.4 and Lemma 4.9 that for any there exists a unique level- recurrent band of such that its sides are unique level- recurrent subedges of and . If two level- periodic bands share a side then the level- recurrent bands also share a side which is the level- recurrent subedge of . Hence and are made up of the same number of bones of bands which are glued in the same way. ∎
Theorem 8.6.
Let be a finite subdivision rule with polynomial growth of edge subdivisions and be its subdivision map which is not doubly covered by a torus endomorphism. Let be a set of marked point, i.e., . Then the followings are equivalent.
-
(1)
does not have a Levy cycle.
-
(2)
The level- non-expanding spine does not carry a closed curve that is neither homotopic relative to to a point nor to some iterate of a peripheral loop of a Julia point in .
-
(3)
is combinatorially equivalent to a unique rational map up to conjugation by Möbius transformations, i.e., does not have a Thurston obstruction.
Proof.
Example 8.7 (Example 6.17 continued).
9. Examples
9.1. Critically fixed rational maps
A rational map is critically fixed if every critical point is a fixed point. It was recently shown that there is a one-to-one correspondence between critically fixed rational functions and planar graphs. The idea started from [PT98] and was completed in [Hlu19].
Theorem 9.1 (Hlushchanka, Pilgrim et. al.).
There is a one-to-one correspondence between the holomorphic conjugacy classes of critically fixed rational functions and the planar isotopy classes of connected planar graphs without loops.
Let be a planar graph without loops and be the corresponding critically fixed rational map in Theorem 9.1. At the end of this subsection, we construct a finite rule such that (1) its subdivision map is and (2) every edge never subdivides.
Let be a critically fixed rational map. The Tischler graph of is a graph embedded in whose edge set is the collection of fixed internal rays in the immediate attracting basins of all critical points. It follows from [Hlu19] that the Tischler graph any critically fixed rational map is connected.
To construct a critically fixed rational function from a planar graph without loops, we use blowing-up an arc construction, that is firstly introduced in [PT98].
Blowing-up an arc.. Let be a post-critically finite branched covering and be an arc fixed by . Let be an open -disc contained in a small neighborhood of with . Let . Define an orientation-preserving continuous map in such a way that maps and to , with endpoints fixed. Define another orientation-preserving continuous map in a similar way so that maps and to , with endpoints fixed, and maps the to homeomorphically. A new branched covering is defined by and . We call the blown-up along an arc . Note that .
Let be a planar graph without loops and . Define a post-critically finite branched covering by blowing up the identity map along all edges of . The combinatorial equivalence class dis independent of the order of blowing-up. Each vertex of is a critical point of such that . If follows from [PT98, Corollary 3] that is combinatorially equivalent to a rational map. Because fixes , the branched covering is the identity on . Define a finite subdivision rule such that
-
(1)
be the CW-complex whose -skeleton is
-
(2)
be the CW-complex whose -skeleton is , and
-
(3)
is the subdivision map of .
Remark 9.2.
When an edge is blown-up, there are two choices for , depending on which side of the disk is. But the combinatorial equivalence class of the resulting branched covering is independent.
Example 9.3.
See Figure 10. The graph is a triangle with one more edge attached. Figure 10A indicates the disk that we use in the blowing-up the edge . The other two figures indicate the CW-complex structures at level- and . The shaded triangles in Figure 10C are mapped to the shaded triangle in Figure 10B under the subdivision map .
9.2. Face-inversion constructions and critically fixed anti-rational maps
The construction in this section was also investigated in [Gey20] and [LLM20] in the study of critically fixed anti-rational maps.
Let be a finite graph in the -sphere . The graph defines the CW-complex structure with . A graph is -vertex-connected or -edge-connected if it is not disconnected by the removal of fewer than vertices or (open) edges respectively. For the characteristic map of a closed -cell , we say that the boundary vertices or edges of are identified if more than one vertex or edge are identified under . The followings are characterizations of - or -connectivity of graphs embedded in .
-
•
is -vertex-connected if and only if boundary vertices of every -cell are not identified, i.e., the boundary of every -cell is a Jordan curve.
-
•
is -edge-connected if and only if the boundary edges of every -cell are not identified. The -vertex connectedness implies the -edge connectedness.
-
•
is -edge-connected if and only if it is -edge-connected and any two -cells do not share more than one edge. It is also equivalent to the dual graph having no cycle of length .
Assume is -vertex-connected and for every . Let be a -cell of and be the reflection of in . This is possible because the -vertex-connectedness implies that is a simple closed curve. Then is a graph isomorphic to such that . Define a graph by
Let be the CW-complex structure on with . We define a finite subdivision rule as follows: Let and . Define an orientation reversing branched self-covering defined by for every -cell of . Then becomes a subdivision map . Note that every edge does not subdivide. The degree of is equal to the number of -cells of minus one. We call the finite subdivision rule of face-inversion of . Every vertex is a fixed critical point of .
A natural way to obtain an orientation preserving finite subdivision rule is to take square of the subdivision and the subdivision map . We denote by this squared orientation preserving subdivision rule. Another way is to post-compose with an orientation reversing automorphism of . An automorphism is called orientation reversing if it extends to an orientation reversing homeomorphism of . For any orientation reversing automorphism , we have an orientation preserving subdivision map defined on the same subdivision complexes as . Denote this finite subdivision rule by .
Theorem 9.4.
Let be a -vertex-connected graph in such that for every . Let be the finite subdivision rule of the face-inversion of and be its subdivision map. Let be any orientation reversing automorphism of . Then the followings are equivalent:
-
(1)
is -edge-connected.
-
(2)
does not have a Levy cycle.
-
(2’)
does not have a Thurston obstruction.
-
(3)
does not have a Levy cycle.
-
(3’)
does not have a Thurston obstruction.
Proof.
A level- band is non-separating if and only if there is another level- band such that , and . If such bands and exist, the removal of two edges of intersecting the bones of these bands disconnects , i.e., is not -edge-connected. Conversely, if is not -edge-connected, then such level- bands and exist. Hence is -edge-connected if and only if every level- band is non-separating. In the case, the level- non-expanding spine for is an empty set. Then follow from Theorem 8.6.
Assume is not -edge-connected so that there are bands and described as in the previous paragraph. The union of bones of and is a homotopically infinite circle contained in the level- non-expanding spine of . Hence follows from Theorem 8.6.
The equivalence follows from the fact that the subdivisions and have the same CW-complex structure. The level- non-expanding spine of is equal to the level- non-expanding spine of for . ∎
Remark 9.6.
Remark 9.7.
Even if there exists a vertex with , the construction is still well-defined, but is not a critical point. Note that such vertex can be removed from the vertex set without any change in the face-inversion construction.
Example 9.8.

See Figure 11. Let be the graph in the bottom and the reflection along the middle horizontal line. Then the left and right subdivisions represent and respectively.
In order to obtain an explicit formula of , we normalize three vertices on the axis of in Figure 11 from left to right to , and . Note that is at or , and is at . Since and are fixed points, is a quartic polynomial divided by , and is a linear polynomial. We may assume that is monic. The conditions that (1) is a critical fixed point and (2) the other two critical points are exchanged by give rise to a system of equation about coefficients of and . Solving this numerically, we have
See Figure 12 for the Julia set.
9.3. Finite subdivision rules with essential non-expanding spines at higher levels
In this subsection, we prove Proposition 9.9 by constructing an example.
Proposition 9.9.
For every , there exists a finite subdivision rule with the subdivision map of degree such that (1) , (2) the level- non-expanding spine is essential relative to for , and (3) is not essential relative to for .
Let us see the finite subdivision rule in Figure 13. The -skeleton at level- is drawn by bold curves. The non-expanding spines and are drawn by dotted curves. The is essential but is homotopically trivial. Let be the subdivision map described in Figure 13. We modify the finite subdivision rule into as follows:
-
(1)
Change the labels and into and .
-
(2)
For , we draw copies of annuli consisting of and in a row on the left of the annulus consisting of and at level-. Denote by the modified level- CW-complex. Define .
-
(3)
Let be an orientation preserving homeomorphism of the -sphere such that and and for any , where indices are considered modulo . That is, is a -rotation. Define the subdivision map by .
Let be the level- non-expanding spine of . The is -copies of circles. The is the union of -copies of circles with three non-closed curves. Similarly, for , the level- non-expanding spine has circles and some non-closed curves. Therefore, is essential if and non-essential if .
9.4. Edge-edge expansion vs. edge subdivisions
Let us further investigate the equivalence between the existence of Levy cycles and of Thurston obstructions. Recall that the coefficients of Thurston linear transformation are defined by
In the setting of finite subdivision rules, the summands are related to the expansion between edges and the number of summands is related to the growth rate of edge subdivisions. Hence, we can expect there is no Thurston obstruction if the edge-edge expansion dominates the edge subdivisions. See [CPT16, Theorem 8.4] for a similar comparison.
Let be a finite subdivision rule.
- Edge-edge expansion:
-
We say that is edge-edge -expanding for if there exists such that for any and any bone of level- band, the level- subdivision complex subdivides into at least segments .
- Edge subdivision rate:
-
For any level- edge , the exponential growth rate of subdivisions of is the number with . The maximum over level- edges is called the maximal exponential growth rate of edge subdivisions.
Proposition 9.10.
Let be a finite subdivision rule. Let be the maximal exponential growth rate of edge subdivisions. If is edge-edge -expanding for some , then the non-expanding spine of is empty so that the subdivision map does not have a Levy cycle for any set of marked points . Moreover, if , then the subdivision map does not have a Thurston obstruction for any set of marked points .
Proof.
Let be a multicurve of . For a closed curve transverse to , we denote by the cardinality of the intersection . Let .
Let and be a connected component that is isotopic to . Since is edge-edge -expanding, there exists , which is independent of the choices of and , such that
The first part about the emptiness of non-expanding spines immediately follows from the definition of non-expanding spine. Let us assume and show the second part. Let be a multicurve of . For a closed curve transverse to , we denote by the cardinality of the intersection . Let . Since is edge-edge -expanding, there exists such that for any and for any connected component of , we have
for any where is isotopic to . Then .
Let be the minimal number satisfying for any level- edge . It follows that (a) for any level- edge , . By the definition of , there exists such that for any level- edge and any , the number of level- subedges of is at most for some with . Consider a concatenation of level- edges connecting two points with and being in the different Jordan domains of . Note that (b) every simple closed curve isotopic to has at least one intersection point with . We have
The first inequality follows from (b), the second follows from (a) and the third follows from the fact that is a concatenation of at most edges at level-.
Hence, every entry in the Thurston linear transformation is bounded from above by
which tends to 0 as . Then the map does not allow any Thurston obstruction. ∎
There are many ways to improve Proposition 9.10. Here are two possible directions.
- Suggestion 1:
-
Proposition 9.10 can be compared with [FPP18b, Proposition 5.1], which states that if is edge separating and vertex separating, then the subdivision map does not have a Levy cycle. One difference is that the subdivision map in Proposition 9.10 has to be of hyperbolic-type, i.e., every critical point is a Fatou point, but [FPP18b, Proposition 5.1] works for any subdivision maps. The definition of edge separation in [FPP18b] is the edge-edge expansion, defined in this article, only for pairs of edges that do not share end points. The vertex separation might be necessary only for Julia vertices. One might be able to obtain a stronger result by combining these two propositions.
- Suggestion 2:
-
It would be possible to combine Theorem 7.6 and Proposition 9.10 to obtain a stronger sufficient condition for the equivalence between the existence of Levy and Thurston obstructions. We might be able to (1) have the equivalence on the part where edges subdivide polynomially fast and (2) exclude Thurston obstructions where edges subdivide exponentially fast by assuming the condition in Proposition 9.10.
Example 9.11.

See Figure 14. We think of the doubles of the the left triangle and get the level- subdivision complex with two tiles. Similarly, take the double of the right large triangle, which is subdivided into 12 small triangles, and define it as the level- complex . Then Figure 14 defines a finite subdivision rule with the subdivision map which is defined by a map sending each small triangle on the right to a triangle on the left or its copy with the types of edges being preserved. Then and has three critical values , and , which are vertices of the level- triangles. Moreover, .
It is immediate that the non-expanding spine is an empty set. By Theorem 6.21, does not have a Levy cycle. Since has exponential growth rate of edge subdivisions, we cannot apply Theorem 8.6 to claim that does not have a Thurston obstruction. However, it is easy to show that and , and then does not have a Thurston obstruction by Proposition 9.10.
References
- [BBY12] Sylvain Bonnot, Mark Braverman, and Michael Yampolsky, Thurston equivalence to a rational map is decidable, Mosc. Math. J. 12 (2012), no. 4, 747–763, 884. MR 3076853
- [BD18] Laurent Bartholdi and Dzmitry Dudko, Algorithmic aspects of branched coverings IV/V. Expanding maps, Trans. Amer. Math. Soc. 370 (2018), no. 11, 7679–7714. MR 3852445
- [BLMW19] James Belk, Justin Lanier, Dan Margalit, and Rebecca R. Winarski, Recognizing topological polynomials by lifting trees, 2019, arXiv:1906.07680.
- [BM17] Mario Bonk and Daniel Meyer, Expanding Thurston maps, Mathematical Surveys and Monographs, vol. 225, American Mathematical Society, Providence, RI, 2017. MR 3727134
- [BP94] Abraham Berman and Robert J. Plemmons, Nonnegative matrices in the mathematical sciences, Classics in Applied Mathematics, vol. 9, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1994, Revised reprint of the 1979 original. MR 1298430
- [CFKP03] J. W. Cannon, W. J. Floyd, R. Kenyon, and W. R. Parry, Constructing rational maps from subdivision rules, Conform. Geom. Dyn. 7 (2003), 76–102. MR 1992038
- [CFP01] J. W. Cannon, W. J. Floyd, and W. R. Parry, Finite subdivision rules, Conform. Geom. Dyn. 5 (2001), 153–196. MR 1875951
- [CPT12] Guizhen Cui, Wenjuan Peng, and Lei Tan, On a theorem of Rees-Shishikura, Ann. Fac. Sci. Toulouse Math. (6) 21 (2012), no. 5, 981–993. MR 3088264
- [CPT16] by same author, Renormalizations and wandering Jordan curves of rational maps, Comm. Math. Phys. 344 (2016), no. 1, 67–115. MR 3493138
- [DH93] Adrien Douady and John H. Hubbard, A proof of Thurston’s topological characterization of rational functions, Acta Math. 171 (1993), no. 2, 263–297. MR 1251582
- [FM12] Benson Farb and Dan Margalit, A primer on mapping class groups, Princeton Mathematical Series, vol. 49, Princeton University Press, Princeton, NJ, 2012. MR 2850125
- [FPP18a] William Floyd, Walter Parry, and Kevin M. Pilgrim, Rationality is decidable for nearly euclidean thurston maps, 2018, arXiv:1812.01066.
- [FPP18b] William J. Floyd, Walter R. Parry, and Kevin M. Pilgrim, Expansion properties for finite subdivision rules I, Sci. China Math. 61 (2018), no. 12, 2237–2266. MR 3881956
- [FPP20] William Floyd, Walter Parry, and Kevin M. Pilgrim, Expansion properties for finite subdivision rules II, Conform. Geom. Dyn. 24 (2020), 29–50. MR 4051834
- [Gey20] Lukas Geyer, Classification of critically fixed anti-rational maps, 2020, arXiv:2006.10788.
- [GHMZ18] Yan Gao, Peter Haïssinsky, Daniel Meyer, and Jinsong Zeng, Invariant Jordan curves of Sierpiński carpet rational maps, Ergodic Theory Dynam. Systems 38 (2018), no. 2, 583–600. MR 3774834
- [Hlu17] Mikhail Hlushchanka, Invariant graphs, tilings, and iterated monodromy groups, Ph.D. thesis, Jacobs University, 2017.
- [Hlu19] by same author, Tischler graphs of critically fixed rational maps and their applications, 2019, arXiv:1904.04759.
- [HS94] John H. Hubbard and Dierk Schleicher, The spider algorithm, Complex dynamical systems (Cincinnati, OH, 1994), Proc. Sympos. Appl. Math., vol. 49, Amer. Math. Soc., Providence, RI, 1994, pp. 155–180. MR 1315537
- [Hub16] John Hamal Hubbard, Teichmüller theory and applications to geometry, topology, and dynamics. Vol. 2, Matrix Editions, Ithaca, NY, 2016, Surface homeomorphisms and rational functions. MR 3675959
- [Lev85] Silvio Vieira Ferreira Levy, Critically finite rational maps (Thurston), Ph.D. thesis, Princeton University, 1985, p. 65. MR 2634168
- [LLM20] Russell Lodge, Yusheng Luo, and Sabyasachi Mukherjee, Circle packings, kissing reflection groups and critically fixed anti-rational maps, 2020, arXiv:2007.03558.
- [LLMM19] Russell Lodge, Mikhail Lyubich, Sergei Merenkov, and Sabyasachi Mukherjee, On dynamical gaskets generated by rational maps, Kleinian groups, and Schwarz reflections, 2019, arXiv:1912.13438.
- [LMS15] Russell Lodge, Yauhen Mikulich, and Dierk Schleicher, Combinatorial properties of newton maps, 2015, arXiv:1510.02761.
- [MS80] M. Misiurewicz and W. Szlenk, Entropy of piecewise monotone mappings, Studia Math. 67 (1980), no. 1, 45–63. MR 579440
- [Nek05] Volodymyr Nekrashevych, Self-similar groups, Mathematical Surveys and Monographs, vol. 117, American Mathematical Society, Providence, RI, 2005. MR 2162164
- [PH92] R. C. Penner and J. L. Harer, Combinatorics of train tracks, Annals of Mathematics Studies, vol. 125, Princeton University Press, Princeton, NJ, 1992. MR 1144770
- [Poi10] Alfredo Poirier, Hubbard trees, Fund. Math. 208 (2010), no. 3, 193–248. MR 2650982
- [PT98] Kevin M. Pilgrim and Lei Tan, Combining rational maps and controlling obstructions, Ergodic Theory Dynam. Systems 18 (1998), no. 1, 221–245. MR 1609463
- [Ree92] Mary Rees, A partial description of parameter space of rational maps of degree two. I, Acta Math. 168 (1992), no. 1-2, 11–87. MR 1149864
- [Shi00] Mitsuhiro Shishikura, On a theorem of M. Rees for matings of polynomials, The Mandelbrot set, theme and variations, London Math. Soc. Lecture Note Ser., vol. 274, Cambridge Univ. Press, Cambridge, 2000, pp. 289–305. MR 1765095
- [Sid00] Said Sidki, Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity, J. Math. Sci. (New York) 100 (2000), no. 1, 1925–1943, Algebra, 12. MR 1774362
- [ST00] Mitsuhiro Shishikura and Lei Tan, A family of cubic rational maps and matings of cubic polynomials, Experiment. Math. 9 (2000), 29–53. MR 1758798
- [ST19] Anastasia Shepelevtseva and Vladlen Timorin, Invariant spanning trees for quadratic rational maps, Arnold Math. J. 5 (2019), no. 4, 435–481. MR 4068871
- [Tan92] Lei Tan, Matings of quadratic polynomials, Ergodic Theory Dynam. Systems 12 (1992), no. 3, 589–620. MR 1182664
- [Thu20] Dylan P. Thurston, A positive characterization of rational maps, Ann. of Math. (2) 192 (2020), no. 1, 1–46. MR 4125449
- [Ufn82] V. A. Ufnarovskiĭ, Criterion for the growth of graphs and algebras given by words, Mat. Zametki 31 (1982), no. 3, 465–472, 476. MR 652851