arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1306.1270math.LOmath.GR
收藏

泛可列Borel拟序

Universal countable Borel quasi-orders

Jay Williams

摘要:

近年来,描述集合论的许多工作都集中在自然分类问题的Borel复杂性上,特别是在Borel约简的拟序下研究可数Borel等价关系及其结构。按照Louveau和Rosendal研究解析等价关系的方法,我们研究可数Borel拟序。本文研究了泛可数Borel拟序,即关于Borel约化的可数Borel拟序高于所有其它可数Borel拟序。首先证明了存在一个泛可数Borel拟序,然后证明了几个可数Borel拟序是泛可数Borel拟序.一个重要的例子是描述集理论树上的嵌入关系。我们的主要结果表明,有限生成群的可嵌入性是一个普适的可数Borel拟序,回答了Louveau和Rosendal的一个问题.这直接意味着有限生成群的双嵌入性是一个泛可数Borel等价关系。同样的技巧也被用来证明可数群的可嵌入性是一个泛解析拟序。最后,我们证明了,直到Borel双约化,有连续的许多不同的可数Borel拟序对称的一个普遍的可数Borel等价关系。

英文摘要:

In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the quasi-order of Borel reducibility. Following the approach of Louveau and Rosendal for the study of analytic equivalence relations, we study countable Borel quasi-orders. In this paper we are concerned with universal countable Borel quasi-orders, i.e. countable Borel quasi-orders above all other countable Borel quasi-orders with regard to Borel reducibility. We first establish that there is a universal countable Borel quasi-order, and then establish that several countable Borel quasi-orders are universal. An important example is an embeddability relation on descriptive set theoretic trees. Our main result states that embeddability of finitely generated groups is a universal countable Borel quasi-order, answering a question of Louveau and Rosendal. This immediately implies that biembeddability of finitely generated groups is a universal countable Borel equivalence relation. The same techniques are also used to show that embeddability of countable groups is a universal analytic quasi-order. Finally, we show that, up to Borel bireducibility, there are continuum-many distinct countable Borel quasi-orders which symmetrize to a universal countable Borel equivalence relation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑