Search arXivSearch

arXiv · 2011.01829

Closed approximate subgroups: compactness, amenability and approximate lattices

Abstract

We investigate properties of closed approximate subgroups of locally compact groups, with a particular interest for approximate lattices i.e. those approximate subgroups that are discrete and have finite co-volume. We prove an approximate subgroup version of Cartan's closed-subgroup theorem and study some applications. We give a structure theorem for closed approximate subgroups of amenable groups in the spirit of the Breuillard--Green--Tao theorem. We then prove two results concerning approximate lattices: we extend to amenable groups a structure theorem for mathematical quasi-crystals due to Meyer; we prove results concerning intersections of radicals of Lie groups and discrete approximate subgroups generalising theorems due to Auslander, Bieberbach and Mostow. As an underlying theme, we exploit the notion of good models of approximate subgroups that stems from the work of Hrushovski, and Breuillard, Green and Tao. We show how one can draw information about a given approximate subgroup from a good model, when it exists.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon Machado. 2020-11-03. Closed approximate subgroups: compactness, amenability and approximate lattices. https://doi.org/10.1017/fms.2024.67

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