SearcharxivSearch

arXiv · 2304.01536

Classification of non-free p.m.p. boolean actions of ergodic full groups and applications

Abstract

We extend Dye's reconstruction theorem, which classifies isomorphisms between full groups, to a classification of homomorphisms between full groups. For full groups of ergodic p.m.p. equivalence relations, our result roughly says that such homomorphisms come only from actions of the equivalence relation, or of one of its symmetric powers. This has several rigidity consequences for homomorphisms between full groups. Our main application is a characterization of property (T) for ergodic p.m.p. equivalence relations purely in full group terms, without using their topology: an ergodic p.m.p. equivalence relation has (T) iff all non-free ergodic boolean actions of its full group are strongly ergodic.

Explore related subjects

Keep this discovery

BibTeXRIS

Alessandro Carderi, Alice Giraud, François Le Maître. 2023-04-04. Classification of non-free p.m.p. boolean actions of ergodic full groups and applications. https://arxiv.org/abs/2304.01536

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