On the Lyapunov Exponents for a Class of Circle Diffeomorphisms Driven by Expanding Circle Endomorphisms

We consider skew-product maps on T2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {T}^2$$\end{document} of the form F(x,y)=(bx,x+g(y))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F(x,y)=(bx,x+g(y))$$\end{document} where g:T→T\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$g:\mathbb {T}\rightarrow \mathbb {T}$$\end{document} is an orientation-preserving C2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C^2$$\end{document}-diffeomorphism and b≥2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$b\ge 2$$\end{document} is an integer. We show that the fibred (upper and lower) Lyapunov exponent of almost every point (x, y) is as close to ∫Tlog(g′(η))dη\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\int _\mathbb {T}\log (g'(\eta ))d\eta $$\end{document} as we like, provided that b is large enough.


Introduction
In this paper we investigate the dynamics of circle diffeomorphisms which are driven by the strongly expanding map x → bx (mod 1) on T = R/Z, where the integer b 1. More precisely, we consider skew-product maps F : T 2 → T 2 of the form F(x, y) = (bx, x + g(y)) (1.1) Since y n = b n−1 x + g(y n−1 ) we have by the chain rule that log(g (y j )). (1.2) Before stating our main result we introduce the following notation. If w : T → R we let w denote the supremum norm, i.e., w = sup y∈T |w(y)|. We also let h(y) = log(g (y)).

Theorem 1 For any
As an immediate application of this theorem we have: Assume that u : T → R is a C 2function and let g ε (y) = y +εu(y). Since log(1+t) = t −t 2 /2+ O(t 3 ) and T g (η) dη = 0 (because g : T → R) we see that applying Theorem 1 with g = g ε and β = ε 3 , where ε > 0 is small, we get for all large b. Thus, we have L ± (x, y) ≈ −ε 2 almost surely. Note that the smaller is ε the larger we have to take b for this to hold. However, we would expect that the asymptotic is true for all small ε for some fixed b. A similar asymptotic is indeed true in the closely related case of the Schrödinger cocyle with small potentials [4]. A heuristic argument for the latter type of results goes as follows (here we follow [7, Section II]). Let F ε (x, y) = (bx, x + y + εu(y)). As we saw above we have For the unperturbed map F 0 (x, y) = (bx, x + y) it is not difficult to verify that the iterates y j = π 2 (F j 0 (x, y)) are uniformly distributed in T for a.e.(x, y). Thus one could expect that the iterates y j = π 2 (F j ε (x, y)) also are "close to" uniformly distributed for small ε and thus that the right hand side of (1.3) would converge to (or at least to something very close to) This is the route we will take to prove Theorem 1. In fact, we will show that for fixed g : T → T and fixed scale (fine partition of T), the iterates (y j ) ∞ j=1 of a.e. point (x, y) are as close to uniformly distributed (relative the fixed scale) as we want, provided that b is large enough (see Proposition 2.1 below). It is thus possible to work with g which are not necessarily close to the identity when b is large.
The approach we use is close in spirit to the ones we use in [1,2], which both are based on ideas from [8,9] (especially the idea that strong expansion in the base, i.e., b large, is a powerful tool to get a good control on the statistics of typical orbits). However, the big difference, compared with the present situation, is that both [1,2] deal with a situation where (most of) the fibre maps are far from a rigid rotation. In the present paper we can handle the intermediate region between "very close to rotation" and "far from rotation".
One could expect that, in the case when L + (x, y) is almost surely negative, one has a "global contraction" in the fibre, in the sense that |F n (x, y) − F n (x, y )| → 0 as n → ∞ for almost every (x, y), (x, y ) ∈ T 2 . This is the situation in [1,6], and also in [9] (via Oseledets' theorem). In our analysis we only control the distribution of most orbits (up to a fixed scale) so we do not a priori get such a global contraction result. But we expect that this would be the typical case.
A very interesting problem, which appears in [7] (and which to the best of our knowledge still is open), would be to prove that a similar result to the ones above also hold true for the map G(x, y) = (x + ω, x + y + εg(y)) where ω ∈ R\Q and ε is small. Numerical experiments indicate that this indeed could be true (see [7, Section II]). In [3] we investigate this type of maps when the fibre maps are far from the identity.
The rest of the paper is organized as follows. In Sect. 2 we prove Theorem 1 by applying Proposition 2.1 which contains the main estimates. This proposition is in turn proved in Sect. 3. We end this introduction by remarking that the same method as we use to prove Theorem 1 can be used to handle other classes of forced circle maps (x, y) → (bx, f x (y)). However, for simplicity and definiteness we have restricted our attention to maps of the form (1.1) which allows a very transparent analysis.

Proof of Theorem 1
In this section we prove Theorem 1. The key ingredient in the proof is Proposition 2.1 stated below. This proposition will be proved in the next section.
We shall use the following notation. If ϕ : Given an integer m ≥ 1, let Then the intervals are pairwise disjoint and m k=1 J k = T. Thus, (J k (m)) m k=1 is a partition of T into m intervals of equal length.

Proposition 2.1
Let v : T → T be a C 1 -map of degree 1 and let G(x, y) = (bx, x + v(y)). Given m ≥ 2 and δ > 0 there exists a b 0 = b 0 (m, δ, v ) ≥ 2 such that the following holds for all b ≥ b 0 . For any y 0 ∈ T there is a set X y 0 ⊂ T of full Lebesgue measure such that if we take x 0 ∈ X y 0 and let y n = π 2 (G n (x 0 , y 0 )) and let P n (k) = #{ j : 0 ≤ j ≤ n − 1, y j ∈ J k (m)}, then |P n (k)/n − 1 m | < δ for all 1 ≤ k ≤ m and all sufficiently large n.
Remark 1 Note that v need not be one-to-one.
From this proposition the statement in Theorem 1 easily follows. Let h(y) = log(g (y)) and let M = h . Note that M < ∞ since g is an orientation-preserving circle diffeomorphism. Take m ≥ 1 so large so that if δ = 1/m 2 then Now we apply Proposition 2.1 with m and δ as above. Let b 0 be as in the proposition and assume that b ≥ b 0 . Fix y 0 ∈ T and assume that x 0 ∈ X y 0 . Thus we know that |P n (k)/n − 1/m| < δ for all 1 ≤ k ≤ m and all large n. For any 1 ≤ k ≤ m and any t ∈ J k we have, by applying the mean value theorem, Hence we get Moreover, provided that n is large enough we have m n m k=1 P n (k) By combining these two estimates, and recalling (2.2), we thus get for all large n. Recalling the definition of L ± (x, y) in (1.2) finishes the proof.

Proof of Proposition 2.1
Let v and G be as in the statement of Proposition 2.1 and assume that m ≥ 1 and δ > 0 are fixed. The integer b ≥ 2 is assumed to be sufficiently large, depending on m, δ and v . Fix any y 0 ∈ T (this is the y 0 in the statement of the proposition) and define the functions ϕ n : T → T by ϕ n (x) = π 2 (G n (x, y 0 )), n ≥ 0.
Thus, we need to control the distribution of the iterates {ϕ n (x)} for fixed x.
Let J be one of the intervals J k (m) (1 ≤ k ≤ m) defined in (2.1). We define the sets As we will see below we have |A n | ≈ 1/m for all n provided that b is sufficiently large. The strategy is to prove that "the events" A n are very close of being independent.

Geometry of the graphs of ' n
From the definition we have ϕ 0 (x) = y 0 and Since deg(v) = 1 we have deg(ϕ n+1 ) = b n + deg(ϕ n ). By using the fact that deg(ϕ 0 ) = 0 we therefore get We also have Since ϕ 1 (x) = x + v(y 0 ), and hence ϕ 1 (x) = 1, we get, by induction, Thus, for any τ > 0 we have provided that b is large enough, depending on τ and v . Since we, in particular, have ϕ n (x) > 0 for each x ∈ T and for each n ≥ 1 (for large b), it follows that for every n ≥ 1 we can find deg(ϕ n ) pairwise disjoint intervals I j n ⊂ T such that deg(ϕ n ) j=1 I j n = T, ϕ n (I j n ) = T, the restriction of ϕ n to I j n is one-to-one, and A n ∩ I j n is a single interval (recall the definition of A n in (3.1)). 2 Moreover, from (3.2) we get Furthermore, since the length of the interval J is 1/m, we get, by using (3.2), the following bounds on the intervals A n ∩ I Thus, |A n | ≈ 1/m for all n, and the approximations become better and better the larger is b. 2 The intervals I j n are not uniquely defined for n ≥ 2. We can take any possible choice.

Probability
We will now show that "the events" A n are very close of being independent and use this fact to prove the statement of Proposition 2.1. Below we shall use the following notation: If r ∈ R we denote the integer part of r by r . We shall begin by stating an elementary intersection result. By using the above estimates of the intervals I j n we get: Proof is a partition of T, the result follows easily by using the estimates in (3.3).
Based on the estimates in the previous lemma we introduce the following integers: Proof (1) We know that A n ∩ I j n is an interval which satisfies the length estimates (3.4). Applying Lemma 3.1 yields the results.
(2) The set I j n \A n is either a single interval or consists of two disjoint intervals. By combining (3.3) and (3.4) we get the estimate Assuming that I j n \A n consists of two intervals (which is the worst case), and applying Lemma 3.1 to each interval, using the above estimate of the sum of the lengths, gives the statement.

Lemma 3.3
For any n ≥ 1 the following holds. Let C ⊂ T be a set of the format C = B 1 ∩ B 2 ∩ · · · ∩ B n , where B j = A j for k (0 ≤ k ≤ n) indices j and B j = T\A j for n − k indices j. Then C contains at least N k 1 M n−k 1 of the intervals I i n+1 , and C intersects at most N k 2 M n−k 2 of the intervals I i n+1 . Proof We use induction to prove the statement. When n = 1 the statement follows directly from Lemma 3.2 since I 1 1 = T. To prove the inductive step we do as follows. Assume that n ≥ 1 and that C ⊂ T is a set that contains at least N ≥ 1 of the intervals I i n+1 , and C intersects at most M ≥ N of the intervals I i n+1 . Then it follows from Lemma 3.2 that C ∩ A n+1 contains at least N N 1 of the intervals I j n+2 and intersects at most M N 2 of them; and C ∩ (T\A n+1 ) contains at least N M 1 of the intervals I j n+2 and intersects at most M M 2 of them. and similarly n k=(q+δ )n S n (k) ≤ ( p/q) n 1 − τ exp(−2(δ ) 2 n) < 2( p/q) n exp(−2(δ ) 2 n) Hence we have (since p/q < exp((δ ) 2 )) |T\X n | ≤ 4 exp(−(δ ) 2 n).