SearcharxivSearch

arXiv · 1901.03963

Inapproximability of actions and Kazhdan's property (T)

Abstract

Let G be a countable group with Kazhdan property (T) and let G be a finitely generated group. We prove that if a sofic approximation of G x D has the property that its spanning subgraphs consisting of the G-labeled edges form an expander sequence, then D is locally embeddable into finite groups (LEF). Consequently, if D is not LEF, then every almost free p.m.p. action of G x D whose restriction to G is ergodic fails to weakly contain any sequence of finite labeled graphs; in particular, such an action is not a local-global limit of finite graphs. We also prove that, when D is amenable, the existence of an expander sofic approximation of G x D forces D to be LEF. The main technical input is a self-improvement theorem for almost automorphisms of expander sofic approximations of property (T) groups. It implies that the Hamming-distance clusters of sufficiently accurate almost automorphisms carry a natural finite group structure.

Explore related subjects

Keep this discovery

BibTeXRIS

Gabor Kun, Andreas Thom. 2019-01-13. Inapproximability of actions and Kazhdan's property (T). https://arxiv.org/abs/1901.03963

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR