Strong ergodicity around countable products of countable equivalence relations

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 E is strongly ergodic with respect to μ then E^ℕ is strongly ergodic with respect to μ^ℕ. We answer questions of Clemens and Coskey regarding their recently defined Γ-jump operations, in particular showing that the ℤ^k+1-jump of E_∞ is strictly above the ℤ^k-jump of E_∞. 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 an equivalence relation which is strictly above E ^ℕ_∞ , strictly below =⁺, and is incomparable with the Γ-jumps of countable equivalence relations.

We establish a characterization of strong ergodicity between Borel equivalence relations in terms of symmetric models, using results from [Sha21]. The proofs then rely on a fine analysis of the very weak choice principles “every sequence of E-classes admits a choice sequence”, for various countable Borel equivalence relations E.