This paper establishes sharp polynomial decay bounds and statistical limit laws for a class of multidimensional intermittent maps, extending known results from one-dimensional cases to higher dimensions despite nonconformality challenges.
Contribution
It introduces methods to prove optimal decay rates and statistical limit laws for multidimensional nonconformal intermittent maps, a problem previously only partially addressed.
Findings
01
Proves sharp polynomial bounds on decay of correlations.
02
Extends statistical limit laws from 1D to multidimensional maps.
03
Demonstrates convergence to stable laws and infinite measure mixing.
Abstract
Intermittent maps of Pomeau-Manneville type are well-studied in one-dimension, and also in higher dimensions if the map happens to be Markov. In general, the nonconformality of multidimensional intermittent maps represents a challenge that up to now is only partially addressed. We show how to prove sharp polynomial bounds on decay of correlations for a class of multidimensional intermittent maps. In addition we show that the optimal results on statistical limit laws for one-dimensional intermittent maps hold also for the maps considered here. This includes the (functional) central limit theorem and local limit theorem, Berry-Esseen estimates, large deviation estimates, convergence to stable laws and L\'evy processes, and infinite measure mixing.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Sharp Statistical Properties for a Family of Multidimensional NonMarkovian Nonconformal Intermittent Maps.
Peyman Eslami
Dipartimento di Matematica, II Università di Roma (Tor Vergata),
00133 Roma, Italy.
Sandro Vaienti
Aix Marseille Université, Université de Toulon, CNRS, CPT, 13009 Marseille, France. [email protected]
(24 March 2019. Updated 30 June 2021.)
Abstract
Intermittent maps of Pomeau-Manneville type are well-studied in one-dimension,
and also in higher dimensions if the map happens to be Markov.
In general, the nonconformality of multidimensional intermittent maps represents a challenge that up to now is only partially addressed.
We show how to prove sharp polynomial bounds on decay of correlations
for a class of multidimensional intermittent maps.
In addition we show that the optimal results on statistical limit laws for one-dimensional intermittent maps hold also for the maps considered here. This includes the (functional) central limit theorem and local limit theorem, Berry-Esseen estimates, large deviation estimates, convergence to
stable laws and Lévy processes, and infinite measure mixing.
1 Introduction
Intermittent maps were introduced by Pomeau & Manneville [56] as a model for turbulence. These are maps that are uniformly expanding except for the presence of neutral fixed points.
In the smooth ergodic theory literature, they have provided the archetypal examples of nonuniformly expanding dynamical systems. For one-dimensional intermittent maps, [62]
studied the invariant densities in the case when the map is Markov with respect to a suitable partition, and the nonMarkovian case was analysed in [66].
The paper of Liverani, Saussol & Vaienti [47] set out to study the statistical properties of one-dimensional intermittent maps by considering the simplest possible example
f:[0,1]→[0,1], namely
[TABLE]
Here γ>0 is a real parameter. For γ∈(0,1), there
is a unique absolutely continuous probability measure μ.
Let
[TABLE]
By [37, 65], ρv,w(n)=O(n−(γ1−1))
for v Hölder and w∈L∞ and this decay rate is
optimal [28, 58].
For γ∈(0,21), the central limit theorem (CLT)
holds for Hölder observables by [47, 65] as does the weak invariance principle (WIP) [50]. Berry-Esseen estimates and local limit theorems were obtained in [30].
When γ∈[21,1), the CLT fails for Hölder observables that are nonzero at x=0; stable laws were proved in this situation by [29]
and the corresponding WIP holds by [55].
In addition, for γ∈(0,1), sharp results on large deviations and convergence of moments were obtained in [21, 34, 49, 51, 53].
For γ≥1, there is a unique absolutely continuous invariant σ-finite measure up to scaling, but the measure is infinite. Results on mixing for infinite measure systems were obtained in [33, 52]
Although [47] initially focused on the specific maps (1.1),
the results described above have by now been shown to hold for very general classes of one-dimensional intermittent maps and extend to many multi-dimensional examples in cases when the map f is Markov.
In such cases, the standard approach is to construct an induced map F with infinitely many branches and to deduce quasicompactness properties of the transfer operator for F acting on a suitable function space.
In the Markov case, it is natural to consider observables that are Hölder with respect to a symbolic metric; in the one-dimensional case, one can consider observables of bounded variation.
Currently, multidimensional intermittent maps are poorly understood in general.
The aim of this paper is to approach the problem of multidimensional intermittent maps in the same spirit that [47] approached one-dimensional intermittent maps, focusing on some simple examples that exhibit all the problematic features: multidimensional, intermittent, nonconformal, nonMarkovian.
1.1 Statement of the main results
Let M=[0,1]×T where T=R/Z.
Our counterpart of the family (1.1)
is the family of maps f:M→M with
f(x,θ)=(f1(x,θ),f2(θ)), where
f1:M→[0,1] is a (not
necessarily Markov) nonuniformly expanding map for each θ.
Specifically, we assume that
[TABLE]
where γ>0, and u:[0,43]×T→(0,∞) is a
positive C2 function satisfying u(0,θ)≡c0>0.
(Implicitly, it is assumed that
x(1+xγu(x,θ))≤1 for all x∈[0,43], θ∈T.)
In addition, we assume that ∣(Df)(x,θ)v∣≥∣v∣
for all (x,θ)∈[0,43]×T, v∈R2.
In particular, as in [47],
f is an everywhere expanding map with a
neutral invariant circle {x=0}, and f is uniformly expanding on
[δ,1]×T for all δ>0. Also,
f1(43,θ)>43 for θ∈T.
For definiteness, we suppose that
f1(43,θ)>1615 for θ∈T.
Our final assumption is that u is sufficiently close to constant, in
the sense that ∣x∂x∂u∣∞ and
∣∂θ∂u∣∞ are sufficiently
small.
(See Remarks 2.6 and 4.8.)
Note that f has 8 branches; again as in [47] half of the branches are linear. However, typically the remaining branches are not full and there is no Markovian structure. Moreover, the maps expand polynomially in x and exponentially in θ and hence are highly nonconformal.
For the maps (1.3), we obtain almost identical results to the ones described above for the one-dimensional maps (1.1).
Recall that v:M→R is Hölder with exponent η∈(0,1), denoted v∈Cη(M), if
∥v∥η=∣v∣∞+supx=y∣v(x)−v(y)∣/∣x−y∣η is finite.
Our results are formulated mainly for Hölder observables, but occasionally for observables in BV∞(M)=BV(M)∩L∞(M). (The definition of bounded variation on M is recalled in Section 4.)
In particular, all of the results hold for C1 observables.
Lemma 3.4 states that for γ<1, there is a unique absolutely continuous f-invariant probability measure, denoted μ, and this measure is mixing.
Our main result gives sharp polynomial upper and lower bounds on the rate of mixing.
We set α=1/γ throughout.
Define the correlation function ρv,w as in (1.2).
Theorem 1.1
Suppose that γ<1.
(a)
Let η∈(0,1). There exists C>0 such that
[TABLE]
for all v∈Cη(M), w∈L∞(M).
(b)
Define
E(n)=⎩⎨⎧n−αn−2lognn−2(α−1)α>2α=21<α<2.
There exists C>0, c>0 such that
[TABLE]
for all v∈BV∞(M), w∈L1(M) supported in [43,1]×T.
In particular,
ρv,w(n)∼cn−(α−1)∫vdμ∫wdμ
as n→∞.
(c)
There exists C>0 such that
[TABLE]
for all v∈BV∞(M), w∈L1(M)
supported in [43,1]×T with ∫vdμ=0.
For γ<21, corresponding to summable decay of correlations in Theorem 1.1(a), we obtain the CLT and related results.
Define vn=∑j=0n−1v∘fj.
Also, define Wn(t)=n−1/2vnt for t=0,n1,n2,…,1 and linearly interpolate to obtain Wn∈C[0,1].
Theorem 1.2
Suppose that γ<21. Let v:M→R be Hölder with ∫vdμ=0.
(a)
CLT* n−1/2vn converges in distribution111Here and elsewhere, convergence in distribution (or weak convergence) holds on the probability space (M,μ) and equivalently [67] on the probability space (M,LebM)
where LebM denotes normalised Lebesgue measure on the support of μ.
to a normal distribution G=dN(0,σ2). The variance σ2 is zero if and only if v=χ∘f−χ for some χ measurable.*
(b)
Berry-Esseen* There exists C>0 such that*
[TABLE]
where q=21 for α>3 and q=(α−2)/2 for α∈(2,3)
(Any q<21 works for α=3.)
(c)
Local limit theorem* Suppose that v is aperiodic222Aperiodic means that it is not possible to write v≡χ−χ∘T+constantmodλZ for some χ measurable and λ>0..
For all a,b,κ∈R with a<b, all kn∈R with kn∼κn1/2, and all u∈Cη(M), w:M→R measurable,*
[TABLE]
(d)
WIP*
Wn converges weakly in C[0,1] to Brownian motion W with W(1)=dG.*
(e)
Error rate in WIP* For any q<(α−2/(4α), there exists C>0 such that
π1(Wn,W)≤Cn−q for all n≥1.
*333Let Aϵ denote the ϵ-neighborhood of A. The Prokhorov metric π1 is given by
\pi_{1}(X,Y)=\inf\{{\epsilon}>0:{\mathbb{P}}(X\in A)\leq{\mathbb{P}}(Y\in A^{\epsilon})+{\epsilon}\text{ for all closed sets A\subset C[0,1]}\}.**
(f)
Almost sure invariance principle*
For any ϵ>0, there is a probability space supporting W and a sequence of random variables {v~n;n≥1}
with the same joint distributions as {vn} such that
v~n=W(n)+O(nγ(logn)γ+ϵ) a.e.*
For γ∈(21,1), the CLT with normalization n−1/2 fails for general Hölder observables, and we obtain results on anomalous diffusion.
Let Gα denote the totally skewed α-stable law with
characteristic function
E(eitGα)=exp{−∣t∣α(1−isgnttan2απ)}.
Theorem 1.3
Let v:M→R be Hölder with ∫vdμ=0.
Suppose that
∫Tv(0,θ)dθ=0.
Then there exists c>0 such that
n−1/αvn converges in distribution to cGα.
Moreover the process defined by Wn(t)=n−1/αv[nt] converges weakly in D[0,1] with the M1 topology444We refer to [60, 64] for background information on D[0,1] and the Skorohod M1 topology. to the α-stable Lévy process W with W(1)=dcGα.
Next, we consider large deviation estimates and moment estimates.
Theorem 1.4
Suppose that γ<1 and let v:M→R be Hölder.
(a)
Large deviation estimates*
For any a>0, there exists C>0 such that*
[TABLE]
(b)
Moment estimates* For any p≥1, there exists C>0
such that for all n≥1*
[TABLE]
(c)
Convergence of moments*
If γ<21, then
∫∣n−1/2vn∣pdμ→E∣G∣p for all p<2(α−1).*
If γ∈(21,1), then
∫∣n−1/αvn∣pdμ→E∣cGα∣p for all p<α
where c is the constant in Theorem 1.3.
For γ≥1, Lemma 3.4 states that up to scaling there is a unique absolutely continuous f-invariant σ-finite measure μ, but now μ(M)=∞. We prove the following mixing property for infinite measure systems.
Theorem 1.5
(a)
Suppose that γ>1. There exists c>0 such that
[TABLE]
for all v∈BV∞(M), w∈L1(M)
supported in [43,1]×T.
For γ=1, the same result holds with
n1−α replaced by logn.
(b)
For γ>1, there exists C>0 such that
[TABLE]
for all v∈BV∞(M), w∈L1(M)
supported in [43,1]×T with ∫vdμ=0.
Remark 1.6
The constants c in Theorems 1.1(b), 1.3 and 1.5(a) are given explicitly in Sections 5 and 6.
Remark 1.7
It is an easy but tedious exercise to extend to cases where θ is of general dimension
and f2:Td−1→Td−1 is a general smooth uniformly expanding map with worst expansion sufficiently large (strictly larger than 3 suffices when d=2),
but we restrict to the current situation for readability.
A notationally simpler example would have f2(θ)=2θmod1, but it is well-known that the extra expansion is useful in higher dimensions.
Our assumption that u is sufficiently close to constant is of the same flavour and can be relaxed by assuming sufficient expansivity of f, see Remark 4.8.
1.2 Comparison with other results and methods
There is a considerable amount of work on uniformly expanding maps in higher dimensions. In the analytic setting, see [11, 63].
For C2 maps, still with finitely many branches, see [19, 20, 26].
The paper [46] sets
out a general approach to multidimensional uniformly expanding maps with infinitely many branches. This method could in principle be applied to the first return maps F mentioned in Subsection 1.3. However, the assumptions therein do not hold for the examples in [38, 39] nor the examples (1.3).
(Condition 4 in [46] fails due to the lack of conformality; the condition has the form limϵ→0Aϵ=0 but in our examples Aϵ=∞ for ϵ>0.) Another approach in [59] uses quasi-Hölder spaces, but these also have drawbacks as discussed below.
Turning to multidimensional intermittent maps, we mention the work of [5, 6, 7, 31] which treats examples like those in (1.3) with γ depending on θ. However, these papers require that f is Markovian and hence do not encounter the issues treated here.
In contrast, there are has been very little work on multidimensional nonMarkovian nonuniformly expanding maps. We now list all papers on this topic that we know of.
A large class of multidimensional intermittent maps was considered in [38, 39] using the quasi-Hölder spaces from [59]. In particular, [38] obtained results on existence of absolutely continuous invariant measures, but it was convenient to consider maps that were close to conformal. For statistical limit laws, it seems that quasi-Hölder spaces handle nonconformality of multidimensional maps quite poorly. A more recent paper [10] obtains almost optimal, but still nonoptimal, results on decay of correlations for the maps
in [38, 39]. Moreover, the methods in [10] do
not seem to apply to the maps (1.3) considered here.
1.3 Structure of the paper
The method in this paper starts off, as usual, by constructing a convenient
first return map F:Y→Y, and from then on is a hybrid of two standard methods.
Reinducing enables us to model f by a Young tower with polynomial tails, leading to existence of absolutely continuous invariant measures and a spectral decomposition. For γ∈(0,21), this already yields sharp upper bounds on decay of correlations as well as a number of statistical limit laws. Combining the information on invariant measures with
bounded variation methods for F, we obtain sharp lower bounds on decay of correlations,
as well as
convergence to stable laws and Lévy processes, and results on infinite measure mixing.
This hybrid method bypasses many of the problems associated with multi-dimensional bounded variation (namely, that the function space is not contained in L∞; supports of invariant densities need not a priori have nonempty interior; certain aperiodicity assumptions are hard to verify).
The reinducing step, Lemma 3.1 below, makes use of recent
work [23] based on the method of standard pairs [12, 22], and gives precise joint control on the first return time to Y and the reinducing return time (denoted respectively as φ and ρ below). As already noted, the reinducing approach adopted in [10] seems not applicable for the examples in this paper and in any case gives much less control on return times.
The remainder of this paper is organised as follows.
In Section 2, we
construct a convenient first return map F
and obtain estimates for the first return time and distortion bounds for F. In Section 3,
we derive mixing properties of f and F and results on aperiodicity.
In the process of doing this, we show that f can be modelled by a Young tower with polynomial decay of correlations. We use this to prove Theorems 1.1(a), 1.2 and 1.4.
Section 4
contains functional analytic estimates in bounded variation.
In Section 5, we prove Theorems 1.1(b,c) and 1.5. Finally, we prove Theorem 1.3
in Section 6.
Notation
We use the “big O” and ≪ notation interchangeably, writing an=O(bn) or an≪bn if there is a constant C>0 such that
an≤Cbn for all n≥1.
Also, an=o(bn) as n→∞ means that limn→∞an/bn=0 and
an∼bn as n→∞ means that limn→∞an/bn=1.
We set D={ω∈C:∣ω∣≤1}.
Throughout, ∣⋅∣ denotes Euclidean distance.
2 Estimates for the first return map F
2.1 Construction of F
Let f:M→M, M=[0,1]×T, belong to the class of maps (1.3).
Define
[TABLE]
Then X=⋃i=03Xi is an invariant set for f and f(X)=X.
We induce on the set Y=([43,1]×T)∩X. Let
φ:Y→Z+ be the first return time, with first return map
F=fφ:Y→Y. The sets
[TABLE]
form a (mod [math]) partition αY of Y. Note that F:a→Fa
is a diffeomorphism for each a∈αY.
We have
[TABLE]
Also,
FYn,j∈{([43,1]×T)∩Xi}i=03
for n≥2.
In particular, F has finitely many images, i.e. {Fa:a∈αY} is finite.
Figure 1 is a sketch of f(⋅,θ) and
F(⋅,θ) for θ fixed. Figure 2 is a
schematic picture of the partition
αY={Yn,j:n≥1,1≤j≤4n}.
Proposition 2.1
∣(DF)(y,θ)v∣≥4∣v∣* for all (y,θ)∈Y, v∈R2.*
Proof.
We have Df=\left(\begin{array}[]{cc}4&0\\
0&4\end{array}\right) on Y
and
∣(Df)v∣≥∣v∣ on X.
∎
Proposition 2.2
f:X→X* is topologically exact:
for any nonempty open subset U⊂X, there exists n≥0 such
that fnU⊃X∖{x=0}.*
Proof.
It suffices to consider rectangles U=U1×U2 where
U1⊂[0,1], U2⊂T are intervals. Let
π:M→[0,1] be projection onto the first coordinate.
Note that
[TABLE]
If 43∈πU, then 0∈πfU. Since [math] is a
fixed point and f1 is continuous on [0,43]×T, it
follows from (2.2) that (0,43]⊂πfnU for
all n sufficiently large. Also f2:T→T is continuous and
uniformly expanding, so it is immediate that
(0,43]×T⊂fnU for some n and hence that
fn+1U⊃X∖{x=0}.
For a general rectangle U, it remains to show that
43∈πfnU for some n≥0. Suppose this is not the
case. Since f1 is continuous on [0,43)×T and
(43,1]×T, it follows that πfnU is an interval for
all n. By (2.2), πfnU⊂(43,1] infinitely
often. On each such occasion, diamπfn+1U=4diamπfnU,
so diamπfnU→∞ which is impossible.
∎
Proposition 2.3
F:Y→Y* is topologically exact.*
Proof.
Let U⊂Y be a nonempty open rectangle. If U intersects
the boundary of the strip {φ=n} for some n, then
FU∩({43}×T)=∅. But then FU
contains a partition element Yn,j.
It follows that F2U⊃FYn,j=Y∩Xi for some i and hence that
F3U=Y.
Again, let π denote projection onto the first coordinate.
If FkU does not intersect the boundary of {φ=n} for all
n and all k≥0, then diamπFkU≥4kdiamπU for all k,
which is impossible.
∎
2.2 Estimates for the partition
Recall that u:[0,43]×T→(0,∞) is C2 and
u(0,θ)≡c0>0. In fact, we only use the following consequences of this property:
[TABLE]
as x→0 uniformly in θ.
Proposition 2.4
Suppose that (xn,θn), n≥1, is a
sequence in [0,43]×T such that
fn(xn,θn)=(43,θ) where θ∈T.
Then
[TABLE]
uniformly in θ, where c1=(c0γ)−α and
c′=c11+γc0.
In addition, the curve θ→xn(θ) is C1
and
there exists a constant C>0 independent of
n,θ such that ∣xn′(θ)∣≤Cn−(1+α).
Proof.
By construction, for each choice of inverse sequence θn, the
sequence xn is unique and monotonically decreasing to zero. We
do the computation for θn=θ/4n, but the result is
independent of this choice. Write θ0=θ.
The inverse branch
ψ:M→[0,43]×[0,41] has the form
ψ(x,θ)=(ψ1(x,θ),41θ). Compute that
[TABLE]
where u^(x,θ)=c0+o(1) as x→0 uniformly in θ.
Inductively,
[TABLE]
In particular,
[TABLE]
Since xn→0, we have u^(xj,θj)→c0 and hence
∑j=0n−1u^(ψj(x,θ))=nc0+o(n). Substituting
this into (2.3) yields the desired expression for xn.
Since (xn,θn)=f(xn+1,θn+1), we have
xn=xn+1(1+xn+1γu(xn+1,θn+1)) and so
It is easy to verify that u^ inherits the properties
x∂x∂u^=o(1) and
∂θ∂u^=O(1) imposed on
u. Hence, there is a constant K>0 such that
[TABLE]
The discrete version of Gronwall’s inequality states that if ∣bn∣≤C1+C2∑j=0n−1∣bj∣, then ∣bn∣≤C1(1+C2)n.
Hence
∣xn′(θ)∣≤Kn−(1+α)(1+Kn−1)n≪n−(1+α).
For each n≥1, we have established
smoothness of the curve xn(θ) and the estimate ∣xn′(θ)∣≤Cn−(1+α)
except at finitely many points related to the partition into inverse branches of fn.
Since xn(θ)={(x,θ)∈[0,43]×T1:fn(x,θ)∈{43}×T} is defined intrinsically on the cylindrical domain [0,43]×T1, independent of any choice of partition, these smoothness properties are uniform in θ∈T.
∎
Remark 2.5
It follows from
Proposition 2.4 that if
θ,θ′∈[(j−1)4−n,j4−n] for some j=1,…,4n,
then xn(θ)−xn+1(θ′)∼c′n−(1+α) uniformly in j.
The partition elements Y1,j, 1≤j≤4, are as in (2.1).
The remaining partition elements
Yn,j,
n≥2, 1≤j≤4n, are given by
[TABLE]
where yn(θ)=41(xn−1(f2(θ))+3). Note
that yn′(θ)=xn−1′(θ).
By
Remark 2.5, Yn,j is almost rectangular for n
large, and
yn(θ)−yn+1(θ)∼41c′n−(1+α) uniformly in θ.
Remark 2.6
By choosing u sufficiently close to constant, in
the sense that ∣x∂x∂u∣∞ and
∣∂θ∂u∣∞ are sufficiently
small, we can arrange that
∣xn′(θ)∣ is uniformly small in n and θ.
In fact, we require that ∣xn′(θ)∣<7/72 for
all n and θ. This turns out to be convenient for technical
reasons, see Remark 4.8.
Corollary 2.7
Leb(φ>n)∼41c1n−α* as n→∞. In
particular, φ∈L1 if and only if γ<1. In
addition, Leb(φ=n)∼41c′(n−(1+α)).*
Proof.
Let Cn={xn(θ)}, n≥0, be the smooth curve defined in Proposition 2.4 and let Xn+1 be the region in [0,43]×T to the left of Cn.
Then
Xn+1 consists of precisely those points
in [0,43]×T that require at least n+1 iterates of f
to enter Y for the first time.
By Proposition 2.4,
Leb(Xn)∼c1n−α,
and Leb(Xn−1∖Xn)∼c′n−(1+α).
Now, f maps {φ=n} onto Xn−1∖Xn for n≥2, and
the mapping is 4 to 1. Each branch is linear and scales areas
by a factor of 42, so
Leb({φ=n})=41Leb(Xn−1∖Xn). Hence
Leb(φ=n)∼41c′n−(1+α) and
Leb(φ>n)=41Leb(Xn)∼41c1n−α.
∎
Remark 2.8
Suppose further that u(x,θ)=c0+O(xγ) uniformly in
θ. This property is inherited by u~ and u^
in the above calculations and we obtain that
xn=c1n−α(1+O(n−1logn)) uniformly in θ.
2.3 Distortion estimates
Lemma 2.9
Let (y,θ)∈Yn,j. Then
[TABLE]
This estimate holds uniformly in (y,θ)∈Yn,j, in j, and in
1≤ℓ≤m≤n−1.
Proof.
Let (yk,θk)=fk(y,θ), k=0,…,n−1 and recall from
Proposition 2.4 that
yn−k∼(c0γk)−α as k→∞ uniformly in
the initial choice of θ. Now,
[TABLE]
as x→0 uniformly in θ, so
[TABLE]
It follows that
[TABLE]
where bk(θ)∼k−1 as k→∞ uniformly in
θ. Hence
log∏k=ℓm∂x∂f1(fk(y,θ))∼(1+α)(log(n−ℓ)−log(n−m)) and
the result follows.
∎
Corollary 2.10
Let (y,θ)∈Yn,j. Then
[TABLE]
where A(y,θ)∼4n1+α as
n→∞
and B(y,θ)=O(4n).
These estimates hold uniformly in (y,θ)∈Yn,j and in j.
Proof.
Let zk=fk(y,θ), k=0,…,n−1 and write
[TABLE]
Clearly, (Df)zk is upper triangular with diagonal entries
∂x∂f1(zk) and 4. Hence
(DF)(y,θ) has the required form with
[TABLE]
The required asymptotics for A(y,θ) follows from Lemma 2.9.
Next,
[TABLE]
so by induction,
[TABLE]
By Lemma 2.9,
∏m=ℓk−1∂x∂f1(zm)≪[(n−ℓ)/(n−k)]1+α and so
[TABLE]
yielding the required estimate for B(y,θ).
∎
Let JF=detDF. By Corollary 2.10,
JF∼4n+1n1+α on Yn,j.
Lemma 2.11
There is a constant C>0 such that
[TABLE]
for all (y,θ)∈Yn,j and all n,j.
Proof.
By Corollary 2.10, JF(y,θ)=4nA(y,θ) where
A(y,θ)∼4n1+α uniformly on Yn,j. We
have
[TABLE]
Similarly,
∂θ∂(JF(y,θ))−1∼4−(n+1)n−(1+α)∂θ∂logA(y,θ). Hence, it suffices to show that
[TABLE]
Writing zk=fk(y,θ),
[TABLE]
By (2.4) and Proposition 2.4,
∂x∂f1(zk)∼1 and
∂x2∂2f1(zk)≪zkγ−1≪(n−k)−(1−α). Moreover, it follows from
Lemma 2.9 that
Our assumptions on f1 imply in particular that
∂x∂θ∂2f1 is bounded, so
the second term in (2.6) is O(4n). The calculation at
the end of the proof of Corollary 2.10 shows that
∂θ∂[fk]1(y,θ)≪(n−k)−(1+α)4n. Hence the first term in (2.6)
is bounded up to a constant by
First, we prove the result under the simplifying assumption that a
is a rectangle. In particular, the line segments
[(y,θ),(y′,θ)] and [(y′,θ),(y′,θ′)] lie in
a. By Lemma 2.11 and the mean value theorem,
∣1/JF(y,θ)−1/JF(y′,θ)∣≪4−n∣y−y′∣. By
Corollary 2.10,
4−n∣y−y′∣≪4−nn−(1+α)∣F(y,θ)−F(y′,θ)∣≪infa(1/JF)∣F(y,θ)−F(y′,θ)∣. Hence
∣1/JF(y,θ)−1/JF(y′,θ)∣≪infa(1/JF)∣F(y,θ)−F(y′,θ)∣. Similarly,
∣1/JF(y′,θ)−1/JF(y′,θ′)∣≪infa(1/JF)∣F(y′,θ)−F(y′,θ′)∣. The desired estimate
follows.
In general, Proposition 2.4 ensures that there is a
constant c2>0 such that the line segments lie in the union of
partition elements Ym,j with m≥c2n, and the argument
above is unaffected.
∎
Let αkY denote the refinement of αY into k-cylinders.
Corollary 2.13
There exists a constant C>0 such that
supaJFk≤CinfaJFk for all a∈αkY, k≥1.
Proof.
Write x=(y,θ),x′=(y′,θ′). First suppose that
x,x′∈a, a∈αY. By Corollary 2.12, there is a
constant C1>0 such that
[TABLE]
Hence ∣logJF(x)−logJF(x′)∣≤C1∣Fx−Fx′∣.
Now suppose that x,x′∈a, a∈αkY for some k≥1. Then
In this section, we show that the first return map F:Y→Y has a unique absolutely continuous
invariant probability measure μY and that F is mixing.
We also show that the underlying map f:X→X has a unique (up to scaling) absolutely
continuous invariant σ-finite measure μ. When
γ<1, this is a finite measure and it is mixing.
These results are obtained in Subsection 3.1.
In the process of obtaining these results we show that f is modelled
by a Young tower with polynomial tails. A logarithmic factor in this tail rate is removed in Subsection 3.2. This is already sufficient to obtain many of the results announced in the Introduction, as explained in Subsection 3.3.
In Subsection 3.4, we obtain an aperiodicity property for
F.
Recall that the first return map F:Y→Y is topologically mixing
with finite images, and has bounded distortion. If in addition F
were Markov, then the results in this section would be easier to
deduce from standard results.
Our strategy is to further induce F, with exponential tails, to a
full-branched Gibbs-Markov map G:Z→Z as follows:
Lemma 3.1
There exists a refinement α1Y of the
partition αY for F:Y→Y, an open set Z⊂Y
consisting of a union of elements of α1Y and a map
ρ:Z→Z+ constant on elements of αZ={a∈α1Y:a⊂Z} such that
(a)
G=Fρ:Z→Z* is a full-branched Gibbs-Markov map
with partition αZ.*
2. (b)
Leb(ρ>k)=O(δk)* for some δ∈(0,1).*
3. (c)
gcd{n≥1:{φ=n,ρ=1}=∅}=1.
4. (d)
There exists n≥1 such that
F\big{(}Z\cap\operatorname{Int}\{\varphi=n\}\big{)}=Y.
We postpone the proof of Lemma 3.1 to Appendix A.
Parts (a) and (b) can be proven in the general setting of piecewise
expanding maps, but parts (c) and (d) are specific to our map F.
Part (c) is used to prove that F and f are mixing in Lemmas 3.2 and 3.4 respectively.
Part (d) is
used in the proof of Lemma 3.2 to prove that the invariant density for F is bounded below.
By [1, Theorem 4.7.4],
there exists a unique absolutely continuous G-invariant probability measure μZ on Z. Moreover, μZ is mixing and the density
hZ=dμZ/dLeb is bounded above and below on Z.
3.1 Densities and mixing
In this subsection, we study the mixing properties of f and F, the existence and uniqueness of absolutely continuous invariant measures,
and the boundedness properties of the corresponding densities.
Lemma 3.2
There exists a unique absolutely
continuous F-invariant probability measure μY. The density
hY=dμY/dLeb is bounded above and below and F is mixing.
Proof.
Let G=Fρ:Z→Z be the full-branched Gibbs-Markov map on Z⊂Y obtained in Lemma 3.1, with ergodic invariant probability measure μZ.
By Lemma 3.1(b), ρˉ=∫ZρdμZ<∞.
Form the Young tower g:Δ→Δ where
[TABLE]
The measure μΔ=(μZ×counting)/ρˉ is an
ergodic g-invariant probability measure on Δ. The
projection π:Δ→Y, π(z,ℓ)=Fℓz defines a
semiconjugacy between g and F, and μY=π∗μΔ is an
absolutely continuous F-invariant probability measure on
Y. Since G is full-branch and gcd(ρ(a):a∈αZ)=1 by
Lemma 3.1(c), it follows from [65, Theorem 1] that
μY is mixing.
Next, for E⊂Z measurable,
[TABLE]
It follows that hY≥(1/ρˉ)hZ on Z.
Moreover, letting n≥1 be as in Lemma 3.1(d), for any y∈Y there exists z∈Z∩Int{φ=n} with Fz=y.
Since fn has finitely many continuous branches, M=∣Jfn∣∞<∞.
We obtain
[TABLE]
Hence hY is bounded below. Uniqueness of hY follows.
It remains to show that hY is bounded above. This follows from a
result of Rychlik [57, Theorem 1] once we check three
conditions:
There exists a constant C>0 such that
supaJFk≤CinfaJFk for all a∈αkY, k≥1.
2. 2.
There exists ϵ>0, r∈(0,1) such that if
a∈αkY for some k≥1 and Leb(Fka)<ϵ, then
∑{a′∈αY:Leb(a′∩Fka)>0}supa′1/JF≤r.
3. 3.
∑a∈αYsupa1/JF<∞.
By [57, Theorem 1], there exists an F-invariant
density h1∈L∞(Y). Since hY is the unique F-invariant
density, we have hY=h1 bounded.
Now, condition 1 holds by Corollary 2.13. Condition 2 is
trivially satisfied since the set {Fka:a∈αkY,k≥1} is
finite. By Corollary 2.10,
1/JF∼4−n+1n−(1+α) uniformly on
a=Yn,j,j=1,…,4n as n→∞, and the third
condition follows.
∎
Define τ=φρ=∑ℓ=0ρ−1φ∘Fℓ:Z→Z+.
Proposition 3.3
τ* is Lebesgue integrable (equivalently
∫ZτdμZ<∞) if and
only if γ<1.*
Proof.
A standard argument, see for instance [13, 48], shows that τ=φρ satisfies μZ(τ>n)=O((logn)αn−α).
Integrability for γ<1 follows.
Similarly, μZ(τ>n)≫(logn)−1n−α
(see for example [10, Proposition 5.1(b)]) proving nonintegrability for γ≥1.
∎
Lemma 3.4
There exists a unique (up to scaling)
absolutely continuous f-invariant σ-finite measure μ.
Moreover, the density hX=dμ/dLeb is bounded below.
The measure μ is finite if and only if γ<1, in which
case f is mixing.
Proof.
Since F=fφ:Y→Y and G=Fρ:Z→Z, it follows that
G=fτ:Z→Z.
We proceed similarly to the proof of Lemma 3.2 but with
ρ replaced by τ and F replaced by f. Form the new
Young tower g~:Δ~→Δ~,
[TABLE]
The ergodic g~-invariant measure μZ×counting
is finite if and only if
τˉ=∫ZτdμZ<∞. Equivalently
∫ZτdLeb<∞, and by Proposition 3.3, this
holds if and only if γ<1.
When γ<1, the measure
μ~Δ=(μZ×counting)/τˉ is an
ergodic g~-invariant probability measure on Δ~.
The projection π~:Δ~→X,
π~(y,ℓ)=fℓy defines a semiconjugacy between
g~ and f, and μ=π~∗μ~Δ is an
absolutely continuous f-invariant probability measure.
Lemma 3.1(c) implies that
gcd{τ(a),a∈αZ}=1. Since G is a
full-branch Gibbs-Markov map, it follows
from [65, Theorem 1] that μ~Δ, and hence
μ, is mixing.
Again, as in the proof of Lemma 3.2,
hX≥(1/τˉ)hZ on Z. By Lemma 3.1, Z is open, so by Proposition 2.2
there exists n≥1 such that fnZ=X.
Since fn has finitely many branches, M=∣Jfn∣∞<∞.
Given x∈X, choose z∈Z such that fnz=x. Then
[TABLE]
Hence hX is
bounded below, and uniqueness of μ follows.
When γ≥1, we proceed in the same way but without
normalising by τˉ.
∎
3.2 Tail estimate for τ=φρ
As noted in the proof of Proposition 3.3, the induced return time
τ=φρ satisfies the tail estimate
μ(τ>n)=O((logn)αn−α).
In this subsection, we show how to remove the logarithmic factor using ideas from
Szász and Varjú [61].
Lemma 3.5
μZ(τ>n)=O(n−α).
Following [14, Lemma 5.1] and [61, Lemma 16], the crucial ingredient for proving Lemma 3.5 is the following estimate.
Fix p,q∈(0,1) satisfying p<(1−q)α.
Let
[TABLE]
Proposition 3.6
There exists C>0 such that
[TABLE]
Proof.
For k≥1, denote by Hk the set of inverse branches h:Fkah→ah of Fk.
Define Sn={φ>n1−q}, and notice that
[TABLE]
But h(Sn) is contained in the k-cylinder ah∈αkY while
Yn,j∈αY. Therefore, if h(Sn)∩Yn,j=∅ then ah⊂Yn,j.
It follows that ⋃h∈Hkh(Sn)∩Yn,j⊂⋃h∈Hk:ah⊂Yn,jh(Sn) and so
[TABLE]
Hence
[TABLE]
If ah⊂a, then h=ha∘h~, where ha∈H1 and h~∈Hk−1 are inverse branches with ha:Fa→a.
By Lemma 3.2, the density dμY/dLeb is bounded above and below. Using this and F-invariance of μY,
Let z∈Zb(n). Define φ1(z)=max0≤ℓ<ρ(z)φ(Fℓz)
and choose ℓ1(z)∈{0,…,ρ(z)−1} such that
φ1(z)=φ(Fℓ1(z)z).
Define φ2(z)=max0≤ℓ<ρ(z),ℓ=ℓ1(z)φ(Fℓz).
Now, n≤τ≤φ1+(ρ−1)φ2≤21n+(blogn)φ2.
Hence
[TABLE]
In particular, φ1>φ21−q and φ2>φ11−q for n large.
Choose ℓ2(z)∈{0,…,ρ(z)−1} such that ℓ2(z)=ℓ1(z) and
φ2(z)=φ(Fℓ2(z)).
Suppose for definiteness that ℓ1(z)<ℓ2(z) (the other case is similar).
Let m=φ1(z), k=ℓ2(z)−ℓ1(z).
Then
•
φ(Fℓ1(z)z)=φ1(z)=m;
•
φ∘Fk(Fℓ1(z)z)=φ(Fℓ2(z)z)=φ2(z)>φ1(z)1−q=m1−q;
•
1≤k≤ℓ2(z)≤blogn≤2blogφ1(z)=2blogm
for n large.
Hence, Fℓ1(z)z∈Yb(m) for n large.
We have shown that
[TABLE]
and so
[TABLE]
as required.
∎
Proof of
Lemma 3.5
Let Δ={(z,ℓ)∈Z×Z:0≤ℓ<ρ(z)} be the Young tower from the proof of Lemma 3.2 with probability
measure μΔ=(μZ×counting)/ρˉ.
Recall that μY=π∗μΔ where π(z,ℓ)=Fℓz.
Write max0≤ℓ<ρ(z)φ(Fℓz)=φ(Fℓ1(z)z) where
ℓ1(z)∈{0,…,ρ(z)−1}.
Then
Finally, by Lemma 3.1(a),
μZ(ρ>blogn)=O(δblogn)=O(nblogδ)=o(n−α)
for any b fixed sufficiently large. Hence
μZ(τ>n)=O(n−α) as required.
∎
3.3 Proof of upper bounds for decay of correlations, and various statistical properties
We suppose throughout this subsection that γ<1, and set α=1/γ.
In the proof of Lemma 3.4, we showed that
the intermittent map f:X→X is modelled by a Young tower g~:Δ~→Δ~ with
first return G=fτ:Z→Z.
By Lemma 3.5, the return time tails satisfy
μZ(τ>n)=O(n−α).
Accordingly we can read off
numerous statistical properties that hold for all Hölder (and dynamically Hölder) observables v:X→R.
Recall that π~:Δ~→X, given by π~(z,ℓ)=fℓz is a semiconjugacy between g~ and f. Moreover, we have invariant ergodic probability measures μ~Δ on Δ~ and μ on X where
μ~Δ=(μZ×counting)/τˉ and
μ=π~∗μΔ.
Recall from Lemma 3.1 that G:Z→Z is a full-branched Gibbs-Markov map with partition αZ.
Define the separation time s(z,z′) on Z to be the least integer n≥0 such that Gnz,Gnz′ lie in distinct partition elements in αZ.
For θ∈(0,1) and v:X→R, define
[TABLE]
An observable v:X→R is said to be dynamically-Hölder if ∥v∥Hθ<∞ for some choice of θ.
Proposition 3.8
Hölder observables are dynamically Hölder.
Moreover, for v∈Cη(X), η∈(0,1),
we have ∥v∥Hθ≤2η/2θ−1∥v∥η
where θ=4−η.
Proof.
Let z,z′∈Z with s(z,z′)=n. Then
[TABLE]
so ∣z−z′∣≤24−s(z,z′) for all z,z′∈Z.
Now, let z,z′∈Z, 0≤ℓ<τ(z).
Then
[TABLE]
yielding the desired estimate.
∎
Proof of
Theorems 1.1(a), 1.2 and 1.4
(The proof of Theorem 1.4(c) for γ∈(21,1) is momentarily contingent on Theorem 1.3.)
Given v:X→R, we define the lifted observable v~=v∘π~:Δ~→R. Since π~ is a measure-preserving semiconjugacy, the desired statistical properties for v follow from those for v~.
Also,
∣v∣Hθ=supz,z′∈Z:z=z′sup0≤ℓ<τ(z)θs(z,z′)∣v~(z,ℓ)−v~(z′,ℓ)∣,
so dynamically Hölder observables lie in the standard function space Cθ(Δ~) considered on one-sided Young towers [65].
The upper bound on decay of correlations in Theorem 1.1(a) now follows from [65, Theorem 3].
Next, we turn to Theorem 1.2.
Part (a) holds by [65, Theorem 4].
Parts (b) and (c) follow respectively from [30, Theorems 1.3 and 1.2].
Part (f) is proved in [17, Theorem 5.3] and
part (d) is a standard consequence.
Part (e) is proved in [4, Theorem 2.2].
Finally, we consider Theorem 1.4.
Part (a) follows from Theorem 1.1(a) by [49, Theorem 1.2].
Part (b) is proved in [34, Theorem 1.4].
Part (c) is an immediate consequence of part (b) together with the CLT for
γ<21 and Theorem 1.3 for γ∈(21,1).
∎
Remark 3.9
Alternative references for some of the results in the above proof include [18, 21, 43, 44, 50, 51, 53].
For brevity, we have omitted various other statistical properties that follow from the existence of the Young tower Δ~ such as concentration inequalities [34]. Also, for γ<21,
homogenization (convergence of fast-slow systems to a stochastic differential equation) holds when the fast dynamics is given by f, see [15, 16, 27, 41, 42, 45].
3.4 Aperiodicity
Let S1={ω∈C:∣ω∣=1} and consider the cohomological equation
[TABLE]
where v:Y→S1 is measurable and ω∈S1. If ω=1, then since
F is ergodic, the measurable solutions to equation (3.2)
are precisely the constant solutions. Absence of solutions for
ω=1 is called aperiodicity. In this subsection, we prove:
Lemma 3.10
For each
ω∈S1∖{1} there are no measurable solutions
v:Y→S1 to equation (3.2).
Aperiodicity is useful for ruling out peripheral spectra for certain
twisted transfer operators. Instances of this are seen in
Corollaries 4.10(e) and 5.2(ii) below.
For the moment, consider an arbitrary
ergodic measure-preserving transformations F:Y→Y defined on a
probability space (Y,μY). Let U:L1(Y)→L1(Y) denote the
Koopman operator Uv=v∘F and define the transfer operator
R:L1(Y)→L1(Y), where ∫YRvwdμY=∫YvUwdμY
for all v∈L1(Y), w∈L∞(Y).
For ω∈S1, we define the twisted Koopman and transfer operators
U(ω)v=ωˉφUv=ωˉφv∘F and
R(ω)v=R(ωφv). Note that R(ω) is the L2 adjoint of
U(ω) but that R(ω):L1→L1 is the dual of
U(ωˉ):L∞→L∞. (This discrepancy between adjoints
and duals over the complex numbers is standard.)
Proposition 3.11
Suppose that F:Y→Y is ergodic. Let ω∈S1 and let
v:Y→C be L1. Then U(ω)v=v if and only if R(ω)v=v, in
which case ∣v∣ is constant.
Proof.
First, note that if U(ω)v=v, then ∣v∣∘F=∣v∣ and so ∣v∣ is
constant by ergodicity.
Next, recall that RU=I and hence R(ω)U(ω)=I for all ω. If
U(ω)v=v, then v=R(ω)U(ω)v=R(ω)v, proving one direction.
Conversely, suppose that R(ω)v=v. By duality,
∫YvU(ωˉ)nwdμY=∫YvwdμY for every
w∈L∞ and n≥1.
We claim that v is bounded and ∣v∣∞≤∣v∣1.
Suppose the claim is false. Then there is a set E of positive
measure and c>∣v∣1 such that ∣v∣≥c on E. Choose
w=1Evˉ/∣v∣ on {v=0} and w=1E elsewhere. Then
[TABLE]
The last integrand is dominated by ∣w∣∞∣v∣∈L1 and
converges a.e. to ∣v∣∫Y∣w∣dμY by the pointwise ergodic
theorem. By the dominated convergence theorem,
[TABLE]
Hence c≤∫Y∣v∣dμY which is a contradiction.
This proves the claim, so v is bounded. In particular, v∈L2
and a computation using that R(ω)=U(ω)∗ and R(ω)v=v shows that
⟨U(ω)v−v,U(ω)v−v⟩=0 so that U(ω)v=v as required.
∎
Returning to the intermittent maps (1.3), we obtain
Corollary 3.12
For each
ω∈S1∖{1} there are no L1 functions v:Y→S1
such that R(ω)v=v.
Proof.
This is immediate from Lemma 3.10 and
Proposition 3.11.
∎
To prove Lemma 3.10, we make use of two Young towers
g:Δ→Δ and g~:Δ~→Δ~. The
second of these coincides with the tower in the proof of
Lemma 3.4. The first tower is different from those
considered so far in this paper (in particular, that of
Lemma 3.2), and is defined as follows:
[TABLE]
As in
Lemma 3.4, we have ergodic g-invariant and
g~-invariant
measures μΔ=μY×counting and
μ~Δ=(μZ×counting)/σˉ on
Δ and Δ~.
(When γ<1,
it follows from Corollary 2.7 and
Lemma 3.2 that φˉ=∫YφdμY<∞ and
hence we can normalize further by φˉ to obtain probability measures
μΔ and μ~Δ.)
Remark 3.13
A standard strategy, used below, to establish aperiodicity is to
show that g is weak mixing. This is made complicated by that fact
that g is nonMarkov, so we pass to the Markov extension
g~. (This is similar in spirit, though the notation is more
complicated, to the derivation of mixing properties for F from
mixing properties for G in Subsection 3.1.)
Recall that τ:Z→Z+,
τ=φρ=∑i=0ρ−1φ∘Fi. Write
φj=∑i=0j−1φ∘Fi. Any element of
Δ~ can be written uniquely as (z,φj(z)+ℓ)
where 0≤j≤ρ(z)−1 and 0≤ℓ≤φ(Fjz)−1, valid
for z∈Z.
Define
[TABLE]
Proposition 3.14
πΔ* is a measure-preserving semiconjugacy from g~
to g.*
Proof.
To verify that πΔ is a semiconjugacy (πΔ∘g~=g∘πΔ), we show that
πΔ∘g~(z,φj(z)+ℓ)=g∘πΔ(z,φj(z)+ℓ) for all z,j,ℓ.
Now,
[TABLE]
Also,
[TABLE]
Hence πΔ is a semiconjugacy.
It remains to show that
(πΔ)∗μ~Δ=μΔ. It suffices to test this for sets E×{ℓ} where E is a measurable subset of a partition element
a⊂Z, a∈αZ, and 0≤ℓ≤φ(a)−1.
By (3.1),
μΔ(E×{ℓ})=μY(E)=(1/ρˉ)∫Z∑j=0ρ−11E∘FjdμZ.
On the other hand
[TABLE]
This completes the proof.
∎
Proof of
Lemma 3.10
Suppose that u:Δ~→S1 is measurable and
u∘g~=ωu for some ω∈S1.
Define V:Z→S1, V(z)=u(z,0).
Then V(Gz)=u(Gz,0)=u∘g~τ(z)(z,0)=ωτ(z)V(z).
Since G is a full branch Gibbs-Markov map, for every a∈αZ there
exists za∈a with Gza=za and so V(za)=ωτ(a)V(za).
Hence ωτ(a)=1 for all a.
By Lemma 3.1(c),
gcd{τ(a),a∈αZ}=1 and it follows that ω=1.
In other words, g~:Δ~→Δ~ is weak mixing.
By Proposition 3.14, g:Δ→Δ is weak mixing. Again
this means that the equation
u∘g=ωu has no measurable solutions u:Δ→S1
for each ω∈S1∖{1}.
Let ω∈S1∖{1} and suppose that v:Y→S1 is a
measurable solution to (3.2). Define
u(y,ℓ)=ωℓv(y). Then u:Δ→S1 is measurable. If
ℓ≤φ(y)−2, then
u∘g(y,ℓ)=u(y,ℓ+1)=ωℓ+1v(y)=ωu(y,ℓ). If
ℓ=φ(y)−1, then
u∘g(y,ℓ)=u(Fy,0)=v(Fy)=ωφ(y)v(y)=ωℓ+1v(y)=ωu(y,ℓ).
This shows that u∘g=ωu which is impossible since g is weak mixing. Hence there are
no such measurable solutions to (3.2).
∎
4 Estimates in two-dimensional BV
Let λm denote m-dimensional Lebesgue measure.
For v∈L1(Y), define the variation
[TABLE]
where the supremum is taken over all compactly supported C1 test functions
ω:R2→R2 such that ∣ω∣∞≤1.
Let BV(Y) consist of those functions v∈L1(Y) such that
Varv<∞. This is a Banach space with norm ∥v∥BV=∫Y∣v∣dλ2+Varv.
Recall that C1 functions lie in BV(Y) and
Varv=∫Y∣∇v∣dλ2 for such functions,
where ∣∇v∣=(∣∂v/∂y∣2+∣∂v/∂θ∣2)21.
We use the fact [25, Remark 2.14] that if w is continuous on a set U with Lipschitz boundary and w is C1 on IntU, then
Var(1Uw)=∫U∣∇w∣dλ2+∫∂U∣w∣dλ1.
(The measure will often be suppressed when the meaning is clear.)
The following standard result [25, Theorem 1.17] allows us to reduce to considering C1 functions v:R2→R in many estimates.
Proposition 4.1
Let v∈BV(Y). There exists a sequence of C1 functions vn:R2→R such that vn→v in L1(Y)
and limn→∞Varvn=Varv. ∎
Corollary 4.2
Let A:L1(Y)→L1(Y) be a bounded linear operator.
If Var(Av)≤C1∫Y∣v∣+C2Varv for all v∈C1,
then
Var(Av)≤C1∫Y∣v∣+C2Varv for all v∈BV(Y).
Proof.
Let v∈BV(Y) and choose a sequence vn as in Proposition 4.1.
Let ω be a C1 test function.
Since Avn→Av in L1(Y),
[TABLE]
Taking the supremum over ω yields the desired result.
∎
We make some additional observations that are used in Section 5.
Remark 4.3
Returning to Proposition 4.1, suppose in addition that v∈L∞(Y).
Then the sequence vn can be chosen to have the additional property that
supY∣vn∣≤3∣v∣∞.
To see this we use the notation from the proof of [25, Theorem 1.17]
where v is denoted by f and the approximating sequence vn is denoted by
fϵ=∑iηϵi⋆(fφi). It is immediate from the definitions in [25] that
supY∣fϵ∣≤3maxisupY∣ηϵi⋆(fφi)∣≤3maxi(∫Y∣ηϵi∣)supY∣fφi∣≤3∣f∣∞.
Let BV∞(Y)=BV(Y)∩L∞(Y)
with norm ∥v∥BV∞=∣v∣∞+Varv.
Corollary 4.4
BV∞(Y)* is a Banach algebra.*
Proof.
Let v,w∈BV∞(Y).
By Remark 4.3, there exists a sequence of C1 functions
vn such that vn→v in L1(Y), supY∣vn∣≤3∣v∣∞
and Varvn→Varv. Let wn be a similar approximating sequence for w.
Note that vnwn is C1 and hence lies in BV, while ∫Y∣vnwn−vw∣≤supY∣vn∣∫Y∣wn−w∣+(∫Y∣vn−v∣)∣w∣∞≤3∣v∣∞∫∣wn−w∣+∣w∣∞∫Y∣vn−v∣→0 as n→∞.
Hence it follows from [25, Theorem 1.9] that
Var(vw)≤liminfn→∞Var(vnwn).
Since vn and wn are C1, we have
Var(vnwn)≤supY∣vn∣Varwn+supY∣wn∣Varwn.
Hence
[TABLE]
It follows that
[TABLE]
as required.
∎
Throughout the remainder of this section, ∣v∣1 denotes ∫Y∣v∣dλ2.
4.1 Boundary terms
The primary difficulty in dealing with multidimensional BV is the occurrence
of certain boundary terms.
Let a∈αY denote a partition element and consider the branch Fa:a→Fa.
Let ∂Fa denote F∣∂a:∂a→∂Fa
with 1-dimensional derivative D∂Fa.
For the Lasota-Yorke inequality (Subsection 4.2 below) given v∈C1,
we are required to estimate
terms of the form
[TABLE]
relative to the BV norm ∥v∥BV(Y).
In one dimension, BV(Y) is embedded in L∞ which simplifies the
estimates considerably. For higher dimensions, much more work is required,
see [19, 20, 26] and references therein.
Our main results in this subsection are:
Lemma 4.5
Let v:R2→R be C1.
There is a constant C1>0 such that
[TABLE]
Lemma 4.6
Let v:R2→R be C1.
Suppose that u is sufficiently close to constant as in
Remark 2.6. Then there exists κ0∈(0,43), and
for any N0≥1, there exists a constant C2>0 such that
[TABLE]
for all a∈αY with φ(a)≤N0.
An immediate consequence is:
Corollary 4.7
Let v:R2→R be C1.
There exists κ0∈(0,43) and
C3>0 such that
[TABLE]
∎
In the remainder of this subsection, we prove Lemmas 4.5
and 4.6.
Recall from Section 2.2
that the partition elements form a ‘rectangular’ grid {Yn,j,n≥1,j=1…,4n} where there are infinitely many columns Cn, n≥1, bounded by ‘vertical’ curves ξn(θ), 0≤θ≤1.
The column Cn is divided into 4n partition elements {Yn,j} bounded by horizontal lines θ=j4−n, j=0,…,4n.
In particular, the partition element a=Yn,j is given by
On the horizontal edges,
∂Fa(y,θ0)=F1(y,θ0) since horizontal lines are mapped to horizontal lines.
By Corollary 2.10, D∂Fa=A
and ∣D∂Fa/JFa∣=4−n. Hence
On the ‘vertical’ edges,
by Corollary 2.10, ∣D∂Fa∣≪4n
and ∣D∂Fa/JFa∣≪n−(1+α). Hence
[TABLE]
Combining (4.3) and (4.4), we obtain the result.
∎
Proof of
Lemma 4.6
We apply Theorem B.1. Since u is nearly constant as in Remark 2.6, we
have ∣M∣∞<7/72 by Remark 2.6 and hence
[TABLE]
where κ0<43.
Hence ∫∂a∣v∣≤K(a)∣1av∣1+4κ0∣1a∇v∣1
where K(a) is a constant.
The result follows since ∣D∂Fa/JFa∣≤41.
∎
Remark 4.8
We can relax the artificial condition in Remark 2.6 by increasing the expansivity of f so that D∂Fa/JFa is sufficiently small.
Alternatively, we could consider higher iterates.
But now we have to check that the calculations in
Lemma 4.5 remain intact. Note that Lemma 3.1 also requires a
certain amount of expansion for F to overcome the complexity
growth of discontinuities of F.
4.2 Lasota-Yorke inequality
Let F:L1(Y)→L1(Y) be the transfer operator corresponding to F relative to Lebesgue measure.
(So ∫YFvwdλ2=∫Yvw∘Fdλ2 for all v∈L1, w∈L∞.)
Then Fv=∑a1Fa(gv)∘Fa−1
where g=1/∣det(DF)∣=(JF)−1.
Also, for ω∈D, we consider the twisted transfer operator F(ω)
given by F(ω)v=F(ωφv),
so
[TABLE]
We note that
[TABLE]
Lemma 4.9
There exist constants C>0 and κ1∈(0,1) such that
[TABLE]
Proof.
By Corollary 4.2, it suffices to prove this for v∈C1.
First we consider the case ω=1.
Note that (gv)∘Fa−1 is C1 on Fa, and so
[TABLE]
Now,
[TABLE]
where C1=supa∣(∇g)(DFa)−1∣JFa<∞ by Corollary 2.14
and we have used the fact that ∣DF∣≥4.
Also,
[TABLE]
We have shown that
[TABLE]
Applying Corollary 4.7, we obtain
Var(Fv)≤C∣v∣1+κ1Varv,
with κ1=41+κ0.
For general ω, we have an extra factor of ∣ω∣φ(a) throughout.
Since ∣ω∣≤1 and φ≥1, this is bounded by ∣ω∣.
∎
Corollary 4.10
*(a)
1 is a simple eigenvalue for F:L1(Y)→L1(Y)
with eigenfunction hY=dμY/dLeb.
(b)
F(ω):L1(Y)→L1(Y) has spectral radius at most ∣ω∣
for all ω∈D.
(c)
Let κ1∈(0,1) be as in Lemma 4.9.
Then F(ω):BV(Y)→BV(Y) has
essential spectral radius at most κ1∣ω∣ for all ω∈D.
(d) hY∈BV∞(Y).
(e)
Regarding F(ω) as operators on BV(Y), it holds that
1 is a simple isolated eigenvalue in specF and
1∈specF(ω) for all ω∈D∖{1}.*
Proof.
(a) We have FhY=hY so 1 is an eigenvalue for F.
Simplicity follows from the fact that hY is the unique invariant density
(Lemma 3.2).
(c,d)
By (4.5) and Lemma 4.9,
∥F(ω)v∥BV≤∣ω∣{(C+1)∣v∣1+κ1∥v∥BV}.
Since the unit ball in BV(Y) is compact in L1(Y), the estimate on
the essential spectrum radius follows from [35].
Moreover, 1 is an eigenvalue for F:BV(Y)→BV(Y) by [35]. By Lemma 3.2, the corresponding density coincides with hY,
so hY∈BV(Y).
Also, hY∈L∞(Y) by Lemma 3.2.
(e)
By part (c), it suffices to consider the multiplicity of 1 as an eigenvalue
for F(ω) acting on L1(Y).
Hence the result follows from part (a) for ω=1 and part (b)
for ∣ω∣<1.
Finally, we note that
F(ω)=hYR(ω)hY−1 where
R(ω) is the normalized transfer operator corresponding to the
invariant measure μY.
By Corollary 3.12, 1 is not an eigenvalue for
R(ω) when ω∈S1∖{1}.
Hence the same holds for
F(ω).
∎
There exists a constant C>0 such that
∫{φ=n}∣v∣dLeb≤Cn−(1+α)∥v∥BV
for all v∈BV(Y).
Moreover, for v∈BV(Y),
[TABLE]
where the one-sided limit v(43+,θ)=limy→43+v(y,θ) exists for
almost every θ and is integrable.
Taking v to be the density hY, we obtain
[TABLE]
Proof.
By [25, p. 29], Varv=∫Varyvdθ=∫Varθvdy
where (Varyv)(θ) denotes the one-dimensional variation of v(⋅,θ) in the y-variable, and similarly for (Varθv)(y).
Recall from Section 2.2 that for n≥1,
{φ=n}={(y,θ):y∈[yn(θ),yn−1(θ)],θ∈T} and that yn−1−yn∼41c′n−(1+α) uniformly in θ.
Hence for a.e. θ,
[TABLE]
so
[TABLE]
This completes the proof of the first statement.
Next, note that BV functions restrict
to BV functions on almost all one-dimensional slices
(see [46, Lemma A.1, third statement] which is based
on [24, Section 5.10.2, Theorem 2].
Moreover, one-dimensional BV functions have one-sided limits. Hence
J(θ)=limy→0+v(43+y,θ) exists a.e. and
is measurable (being a limit of measurable functions by Fubini’s theorem).
For a.e. θ,
[TABLE]
Hence J is integrable and
both sides of (4.6) are well-defined.
Let An=n1+α∫{φ=n}vdLeb−41c′∫TJ(θ)dθ.
To prove validity of (4.6), we must show that limn→∞An=0.
Write
[TABLE]
We apply the dominated convergence theorem.
We have already seen that
Bn is dominated by the L1 function ∫∣v(y,⋅)∣dy+Vary+41c′∣J∣.
Next,
[TABLE]
The first term converges to zero a.e. by the estimate for yn−1−yn.
Also, yn→43+, so
[TABLE]
by the definition of J(θ).
Hence Bn(θ)→0 a.e. completing the proof of (4.6).
The estimate for μY(φ>n) follows immediately.
∎
4.4 Estimates for ∥Fn∥BV
Define the family of operators Fn:BV(Y)→BV(Y), n≥1, given by
Fnv=F(1{φ=n}v).
Next, we estimate Var(Fnv). By Corollary 4.2,
it suffices to do this for v∈C1.
Adapting the calculations in the proof of Lemma 4.9, we have
Var(Fnv)≤I1+I2+I3,
where
[TABLE]
We consider partition elements of the form a=Yn,j.
By Corollary 2.14,
∣1a(∇g)(DFa)−1JF∣∞=O(1).
Hence I1≪∫{φ=n}∣v∣≪n−(1+α)∥v∥BV by Proposition 4.11.
By (2.7), ∣(DFa)−1∣∞≪n−(1+α).
Hence I2≪n−(1+α)∫{φ=n}∣∇v∣≤n−(1+α)∥v∥BV.
Finally, by Lemma 4.5 and
Proposition 4.11,
I3≪∫{φ=n}∣v∣+n−(1+α)∫{φ=n}∣∇v∣≪n−(1+α)∥v∥BV.
∎
5 Lower bounds on decay of correlations and infinite measure mixing
By Proposition 4.11, the return time φ is integrable if and only if γ<1.
In this section, we establish lower bounds on decay of correlations
for a class of observables supported on Y when γ<1.
Also, for γ≥1, we obtain results on mixing for the infinite measure μY for the same class of observables.
By Lemma 3.2, the invariant density hY=dμY/dLeb is
bounded above and below, so the Lp spaces with respect to μY
and Leb are identical and we can just write Lp(Y). We have
BV(Y)⊂L2(Y) since the domain Y is two-dimensional.
The transfer operator R corresponding to the F-invariant measure
μY is given by Rv=hY−1F(hYv). Again, we consider
the twisted transfer operators
R(ω)v=R(ωφv)=hY−1F(ω)(hYv). These act
naturally on the Banach space B(Y)=hY−1BV(Y) which
consists of functions v:Y→R such that hYv∈BV(Y) with norm
∥v∥B=∥hYv∥BV.
Similarly we define Rn:B→B, n≥1, given by Rnv=R(1{φ=n}v)=hY−1Fn(hYv).
Recall that hY∈BV∞(Y)=BV(Y)∩L∞(Y).
Proposition 5.1
BV∞(Y)⊂B(Y)⊂L2(Y).
Proof.
Let v∈B(Y). Then
∫v2dLeb≤∣hY−2∣∞∫(hYv)2dLeb≪∥hYv∥BV2=∥v∥B2 establishing the second inclusion.
For the first inclusion, let v∈BV∞(Y).
By Corollary 4.4,
hYv∈BV∞(Y)⊂BV(Y), so
v∈B(Y).
∎
Corollary 5.2
*Consider the operators
R(ω):B(Y)→B(Y).
(i) 1 is a simple isolated eigenvalue in the spectrum of R.
(ii) 1∈specR(ω) for all ω∈D∖{1}.
(iii) ∥Rn∥B=O(n−(1+α)).*
Proof.
Multiplication by hY−1 is an isomorphism from
BV(Y)→B(Y) that conjugates F(ω) to
R(ω). Hence R(ω) inherits properties of F(ω) in
Corollary 4.10.
Similarly, Rn inherits properties of Fn in Lemma 4.12.
∎
For observables v,w supported in Y, we can
write ∫vw∘fndμ=∫Tnvwdμ where
Tn=1YLn1Y and L is the transfer operator for f.
Defining T(ω)=∑n=0∞Tnωn, we recall from [58, Proposition 1] the operator renewal equation T(ω)=(I−R(ω))−1.
Proof of
Theorem 1.1(b,c)
Recall that F is the first return map to Y so μY=μ∣Y/μ(Y).
By Corollary 5.2, we have verified the assumptions of Gouëzel [28].
Let v∈B(Y) and w∈L2(Y)555In general, we require w in
L2 since Proposition 5.1 only gives B⊂L2. For v∈BV∞, we can take w∈L1..
By [28, Theorem 1.1],
[TABLE]
But ∑j>nμY(φ>j)∼γ(α−1)−1c2n−(α−1)
with c2 as given in Proposition 4.11.
Part (b) follows with c=μ(Y)γ(α−1)−1c2.
Proof of
Theorem 1.5
By Corollary 5.2 we have verified the
assumptions in Gouëzel [33, Theorem 1.4] and
Melbourne & Terhesiu [52, Theorem 2.1].
Let dγ=π1sinαπ.
Let c2 be the constant in Proposition 4.11
and define c4=μ(Y)γc2.
For γ>1, we obtain
[TABLE]
for all v∈B(Y) and w∈L2(Y).
For γ=1 the asymptotic holds with
dγ=1 and n1−α replaced by logn.
Part (a) follows with c=dγ/c4.
Part (b) is a consequence of [52, Theorem 2.2(c)].
∎
6 Convergence to stable laws and Lévy processes
In this section, we prove Theorem 1.3.
Set α=γ1∈(1,2) and
let Gα denote the totally skewed α-stable law in Theorem 1.3.
Define
σ=41c′γ∫ThY(43+,θ)dθΓ(1−α)cos2απ
where c′ is as in Proposition 2.4.
Proposition 6.1
n−1/α∑j=0n−1(φ∘fj−∫YφdμY)→dσ1/αGα.
Proof.
We verify the conditions stated in Appendix C.
Taking ω=1 in Corollary 5.2, we see that R:B(Y)→B(Y) satisfies the required spectral gap condition.
Let ψ=φ−∫YφdμY. This is an L1 function with mean zero. Clearly ψ is bounded below. By Proposition 4.11,
μY(ψ>x)∼σ1x−α
where
σ1=41c′γ∫ThY(43+,θ)dθ.
Hence condition (C.1) is satisfied (with σ2=0).
Define Rt=R(eit) for t∈R. By Section 5, Rt is a bounded linear operator on B(Y) for all t.
Note that Rt=∑n=1∞Rneint.
It follows from Corollary 5.2(iii) that
∑n=1∞n∥Rn∥B<∞ so t↦Rt is C1.
In particular, ∥Rt∥B=O(∣t∣).
The result now follows from Theorem C.1 (with β=1).
∎
Proposition 6.2
Let v:X→R be Hölder. Suppose that v(0,θ)≡I
for some I∈R. Define V=∑ℓ=0φ−1v∘fℓ.
Then V−Iφ∈Lp(Y) for some p>α.
Proof.
Let η∈(0,1) be the Hölder exponent for v and suppose without loss that η<γ. Set δ=ηα∈(0,1).
Since φ∈Lq(Y) for all q<α, it suffices to show that
V−Iφ=O(φ1−δ).
Let (y,θ)∈Yn,j.
Then
[TABLE]
Write fℓ(y,θ)=(yℓ,θℓ).
Then fℓ(0,θ)=(0,θℓ),
so
∣V(y,θ)−Iφ(y,θ)∣≤∣v∣η∑ℓ=0n−1yℓη.
By Proposition 2.4,
yℓ≪(n−ℓ)−α for ℓ=0,…,n−1, so
∣V−Iφ∣≪∣v∣ηn1−ηα≪φ1−δ as required.
∎
Proof of
Theorem 1.3
First we prove the result under the additional assumption
that v(0,θ) is independent of θ. Evidently
this constant value is Iv, so Proposition 6.2
implies that V−Ivφ∈Lp(Y) for some p>α.
This is [54, condition (3.2)].
Also, [54, condition (3.1)] follows from
Proposition 6.1.
Hence convergence to the desired stable law follows from [54, Theorem 3.1] with c=φˉ−1/αIvσ.
Define M1=max1≤ℓ′≤ℓ≤φ(vℓ′−vℓ)∧max1≤ℓ′≤ℓ≤φ(vℓ−vℓ′)
where vℓ=∑j=0ℓ−1v∘fj.
Suppose for definiteness that Iv>0 (the case Iv is treated similarly).
The calculation in Proposition 6.2
shows that vℓ=Ivℓ+O(φ1−δ) for all
0≤ℓ≤φ. Hence
[TABLE]
Since Iv>0 it follows that M1≪φ1−δ.
By [54, Proposition 3.5], n−1/αmaxj≤nM1∘Fj→p0 on (Y,μY).
Hence convergence to the desired Lévy process follows from [54, Theorem 3.2(a)].
Finally, we relax the additional assumption on v.
Write v=v′+v′′ where
v′′(y,θ)=v(0,θ)−Iv.
We have Wn=Wn′+Wn′′ where
[TABLE]
Note that v′′, and hence v′, is Hölder and mean zero.
Moreover, v′(0,θ)≡Iv, so
Wn′→wW in (D[0,∞),M1).
Also, u(θ)=v′′(y,θ) is a Hölder mean zero observable for the uniformly expanding map f2:T→T, so
n−1/2∑j=0[nt]−1u∘f2j converges weakly to Brownian motion in the uniform topology
(see for example [36, Theorem 5] which establishes the ASIP and hence the weak convergence).
Hence n−1/2∑j=0[nt]−1v′′∘fj converges weakly, so
Wn′′→w0. The result follows.
∎
Appendix A Construction of the Gibbs-Markov map G
This section is devoted to the proof of Lemma 3.1. The main step is to verify the hypotheses of
Theorem 3 of [23].
This is done using Theorem A.1 below.
Recall that Y⊂R2 is endowed with the Euclidean metric
∣(y1,θ1)−(y2,θ2)∣=((y1−y2)2+(θ1−θ2)2)1/2.
For x∈R2 and A⊂R2, let d(x,A)=infy∈A∣x−y∣
(with d(x,A)=∞ if A=∅).
Given A⊂R2, ε>0, define
[TABLE]
where ∂A is the boundary of A as
a subset of R2.
We prove that the first return map F:Y→Y satisfies the following properties:
Theorem A.1
Let Λ∈(41,31). There exists ε0∈(0,1) and
C>0 such that the following hold:
Uniform expansion:*
∣Fa−1z1−Fa−1z2∣≤Λ∣z1−z2∣
for all z1,z2∈a with ∣z1−z2∣<ε0 and all a∈αY.*
Bounded distortion:*
(JFa−1)(z1)≤eC∣z1−z2∣(JFa−1)(z2)
for all z1,z2∈a and all a∈αY.*
Controlled complexity:*
For every open set I⊂Y with diamI≤ε0 and
all ε<ε0,*
[TABLE]
Set Z:*
For all δ>0 sufficiently small, there exist rectangles Z,Z′⊂Y with LebZ<LebZ′ and diamZ′≤δ such that*
[TABLE]
and, there exists
a1,a2∈αY such that
ai⊂Z and
Fai⊃Z′ for i=1,2 and
[TABLE]
Proof of
Lemma 3.1
Theorem A.1 implies in particular that we have verified the hypotheses of [23, Theorem 3]. This guarantees the existence of the desired refinement α1Y, the subset Z (as given in Theorem A.1), the return time ρ:Z→Z+ constant on elements of αZ={a′∈α1Y:a′⊂Z} and the induced map G=Fρ:Z→Z. Moreover, conditions (a) and (b) of Lemma 3.1 follow directly from [23, Theorem 3](a),(c).
In addition, [23, Theorem 3](b) states that
Leb({ρ=1}∩ai)>0 for i=1,2.
This combined with (A.2) guarantees that
Lemma 3.1(c) holds.
Finally, Lemma 3.1(d) follows from (A.1).
∎
In the next four subsections, we verify the four properties listed in Theorem A.1.
A.1 Uniform expansion
By Proposition 2.1,
∣DFa−1∣≤41 on Fa for all a∈αY.
Lemma A.2
For every δ>0 there exists
ε0>0 such that for all z1,z2∈Fa with
∣z1−z2∣<ε0 and all a∈αY,
there exists a path
γ:[0,1]→R2 contained in Fa, joining
z1 and z2, and having length bounded by
(1+δ)∣z1−z2∣.
Proof.
The boundary of Fa is a rectangle except that its right
boundary is a C1 curve which we denote by ψ.
Denote the line segment joining z1
and z2 by S. If S lies in Fa, then take
γ to be the path corresponding to this line segment. If
not, then S intersects the boundary of Fa. Let
p1,p2 be the points of intersection closest to
z1,z2, respectively. Define γ to be the path
corresponding to starting at z1, travelling on S until
p1, then travelling on the boundary of Fa until
p2 and then continuing on S to z2. Since ψ
is smooth, the length of γ can be made arbitrarily close to
the length of S by choosing ε0 sufficiently
small. (The path γ may not be entirely contained in
Fa, but a small translation of it will be entirely inside
Fa.)
∎
Choose δ so that 41(1+δ)<Λ, and fix ε0
as in Lemma A.2.
Let z1,z2∈Fa with ∣z1−z2∣<ε0 and choose γ as in
Lemma A.2.
Now,
Fa−1z2−Fa−1z1=(Fa−1∘γ)(1)−(Fa−1∘γ)(0)=∫01D(Fa−1∘γ)(t)dt,
so by Lemma A.2,
Suppose
I is a non-empty measurable bounded subset of the plane and
E is a straight line cutting I into left and right parts
Il and Ir. Then for all ε≥0, 0≤ξ≤1,
[TABLE]
In Proposition A.5 we generalize to the case
where E is the graph of a Lipschitz function, but first we prove a
lemma which is similar in flavour but applies to segments which may or
may not intersect I. This lemma would follow from the one above if
0≤ξ≤1 and S (taking the place of E) were a
hyperplane in R2 cutting through I.
Given a straight line segment S∈R2 and x∈R2, define
d⊥ as follows. Suppose
x∈R2. If there exists a line that passes through x,
intersects S and is perpendicular to S, then
d⊥(x,S)=d(x,S). If not, then
d⊥(x,S)=∞. If S is the graph of a piecewise
constant function, then one can define d⊥(x,S)
similarly.
Lemma A.4
Suppose I is a measurable
bounded subset of the plane and S is a straight line segment in
the plane. Then for all ε≥0, ξ≥0,
[TABLE]
Proof.
Fix ε≥0, ξ≥0. Let
[TABLE]
We show that LebA≤ξLebB.
Let ez be the line perpendicular to S at the point
z∈S and let Az=A∩ez and
Bz=B∩ez. Given ε′>0 and an interval
Jε′ of length ε′ inside ez, denote
Az(ε′)=Az∩Jε′. Points of
Az(ε) are by definition at least distance ε from
∂I so there exists a translate of Az(ε)
along ez that lies in Bz. It follows from translation
invariance of Lebesgue measure Lebz on ez that
LebzAz(ε)≤LebzBz.
Let us write ξ=⌊ξ⌋+{ξ}, where {ξ}
denotes the fractional part of ξ. Since Az
can be partitioned by
⌊ξ⌋ sets of the form Az(ε) plus
one remainder set of the form Az({ξ}ε), it
follows that
[TABLE]
Now we show that
LebzAz(ε{ξ})≤{ξ}LebzBz bounding the second term of
(A.5). If z∈S∖I, then
Az(ε{ξ})=∅ because {ξ}<1, so
we are done. Otherwise, if z∈S∩I, the claim follows
directly from the proof of Lemma A.3 given in
[8, p.1364] because 0≤{ξ}<1.
We have proved that
LebzAz≤ξLebzBz.
Integrating over z∈S with respect to Lebesgue measure on
S, we obtain LebA≤ξLebB as required.
∎
Proposition A.5
Suppose I is a measurable
bounded subset of the plane and E is the graph of an
L-Lipschitz function in the plane.
Then for all ε≥0, 0≤ξˉ≤1
[TABLE]
In other words,
Leb((I∩∂~εξˉE)∖∂εI)≤ξˉ(1+L)Leb∂εI.
Proof.
Suppose E is the graph of the Lipschitz function
ψ:R→R.
By a rotation of I and E, we can suppose that
the domain of ψ is the horizontal axis.
Fix ε≥0, 0≤ξˉ≤1. For t>0, let
{Aj} be a partition of the horizontal axis R into intervals of length tε.
Define
gt:R→R, gt∣Aj≡(LebAj)−1∫Ajψ, and
denote S=graphgt.
Note that ∣ψ−gt∣∞≤Ltε.
We claim that
[TABLE]
Here d⊥(x,E) means the vertical distance from x to
E.
Since ∣ψ−gt∣∞≤Ltε, it follows from the claim that
[TABLE]
where ξt=ξˉ(1+L)+Lt.
Now applying Lemma A.4 with ξ=ξt on
constant pieces graph(gt∣Aj) of S
separately and adding the contributions, we get
[TABLE]
Since t>0 is arbitrary, we obtain the desired result.
It remains to prove the claim. Write x=(x1,x2) and choose z=(z1,z2)∈E with ∣x−z∣≤εξˉ. Let v=(v1,v2)∈E with v1=x1.
Then
[TABLE]
as required.
∎
Verification of controlled complexity
Set Λn=supj∣DFn,j−1∣ and note that Λn≤41<Λ.
Also, Λn=O(n−(1+α)) by (2.7).
Recall that Yn=⋃j=14nYn,j is bounded by two flat horizontal sides and two smooth vertical curves. By Proposition 2.4, the Lipschitz constants corresponding to the vertical curves are bounded by some L0>0.
We choose n0≥1 sufficiently large so that
∑n=n0∞ΛΛn(1+L0)≤81
and then shrink ε0 if needed so that if I⊂Y has diamI≤ε0 then
at least one of the following holds:
(i)
I⊂⋃n=1n0Yn and
I∩⋃n=1n0∑j=14n∂Yn,j consists of
at most one horizontal curve H and one vertical curve V.
(ii)
I⊂⋃n=n0∞Yn.
In case (i), H is flat and V is smooth.
Recall that Λ<31.
Shrinking ε0 further, we can suppose that I∩V is the graph of a function with Lipschitz constant L1 satisfying
3+L1<Λ−1.
Let I⊂Y be an open subset with diamI≤ε0.
Note that
[TABLE]
Recall that ∂Yn,j=Hn,j∪Vn,j
where Hn,j consists of two flat horizontal edges and
Vn,j consists of two vertical curves.
Hence
[TABLE]
Case (i). Since the only intersections are with H and V, (A.6) simplifies to
[TABLE]
By Proposition A.5 (taking
ξˉ=1 and replacing ε by
εΛ),
We estimate SH and SV separately.
The curve Vn=⋃j=14nVj,n is smooth with Lipschitz constant bounded by L0, and
[TABLE]
By Proposition A.5 (taking
ξˉ=Λn/Λ and replacing ε by
εΛ),
[TABLE]
Hence, by the choice of n0,
[TABLE]
Shrinking ε0 further if necessary, it follows from the
skew-product structure of F (where vertical distances are contracted by 4−φ) that Λn can be improved to 4−n in the formula for SH leading to the estimate Leb∂εΛILebSH≤41.
Hence again we obtain the desired complexity bound
[TABLE]
A.4 Set Z
The construction of Z and Z′ proceeds as follows:
Recall that the partition elements in αY accumulate on
the left vertical side {43}×T of Y.
Let c=1/100 and let S0,S1 denote open squares with side lengths cδ and 2cδ, respectively, and centred at l0=(43,0). Let Z=S0∩Y and Z′=S1∩Y.
It is immediate that Z′⊃Z, LebZ<LebZ′, and
diamZ′≤δ.
Now Z is a rectangle with vertex l0,
and elements of αY
accumulate at l0 and shrink in diameter. Hence there exists
n0≥2, i0≥1 such that Yn,i⊂Z for all n≥n0, i=1,…,4(modin), where in=4n−n0(i0−1).
For n≥n0,
[TABLE]
proving (A.1).
Setting
a1=Yn0,in0+1 and a2=Yn0+1,(in0+1)+1,
we have ai⊂Z and Fai⊃[43,1615]×T⊃Z′ for i=1,2.
Moreover, φ∣a1=n0 and φ∣a2=n0+1, verifying (A.2).
Appendix B Boundary terms
In this appendix we recall some standard estimates for computing
integrals around the boundary of “rectangular” domains. Consider a
domain of the form
[TABLE]
where ψ1,ψ2:[C,D]→R are C1 with ψ1<ψ2.
Define M:[C,D]→R,
M(θ)=max{∣ψ1′(θ)∣,∣ψ2′(θ)∣}.
Theorem B.1
Let v:R2→R be a C1 function. Then
[TABLE]
First, we consider the special case where a is a rectangle.
Proposition B.2
Suppose that a=[A,B]×[C,D]
is a rectangle and that v is C1. Write
∂a=Ha∪Va where Ha is the union of the two
horizontal edges and Va is the union of the two ‘vertical’ edges.
Then
[TABLE]
Consequently,
∫∂a∣v∣≤K∣1av∣1+2∣1a∇v∣1 where
K=2(B−A)−1+2(D−C)−1.
Proof.
We give the details for the horizontal edges. The vertical edges
are dealt with in the identical manner. The final statement follows
from the fact that ∣x∣+∣y∣≤2(x2+y2)21.
Note that
∫Ha∣v∣=∫AB∣v(y,C)∣dy+∫AB∣v(y,D)∣dy.
(Throughout, we work in the coordinate system (y,θ).) On the
bottom edge,
[TABLE]
where a1 is the rectangle [A,B]×[C,(C+D)/2]. But
[TABLE]
and it follows that
[TABLE]
The same estimate holds for the top edge ∫AB∣v(y,D)∣dy, but
with a1 replaced by a2=[A,B]×[(C+D)/2,D]. Since
a1∪a2=a we obtain the required estimate for ∫Ha∣v∣.
∎
To prove Theorem B.1, we introduce the diffeomorphism
g:a→[−1,1]×[C,D] given by
[TABLE]
where
h(y,θ)=21(ψ2(θ)−ψ1(θ))y+21(ψ2(θ)+ψ1(θ)).
Note that Jg=1/∂yh=2/(ψ2−ψ1).
Proposition B.3
∣∂θh(y,θ)∣≤M(θ)=max{∣ψ1′(θ)∣,∣ψ2′(θ)∣}* for all
y∈[−1,1], θ∈[C,D].*
Proof.
Write
∂θh=21(ψ2′−ψ1′)y+21(ψ2′+ψ1′). If
ψ2′>ψ1′, then the maximum value m2 and minimum value
m1 are obtained at y=1 and y=−1 respectively yielding
m2=ψ2′ and m1=ψ1′ respectively. The values are
reversed if ψ2′<ψ1′.
∎
Vertical edges
Let γ1 be the left edge and γ2 the right edge and
write Va=γ1∪γ2.
Lemma B.4
Let v:R2→R be a C1 function.
Then
[TABLE]
Proof.
[TABLE]
where w:[−1,1]×[C,D]→R is given by
w=v∘g−1(1+(∂θh)2)1/2. Similarly,
∫γ1∣v∣=∫CD∣w(−1,θ)∣dθ.
Proof of
Theorem B.1
We combine the contributions from Lemmas B.4
and B.5. The coefficient of the ∣1av∣1 term is
immediate. The remaining terms yield
[TABLE]
The result follows since
∣∂θv∣+∣∂yv∣≤2∣∇v∣.
∎
Appendix C Convergence to a stable law
In this appendix, we describe a general functional-analytic framework for establishing convergence to a stable law. Our presentation follows [2, Theorem 6.1] with a simplification due to [32].
Let F:Y→Y be an ergodic measure-preserving transformation on a probability space (Y,μY) with transfer operator R:L1(Y)→L1(Y).
Let B(Y)⊂L1(Y) be a Banach space containing constant functions.
In particular, 1 is a simple eigenvalue for R:B(Y)→B(Y).
We assume that there is a spectral gap for R:B(Y)→B(Y), so specR⊂{1}∪Bκ(0) for some κ<1.
Let ψ∈L1(Y) with ∫YψdμY=0, and suppose that
there are constants σ1,σ2≥0 with σ1+σ2>0, and α∈(1,2), such that
[TABLE]
Define
[TABLE]
It follows from these assumptions on ψ (see [40, Theorem 2.6.5]) that
[TABLE]
Define the twisted transfer operators Rt:L1(Y)→L1(Y), t∈R, by
Rtv=R(eitψv).
Our final assumption is that there exists t0>0, α′∈(21α,1] and C>0 such that
Rt restricts to an operator Rt:B(Y)→B(Y) and
∥Rt−R∥B≤C∣t∣α′ for all ∣t∣<t0.
Let ψn=∑j=0n−1ψ∘Fj.
Theorem C.1
Under the above assumptions,
n−1/αψn→dσ1/αGα,β
where Gα,β is the α-stable law with characteristic
function
E(eitGα,β)=exp{−∣t∣α(1−iβsgnttan2απ)}.
Proof.
The argument is by now standard. Since we could not find the result stated in the literature, we give the details.
Since t↦Rt:B(Y)→B(Y) is continuous at t=0,
there exists t1∈(0,t0], κ0∈(κ,1) and λt∈B1(0),
such that λt is a simple isolated eigenvalue for Rt
and
specRt⊂{λt}∪Bκ0(0)
for all ∣t∣<t1.
Moreover, ∣λt−1∣≪∣t∣α′.
Let wt∈B(Y) denote the family of eigenfunctions corresponding to λt with w0=1. Shrinking t1 if necessary, we can ensure that wt>0.
In particular, we can normalize so that ∫YwtdμY=1 for all ∣t∣<t1.
Let Pt be the corresponding family of spectral projections with
P0v=∫YvdμY. Again ∥Pt−P0∥B≪∣t∣α′.
We have
[TABLE]
Let κ1∈(κ0,1).
Then there exists a constant C>0 and functions a1(t), a2(t,n)
such that
[TABLE]
and
[TABLE]
for all ∣t∣<t1, n≥1.
Next,
[TABLE]
Now fix t∈R. Then
[TABLE]
as n→∞.
Replacing t by tσ−1/α,
it follows from the Lévy continuity theorem that
σ−1/αn−1/αψn→dGα,β.
∎
Remark C.2
Similarly, following [3], if
μY(∣ψ∣>x)∼(σ2+o(1))x−2 as x→∞,
then λt=1+σ2t2log∣t∣+o(t2log∣t∣).
(Here, we require that ∥Rt−R∥B≤C∣t∣.) The above argument then shows that
(nlogn)−1/2ψn→dN(0,σ2).
Remark C.3
We have restricted to tails of the form μY(∣ψ∣>x)=ℓ(x)x−α where limx→∞ℓ(x)=c for some c>0, since this suffices for our examples. The general case with ℓ slowly varying goes through as in [2, 3].
Acknowledgements
The research of PE and IM was supported in part by a European Advanced
Grant StochExtHomog (ERC AdG 320977).
Bibliography67
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] J. Aaronson. An Introduction to Infinite Ergodic Theory . Math. Surveys and Monographs 50 , Amer. Math. Soc., 1997.
2[2] J. Aaronson and M. Denker. Local limit theorems for partial sums of stationary sequences generated by Gibbs-Markov maps. Stoch. Dyn. 1 (2001) 193–237.
3[3] J. Aaronson and M. Denker. A local limit theorem for stationary processes in the domain of attraction of a normal distribution. Asymptotic methods in probability and statistics with applications (St. Petersburg, 1998) , Stat. Ind. Technol., Birkhäuser Boston, Boston, MA, 2001, pp. 215–223.
4[4] M. Antoniou and I. Melbourne. Rate of convergence in the weak invariance principle for deterministic systems. Comm. Math. Phys. 369 (2019) 1147-1165.
5[5] W. Bahsoun, C. Bose and Y. Duan. Decay of correlation for random intermittent maps. Nonlinearity 27 (2014) 1543–1554.
6[6] W. Bahsoun and C. Bose. Mixing rates and limit theorems for random intermittent maps. Nonlinearity 29 (2016) 1417–1433.
7[7] W. Bahsoun, C. Bose and M. Ruziboev. Quenched decay of correlations for slowly mixing systems. Trans. Amer. Math. Soc. 372 (2019) 6547–6587.
8[8] P. Bálint and I. P. Tóth. Exponential decay of correlations in multi-dimensional dispersing billiards. Ann. Henri Poincaré 9 (2008) 1309–1369.