Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 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 Abelian Polish Groups and Their Actions (1512.07677v1)

Published 24 Dec 2015 in math.LO

Abstract: In this paper we consider non-archimedean abelian Polish groups whose orbit equivalence relations are all Borel. Such groups are called tame. We show that a non-archimedean abelian Polish group is tame if and only if it does not involve $\Z\omega$ or $(\Z(p){<\omega})\omega$ for any prime $p$. In addition to determining the structure of tame groups, we also consider the actions of such groups and study the complexity of their orbit equivalence relations in the Borel reducibility hierarchy. It is shown that if such an orbit equivalence relation is essentially countable, then it must be essentially hyperfinite. We also find an upper bound in the Borel reducibility hierarchy for the orbit equivalence relations of all tame non-archimedean abelian Polish groups.

Citations (13)

Summary

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