Equivalence of physical and SRB measures
in random dynamical systems
Alex Blumenthal
Department of Mathematics, University of Maryland, College Park, Maryland, USA. Email: [email protected]. This material is based upon work supported by the National Science Foundation under Award No. DMS-1604805.
Lai-Sang Young
Courant Institute of Math. Sciences, New York University, New York, USA. Email: [email protected]. This research was supported in part by NSF Grant DMS-1363161.
Abstract. We give a geometric proof, offering a new and quite different perspective
on an earlier result of Ledrappier and Young on random transformations [10]. We show that under
mild conditions, sample measures of random diffeomorphisms are SRB measures.
As sample measures are the limits of forward images of stationary measures, they
can be thought of as the analog of physical measures for deterministic systems.
Our results thus show the equivalence of physical and SRB measures in the random
setting, a hoped-for scenario that is not always true for deterministic maps.
In this paper, we prove for random dynamical systems a result
one would have liked to have for deterministic systems (referring to
systems defined by maps or flows) except that for deterministic systems,
such a result is likely not true without some additional hypotheses.
Ideal picture for deterministic systems
To motivate our result, consider first a deterministic system on Rd (or on a finite
dimensional manifold) with an attractor. An “ideal picture” – which we do not
claim to be mathematically proven or even necessarily true
but which physicists often take for granted – might be
as follows: Lebesgue measure in the basin, transported forward by the map or flow,
converges to an invariant measure on the attractor. This measure, called
a physical measure in [5], is the natural invariant measure from
an observational point of view. For systems with some hyperbolicity, it is also
an SRB measure, characterized by having smooth conditional measures
on unstable manifolds; see, e.g., [5, 19].
The equivalence of physical and SRB measures can be justified
heuristically as follows:
As mass is transported forward by a system with hyperbolicity, it is compressed
along stable directions and spread out along unstable
directions, eventually aligning itself with unstable manifolds. Reasoning geometrically
as we have done, it follows that the limiting
distribution will have the SRB property. This indeed was how Ruelle
first constructed SRB measures for Axiom attractors in [17].
Reality is a little more complex outside of the Axiom A category, however: First, there is
no guarantee that the pushed forward measures will converge. Second,
Newhouse’s phenomenon of infinitely many sinks [14]
implies that for maps that are not uniformly hyperbolic,
accumulation points
of the pushed forward measures can fracture into many ergodic
components, some of which can be Dirac measures supported on sinks.
Another example to keep in mind is the figure-eight attractor
[15]. This is a rather extreme example, but it points to
the fact that without adequate control, a sequence of measures that
seemingly aligns itself with unstable manifolds need not converge to
an SRB measure.
Random dynamical systems
By a random dynamical system (RDS) in this paper, we refer to the
composition of i.i.d. sequences of random diffeomorphisms.
RDS are used to model dynamical systems with a stochastic component
or experiencing small random fluctuations. Solutions of stochastic differential
equations (SDE) are known to have representations as stochastic flows of diffeomorphisms,
the time-t-maps of which are compositions of i.i.d. sequences of random
diffeomorphisms; see, e.g., [1, 8].
In the world of RDS, it is quite natural for the stationary measure to
have a density, so let us for the moment confuse the stationary measure
with Lebesgue measure. Also, ergodicity is achieved easily in such RDS, and with
ergodicity, one does not have to be concerned with the fracturing of
the limit measure. Under these assumptions, all of
which are quite mild for RDS, we prove that the reasoning in the
“ideal picture” above is valid.
Main Result (informal version). *Consider an ergodic RDS
{fωn}, the stationary measure μ of which has a density.
Assume the system has a positive Lyapunov exponent.
Then for almost every sample path ω, (fθ−nωn)∗μ
converges as n→∞ to a random SRB measure μω.
Here θn is time shift
on the sequence of random maps. *
A precise formulation is given in Section 1. Under the conditions above,
we have also an entropy equality, which asserts that pathwise entropy
is equal to the sum of positive Lyapunov exponents. That follows easily once
we have the SRB property,
by a proof identical to that for deterministic systems.
The results above are not new. They were first proved by Ledrappier and Young
[10] and subsequently extended to random endomorphisms by Liu, Qian and Zhang [13]; see
also the more recent book [16] of Qian, Xie and Zhu.
In these earlier proofs, the authors showed that the RDS satisfies
an entropy equality, from which they deduced the SRB property of μω
by appealing to another theorem. This last result, which provides
the crucial link to random SRB measures, is not elementary,
especially when zero Lyapunov exponents are present;
see [9] for a complete proof in the nonrandom case.
We mention also the recent result [3] of Brown and Rodriguez-Hertz
for random surface diffeomorphisms, proved under an assumption of randomness for Es.
The proof presented here is new and different, and we think it has the following merits:
One, it is conceptually more transparent and confirms the intuition behind
the “ideal picture” discussed above. Two, it highlights clearly the differences between deterministic
and random dynamical systems; and three, our proof is more generalizable as we will show
in forthcoming papers. For example, the proof of the entropy formula in
[10] involves conditional densities
on the stable foliation,
ruling out immediately direct generalizations to semiflows defined
by dissipative PDEs, for which stable manifolds are always infinite
dimensional.
Finally, one of our motivations for presenting a more accessible proof
is that there has been some renewed interest in random dynamical
systems, and in the idea of random SRB measures in particular. We mention
two recent applications in which these ideas have appeared: one is
the reliability of biological and engineered systems (see, e.g., [11])
and the other is in climate science (see, e.g., [4]).
1 Setting and statement of results
We begin with the definition of a random dynamical system, abbreviated
as RDS.
Let Ω be a Polish space, and let P be a Borel probability measure
on Ω. Let M be a compact Riemannian manifold, and consider
a Borel measurable mapping ω↦fω
from Ω→ Diff2(M), the space of C2
diffeomorphisms from M onto itself equipped with the C2-metric.
An RDS consists of compositions of sequences of maps from
{fω,ω∈Ω}
chosen i.i.d. with law P.
For ω=(ωn)n∈Z∈ΩZ and n∈Z, we write
[TABLE]
One considers also one-sided compositions fω+n
for ω+∈ΩZ+:=∏n>0Ω and n>0.
There are several ways to view an RDS. One is as a Markov chain (Xn)
on M defined by fixing an initial condition X0∈M and setting
Xn+1=fωn+1(Xn).
Equivalently, we define the transition probabilities of the chain by
[TABLE]
for x∈M and Borel sets E⊂M.
A Borel probability measure μ on M is said to be stationary
if for all Borel sets E⊂M,
[TABLE]
Another viewpoint is to represent an RDS as a measure-preserving skew product
map. Here it is important to distinguish between the two-sided and one-sided
cases. Let θ:ΩZ→ΩZ be the leftward shift
preserving the probability P=PZ on ΩZ, and let
θ+:ΩZ+→ΩZ+ be the corresponding shift
preserving P+=PZ+. Then the skew product maps
corresponding to the RDS above are given by
[TABLE]
and Lemma 1 identifies the relevant invariant measures of τ and τ+:
Lemma 1**.**
A Borel probability measure μ on M is a stationary measure of the
Markov chain (Xn) if and only if μ×P+ is an invariant
measure of τ+:M×ΩZ+→M×ΩZ+.
Given μ as above, there is a unique τ-invariant probability measure μ∗ on M×ΩZ that projects onto μ×P+.
The next lemma gives more information on the disintegration
of μ∗ on M-fibers, i.e., the family of probability measures
{μω,ω∈ΩZ} on M with the property that for all continuous
φ:M×ΩZ→R, we have
[TABLE]
Lemma 2**.**
The measures μω are invariant in the sense that for each
ω=(ωn)∈ΩZ,
[TABLE]
For P-a.e. ω∈ΩZ,
[TABLE]
It follows that μω depends only on ωn for n≤0.
Lemmas 1 and 2 are standard; see, e.g., Chapter 1 of [1] for details.
Lemma 2(b) tells us that the μω, which are called sample measures, are
in fact the conditional distributions of μ given the history of the dynamical system,
ω−=(ωn)n≤0. Intuitively, they
represent what we see at time [math] given that the transformations fωn,n≤0, have occurred.
Given an RDS together with a stationary measure μ, certain properties of
deterministic systems (f,m), where f is a single diffeomorphism and m
an invariant measure, extend in a straightforward way to the RDS
via their skew product representations.
We assume throughout that
[TABLE]
These conditions are satisfied by the time-one maps of a large class of SDEs [6]. Under these assumptions,
the following are known: For one-sided skew products,
Lyapunov exponents of fω+n are defined μ-a.e. for P+-a.e.
ω+, as are stable manifolds corresponding to
negative Lyapunov exponents. For the two-sided skew-product, Lyapunov
exponents of fωn are defined μ∗-a.e., as are stable
and unstable manifolds. Lyapunov exponents are nonrandom. Another nonrandom
quantity of the RDS is pathwise entropy, which we denote by hμ({fω+n}).
See [1, 7] for more information.
As a direct generalization of the idea of SRB measures in the deterministic case, we have
the following:
Definition 3**.**
Let {fω} and μ be given.
We say the μω are random SRB measures if
-
fωn has a positive Lyapunov exponent μ∗-a.e. and
-
for P-a.e. ω, the sample measure μω has absolutely continuous conditional
measures on unstable manifolds.
The main result of this paper can now be stated formally as follows:
Main Theorem. Let {fω} be a RDS satisfying (1), and let μ be an ergodic
stationary measure. We assume that
1. μ≪Leb with a continuous density, and
2. {fω+n} has a positive Lyapunov exponent (μ×P+)-a.e.
*Then the μω are random SRB measures. *
Corollary. Let {fω} be as in the Main Theorem. Then the entropy formula
[TABLE]
holds. Here hμ({fω+n}) is pathwise entropy, and λ1>λ2>⋯>λd denote the Lyapunov exponents of (fω+n) with multiplicities mi,1≤i≤d.
As noted in the Introduction, the results above were first proved
in [10]. They were subsequently extended
to random endomorphisms in [13], and to compositions
that are not necessarily i.i.d. in [16].
In all of these papers, the result in the Corollary is first proved,
and the result in the Main Theorem is deduced from that by appealing to
the RDS version of the entropy formula characterization for SRB measures.
Here we prove these results in the opposite order: we give a direct proof
of the SRB property of μω. Once that is proved, the Corollory follows
immediately by a proof identical to that in the deterministic case.
Our proof of the Main Theorem will proceed as follows. For P-a.e. ω,
we consider (fθ−nωn)∗μ:=μωn, which we know converges to
μω as n→∞ by Lemma 2(b).
It suffices to show that μω has smooth conditional probabilities on unstable
manifolds, and we will prove that by showing that the geometric argument in the
“ideal picture” in Section 1 can, in fact, be made rigorous for RDS.
One of the technical novelties of this paper is our analysis of orbits with finite pasts.
For RDS, this is both important and natural, for the set of “typical” points changes with knowledge of
the past: with zero knowledge of the past, μ-a.e. x is “typical”;
starting from time −n,
typicality as seen at time [math] is with respect to μωn,
and as n→∞, this measure becomes μω.
The following notation will be used throughout:
On M: TxM is the tangent space at x, ∥⋅∥ is the norm on TxM,
d(⋅,⋅) is the distance on M inherited from the
Riemannian metric, and B(x,r)={y∈M:d(x,y)<r}.
If E⊂TxM is a subspace, then E(r)={v∈Tx:∥v∥≤r}.
On Rd,d≥1, norms are denoted ∣⋅∣, and balls centered
at the origin by B(⋅); see
Sect. 2.1 for detail.
2 Preliminaries and Main Proposition
In this section, we consider exclusively the two-sided skew product
[TABLE]
with invariant probability measure μ∗. Sects. 2.1–2.4 contain
some preliminary facts that will be used later on. In Sect. 2.5, we formulate
the Main Proposition (Proposition 12) and explain why
it implies the Main Theorem. The proof of Proposition 12 will
occupy the rest of this paper.
2.1 Two-sided charts for random maps (mostly review)
Assuming the existence of a strictly positive Lyapunov exponent, we first
record some properties enjoyed by two-sided Lyapunov charts
at μ∗-a.e. (x,ω) for the skew-product map τ.
Details of chart construction will be omitted as the results are entirely analogous
to those for deterministic maps, and such charts have been used before for RDS
(see, e.g., [1], Chapter 4 for more detail).
We will include only those properties that are relevant for subsequent discussion.
Proposition 4** (Linear picture).**
There exist λ0>0 and a τ-invariant Borel measurable subset
Γ⊂M×ΩZ with μ∗(Γ)=1
such that on Γ there is a measurable splitting
[TABLE]
with respect to which the following hold for each (x,ω):
limn→∞n1log∥df(x,ω)−n∣E(x,ω)u∥=−λ0;**
limn→∞n1log∥df(x,ω)n∣E(x,ω)cs∥≤0;* and*
limn→±∞∣n∣1log∥πτn(x,ω)u/cs∥=0.
Here, π(x,ω)u/cs denotes the projection onto E(x,ω)u/cs
along E(x,ω)cs/u.
Below we formulate a system of adapted charts for the two-sided dynamics.
Let Ru=RdimEu,Rcs=RdimEcs (recall that
since μ is an ergodic stationary measure, hence (τ,μ∗) is ergodic,
we have that dimE(x,ω)u/cs is constant along Γ).
For w=u+v∈Ru×Rcs, we define ∣w∣=max{∣u∣,∣v∣} where
∣u∣ and ∣v∣ are Euclidean norms on Ru and Rcs respectively.
For r>0, we let Bu/cs(r)={v∈Ru/cs:∣v∣≤r}, and write B(r)=Bu(r)+Bcs(r).
Proposition 5** (Nonlinear picture).**
Fix δ0,δ1,δ2>0 with δ0,δ2≪λ0 and δ1 sufficiently small, and let λ=λ0−δ0. Shrinking Γ by a set of μ∗-measure 0
(and continuing to call it Γ), there are defined on Γ
a Borel measurable family of invertible linear maps
[TABLE]
with L(x,ω)Ru=E(x,ω)u and L(x,ω)Rcs=E(x,ω)cs, and
a measurable function
l:Γ→[1,∞) satisfying e−δ2≤ll∘τ≤eδ2 ,
with respect to which the following hold. Let the chart at (x,ω) be given by
[TABLE]
and define the connecting maps between charts to be
[TABLE]
Then (a) for any y,y′∈Φ(x,ω)B(δ1l(x,ω)−1), we have
[TABLE]
and (b) f~(x,ω) satisfies
∣(df~(x,ω))0u∣≥eλ∣u∣* for u∈Ru and ∣(df~(x,ω))0v∣≤eδ0∣v∣ for v∈Rcs;*
Lip(f~(x,ω)−(df~(x,ω))0∣B(δl(x,ω)−1))≤δ*
for all δ∈(0,δ1) ; and*
Lip(df~(x,ω))≤l(x,ω).
A difference in Proposition 5 from the single diffeomorphism case
is that in (b2) and (b3) above, we needed to take into consideration the possibly unbounded
sequence of C2 norms ∥fωn±∥C2,n∈Z. We account for this
by taking l≥l1, where
[TABLE]
is finite P-almost surely by our integrability condition (1).
As in the deterministic case, we also have the notion of uniformity sets,
i.e., sets of
the form Γl0:={l≤l0} for fixed l0≥1.
2.2 Continuity of Eu and Ecs
For a single diffeomorphism, the continuity of Eu and Ecs on uniformity sets is well known.
We formulate and prove here the RDS versions that will be needed later on.
For ω∈ΩZ,
we write ω=(ω−,ω+)∈ΩZ−×ΩZ+,
where ΩZ−=∏n≤0Ω and
ΩZ+=∏n>0Ω.
Proposition 6** (Continuity of Eu and Ecs).**
Let l0≥1 be fixed. Then
for fixed ωˇ+∈ΩZ+,
(x,ω)↦E(x,ω)cs
is continuous among (x,ω)∈{l≤l0}∩{ω+=ωˇ+}.
for fixed ωˇ−∈ΩZ−, (x,ω)↦E(x,ω)u is continuous
among (x,ω)∈{l≤l0}∩{ω−=ωˇ−}. Specifically, for
any ϵ>0, there exists n0=n0(ϵ,l0) and η=η(ϵ,l0) such that if
(x,ω),(y,ω′)∈{l≤l0} are such that ω−i=ω−i′ for all
0≤i≤n0−1, then
[TABLE]
Here, for E⊂TxM,E′⊂TyM, we have written
dH(E,E′) for the Hausdorff distance
between the unit balls of E and E′.
Since all considerations are local, we will assume, via the use of charts, that
we are working in Euclidean space where
there is a canonical identification of tangent spaces. Part (a) is standard: Ecs depends only on the future ω+=(ωi)i≥1.
Later on we will need the “finite past” version of Part (b), which
says that the dependence of Eu on the far past,
i.e., on (ω−i)i≥n for large n, is weak,
and we give a proof of it.
Proof of (b).
Let x,y∈M be nearby points and ω,ω′∈ΩZ be such that
(x,ω),(y,ω′)∈{l≤l0}. Assume that ω−i=ω−i′ for all 0≤i≤n0−1 for some n0∈N to be specified.
Crucially, in the argument below we work exclusively with the maps fω−i−1, 0≤i≤n0−1. For ease of notation, let us write f−i:=fω−(i−1)−1∘⋯∘fω0−1, x−i=f−ix,y−i=f−iy, and dfx−i−1=(dfω−i−1)x−i.
Let v∈E(x,ω)u be a unit vector and write v=v^+vs according to the splitting E(y,ω′)u⊕E(y,ω′)cs of TyM. It suffices to bound ∥vs∥≤ϵ when d(x,y) is suitably small. To begin, we estimate:
[TABLE]
The first term is bounded ≤l0e−n0(λ−δ2) by Proposition 5. For
the second term, we bound
[TABLE]
Here, for ω∈Ω we write ∥dfω−1∥,∥d2fω−1∥ for uniform norms over M and have used repeatedly the bound
∥dfω−i−1∥,∥d2fω−i−1∥≤eiδ2l1(ω)≤eiδ2l0. We now compute a lower bound on ∥dfy−n0v∥:
[TABLE]
having used the estimate ∥v^∥≤∥π(y,ω′)u∥≤l(y,ω′)≤l0.
Collecting,
[TABLE]
Fix n0=n0(ϵ,l0) large enough that the first term is <ϵ/2. Now, choose η=η(ϵ,l0,n0) so
that the second term is <ϵ/2 when d(x,y)<η.
∎
2.3 Graph transforms and unstable manifolds
We begin by recalling the definition of local unstable manifolds.
Proposition 7** (Unstable Manifold Theorem).**
Let Γ be as in Proposition 5, and let δ>0 be sufficiently small. Then there is a unique family of measurably-varying maps {g(x,ω):Bu(δl(x,ω)−1)→Rcs}(x,ω)∈Γ and
a constant C>0 such that
[TABLE]
for every (x,ω)∈Γ. Moreover,
g(x,ω)* is C1+Lip, and (dg(x,ω))0=0;*
Lip(g(x,ω))≤1/10, Lip(dg(x,ω))≤Cl(x,ω); and
if z1,z2∈f~(x,ω)−1(graphgτ(x,ω)), then
[TABLE]
We write W(x,ω),δu=Φ(x,ω)(graphg(x,ω)), where g(x,ω) is as
above. The sets W(x,ω),δu are the local unstable manifolds at
(x,ω).
The global unstable manifold
[TABLE]
is an immersed submanifold of M.
Since Proposition 7 is well-known, we omit its full proof.
We do, however, note that it can be proved by graph transform techniques, some details of which
we recall here for later use. For a Lipschitz continuous map g:Bu(δl(x,ω)−1)→Rcs, we define
the graph transform T(x,ω)g of g, when it exists, to
be the mapping T(x,ω)g:Bu(δl(τ(x,ω))−1)→Rcs for which
[TABLE]
The following Lemma summarizes what we will need about
T(x,ω):
Lemma 8**.**
Let δ>0 be sufficiently small.
Let g:Bu(δl(x,ω)−1)→Rcs be such that
(i) g is C1+Lip with Lip(g)≤1/10 and
(ii) there exists z∈graphg
such that z∈B(21δl(x,ω)−1)∩f~(x,ω)−1B(21δl(τ(x,ω))−1).
Then T(x,ω)g:Bu(δl(τ(x,ω))−1)→Rcs exists,
with graphT(x,ω)g⊂B(δl(τ(x,ω))−1). Moreover,
T(x,ω)g is C1+Lip and satisfies Lip(T(x,ω)g)≤1/10.
Let g1,g2 be as in (a), with (ii) replaced by gi(0)=0.
Then T(x,ω)gi(0)=0, and
[TABLE]
where
[TABLE]
and c∈(0,1) is a constant independent of (x,ω).
Lemma 8 is standard and its proof is omitted.
Next, we recall the following distortion estimate along unstable leaves.
As is well-known, the quality of such distortion estimates is a function only of the uniformity estimates at the end of the trajectory, as we describe below.
Lemma 9**.**
Let δ>0 be sufficiently small. Then for any l0>1, there exists D=D(l0)>0 for which the following holds. Let (x,ω)∈Γ be such that l(x,ω)≤l0, and let p1,p2∈W(x,ω),δu. For arbitrary n≥1, write W=Wτ−n(x,ω),δu. Then,
[TABLE]
As before, to control the possible unboundedness of the sequence ∥fωn±∥C2,
we incorporated l1 into the definition of l as in Sect. 2.1. Details are left to the reader.
2.4 Stacks of unstable leaves
All μω-typical points have Wu-leaves passing through them, so μω itself can be thought of as being supported on a union of Wu-leaves.
At issue is whether the conditional measures of μω on these leaves are
in the Lebesgue measure class.
One way to articulate these ideas geometrically is to group nearby
Wu-leaves into a stack. We introduce here some language that
will be useful later on.
*Switching axes. *
Let x,y∈M be nearby points,
and let TxM=Ex⊕Fx,TyM=Ey⊕Fy
be such that dH(Ex,Ey),dH(Fx,Fy) ≪1. For z=x,y, write πz:TzM→Ez
for the projection parallel to Fz.
Given a mapping ϕy:Dom(ϕy)→Fy defined on a set Dom(ϕy)⊂Ey,
we write ϕyx:Dom(ϕyx)⊂Ex→Fx for the mapping,
if it can be uniquely defined, such that
[TABLE]
Below we give a condition to guarantee the well-definedness of ϕyx.
Lip(⋅) refers to
Lipschitz constants with respect to the norms ∥⋅∥.
Lemma 10**.**
Given L>1,ρ>0, there exist ϵ1=ϵ1(L,ρ)≪ρ and ϵ2=ϵ2(L) such that the
following holds. Assume that
∥πx∥,∥πy∥≤L;
d(x,y)<ϵ1;
dH(Ex,Ey),dH(Fx,Fy)<ϵ2; and
ϕy:Ey(2ρ)→Fy(21ρ)* is a Lipschitz mapping with Lip(ϕy)≤1/10.*
*Then ϕyx exists, is defined on Ex(ρ) with \phi_{y}^{x}\big{(}E_{x}(\rho)\big{)}\subset F_{x}(\rho), and has Lip(ϕyx)≤2Lip(ϕy). Moreover, expygraphϕy∣Ey(21ρ)⊂expxgraphϕyx∣Ex(ρ).
*
The proof is straightforward and is left to the reader
(for more detail, see Sect. 5 of [2]).
For l0>1, let
[TABLE]
and let A denote the closure of the set A.
Lemma 11**.**
Let δ>0 be as in Proposition 7, and
let l0>1 be fixed. For all r=r(l0,δ) and ϵ=ϵ(l0,δ,r)
sufficiently small (in particular, ϵ≪r), the following holds.
Fix ω∈ΩZ and x∗∈Γl0,ω.
View x∗ as a reference point, and write
E∗u/cs(r)=E(x∗,ω)u/cs(r) and
E∗(r)=E∗u(r)+E∗cs(r). Then
*for each x∈B(x∗,ϵ)∩Γl0,ω, there is a C1+Lip map
γx:E∗u(r)→E∗cs(r) with Lip(γx)≤1 such
that the connected component
of W(x,ω),δu∩expx∗(E∗(r)) containing x coincides with expx∗graphγx;
*
the assignment x↦γx varies continuously in the uniform norm on C(E∗u(r),E∗cs(r)) as x varies in B(x∗,ϵ)∩Γl0,ω.
Proof.
For x∈Γl0,ω, define gˇ(x,ω)=L(x,ω)∘g(x,ω)∘L(x,ω)−1
where g(x,ω) is as in Lemma 7 and
L(x,ω) is as in Proposition 5, so that gˇ(x,ω)
is a graphing map from E(x,ω)u to E(x,ω)cs in TxM.
For (a), we use Lemma 10 to change the axes of gˇ(x,ω) from E(x,ω)u/cs to E∗u/cs: Item (i) in Lemma 10
is satisfied with L=l0, and (ii) follows from the continuity of Eu/cs subspaces through points of Γl0,ω (Proposition 6). To arrange for (iii),
observe that our control on Lip(g(x,ω)) is only in the adapted norm ∣⋅∣, not the Riemannian metric ∥⋅∥ on TxM;
generally we have only the very poor bound Lip(gˇ(x,ω))≤l0Lip(g(x,ω)). This is remedied by
truncating the domain of gˇ(x,ω) to E(x,ω)u(2r), where r>0 is chosen sufficiently small
so that (i) gˇ(x,ω) is defined on E(x,ω)u(2r), and (ii) Lip(gˇ(x,ω)∣E(x,ω)u(2r))≤1/10. For the latter, we take advantage of the fact that (dg(x,ω))0=0 and our
control on Lip(dg(x,ω)). A simple computation implies this
can be arranged by taking r=min{(20Cl03)−1,21δl0−2}, with C,δ as in Proposition 7.
(b) follows from the continuity of Eu subspaces (Proposition 6)
and the contraction estimate for the graph transform (Lemma 8).
Details are left to the reader; a similar argument is carried out in the proof of Proposition 26 in Section 5 of this paper; see also Lemma 5.5 in [2].
∎
We refer to
[TABLE]
as a stack of unstable leaves through B(x∗,ϵ)∩Γl0,ω.
2.5 Main proposition and proof of Main Theorem
For ω∈ΩZ let us write μωn=(fθ−nωn)∗μ, recalling that μωn→μω weakly with P-probability 1 by Lemma 2. Our plan is
to fix ω, and track the orbits of a small fraction of μ-typical points from time
−n to time [math] with the aid of Lyapunov charts. We will
show that their images at time [math] are increasingly aligned with local unstable manifolds, and that as n→∞, the weak limits of this sequence of small ‘pieces’ of μωn possess the SRB property. This is summarized in the following Main Proposition of this paper. The notation is as in Sect. 2.2.
Proposition 12** (Main Proposition).**
For all sufficiently large l0>1, there is a positive
P-measure set of ω and a small constant c>0 for which the following hold.
On each Γl0,ω, there is a stack Sω
of local unstable manifolds with the following properties:
a fraction ≥c of μω is supported on Sω, i.e.,
μω=ν1+ν2 where ν1,ν2 are both positive measures,
and ν1 is supported on Sω with ν1(Sω)≥c.
Let Ξ be the partition of Sω into unstable leaves. Then
the conditional probabilities of ν1 on elements of Ξ are absolutely
continuous with respect to Lebesgue measure, with densities uniformly bounded above and below.
The proof of Proposition 12 will occupy the rest of this paper.
We first complete the proof of the Main Theorem assuming this result.
Let f:M↺ be a (single) diffeomorphism
preserving a probability measure σ
with at least one positive Lyapunov exponent σ-a.e..
We say that a measurable partition η of M
is subordinate to unstable manifolds if for σ-a.e. x,
η(x), the element of η containing x, is a relatively compact subset of Wu(x)
and contains an open neighborhood of x in Wu(x). To say that σ is an
SRB measure is equivalent to saying that its conditional measures on the elements of η
are absolutely continuous with respect to the Riemannian measures on unstable
manifolds (see, e.g., [9] for details).
These ideas extend readily to RDS. We say a partition η of
M×ΩZ is subordinate to unstable manifolds if for μ∗-a.e.
(x,ω), η(x,ω) is a relatively compact subset of the global unstable manifold W(x,ω)u
(so in particular
η(x,ω)⊂M×{ω}) and it contains an open neighborhood of x in W(x,ω)u.
The definition
of random SRB measures in Definition 3
is equivalent to μ∗ having absolutely continuous conditional measures on
elements of η.
Proof of Main Theorem assuming Proposition 12.
Let η be
a partition of M×ΩZ subordinate to unstable manifolds, and
let μT∗ be the quotient measure of μ∗ on (M×ΩZ)/η.
For a.e. element α of η, let mα
denote the Riemannian measure on α. We define a (possibly sigma-finite) measure
ν on M×ΩZ by letting
[TABLE]
for every Borel set A⊂M×ΩZ, and decompose μ∗
into an absolutely continuous part μac∗ and a singular part
μ⊥∗ with respect to ν. Since μac∗ is preserved by
τ, and (τ,μ∗) is ergodic, we have either μac∗(M×ΩZ)=1, in which case μ∗ is SRB,
or μac∗(M×ΩZ)=0.
Assume, to derive a contradiction, that
μ∗=μ⊥∗. By definition, there exists a Borel set A⊂M×ΩZ with
ν(Ac)=0 and μ⊥∗(A)=0. In particular, mα(Ac∩α)=0
and μα∗(A∩α)=0 for μT∗-almost every α∈η.
We conclude that for such α, μα∗ and mα are mutually singular. This
contradicts Proposition 12, which implies that for a μT∗-positive measure
set of α∈η, we have that μα∗ has a nontrivial absolutely continuous component.
We conclude that μac∗(M×ΩZ)>0, hence μ∗=μac∗ and
the proof is complete.
∎
3 New chart systems and iterated graph transforms
As explained in the Introduction, our plan is to realize μω∗ as
the limit of (fθ−nωn)∗μ as n→∞. In this section,
we begin to prepare for this pushing-forward process, with the following
simplifications:
(i) we will start from time [math] rather than time −n, i.e., we will consider
(fω+n)∗μ,n=1,2,…, for some ω+∈ΩZ+;
(ii) we will consider pushing forward μ near one (x,ω+) at a time; and
(iii) we will push forward graphs of functions
rather than μ. Later on, we will disintegrate
μ onto graphs of this type to be pushed forward.
3.1 A new chart system
We would like to have charts
defined at (μ×P+)-a.e. (x,ω+), so we can push forward
small pieces of graphs transversal to Ecs in the chart at x.
Adapted charts for one-sided RDS have been constructed before
(see, e.g., Chapter III of [12]), but to the authors’ knowledge, there
are no existing constructions in the literature that are suitable for our purposes; see
the discussion following Proposition 15.
The construction we present here proceeds roughly as follows: since μ-a.e. x∈M is generic with
respect to μω for some ω∈ΩZ, one may associate to
(μ×P+)-a.e.(x,ω+) a choice of ω∈ΩZ
that (i) agrees with ω+ on its ΩZ+-coordinate and for which (ii) (x,ω)∈Γ where Γ
is as in Proposition 5. We may then equip (x,ω+) with the chart at (x,ω) from
Proposition 5. This is essentially how we will proceed, but first we need to take care of measurability issues.
Given a Borel measurable set Θ⊂M×ΩZ, let
Θ+ denote its projection to M×ΩZ+.
Lemma 13**.**
Given any Borel set Θ⊂M×ΩZ that is
a countable union of compact subsets, there is a Borel measurable function
[TABLE]
with the property that for any (x,ω+)∈Θ+, we have
[TABLE]
Lemma 13 is a direct application of the measurable selection criterion in Lemma 14.
We will explain in the Appendix how Lemma 14 can be deduced from a well known
result.
Lemma 14**.**
Let X,Y be Polish spaces. Let G⊂X×Y be a compact subset and set GX to be the projection of G onto X. Then, there exists a Borel measurable mapping ψ:GX→Y with the property that for any x∈GX, we have (x,ψ(x))∈G.
We apply Lemma 13 to Θ=Γ where
Γ is in Proposition 5, noting that
(perhaps diminishing
Γ by a μ∗-null set), Γ can be represented
as a countable union of compact sets by the inner regularity of μ∗.
We then obtain Γ+⊂M×ΩZ+ and
ω^−:Γ+→ΩZ−, i.e., to each (x,ω+)∈Γ+, we associate
in a measurable way a “past” ω^−=(ω^n)n≤0 so that (x,ω^)∈Γ.
Recall that E(x,ω+)cs, which depends only on future iterates,
is well defined but without a past there is no intrinsic notion of
E(x,ω+)u. We now define
E^(x,ω+)u:=E(x,ω^)u, and let
Φ^(x,ω+):=Φ(x,ω^) be a chart at (x,ω+),
Φ(⋅,⋅) as in Proposition 5.
To each (x,ω+)∈Γ+, we introduce next a sequence of charts {Φ^(x,ω+)(k),k=0,1,2,…} along the τ+-orbit of (x,ω+), with Φ^(x,ω+)(0)=Φ^(x,ω+).
Proposition 15**.**
Let (x,ω+)∈Γ+, and let (x,ω^)∈Γ
be given by Lemma 13. Then for each k=0,1,2,…, this induces at
(τ+)k(x,ω+)
the splitting
[TABLE]
We also define for each k
[TABLE]
where l is
as in Proposition 5, and define at (τ+)k(x,ω+) a
chart given by
[TABLE]
where Φ(⋅,⋅),L(⋅,⋅) are as in Proposition 5. Then for each k,
[TABLE]
are measurable functions, and the properties of the
maps f^(x,ω+)(k):=f~τk(x,ω^) along
this sequence of charts are, by construction, the same as in Proposition 5.
Notice that we have associated to each (x,ω+)∈Γ+ a sequence
of charts along its τ+-orbit by applying the measurable
selection lemma once, to the point (x,ω+). Since in general
ω^(τ+(x,ω+))=θω^(x,ω+), the sequence of charts
associated to (x,ω+) shifted forward once is different from the the sequence associated
to the point τ+(x,ω+). That is to say, these sequences of charts are
dependent on the initial points (x,ω+), and we have stressed that by
putting (x,ω+) in the subscripts of E^(x,ω+)u,(k),Φ^(x,ω+)(k) etc. even though these objects are attached to the point
(τ+)k(x,ω+).
With regard to differences with existing constructions of one-sided
charts (as used in, e.g., Chapter III of [12]), previously constructed
charts are only guaranteed to
have size at least C−1e−nδ2 at time n where C depends on the initial point. In contrast, the construction in Proposition 15 has the property that the chart size at time n is ∼(l^(x,ω+)(n))−1=l(τn(x,ω^))−1. For (μ×P+)-typical (x,ω+),
these chart sizes are guaranteed to rise above some minimum size for
infinitely many n, a property crucial for our constructions in Sections 4–6.
In the rest of this section, the selection function
ω^−:Γ+→ΩZ−
given by Lemma 13 is fixed, and the chart system in use will be
[TABLE]
Uniformity sets
For l0>1 and k≥0, we let
[TABLE]
These are clearly versions of the uniformity sets described in Section 2.2.
Observe that since Ecs subspaces depend only on the future, they have
no dependence on the measurable selection made at time [math].
As in Proposition 6(a), it follows that
E(x,ω+)cs,(k)=E(τ+)k(x,ω+)cs
varies continuously across points of (τ+)k(Γl0+,(k)).
The situation for E^u is different, and the following observations are crucial:
Remark 16**.**
We claim that the subspaces E^(x,ω+)u and E(x′,ω+)cs are uniformly separated
when (x,ω+), (x′,ω+)∈Γl0+ are sufficiently close. While we do
not have that E^(x,ω+)u and E^(x′,ω+)u are close, we have ∥π^(x,ω+)u∥≤l0 where π^(x,ω+)u:TxM→E^(x,ω+)u is the projection parallel to E(x,ω+)cs. This together with the continuity of
Ecs as discussed above implies uniform separation, as claimed.
In light of Proposition 6(b),
the dependence of E^u,(k) on the measurable selection becomes weaker and weaker as k is increased; that is,
although E^u,(k) does not vary continuously, nearby E^u,(k) subspaces become very well aligned for k≫1.
3.2 Transforms of graphs (with possibly large slopes)
Graph transforms were discussed in Sect. 2.3;
what is new here is that we have to consider graphs with possibly large
though uniformly bounded slopes, the reason being the observation in Remark 16(a).
This subsection gives a priori bounds for a single step of the graph transform.
Let (x,ω+)∈Γ+ be fixed; we will omit mention of (x,ω+)
in the remainder of Section 3, writing Φ^(k)=Φ^(x,ω+)(k),f^(k)=f^(x,ω+)(k),l^(k)=l^(x,ω+)(k) etc.
For k≥0 and δ∈(0,1), let
[TABLE]
be a mapping. The graph transform T(k)g=T(x,ω+)(k)g,
if it is defined, is a mapping
[TABLE]
for some δ′∈(0,1). We write K0=Lip(g) for the Lipschitz
constant of the initial graph g.
The following lemma does not distinguish between large
and small K0.
Lemma 17**.**
For any K0>0, there exist constants r1=r1(λ,δ0,K0)∈(0,1),C1=C1(λ,δ0,K0),C2=C2(λ,δ0,K0)
such that the following holds
when δ<r1. Let k≥0, ρ∈(0,K0−1], and let
[TABLE]
be a C1+Lip map for which
(i) g(0)=0, (ii) graphg⊂B(δ(l^(k))−1), and
(iii) Lip(g)≤K0.
Then, the graph transform
[TABLE]
is defined, and is a C1+Lip map for which
(i’) T(k)g(0)=0, (ii’) graphT(k)g⊂B(δ(l^(k))−1), (iii’) Lip(T(k)g)≤K0e−λ/2, and
(iv’)
[TABLE]
Proof.
For short, let us write g^=T(k)g, f^=f^(k), l^=l^(k).
Let
[TABLE]
Observe that df^0 maps C strictly into its interior. Let
r1=r1(λ,δ0,K0)>0 be small enough that for δ∈(0,r1),
[TABLE]
More precisely, if w=u+v∈C⊂Ru⊕Rcs
and df^z(w)=u′+v′∈Ru⊕Rcs, then
[TABLE]
and u′+v′∈C for δ∈(0,r1).
Let now ρ,δ, and let g be as in the hypothesis of
Lemma 17. We let
[TABLE]
and define
[TABLE]
where Id refers to the identity map restricted to
Bu(ρδl^−1).
As the existence of g^ and its first derivative properties follow largely
from standard arguments involving the invariant cones condition above,
we leave them to the reader,
providing below only the bound for Lip(dg^).
Let u^1,u^2∈Bu(ρδ(l^(k+1))−1) with ui=ϕ−1(u^i),i=1,2. Then,
[TABLE]
We bound the last term of (2) as follows:
First we have ∣dϕu^−1∣≤e−λ/2 for all u^∈Bu(ρδ(l^(k+1))−1).
Using the fact that df^z=df^0+(df^z−df^0)
and ∣df^z−df^0∣≤l^∣z∣≤δ
for z∈Bu(δl^−1) by Proposition 5, we have
[TABLE]
so that
[TABLE]
Since for w∈Ru with ∣w∣=1, we have
[TABLE]
this is an upper bound for ∣πcs∘df^(u2,g(u2))(Id+dgu2)∣.
Finally, plugging these back into (2), we obtain
[TABLE]
where
[TABLE]
∎
Lemma 17 provides us with the following information: In general, C2>1,
which is not useful for controlling the growth of
Lip(dT(k)g) as we iterate the graph transform.
However, when K0 is small enough depending mostly on λ (also
δ0 and δ), then C2(K0)<1. We fix
Kˉ0≤101 small enough that
C2(Kˉ0)eδ2<1, and
write Cˉi=Ci(Kˉ0),i=1,2. Furthermore, we let
rˉ1:=rˉ1(Kˉ0) be small enough that on
B(rˉ1(l^(k))−1), the cones
C(Kˉ0) are invariant under df^z.
3.3 Iteration of graph transforms
We now consider iterated graph transforms along the orbit of (x,ω+)∈Γ+,
introducing first the following notation: Given g and a sequence of numbers
d0,d1,…, we say
[TABLE]
are the graph transforms of g on B(dk(l^(k))−1) if
[TABLE]
and for each k≥0, we let
[TABLE]
assuming the graph transforms above are well defined.
In this definition, we allow the domain
of definition of gk to be a proper subset of Bu(dk(l^(k))−1)
containing [math] (but when we write h:U→V, it will be implied that h
is defined on all of U).
Let Kˉ0 and rˉ1 be as in Sect. 3.2.
Proposition 18**.**
Given K0,λ0,δ0,
there exist Cˉ≥1 (independent of K0),
m0=m0(K0) and rˉ0=rˉ0(K0,m0)>0
for which the following hold. Let r0≤rˉ0.
Then there exists
m1∈Z+ depending on Lip(dg) in addition
to the constants above with the following properties. Let
[TABLE]
be a C1+Lip map with
(i) g(0)=0 and (ii) Lip(g)≤K0. We let gk be the graph transforms of g
with dk=r0 for k≤m0 and dk=rˉ1 for k>m0.
Then for all k≥m0+m1,
[TABLE]
is defined and satisfies
[TABLE]
Proof.
We assume K0>Kˉ0 (omit the first part of the proof
if K0≤Kˉ0). Let m0 be such that K0e−m0λ/2<Kˉ0.
Fix rˉ0>0 sufficiently small so that for each 0≤k≤m0−1, we have for z∈B(rˉ0(l^(k))−1) that (df^(k))zC(K0e−kλ/2)⊂C(K0e−(k+1)λ/2)
(notation as in the proof of Lemma 17). By
the estimates in the proof of Lemma 17, the choice of rˉ0
depends on m0,K0.
With r0≤rˉ0 now fixed and {gk} the graph transform sequence
as defined in the statement, we obtain from a simple induction
that gm0 is defined on Bu(r0(l^(m0))−1) and
Lip(gm0)≤K0e−m0λ/2<Kˉ0.
Since Kˉ0-cones are
preserved on charts of size B(rˉ1(l^(k))−1),
Lip(gk)≤Kˉ0 will hold for k≥m0.
Moreover, one easily checks (see (iv’) in Lemma 17) that
∣(dgk)0∣≤e−kλ/2∣(dg)0∣
holds for all k.
Next, we grow gk so that its graph stretches all the way
across the chart, letting m1′=m1′(r0,rˉ1) be such that gm0+m1′
is defined on all of Bu(rˉ1(l^(m0+m1′))−1).
It remains to bound Lip(dgk). Let a=Lip(dgm0). Though Lip(dgk)
may have grown during the first m0 iterates, a is determined by
Lip(dg),K0,λ and m0 (Lemma 17). Applying Lemma 17 again repeatedly
from step m0 on, we obtain
[TABLE]
Let Cˉ=2Cˉ1∑i(Cˉ2eδ2)i, and choose m1≥m1′
large enough that Cˉ1⋅Cˉ2m1a<21Cˉ. The desired properties are
achieved for k≥m0+m1.
∎
For the remainder of Section 3 we fix K0>0,
r0<rˉ0(K0,m0(K0)) and assume Proposition 18
has been applied to a fixed C1+Lip graphing function
g:Bu(r0(l^(0))−1)→Rcs, Lip(g)≤K0, obtaining
the graph transform sequence {gk}, with all notation (e.g., m0,m1) as in the conclusions of Proposition 18.
First, we give a distortion estimate in this setting.
Lemma 19**.**
Write a0=Lip(dg). Then for any k≥m0+m1,
there exists a constant D=D(K0,a0,r0;l^(0),l^(k))
with the following property.
Write γj=Φ^(j)(graphgj) for 0≤j≤k,
and let p1,p2∈γk. Then,
[TABLE]
Note that D does not depend on k except through the value of l^(k).
Proof.
For i=1,2, write pki=pi and p0i=(fω+k)−1pki, and for 0≤j<k set pji=fω+jp0i∈γj. We decompose
[TABLE]
The first RHS term is the sum of m0+m1 terms, each of which is bounded from above in terms of ∥dfωj∥,∥dfωj−1∥, 1≤j≤m0+m1; these in turn are controlled by the value l1(ω^)≤l^(x,ω+)(0) of the function l1 as in Section 2.1, (recall ω^=ω^(x,ω+) as in Section 3.1).
By these considerations, this term is bounded ≤D1, where D1=D1(K0,a0,r0;l^(0)) (noting that m0,m1 depend on K0,a0,r0).
For the second RHS term, observe that the graphing functions gj,j≥m0+m1, satisfy Lip(gj)≤1/10 and Lip(dgj)≤Cˉl^(j). A distortion estimate analogous to that in Lemma 9
applies to bound this term ≤D2(l^(k))⋅d(p1,p2).
The proof is complete on setting D=D1+D2.
∎
The next lemma gives sufficient conditions for switching of axes (Lemma 10) in the present context. Let
gˇk:Dom(gˇk)⊂E^u,(k)→Ecs,(k)
be given by gˇk=L^(x,ω+)(k)∘gk∘(L^(x,ω+)(k))−1.
Lemma 20**.**
For any l^>1 there exists r3=r3(l^) with the following properties. Let k≥m0+m1 and let r3=r3(l^(k)). Then
Dom(gˇk)* contains E^u,(k)(r3); and*
if ∣(dgk)0∣≤(20lˇ(k))−1 holds, then we have Lip(gˇk)≤1/10 on E^u,(k)(r3).
Since ∣(dgk)0∣≤K0e−kλ/2 (Proposition 18) and l^(k)≤ekδ2l^(0) (Proposition 5), the condition in (b) is satisfied for all large enough k depending on l^(0) and K0.
Proof.
Item (a) is guaranteed when r3(l^) is taken ≤(rˉ1l^2)−1. For (b), for r>0 we estimate Lip(gˇk∣E^u,(k)(r)) as follows. Let uˇ∈E^u,(k)(r), uˇ=L^(x,ω+)(k)u, u∈Ru, and estimate
[TABLE]
where Cˉ is as in the end of Section 3.2. Taking r3(l^)≤(20Cˉl^3)−1 ensures the second RHS term is ≤1/20, while the first term is ≤1/20 when the condition in (b) is met.
∎
In the rest of the paper, Kˉ0 is fixed, as is δ∈(0,rˉ1(Kˉ0))
sufficiently small for the purposes of Proposition 7 and Lemmas 8, 9.
4 Setup for the rest of the proof
For ω∈ΩZ, we will realize μω as the weak limit as n→∞
of μωn=(fθ−nωn)∗μ, obtained by pushing μ forward
from time −n to [math]. But we will not push forward all of μ, only a small bit of it,
as that is all that is needed to show μ∗ has the SRB property; see Sect. 2.5.
As a matter of fact, we will push forward a very localized bit of μ (located
on a “source set”), and consider only the part that arrives in a localized region
(the “target set”), both suitably chosen. This section describes
and justifies the main ingredients of this setup; details including order of choice of constants are given in Sect. 5.1.
4.1 Uniformity sets of μωn-typical points
Let l0>1 be fixed implicitly throughout. We fix a compact subset
Θ0⊂Γl0, and for now fix n∈Z+.
We define Θn:=Θ0∩τ−nΘ0, so that Θn
consists of points (x,ω) that are good in the sense of being in a uniformity set
both at time [math] and at time n. As in Sect. 3.1, a measurable selection
(Lemma 13)
ω^n:Θn+→ΩZ− enables us to systematically
assign “pasts” to points in Θn+, a positive (μ×P+)-measure set.
Now since we are interested in μωn=(fθ−nωn)∗μ,
we want to consider orbits starting from time
−n and not from [math]. For ω∈ΩZ, we write x−n=fω−nx, and
define
[TABLE]
Then Mωn is a subset of μωn-typical points.
The ideas from Sect. 3.1 carry over in a straightforward way, though the notation gets
more cumbersome.
Let x∈Mωn. For k=0,1,…,n, let x−k=fω−kx.
As before,
[TABLE]
are well defined, as Ecs-subspaces depend only on the future.
To define Eu, for brevity let us write
ω^=(ω^n(x−n,(θ−nω)+),(θ−nω)+).
We define
[TABLE]
and for k=0,1,…,n−1, we define the Eu-subspace at
(x−k,(θ−kω)+) as
[TABLE]
Chart maps Φ^(x−n,(θ−nω)+)(n−k), connecting maps
f^(x−n,(θ−nω)+)(n−k) and the l-function
l^(x−n,(θ−nω)+)(n−k) are all defined as before.
Observe that by our choice of Θn, we have that
[TABLE]
We finish by recording the following observation. Let Mω={x∈M:(x,ω)∈Θ0}; that is, Mω is a uniformity set for the two-sided dynamics restricted to the fiber M×{ω}. Since μωn→μω weakly, one should expect that as n→∞, the uniformity set Mωn of μωn-typical points should converge to Mω in some sense. Below this is made precise.
Lemma 21**.**
For any δ>0, there exists N0=N0(δ)∈N such that for any n≥N0, we have that Mωn⊂Nδ(Mω). In particular,
[TABLE]
Proof.
By standard compactness arguments, it suffices to prove that for any sequence {xn}⊂M converging to a point x∈M for which xn∈Mωn for all n, we have that x∈Mω. For each n≥1 write x−nn=fω−nxn, and
let ωˇn∈ΩZ be defined by ωˇn=θn(ω^n(x−nn,(θ−nω)+),(θ−nω)+). Observe that ωˇn→ω as n→∞, and that (xn,ωˇn)∈τnΘn⊂Θ0 for all n≥0 by our measurable selection construction. Since
(xn,ωˇn) converges to (x,ω), and Θ0 is compact, we
obtain that (x,ω)∈Θ0, i.e., x∈Mω.
∎
4.2 Accumulating μωn-mass
Let β0>0 be a very small number. We fix l0>1 sufficiently large so that μ∗Γl0≥1−β0/3. Fix a compact set Θ0⊂Γl0
with μ∗Θ0≥1−β0/2 and for each n≥0 let Θn=Θ0∩τ−nΘ0, so that μ∗(Θn)≥1−β0.
For each n, fix a measurable selection ω^n:Θn+→ΩZ− as in Lemma 13.
Finally, Mωn is as defined in Sect. 4.1.
Below, we determine a set of ω for which Mωn has sufficiently large μωn-mass for an infinite sequence of n.
Lemma 22**.**
Let c>1. For each n≥1 define
[TABLE]
and set G=limsupn→∞G(n)=∩N≥1∪n≥NG(n). Then, we have
[TABLE]
Proof.
We claim that
[TABLE]
Assuming this for the moment, observe that θ−nG(n) depends only on the ΩZ+-coordinate of ω, hence
[TABLE]
by the P-invariance of the shift θ.
We now estimate:
[TABLE]
Rearranging, we obtain cc−1≤P+((θ−nG(n))+)=P(G(n)), hence P(G)≥cc−1.
It remains to check (3). Observe that θnω∈G(n)
holds iff μθnωn(Mθnωn)≥1−cβ0. We evaluate
[TABLE]
Since μθnω=(fωn)∗μ, equation (3) follows immediately.
∎
Our next step is to coordinate for each ω∈G for a positive amount of
μ-mass to come from a small, fixed region (the “source set”) and to land in a small,
fixed region (the “target set”) under fθ−niωni for some infinite sequence {ni}.
We write ψ:=dLebdμ, which we recall is continuous by hypothesis. With β0 as before, let us define α0=β0/Leb(M), so that
[TABLE]
Lemma 23**.**
For any ϵ>0, there exists a constant c=c(ϵ)>0 such that for any ω∈G, we have the following. There are points p^−∈{ψ≥α0},p^∈M, and a sequence ni→∞ for which
[TABLE]
Note that in Lemma 23, the points
p^,p^−∈M and the subsequence ni all depend on ω,
whereas the constant c=c(ϵ) is independent of ω.
Proof.
Let ω∈G. To start, fix a subsequence ni→∞ along which ω∈G(n) for all n=ni.
In pursuit of the ‘source set’ B(p^−,ϵ) and ‘target set’ B(p^,ϵ), we refine (ni) successively
several times in the following argument.
Fix an open cover of {ψ≥α0} by balls of radius ϵ with centers pj∈{ψ≥α0},1≤j≤J. For each n=ni,
we estimate:
[TABLE]
For each i, there exists j=j(i) so that μ(B(pj,ϵ)∩fω−niMωni)≥c−.
Since there are only finitely many j, by the Pidgeonhole principle we may refine (ni) so that
[TABLE]
holds for p^−=pj^− for some fixed j^−∈{1,⋯,J}.
Continuing, fix an open cover of M by balls of radius ϵ with centers pj′∈M,1≤j≤J′. For each n=ni, we estimate:
[TABLE]
By the same Pidgeonhole Principle argument, on refining (ni) once more we have that
[TABLE]
where p^=pj^′ for some fixed j^∈{1,⋯,J′}. ∎
4.3 Disintegration of μ in the “source set” onto u-graphs
Fix ω∈G. We assume in this subsection that ϵ>0 is specified,
and Lemma 23 has been applied to obtain p^−,p^∈M, a
sequence {ni} and c=c(ϵ)>0. For n=ni, define
[TABLE]
We now specify how μ restricted to Λ−n will be decomposed
into measures on graphs to be pushed forward.
For x∈Λ−n, we have (x,(θ−nω)+)∈Θn+.
This means in particular that (x,(θ−nω)+) possesses
a natural E(x,(θ−nω)+)cs and a systematic and measurable assignment of
E^(x,(θ−nω)+)u,(0).
We will distintegrate μ onto the leaves of
a smooth foliation F−n, chosen in such a way that the leaves of
F−n, suitably restricted,
are graphs from open subsets of E^(x,(θ−nω)+)u,(0) to
E(x,(θ−nω)+)cs for each x∈Λ−n; we will refer to
such graphs as “u-graphs”.
To define F−n, we fix a reference point q−n∈Λ−n.
As the discussion is entirely local, we confuse a neighborhood of q−n in M
with a subset of Tq−nM via expq−n and
define F−n to be the collection of
(dimEu)-dimensional hyperplanes in Tq−nM parallel to
E^(q−n,(θ−nω)+)u,(0).
Lemma 24**.**
For all sufficiently small ϵ>0 depending on l0,ψ=dLebdμ and
α0, there exist constants K−=K−(l0),r−=r−(l0,ϵ) for which the following hold for all ω∈G.
Assume Lemma 23 has been applied. Let n=ni, and let
F−n be as above. Then for every x∈Λ−n,
there is a function hx−=h(x,(θ−nω)+)− ,
[TABLE]
such that if F−n(x) is the leaf of F−n containing x, then
[TABLE]
Φ^(x,(θ−nω)+)(0)B(r−(l^(x,(θ−nω)+)(0))−1)⊂{ψ≥α0/2}.
Proof.
First we require ϵ to be small enough that N2ϵ{ψ≥α0}⊂{ψ≥α0/2}, where Nϵ denotes the ϵ-neighborhood of a set (recall that the density ψ of μ was assumed continuous– see Section 2). It follows that B(p^−,2ϵ)⊂{ψ≥α0/2}.
To check (a) and (b) for n=ni, observe that by Lemma 6,
x↦E(x,(θ−nω)+)cs varies continuously
for (x,(θ−nω)+)∈Γl0+, and by Remark 16(a) we have
∥π^(x,(θ−nω)+)u,(0)∥≤l0. This means that by choosing
ϵ sufficiently small to align nearby Ecs-subspaces, we are assured that there is uniform separation between
E^(q−n,(θ−nω)+)u,(0),
i.e., F−n(x),
and E(x,(θ−nω)+)cs for all x∈Λ−n.
This separation provides a constant K− in (a). That is, if hx− is chosen
to satisfy
Φ^(x,(θ−nω)+)(0)(graphhx−)⊂F−n(x),
then Lip(hx−),Lip(dhx−)<K−.
We shrink r− as needed to ensure that Φ^(x,(θ−nω)+)(0)graphhx−⊂B(p^−,2ϵ), hence
(b) holds.
Now the constants above need to work for all n, and not be chosen
one n=ni at a time. This requires that
the modulus of continuity of x↦E(x,(θ−nω)+)cs
be independent of (θ−nω)+, which is true because
(x,(θ−nω)+) is contained in the compact set Θn+⊂Θ0+.
∎
Returning to the measure μ, and continuing to confuse a neighborhood of
M with a subset of Tq−nM,
we have that (2α0Leb∣B2ϵ(p^−))≤μ, and
the conditional densities of 2α0Leb∣B2ϵ(p^−)
on the leaves of F−n are constant functions.
5 Geometry of pushed-forward u-graphs
We have set up in Section 4 a situation that can be described as follows:
For each ω in a positive P-measure set, there is a sequence ni
such that for each n=ni, there is a set Λ−n⊂M, and
a collection of u-graphs associated with x∈Λ−n that together
carry positive μ-measure. These u-graphs are to be transported
forward by fθ−nωn. We consider small
pieces of these u-graphs that remain inside suitable Lyapunov charts
for all n steps, and refer to
the images at the end as Wn-leaves.
In this section, we will focus on the geometry of the
Wn leaves and the manner to which they converge to (real) unstable manifolds of the RDS.
We will begin by making precise the order of the various choices of constants
and constructions.
5.1 Stacks of Wn-leaves: details of construction
We now bring together the following
three sets of ingredients we have prepared: the setup in Section 4 in which we accumulate certain sets
of points with controlled finite pasts (Lemmas 23 and
24), graph transforms for ‘slanted’ graphs developed
in Sects. 3.2 – 3.3 (Proposition 18), and the switching of axes and consolidation
of images onto stacks (Lemma 10).
*(A) Initial choices. *
To start, fix a small β0>0 and let l0>1 be such that μ∗{l≤l0}≥1−β0/3.
With Θ0,Θn⊂Γ as in the beginning of Section 4.2, let G
be as in Lemma 22 with c=2 so that P(G)≥1/2.
In all that follows, ω∈G is fixed. As previously,
we write Mω={x∈M:(x,ω)∈Θ0} and, for n≥0, Mωn={x∈M:(x−n,(θ−nω)+)∈Θn+}.
*(B) Choices of ϵ∗,r∗, source and target sets, and a lower bound for {ni}. *
Our aim by the end of part (B) is to have constructed the following objects:
‘source’ and ‘target’ sets B(p^−,ϵ∗),B(p^,ϵ∗) (as in Lemma 23);
a reference point x∗∈Mω∩B(p^,ϵ∗) and a reference box
E∗(r∗):=E∗u(r∗)×E∗cs(r∗), E∗u/cs:=E(x,ω)u/cs,
suitable for constructing stacks of (i) Wu-leaves (as in Lemma 11)
and (ii) appropriately truncated, pushed-forward u-graphs (called Wn-leaves) through
the target set B(p^,ϵ∗) (see Figure 1).
The main work in constructing (a) and (b) is to identify the parameters ϵ∗,r∗, which we undertake now, starting with r∗.
For (b)(i), Lemma 11 requires that we take r∗ sufficiently small
in terms of l0, δ. For (b)(ii), to each x∈Λn
is associated a graph-transform-image (in the sense of Section 3) of a u-graph at x−n:=fω−nx (to be made
precise in (C) below). The image, what we call a Wn-leaf, will be a graph defined on
the (E^(x−n,(θ−nω)+)u,(n),E(x−n,(θ−nω)+)cs,(n))-axes
in TxM. We seek to
switch axes to a common reference box E∗(r∗)=E∗u(r∗)×E∗cs(r∗)
centered at a reference point x∗ (to be determined).
Taking r∗≤21r3 with r3=r3(l0) as in Lemma 20
ensures that truncations of Wn leaves will have small-enough Lip constants
for the purposes of Lemma 10(iii),
provided that the Wn-leaves are sufficiently parallel to
E^(x−n(θ−nω)+)u,(n) (see end of (C)).
This completely fixes the value of r∗.
We now identify two sets of conditions on ϵ∗, to be used in the construction of
the ‘source’ and ‘target’ sets.
At the source set, Lemma 24 imposes two conditions on ϵ∗:
One is that it has to be small enough so that Ecs is sufficiently well-aligned through points of fω−nMωn
when restricted to a ball of radius ϵ∗;
this is needed to guarantee the separation of
Ecs and Eu in the sense of Remark 16(a). The other is that the entire 2ϵ∗-ball
should be contained in {ψ≥α0/2} (Lemma 24(b)).
At the target set we require ϵ∗ be suitable for constructing the stacks of both Wu
and Wn leaves. Both require that ϵ∗ be small enough in terms of l0,δ and r∗
(Lemmas 10 and 11). Additionally, for the Wn
stack we need to make the E^u,(n),Ecs-axes at x∈Λn line up with
the E∗u/cs axes at the reference point x∗. The Ecs axes are aligned by
shrinking ϵ∗ (Proposition 6(a)); to align
the E^u with E∗u requires shrinking ϵ∗ and taking min{ni} sufficiently
large (Proposition 6(b) and Remark 16(b)).
These are our requirements on ϵ∗ and r∗. With ϵ∗ determined, we are correctly
situated to apply Lemma 23 with ϵ=ϵ∗, fixing once and for all
the ‘source’ and ‘target’ regions B(p^−,ϵ∗),B(p^,ϵ∗) respectively,
and the potentially viable
subsequence ni along which we have the bound μωn(Λn)=μ(Λ−n)≥c∗ for n=ni; here c∗:=c(ϵ∗) is as in Lemma 23 and Λ−n,Λn are the ‘source’ and ‘target’ sets as in (5). Finally, we fix
an arbitrary point x∗∈Mω∩B(p^,ϵ∗) to be used as reference point;
that Mω∩B(p^,ϵ∗)=∅ is guaranteed by
Lemma 23. This completes the construction of E∗(r∗).
Further conditions will be imposed on the lower bound for {ni}.
*(C) Pushing forward F−n-leaves. * For each x∈Λn,
we let x−n=fω−nx∈Λ−n, and push forward
the graph of hx−n− (here x−n plays the role of x in Lemma 24) by applying Proposition 18.
Letting K0=K−=K−(l0) and r−=r−(l0,ϵ∗) be as in
Lemma 24, and rˉ0=rˉ0(K−) be as in Proposition 18, we set r0=min{rˉ0,r−}.
Then for all n=ni≥m0+m1 where
m0,m1 are as in Proposition 18 (depending on r−,K−),
the graph transform hx:=h(x,ω)n=T(n−1)∘⋯∘T(0)hx−n− is defined on all of Bu(rˉ1(l^(x−n,(θ−nω)+)(n))−1)
and satisfies
[TABLE]
where Cˉ is as in Proposition 18. We define
[TABLE]
and let hˇx:Dom(hˇx)⊂E^(x−n,(θ−nω)+)u,(n)→E(x−n,(θ−nω)+)cs,(n) be its graphing map. To perform the switching of axes
to E∗u/cs as discussed in Paragraph (B), we guarantee
∥(dhˇx)0∥≤201 (Lemma 20)
by taking min{ni} sufficiently large
so that ∣(dhx)0∣≤(20l0)−1.
(D) Collecting onto stacks. Let
[TABLE]
where p^∈M is as in (B).
Applying Lemma 11, we let S=∪x∈Λξ(x)
be the stack of Wu-leaves and Ξ the partition of S into ξ(x), where
ξ(x), the Wu leaf through x∈Λ, has the form ξ(x)=expx∗graphγx for some
γx:E∗u(r∗)→E∗cs(r∗) with Lip(γx)≤1.
For n=ni sufficiently large, we now define the corresponding stack Sn:
Lemma 25**.**
There exists N∗∈N, depending on all the parameters above,
such that the following holds for all n=ni≥N∗.
For each x∈Λn, we have that the connected component of W(x,ω)n∩expx∗E∗(r∗)
containing x coincides with expx∗graphγxn,
where γxn:E∗u(r∗)→E∗cs(r∗) is a C1+Lip-mapping with Lip(γxn)≤1.
The partition Ξn of Sn=∪x∈Λnξn(x) into leaves ξn(x):=expx∗graphγxn is measurable.
Proof of Lemma 25.
For (a) we apply Lemma 10 to switch the axes of W(x,ω)n=expxgraphhˇx to the common axes E∗u(r∗),E∗cs(r∗), having already verified conditions (i)–(iii) in Lemma 10
in paragraphs (B) and (C).
For (b), measurability of Ξn follows from the fact that Sn is the union of at-most finitely many sets of the form
[TABLE]
where ιn=ιn(x) is chosen so that z↦γzn varies continuously over
z∈Λn∩fθ−nωnB(x−n,ιn).
∎
5.2 Limiting properties of Wn-leaves
Now that we have grouped nearby Wu and truncated Wn leaves into ‘stacks’ S and Sn,
we turn our attention to the limiting properties of Sn and its relation to S.
Recall that for x∈Λn and y∈Λ,
γxn,γy:E∗u(r∗)→E∗cs(r∗) are the graphing functions
of the leaves of Sn and S through x and y respectively.
Proposition 26**.**
For any ϵ>0, there exist n~0=n~0(ϵ)≥N∗ and η~=η~(ϵ)>0 with the following property. For any n=ni≥n~0 and any x∈Λn,y∈Λ with d(x,y)<η~, we have that
∥γxn−γy∥<ϵ where ∥⋅∥ refers to the uniform norm on C(E∗u(r∗),E∗cs(r∗)).
It follows that limsupn→∞Sn⊂S. The statement of Proposition 26
is all that we need; we do not prove, nor use,
the continuity of x↦γxn. However, it follows from a version of the arguments below that ‘oscillations’ in the Hausdorff distance between nearby ξn-leaves can be made uniformly, arbitrarily small for all sufficiently large n. Indeed, the following is a modification of a standard argument for proving the continuity of actual Wu-leaves (see, e.g., Section 5 in [2]).
Proof of Proposition 26.
In this proof, we will assume as before a canonical identification of the
tangent spaces at x and y, which are very close. Also, we will, for simplicity,
use the notation of two-sided charts, assuming (x,ω′) and (y,ω)
are such that
ωi=ωi′ for all i>−n where n is as in the Proposition.
No relation between ωi and ωi′ for i≤−n is assumed, as that will depend on the Selection Lemma.
Plan of proof. Let 0:Ru→Rcs denote the zero function.
We consider 0 as a function in the chart at τ−k(y,ω) for some
k≪n~0 (both k and n~0 to be determined),
and let 0yk:Bu(δl0−1)→Rcs
be given by 0yk:=Tτ−1(y,ω)∘⋯∘Tτ−k(y,ω)0
(where T⋯ is the graph transform as in Section 2.3).
Likewise, we consider 0 as a function in the chart at
τ−k(x,ω′), and let 0xk,n:Bu(δl0−1)→Rcs be given by
0xk,n:=Tτ−1(x,ω′)∘⋯∘Tτ−k(x,ω′)0.
Leaving it to the reader to check that the switching of axes (Lemma 10) can be performed, we obtain two functions
γ~yk,γ~xn,k:E∗u(r∗)→E∗cs(r∗) whose graphs
are contained in expy(graph0yk) and expx(graph0xk,n) respectively. We will bound ∥γxn−γy∥ via the triangle inequality
[TABLE]
For given ϵ>0, to prove ∥γxn−γy∥<ϵ for all n≥n~0, we plan to first choose k=k(ϵ,l0) and then n~0=n~0(k,ϵ,l0).
We isolate below another ‘change-of-chart’ type estimate that will be used several times
in the proof of (9). The proof is straightforward and left to the reader.
Lemma 27**.**
Let g1,g2:Bu(δl(y,ω)−1)→Rcs be Lipschitz graphing maps in the chart at
(y,ω). For i=1,2, let
gˇi:=(L(y,ω)∘gi∘L(y,ω)−1)∣E(y,ω)u(2r∗), and
assume that graphgˇi⊂E(y,ω)u(2r∗)×E(y,ω)cs(21r∗)
with Lip(gˇi)≤1/10. Let γi:E∗u(r∗)→E∗cs be such that
expx∗graphγi =expx∗E∗(r∗)∩expygraphgˇi.
Then Lip(γi)≤1/5, and
[TABLE]
where C~=C~(l0)>0. The same holds when (y,ω) is replaced by (x,ω′).
*First and third terms in (9): * We use the contraction estimate in Lemma 8 to obtain
[TABLE]
where c is as in Lemma 8 and g(y,ω) is the graphing map
of the unstable manifold in the chart at (y,ω). By Lemma 27,
[TABLE]
We require k to be large enough that C~ck<ϵ/3.
The first term on the right side of (9), ∥γxn−γ~xn,k∥,
is treated similarly, provided that
n−k is large enough that in the chart at τ−k(x,ω′),
Lip(Tτ−(k+1)(x,ω′)∘⋯∘Tτ−n(x,ω′)hx−)≤101.
This requires that n~0≥k+m0+m1 where m0,m1 are as in Proposition 18 and depend on r− and K−.
Let k=k(ϵ) be fixed from here on.
Second term in (9). Given 0<ϵˉ≪1 to be determined,
we claim that for η~ small enough and n~0 large enough
depending on l0,k and ϵˉ, the following hold for
x,y with d(x,y)<η~:
d(fω−kx,fω−ky), dH(Eτ−k(x,ω′)u/cs,Eτ−k(y,ω)u/cs)<ϵˉ, and
f^{-i}_{{\underline{\omega}}^{\prime}}x\in\Phi_{\tau^{-i}(y,{\underline{\omega}})}B\big{(}\frac{1}{2}r_{*}l(\tau^{-i}(y,{\underline{\omega}}))^{-1}\big{)}\quad\mbox{for all }0\leq i\leq k\ .
Item (b) and d(fω−kx,fω−ky)<ϵˉ follow from the fact that
Lip(fω−i)≤∥dfω−i∥≤l0ke2k(k+1)δ2 and
l(τ−i(y,ω))≤l0ekδ2, and that both bounds depend on l0
and k
alone. To control dH(Eτ−k(x,ω′)u/cs,Eτ−k(y,ω)u/cs),
we apply Proposition 6 to τ−k(y,ω),τ−k(x,ω′)∈{l≤l0ekδ2}, and require that n~0≥n0+k, where
n0=n0(ϵˉ,l0ekδ2) is as in Proposition 6.
Now let 0xy:Bu(δl(τ−k(y,ω))−1)→Rcs be the function
whose graph is the component of
(Φτ−k(y,ω))−1expfω−kxEτ−k(x,ω′)u
in B(δl(τ−k(y,ω))−1)
containing (Φτ−k(y,ω))−1fω−kx. By choosing ϵˉ
sufficiently small, we may assume, by item (a) above, that Lip(0xy)≤1/10,
Lip(d0xy)≤1, and ∣0−0xy∣ is as small as we wish.
This together with item (b) permits us to apply Lemma 8(b)
to ensure that the graph transform
[TABLE]
is well defined. Moreover, with the modulus of continuity of Tτ−i(y,ω),1≤i≤k, depending only on l0ekδ2, we may choose ϵˉ sufficiently
small to guarantee that ∣0xy,k,n−0yk∣≤3C~ϵ
where ϵ is as in (9) and C~ is as in
Lemma 27.
The (expx∗−1∘Φ(y,ω))-images of the graphs of
0xy,k,n and 0yk, when restricted
to E∗(r∗) are precisely the graphs of γ~xn,k and
γ~yk respectively. Another application of Lemma 27 gives
∥γ~xn,k−γ~yk∥≤3ϵ.
∎
For each ω∈G, the constructions of Section 5 are fixed for the remainder of the paper.
6 Proof of SRB property
We now complete the proof of the Main Proposition (Proposition 12).
6.1 Construction of partitions respecting unstable manifolds
Let S be as in Sect. 5.1, paragraph (D), i.e.,
S is a stack of local unstable manifolds through points in
Λ, with Ξ denoting the partition
into unstable leaves. To capture the conditional measures on Ξ of any measure
ν supported on S, a standard procedure is to construct a sequence
of finite partitions α1,α2,⋯ of S with the following properties:
The sequence {αm} is increasing, i.e. αm+1≥αm for all m≥1.
For each m, we have αm≤Ξ, i.e., αm consists of intact ξ-leaves; and
∨m=1∞αm≗Ξ, where ≗ denotes equivalence mod [math] with respect to ν.
Then properties of the conditional measures of ν on Ξ can be deduced
from its conditional measures on αm as m→∞.
Complicating matters in our setting is that the measure of interest is the limit of
a sequence of measures that are not supported on S but on nearby
stacks Sn of Wn leaves; see Section 5.
To accommodate these approximating measures, we will construct partitions
similar to αm but with slightly “enlarged” elements, so they will contain intact
Wn leaves.
The aim of this subsection is to make precise the construction of such a sequence of partitions we will call βm.
Continuing to use notation from Section 5, we define
μ~ωn=μωn∣Λn. On refining the sequence {ni}, let us assume that μ~ωn converges weakly as n→∞ to a measure μ~ω. Note that μ~ω≤μω, and that μ~ω is supported on Λ (by Lemma 21), with μ~ω(Λ)≥c∗>0 (Lemma 23). For S⊂expx∗(E∗(r∗))
let us write
[TABLE]
Lemma 28**.**
There is a decreasing sequence of compact subsets Δ1⊃Δ2⊃⋯ of Λ with the following properties:
Each Δm is partitioned into disjoint compact subsets
{Δm,k,1≤k≤Km} and the {Δm,k} are nested in
the sense that each Δm+1,k⊂Δm,k′ for some k′.
The sets Sm,k:=∪x∈Δm,kξ(x) are compact and pairwise disjoint among 1≤k≤Km.
We have
[TABLE]
Defining Δ∞=∩m≥1Δm, we have
μ~ω(Δ∞)≥21c∗.
Proof.
For ease of notation, in the following proof, let us suppress the “ω” and write μ~:=μ~ω.
Define Σ=expx∗E∗cs(r∗), which as is easily checked is a transversal to the Ξ-leaves comprising S. Set Σ^=Σ∩S and let π:S→Σ^ denote the projection along Ξ-leaves. Project μ~ to its transverse measure μ~T=μ~ωT on Σ^.
For each m≥1, let Qm be a partition of Σ into cubes of side lengths ≈1/2m with the following properties:
The sequence Qm,m≥1 is increasing, i.e., Qm+1≥Qm for each m≥1.
We have ∨m=1∞Qm≗ε, the partition of Σ^ into points μ~T-mod 0; and
For each C∈Qm, we have μ~T(∂C)=0.
With the Qm fixed, we define finite collections Qˇm,m≥1, of disjoint compact sets via the following inductive procedure.
Fix an increasing sequence c1≤c2≤⋯<1 for which
∏m=1∞cm=21.
To start, for each C∈Q1 fix a compact subset Cˇ⊂C∩π(Λ) for which dist(Cˇ,∂C)>0 and μ~(Cˇ)≥c1μ~(C). We set Qˇ1={Cˇ:C∈Q1}, so that
[TABLE]
We construct successively Qˇ1,Qˇ2,⋯ of disjoint compact subsets
with the rule that
for each Cˇ∈Qˇm, we have that Cˇ⊂Cˇ′ for some Cˇ′∈Qm−1, and
for each Cˇ′∈Qˇm−1, we have μ~T(∪Cˇ∈Qˇm,Cˇ⊂Cˇ′Cˇ)≥cmμ~T(Cˇ′).
With the {Qˇm} in hand, we now define the array of compact sets Δm,k as follows: for each m≥1 and 1≤k≤Km:=∣Qm∣, we define Δm,1,⋯,Δm,Km to be the collection of sets of the form Δ∩π−1(Cˇ) as C ranges over
Qˇm.
Item (i)–(iv) follow immediately.
∎
What we have done in Lemma 28 is to group the unstable leaves in S into
finer and finer substacks with a Cantor-like structure transversally, and to do that,
we have had to give up on a little bit of μ~ω-measure. Let
[TABLE]
Corollary 29**.**
There is a decreasing sequence of open sets
[TABLE]
and a sequence of partitions βm={βm,k} of Um into finitely
many disjoint open sets,
with the properties that
the partitions βm are nested, i.e., each βm,k⊂βm−1,k′ for some k′;
each βm,k contains intact leaves of the compact substack
Sm,k, and
for each ξ in S∞, if βm,k(ξ) is the element
of βm containing ξ, then βm,k(ξ)↓ξ as m→∞.
Corollary 29 follows easily from Lemma 28. The sets {βm,k} can be
chosen quite arbitrarily as long as they have the stated properties.
6.2 Pushed forward measures and their conditional densities
Recall that for each n=ni, we have constructed a stack Sn and
a partition of Sn into sets ξn(⋅) that are approximate Wu-leaves
(Lemma 25).
The next lemma establishes that for each m, by taking n large enough,
the partition βm will respect a definite fraction of ξn-leaves.
Let Nη(⋅) denote the η-neighborhood of a set.
Lemma 30**.**
For each m≥1, there exist ηm>0 and Nm∈N with the property that the following hold for all n=ni≥Nm.
Define
[TABLE]
Then Sm,kn⊂βm,k.
Letting Λmn=∪kΛm,kn, we have
[TABLE]
Proof.
(a) follows immediately from Proposition 26 and (b) from
the fact that μ~ωn is assumed to converge to μ~ω.
∎
While we have used μωn∣Λmn to ensure that our partitions
are catching a definite fraction of μωn, we are primarily interested in
μωn∣Smn where Smn=∪kSm,kn. We now turn
our attention to μωn∣Smn, focusing on a part of this measure
with controlled conditional densities.
Recall from Sect. 4.3 that we disintegrate μ on the leaves of a foliation
F−n
to be carried forward by fθ−nωn, and that F−n is
defined on a ball B⊂{ψ≥α0/2}, where ψ=dLebdμ.
Define
[TABLE]
Since ν−n≤μ, we have that νn≤μωn for all n.
Furthermore, let (νξn)ξ∈Ξn denote the (normalized)
disintegration measures of νn along Ξn with transversal measure
νTn on Sn/Ξn. For
ξ∈Ξn, let ϕ(ξ) denote the leaf of F−n containing fω−nξ.
It is easy to see that νξn is (fθ−nωnLebϕ(ξ))∣ξ normalized.
Lemma 31**.**
For measurable C⊂Λn,
νn(C)≥2∥ψ∥∞α0⋅μωn(C).
For a.e. ξ∈Ξn, νξn is absolutely continuous with
density ρξn:ξ→(0,∞) satisfying the distortion estimate
[TABLE]
for any p1,p2∈ξ. Here Dˉ=Dˉ(l0,K−,r−)>0, where K−,r−
are as in Lemma 24;
in particular, Dˉ is independent of ξ and n.
Proof.
The estimate in (a) follows from the simple bound μωn(C)≤∥ψ∥∞Leb(fω−nC), and Item (b)
follows from the distortion estimate in Lemma 19 applied to
K0=K−,r0=r−.
∎
6.3 Passing to the weak limit as n→∞ and completing the proof
Let νmn:=νn∣Smn. From Lemmas 30(b) and 31(a), we have
that for every m,
[TABLE]
for every n=ni≥Nm. We fix such an n(m) for each m; clearly
n(m)→∞ as m→∞. Let
ν∗ be any limit point of the sequence νmn(m) as m→∞.
Then ν∗ is supported on S∞ with ν∗≤μω. Moreover,
the lower bound (11) passes to ν∗(S∞).
Let νξ∗ denote
the conditional measures of ν∗ on the leaves ξ∈Ξ. To complete
the proof of Proposition 12, it suffices to show that for a.e. ξ, the measure νξ∗
is absolutely continuous.
For this, we state below a lemma that will be used to deduce properties of
the conditional measures
of ν∗ on leaves of Ξ from those of νmn on Ξn. First, we need some
notation: Let Cu⊂E∗u(r∗) be a cube. We let
Leb^(Cu)=Leb(Cu)/Leb(E∗u(r∗)), and
define
[TABLE]
Recall that νmn∣Sm,kn=νmn∣βm,k for n=n(m).
Lemma 32**.**
There exists A>1 such that for
any Cu⊂E∗u(r∗), we have, for all large enough
m and n=n(m):
[TABLE]
It follows that for a.e. ξ∈Ξ,
we have π∗uνξ∗≪Leb^ with
dLeb^d(π∗uνξ∗)∈[A1,A], where
πu is projection onto E∗u(r∗) along E∗cs.
Proof of Lemma 32.
Let Cu be fixed. That (12) holds for each νmn follows
from the fact that it holds for each νξn
by Lemma 31(b).
To pass these bounds to νξ∗,
we let m and k be fixed to begin with. Since
[TABLE]
and (12) holds for all m′≥m and all k′,
it follows that for fixed βm,k, (12) holds with νmn replaced by νm′n(m′). Letting m′→∞,
we obtain that it holds with ν∗ in the place of νmn.
Continuing to keep Cu fixed but letting m→∞ and running through
all βm,k∈βm for each m, we obtain by Corollary 29(iii)
that for a.e. ξ∈Ξ,
[TABLE]
As cubes form a basis for the topology on E∗u(r∗),
the assertion follows.
∎
The proof of Proposition 12 is now complete.
Appendix
Below, we deduce Lemma 14 from the following well-known theorem.
Theorem 33** (Kuratowski-Ryll-Nardzewski measurable selection theorem).**
Let (Ξ,M) be a measurable space, Z a Polish space, and let F:Ξ→2Z be a set-valued mapping such that
F(ξ)* is closed and nonempty for each ξ∈Ξ, and*
for any open U⊂Z, we have
[TABLE]
Then, there exists a measurable map f:Ξ→Z for which f(ξ)∈F(ξ) for all ξ∈Ξ.
For an account of measurable selection theorems, see, e.g., the survey [18].
Proof of Lemma 14.
Let X,Y be Polish and let G⊂X×Y be a compact subset, writing GX for the projection of G onto X. Applying Theorem 33 to (Ξ,M)=(X,Bor(X)), Z=Y and
F(x):={y∈Y:(x,y)∈G}, it suffices to show that for any open U⊂Y,
[TABLE]
is a Borel measurable subset of X.
For this, note that because Y is Polish, we may represent U as the countable union of closed sets Ui, so U=∪iUi. Moreover, as one easily checks,
[TABLE]
It suffices to show that each VUi is closed. For this, let {xn}⊂VUi be a sequence converging to a point x∈X. To show x∈VUi, fix for each n an element yn∈F(xn)∩Ui. By compactness of G∩(X×Ui), it follows that a subsequence of (xn,yn) converges to an element (x∗,y∗) of G∩(X×Ui). But x=x∗, hence y∗∈F(x); since y∗∈Ui, it follows that x∈VUi.
∎