Actions of tame abelian product groups

From MaRDI portal
Publication:6132763

DOI10.1142/S0219061322500283arXiv2105.05144OpenAlexW3160938664MaRDI QIDQ6132763FDOQ6132763


Authors: Shaun Allison, Assaf Shani Edit this on Wikidata


Publication date: 14 July 2023

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Abstract: A Polish group G is tame if for any continuous action of G, the corresponding orbit equivalence relation is Borel. When G=prodnGamman for countable abelian Gamman, Solecki (1995) gave a characterization for when G is tame. Ding and Gao (2017) showed that for such G, the orbit equivalence relation must in fact be potentially mathbfPi60, while conjecturing that the optimal bound could be mathbfPi30. We show that the optimal bound is D(mathbfPi50) by constructing an action of such a group G which is not potentially mathbfPi50, and show how to modify the analysis of Ding and Gao to get this slightly better upper bound. It follows, using the results of Hjorth, Kechris, and Louvaeu (1998), that this is the optimal bound for the potential complexity of actions of tame abelian product groups. Our lower-bound analysis involves forcing over models of set theory where choice fails for sequences of finite sets.


Full work available at URL: https://arxiv.org/abs/2105.05144







Cites Work


Cited In (2)





This page was built for publication: Actions of tame abelian product groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132763)