SearcharxivSearch

arXiv · 1003.5355

On subgroups of saturated or totally bounded paratopological groups

Abstract

A paratopological group $G$ is saturated if the inverse $U^{-1}$ of each non-empty set $U\subset G$ has non-empty interior. It is shown that a [first-countable] paratopological group $H$ is a closed subgroup of a saturated (totally bounded) [abelian] paratopological group if and only if $H$ admits a continuous bijective homomorphism onto a (totally bounded) [abelian] topological group $G$ [such that for each neighborhood $U\subset H$ of the unit $e$ there is a closed subset $F\subset G$ with $e\in h^{-1}(F)\subset U$]. As an application we construct a paratopological group whose character exceeds its $π$-weight as well as the character of its group reflexion. Also we present several examples of (para)topological groups which are subgroups of totally bounded paratopological groups but fail to be subgroups of regular totally bounded paratopological groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Taras Banakh, Alex Ravsky. 2010-03-28. On subgroups of saturated or totally bounded paratopological groups. https://arxiv.org/abs/1003.5355

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