SearcharxivSearch

arXiv · 0801.2955

Profinite completion and double-dual : isomorphisms and counter-examples

Abstract

We define, for any group $G$, finite approximations ; with this tool, we give a new presentation of the profinite completion $\hatπ : G \to \hat{G}$ of an abtract group $G$. We then prove the following theorem : if $k$ is a finite prime field and if $V$ is a $k$-vector space, then, there is a natural isomorphism between $\hat{V}$ (for the underlying additive group structure) and the additive group of the double-dual $V^{**}$. This theorem gives counter-examples concerning the iterated profinite completions of a group. These phenomena don't occur in the topological case.

Explore related subjects

Keep this discovery

BibTeXRIS

Colas Bardavid. 2008-01-18. Profinite completion and double-dual : isomorphisms and counter-examples. https://arxiv.org/abs/0801.2955

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