A Full Study of the Dynamics on One-Holed Dilation Tori
Abstract
An open question in the study of dilation surfaces is to determine the typical dynamical behavior of the directional flow on a fixed dilation surface. We show that on any one-holed dilation torus, in all but a measure zero Cantor set of directions, the directional flow has an attracting periodic orbit, is minimal, or is completely periodic. We further show that for directions in this Cantor set, the directional flow is attracted to either a saddle connection or a lamination on the surface that is locally the product of a measure zero Cantor set and an interval.
1 Introduction
Translation surfaces are geometric surfaces that are locally modeled by the plane with structure group the group of translations. One way to think about translation surfaces is to view them as collection of polygons in the plane with pairs of parallel opposite sides identified by translation. An example of a translation surface is shown below in Figure 1.1.
Translation surfaces are well-studied objects with connections to many other areas of mathematics including dynamical systems, algebraic geometry, and mathematical billiards. From the dynamical perspective, there has been much progress made on understanding the directional flow or the directional foliations on given and generic translation surfaces. For example, a celebrated theorem of Kerchoff, Masur, and Smillie [6] proves that on any translation surface, the directional flow in almost any direction is uniquely ergodic.
Dilation surfaces are a natural generalization of translation surfaces. They are newer objects and while much less is known about them, many of the same questions that can be asked about translation surfaces can be also be asked about dilation surfaces. Like translation surfaces, we can think of dilation surfaces as collections of polygons in the plane, now with sides identified not just by translation but by translation and dilation. We call such a representation a polygonal model for the surface.
Directional flows and foliations still exist on dilation surfaces, but one result of this generalization is that the spectrum of possible dynamical behaviors of the straight line flow on a dilation surface is richer and more difficult to understand than on a translation surface.
For example, it is possible to find straight trajectories on dilation surfaces that converge to a periodic orbit, as seen in Figure 1.2. This type of dynamical behavior cannot occur on translation surfaces.
One goal is then to understand the typical dynamical behavior of the straight line flow on a dilation surface, in the spirit of a statement like the theorem of Kerchoff-Masur-Smillie on translation surfaces. In [5], Ghazouani conjectures that on any dilation surface, the directional flow in almost every direction has an attracting and repelling periodic orbit.
Some evidence to support this conjecture has been found by various authors by examining the dynamics on certain families of dilation surfaces. Such examples have been found to match the conjectured behavior. In [1], Boulanger, Fougeron, and Ghazouani study a surface that they call the Disco Surface by leveraging a connection between dynamics on dilation surfaces and the dynamics of a family of maps on the interval called affine interval exchange maps or AIETs for short (for more on AIETs, please see Subsection 2.2). Ghazouani uses an understanding of the broader dynamics on the moduli space of dilation surfaces to investigate the dynamics on twice-punctured dilation tori in [5]. In separate works by Boulanger-Ghazouani [2] and Bowman-Sanderson [3], the authors use different techniques to investigate dynamics on one-holed dilation tori.
Our work builds on the work in these last two papers and furthers the understanding of dynamics on one-holed dilation tori. Boulanger and Ghazouani claim in [2] that on any one-holed dilation torus, there is a full-measure set of directions on which the directional flow accumulates on a set of closed curves and a measure-zero set of directions on which the accumulation set locally looks like a Cantor set cross an interval. They further claim that these results about the dynamics on general dilation tori follow verbatim from analysis of dynamics on the Disco Surface done in [1]. However, we found that the methods used to analyze the Disco Surface did not directly apply to general one-holed dilation tori and that the study of one-holed dilation tori dynamics required more careful analysis. In our first theorem, we expand on the techniques of Boulanger and Ghazouani to carefully prove their claims about one-holed dilation tori dynamics.
theoremcantor Let be a dilation torus with one nonempty boundary component. Then there is a Cantor set of measure zero , such that the straight line flow on in any direction in beginning at any noncritical point accumulates to a closed orbit in .
We see from the above theorem that for almost every direction on any one-holed dilation torus, the directional foliation is simple to understand: it accumulates on a closed orbit or saddle connection. There is also a single direction in which the flow might be completely periodic or minimal.
What is perhaps more interesting is the dynamics in the remaining Cantor set of directions . We will see that the set of directions splits into three sets with different behaviors.
A lamination of a dilation surface is a nowhere-dense closed union of parallel trajectories. On a portion of the set of directions, the straight line flow will accumulate to a lamination whose cross-section is a Cantor set. This dynamical behavior of Cantor-accumulation was also claimed to exist by Boulanger and Ghazouani in [2]. Our contribution is then to prove this carefully and to show using new techniques that the Cantor set cross-section of such a lamination is always measure zero.
theoremdynamics The Cantor set of directions defined in Theorem 1.2 for a one-holed dilation torus splits into three sets with the following dynamical behaviors:
-
•
The direction is the direction parallel to the boundary of . In this direction, the straight line flow can be minimal, can accumulate to a periodic trajectory, or can be completely periodic.
-
•
The set of directions is a countable set. In directions in , the straight line flow on accumulates onto a saddle connection.
-
•
In directions in , the straight line flow on accumulates to a lamination of whose cross-section is a measure zero Cantor set.
The proof of the statement that these Cantor sets are measure zero relies on new techniques involving the measures of certain sets under finitely many iterates of an associated AIET. Through the analytic properties of how these measures change as we vary the parameters of the underlying AIETs, we can better understand the measures of these limiting Cantor sets.
2 Background
In this section, we provide some background on dilation surfaces and affine interval exchange maps. Much of the motivation for studying dilation surfaces comes from the wealth of knowledge about their cousins, translation surfaces. There are many wonderful introductions to translation surfaces. We refer an interested reader to [8] or [10].
2.1 Dilation surfaces
In line with [1], we define dilation surfaces in the following way:
Definition 2.1 (Dilation Surface).
A dilation surface is a surface with a finite set of cone points and an atlas of charts on whose transition maps are restrictions of maps for , . We require that punctured neighborhoods of around points of be homeomorphic to some -sheet covering of .
We can always find a polygonal model for the dilation surfaces of interest: a collection of polygons with sides identified in parallel opposite pairs by translations and/or dilations by real factors. For our purposes, we allow dilation surfaces to have boundary components which have no identifications. Some examples are found in Figures 2.1 and 2.2.
We can then consider the set of directions on the surface. For each direction , the foliation on by lines of slope is called the directional foliation of in direction . The leaves of the directional foliation are the orbits of points under the straight-line or geodesic flow in direction . Leaves which intersect a cone point terminate at that point. We call these leaves critical. A leaf that intersects cone points on both ends is called a saddle connection.
We are interested in the long-term dynamics of the geodesic flow on . For a given directional foliation, we want to describe the -limit (forward limit) and -limit (backward limit) sets of each noncritical leaf. For general dilation surfaces, this is a difficult task. In [5], it is conjectured that generically the foliations are Morse-Smale, i.e. attracted to closed leaves:
Definition 2.2 (Morse-Smale).
A foliation is Morse-Smale if it has a finite collection of closed leaves such that the -limit set of any leaf of the foliation is one of these leaves, and the -limit set of any leaf of the foliation is one of these leaves.
Conjecture 2.3 (S. Ghazouani).
Let be a dilation surface which is not a translation surface. The collection of directions in with Morse-Smale directional foliations is full measure.
Note the assumption that not be a translation surface. In the case that is a translation surface, i.e. all transition maps of the atlas take the form , then the generic behavior is determined in [6]:
Theorem 2.4 (S. Kerchoff, H. Masur, J. Smillie).
Let be a translation surface (without boundary). There is a full measure set of directions in whose directional foliations have leaves which are uniquely ergodic.
In particular, such leaves are minimal and equidistributed. This is in stark contrast to the generic Morse-Smale behavior conjectured for dilation surfaces above. While a full proof of the conjectured generic dynamical behavior still seems far-off, it is possible to ascertain generic Morse-Smale behavior for simple classes of dilation surfaces. To do so, we pass to the machinery of affine interval exchange transformations.
2.2 Affine Interval Exchange Transformations
To study dynamics of the straight line flow on a dilation surface, it sometimes helps to consider instead the dynamics of the first return map on a transversal to the flow. As we will see, this first return map will be an example of an affine interval exchange transformation. In this way, we can pass from studying dynamics of a flow on a surface to studying the dynamics of a map on the interval.
This technique of passing to a lower-dimensional dynamical system has also been used extensively in the study of translation surfaces. In the case of translation surfaces, the first return map to a transversal is an interval exchange transformation. A good introduction to this subject is [9].
Definition 2.5 (Affine Interval Exchange Map).
An affine interval exchange map (AIET) is an injective map from an interval to itself constructed by breaking up the interval into finitely many pieces and then mapping these pieces back to non-overlapping subintervals of the interval by affine maps for .
Because there is some ambiguity as to where the endpoints of each interval map are mapped, we generally ignore the endpoints when thinking about AIETs.
It is informative to provide some examples of AIETs. We will use a graphical representation with the domain pictured on the top and the range on the bottom. carries each subinterval on top to the corresponding subinterval on bottom by an affine, orientation-preserving mapping. In Figure 2.3 we see an example of a surjective AIET where the original interval is split up into three pieces that are then permuted and scaled.
We can also consider AIETs that are not surjective. Figure 2.4 shows an AIET on three intervals where the image intervals do not cover the whole interval again.
To understand dynamics on a dilation surface in a particular direction, it is often sufficient to understand the dynamics of the first return map on a transversal to the direction of flow. In the case when the first return map exists for every point on the transversal, the first return map will always be an AIET. This correspondence is best seen through an example.
Suppose that we wanted to understand the dynamics of the vertical flow on the dilation surface in Figure 2.5. We might instead consider the first return map on the horizontal transversal shown. That is, for every point on the transversal, we let be the point where the vertical flow from on the surface first returns back to the transversal.
If we repeat this process for every point on the transversal, we find that our first return map is the AIET on two intervals in Figure 2.5.
The dynamics of this -AIET directly correspond to the dynamics of the vertical flow on the dilation surface since the vertical flow is a suspension of the -AIET. If the -AIET is minimal, has an attracting periodic orbit or critical orbit (orbit that eventually hits the break point ), is completely periodic, or has some other behavior, then the vertical flow on the dilation surface must have the same behavior. In this way, we have reduced our problem of understanding dynamics on a dilation surface to understanding the dynamics of a corresponding AIET.
3 Flows on a one-holed dilation torus
We aim to study the behavior of straight line flows on a particular class of dilation surfaces known as one-holed dilation tori. By a one-holed dilation torus, we mean a dilation surface with one boundary component, one cone point on the boundary of angle , and no cone points on the interior of the surface. The boundary should be a straight segment connecting the cone point to itself. Topologically, such a surface is a torus with an open disk removed. A typical polygonal model for a one-holed dilation torus is shown in Figure 3.1.
In fact, any one-holed dilation torus has a polygonal model given by a convex pentagon, after a triangulation and a cut-and-paste operation. See Figure 3.2 for an example.
will denote a one-holed dilation torus. To make sure that trajectories do not collide with the boundary, we only analyze the semicircle of directions pointing away from the boundary. We call these the forward trajectories and parameterize them by their slope . We can understand the dynamics of the forward trajectories by studying their first return maps on selected transverse diagonals of .
may be broken into six intervals, each containing directions whose first return maps obey one of four superficial behaviors. The endpoints of these intervals are the directions of certain saddle connections on the surface. In Figure 3.3, each interval is shown with endpoints colored according to their parallel saddle connection. The first “interval” contains only a single direction, that which is parallel to the boundary. We call this direction . The remaining intervals are labeled in clockwise order (behaviors at endpoints will be described by the analysis on either side).
3.1 The boundary-parallel direction
First, we determine the behaviors of the flow in the boundary-parallel direction . This flow is special in that it produces a bijective first return map on a transverse diagonal. We note that it may also be reversed without risk of hitting the boundary. The picture of the first return map of the flow on a diagonal is shown in Figure 3.4.
We find that the first return map is a bijective 2-AIET. In [4], a formula is provided to compute the rotation number of such a map. From the rotation number one can determine the dynamics. If the rotation number is irrational, then the dynamics are minimal. If the rotation number is rational, the dynamics may be either completely periodic or Morse-Smale. Once the dynamical behavior of is understood, the directional flow on is a suspension of this map and shares the same behavior.
3.2 Directions in and
The first return maps on some transverse diagonal to directions in are given by non-surjective 2-AIETs of a specific form. These are maps which swap the two intervals, expand one and contract the other, and place them against the left and right endpoints of the codomain. At first this desired form is not immediately apparent, but we may attain this form after applying the first return map once and restricting to the image. See Figure 3.5 for an example of this discussion.
The dynamics of maps which look like this will be studied in Section 4.4. We note here that maps in are of the same form as those in , except for the choice of which interval expands and which contracts. By reflecting, we will see that the dynamics of maps in will be the mirror image of the dynamics of maps in .
3.3 Directions in and
Trajectories moving in directions from are caught within an immediately present subsurface called a dilation cylinder, an affine cylinder with holonomy across its core curve.
There are two obvious dilation cylinders present in the polygonal model for . The subsurface which consists of the convex hull of the two edges labeled in the polygonal model is the dilation cylinder corresponding to .
This dilation cylinder is seen in the first return map. In Figure 3.6, it is seen that flows in after one iteration only land on the red interval . The first return map is an injective affine contraction, so it has a unique fixed point.
This tells that the forward orbit from any noncritical point moving in a direction in is attracted to a closed orbit in the dilation cylinder. Note also that at each boundary direction of , the directional foliation is attracted to a saddle connection.
Directions in obey similar behavior, captured in the dilation cylinder which is the convex hull of the two edges labeled . We conclude that every directional foliation in the interiors of and converges to a closed orbit.
3.4 Directions in
The directions in have a similar structure to those in and , in the sense that their first return maps are injective 2-AIETs. They swap the two intervals, contracting both, and place them against the left and right endpoints of the codomain. These maps will immediately have the desired structure without needing to restrict to the image. See Figure 3.7.
We call maps like the first return maps in the intervals , , and -maps. These maps will be defined (and their name justified) in the next section. While they are similar in structure to their surjective cousins, found in the boundary-parallel direction, their non-surjectivity leads to wildly different dynamics. To understand the dynamics of flows on dilation tori, it is essential that we analyze the dynamics of these maps in detail.
4 Dynamics of -maps
The main goal of this section is to prove the following theorem.
We will do this by analyzing a family of maps called -maps. We consider two dilation factors . We use an interval as our domain. By a -map, we mean an injective -AIET with the following properties:
-
•
is broken into two intervals and , divided by the point .
-
•
On , the derivative of is .
-
•
On , the derivative of is .
-
•
moves to the right end of , so the right endpoint of is .
-
•
sends to the left end of , so the left endpoint of is .
The final first return maps in Figures 3.5 and 3.7 are examples of -maps.
For fixed , let be the space of -maps. We identify maps up to scaling, and typically represent these equivalence classes of maps by scaling the domain to be . The space can then be parameterized by the point of discontinuity . When , so that both intervals contract, the discontinuities may run over the whole interval without violating injectivity. If one of the intervals is expanding, a subinterval of contains the discontinuity points which parameterize injective maps in (this case is studied in Section 4.4). Any -map can be represented by a diagram like the one in Figure 4.1, where maps the top intervals to the bottom ones:
In order to understand the long-term dynamics of -maps, we introduce an algorithm called Rauzy-Veech induction which exposes the dynamics of these maps. This algorithm is the key ingredient in our proof of Theorem 1.2.
4.1 Rauzy-Veech induction on -maps
Our main tool in analyzing the dynamics of -maps will be a form of Rauzy-Veech induction. Rauzy-Veech induction (often shortened as Rauzy induction) was originally defined for interval exchange transformations (IETs) and is a way of accelerating the dynamics of these maps. This way, we can keep track of the trajectory of a point in the original IET if we understand its trajectory in the accelerated map. For an introduction to Rauzy induction on IETs, see [9].
The Rauzy induction algorithm has also been used by various authors (e.g. [7]) to study surjective AIETs, and in [2], Boulanger and Ghazouani define a version of Rauzy induction for nonsurjective 2-AIETs that we will briefly summarize here.
Let be a -map. We will then consider the first return map of the AIET to a carefully chosen subinterval via a Rauzy induction step. One step of Rauzy induction produces another -map where and are products of the original and . Multiple steps of Rauzy induction starting with a map in then give us a collection of maps in the spaces for integers . This leads us to the following inductive definition of Rauzy induction:
Suppose , let and be the left and right top intervals of respectively, and let be their lengths. There are three possibilities:
-
(1)
-
(R)
(Right Rauzy Induction) , i.e.
Letting , we consider the first return map on . Then:
(recall that we may rescale the domain)
and the lengths become and .
This corresponds to the transformation whereAn example of right Rauzy induction is shown in Figure 4.2.
Figure 4.2: A right Rauzy induction step. is on the left, and the result on the right. -
(b)
(Left Rauzy Induction) , i.e.
Letting , we consider the first return map on . Then:
and the new lengths are whereAn example of a left Rauzy induction step is shown in Figure 4.3.
Figure 4.3: A left Rauzy induction step. is on the left, and the result is on the right.
-
(R)
-
(2)
(Termination) and , i.e. and
Letting , we consider the first return map on . The resulting map has image in , and is a contraction in , so orbits under the map converge to an attractive fixed point in of derivative . The picture is in Figure 4.4.
Figure 4.4: An example of termination. The resulting map has an attractive fixed point.
4.2 Understanding when the Rauzy algorithm terminates
Our goal now is to understand when the process of iteratively applying Rauzy induction to our original -map terminates after finitely many steps, since terminating maps have an attracting periodic orbit or critical orbit (orbit that eventually hits the break point ).
We begin with an empty word and a map . If a Rauzy induction step is possible, we apply the appropriate (R) or (L) induction and record the letter or at the end of . We repeat on the resulting maps either infinitely or until we reach a termination step.
We assume that our initial map is a map of the unit interval to itself. We then parameterize -maps by the position of their breakpoint in . For a finite word , we let be the set of maps that follow the word in their sequence of left and right induction steps. We also let be the set of maps that follow word and whose next step is a termination step.
The outline of our argument will go as follows:
-
1.
We will first consider the contracting case when . In this case, we will explicitly find the intervals of discontinuity points parameterizing those maps in where the Rauzy induction steps follow the sequence of inductions given by the word , or terminate after that sequence.
-
2.
Building off of our work in the previous step, we will find that is uniformly bounded below. Since the set of parameters where the Rauzy induction terminates is constructed like the complement of the middle thirds Cantor set, this bound will show that the terminating parameters form a full measure subset of the interval whose complement is a Cantor set.
-
3.
Finally, we will move on to the case when one of or is greater than . We will find that with the exception of one starting parameter, the Rauzy induction will eventually land us in a terminating case or in a case where our scaling factors and are both contracting. We can then use our work from the case to again conclude that the terminating parameters form a full measure subset of the interval that is the complement of a Cantor set.
-
4.
Using the results in steps 2 and 3, we can lift the attracting orbits on these -maps to attracting orbits on corresponding one-holed dilation tori to provide a proof of Theorem 1.2.
4.3 The contracting case
We start with the case where . Let where we have lengths , for . We can consider a word of length , with , encoding a sequence of Rauzy induction moves. We associate to sequences of integers with and the recurrence
Let be the final term. Then upon applying the Rauzy inductions in to , the resulting map is in . We can define a sequence of length transformation matrices with and
where the and matrices are defined as in Section 4.1, so that the lengths of the final intervals up to scaling are .
Note that the sequence of moves is the valid sequence of Rauzy inductions executed on if and only if . Indeed, if the sequence is invalid then the result of some step will give a negative entry in the length vector. Once one entry of the length vector is negative, it is easy to see that further multiplications by the and matrices keep some entry negative.
Suppose the final matrix is . The following lemma will help us identify the parameters corresponding to a particular set of Rauzy induction moves.
Lemma 4.1.
For any word , the corresponding length transformation matrix has and . Also, . As a consequence, .
Proof.
We will show this by induction. We first note that the lemma is true for . Furthermore, all and have positive determinant, so .
Now we suppose the lemma holds for .
Then has diagonals
and , and off-diagonal entries and .
A similar computation shows the result for , and the result follows by induction. These inequalities are enough to show .
∎
This lemma allows us to identify the -maps which undergo a sequence of Rauzy inductions corresponding to the word :
Proposition 4.2.
Let be the length transformation matrix for the word . The interval of parameters whose corresponding -map may undergo Rauzy inductions corresponding to the word is then
Proof.
Let and let be the -map where and .
sends the initial length vector to .
is a valid sequence of Rauzy steps to apply to if and only if both elements of are nonnegative.
But this says and .
By Lemma 4.1, these two inequalities define the desired interval of parameters .
∎
Within , there is a subset consisting of discontinuity points such that Rauzy induction on the corresponding map terminates after the sequence of moves . In fact, is a subinterval of which may be determined in terms of :
Proposition 4.3.
The interval parameterizing -maps which reach the terminating case (2) after valid Rauzy inductions corresponding to the word is
Proof.
If , then the final transformation after all inductions, , must be in case (2). In terms of interval lengths, this means that and . Using , these inequalities define the desired interval of parameters . ∎
Note that when , . This is because the Rauzy induction algorithm has no ambiguity, there is only one valid induction word of length for any given -map. Let parameterize the set of all -maps which terminate after at most Rauzy inductions, and parameterize the set of all -maps which terminate at all under the Rauzy algorithm. has the same construction as the complement of the Cantor triadic set. Indeed, adds intervals, one within each gap between the intervals in . These gaps are the intervals where . For some -map, might look like the set in Figure 4.5.
For every , since the Rauzy induction terminates after finitely many steps, we can find a periodic orbit for beginning at the attractive fixed point of the final map . This orbit then attracts all other orbits and corresponds to an attracting orbit for the directional foliation on a corresponding dilation surface.
We now check that is of full measure in . This is where we utilize . The following intermediate bound does much of the heavy lifting:
Lemma 4.4.
Let and let . The quantity satisfies
Proof.
We induct on word length. When , , , so .
Suppose the lemma holds when the length transformation matrix is with exponents . Recall that is attained either by multiplying by the right-induction matrix or the left-induction matrix . We can bound the new value of , which we denote as or respectively, as follows.
For , the quantity is . Since ,
For , the quantity is . Since ,
So the bound is preserved under left or right inductions. ∎
With the help of this bound, we may bound below:
Proposition 4.5.
There exists an and such that for all words with , we have . As a consequence, has full measure.
Thus, for any , there is a measure zero Cantor set of break points such that on the complement of , the corresponding map accumulates onto a periodic or critical orbit.
Proof.
In Lemma 4.4, we found that if is the length transformation matrix and , then is bounded as . Using Propositions 4.2 and 4.3, after some algebraic manipulations we find that
We denote the last expression above by . Let .
If our initial word has length , then and another algebraic manipulation shows .
Moreover, is increasing in each index.
Let .
Then for all .
Recall the intermediate sets . Now that we have for all , in every step of the Cantor construction of after the th step we remove at least a proportion of what remains. Then for all , corresponding to the step. As , . This shows that has full measure in .
We have already seen that arises topologically from the same process as the Cantor middle thirds construction, perhaps modulo the endpoints of intervals used in the construction process. Then is a measure zero Cantor set in the set of parameters of -maps on whose complement we have maps with an attracting periodic or critical orbit. ∎
Now, we can bring these results back to the dilation torus to prove part of Theorem 1.2. Recall that on we have yet to understand the dynamics of directional foliations in three intervals of directions introduced in Section 3: , , and . What we have proven thus far handles the dynamics in .
Proposition 4.6.
Let be a one-holed dilation torus. Within the interval as defined in Section 3, there is a full measure set of directions in which the flow is attracted to a periodic orbit or a saddle connection. The complement of this set in is a Cantor set.
Proof.
Directions in point toward the longer sides of the polygonal model, and away from the shorter sides. Then as we saw in Section 3, the first return map is a -map with and . Moreover, as the direction sweeps across , in the first return map and are constant while the discontinuity point sweeps smoothly across . This provides a smooth bijection between and , which in particular preserves the measure zero Cantor set .
Then in , the set of directions whose first return map has an attractive periodic orbit is full measure. These attractive periodic orbits suspend to attractive periodic orbits on . Finally, the remaining directions in a measure zero Cantor set. ∎
4.4 The expanding case
If one of the intervals expands, the methods above need to be adjusted. Without loss of generality, we may assume and .
First, there is the concern of parameterizing by the discontinuity point . A -map with discontinuity point is injective if and only if , i.e. . We can check that Rauzy induction is done on the left when , Rauzy induction is done on the right when , and otherwise Rauzy induction terminates.
So as long as , we find that . In this case, only left induction may occur. If instead , we find that , so all three possible cases of Rauzy induction may occur. In particular, right induction occurs for . We note that this interval makes up a proportion of at most of the original interval.
With this setup, we define a modified Rauzy algorithm for the case where . We begin with a map and let , . We then produce maps inductively by the following algorithm. As we define the algorithm, we inductively show and for each until the algorithm terminates.
-
1.
If , then the only valid step is left induction. We perform left induction on to obtain a map with and .
We repeat the algorithm on .
We record that if then and , so our next step is in case 2.
-
2.
If , we have 3 possibilities:
-
(a)
If the valid step is left induction, we find with and . Then we are in the case with . We already understand the behavior of such maps, so we are done.
-
(b)
If the valid step is termination, we are done.
-
(c)
If the valid step is right induction, we perform right induction on to obtain a map with and .
We repeat the algorithm on .
We record that and .
-
(a)
Lemma 4.7.
Given that is a map with and , every instance of a case 1 step in the modified Rauzy algorithm must eventually be followed by a case 2 step.
Proof.
We suppose the th step of modified Rauzy induction lands in case 1. Then, for the th subsequent consecutive step which lands in case 1,
Since , if every step after the th lands in case 1, then eventually which contradicts the condition to be in case 1. Hence, there must exist some th step for that lands in case 2. ∎
Proposition 4.8.
If and or and , then there exists a measure zero Cantor set of break point locations such that every map with break point in has flow attracted to a periodic or critical orbit.
Proof.
We first consider the and case. By symmetry, the and case will follow similarly.
We wish to find a measure zero Cantor set such that every -map with break point has an attracting periodic or critical orbit.
We let the sequence of maps under the modified Rauzy induction algorithm be and we will adopt the convention that we do not rescale the intervals on which are defined during induction. So each and each . We notice then that the location of the break point of the map is an affine function of that depends on what case the previous step was in.
The algorithm never terminates in case 1 and by Lemma 4.7, every case 1 step is eventually followed by a case 2 step. We thus can restrict our attention to the case 2 steps.
We let be the first time that we perform a case 2 Rauzy induction. That is, has that . Then, the possible values are in a bijective affine coorespondence with the values of our original map . Upon rescaling intervals to have length , the and are in a smooth bijective correspondence. In particular, Cantor sets of values correspond to Cantor sets of values and vice versa.
We have already observed that the interval of possible values in a case 2 step breaks up into three intervals corresponding to case 2(a), 2(b), and 2(c) in that order from left to right. On the 2(a) interval, by Proposition 4.5, we have a measure zero Cantor set of parameters on whose complement the map has an attracting periodic or critical orbit since and . has an attracting periodic or critical orbit on all of 2(b). On 2(c), we must continue the Rauzy algorithm. Thus, our original interval of values also breaks up into three intervals from left to right with the same behaviors. We let be the measure zero Cantor set in the first interval given by Proposition 4.5.
We can then repeat this process, focusing now on the interval and note that if step is the next time that we are in case 2, then at that step will further break into three intervals . We again have a Cantor set such that on the and on , has an attracting periodic or critical orbit. We repeat this process inductively with our third intervals .
We recall our observation that if the th step is in case 2, then the proportion of the set of parameters that lands in case 2(c) is at most . Each , so the set of parameters that reach case 2(c) infinitely often has size at most
Thus, this set of parameters is just the right endpoint . We let This is the countable union of measure zero Cantor sets and one point that is a limit point of these Cantor sets. Thus, is also a Cantor set.
We have seen that every -map with break point in ends in a terminating Rauzy induction step after finitely finitely steps and so has flow attracted to a periodic or critical orbit. ∎
We now have all of the tools that we need to prove the main theorem of this section.
Proof of Theorem 1.2.
By Proposition 4.6, there is a Cantor set in the interval of directions introduced in Section 3 off of which our -map has an attracting periodic or critical orbit. This corresponds to an attracting periodic cycle or saddle connection for the directional flow on our one-holed dilation torus. On the intervals and , Proposition 4.8 gives us Cantor sets and off of which the corresponding -maps again have an attracting periodic or critical orbit. This implies that the straight-line flow on in these directions accumulates on a periodic orbit or a saddle connection.
We also saw in Section 3.3 that the straight line flow in the whole interval of directions and has an attracting periodic orbit or saddle connection. Thus, letting , which is a union of three disjoint Cantor sets and is thus a Cantor set, we see that in every direction of , the straight line flow on accumulates to a periodic orbit or saddle connection. ∎
5 Dynamics of maps in
We have determined a Cantor set of directions outside of which the dynamics are already understood. In this section, the goal is to prove the following theorem:
The direction was handled in Section 3.1. For the other directions, it suffices to prove an analogous statement for the first return map to a transversal. This reduces to understanding the dynamics of -maps.
We will continue with the assumption that and that . Let be a -map whose discontinuity point is in this Cantor set of parameters where we did not yet find an attractive periodic orbit. Then the Rauzy algorithm does not terminate on . Except in countably many cases, we claim that there is a measure zero Cantor set in which is the accumulation set of every orbit of .
We will prove this claim with the following steps:
-
1.
We handle the dynamics in the countably many exception cases. This is the set of Theorem 1.2
-
2.
We define a sequence of maps sending the discontinuity point to the measures of sets in which are disjoint from accumulation sets of orbits of .
-
3.
We show that are continuous and nonincreasing, and that for in a dense set, . This will prove that for all . Then we’ve shown that for any -map , the -limit set is measure zero for any .
-
4.
We show that for directions in , the limit set is in fact a Cantor set that is independent of .
5.1 Dynamics in the directions
Let us begin with the countably many exception cases in Step 1, the set of direction . These will correspond to -maps for which the Rauzy algorithm does not terminate but only performs finitely many left or finitely many right Rauzy induction steps.
Proposition 5.1.
If the Rauzy induction algorithm on a -map does not terminate but only performs finitely many left or finitely many right Rauzy induction steps, then is a degenerate -map such that every orbit is attracted to a terminating orbit (the orbit of a point that eventually hits an endpoint of or ).
Proof.
Let us consider the case of finitely many right Rauzy inductions. Then, after finitely many steps of Rauzy induction, we have some -map such that all future Rauzy induction steps are left inductions. After rescaling, we may assume that and the interval is divided into intervals and of lengths and at the point .
Referring to Figure 5.1, we see that to have an infinite series of left inductions, we always need the breakpoint after each iteration of Rauzy induction to be to the left of the right endpoint of the image of the interval. In our figure, we let be the initial with intervals and . Then is the map after one iteration of Rauzy induction with intervals and , and with intervals and is the map after two iterations of Rauzy induction.
We see then that if we do not rescale the maps, the right endpoint of the (or , or , etc.) interval is always at the point . So our condition for infinitely many left inductions is that Rewriting, we have that
The right hand side . When the left hand side is infinite unless . When , we can rewrite the inequality at and rearranging with gives us that . In this case, we must have that . Pictures of these two cases are show in 5.2.
We can see that each of these is a degenerate -map where some interval has collapsed to the zero interval. If we were to analyze the dynamics of these maps anyways, we see that in both cases every orbit is attracted to the left or right endpoint of the interval. The case of only right inductions can be similarly concluded.
If we had started with a -map that eventually ends in an infinitely string of left or right inductions, then every orbit following the Rauzy induction algorithm backward from the point of the only left or only right cases shows that every orbit of our original map converges on a terminating orbit. ∎
We make a note here that how we should think about the case of the Rauzy algorithm ending in a string of infinite left or infinite right inductions is that the algorithm really should have terminated in the previous step with equaling one of the endpoints of or . This is similar to the phenomenon of ternary expansions of endpoints of the middle thirds Cantor set having both an infinte and finite representation (e.g. ).
5.2 Dynamics in the directions
We now need to deal with the situation in which undergoes infinitely many left and right inductions, the directions falling in . We want to identify points which cannot possibly be limit points of any orbit in order to define the functions described in Step 2 of the proof outline. No point in the interval , the complement of the image of , is a limit point of any orbit. See Figure 5.3.
Similarly, for any , no point in the interior of is a limit point of any orbit. Indeed, for any , will not fall in whenever because is empty. Then is disjoint from for any . For similar reasons, whenever . We claim the disjoint union is full measure.
Recall that the discontinuity point parameterizes the set of -maps, where lies in some interval (if , just let ). Consider functions which map to the quantity (where is the map corresponding to ). Here is the rather technical but important proposition.
Proposition 5.2.
If , then for each , the function mapping to is continuous and nonincreasing.
Before providing the proof, it is informative to see the plot of such a function in Figure 5.4. The function is piecewise linear, nonincreasing, and the pieces alternate between having steep and shallow slopes. Many pieces have slope 0. These observations inform our proof.

Proof of Proposition 5.2.
We wish to show that is continuous and nonincreasing. Let us first focus on points that are in the interior of some interval for . The set of satisfying this condition is open. If , then splits into two intervals and . Let be the sequence of intervals where lands under . is the same for all , and is the same for all . Moreover, for sufficiently close to , the words and do not change. This is because the positions of and and their images vary continuously as changes, so they do not cross between and for small enough perturbations. This shows continuity at .
We will show that at such points , . To do so, we first make the following key observation: With , and as before, we note that consists of two intervals, one with left endpoint and the other with right endpoint . Then reattaches to , with attaching on the left of and attaching on the right of . Let , the period of this pattern. Further images will always attach to the right of and images will always attach to the left of .
We can see this process in Figure 5.5, where and .
Thus, for consists of exactly disjoint intervals. Since the endpoints of are and , we can see that the right endpoints of these intervals are , and the left endpoints of these intervals are .
It follows then that
We now make a few observations. First, we have that and . We also notice that , where or depending whether is in the interval or , and a similar statement holds for . Thus,
where is if and if .
We also note that and both follow a cyclic pattern of period where they are the equal except at two times in the cycle where they are opposite from one another. Specifically, for all integral , we have that
Putting this together, we see that for and where is a product of and terms when . In the latter case, since and all . Thus, is the sum of non-positive terms and is therefore non-positive. It follows that is continuous and non-increasing at such points .
We can employ a similar method to show that for points . This case is simpler than the case we just dealt with in that the interval does not split under the first iterations of . Thus,
Again, we have that
but now for all , so for all . Thus, and is continuous and decreasing at these .
Finally, it remains to show that is continuous at all that are endpoints of some interval for . can be seen to be both left-continuous and right-continuous at such points by a simple check that at each of these points, there is a continuous transition between the cases of splitting and not splitting as above. ∎
With this proposition, we can now show that the forward limit set of the orbit of any non-critical point of any -map has measure zero.
Proposition 5.3.
For every non-surjective -map and any non-critical point , the forward limit set has measure zero.
Proof.
Whenever , as long as , we find that . This is a simple calculation due to the result of Theorem 1.2 which tells us that these maps have an attracting periodic or critical orbit.
We first note that when , for all since . This is the surjective case. Now we consider any other value of . The set is dense, so for any such that , we can pick with so that by Proposition 5.2, . Then for every . This shows that is full measure for any , . Hence, the limit set has measure zero for every under any -map which is not surjective. ∎
We would also like to show that the accumulation set of the straight-line flow in directions is a lamination whose cross section is a Cantor set. This is a consequence of the following proposition.
Proposition 5.4.
Suppose that is a non-surjective -map such that the Rauzy induction algorithm goes through infinitely many left and right induction steps. Then, the limit set of the orbit of any non-critical point is a Cantor set.
Proof.
Recall that, for any , is disjoint from . The complement of is closed and measure zero, so it is nowhere dense. Then it is equal to its boundary, which is . Then we have . We need to establish the reverse inclusion.
Since we do infinitely many left and right inductions, we find that the dilation factors and both converge to zero (even if recall that eventually both intervals contract, unless is all the way to the right in which case is surjective). Hence the intervals on which we take the first return map of with each successive induction are descending intervals whose intersection is the closure of .
For some point , for each , let be the first integer such that . Then we find subsequences of images of accumulating to the boundary points of , which are and . Hence the closure of the images of these points sits in .
But this shows that for all . This is a perfect set because it is equal to and , which are themselves the set of limit points of . A perfect nowhere dense set in is necessarily totally disconnected and must be a Cantor set. So is a measure zero Cantor set which is independent of . ∎
Finally, we are in position to prove Theorem 1.2 by combining the results of previous propositions.
Proof of Theorem 1.2.
We let be a one-holed dilation torus and be the Cantor set of directions defined in Theorem 1.2. Let be the boundary-parallel direction. In Section 3.1, we saw that the dynamics in this direction could be minimal, completely periodic, or accumulate on a periodic orbit.
We then split the rest of into the set corresponding to -maps that have finitely many left induction steps or finitely many right induction steps, and the remaining directions. We note here that the set is countable.
Proposition 5.1 shows that in the directions, the corresponding -maps accumulate onto a critical orbit. This implies that the straight line flow on in these directions accumulates onto a saddle connection.
6 Concluding remarks
In this paper, we investigated families of non-surjective -AIETs that we called . We showed that there is a Cantor set of parameters in each off of which the maps had an attracting periodic orbit. Then we showed that for maps in that Cantor set of parameters but off of a countable subset, orbits are attracted to some measure zero Cantor set. We saw that these results about -AIETs implied similar results for one-holed dilation tori, a family of dilation surfaces.
There are a few natural questions and further directions of exploration that come from this investigation:
- 1.
-
2.
It is possible to expand on the methods of Section 5 to show that certain non-surjective AIETs on more than two intervals converge to measure zero Cantor sets?
If we could push the methods used in this paper to understand the limit sets of other families of AIETs, that could open the door to understanding the dynamics on other related families of dilation surfaces as well. Already, one could use the results in this paper to better understand the dynamics on any dilation surface with a one-holed dilation torus as a subsurface. By broadening the analysis to answer these questions, we may be able to classify dynamical behaviors on families of dilation surfaces containing slightly more complicated subsurfaces which might exhibit, say, first return maps which are non-surjective 3-AIETs.
References
- [1] Adrien Boulanger, Charles Fougeron, and Selim Ghazouani. Cascades in the dynamics of affine interval exchange transformations. Ergodic Theory Dynam. Systems, 40(8):2073–2097, 2020.
- [2] Adrien Boulanger and Selim Ghazouani. -dynamics on the moduli space of one-holed tori, 2019.
- [3] Joshua Bowman and Slade Sanderson. Angels’ staircases, sturmian sequences, and trajectories on homothety surfaces, 2018.
- [4] Zaqueu Coehlo, Artur Lopes, and Luiz Fernando da Rocha. Absolutely continuous invariant measures for a class of affine interval exchange maps. Proc. Amer. Math. Soc., 123:3533–3542, 1995.
- [5] Selim Ghazouani. Teichmüller dynamics, dilation tori and piecewise affine circle homeomorphisms, 2018.
- [6] Steven Kerckhoff, Howard Masur, and John Smillie. Ergodicity of billiard flows and quadratic differentials. Ann. of Math. (2), 124(2):293–311, 1986.
- [7] S. Marmi, P. Moussa, and J.-C. Yoccoz. Affine interval exchange maps with a wandering interval. Proc. Lond. Math. Soc. (3), 100(3):639–669, 2010.
- [8] Alex Wright. From rational billiards to dynamics on moduli spaces. Bull. Amer. Math. Soc. (N.S.), 53(1):41–56, 2016.
- [9] Jean-Christophe Yoccoz. Interval exchange maps and translation surfaces. In Homogeneous flows, moduli spaces and arithmetic, volume 10 of Clay Math. Proc., pages 1–69. Amer. Math. Soc., Providence, RI, 2010.
- [10] Anton Zorich. Flat surfaces. In Frontiers in number theory, physics, and geometry. I, pages 437–583. Springer, Berlin, 2006.