SearcharxivSearch

arXiv · 1410.0975

Chain conditions, elementary amenable groups, and descriptive set theory

Abstract

We first consider three well-known chain conditions in the space of marked groups: the minimal condition on centralizers, the maximal condition on subgroups, and the maximal condition on normal subgroups. For each condition, we produce a characterization in terms of well-founded descriptive-set-theoretic trees. Using these characterizations, we demonstrate that the sets given by these conditions are co-analytic and not Borel in the space of marked groups. We then adapt our techniques to show elementary amenable marked groups may be characterized by well-founded descriptive-set-theoretic trees, and therefore, elementary amenability is equivalent to a chain condition. Our characterization again implies the set of elementary amenable groups is co-analytic and non-Borel. As corollary, we obtain a new, non-constructive, proof of the existence of finitely generated amenable groups that are not elementary amenable.

Explore related subjects

Keep this discovery

BibTeXRIS

Phillip Wesolek, Jay Williams. 2015-02-05. Chain conditions, elementary amenable groups, and descriptive set theory. https://arxiv.org/abs/1410.0975

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