Tree-like graphings, wallings, and median graphings of equivalence relations
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913769561522176 |
|---|---|
| author | Chen, Ruiyuan Poulin, Antoine Tao, Ran Tserunyan, Anush |
| author_facet | Chen, Ruiyuan Poulin, Antoine Tao, Ran Tserunyan, Anush |
| contents | We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has bounded tree-width or is quasi-isometric to a tree, answering a question of Tucker-Drob. In the latter case, we moreover show that there exists a Borel quasi-isometry to a Borel forest, under the additional assumption of (componentwise) bounded degree. We also extend these results on quasi-treeings to Borel proper metric spaces. In fact, our most general result shows treeability of countable Borel equivalence relations equipped with an abstract wallspace structure on each class obeying some local finiteness conditions, which we call a proper walling. The proof is based on the Stone duality between proper wallings and median graphs, i.e., CAT(0) cube complexes. Finally, we strengthen the conclusion of treeability in these results to hyperfiniteness in the case where the original graph has one (selected) end per component, generalizing the same result for trees due to Dougherty--Jackson--Kechris. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_13010 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Tree-like graphings, wallings, and median graphings of equivalence relations Chen, Ruiyuan Poulin, Antoine Tao, Ran Tserunyan, Anush Logic Combinatorics Dynamical Systems Group Theory 03E15, 20F65, 20E08, 37A20 We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has bounded tree-width or is quasi-isometric to a tree, answering a question of Tucker-Drob. In the latter case, we moreover show that there exists a Borel quasi-isometry to a Borel forest, under the additional assumption of (componentwise) bounded degree. We also extend these results on quasi-treeings to Borel proper metric spaces. In fact, our most general result shows treeability of countable Borel equivalence relations equipped with an abstract wallspace structure on each class obeying some local finiteness conditions, which we call a proper walling. The proof is based on the Stone duality between proper wallings and median graphs, i.e., CAT(0) cube complexes. Finally, we strengthen the conclusion of treeability in these results to hyperfiniteness in the case where the original graph has one (selected) end per component, generalizing the same result for trees due to Dougherty--Jackson--Kechris. |
| title | Tree-like graphings, wallings, and median graphings of equivalence relations |
| topic | Logic Combinatorics Dynamical Systems Group Theory 03E15, 20F65, 20E08, 37A20 |
| url | https://arxiv.org/abs/2308.13010 |