2000 character limit reached
Simple and large equivalence relations
Published 17 Jul 2015 in math.DS and math.OA | (1507.04841v2)
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$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.