A strong Borel--Cantelli lemma for recurrence
Abstract
Consider a mixing dynamical systems ([0,1], T, μ), for instance a piecewise expanding interval map with a Gibbs measure μ. Given a non-summable sequence (mk) of non-negative numbers, one may define rk (x) such that μ (B(x, rk(x)) = mk. It is proved that for almost all x, the number of k ≤ n such that Tk (x) ∈ Bk (x) is approximately equal to m1 + … + mn. This is a sort of strong Borel--Cantelli lemma for recurrence. A consequence is that \[ r 0 τB(x,r) (x)- μ (B (x,r)) = 1 \] for almost every x, where τ is the return time.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.