Polynomial entropy of Morse-Smale diffeomorphisms on surfaces
Abstract.
A classical problem in dynamical systems is to measure the complexity of a map in terms of its orbits, and one of the main concepts used to achieve this goal is entropy. Nonetheless, many interesting families of dynamical systems have every element with zero-entropy. One of these are Morse-Smale diffeomorphisms. In this work, we compute the generalized entropy of Morse-Smale diffeomorphisms on surfaces, based on which we deduce their polynomial entropy. We also apply our technique to compute the dispersion of the orbits of maps on the border of chaos with mild dissipation.
Keywords: Generalized entropy, Polynomial entropy, Morse-Smale diffeomorphisms.
2020 Mathematics subject classification: 37B40, 37D15, 37E30
1. Introduction
A classical problem in dynamical systems is to measure the complexity of a map in terms of its orbits. One of the main tools we have to achieve this goal is topological entropy. The topological entropy of a map studies the exponential growth rate at which orbits are separated. Although it is a crucial tool for classifying highly chaotic dynamical systems, in many interesting families of dynamical systems, every system has vanishing entropy, and therefore, another tool is needed. J. P. Marco in [15] introduced the concept of polynomial entropy, and recently, the first author and E. Pujals introduced the notion of generalized topological entropy in [5]. The later definition, instead of quantifying the complexity of a system with a single number, it works directly in the space of the orders of growth .
J. P. Marco, C. Labrousse and P. Blanchard were the first to study dynamical systems with vanishing entropy from the perspective of polynomial entropy. First, J. P. Marco introduced the concept of polynomial entropy in [15], and this topic was subsequently studied in [12], [11], [14] and [2] in the context of Hamiltonian dynamical systems and geodesic flows with zero-entropy. For maps on the interval, we have the works of C. Labrousse [13], M. J. D. Carneiro and J. B. Gomes [3] and S. Roth, Z. Roth and L. Snoha [16] to refer to. Lastly, for general dynamical systems, we have the work of A. Artigue, D. Carrasco-Olivera and I. Monteverde [1].
We would like to coment on two aspects of the work of L. Hauseux and F. Le Roux in [9]. First, in [5], the authors observed that in the study of dynamical system with vanishing entropy, there are examples where the complexity of the overall system is greater than the complexity of the system restricted to its recurrent part. This phenomenon does not occur in the presence of chaos due to the variational principle. It is our opinion that the definition of wandering entropy given in [9] should give account of said jump. Second is with respect to the technique they developed to compute the polynomial entropy of a system whose non-wandering set consists of only one fixed point. In this article, we translate this technique to the context of generalized entropy and extend it to maps with a finite non-wandering set. We would like to mention that J. Katić and M. Perić in [10] use said approach from [9] to study Morse gradient systems with the singularities of a specific index.
Let us consider a compact surface and a Morse-Smale diffeomorphism. We recall that these maps are the ones whose non-wandering set is finite and, therefore, consists only of periodic points. These periodic points have to be hyperbolic; moreover, the intersection between any stable and any unstable manifolds is transverse. Let us suppose that where denotes the orbit of point . We can construct a finite graph , where the vertices are the orbits and the edges represent the existence of an orbit whose past is and future is . Thus, we define
If the graph had any cycle, then there would be a non-trivial homoclinic class, and therefore, the non-wandering set would not be finite. Now, let us define as the length of the longest possible path in . We represent the generalized entropy of by , and the polynomial entropy of by .
Theorem 1.
Let be a compact surface and a Morse-Smale diffeomorphism. Then, . In particular, .
As an immediate corollary, we have a rigidity result.
Corollary 1.
Let be a compact connected surface and a Morse-Smale diffeomorphism such that . Then, and is a North-South dynamical system.
We can apply theorem 1 to understand the dispersion of orbits in the border of zero-entropy. Consider the space of embeddings of the disk into itself. In [8], J. M. Gambaudo, S. van Strein and C. Tresser constructed a system that is Kupka-Smale and infinitely re-normalizable and happens to be in the border of chaos. This means that it can be perturbed into a system with positive classical entropy. The said example is also the limit of Morse-Smale diffeomorphisms and has a geometry that allow us to apply theorem 1. We would like to highlight that maps with said properties are far from being an isolated example. In [6], S. Crovisier and E. Pujals introduced the concept of mildly dissipative maps in , and with C. Tresser in [7], they proved that any map with mild dissipation in the border of chaos is infinitely re-normalizable. In order for our following result to be a direct application of theorem 1, we need an additional hypothesis that we shall call standard geometry and explain in detail in subsection 2.2. This property holds in the Gambaudo - van Strein - Tresser example as well as the Hénon-like maps with small Jacobian. The latter is proved by A. de Carvalho, M. Lyubich and M. Martens in [4].
Let stand for the family of polynomial orders of growth with .
Corollary 2.
Let be a Kupka-Smale and infinitely re-normalizable with standard geometry. Then, . In particular, and . Moreover, the Kupka-Smale property is dense among the mildly dissipative maps of the disk with zero-entropy and infinitely re-normalizable (with or without standard geometry).
Regarding the generalized entropy in the border of chaos, the standard geometry property is probably removable. However, a deeper understanding of the dispersion of wandering orbits near recurrent sets is needed. The Kupka-Smale property allows us to apply theorem 1 directly, yet it may not be necessary. It seems intuitive for us that should hold for every map in said set.
We can also deduce that the map is continuous in some sense.
Corollary 3.
Let us consider a sequence of maps and , all of them mildly dissipative. Suppose that is Morse-Smale, while is Kupka-Smale and infinitely re-normalizable with standard geometry. If in the topology, then . In particular, .
In retrospect, in the naturality of this result lies an indication of why theorem 1 is also true. We know that the polynomial entropy of Morse-Smale maps is positive because it has wandering points. When we consider a map in the border of chaos, we naturally want that and if it is approximated by Morse-Smale, the polynomial entropy of them should grow toward infinity. It is expected that maps in the border of chaos show a reminiscent phenomenon of the period doubling cascade of bifurcations for interval maps. In this context, the only dynamical quantity that is growing and has a global understanding of the map is .
Interestingly enough, in their recent work [16], S. Roth, Z. Roth and L. Snoha proved the counterpart of our results in the one-dimensional context. They showed that for endomorphisms of the interval with zero entropy, their polynomial entropy is equal to a quantity equivalent to our , and they obtained analogous results to our corollaries 2 and 3. In particular, for the logistic map, they showed that in each bifurcation of the period doubling cascade, the polynomial entropy increases by , as well as that the infinitely re-normalizable map has infinite polynomial entropy.
The proof of theorem 1 has two steps: understanding the geometrical configuration of a Morse-Smale and computing the generalized entropy through a nice codification of orbits. In the study of the separation of the orbits of wandering dynamics, Hauseux and Le Roux introduced the concept of wandering mutually singular sets in [9]. We would like to point out that for dynamical systems with finite non-wandering set, this concept is in some sense the equivalent of the Markov partitions for uniformly hyperbolic systems.
We denote as the non-wandering set of . We say that the subsets of are mutually singular if for every , there exists a point and times such that for every , and for every .
Theorem 2.
Let us consider as a homeomorphism of a compact metric space whose non-wandering set is finite. Then, its generalized entropy is the supremum of the orders of growth associated with the codification of the orbits using mutually singular sets.
A more precise statement of this theorem is given in subsection 2.3. We want to now discuss the interplay of theorems 1, 2 with the main theorem in [9]. A consequence of theorem 2 is that the generalized entropy of a homeomorphism with a finite non-wandering set always verifies . Let us consider as a family of homeomorphism on a surface such that its non-wandering set is finite. Let us also consider as the subset of such that the surface is the sphere and its non-wandering set is only one fixed point. Part of the translation of the result in [9] in our context is that for every , there exists such that . This result in conjunction with our previous observation can be summarized as follows:
For every , . Moreover, for every , there exists such that .
Theorem 1 tells us that for those maps in that are Morse-Smale diffeomorphisms, the set becomes discrete. It is not clear to us whether the differentiability plays a key role in this. We wonder if there is an obstruction for the examples built in [9] to be differentiable and whether this contrast is another case of pathological differences between the continuous world and the differentiable one.
A final comment in this topic is made toward the jump from to for the homeomorphisms in the sphere. In [9], the authors quote a result that seems to apply only for homeomorphisms in , and we would like to know if it possible to obtain a map in for every such that .
We finish this introduction with a small discussion regarding the higher dimension. From theorem 2 and an intermediary lemma for theorem 1, we deduce the following result.
Corollary 4.
Consider a compact manifold of dimension and a Morse-Smale diffeomorphism. In that case, .
Regarding the other inequality, it is unclear to us if our technique holds. The main obstruction we see is the possible interaction between the periodic saddles of different indices.
We would like to thank Enrique Pujals for the many discussions and insightful comments.
This work is structured as follows:
- •
- •
- •
2. Preliminaries and Statements
2.1. Orders of growth and generalized entropy
Let us briefly recall how the complete set of the orders of growth and the generalized entropy of a map are defined in [5]. First, we consider the space of non-decreasing sequences in :
Next, we define the equivalence relationship in by if and only if there exist such that for all . Since the two sequences are related, if both have the same order of growth, we call the quotient space as the space of the orders of growth. If belongs to , we are going to denote as the associated class in . If a sequence is defined by a formula (for example, ), then the order of growth associated will be represented by the formula between the brackets ().
Once has been constructed, we define on it a very natural partial order. We say that if there exists such that , for all . With this, we consider the Dedekind-MacNeille completion. This is the smallest complete lattice that contains . In particular, it is uniquely defined and we will always consider that . We will also call the complete set of the orders of growth.
Now, we proceed to define the generalized entropy of a dynamical system in the complete space of the orders of growth. Given , a compact metric space and a continuous map. We define in the distance
and we denote the dynamical ball as . A set is a -generator if . Given the compactness of M, there always exists a finite -generator set. Then, we define as the smallest possible cardinality of a finite -generator. If we fix , then is an increasing sequence of natural numbers, and therefore, . For a fixed , if , then , and therefore, in . We consider the set , and the generalized entropy of as
This object is a dynamical invariant.
Theorem 2.1 (Correa-Pujals).
Let and be two compact metric spaces and , , two continuous maps. Suppose there exists , a homeomorphism, such that . Then, .
We also define the generalized entropy through the point of view of -separated. We say that is -separated if , for all . We define as the maximal cardinality of a -separated set. Analogously, as with , if we fix , then is a non-decreasing sequence of natural numbers. Again, for a fixed , if , then , and therefore, . If we consider the set , then
For a final comment on this topic, the generalized entropy of a map can also be defined in compact subsets that may not be invariant. Given , a compact subset, the definition of as the minimal number of -balls (centered at points in ) that are needed to cover also makes sense. With it, we can define as the generalized entropy of in .
Now, let us explain how the generalized topological entropy is related to the classical notion of topological entropy and polynomial entropy. Given a dynamical system , recall that the topological entropy of is
and the polynomial entropy of is
We define the family of exponential orders of growth as the set and the family of polynomials orders of growth as the set . In [5], the authors defined two natural projections, and , for which the following theorem holds.
Theorem 2.2 (Correa-Pujals).
Let be a compact metric space and , a continuous map. Then, and .
2.2. Infinitely re-normalizable systems of the disk
Let us begin with the definition of mildly dissipative systems. Throughout this subsection, we are going to work with maps in , the space of embeddings of the disk . A map is dissipative if for every . When is dissipative, every ergodic measure has at least one negative Lyapunov exponent. In this scenario, almost every point has a Pesin stable manifold and we call the connected component in , which contains . We say that is mildly dissipative if for every ergodic measure that is not supported on a hyperbolic sink, and for almost every point, splits the disk in two.
Given , we say that it is infinitely re-normalizable if there exists a sequence of families of disks such that
-
(1)
Every is contained in some .
-
(2)
For every , there exists an integer such that .
-
(3)
For a fixed , the discs for and are pairwise disjoint.
-
(4)
The times tends to infinity.
-
(5)
There is no periodic point in the border of any disk .
The standard geometry property is that the diameters of tend to uniformly.
For each , let us consider , and for each , we define . In [7], the authors prove the following theorem.
Theorem 2.3 (Crovisier-Pujals-Tresser).
Given mildly dissipative with zero topological entropy, if it is in the border of chaos, then it is infinitely re-normalizable. Moreover, the non-wandering set of outside consists of periodic points with a period smaller or equal to .
2.3. Coding of orbits
Now, we proceed to extend the coding of the orbits done in [9] to dynamical systems whose non-wandering set is finite, and we translate it to the language of generalized entropy simultaneously. Let us consider a compact metric space and a homeomorphism such that . Let be a finite family of non-empty subsets of . We denote by the union of all the elements of and by the complement of . Let us fix a positive integer and consider a finite sequence of points in and a finite sequence of elements of . We say that is a coding of , relative to , if for every , we have . Whenever the family is fixed, we simplify the notation by using instead of . Note that if the sets of are not disjoint, we can have more than one coding for a given sequence. We denote the set of all the codings of all orbits of length by . We define the sequence , and it is easy to see that .
Example 2.4.
Let be the translation . To fit our setting, we consider the compactification of the plane by one point (), obtaining and a map such that . As we have to work with the subsets of for our coding, we may as well keep working on . Let be a compact subset of and let us suppose that its diameter is less than . Then, we can see that . Indeed, the elements of are exactly all the words of the form , and therefore, it contains elements. In case has a diameter greater than one, it can easily be observed that the equality still holds.
Example 2.5 (Reeb’s flow/Brouwer’s counter-example).
Consider the map , the time-one map of Reeb’s flow (see figure 2.1). We recall that this map is a classical example of a Brouwer homeomorphism that is not conjugated to a translation. Again, we can compactify to the sphere and extend to the map whose wandering set is only the fixed point at infinity. Again, we shall keep working in . Let be two disks, not containing the origin, whose interiors meet the lines and , respectively. To simplify the computation, we assume the disks are small enough for them to not intersect any of their respective forward images. Note that if and are chosen such that for all , then the elements of are exactly all the words of the form
Thus, and .
We say that a set is wandering if for every . We say that is a compact neighborhood if it is compact and is the closure of an open set. We say that the subsets of are mutually singular if, for every , there exists a point and times such that for every , and for every . Note that in the previous example, sets are mutually singular.
Let us call a family of finite families of wandering compact neighborhoods that are mutually singular. Given , we define as the subset of formed by every family whose every element has a diameter smaller than . Now, we present a more precise statement of theorem 2.
Theorem 2.
Let be a compact metric space and a homeomorphism such that is finite. Then,
In addition, the equation also holds if we switch by .
3. Proof of theorem 1
We use theorem 2 to prove theorem 1. However, the proof of theorem 2 is more technical and since the proof of theorem 1 has more geometrical components, we choose to prove 1 first and show the proof of theorem 2 later. At the end of this section, we provide a proof of corollaries 1, 2, 3 and 4.
Let us consider a compact surface and a Morse-Smale diffeomorphism. As we are in dimension two, we have three possibilities for the hyperbolic periodic points. They are either sinks, sources or saddles of index 1. Using theorem 2, we need to first compute for finite families of disjoint, mutually singular compact neighborhoods, and then take the supremum over such families. Our following lemma tells the location of the sets of any .
Lemma 3.1.
Given , there exist orbits of periodic points such that and . Moreover, if the diameter of the elements of is small enough, then .
The following figure represents the above-mentioned lemma.
Proof.
The property of to be mutually singular creates long segments of orbits whose endpoints belong to and . The accumulation of such segments contains an invariant set; therefore, it must contain a periodic orbit . Now, the endpoints in must accumulate over the stable manifold of , and the endpoint in must accumulate over the unstable manifold of . As all the elements of are compact, we conclude the first part of the lemma.
Now, we shall prove the second part of the lemma. Note that if the unstable manifold of a periodic saddle does not intersect the stable manifold of , yet it accumulates it, then any point in said stable manifold would be non-wandering. This can be seen with the help of Hartman-Grobman’s theorem. As is Morse-Smale, this can not happen. We thus conclude the existence of a positive such that if , then . As we can choose the elements of with an arbitrarily small diameter, we conclude the proof of the lemma. ∎
Given , take and consider the periodic orbits from lemma 3.1. Note that any point in the intersection between and the stable manifold of must also belong to the unstable manifold of some periodic orbit . Therefore, induces a path of length in the graph constructed in the introduction, particularly .
Lemma 3.2.
Let us consider a compact metric space and a homeomorphism. Given , take . Then, .
By applying the above lemma to our previous reasoning, we infer that , and by theorem 2, we conclude . Thus, it only remains for us to prove the other inequality, for which we only need to find a family with elements such that . Before moving on, we prove lemma 3.2.
Proof lemma 3.2.
For a given subset , we define as the set of all the words of the form
with letters. By definition of , we know that
Each set of represents the combinations of distinct objects taken at a time. Therefore, , which is a polynomial in of degree . As there are finite (for a fixed ) and the largest possible degree is , we conclude that . ∎
In the context of a homeomorphism such that its non-wandering set is finite, it is easier to work with the assumption that every periodic point is indeed a fixed point. However, to make such an assumption, we need to develop two notions: the bounded jump property and -combinatorially complete.
We say that a class of orders of growth verifies the bounded jump property if there exists a constant such that . Note that this definition does not depend on the choice of the class representative. We recall that a set is syndetic if there exists such that for all , the interval contains at least one point of .
Lemma 3.3.
Let us consider a compact metric space and a homeomorphism whose non-wandering set is finite. Given , the class verifies the bounded jump property.
Lemma 3.4.
Let us consider an order of growth that verifies the bounded jump property, a syndetic set and a sequence . If there exist two constants and such that for all , then .
The first lemma tell us that always verifies the bounded jump property. The second lemma tell us that if we know an order of growth in a syndetic set and said order of growth verifies the bounded jump property, then we understand the order of growth in . For example, if we prove that for every , then .
Proof of lemma 3.3.
We consider and . Given , we define the map that removes the last letter from the word . The map is surjective, and every has at most pre-images. Therefore,
∎
Proof of lemma 3.4.
Let us fix and choose such . Observe that
and
From both equations, we conclude . ∎
Given , we say that it is -combinatorially complete if there exist such that for every with divisible by , there are points with the property . If is 1-combinatorially complete, we say that it is combinatorially complete.
Let us consider such that every periodic point of is a fixed one. Note that if , then also belongs to . Our following two lemmas explain why we can work with a map that has only fixed points.
Lemma 3.5.
Given , if is combinatorially complete for , then is -combinatorially complete for .
Lemma 3.6.
Given , we take . If is -combinatorially complete for , then .
We proceed now to prove both lemmas.
Proof of lemma 3.5.
Suppose that is combinatorially complete for . Take associated to said property and define . For each , we take such that is divisible by . This is for some . As is combinatorially complete for , there exist such that for every . It is simple to see that , and therefore, is -combinatorially complete for . ∎
Proof of lemma 3.6.
Suppose that is -combinatorially complete and take . Consider the syndetic set . For each , we define as the set of words in , which verifies the following:
-
•
Each word is associated with a segment of an orbit of a point from the -combinatorially complete property.
-
•
Every letter appears once.
-
•
If is such that , then for every , there exists such that and has the form
The property of -combinatorially complete in conjunction with the proper selection of a segment of an orbit tells us that for any with , there exists with the form mentioned in the previous equation. Let us consider as in the proof of lemma 3.2 and the map defined as follows:
Our previous observation implies that is a bijection. We know that , which is a polynomial in of degree , and as where and are constants, we conclude that is a polynomial in of degree . From this, we deduce the existence of a constant such that for all . On the other hand, by lemma 3.2, we know there exists such that for all ; finally, by lemma 3.4, we conclude that . ∎
We are now in a condition to prove theorem 1
Proof of theorem 1.
As explained before, as a consequence of lemma 3.1 and lemma 3.2, we know that . We take such that every periodic point of is indeed a fixed point. By lemmas 3.5 and 3.6, if we construct a family that is combinatorially complete for and has elements, then we have finished. Note that lemma 3.1 tell us from where we should pick the elements of .
To simplify our notation, we may assume that . That is, from now on, map contains only hyperbolic fixed points in the non-wandering set. Let us take such that for all . From this, it is simple to observe that is a source, is a sink and every other is a saddle. Otherwise, we could extend the path, which is absurd based on our choice of .
Let us begin by considering , which are the linearizing neighborhoods of , respectively. Note that we can assume them to be homeomorphic to a ball in . Given a saddle point, there is one connected component of that intersects and one connected component of that intersects . Both of these components define a quadrant in , which we shall call .
Now, for each , we take a point in the intersection between that also belongs to . For said , we consider and as two small curves such that:
-
•
both of them have as an endpoint.
-
•
and and for some .
Once and are defined, we construct and as two curves and , thus verifying the following:
-
•
The border of is the union of , , and .
-
•
.
-
•
The angle between the curves in each endpoint is not 0, does not meet , and does not meet . Therefore, is a ”rectangle”.
-
•
There exist some such that .
For the last point to hold, we shrink the curves (and, therefore, ) if necessary.
The choice of and the position of and was necessary to assure that the forward iterates of intersect .
This process defines from up to , and we finish it by defining as a rectangle-like compact neighborhood in , for which one of the curves that define its border is contained in . For this case, and .
We say that a compact neighborhood is a horizontal strip if its border is formed by curves such that two of them are contained in and . Then, we define a vertical strip analogously. It is simple to observe that in the same , any horizontal strip intersects any vertical strip in a non-empty compact neighborhood.
Now, we proceed to study the transition maps between and . For each , we consider the set and define the map such that , where is such that . For a fixed , we call as the set of points in such that . Recall that and are subsets in , which is a linearizing neighborhood of . From this, it is simple to observe that there exists some such that is a vertical strip in and is a horizontal strip in for all .
Next, we fix and for each for . We consider the set
If we prove that for any tuple , the set is not empty, we have proved that is combinatorially complete, and from this, the theorem follows.
Let us fix the intermediary sets as follows:
We prove by induction that each aforementioned set is a non-trivial vertical strip in ordered by inclusion. By our definition, because . In addition, note that is a horizontal strip in .
Our inductive hypothesis is that is a non-empty vertical strip in and is a horizontal strip in . Take and recall that is a vertical strip in . Then, is not empty. As it is a vertical strip in , its pre-image by is a vertical strip in . This set is, in fact, . On the other hand, we also know that
which is now a horizontal strip in . Then, is also a horizontal strip in . With this, is a horizontal strip in .
This brings us to the end of the proof of claim and, with it, the proof of theorem 1. ∎
Proof of corollary 1.
If is such that , then . Since is Morse-Smale, it must always have at least one source and one sink, and it cannot have a saddle point; otherwise . Note that for any sink, the stable manifold is an open set homeomorphic to and the stable manifold of any source is only the source. Since the stable manifolds of the periodic points form a partition of the surface (that is connected), would not be a compact manifold if we had more than one source and one sink. Further, because we have one source and one sink, is the union of an open set homeomorphic to and a point, and therefore, and has a North-South dynamic naturally. ∎
Proof of corollary 2.
Let us consider the families of disks as in subsection 2.2 and define the open sets associated to said families. We fix an and take an that is big enough such that for all . Let us take as the closure of the complement of and . Since the open sets are periodic, given any , we can cover with -balls. This means that adds to only a constant that does not depend on . Therefore, and then,
Since for all , we conclude that
Further, We would like to point out that as the Hausdorff limit of the periodic points is in the set , the non-wandering set of in only consists of finite periodic points. As is Kupka-Smale, we can extend to a map on disk with a periodic sink. Clearly and can be constructed differentiable, thereby obtaining that is a Morse-Smale embedding of the disk. In this case, grows to infinity with , and by theorem 2, we conclude
Let us now show that the Kupka-Smale are dense in the class of infinitely re-normalizable. We need to show that we can realize the classical perturbations of Kupka’s theorem without breaking the infinitely re-normalizable condition. We take and define as the set of periodic points in . Although may not be finite, the periods of said points are bounded. As there are no periodic points of in the border of , we can perturb , obtaining such that
-
(1)
the distance between and is smaller than .
-
(2)
the support of the perturbation lies in the interior of .
-
(3)
all periodic points in are hyperbolic.
-
(4)
all intersections of stable and unstable manifolds between the periodic points in are transverse.
For the final property, we observe that to obtain the transverse condition, the perturbation can be done near the periodic points. The second property is key because the periodicity of the disks remains, and therefore, is also infinitely re-normalizable.
Next, we construct a family of maps by inductionally verifying the following:
-
(1)
The periodic discs are periodic for for all and all .
-
(2)
The distance between and is smaller than .
-
(3)
The support of the perturbation from to is contained in .
-
(4)
All the periodic points in are hyperbolic, and the intersections between their stable and unstable manifolds are transverse.
The construction is straightforward. The key elements of this construction are that there are no periodic points in the border of and the periods are bounded and that to obtain transversality, we can perturb near the periodic points. In the inductive step, once we have all the periodic points in hyperbolic, we perturb to obtain transversality not only among them but also with the ones in .
We finish by taking as the limit of . The infinitely re-normalizable property is preserved, as the disks are also periodic for . By our choice in the support of the perturbation, the periodic points of in are the periodic points of in and are, therefore, hyperbolic. Moreover, every intersection between a stable and unstable manifold is transverse.
∎
Proof of corollary 3.
Based on corollary 2, we know that , and using theorem 1, we only need to show that . Let us take , and as before. Given , there exists some integer such that the periodic points of periods smaller than belong to a neighborhood of . The fact that is Kupka-Smale implies that these points are finite. If is close enough to , all of these periodic points must have a continuation in and the intersection between the stable and unstable manifolds shall remain non-empty if it happened for . Therefore, is at least , which, as explained earlier, grows toward infinity. ∎
4. Proof of theorem 2
The main objective of this section is to prove theorem 2. The proof is split in two inequalities. The first one,
is deduced from the following lemma.
Lemma 4.1.
For any , let . Then, there exists such that
The proof of the second inequality,
is split in three steps. Each one is a separate lemma and we shall enunciate them as follows.
Lemma 4.2.
Given and , there exists a family of wandering compact neighborhoods and a constant such that for all and . Moreover, can be chosen such that if , then is also a wandering set.
Lemma 4.3.
Given a family of wandering compact neighborhoods as in the previous lemma, the following equation holds.
Lemma 4.4.
Given a finite family of disjoint wandering compact neighborhoods, the following equation holds.
We would like to comment that in the last two lemmas, lemmas 4.3 and 4.4, the equality actually holds. However, we only need the inequality in the direction we stated, and this simplifies our proofs. These two final lemmas are glued together in the proof of theorem 2 by a technical result in .
Lemma 4.5.
Let us consider for each a finite set . Then,
Before we prove the lemmas, we would like assume them to be true and conclude the proof of Theorem 2.
Proof of theorem 2.
For any , we know by lemma 4.1 that . When the supremum is taken over , we deduce that
For the other inequality, let us take . By lemma 4.2, we obtain a finite family of wandering compact neighborhoods such that . We apply lemma 4.3 to said family, and we see that
For each formed by disjoint sets, we apply lemma 4.4 and lemma 4.5 to conclude
Therefore,
as this happens for every , when we take the supremum over , we infer our final inequality. The switch of by is possible because in lemma 4.2, we can select a family in which every element has a diameter less than . This concludes the proof of theorem 2. ∎
Having proven theorem 2, we now move to proving the previously stated lemmas. We would like to highlight that the proof of lemma 4.1 is contained in the proof of Lemma 2.4 in [9]. As the proof of our result uses only a fraction of their proof, we decided to include it in this manuscript, although the adaptations are minor. In the proof of lemma 4.2, we find the technical jump from a non-wandering set with only one point to finite non-wandering set. The idea to solve this is completely new. For the proof of lemmas 4.3 and 4.4, something similar happens to lemma 4.1, yet in this case, the technicalities of working in are deeper; therefore, we feel compelled to include said proofs.
Proof of Lemma 4.1.
Let be a disjoint family of the subsets of and choose some compact disjoint wandering neighborhoods of the elements , respectively. Let be smaller than the distance from to the complement of for every .
Fix some positive integer . For every , let denote a set of elements of whose set of letters is exactly . We fix some and we consider two points in and two words , in , which represent the orbits and , respectively. Then, we claim that if the symbols and are distinct, points and are -separated. Indeed, let be such that . If both , , then and belong to the distinct sets of , and they are more than apart. If, say, , then and . By definition of , there exists some in such that . As is wandering, we see that ; thus, yet again, and are more than apart, and the claim is proved.
As an immediate consequence, we deduce . Since the sets form a partition of into elements, we infer
as we wanted. ∎
Proof of lemma 4.2.
Let us suppose that . We want to show that for every , there exists a finite family of wandering compact neighborhoods of and a constant such that , for every . Given , let be a family of wandering subsets of with diameters less than and such that each connected component of contains a point and has a diameter of less than . Let us denote such components as . If necessary, we could reconstruct the family to ensure the property, if , then is wandering. This is not required in this lemma, but it will be in the next one.
We choose a positive integer and consider a maximal -separated set . Let be the map that associates for every point in some coding of the sequence with respect to the family . Although the map may not be injective, we will show that the cardinality of set is bounded by a constant that does not depend on , for every word .
To prove the previous assertion, we construct an auxiliary graph . Its vertices are given by the set , and the edges are the set of pairs such that .
Note that satisfies the following properties:
-
(1)
There is no edge of type , as is a wandering set for every . More generally, there is no path in graph with both initial and final vertices .
-
(2)
If is small enough and there exists an edge of type , then there is no edge of type with . To see this, let . By the uniform continuity of , we know that there exists , such that implies , for every . If we choose , then for every , we see .
-
(3)
If is small enough and there exists an edge of type , then there is no edge of type with . That is, in the edges of type , each is in only one edge as the initial vertex and in only one edge as the final vertex.
Recall that a path in graph is a finite sequence of edges of the form
where . The number of edges in a path is called its length. A path in which all the edges are distinct is a trail. We shall simplify the notation by describing an edge in as .
Let us consider as the set of all paths in with length and that the map is defined as follows: associates a path to every point such that for .
We claim that the map is injective. In fact, consider such that . As the diameter of the sets is less than , we see that for all , and therefore, .
Now, consider the map defined as follows: For each path , where , the map associates a word and each is given by
Observe that we can choose the map such that .
Let us consider as the set of all the trails in . Given a path , we select from the edges by induction as follows: and . With this, we construct a new path for some . This process eliminates the repeated edges of , transforming the path with edges into a trail in with the same edges. Therefore, we construct a map , which removes repeated edges. In particular, for our case, by properties 1, 2 and 3, the map eliminates only the edges of type .
The following diagram adds the new map to the previous one.
We assert now that for each word , the restriction of the map is injective. Let us assume the assertion for now and observe that for every word :
As the graph is finite and is a constant that does not depend on , let us denote it by . Thus,
Then,
Now, the assertion needs to be proved that for each word , the restriction of the map is injective.
Let and be two paths in such that and . We want to show that . If we write
let for be an edge of the path . Then, we have three possibilities.
-
1.
is an edge of type :
Since , we know that and . Thus, .
-
2.
is an edge of type :
This type of edge does not repeat and is, therefore, not eliminated by the map . Thus, we infer that , for some , is an edge of , and therefore, .
-
3.
is an edge of type :
-
–
If this edge is not eliminated by the map , then we know that , for some , is an edge of , and thus, .
-
–
If this edge is eliminated by the map , then we consider the previous edge
-
–
If , then the edge will not be eliminated by the map , and we deduce that , for some , is an edge of . Therefore, .
-
–
If , then it may or may not be eliminated by the map . If it is eliminated, then we repeat the argument until we obtain for some , which is not eliminated by the map . This must happen because the paths have a finite length.
-
–
-
–
In all cases, we conclude that the edges of the paths and are necessarily the same, as we wanted. ∎
Proof of lemma 4.5.
Suppose that for every . It is easy to see that , for all , for all . Then, , for all , and
On the other hand, for all , we know , and
∎
Lemma 4.6.
Let , then
Proof.
We know that and . Then . However, if we suppose
then there exists such that
As , and by definition, then . Using the same argument, we also deduce . Thus, there must exist constants such that and . Let and observe that . This implies , a contradiction. Therefore,
as we wanted. ∎
We would like to point out that may not be either or but, in fact, a third order of growth. It is only one of them when they are comparable according to the partial order. The previous proposition happens to only be true when we consider the supremum of a finite set of orders of growth. Otherwise, we could have that the supremum is an element of .
Lemma 4.7.
Let be a finite family of subsets of . If is such that is wandering, then
where and .
Proof.
Proof of lemma 4.3.
Let us consider a finite family of wandering compact neighborhoods of such that if meets , then is a wandering set.
If is disjoint, , and then, .
Otherwise, we select two distinct elements that intersect. To simplify the notation, we can name them and . Then, by lemma 4.7, we know that
where and . If and are both disjoint, we see
and we conclude. If either or is not a disjoint family, we apply the previous reasoning to each. Let us suppose that both of them are not disjoint families. Based on the previous argument, we construct four families , , and such that
From lemma 4.5, we deduce that
We can repeat this process until every family in the on the right side of the inequality is disjoint, and therefore,
∎
Proof of Lemma 4.4.
Let us consider a finite family of disjoint wandering compact neighborhoods that is not mutually singular. We will show that can be calculated in terms of its subfamilies that are mutually singular. The lemma follows by a finite backward induction, as only one set is always mutually singular.
We assume that is not mutually singular. Like in the proof of lemma 4.1, for every , we denote as the set of elements of whose set of letters is exactly . In particular, the elements of use the same letters and . As the ’s are wandering, each letter except appears at most once; thus,
As the ’s are not mutually singular, there exists a number such that if a point satisfies and , then . For every , denote the set of elements of by such that the letters and appear at places at most apart. We know
and
Then,
Thus,
Moreover, for each positive integer , if is an element of , let be obtained from by changing the letter ‘’, which appears exactly once in , to ‘’, and is uniquely determined. Since is a disjoint family, we infer , where . The word also contains the letter ‘’, and the letter ‘’ is at most places apart. Thus, has at most inverse images under the map . Then, we deduce that
Thus,
and therefore,
Since each , we see that
As explained in the beginning of the proof by a backward induction and lemma 4.5, we deduce an inequality, where the left side has and the right side has only families that are mutually singular. This concludes the lemma. ∎
References
- [1] A. Artigue, D. Carrasco-Olivera, and I. Monteverde, Polynomial Entropy and Expansivity, Acta Math. Hungar. 152(1) (2017), 152-140.
- [2] P. Bernard and C. Labrousse, An entropic characterization of the flat metrics on the two torus, Geom. Dedicata 180(1) (2014), 187-201.
- [3] M. J. D. Carneiro and J. B. Gomes, Polynomial entropy for interval maps and lap number, Qual. Theory Dyn. Syst. 20 (2021), 1-16.
- [4] A. De Carvalho, M. Lyubich, and M. Martens, Renormalization in the Hénon Family, I: Universality But Non-Rigidity. J. Stat. Phys. 121(5-6) (2005), 611-669.
- [5] J. Correa and E. Pujals, Orders of growth and generalized entropy, J. Inst. Math. Jussieu (2021), 1-33.
- [6] S. Crovisier and E. Pujals, Strongly dissipative surface diffeomorphisms, Comment. Math. Helv. 93(2) (2016), 377-400.
- [7] S. Crovisier, E. Pujals and C. Tresser, Mildly dissipative diffeomorphisms of the disk with zero entropy, Preprint (2020) arXiv:2005.14278.
- [8] J. Gambaudo, S. van Strein, C. and Tresser, Henon-like maps with strange attractors: there exist C∞ Kupka-Smale diffeomorphisms on S2 with neither sinks nor sources, Nonlinearity 2(2) (1989), 287-304.
- [9] L. Hauseux and F. Le Roux, Entropie polynomiale des homéomorphismes de Brouwer, Annales Henri Lebesgue 2, (2019), 39-57.
- [10] J. Katić and M. Perić, On the polynomial entropy for Morse gradient systems, Math. Slovaca 69(3) (2019), 611-624.
- [11] C. Labrousse, Flat metrics are strict local minimizers for the polynomial entropy, Regul. Chaotic Dyn. 17(6) (2012), 479-491.
- [12] C. Labrousse, Polynomial growth of the volume of balls for zero-entropy geodesic systems, Nonlinearity 25(11) (2012), 3049-3069.
- [13] C. Labrousse, Polynomial entropy for the circle homeomorphisms and for nonvanishing vector fields on , Preprint (2013), arXiv:1311.0213.
- [14] C. Labrousse and J. P. Marco, Polynomial entropies for Bott integrable Hamiltonian systems, Regul. Chaotic Dyn. 19(3) (2014), 374-414.
- [15] J. P. Marco, Polynomial entropies and integrable Hamiltonian systems, Regul. Chaotic Dyn. 18(6) (2013), 623-655.
- [16] S. Roth, Z. Roth and L. Snoha, Rigidity and flexibility of polynomial entropy, Preprint (2021), arXiv:2107.13695.