Abstract.
We prove that any primely generated refinement monoid M has separative cancellation, and even strong separative cancellation provided M has no nonzero idempotents. A form of multiplicative cancellation also holds: \( na\leq nb \) implies \( a\leq b \) for \( a,b \in M \) and \( n \in \{1,2,3,\ldots\} \). In addition, M is a semilattice in the sense that, given \( c_1,c_2 \in M \), there is an element \( d \in M \) such that \( c_1,c_2 \leq d \) and, for all \( a \in M, c_1,c_2 \leq a \) implies \( d \leq a \). Finally, we prove that any finitely generated refinement monoid is primely generated; in fact, this holds for any refinement monoid with a set of generators satisfying the descending chain condition.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Author information
Authors and Affiliations
Additional information
Received September 2, 1999; accepted in final form November 21, 2000.
Rights and permissions
About this article
Cite this article
Brookfield, G. Cancellation in primely generated refinement monoids. Algebra univers. 46, 343–371 (2001). https://doi.org/10.1007/PL00000350
Issue Date:
DOI: https://doi.org/10.1007/PL00000350