English

Hyper-u-amenablity and Hyperfiniteness of Treeable Equivalence Relations

Logic 2026-02-03 v2 Dynamical Systems Group Theory

Abstract

We introduce the notions of u-amenability and hyper-u-amenability for countable Borel equivalence relations, strong forms of amenability that are implied by hyperfiniteness. We show that treeable, hyper-u-amenable countable Borel equivalence relations are hyperfinite. One of the corollaries that we get is that if a countable Borel equivalence relation is measure-hyperfinite and equal to the orbit equivalence relation of a free continuous action of a virtually free group on a σ\sigma-compact Polish space, then it is hyperfinite. We also obtain that if a countable Borel equivalence relation is treeable and equal to the orbit equivalence relation of a Borel action of an amenable group on a standard Borel space, or if it is treeable, amenable and Borel bounded, then it is hyperfinite.

Keywords

Cite

@article{arxiv.2507.07891,
  title  = {Hyper-u-amenablity and Hyperfiniteness of Treeable Equivalence Relations},
  author = {Petr Naryshkin and Andrea Vaccaro},
  journal= {arXiv preprint arXiv:2507.07891},
  year   = {2026}
}

Comments

19 pages; minor changes to v1

R2 v1 2026-07-01T03:55:04.193Z