Uniform ergodic theorems on subshifts over a finite alphabet (Q4533428)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1753652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uniform ergodic theorems on subshifts over a finite alphabet |
scientific article; zbMATH DE number 1753652 |
Statements
Uniform ergodic theorems on subshifts over a finite alphabet (English)
0 references
11 June 2002
0 references
subshift
0 references
finite alphabet
0 references
almost additive function
0 references
additive ergodic theorem
0 references
subadditive ergodic theorem
0 references
0.7660583853721619
0 references
0.7548326253890991
0 references
0.7485383749008179
0 references
0.7469274401664734
0 references
Let \(\Omega\) be a subshift over a finite alphabet \(A\) (i.e., \(\Omega\) is a closed subset of the set of two-sided sequences on \(A\), and \(\Omega\) is closed under the shift \(T\)). Let \(W\) be the set of finite words occurring in any element of \(\Omega\). Finally a function \(F:W\to B\), where \(B\) is a Banach space, is called almost-additive if \(\exists D>0\), \(\exists c: [0,\infty)\to [0,\infty)\) nondecreasing and with \(\lim_{t\to +\infty} c(r)=0\) such that \[ \Biggl\|F(v)- \sum_{j=1}^n F(v_j) \Biggr\|\leq \sum_{j=1}^n c(|v_j|)|v_j|\quad\text{for any }v= w_1\dots w_n\in W, \tag{a} \] \[ \|F(v)\|\leq D|v|\quad\forall v\in W, \tag{b} \] (\(|v|\) denotes the length of the word \(v\)). The first theorem of this paper states that the following three conditions are equivalent: (1) \((\Omega,T)\) is uniquely ergodic, (2) the limit of \(\frac{F(w)}{|w|}\) when \(|w|\to +\infty\) exists for every Banach-space-valued almost additive function \(F\) on \(W\), (3) the limit of \(\frac 1n \sum_{j=1}^n f(T^j\omega)\) exists uniformly in \(\omega\in \Omega\) for every continuous Banach-space-valued function \(f\) on \(\Omega\). Note that (1) only means that the frequency of occurrence of any word exists, and that \((1)\Leftrightarrow(3)\) and \((2)\Rightarrow(1)\) are classical. The main result of the author is the interesting implication \((1)\Rightarrow(2)\). After this additive ergodic theorem, the author also gives a subadditive ergodic theorem. Note that Reference [5] has appeared [\textit{D. Damanik} and the author, Discrete Comput. Geom. 26, No. 3, 411-428 (2001; Zbl 1182.37020)] with a slightly different title: ``Linear repetitivity, I. Uniform subadditive ergodic theorems and applications''. Also note that Reference [13] submitted to Ergodic Theory Dyn. Syst. is available at \texttt{http://arxiv.org/abs/math/9909033}.
0 references