SearcharxivSearch

arXiv · 2107.02917

Proper proximality for various families of groups

Abstract

In this paper, the notion of proper proximality (introduced in [BIP18]) is studied and classified in various families of groups. We show that if a group acts non-elementarily by isometries on a tree such that for any two edges, the intersection of their edge stabilizers is finite, then G is properly proximal. We show that the wreath product G\wr H is properly proximal if and only if H is non-amenable. We then completely classify proper proximality among graph products of non-trivial groups. Our results generalize recent work of Duchesne, Tucker-Drob and Wesolek classifying inner amenability for these families of groups. Our results also recover some rigidity results associated to the group von Neumann algebras, by virtue of being properly proximal. A key idea in the proofs of our theorems is a technique to upgrade from relative proper proximality using computations in the double dual of the small at infinity boundary.

Explore related subjects

Keep this discovery

BibTeXRIS

Changying Ding, Srivatsav Kunnawalkam Elayavalli. 2021-07-06. Proper proximality for various families of groups. https://arxiv.org/abs/2107.02917

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