SearcharxivSearch

arXiv · 1507.03275

Simple dimension groups that are isomorphic to stationary inductive limits

Abstract

A dimension group is an ordered abelian group that is an inductive limit of a sequence of simplicial groups, and a stationary dimension group is such an inductive limit in which the homomorphism is the same at every stage. If a simple dimension group is stationary then up to scalar multiplication it admits a unique trace (positive real-valued homomorphism), but the short exact sequence associated to this trace need not split. In an earlier paper, Handelman described these ordered groups concretely in the case when the trace has trivial kernel---i.e., the group is totally ordered---and in the case when the group is free. The main result here is a concrete description of how a stationary simple dimension group is built from the kernel and image of its trace. Specifically, every stationary simple dimension group contains the direct sum of the kernel of its trace with a copy of the image, and is generated by that direct sum and finitely many extra elements. Moreover, any ordered abelian group of this description is stationary. The following interesting fact is proved along the way to the main result: given any positive integer m and any square integer matrix B, there are two distinct integer powers of B, the difference of which has all entries divisible by m.

Explore related subjects

Keep this discovery

BibTeXRIS

Gregory R. Maloney. 2015-07-12. Simple dimension groups that are isomorphic to stationary inductive limits. https://arxiv.org/abs/1507.03275

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