THERE EXISTS AN INTERVAL EXCHANGE WITH A NON-ERGODIC GENERIC MEASURE

Transcription

1 THERE EXISTS AN INTERVAL EXCHANGE WITH A NON-ERGODIC GENERIC MEASURE JON CHAIKA AND HOWARD MASUR. Introduction In the initial study of interval exchange transformations in the Soviet Union, the United States and western Europe a major motivation was basic ergodic theory. One aspect was to find bounds on the maximal number of ergodic measures. Kato [2] proved that n-iets have at most n 2 ergodic measures. A little later Keane [3] proved that n-iets have a finite number of ergodic measures and Veech [0] using different methods than Kato also proved that an n-iet has at most n 2 ergodic measures. Various examples of non-ergodic interval exchanges were constructed by Kato [2], Sataev [7] and Keane [4]. In a slightly different context examples were also constructed by Veech [9]. Masur [6] and Veech [] later proved almost every interval exchange with an irreducible permutation is uniquely ergodic. The present paper is devoted to the study of invariant measures of minimal and not uniquely ergodic interval exchange transformations. Now let (X, d) be a σ- compact metric space, B be the Borel σ algebra, µ be a Borel measure and T : X X be µ-measure preserving. Definition. A point x X is said to be generic for µ if for every continuous compactly supported f : X R we have N i=0 f(t i x) fdµ. Consider a σ-compact metric space. The Birhoff ergodic theorem and the fact that continuous compactly supported functions with supremum norm have a countable dense set says that if a measure µ is ergodic then µ-almost every point is generic. Definition 2. A measure is called generic if it is has a generic point. The question arises if a non-ergodic measure can be generic. In settings lie the left shift on {0, } Z it is straightforward to build generic points for non-ergodic measures. Interval exchanges have fewer, much more constrained orbits and so these techniques do not wor. However, in this paper we show that there exists an IET with a generic non-ergodic measure. Theorem. There exists a minimal non uniquely ergodic IET on 6 intervals with 2 ergodic measures and which has a generic measure that is not ergodic. The same proof given in [2] gives the following. Theorem 2. A minimal IET has at most [n/2] generic measures. J.C. partially supported by NSF grant DMS H.M partially supported by NSF grant DMS

2 2 JON CHAIKA AND HOWARD MASUR Thus if the number of ergodic measures is maximal, then no other measure can be generic. Acnowledgments: We than M. Boshernitzan for asing this question and Oberwolfach where this project began. J. Chaia thans the University of Chicago for its hospitality. 2. Rauzy Induction We follow the description of interval exchange transformations introduced in [5] and also explicated in []. We have an alphabet A on d 2 letters. Brea an interval I = [0, λ ) into intervals {I α } α A and rearrange in a new order by translations. Thus the interval exchange transformation is entirely defined by the following data: () The lengths of the intervals (2) Their orders before and after rearranging The first are called length data, and are given by a vector λ R d. The second are called combinatorial data, and are given by a pair of bijections π = (π t, π b ) from A to (,..., d). The bijections can be viewed as a pair of rows, the top corresponding to π t and the bottom corresponding to π b. Given an interval exchange T defined by (λ, π) let α, β A the last elements in the top and bottom. The operation of Rauzy induction is applied when λ α λ β to give a new IET T defined by (λ, π ) where λ, π are as follows. If λ α > λ β then π eeps the top row unchanged, and it changes the bottom row by moving β to the position immediately to the right of the position occupied by α. We say α wins and β loses. For all γ α define λ γ = λ γ and define λ α = λ α λ β. If λ β > λ α then to define π we eep the bottom row the same and the top row is changed by moving α to the position to the right of the position occupied by β. Then λ γ = λ γ for all γ β and λ β = λ β λ α. We say β wins and α loses. In either case one has a new interval exchange T determined by (λ, π ) and defined on an interval I = [0, λ ) where λ = α A λ α. The map T : I I is the first return map to a subinterval of I obtained by cutting from I a subinterval with the same right endpoint and of length λ ζ where ζ is the loser of the process described above. Let be the standard simplex in R d and let P be the set of permuations on n letters. We can normalize so that all IET are defined on the unit interval. Let R : P P then denote Rauzy induction. There is a corresponding visitation matrix M = M(T ). Let {e γ } γ A be the standard basis. If α is the winner and β the loser then M(e γ ) = e γ for γ α and M(e α ) = e α + e β. We can view M as simply arising from the identity matrix by adding the α column to the β column. We can projectivize the matrix M and consider it as M :.

3 LAERTES POINTS 3 When the interval excahnge T is understood, and we perform Rauzy induction n times then define M() = M(T ) and inductively M(n) = M(n )M(R n T ). That is, the matrix M(n) comes from multiplying M(n ) on the right by the matrix of Rauzy induction applied to the IET after we have done Rauzy n times. Let C σ (n) the column of M(n) corresponding to the letter σ A. Definition 3. We say an IET satisfies the Keane condition if the orbit of every point of discontinuity is infinite and misses every other such point. It is a fact that such an IET is minimal. If an interval exchange has all powers of Rauzy induction defined on it then it satisfies the Keane condition (see [8, Corollary 5.4] for a proof in a survey). Theorem 3. ([0, Section and Proposition 3.22] Let T be an IET satisfying the Keane condition. The space of invariant measures of T is n=m(n). We now specialize to IET on 6 intervals. We will tae paths that return infinitely often to the arrangement ( ) A B C D E F. Our paths will be of two types which we call the left and right paths. Our paths will depend on a sequence of parameters a. Inductively we assume that for the th time having just traveled on the left hand side we have taen a total of n steps of Rauzy induction and returned to the above arrangement. Our matrix is M(n ). Remar. In what follows we suppress the matrix that the columns are being taen from. So C A (M(n + r )) is denoted C A (n + r ). Given a vector v let v denote the sum of the absolute values of its entries (that is its l norm). Inductively assume the columns satisfy (A) min{ C A (n ), C B (n ) } > a max{ C E (n )), C F (n ) } and (B) min{ C E (n ), C F (n ) } > a 2 max{ C C (n ), C D (n ) }. Now we go along the loop on the right side. In the first step of Rauzy induction F beats A. The second step F beats B. In the third step C beats F, and then C beats E. Now for a total of r consecutive steps C loses to D. The number r is chosen so that it is smallest odd number satisfying (C) C C (n r ) > C F (n r ) Now C will beat D. Now F beats C and then F beats D. Next E beats F consecutively s times for a total of s + r + 7 steps until the first time that (D) C F (n +r +s +7) > a + max{ C A (n +7+r +s ), C B (n +7+r +s ) }. Then F beats E and we return to ( ) A B C D E F

4 4 JON CHAIKA AND HOWARD MASUR for the + st time. The number of steps we have taen is r + s + 8 so n + = n + r + s + 8. ( ) A B C D E F Notice when we return to we have by (A) min{ C E (n + ), C F (n + ) } > a + max{ C A (n + ), C B (n + ) } and for a sufficiently large compared to, min{ C A (n + ), C B (n + ) } > a 2 max{ C C(n + ), C D (n + )} so (B) holds. The diagrams below describe the ( paths on the right side ) and left side of the A B C D E F Rauzy diagram. The permutation is a common point. ( A B C D E ) F ( A B C D E ) F F A E D C B ( A B C D E ) F ( A B C F D ) E F B A E D C F B A E D C ( A B C D E ) F F C B A E D ( A B C E F ) r times D F B A E D C ( A B C D E ) F s times F D C B A E Figure. The path we tae on the right hand side of the Rauzy diagram ( A F B C D ) E ( A B C D E ) F ( A E F B C ) D F E D A C B ( A E F B C ) D r times ( A E F B C ) D ( A D E F B ) C F E D B A C s times ( A C D E F ) B Figure 2. The path we tae on the left hand side of the Rauzy diagram

5 LAERTES POINTS 5 On the left hand side A beats F and then beats E; then D beats A and then B; then C beats D repeatedly r + times until the first time that C D > ( + )C A. Then D beats C. Then A beats D and then C and then B beats A repeatedly s + times until the first time that C A (n + +r + +7+s + ) > a +2 min{(c E (n + +7+s + +m + ), C F (n + +7+r + +s + )}. Finally A beats B and we return. Our main Theorem is then the following. Theorem 4. For choices of a there is a minimal 6 interval exchange transformation T with the property that the resulting simplices = M()( ) converge to a line segment as. The endpoints are ergodic measures for T. One endpoint is the common projective limit of the column vectors C A, C B ; the other endpoint is the common projective limit of the column vectors C E, C F. Along the sequence n the column vectors corresponding to C C, C D converge projectively to a common interior point of the segment and this limit point is a generic measure. 2.. Outline of proof. The proof is in two main steps. In the next subsection we show that n=m(n) converges to a line segment. This is given by Proposition 2 with preliminary Proposition. This shows that there are two ergodic measures. We also show that the sequence of vectors given by the C th and D th columns of the matrices M(n) converge to a single point away from the endpoints in n=m(n). This gives the invariant measure ν we are interested in. In the section after that we show that ν is generic by finding a generic point x Convergence of column vectors. The first Lemma is simple Euclidean geometry. Our angles will be bounded away from π 2 and so sin x will be comparable with x. Lemma. Let v, w R n, and let θ(v, w) denote the angle between v and w. If θ(v + w, w) denotes the angle between v + w and w, we have sin θ(v + w, w) = v sin θ(v, w). v + w We will now simplify notation for the column vectors, using v for a vector and eliminating some of the times of Rauzy induction. We assume that we enter the right side after an even number of returns. We define v F (2 + ), v E (2 + ) to be the column vectors C F (n 2 + 3), C E (n 2 + 4) after F, E lose to C on the right side. We choose v F (2 +2) to be the column vector C F (n 2 + r 2 + m 2 + 7) after E is added to F on the right side and v E (2 + 2) the column vector C E (n 2 + r + 8) = C E (n 2+ ) after C F is added to C E. Similarly let v A (2) be the column vector C A (n 2 + 3) on the left side just after A has lost to D and v A (2 + ) is the column vector C A (n 2 ) = C A (n 2 + r 2 +m 2 +7) just after B has finished beating A. Similarly the column vectors v B (2) and v B (2 + ) are defined in terms of C B. We define vc R(2 + ) to be the column vector C C(n 2 + r 2 + 4) when C has finished losing to D on the right side and vc R (2 + 2) the column vector for C after C loses to F. This ensures that vc R(2 + 2) lies on the line joining vr C (2 + ) and v F (2 + ) which will be needed later. Similarly, zc L (2) is the column vector for

6 6 JON CHAIKA AND HOWARD MASUR C on the left side after D has beaten C, and zc L (2 + ) is the column vector after A has beaten C. We have similar definitions for vd L (2), vl D (2 + ) in terms of the column vectors C D. The following Proposition gives the properties these vectors satisfy. They will be used to prove the desired convergence results. Proposition. With a choice of a there exist constants δ > 0, α < such that for i, j {, 2}, and all () for σ, σ {E, F }, θ(v σ (), v σ ( + )) < α and similarly for A, B. (2) for σ {E, F } and σ {A, B}, θ(v σ (), v σ ()) δ. (3) θ(v R C (2 + 2), v F (2 + )) = ( + O( 2 ))θ(v R C (2 + ), v F (2 + )), with the same formula for v R D. (4) θ(v L D (2 + ), v A(2)) = ( + O( 2 ))θ(v L D (2), v A(2)), with the same formula for v L C. (5) θ(v R C (), vr D ()) α for all. The same holds on the left. (6) θ(v L C (2), vr C (2)) α. (7) θ(v R D (2 + ), vl D (2 + )) α. Moreover v R C (2 + 2) lies on the line connecting vr C (2 + ) and v F (2 + ) and v L C (2 + ) lies on the line connecting vl C (2) and v A(2) with the same for v D. Proof. The vectors v E (2 + ) (resp. v F (2 + )) arises from v E (2) (resp.v F (2)) from E (resp. F ) losing first to A on the left side and then to C bac on the right side. Recall this means that the A column and then the C column are added to the E (resp.f column). Then by (A) and (B) and Lemma, θ(v E (2 + ), v E (2)) a + + a, + 2 and similarly for v F. Similarly we have θ(v A (2 + 2), v A (2 + )) a +2 + a +2 (+) 2 and the same for v B. On the right side the C E column is added to the C F column many times and then C F is added to C E. By (A) and (D) and Lemma, this gives θ(v F (2 + 2), v E (2 + 2)) The same argument shows that a a + θ(v F (2 + ), v E (2 + )). θ(v F (2 + 2), v F (2 + )) θ(v F (2 + ), v E (2 + )) a a +. We have similar inequalities for the v A, v B. If we let a be exponentially small, putting these together we see () is satisfied. We also note that on the right side F beats A, B only when smaller by the factor of a and similarly on the left side A beats E, F only when smaller by a factor of a + which gives θ(v E ( + ), v A ( + )) ( ( a + a + ))θ(v E (), v A ()). Thus since initially the angle between the column for E and A is positive we can choose a so (2) is satisfied.

7 LAERTES POINTS 7 We prove (3),(4). When C or D loses to F, C C moves towards C F so θ(v R C(2 + 2), v R C(2 + )) θ(vr C(2 + ), v F (2)). The same holds for vc L(2), vl C (2 + ) and also for the corresponding v D. These imply (3),(4). When we have finished on the right we have vc R(2), vr D (2). When we move to the left we change from vc R(2), vr D (2) to vl C (2), vl D (2). In doing so we add the C column to the D column r 2 times and then the D column is added bac to the C column. Since r grows exponentially this give (5) for j even and left. Moving from left to right similarly gives (5) when j is odd and we are on the right. In addition in increasing the index on both sides means adding the same column (either C A or C F ) to each so they remain exponentially close. This proves (5). Similarly the fact that C beats D repeatedly on the left means vd L (2) moves close to vr C (2) and then the fact that D is added to C means that vc L(2) is close to vr C (2). This is (6). We have the corresponding computation on the right giving (7). The following is the basic Proposition that will allow us to find limiting invariant measures. Proposition 2. Consider the sequence of vectors v σ () R 6 that satisfy the conclusions of Proposition, projectivized to lie in the simplex 6 = {x,..., x 6 : x i = }. Then v E (), v F () have limit v 0 and v A (), v B () have a distinct limit v. lim vl C () = lim vl C () = lim vl D () = lim vr D () = v exists in P(R 6 ) v is on the line between v 0 and v in P(R 6 ) v v 0, v. Proof. We can replace angles with Euclidean distance. The fact that the limits v 0, v of v E,F (), v A,B () exist follows immediately from (). In fact, they converge exponentially fast. The fact that the limits are distinct comes from (2). Let ū be the direction of the line connecting v 0 and v. Let y denote a coordinate perpendicular to ū. We claim that the y coordinates of vc R(), vr D (), vl C (), vl D () go to 0. Without loss of generality consider vc R(), vl C (). The fact that vr C (2 + ) and vc R(2 + 2) lie on a line through v F (2 + ) whose y coordinate goes to 0 exponentially fast together with (3) implies that the y coordinate of vc R (2 + 2) must decrease by a factor of approximately + O( ) from the coordinate of 2 vc R(2 + ). The same is true for the change from even to odd indices of vl C, also by (3). But then (6) says that d(vc R(2), vl C (2)) 0 exponentially fast and together with the fact that ( ) = 0 =2 implies the y coordinates of v R,L C () must converge to 0. The same is true of vr,l D () by (3) and (7). i=

8 8 JON CHAIKA AND HOWARD MASUR It follows from the above conditions that these vc R(), vl C (), vr D (), vl D () have a single limit v on the axis. Indeed since the ū coordinate of vc R (2 + 2) decreases by 2+ with small error from that of vr C (2 + ) and then increases by 2+2 with small error from even to odd implies that the distance in the ū coordinate between vc R(2) and vr C (2+2) is O( ) so that these coordinates form a convergent Cauchy 2 sequence. The fact that the distance in the ū coordinate between vc R (2) and vc R (2 + ) goes to 0 means the entire sequence converges. The fact that (5) holds implies that the v R,L D () have the same limit. We claim that v / {v 0, v }. Suppose by contradiction that v = v 0. (The argument for v is similar) Assume without loss of generality v v 0 =. For even d(v L D( + ), v L D()) = ( + o()) ( vl D() ). That is, since vd L ( + ) is assumed near 0, we move towards v an amount about. When we move towards 0 on the next move we move not as far; d(vd( R + 2), vd( R + )) = ( + o()) + vr D( + ). Then again on the next move we move further away. On odd moves we will move further away from 0 than we move closer to 0 on even moves as soon as say the ū coordinate is at most some positive ɛ. This says we do not converge to 0. By a symmetric argument we see that no subsequence converges to q. 3. Getting a generic point Lemma 2. Let µ be a T -invariant measure with intervals I j. A point x is generic n for µ if and only if lim n n =0 χ I j (T (x)) = µ(i j ) for all j. Proof. The only if direction holds by definition. For the other direction, the point x defines an invariant measure ν such that n ν(i j ) = lim χ Ij (T (x)). n n We conclude that ν(i j ) = µ(i j ). However the measures of initial intervals determine the invariant measure. This is because if T is minimal then {T i I σ } i Z,σ {A,...,F } generates the Borel σ-algebra. Given x [0, ), for each j let =0 j j v j (x) = ( χ A (T i x),..., χ F (T i x)) i=0 the vector of visits to the original intervals. If T i is continuous on an interval U for 0 i < j then v j is constant on U and in an abuse of notation let v j (U) be this vector. Recall n is the number so that after n steps of Rauzy induction we have hit ( ) A B C D E F. i=0

9 LAERTES POINTS 9 Let J be the interval so that after n steps of Rauzy induction the induced map, denoted S, is defined on J. Let A,..., F be the six subintervals of the IET S. For σ one of these intervals and x σ m (x) = min{i > 0 : T i x J } is constant on σ and is C σ. Let m (σ ) be this number. In other words in this notation v m (σ )(σ ) = C σ. Also let O (σ ) = m (σ ) i=0 T i (σ ). This is the orbit of σ under T before σ returns to J. Now suppose we have the induced map S on J and we are about to go to the left side of Rauzy induction. Recall r + is the number of times on the left side that C beats D, and so for 0 i r +, S i (C ) C. If on the other hand we are about to go to the right side then for 0 i r + S i (D ) D. For simplicity let us assume that we are about to go to the left hand side. The arguments are symmetric if we are about to go to the right hand side. Recall r + is odd. Let u := r + 2. Let Î = S u (C ) S u (C ) C J. Lemma 3. Î consists of two intervals of O + (C + ) and one interval of O + (D + ) Proof. On the left side D beats A and B. Then C as the bottom letter beats D, the top letter r + times before losing to it. Set For each i, after C has beaten D () C = S D = D \ (S (A ) S (B )). (D ) S 2 (D ) S 3 (D )... i times, we have S i (D ) C. Thus S r + (D ) (S r + (D ) C ), with this disjoint union moving right to left along C. The last term in the union which is at the left end of C is an image of C +. Moreover D is a disjoint union of an image of C + and an image of D +. In addition S acts by translation by the length of D along C. Then for i < r +, S i (C ) C is C with the i copies of C + D + furthest on the left of C deleted. Similarly, S i (C ) C deletes the i copies of C + D + furthest on the right of C. It follows then from the definition of Î that it is a single union of an image of C + D + and the last term in the union, which is an image of C +.

10 0 JON CHAIKA AND HOWARD MASUR Remar 2. If the top letter σ beats the bottom letter τ then S (τ) σ. Similarly if the bottom letter τ beats the top letter σ then S (σ) τ. With this observation, the proof of the previous lemma on the right hand side would change the negative powers of S to positive powers and the positive powers of S to negative powers. Now let I = Î O + (D + ). We conclude from the previous lemma that Lemma 4. S i I C for u < i < u. Let ˆm = min{i 0 : T i I J + }. Then v ˆm (I ) consists of u iterates of the entire orbit O (C ), followed by the entire orbit of O(D ), and then followed by the entire orbit of O(A ). Now the fact that u m (C ) = ( + o()) 2 m (A ) implies m (A ) = o( ˆm ). Let I be an interval that has been inductively defined so that it contains a unique interval of O (C ). Let I be defined as O (I ) I. Observe that it contains a unique interval of O + (D + ) and therefore the number j = min{j : T j I J + } is well-defined and T j is continuous on I. Lemma 5. θ(v m (C )(C ), v j (I )) = o() and θ(v m (D )(D ), v j (I )) = o(). In fact these angles approach 0 exponentially fast. Proof. This is similar to the proof of Proposition because v j (I ) is made up of blocs of C or D and a smaller column of O(A ). We conclude the proof of the Main Theorem. We let x = =I. We will show that x is generic for ν. To do that we show that the angle its visitation vector maes with the column C goes to 0 as. This is shown in the next Proposition. Proposition 3. For j [j, j ] we have that lim θ(v j(i ), v m (C )(C )) = 0. Proof. By Lemma 5, the angle v j (I ) = v j (I ) maes with v m (D )(D ) goes to 0 with and by Proposition the angle of the latter with v m (C )(C ) also goes to 0. Thus the conclusion of the Proposition holds for j = j. Moreover T j (I ) = S (I ) C. We wish to increase the set of times in the orbit of I. Again recall that we are assuming that we have just finished the right hand side. Since j = j + (u )m (C ) + m (A ), we first consider m (C ). Now v m (C )(C ) consists of r copies of the vector of visits of the entire orbit O (D ) to the original intervals followed by a single copy of the vector of visits of O (C ) to the original intervals followed by a

11 LAERTES POINTS single copy of O (F ). Given that m (D ) = o(j ), Proposition 3 holds for any i in the initial interval [j, j + m (D )]. Then by Proposition and the fact that the Proposition 3 holds for j, we have that This implies that for any θ(v j (I), v m (D )(D )) = o(). i [j, j + r m (D )], if one considers the orbit of I at time i, then lim θ(v i(i ), v m (C )(C )) = 0. Since m (F ) = o(r m (D )) we have that if i [j, j + m (C )] then lim θ(v i(i ), v m (C )(C )) = 0. Iterating this shows that if i [j, j + (u )m (C )] we have that lim θ(v i(i ), v m (C )(C )) = 0. Finally since m (A ) = o(u m (C )) and j = j + (u )m (C ) + m (A ), this finishes the proof of the Proposition and the proof of the main theorem is complete. We finish the paper with the proof of Theorem 2. This is the same proof given in [2] where it was shown that there are at most n 2 ergodic measures. We include it for completeness. Proof of Theorem 2. We suspend the interval exchange to a translation surface (X, ω) of genus g = [ n 2 ]. The interval I becomes horizontal. Let x be a generic point for an invariant measure µ. Let n a sequence such that for each n and 0 < i < n there is no point of T i (x) in the interval between x and T n (x). This means that if we tae the vertical line through x to T n (x) we can join x to T n (x) by a segment J n I and the resulting closed curve γ n is simple. Since x is generic the homology class γn γ n converges in H (X, R) to what is called an asymptotic cycle, denoted [γ(µ)]. It is easy to see that if µ and ν are different invariant measures they define different measures to intervals and so the corresponding asymptotic homology classes [γ(µ)] [γ(ν)]. Moreover since the measures are nonatomic, for intervals J n with J n 0, µ(j n ) 0 which implies that the asymptotic cycles have 0 intersection number that is, < [γ(µ)], [γ(ν)] >= 0. This says they form a Lagrangian subspace of H (X, R). Since the dimension of homology is 2g, where g is the genus of X, a Lagrangian subspace has dimension at most g.

12 2 JON CHAIKA AND HOWARD MASUR References [] A. Avila, A; S. Gouëzel, S; J-C. Yoccoz: Exponential mixing for the Teichmüller flow. Publ. Math. Inst. Hautes tudes Sci. No. 04 (2006), [2] A. B. Kato, Invariant measures of flows on orientable surfaces. Dol. Aad. Nau SSSR 2 (973), [3] M. Keane, Interval Exchange Trasformations, Mathematische Zeitschrift, v. 4, 25-3, 975. [4] M. Keane, Non-ergodic interval exchange transformations Israel J. Math. 26 (977), no. 2, Israel J. Math. 26 (977), no. 2, [5] S. Marmi; P, Moussa, P; J-C Yoccoz, The cohomological equation for Roth type interval exchange transformations. J. Amer. Math. Soc. 8 (2005), [6] H. Masur, Interval exchange transformations and measured foliations, Annals of Mathematics, v. 5, , 982. [7] E. A. Sataev, The number of invariant measures for flows on orientable surfaces Izv. Aad. Nau SSSR Ser. Mat. 39 (975), no. 4, [8] M. Viana, Ergodic theory of interval exchange maps. Rev. Mat. Complut. 9 (2006), no., [9] W. Veech, A Kronecer-Weyl theorem modulo 2. Proc. Nat. Acad. Sci. U.S.A [0] W. Veech, Interval exchange transformations. J. Analyse Math. 33 (978), [] W. Veech, Gauss measures for transformations on the space of interval exchange maps, Annals of Mathematics, v. 5, , 982. [2] J-C. Yoccoz, Interval exchange maps and translation surfaces. Homogeneous flows, moduli spaces and arithmetic, 69, Clay Math. Proc., 0, Amer. Math. Soc., Providence, RI, address: chaia@math.utah.edu address: masur@math.uchicago.edu Department of Mathematics, University of Utah, 55 S 400 E Room 233, Salt Lae City, UT 842 Department of Mathematics, University of Chicago, 5734 S. University Avenue, Room 208C, Chicago, IL 60637, USA