Simple and large equivalence relations

preprint2015arXivOpen access

Abstract

We construct ergodic discrete probability measure preserving equivalence relations $\cR$ that has no proper ergodic normal subequivalence relations and no proper ergodic finite-index subequivalence relations. We show that every treeable equivalence relation satisfying a mild ergodicity condition and cost >1>1 surjects onto every countable group with ergodic kernel. Lastly, we provide a simple characterization of normality for subequivalence relations and an algebraic description of the quotient.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.