Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Non-Archimedean TSI Polish groups and their potential Borel complexity spectrum (2010.05085v2)

Published 10 Oct 2020 in math.LO and math.DS

Abstract: A variation of the Scott analysis of countable structures is applied to actions of non-Archimedean TSI Polish groups acting continuously on a Polish spaces. We give results on the potential Borel complexity spectrum of such groups, and define orbit equivalence relations that are universal for each Borel complexity class. We also identify an obstruction to classifiability by actions of such groups, namely generic ergodicity with respect to $E_\infty$, which we apply to Clemens-Coskey jumps of countable Borel equivalence relations. Finally, we characterize the equivalence relations that are both Borel-reducible to $=+$ and classifiable by non-Archimedean TSI Polish groups, extending a result of Ding and Gao. In the process, several tools are developed in the Borel reducibility theory of orbit equivalence relations which are likely to be of independent interest.

Summary

We haven't generated a summary for this paper yet.