Borel-Cantelli sequences
Michael Boshernitzan, Jon Chaika

TL;DR
This paper investigates Borel-Cantelli sequences in [0,1), establishing conditions for their characterization, exploring their geometric and Diophantine properties, and extending the concept to broader spaces.
Contribution
It provides necessary, sufficient, and combined conditions for Borel-Cantelli sequences, along with examples and extensions beyond the initial setting.
Findings
BC sequences satisfy specific measure-theoretic criteria.
Orbits of certain dynamical systems are BC, others are not.
BC property is linked to Diophantine approximation and geometric conditions.
Abstract
A sequence in is called Borel-Cantelli (BC) if for all non-increasing sequences of positive real numbers with the set \[\underset{k=1}{\overset{\infty}{\cap}} \underset{n=k}{\overset{\infty}{\cup}} B(x_n, a_n))=\{x\in[0,1)\mid |x_n-x|<a_n \text{for} \infty \text{many}n\geq1\}\] has full Lebesgue measure. (To put it informally, BC sequences are sequences for which a natural converse to the Borel-Cantelli Theorem holds). The notion of BC sequences is motivated by the Monotone Shrinking Target Property for dynamical systems, but our approach is from a geometric rather than dynamical perspective. A sufficient condition, a necessary condition and a necessary and sufficient condition for a sequence to be BC are established. A number of examples of BC and not BC sequences are presented. The property…
Peer Reviews
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.
Taxonomy
TopicsMathematical Dynamics and Fractals · Computability, Logic, AI Algorithms · Advanced Topology and Set Theory
