Hyper-u-amenablity and Hyperfiniteness of Treeable Equivalence Relations
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 free group (with $k \ge 2$ or $k = \infty$ generators) 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.