SearcharxivSearch

arXiv · 1809.10518

The Lattice of Profinite Subgroups of Protori

Abstract

Compact connected abelian groups, or protori, have intrinsic structural characteristics that present for the entire category. In the case of finite-dimensional torus-free protori, The Resolution Theorem for Compact Abelian Groups sets the stage for demonstrating that the profinite subgroups inducing tori quotients comprise an isogeny class of finitely generated modules over the profinite integers, which is a lattice under intersection (meet) and + (join). The structural results enable the formulation of a universal resolution in the category of protori under morphisms of compact abelian groups. A single profinite subgroup from the lattice in the Resolution Theorem is replaced by the direct limit of the lattice of such subgroups and effects a covering morphism in which the discrete torsion-free Pontryagin dual of the protorus organically emerges as the kernel of the quotient map resolving the protorus. Among other advantages, this enables the study of a finite rank torsion-free abelian group as a canonical subgroup of its dual protorus, with the concomitant topological, analytical, and number-theoretic insights availed by the compact abelian setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Wayne Lewis. 2018-09-27. The Lattice of Profinite Subgroups of Protori. https://arxiv.org/abs/1809.10518

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