Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.12143

Aspects of automatic continuity

Christian Rosendal·Luis Carlos Suarez
View original source ↗Read source document ↗Export metadata ↓

Abstract

A general overview of the phenomenon of automatic continuity of homomorphisms between Polish groups is given. In particular, we study variants and improvements of the closed graph theorem, applying these to the problem of continuity of universally measurable homomorphisms and also to gauge the amount of choice needed to construct discontinuous homomorphisms between Polish groups. Furthermore, we provide a simple proof of automatic continuity in the context of homeomorphism groups of compact manifolds and a complete reworking of automatic continuity theory in the context of isometry groups of highly homogeneous complete metric structures.

Explore related subjects

math.GRmath.LO

Keep this discovery

BibTeXRIS

Christian Rosendal, Luis Carlos Suarez. 2024-06-17. Aspects of automatic continuity. https://arxiv.org/abs/2406.12143

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗