Decomposition of a symbolic element over a countable amenable group into blocks approximating ergodic measures

Pub Date : 2020-04-06 DOI:10.4171/ggd/679
T. Downarowicz, M. Wikecek
{"title":"Decomposition of a symbolic element over a countable amenable group into blocks approximating ergodic measures","authors":"T. Downarowicz, M. Wikecek","doi":"10.4171/ggd/679","DOIUrl":null,"url":null,"abstract":"Consider a subshift over a finite alphabet, $X\\subset \\Lambda^{\\mathbb Z}$ (or $X\\subset\\Lambda^{\\mathbb N_0}$). With each finite block $B\\in\\Lambda^k$ appearing in $X$ we associate the empirical measure ascribing to every block $C\\in\\Lambda^l$ the frequency of occurrences of $C$ in $B$. By comparing the values ascribed to blocks $C$ we define a metric on the combined space of blocks $B$ and probability measures $\\mu$ on $X$, whose restriction to the space of measures is compatible with the weak-$\\star$ topology. Next, in this combined metric space we fix an open set $\\mathcal U$ containing all ergodic measures, and we say that a block $B$ is \"ergodic\" if $B\\in\\mathcal U$. \nIn this paper we prove the following main result: Given $\\varepsilon>0$, every $x\\in X$ decomposes as a concatenation of blocks of bounded lengths in such a way that, after ignoring a set $M$ of coordinates of upper Banach density smaller than $\\varepsilon$, all blocks in the decomposition are ergodic. The second main result concerns subshifts whose set of ergodic measures is closed. We show that, in this case, no matter how $x\\in X$ is partitioned into blocks (as long as their lengths are sufficiently large and bounded), after ignoring a set $M$ of upper Banach density smaller than $\\varepsilon$, all blocks in the decomposition are ergodic. The first half of the paper is concluded by examples showing, among other things, that the small set $M$, in both main theorems, cannot be avoided. \nThe second half of the paper is devoted to generalizing the two main results described above to subshifts $X\\subset\\Lambda^G$ with the action of a countable amenable group $G$. The role of long blocks is played by blocks whose domains are members of a Folner sequence while the decomposition of $x\\in X$ into blocks (of which majority is ergodic) is obtained with the help of a congruent system of tilings.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4171/ggd/679","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Consider a subshift over a finite alphabet, $X\subset \Lambda^{\mathbb Z}$ (or $X\subset\Lambda^{\mathbb N_0}$). With each finite block $B\in\Lambda^k$ appearing in $X$ we associate the empirical measure ascribing to every block $C\in\Lambda^l$ the frequency of occurrences of $C$ in $B$. By comparing the values ascribed to blocks $C$ we define a metric on the combined space of blocks $B$ and probability measures $\mu$ on $X$, whose restriction to the space of measures is compatible with the weak-$\star$ topology. Next, in this combined metric space we fix an open set $\mathcal U$ containing all ergodic measures, and we say that a block $B$ is "ergodic" if $B\in\mathcal U$. In this paper we prove the following main result: Given $\varepsilon>0$, every $x\in X$ decomposes as a concatenation of blocks of bounded lengths in such a way that, after ignoring a set $M$ of coordinates of upper Banach density smaller than $\varepsilon$, all blocks in the decomposition are ergodic. The second main result concerns subshifts whose set of ergodic measures is closed. We show that, in this case, no matter how $x\in X$ is partitioned into blocks (as long as their lengths are sufficiently large and bounded), after ignoring a set $M$ of upper Banach density smaller than $\varepsilon$, all blocks in the decomposition are ergodic. The first half of the paper is concluded by examples showing, among other things, that the small set $M$, in both main theorems, cannot be avoided. The second half of the paper is devoted to generalizing the two main results described above to subshifts $X\subset\Lambda^G$ with the action of a countable amenable group $G$. The role of long blocks is played by blocks whose domains are members of a Folner sequence while the decomposition of $x\in X$ into blocks (of which majority is ergodic) is obtained with the help of a congruent system of tilings.
分享
查看原文
可数服从群上的符号元素分解为近似遍历测度的块
考虑一个有限字母表上的子移位,$X\subset \Lambda^{\mathbb Z}$(或$X\subset\Lambda^{\mathbb N_0}$)。对于出现在$X$中的每个有限块$B\in\Lambda^k$,我们将经验度量与$B$中$C$的出现频率关联到每个块$C\in\Lambda^l$。通过比较块$C$的属性值,我们在$X$的块组合空间$B$和概率测度$\mu$上定义了一个度量,该度量对测度空间的限制与弱$\star$拓扑兼容。接下来,在这个组合度量空间中,我们固定一个包含所有遍历测度的开集$\mathcal U$,我们说一个块$B$是“遍历的”,如果$B\in\mathcal U$。在本文中,我们证明了以下主要结果:给定$\varepsilon>0$,每个$x\in X$分解为有界长度的块的串联,在忽略一组上巴拿赫密度小于$\varepsilon$的坐标$M$后,分解中的所有块都是遍历的。第二个主要结果涉及子位移,其遍历测度集是闭合的。我们证明,在这种情况下,无论如何将$x\in X$划分为块(只要它们的长度足够大并且有界),在忽略小于$\varepsilon$的上Banach密度集$M$后,分解中的所有块都是遍历的。本文的前半部分是用一些例子来总结的,这些例子表明,在两个主要定理中,小集$M$是不可避免的。本文的后半部分致力于将上述两个主要结果推广到具有可数可服从群$G$作用的子位移$X\subset\Lambda^G$。长块的作用是由域是Folner序列成员的块来发挥的,而$x\in X$分解为块(其中大多数是遍历的)是通过一个同余的平铺系统得到的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信