SearcharxivSearch

arXiv · 1401.3142

Locally normal subgroups of totally disconnected groups. Part II: Compactly generated simple groups

Abstract

We use the structure lattice, introduced in Part I, to undertake a systematic study of the class $\mathscr S$ consisting of compactly generated, topologically simple, totally disconnected locally compact groups that are non-discrete. Given $G \in \mathscr S$, we show that compact open subgroups of $G$ involve finitely many isomorphism types of composition factors, and do not have any soluble normal subgroup other than the trivial one. By results of Part I, this implies that the centraliser lattice and local decomposition lattice of $G$ are Boolean algebras. We show that the $G$-action on the Stone space of those Boolean algebras is minimal, strongly proximal, and micro-supported. Building upon those results, we obtain partial answers to the following key problems: Are all groups in $\mathscr S$ abstractly simple? Can a group in $\mathscr S$ be amenable? Can a group in $\mathscr S$ be such that the contraction groups of all of its elements are trivial?

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre-Emmanuel Caprace, Colin D. Reid, George A. Willis. 2014-01-14. Locally normal subgroups of totally disconnected groups. Part II: Compactly generated simple groups. https://doi.org/10.1017/fms.2017.8

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