SearcharxivSearch

arXiv · 1006.4188

Finitely presented lattice-ordered abelian groups with order-unit

Abstract

Let $G$ be an $\ell$-group (which is short for ``lattice-ordered abelian group''). Baker and Beynon proved that $G$ is finitely presented iff it is finitely generated and projective. In the category $\mathcal U$ of {\it unital} $\ell$-groups---those $\ell$-groups having a distinguished order-unit $u$---only the $(\Leftarrow)$-direction holds in general. Morphisms in $\mathcal U$ are {\it unital $\ell$-homomorphisms,} i.e., hom\-o\-mor\-phisms that preserve the order-unit and the lattice structure. We show that a unital $\ell$-group $(G,u)$ is finitely presented iff it has a basis, i.e., $G$ is generated by an abstract Schauder basis over its maximal spectral space. Thus every finitely generated projective unital $\ell$-group has a basis $\mathcal B$. As a partial converse, a large class of projectives is constructed from bases satisfying $\bigwedge\mathcal B\not=0$. Without using the Effros-Handelman-Shen theorem, we finally show that the bases of any finitely presented unital $\ell$-group $(G,u)$ provide a direct system of simplicial groups with 1-1 positive unital homomorphisms, whose limit is $(G,u)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Leonardo Cabrer, Daniele Mundici. 2010-06-21. Finitely presented lattice-ordered abelian groups with order-unit. https://arxiv.org/abs/1006.4188

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