arXiv · 2110.14466
Random Lochs' Theorem
Abstract
In 1964 Lochs proved a theorem on the number of continued fraction digits of a real number $x$ that can be determined from just knowing its first $n$ decimal digits. In 2001 this result was generalised to a dynamical systems setting by Dajani and Fieldsteel, where it compares sizes of cylinder sets for different transformations. In this article we prove a version of Lochs' Theorem for random dynamical systems as well as a corresponding Central Limit Theorem. The main ingredient for the proof is an estimate on the asymptotic size of the cylinder sets of the random system in terms of the fiber entropy. To compute this entropy we provide a random version of Rokhlin's formula for entropy.
Explore related subjects
Keep this discovery
Charlene Kalle, Evgeny Verbitskiy, Benthen Zeegers. 2021-10-27. Random Lochs' Theorem. https://arxiv.org/abs/2110.14466
Cite the original work for its findings. Save a collection to share your selection of sources.