A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties

In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets A"i with effectively summable measures, there are computable points which are not contained in infinitely many A"i. As a consequence of this we obtain the existence of computable points which follow the typical statistical behavior of a dynamical system (they satisfy the Birkhoff theorem) for a large class of systems, having computable invariant measure and a certain ''logarithmic'' speed of convergence of Birkhoff averages over Lipschitz observables. This is applied to uniformly hyperbolic systems, piecewise expanding maps, systems on the interval with an indifferent fixed point and it directly implies the existence of computable numbers which are normal with respect to any base.

[1]  Mariko Yasugi,et al.  Effective Properties of Sets and Functions in Metric Spaces with Computability Structure , 1999, Theor. Comput. Sci..

[2]  Lai-Sang Young,et al.  What Are SRB Measures, and Which Dynamical Systems Have Them? , 2002 .

[3]  Vasco Brattka.  Computable Versions of Baire's Category Theorem , 2001, MFCS.

[4]  C. R Gonzalez,et al.  Randomness and Ergodic Theory: An Algorithmic Point of View , 2008 .

[5]  J. Zukas.  Introduction to the Modern Theory of Dynamical Systems , 1998 .

[6]  Boris Hasselblatt,et al.  Introduction to the Modern Theory of Dynamical Systems: PRINCIPAL CLASSES OF ASYMPTOTIC TOPOLOGICAL INVARIANTS , 1995 .

[7]  S. Galatolo,et al.  Dynamics and abstract computability: Computing invariant measures , 2009, 0903.2385.

[8]  M. Giaquinta.  Cartesian currents in the calculus of variations , 1983 .

[9]  A. Turing,et al.  On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .

[10]  Santiago Figueira,et al.  An example of a computable absolutely normal number , 2002, Theor. Comput. Sci..

[11]  D. Champernowne.  The Construction of Decimals Normal in the Scale of Ten , 1933 .

[12]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[13]  Sebastien Gouezel.  Sharp polynomial estimates for the decay of correlations , 2002 .

[14]  S. Galatolo.  Orbit complexity by computable structures , 2000 .

[15]  Claus-Peter Schnorr,et al.  Zufälligkeit und Wahrscheinlichkeit - Eine algorithmische Begründung der Wahrscheinlichkeitstheorie , 1971, Lecture Notes in Mathematics.

[16]  Péter Gács,et al.  Randomness on Computable Probability Spaces—A Dynamical Point of View , 2009, Theory of Computing Systems.

[17]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[18]  M. Hoyrup.  Computability, Randomness and Ergodic Theory on Metric Spaces , 2008 .

[19]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[20]  Stefano Isola,et al.  On systems with finite ergodic degree , 2003, math/0308019.

[21]  Péter Gács,et al.  Uniform test of algorithmic randomness over a general space , 2003, Theor. Comput. Sci..

[22]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[23]  Mathieu Hoyrup,et al.  Computability of probability measures and Martin-Löf randomness over metric spaces , 2007, Inf. Comput..

[24]  S. Troubetzkoy,et al.  Complexity and Randomness of Recursive Discretizations of Dynamical Systems , 2005 .