SearcharxivSearch

arXiv · 2209.01915

Coherency for monoids and purity for their acts

Abstract

This article examines the three-way relationship between right coherency of a monoid $S$, solutions of equations over $S$-acts, and injectivity properties of $S$-acts. A monoid $S$ is right coherent if every finitely generated subact of every finitely presented (right) $S$-act itself has a finite presentation. Purity properties of an $S$-act $A$ may either be expressed in terms of solutions in $A$ of certain consistent sets of equations over $A$, or in terms of injectivity properties. For example, an $S$-act $A$ is absolutely pure (almost pure) if every finite consistent set of equations over $A$ (in one variable) has a solution in $A$. Equivalently, $A$ is absolutely pure (almost pure) if it is injective with respect to inclusions of finitely generated subacts into finitely presented (monogenic finitely presented) $S$-acts. Our first main result shows that for a right coherent monoid $S$ the classes of almost pure and absolutely pure $S$-acts coincide. Our second main result is that a monoid $S$ is right coherent if and only if the classes of mfp-pure and absolutely pure $S$-acts coincide: an $S$-act is mfp-pure if it is injective with respect to inclusions of finitely presented subacts into monogenic finitely presented $S$-acts. We give specific examples of monoids $S$ that are not right coherent yet are such that the classes of almost pure and absolutely pure $S$-acts coincide. Finally we give a condition on a monoid $S$ for all almost pure $S$-acts to be absolutely pure in terms of finitely presented $S$-acts, their finitely generated subacts, and certain canonical extensions.

Explore related subjects

Keep this discovery

BibTeXRIS

Yang Dandan, Victoria Gould. 2022-09-05. Coherency for monoids and purity for their acts. https://arxiv.org/abs/2209.01915

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