Some Progress on the Unique Ergodicity Problem

Colin Jahel
{"title":"Some Progress on the Unique Ergodicity Problem","authors":"Colin Jahel","doi":"10.1017/bsl.2021.63","DOIUrl":null,"url":null,"abstract":"Abstract This thesis is at the intersection of dynamics, probability and model theory. It focuses on a specialization of the notion of amenability: unique ergodicity. Let G be a Polish group, i.e., a topological group whose topology is separable and completely metrizable. We call a G-flow the action of G on a compact space. A G-flow is said to be minimal if every orbit is dense. A famous theorem of Ellis states that any Polish group G admits a unique universal minimal flow that we denote \n${\\mathrm {M}}(G)$\n . This means that for any minimal G-flow X there is a surjective G-map from \n${\\mathrm {M}}(G)$\n to X. G is said to be amenable if every G-flow admits an invariant probability measure, and uniquely ergodic if every minimal flow admits a unique invariant probability measure. The notion of unique ergodicity relating to a group was introduced by Angel, Kechris and Lyons. They also ask the following question which is the main focus of the thesis: Let G be an amenable Polish group with metrizable universal minimal flow, is G uniquely ergodic? Note that unique ergodicity is an interesting notion only for relatively large groups, as it is proved in the last chapter of this thesis that locally compact non compact Polish groups are never uniquely ergodic. This result is joint work with Andy Zucker. The thesis includes proofs of unique ergodicity of groups with interesting universal minimal flows, namely the automorphism group of the semigeneric directed graph and the automorphism group of the \n$2$\n -graph. It also includes a theorem stating that under some hypothesis on a \n$\\omega $\n -categorical structure M, the logic action of \n${\\mathrm {Aut}}(M)$\n on \n${\\mathrm {LO}}(M)$\n , the compact space of linear orders on M, is uniquely ergodic. This implies unique ergodicity for the group if its universal minimal flow happens to be the space of linear orderings. It can also be used to prove non-amenability of some groups for which the action of \n${\\mathrm {Aut}}(M)$\n on \n${\\mathrm {LO}}(M)$\n is not minimal. This result is joint work with Todor Tsankov. Finally, the thesis also presents a proof that under the assumption that the universal minimal flows involved are metrizable, unique ergodicity is stable under group extensions. This result is joint work with Andy Zucker. Abstract prepared by Colin Jahel. E-mail: cjahel@andrew.cmu.edu URL: http://math.univ-lyon1.fr/~jahel/doc/These.pdf","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":"1 1","pages":"527 - 528"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Bulletin of Symbolic Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1017/bsl.2021.63","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract This thesis is at the intersection of dynamics, probability and model theory. It focuses on a specialization of the notion of amenability: unique ergodicity. Let G be a Polish group, i.e., a topological group whose topology is separable and completely metrizable. We call a G-flow the action of G on a compact space. A G-flow is said to be minimal if every orbit is dense. A famous theorem of Ellis states that any Polish group G admits a unique universal minimal flow that we denote ${\mathrm {M}}(G)$ . This means that for any minimal G-flow X there is a surjective G-map from ${\mathrm {M}}(G)$ to X. G is said to be amenable if every G-flow admits an invariant probability measure, and uniquely ergodic if every minimal flow admits a unique invariant probability measure. The notion of unique ergodicity relating to a group was introduced by Angel, Kechris and Lyons. They also ask the following question which is the main focus of the thesis: Let G be an amenable Polish group with metrizable universal minimal flow, is G uniquely ergodic? Note that unique ergodicity is an interesting notion only for relatively large groups, as it is proved in the last chapter of this thesis that locally compact non compact Polish groups are never uniquely ergodic. This result is joint work with Andy Zucker. The thesis includes proofs of unique ergodicity of groups with interesting universal minimal flows, namely the automorphism group of the semigeneric directed graph and the automorphism group of the $2$ -graph. It also includes a theorem stating that under some hypothesis on a $\omega $ -categorical structure M, the logic action of ${\mathrm {Aut}}(M)$ on ${\mathrm {LO}}(M)$ , the compact space of linear orders on M, is uniquely ergodic. This implies unique ergodicity for the group if its universal minimal flow happens to be the space of linear orderings. It can also be used to prove non-amenability of some groups for which the action of ${\mathrm {Aut}}(M)$ on ${\mathrm {LO}}(M)$ is not minimal. This result is joint work with Todor Tsankov. Finally, the thesis also presents a proof that under the assumption that the universal minimal flows involved are metrizable, unique ergodicity is stable under group extensions. This result is joint work with Andy Zucker. Abstract prepared by Colin Jahel. E-mail: cjahel@andrew.cmu.edu URL: http://math.univ-lyon1.fr/~jahel/doc/These.pdf
关于唯一遍历性问题的一些进展
本文是动力学、概率论和模型理论的交叉研究。它侧重于适应性概念的专业化:独特的遍历性。设G是一个波兰群,即一个拓扑群,其拓扑是可分的且完全可度量的。我们称G流为G在紧化空间上的作用。如果每个轨道都是密集的,那么g流就是最小的。Ellis的一个著名定理指出,任何波兰群G都存在唯一的普遍极小流,我们将其记为${\mathrm {M}}(G)$。这意味着对于任何最小G流X,存在一个从${\ mathm {M}}(G)$到X的满射G映射,如果每个G流都允许一个不变的概率测度,则G是可服从的,如果每个最小流都允许一个唯一的不变概率测度,则G是唯一遍历的。与群体相关的独特遍历性概念是由Angel、Kechris和Lyons提出的。他们还提出了以下问题,这也是论文的主要焦点:假设G是一个具有可度量的普遍最小流的可服从的波兰群,G是唯一遍历的吗?注意,唯一遍历性是一个有趣的概念,只有对于相对较大的群,因为它证明了在本论文的最后一章,局部紧非紧波兰群从来没有唯一遍历。这个结果是与Andy Zucker共同完成的。本文给出了具有有趣的泛最小流群的唯一遍历性的证明,即半同向图的自同构群和$2$ -图的自同构群。它还包括一个定理,证明在一个$\ -范畴结构M上的某个假设下,${\mathrm {Aut}}(M)$对${\mathrm {LO}}(M)$的逻辑作用是唯一遍历的,即M上线性阶的紧化空间。这意味着如果群的普遍最小流恰好是线性排序空间,则群具有唯一遍历性。它也可以用来证明${\mathrm {Aut}}(M)$对${\mathrm {LO}}(M)$的作用不是最小的一些群的不可适应性。这个结果是与Todor Tsankov共同完成的。最后,本文还证明了在所涉及的泛最小流是可度量的假设下,唯一遍历性在群扩展下是稳定的。这个结果是与Andy Zucker共同完成的。摘要由Colin Jahel准备。电子邮件:cjahel@andrew.cmu.edu URL: http://math.univ-lyon1.fr/~jahel/doc/These.pdf
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信