Uniform Borel Amenability

TL;DR

This paper introduces uniform Borel amenability for bounded-degree Borel graphs, establishing its equivalence to randomized hyperfiniteness and extending classical theorems with measure-theoretic and structural results.

Contribution

It defines uniform Borel amenability, proves its equivalence to randomized hyperfiniteness, and extends key theorems in Borel graph theory with new structural and measure-theoretic insights.

Findings

Uniform Borel amenability is equivalent to randomized Borel hyperfiniteness.

Strengthenings of the Connes-Feldman-Weiss theorem are established.

Results include measure-theoretic almost finiteness and an Ornstein–Weiss packing theorem.

Abstract

We study a uniform, quantitative form of the amenability-hyperfiniteness paradigm for bounded-degree Borel graphs generating countable Borel equivalence relations. We introduce \emph{uniform Borel amenability} and prove that it is equivalent to \emph{randomized Borel hyperfiniteness}, a probabilistic version of hyperfiniteness. Consequences are three strengthenings of the Connes-Feldman-Weiss theorem. In the setting of uniformly Borel amenable F\o lner graphs (e.g. Borel graphs of not necessarily free actions of amenable groups or Borel graphs of subexponential growth), we establish an analogous equivalence to randomized Borel almost finiteness. We further obtain measure-theoretic structural results, including almost finiteness outside a $\mu$-null invariant set extending a recent result of Conley et al. for free amenable actions, and an Ornstein--Weiss type packing theorem that is uniform over all invariant measures. Finally, we show that uniformly Borel amenable graphs are hyperfinite modulo a compressible invariant set, i.e., after removing a Borel invariant set that is of measure zero for every invariant probability measure.