Search arXivSearch

arXiv · 1311.2648

On group topologies determined by families of sets

Abstract

Let $G$ be an abelian group, and $F$ a downward directed family of subsets of $G$. The finest topology $\mathcal{T}$ on $G$ under which $F$ converges to $0$ has been described by I.Protasov and E.Zelenyuk. In particular, their description yields a criterion for $\mathcal{T}$ to be Hausdorff. They then show that if $F$ is the filter of cofinite subsets of a countable subset $X\subseteq G$, there is a simpler criterion: $\mathcal{T}$ is Hausdorff if and only if for every $g\in G-\{0\}$ and positive integer $n$, there is an $S\in F$ such that $g$ does not lie in the n-fold sum $n(S\cup\{0\}\cup-S)$. In this note, their proof is adapted to a larger class of families $F$. In particular, if $X$ is any infinite subset of $G$, $κ$ any regular infinite cardinal $\leq\mathrm{card}(X)$, and $F$ the set of complements in $X$ of subsets of cardinality $<κ$, then the above criterion holds. We then give some negative examples, including a countable downward directed set $F$ of subsets of $\mathbb{Z}$ not of the above sort which satisfies the "$g\notin n(S\cup\{0\}\cup-S)$" condition, but does not induce a Hausdorff topology. We end with a version of our main result for noncommutative $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

George M. Bergman. 2013-11-12. On group topologies determined by families of sets. https://arxiv.org/abs/1311.2648

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