Dichotomy Theorems for Families of Non-Cofinal Essential Complexity

Authors

John D. Clemens, Boise State UniversityFollow
Dominique Lecomte, Institut de Mathématiques de Jussieu
Benjamin D. Miller, Universität Wien

Document Type

Article

Publication Date

1-2-2017

Abstract

We prove that for every Borel equivalence relation E, either E is Borel reducible to ��₀, or the family of Borel equivalence relations incompatible with E has cofinal essential complexity. It follows that if F is a Borel equivalence relation and ℱ is a family of Borel equivalence relations of non-cofinal essential complexity which together satisfy the dichotomy that for every Borel equivalence relation E, either E ∈ ℱ or F is Borel reducible to E, then ℱ consists solely of smooth equivalence relations, thus the dichotomy is equivalent to a known theorem.

Publication Information

Clemens, John D.; Lecomte, Dominique; and Miller, Benjamin D. (2017). "Dichotomy Theorems for Families of Non-Cofinal Essential Complexity". Advances in Mathematics, 304, 285-299. https://doi.org/10.1016/j.aim.2016.08.044