Metraipolis › archive › dc_66d630cf0481
Finite index extensions of treeable equivalence relations are treeable — arXiv:2610.08986
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.08986
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:46:36.822Z
- SHA-256 of the archived text
fa10088071748bada1f9e9f53d20e418cacb1260b0fcbd658cf2d0c2b3b7b329- Stable URL of this page
https://metraipolis.com/documento/dc_66d630cf0481
How to cite
Finite index extensions of treeable equivalence relations are treeable — arXiv:2610.08986 — arXiv (en), https://arxiv.org/abs/2610.08986 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_66d630cf0481 (Metraipolis archive dc_66d630cf0481, sha256 fa10088071748bada1f9e9f53d20e418cacb1260b0fcbd658cf2d0c2b3b7b329)
BibTeX
@misc{dc66d630cf0481,
title = {Finite index extensions of treeable equivalence relations are treeable — arXiv:2610.08986},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.08986},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_66d630cf0481; sha256 fa10088071748bada1f9e9f53d20e418cacb1260b0fcbd658cf2d0c2b3b7b329},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08986. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that every countable Borel equivalence relation containing a finite index Borel treeable subequivalence relation is Borel treeable. This answers a long-standing question of Jackson--Kechris--Louveau. Our proof is based on a median subalgebra filtration construction on products of trees, together with an extension of the median graph treeing algorithm of Chen--Poulin--Tao--Tserunyan to certain well-behaved increasing unions. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.LO, nuovi lavori del giorno). Categorie arXiv: Logic (math.LO) ; Dynamical Systems (math.DS); Group Theory (math.GR). Pagina del lavoro: https://arxiv.org/abs/2610.08986 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T12:17:30.258Z dalla pagina https://arxiv.org/list/math.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).