English

Strong ergodicity around countable products of countable equivalence relations

Logic 2019-10-21 v1

Abstract

This paper deals with countable products of countable Borel equivalence relations and equivalence relations "just above" those in the Borel reducibility hierarchy. We show that if EE is strongly ergodic with respect to μ\mu then ENE^\mathbb{N} is strongly ergodic with respect to μN\mu^\mathbb{N}. We answer questions of Clemens and Coskey regarding their recently defined Γ\Gamma-jump operations, in particular showing that the Z2\mathbb{Z}^2-jump of EE_\infty is strictly above the Z\mathbb{Z}-jump of EE_\infty. We study a notion of equivalence relations which can be classified by infinite sequences of "definably countable sets". In particular, we define an interesting example of such equivalence relation which is strictly above ENE_\infty^\mathbb{N}, strictly below =+=^+, and is incomparable with the Γ\Gamma-jumps of countable equivalence relations. We establish a characterization of strong ergodicity between Borel equivalence relations in terms of symmetric models. The proofs then rely on a fine analysis of the very weak choice principles "every sequence of EE-classes admits a choice sequence", for various countable Borel equivalence relations EE.

Keywords

Cite

@article{arxiv.1910.08188,
  title  = {Strong ergodicity around countable products of countable equivalence relations},
  author = {Assaf Shani},
  journal= {arXiv preprint arXiv:1910.08188},
  year   = {2019}
}