SearcharxivSearch

arXiv · 1509.00719

Chief factors in Polish groups

Abstract

In finite group theory, chief factors play an important and well-understood role in the structure theory. We here develop a theory of chief factors for Polish groups. In the development of this theory, we prove a version of the Schreier refinement theorem. We also prove a trichotomy for the structure of topologically characteristically simple Polish groups. The development of the theory of chief factors requires two independently interesting lines of study. First we consider injective, continuous homomorphisms with dense normal image. We show such maps admit a canonical factorization via a semidirect product, and as a consequence, these maps preserve topological simplicity up to abelian error. We then define two generalizations of direct products and use these to isolate a notion of semisimplicity for Polish groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Colin D. Reid, Phillip R. Wesolek. 2021-06-25. Chief factors in Polish groups. https://arxiv.org/abs/1509.00719

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