Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A strong Borel--Cantelli lemma for recurrence (2202.07344v2)

Published 15 Feb 2022 in math.DS

Abstract: Consider a mixing dynamical systems $([0,1], T, \mu)$, for instance a piecewise expanding interval map with a Gibbs measure $\mu$. Given a non-summable sequence $(m_k)$ of non-negative numbers, one may define $r_k (x)$ such that $\mu (B(x, r_k(x)) = m_k$. It is proved that for almost all $x$, the number of $k \leq n$ such that $Tk (x) \in B_k (x)$ is approximately equal to $m_1 + \ldots + m_n$. This is a sort of strong Borel--Cantelli lemma for recurrence. A consequence is that [ \lim_{r \to 0} \frac{\log \tau_{B(x,r)} (x)}{- \log \mu (B (x,r))} = 1 ] for almost every $x$, where $\tau$ is the return time.

Summary

We haven't generated a summary for this paper yet.