---
title: Hyper-u-Amenability in Borel Relations
url: https://www.emergentmind.com/topics/hyper-u-amenability
type: topic
---

# Hyper-u-Amenability in Borel Relations

Searching arXiv for recent papers on hyper-u-amenability and closely related terminology.
Hyper-\(u\)-amenability is a notion for countable Borel equivalence relations introduced as a strengthened form of amenability that is implied by hyperfiniteness and designed to interact effectively with treeability and Borel asymptotic dimension. In the formulation introduced in "Hyper-u-amenablity and Hyperfiniteness of Treeable Equivalence Relations" [2507.07891], the concept is built from the metric-dependent notion of \(u\)-amenability and then promoted to an intrinsic closure property via graphings. Its central role is to bridge amenability-type hypotheses and hyperfiniteness: for treeable countable Borel equivalence relations, hyper-\(u\)-amenability implies hyperfiniteness [2507.07891].

## 1. Definition and ambient framework

The theory is formulated for a standard Borel space \(X\) and a countable Borel equivalence relation \(E \subseteq X^2\), meaning that \(E\) is a Borel subset of \(X\times X\) and each equivalence class \([x]_E\) is countable [2507.07891]. A Borel graph \(G=(X,R)\) is a symmetric, irreflexive Borel subset \(R\subseteq X^2\), and its connectedness relation \(E_G\) is the equivalence relation of lying in the same connected component [2507.07891].

The paper distinguishes several standard notions. A countable Borel equivalence relation is finite if every class is finite, hyperfinite if it is the increasing union of finite Borel equivalence relations, measure-hyperfinite if every Borel probability measure concentrates on a Borel set on which the restricted relation is hyperfinite, and treeable if it admits an acyclic graphing [2507.07891]. The development uses a Borel extended metric \(\rho\) on \(X\), often the shortest-path metric \(\rho_G\) induced by a graphing \(G\) [2507.07891].

The starting point is the standard JKL notion of amenability for countable Borel equivalence relations. A relation \(E\) is amenable if there are Borel maps
\[
\lambda_n:E\to \mathbb{R}_{\ge 0}\qquad (n\in\mathbb N)
\]
such that for each \(x\in X\), the function \(\lambda_{n,x}(y):=\lambda_n(x,y)\) belongs to \(\ell^1([x]_E)\), satisfies \(\|\lambda_{n,x}\|_1=1\), and obeys
\[
\|\lambda_{n,x}-\lambda_{n,y}\|_1 \to 0 \quad\text{as } n\to\infty
\]
for all \(xEy\) [2507.07891]. This is the usual approximate-invariant-means formulation along equivalence classes.

## 2. \(u\)-amenability and the passage to hyper-\(u\)-amenability

The paper strengthens amenability by imposing uniformity relative to a metric. If \((X,\rho)\) is a Borel extended metric space and \(E\subseteq E_\rho\), then \(E\) is \(u\)-amenable with respect to \(\rho\) if there are Borel maps
\[
\lambda_n:E\to \mathbb{R}_{\ge 0}\qquad (n\in\mathbb N)
\]
such that for each \(x\in X\), \(\lambda_{n,x}\in \ell^1([x]_E)\), \(\|\lambda_{n,x}\|_1=1\), and
\[
\sup_{\{(x,y)\in E:\ \rho(x,y)<r\} } \|\lambda_{n,x}-\lambda_{n,y}\|_1 \longrightarrow 0
\quad\text{as }n\to\infty
\]
for every \(r>0\) [2507.07891]. A Borel graph \(G\) is \(u\)-amenable if \(E_G\) is \(u\)-amenable with respect to \(\rho_G\) [2507.07891].

The distinction from ordinary amenability is exact. Amenability requires convergence for each fixed pair \(xEy\), whereas \(u\)-amenability requires convergence uniformly over all pairs lying within any fixed \(\rho\)-radius [2507.07891]. The paper emphasizes that this dependence on the metric is a feature, but also the reason \(u\)-amenability is not purely a property of \(E\) unless it is repackaged into an intrinsic notion [2507.07891].

Hyper-\(u\)-amenability is that intrinsic notion. A countable Borel equivalence relation \(E\) is hyper-\(u\)-amenable if it admits a graphing \(G=(X,R)\) that is an increasing union of Borel \(u\)-amenable graphs,
\[
R=\bigcup_{n\in\mathbb N} R_n,\qquad R_n\subseteq R_{n+1},
\]
where each \(G_n=(X,R_n)\) is \(u\)-amenable [2507.07891]. The paper proves that this does not depend on the initial graphing in a problematic way: if one graphing has such a decomposition, then every graphing does, and the pieces can be chosen of finite degree [2507.07891]. In the form recorded in the paper, Proposition 4.2 yields
\[
\text{hyper-}u\text{-amenability} \implies \text{every graphing decomposes into an increasing union of finite-degree u-amenable subgraphs}
\]
[2507.07891].

## 3. Relation to amenability, hyperfiniteness, and treeability

The motivation is a standard asymmetry in the theory of countable Borel equivalence relations: hyperfinite implies amenable is known, while whether amenable implies hyperfinite is open in general [2507.07891]. Hyper-\(u\)-amenability is introduced as a strong form of amenability still implied by hyperfiniteness, but strong enough to force finite Borel asymptotic dimension in acyclic finite-degree graphs [2507.07891].

Treeability is structurally central. The main structural theorem applies to acyclic graphings, and hyperfinite relations are known to be treeable [2507.07891]. Against that background, the paper proves the converse under the stronger hypothesis of hyper-\(u\)-amenability:
\[
\text{Treeable + hyper-}u\text{-amenable} \Rightarrow \text{hyperfinite}
\]
[2507.07891]. This identifies hyper-\(u\)-amenability as a strengthening of amenability tailored to the treeable setting.

A plausible implication is that hyper-\(u\)-amenability is intended not merely as an abstract strengthening, but as a uniformity condition that enables geometric control over treeings. The paper makes this precise through Borel asymptotic dimension rather than through purely measure-theoretic arguments [2507.07891].

## 4. Geometric mechanism: acyclic graphs and Borel asymptotic dimension

The main technical theorem concerns acyclic finite-degree graphs. If \(G=(X,R)\) is an acyclic Borel graph with \(\deg(G)<\infty\) and \(G\) is \(u\)-amenable, then
\[
asdim(X,\rho_G)\le 1.
\]
In particular, \(E_G\) is hyperfinite [2507.07891]. The paper identifies this as Theorem 5.2, also Theorem 1.1 in the body [2507.07891].

The proof uses \(u\)-amenability to construct a partial Borel orientation and then invokes the Borel asymptotic dimension machinery of Conley–Jackson–Marks–Seward–Tucker-Drob [2507.07891]. Several ingredients are singled out.

For an acyclic graph \(G\) and a Borel family \(\lambda_x\in \ell^1([x]_G)\), the paper defines Borel maps
\[
\theta_0(x,y)=\lambda_x([x]_{G_{x,y}}),\qquad
\theta_1(x,y)=\lambda_y([y]_{G_{x,y}})
\]
where \(G_{x,y}\) is obtained by deleting the edge \((x,y)\) [2507.07891]. These maps quantify how much of \(\lambda_x\) and \(\lambda_y\) lies on each side of a cut edge.

A further ingredient is a quasi-oriented decomposition lemma, stated as Lemma 4.3, which gives a sufficient criterion for
\[
asdim(X,\rho_G)\le 3
\]
under a decomposition \(R=R_0\sqcup R_1\) satisfying orientation and sparsity conditions [2507.07891]. In the acyclic \(u\)-amenable case, the hypotheses are verified sharply enough to conclude \(asdim\le 1\) [2507.07891].

The paper also records the explicit \(u\)-amenability estimate used in the construction: given \(r>0\), one chooses \(\lambda_x\) so that
\[
\|\lambda_x-\lambda_y\|_1<1/12
\quad\text{whenever }\rho_G(x,y)\le r+2,
\]
then defines \(R_0\) by those edges across which the mass on the two sides is decisively biased [2507.07891]. This yields a partial orientation with out-degree \(\le 1\), while the complementary subgraph \(R_1\) satisfies the sparse-leaf and separation properties required by the criterion [2507.07891].

## 5. The main theorem for treeable equivalence relations

The headline theorem states that if \(E\) is a treeable and hyper-\(u\)-amenable countable Borel equivalence relation, then \(E\) is hyperfinite [2507.07891]. The argument is concise once the geometric machinery is available.

One first chooses an acyclic graphing \(G\) of \(E\) [2507.07891]. By Proposition 4.2, \(G\) can be written as an increasing union \(G=\bigcup_n G_n\) with each \(G_n\) \(u\)-amenable and of finite degree [2507.07891]. Since each \(G_n\) is acyclic and \(u\)-amenable, Theorem 5.2 implies that \((X,\rho_{G_n})\) has finite asymptotic dimension and hence each \(E_{G_n}\) is hyperfinite [2507.07891]. The paper then applies a union proposition in Borel asymptotic dimension: if \(R_n\subseteq R_{n+1}\) and each \((X,\rho_{G_n})\) has finite asymptotic dimension, then
\[
\bigcup_n E_{G_n}
\]
is hyperfinite [2507.07891]. Since \(\bigcup_n E_{G_n}=E\), hyperfiniteness follows [2507.07891].

This theorem is the main reason the notion was introduced. The paper explicitly presents hyper-\(u\)-amenability as a strengthening of amenability designed so that the treeable case becomes tractable [2507.07891].

## 6. Classes of examples and corollaries

The paper gives several classes in which hyper-\(u\)-amenability occurs naturally [2507.07891]. The following summary collects the cases explicitly stated.

| Setting | Conclusion |
|---|---|
| Continuous topologically amenable action \(G\curvearrowright X\) | For every compact \(K\subseteq X\) and finite \(S\subseteq G\), the Schreier graph \(Sch(X,S)|_K\) is \(u\)-amenable |
| Continuous action on a \(\sigma\)-compact Polish space, all stabilizers amenable, and \(E_G^X\) measure-hyperfinite | \(E_G^X\) is hyper-\(u\)-amenable |
| Borel action of a countable amenable group | The orbit equivalence relation is hyper-\(u\)-amenable |
| Amenable and Borel bounded equivalence relation | It is hyper-\(u\)-amenable |

The corollaries emphasize the interaction with treeability. If \(F_k\) with \(k\ge 2\) or \(k=\infty\) acts freely and continuously on a \(\sigma\)-compact Polish space \(X\), and the orbit relation \(E_{F_k}^X\) is measure-hyperfinite, then \(E_{F_k}^X\) is hyperfinite [2507.07891]. The route is that such relations are hyper-\(u\)-amenable, and the main theorem then applies [2507.07891].

If a countable amenable group acts Borelly on a standard Borel space \(X\) and the orbit equivalence relation \(E_G^X\) is treeable, then \(E_G^X\) is hyperfinite [2507.07891]. The paper attributes the hyper-\(u\)-amenability input to Proposition 4.3 and then applies treeable \(+\) hyper-\(u\)-amenable \(\Rightarrow\) hyperfinite [2507.07891].

A further corollary states that if \(E\) is treeable, amenable, and Borel bounded, then \(E\) is hyperfinite [2507.07891]. Here Borel boundedness means that for every Borel map \(f:X\to \mathbb N^\mathbb N\), there exists a Borel \(\psi\) such that \(f(x)\le^\ast \psi(x)\) and \(\psi(x)=^\ast \psi(y)\) whenever \(xEy\) [2507.07891]. The paper shows that amenable \(+\) Borel bounded implies hyper-\(u\)-amenable, so the treeable theorem again yields hyperfiniteness [2507.07891].

## 7. Terminology, scope, and nearby notions

The term hyper-\(u\)-amenability is used formally in the setting of countable Borel equivalence relations in [2507.07891]. The paper explicitly distinguishes it from \(u\)-amenability: the latter depends on a chosen metric or graphing, whereas hyper-\(u\)-amenability is introduced as the intrinsic graphing-independent closure property [2507.07891].

The literature also contains nearby amenability notions with similar names but different meanings. "Operator ultra-amenability" for completely contractive Banach algebras is defined by the condition that every ultrapower \((\mathcal A)_{\mathcal U}\) is operator amenable [1608.01153]. For Fourier algebras, that notion imposes severe restrictions: if \(A(G)\) is operator ultra-amenable, then \(G\) is discrete and amenable and contains no infinite abelian subgroup [1608.01153]. The terminology is adjacent, but it belongs to operator space theory rather than Borel equivalence relations.

Likewise, work on amenability of unitary co-representations of locally compact quantum groups studies left- and right-invariant means for co-representations and proves that amenability passes under weak containment [1609.08920]. That theory does not define hyper-\(u\)-amenability as a separate notion [1609.08920]. In a different direction, extreme amenability of the unitary group of the hyperfinite II\(_1\)-factor is established via Lévy concentration, again without introducing hyper-\(u\)-amenability [1507.00243]. These neighboring uses of amenability language are relevant for disambiguation, but they are conceptually distinct from the Borel-equivalence-relation notion introduced in 2025 [2507.07891].

The central conceptual takeaway of [2507.07891] is that hyper-\(u\)-amenability functions as a stronger uniform version of amenability that is still satisfied in many natural situations, yet is strong enough to control the geometry of treeings through Borel asymptotic dimension. The paper summarizes this mechanism by the implications
\[
\text{u-amenable acyclic finite-degree graph} \Rightarrow asdim < \infty \Rightarrow \text{hyperfinite},
\]
and then
\[
\text{treeable + hyper-}u\text{-amenable} \Rightarrow \text{hyperfinite}
\]
[2507.07891]. This suggests that the notion is best understood as a bridge between amenability-type hypotheses and structural finiteness properties in the treeable regime.

Source: https://www.emergentmind.com/topics/hyper-u-amenability