The category of factorization

From MaRDI portal




Abstract: We introduce and investigate the category of factorization of a multiplicative, commutative, cancellative, pre-ordered monoid A, which we denote mathcalF(A). The objects of mathcalF(A) are factorizations of elements of A, and the morphisms in mathcalF(A) encode combinatorial similarities and differences between the factorizations. We pay particular attention to the divisibility pre-order and to the monoid A=Dsetminus0 where D is an integral domain. Among other results, we show that mathcalF(A) is a symmetric and strict monoidal category with weak equivalences and compute the associated category of fractions obtained by inverting the weak equivalences. Also, we use this construction to characterize various factorization properties of integral domains: atomicity, unique factorization, and so on.









This page was built for publication: The category of factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831315)