Local stability of ergodic averages

Abstract

The mean ergodic theorem is equivalent to the assertion that for every function K and every epsilon, there is an n with the property that the ergodic averages A_m f are stable to within epsilon on the interval [n,K(n)]. We show that even though it is not generally possible to compute a bound on the rate of convergence of a sequence of ergodic averages, one can give explicit bounds on n in terms of K and || f || / epsilon. This tells us how far one has to search to find an n so that the ergodic averages are "locally stable" on a large interval. We use these bounds to obtain a similarly explicit version of the pointwise ergodic theorem, and show that our bounds are qualitatively different from ones that can be obtained using upcrossing inequalities due to Bishop and Ivanov. Finally, we explain how our positive results can be viewed as an application of a body of general proof-theoretic methods falling under the heading of "proof mining."

Minor errors corrected. To appear in Transactions of the AMS

References in corpus (2)

• Upcrossing inequalities for stationary sequences and applications
• Constructive Mathematics

Cited by in corpus (27)

• Computability and analysis: the legacy of Alan Turing
• Ergodic Theory and Visualization I: Mesochronic Plots for Visualization of Ergodic Partition and Invariant Sets
• Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
• Norm convergence of multiple ergodic averages for commuting transformations
• Norm convergence of multiple ergodic averages on amenable groups
• Metastable convergence theorems
• Oscillation and the mean ergodic theorem for uniformly convex Banach spaces
• Model theory and metric convergence I: Metastability and dominated convergence
• Ultraproducts and metastability
• Ergodic theorems for polynomials in nilpotent groups
• The computational content of classical arithmetic
• Effective results on nonlinear ergodic averages in CAT$(\kappa )$ spaces
• Proof mining in metric fixed point theory and ergodic theory
• Quantitative ergodic theorems for weakly integrable functions
• Dynamical systems, simulation, abstract computation
• Proof mining and probability theory
• A Worked Example of the Functional Interpretation
• On the close interaction between algorithmic randomness and constructive/computable measure theory
• An Inverse Ackermannian Lower Bound on the Local Unconditionality Constant of the James Space
• An application of continuous logic to fixed point theory
• A quantitative Mean Ergodic Theorem for uniformly convex Banach spaces
• Towards an Effective Theory of Absolutely Continuous Measures
• On the speed of convergence in the ergodic theorem for shift operators
• A quantitative multiparameter mean ergodic theorem
• Fluctuation bounds for ergodic averages of amenable groups on uniformly convex Banach spaces
• Quantitative ergodic theorems for actions of groups of polynomial growth
• Measure theory and higher order arithmetic