A note on Borel--Cantelli lemmas for non-uniformly hyperbolic dynamical systems

preprint2011arXivOpen access

Abstract

Let (Bi)(B_{i}) be a sequence of measurable sets in a probability space (X,B,μ)(X,\mathcal{B}, μ) such that ∑n=1∞μ(Bi)=∞\sum_{n=1}^{\infty} μ(B_{i}) = \infty. The classical Borel-Cantelli lemma states that if the sets BiB_{i} are independent, then μ({x∈X:x∈Biinfinitely often (i.o.))=1μ(\{x \in X : x \in B_{i} \text{infinitely often (i.o.)}) = 1. Suppose (T,X,μ)(T,X,μ) is a dynamical system and (Bi)(B_i) is a sequence of sets in XX. We consider whether Tix∈BiT^i x\in B_i for μμ a.e.\ x∈Xx\in X and if so, is there an asymptotic estimate on the rate of entry. If Tix∈BiT^i x\in B_i infinitely often for μμ a.e.\ xx we call the sequence BiB_i a Borel--Cantelli sequence. If the sets Bi:=B(p,ri)B_i:= B(p,r_i) are nested balls about a point pp then the question of whether Tix∈BiT^i x\in B_i infinitely often for μμ a.e.\ xx is often called the shrinking target problem. We show, under certain assumptions on the measure μμ, that for balls BiB_i if μ(Bi)≥i−γμ(B_i)\ge i^{-γ}, 0<γ<10<γ<1, then a sufficiently high polynomial rate of decay of correlations for Lipschitz observations implies that the sequence is Borel-Cantelli. If μ(Bi)≥Clog⁡iiμ(B_i)\ge \frac{C\log i}{i} then exponential decay of correlations implies that the sequence is Borel-Cantelli. If it is only assumed that μ(Bi)≥1iμ(B_i) \ge \frac{1}{i} then we give conditions in terms of return time statistics which imply that for μμ a.e.\ pp sequences of nested balls B(p,1/i)B(p,1/i) are Borel-Cantelli. Corollaries of our results are that for planar dispersing billiards and Lozi maps μμ a.e.\ pp sequences of nested balls B(p,1/i)B(p,1/i) are Borel-Cantelli. We also give applications of these results to a variety of non-uniformly hyperbolic dynamical systems.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.