SearcharxivSearch

arXiv · 1601.07317

Dense normal subgroups and chief factors in locally compact groups

Abstract

In 'The essentially chief series of a compactly generated locally compact group', an analogue of chief series for finite groups is discovered for compactly generated locally compact groups. In the present article, we show that chief factors necessarily exist in all locally compact groups with sufficiently rich topological structure. We also show that chief factors have one of seven types, and for all but one of these types, there is a decomposition into discrete groups, compact groups, and topologically simple groups. Our results for chief factors require exploring the theory developed in 'Chief factors in Polish groups' in the setting of locally compact groups. In this context, we obtain tighter restrictions on the factorization of normal compressions and the structure of quasi-products. Consequently, both (non-)amenability and elementary decomposition rank are preserved by normal compressions.

Explore related subjects

Keep this discovery

BibTeXRIS

Colin D. Reid, Phillip R. Wesolek. 2016-01-27. Dense normal subgroups and chief factors in locally compact groups. https://doi.org/10.1112/plms.12088

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