Transactions of the American Mathematical Society · 2009 · 95 citations · 20 references
Natural SciencesMathematicsDynamical SystemsProbability TheoryStochastic ProcessesErgodic TheoryLimit TheoremsMarkov ProcessesStochastic StabilityErgodic ProcessesErgodic PropertiesErgodic StabilityErgodicityLocal StabilityPointwise Ergodic TheoremsProof MiningUpper Bounds
We consider the extent to which one can compute bounds on the rate of convergence of a sequence of ergodic averages. It is not difficult to construct an example of a computable Lebesgue measure preserving transformation of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="left-bracket 0 comma 1 right-bracket"> <mml:semantics> <mml:mrow> <mml:mo stretchy="false">[</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">]</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">[0,1]</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and a characteristic function <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="f equals chi Subscript upper A"> <mml:semantics> <mml:mrow> <mml:mi>f</mml:mi> <mml:mo>=</mml:mo> <mml:msub> <mml:mi> χ </mml:mi> <mml:mi>A</mml:mi> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">f = \chi _A</mml:annotation> </mml:semantics> </mml:math> </inline-formula> such that the ergodic averages <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper A Subscript n Baseline f"> <mml:semantics> <mml:mrow> <mml:msub> <mml:mi>A</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mi>f</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">A_n f</mml:annotation> </mml:semantics> </mml:math> </inline-formula> do not converge to a computable element of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper L squared left-parenthesis left-bracket 0 comma 1 right-bracket right-parenthesis"> <mml:semantics> <mml:mrow> <mml:msup> <mml:mi>L</mml:mi> <mml:mn>2</mml:mn> </mml:msup> <mml:mo stretchy="false">(</mml:mo> <mml:mo stretchy="false">[</mml:mo> <mml:mn>0</mml:mn> <mml:mo>,</mml:mo> <mml:mn>1</mml:mn> <mml:mo stretchy="false">]</mml:mo> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">L^2([0,1])</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . In particular, there is no computable bound on the rate of convergence for that sequence. On the other hand, we show that, for any nonexpansive linear operator <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T"> <mml:semantics> <mml:mi>T</mml:mi> <mml:annotation encoding="application/x-tex">T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> on a separable Hilbert space and any element <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="f"> <mml:semantics> <mml:mi>f</mml:mi> <mml:annotation encoding="application/x-tex">f</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , it is possible to compute a bound on the rate of convergence of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="mathematical left-angle upper A Subscript n Baseline f mathematical right-angle"> <mml:semantics> <mml:mrow> <mml:mo fence="false" stretchy="false"> ⟨ </mml:mo> <mml:msub> <mml:mi>A</mml:mi> <mml:mi>n</mml:mi> </mml:msub> <mml:mi>f</mml:mi> <mml:mo fence="false" stretchy="false"> ⟩ </mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\langle A_n f \rangle</mml:annotation> </mml:semantics> </mml:math> </inline-formula> from <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T"> <mml:semantics> <mml:mi>T</mml:mi> <mml:annotation encoding="application/x-tex">T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="f"> <mml:semantics> <mml:mi>f</mml:mi> <mml:annotation encoding="application/x-tex">f</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , and the norm <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="double-vertical-bar f Superscript asterisk Baseline double-vertical-bar"> <mml:semantics> <mml:mrow> <mml:mo fence="false" stretchy="false"> ‖ </mml:mo> <mml:msup> <mml:mi>f</mml:mi> <mml:mo> ∗ </mml:mo> </mml:msup> <mml:mo fence="false" stretchy="false"> ‖ </mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\| f^* \|</mml:annotation> </mml:semantics> </mml:math> </inline-formula> of the limit. In particular, if <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T"> <mml:semantics> <mml:mi>T</mml:mi> <mml:annotation encoding="application/x-tex">T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> is the Koopman operator arising from a computable ergodic measure preserving transformation of a probability space <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper X"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">X</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {X}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="f"> <mml:semantics> <mml:mi>f</mml:mi> <mml:
20
An Introduction to Harmonic Analysis.
Guido Weiss, Yitzhak Katznelson · American Mathematical Monthly · 1970 · 1.7K citations
Foundations of Constructive Analysis.
Abraham Robinson, Errett Bishop · American Mathematical Monthly · 1968 · 1.3K citations