Nonstandard analysis of the behavior of ergodic means of dynamical systems on very big finite probability spaces

Abstract

The trivial proof of the ergodic theorem for a finite set Y and a permutation T:Y Y shows that for an arbitrary function f:Y R the sequence of ergodic means An(f,T) stabilizes for n |T|. We show that if |Y| is very large and |f(y)| |Y| for almost all y, then An(f,T) stabilizes for significantly long segments of very large numbers n that are, however, |T|. This statement has a natural rigorous formulation in the setting of nonstandard analysis, which is, in fact, equivalent to the ergodic theorem for infinite probability spaces. Its standard formulation in terms of sequences of finite probability spaces is complicated. We also discuss some other properties of the sequence An(f,T) for very large finite |Y| and n. A special consideration is given to the case, when a very big finite space Y and its permutation T approximate a dynamical system (X,, τ), where X is compact metric space, is a Borel measure on X and τ:X X is a measure preserving transformation. The definition of approximation introduced here is new to our knowledge.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…