Essential countability of treeable equivalence relations

DOI10.1016/J.AIM.2014.07.035MaRDI QIDQ406286zbMATH OpenOpenAlexWikidataFDO

Authors Dominique Lecomte, Benjamin D. Miller, John D. Clemens

Publication date 8 September 2014

Published in Advances in Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.3801

zbMATH Keywords

dichotomy theoremessentially countable equivalence relationessentially hyperfinite equivalence relationhypersmooth equivalence relation

Mathematics Subject Classification ID

Classes of sets (Borel fields, (sigma)-rings, etc.), measurable sets, Suslin sets, analytic sets (28A05) Descriptive set theory (03E15)

Abstract: We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially countable if and only if there is no continuous embedding of E1 into E. Our techniques also yield the first classical proof of the analogous result for hypersmooth equivalence relations, and allow us to show that up to continuous Kakutani embeddability, there is a minimum Borel function which is not essentially countable-to-one.

Recommendations

• Treeable equivalence relations
• Bi-Borel reducibility of essentially countable Borel equivalence relations
• Selection theorems and treeability
• scientific article; zbMATH DE number 2236691
• COUNTABLE BOREL EQUIVALENCE RELATIONS

Cites work

• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• Borel chromatic numbers
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Selection theorems and treeability
• The Structure of Hyperfinite Borel Equivalence Relations
• The classification of hypersmooth Borel equivalence relations
• The graph-theoretic approach to descriptive set theory

Cited in

(12)

• On the complexity of Borel equivalence relations with some countability property
• Selection theorems and treeability
• New jump operators on equivalence relations
• Borel structurability by locally finite simplicial complexes
• Incomparable treeable equivalence relations
• Minimal definable graphs of definable chromatic number at least three
• Essential arities in algebras of finite type and arity trees
• Treeable equivalence relations
• On a relationship between countable functionals and projective trees
• scientific article; zbMATH DE number 2236691 (Why is no real title available?)
• Dichotomy theorems for families of non-cofinal essential complexity
• Trees and amenable equivalence relations

This page was built for publication: Essential countability of treeable equivalence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406286)