REVIEW 1 major objections 6 minor 1 cited by
The Category of Atomic Monoids: Universal Constructions and Arithmetic Properties
T0 review · 1 major / 6 minor · reviewed 2026-08-08 · deepseek-v4-flash
Pith's one-line read A category of atomic monoids has all limits and colimits, with explicit product and coproduct constructions.
desk verdict Clean, useful category-theoretic toolkit for atomic monoids; completeness/cocompleteness and length-set formulas hold up, with one small omitted verification in the coequalizer proof that is easy to fill. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The machinery that carries the argument is a pair of explicit monoid constructions plus their unit and atom characterizations. For coproducts, the free product $C_H$ of the family, built from reduced words over the disjoint union of the factors, has units exactly the words whose letters are all units and atoms exactly the unit-conjugated single atoms of one factor (Lemmas 4.4 and 4.5). For products, the monoid $P_H$ generated inside the direct product by the all-units tuples $U_H$ and the all-atoms tuples $A_H$ has units exactly $U_H$ and atoms exactly $A_H$ (Lemma 5.3). These characterizations do the work: they show the constructed monoids are atomic, that the structural maps preserve atoms, and that factorizations in the constructions reduce to factorizations in the factors, which yields the length-set formulas.
What would settle it
Test the coequalizer claim by searching finite atomic monoids for a pair of atom-preserving homomorphisms whose coequalizer quotient in the category of all monoids is not atomic; the pair from the free monoid on one generator to the free monoid on two generators sending the generator to two different generators yields an atomic quotient, and any pair yielding a non-atomic quotient would refute Proposition 6.1 and Theorem 6.3.
Extended reading notes
Core claim
On the paper's own terms, the central discovery is that the natural categorical framework for atomicity is well behaved: AtoMon has all limits and all colimits. Coproducts are the usual free products (Theorem 4.6), and every colimit is computed as in the category of all monoids (Theorem 6.3). Products, however, are not direct products: the product of a family is the submonoid of the direct product generated by tuples that are all units or all atoms (Theorem 5.4), and equalizers are submonoids generated by the atoms and units on which two maps agree (Proposition 6.4). Along the way the paper characterizes the units and atoms of the free product and of this product submonoid, and derives arithmetic consequences: the length set of an element in a product is the intersection of the length sets of its components (Proposition 5.6), the system of length sets of a product is the componentwise intersection of the factors' systems (Theorem 5.7), and the non-zero length sets of a coproduct are exactly finite sums of factor length sets indexed by words with no redundant repetitions (Theorem 4.10).
Load-bearing premise
The proof of cocompleteness depends on the assertion, made without proof, that in the quotient used to build coequalizers a non-unit that was a product of several atoms cannot become a single atom; if that assertion is wrong, atomicity of the coequalizer fails and the cocompleteness theorem collapses.
Editorial extensions
If this is right
- Every diagram of atomic monoids has a limit and a colimit; colimits are the same as in the category of all monoids, so free products and quotients of atomic monoids by congruence pairs remain atomic.
- The coproduct of any family of atomic monoids is the free product, so one can combine atomic monoids without changing the colimit behavior familiar from the larger category of monoids.
- The product construction gives a way to form new atomic monoids whose length sets are intersections of given systems of length sets, making systems of length sets a resource that can be combined componentwise.
- The union-of-length-sets invariant $U_k$ of a coproduct is computed from the factors' $U_k$ by summing over index words, which gives a recursive handle on unions of length sets.
- The atom functor from AtoMon to sets is left adjoint to the free-monoid functor, yet it does not preserve coproducts, so it has no right adjoint.
Reading between the lines
- These constructions could be used to attack realizability questions for systems of length sets, since the product and coproduct formulas turn the problem of engineering a monoid with a given system into a problem about intersections and finite sums of numerical sets.
- The fact that products differ from direct products while coproducts agree with free products suggests a duality: colimits respect atomicity automatically, while limits require an explicit repair; this asymmetry may be worth testing on other categories defined by a closure property of the same kind.
- One testable extension is to replace atoms by irreducibles in the sense of factorable monoids, as the paper itself proposes; the same limit and colimit questions would determine whether the categorical behavior found here is a special feature of atomicity or a general phenomenon.
- The terminal object, a three-element monoid, is a stripped-down atom detector; using it as a target, any atomic monoid has a canonical morphism, so the paper's constructions could be used to classify atomic monoids by how their non-atom elements multiply.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces AtoMon, the category of atomic monoids with atom-preserving homomorphisms, and studies its categorical structure. The main results are: explicit constructions of products (Theorem 5.4) as the submonoid of the direct product generated by tuples that are either all units or all atoms, and coproducts (Theorem 4.6) as free products; existence of equalizers (Proposition 6.4) and coequalizers (Proposition 6.1), leading to completeness (Theorem 6.6) and cocompleteness (Theorem 6.3); and formulas for length sets and systems of length sets of products and coproducts (Theorems 4.10, 4.11, 5.6, 5.7, 5.8). The paper also establishes an adjunction between the atom functor and the free monoid functor (Proposition 3.4) and shows that acyclicity, unit-cancellativity, and cancellativity are preserved under the product and coproduct constructions (Propositions 4.8 and 5.5).
Significance. The paper offers a new and coherent categorical framework for atomic monoids, with explicit descriptions of all limits and colimits that are genuinely new. The length-set formulas, especially Theorem 5.7 expressing the system of length sets of a product as the intersection of the factor systems, are concrete and potentially applicable to realization problems in factorization theory. The proofs are largely detailed and self-contained, and the authors correctly emphasize that AtoMon is not a full subcategory of Mon. The reliance on [18, Lemma 2.2] for Dedekind-finiteness of atomic monoids is an established background result and does not create circularity. Overall, if the missing verification in Proposition 6.1 is supplied, the paper makes a solid contribution.
major comments (1)
- [Proposition 6.1] In the coequalizer proof, the assertion "it is immediate to check that if x is a non-unit, non-atom of K, then [x] is not an atom in Q" is load-bearing and is not proven. The claim is needed not only to show that Q is atomic but also to establish the universal property: the induced homomorphism ψ: Q → M must be atom-preserving, so every atom of Q must be the class of an atom of K. The missing argument is short: since K is atomic, write x = a_1 ... a_n with n ≥ 2 and a_i ∈ A(K); then [x] = [a_1] [a_2 ... a_n] in Q, and by the unit characterization already established, [a_1] and [a_2 ... a_n] are non-units of Q (a product of atoms of K is a non-unit, and units of Q are exactly the classes of units of K). Hence [x] is a product of two non-units and is not an atom. The authors should include this verification.
minor comments (6)
- [Proposition 6.5] In the definition of U_P, the condition "f(x) = g(x)" should read "f(x) = g(y)".
- [Theorem 5.8] The statement ends with "for every i ∈ I", which is extraneous; the equality is between U_k(P_H) and the intersection over all i ∈ I of U_k(H_i).
- [Theorem 4.10] In the proof, the claim that the index word i = i_{j_1} * ... * i_{j_m} belongs to Γ_H is dismissed as "trivial but tedious to check"; since Γ_H is the key combinatorial object in the formula, a brief justification of the three cases would improve readability.
- [Proposition 4.8] In part (3), the reduction to the case where the last letter of a is a non-unit is only indicated by reference to a similar argument in part (1); the cancellation step deserves a few explicit words.
- [Lemma 4.3] The display "B_1 * ... * B_n = B'_1 * ... * B'_ℓ" should refer to the reduced forms of the two words, not the original words themselves.
- [General] The manuscript contains numerous typographical/OCR artifacts (e.g., "/integerdivide", "/d47", and the split "CA TEGORY" in the abstract) that should be corrected in the final version.
Circularity Check
No significant circularity: the universal constructions and arithmetic formulas are derived self-contained, with only a minor non-circular self-citation for background and an unproved 'immediate' claim in the coequalizer proof.
full rationale
The derivation of the universal constructions in AtoMon is self-contained: products, coproducts, equalizers, pullbacks, and coequalizers are proven directly from the definitions, and the arithmetic formulas (Theorems 4.10, 5.7, 5.8) are derived from the explicit characterizations of atoms and length sets (Lemmas 4.5 and 5.3, Propositions 4.9 and 5.6), not assumed via the conclusions. The only self-citation is the background fact that atomic monoids are Dedekind-finite, quoted as [18, Lemma 2.2] from a paper with overlapping authorship; that lemma is independently published background, and the paper does not use it to define its target objects or to force the completeness/cocompleteness theorems. I also flag the unproved 'immediate to check' assertion in Proposition 6.1 that a non-unit non-atom of K cannot become an atom in the coequalizer Q; this is a genuine proof omission (repairable by writing x = uv with u, v non-units and using the established unit characterization of Q), but it is a gap in justification, not a circular reduction. No equation in the paper is equivalent to its own input by construction.
Assumptions & free parameters
assumptions (4)
- standard math Tarski-Grothendieck set theory as foundation
- domain assumption Atomic monoids are Dedekind-finite (Fan and Tringali [18, Lemma 2.2])
- domain assumption Normal form theorem for free products of monoids (Howie [26, Section 8.2])
- standard math Standard category theory: a category is complete iff it has products and equalizers, and cocomplete iff it has coproducts and coequalizers (Borceux [5])
Cite this review
Pith. "Pith review of The Category of Atomic Monoids: Universal Constructions and Arithmetic Properties." pith.science (2026). https://pith.science/paper/2JPJ7X3N
@misc{pith2026250206610,
author = {Pith},
title = {Pith review of: The Category of Atomic Monoids: Universal Constructions and Arithmetic Properties},
year = {2026},
howpublished = {\url{https://pith.science/paper/2JPJ7X3N}},
note = {Machine review of arXiv:2502.06610}
}
abstract
We introduce and investigate the category $\mathsf{AtoMon}$ of atomic monoids and atom-preserving monoid homomorphisms, which is a (non-full) subcategory of the usual category of monoids. In particular, we compute all limits and colimits, showing that $\mathsf{AtoMon}$ is a complete and cocomplete category. We also address certain arithmetic properties of products and coproducts, providing explicit formulas for some fundamental invariants associated with factorization lengths in atomic monoids.
Forward citations
Cited by 1 Pith paper
-
Categorical Algebra of Atomic Monoids: Presentability, Regularity, and Pretorsion Theories
The category of atomic monoids is locally finitely presentable, non-regular, with explicit adjunctions and a general pretorsion-lifting theorem.
Reference graph
Works this paper leans on
-
[1]
A. A. Antoniou and S. Tringali, On the arithmetic of power monoids and sumsets in cyclic grou ps, Pacific J. Math. 312 (2021), No. 2, 279–308
work page 2021
-
[2]
N. R. Baeth and D. Smertnig, Factorization theory: From commutative to noncommutative settings, J. Algebra 441 (2015), 475–551
work page 2015
-
[3]
J. P. Bell, K. Brown, Z. Nazemian, and D. Smertnig, On noncommutative bounded factorization domains and prime rings, J. Algebra 622 (2023), 404–449
work page 2023
-
[4]
J. P. Bell, A. Heinle, and V. Levandovskyy, On noncommutative finite factorization domains , Trans. Amer. Math. Soc. 369 (2017), 2675–2695
work page 2017
-
[5]
Borceux, Handbook of categorical algebra 1 , Cambridge University Press, 1994
F. Borceux, Handbook of categorical algebra 1 , Cambridge University Press, 1994
work page 1994
-
[6]
F. Campanini and A. Facchini, Factorizations of polynomials with integral non-negative coefficients , Semigroup Forum 99 (2018), 317–322
work page 2018
-
[7]
S. T. Chapman, J. Coykendall, F. Gotti, and W. W. Smith, Length-factoriality in commutative monoids and integral domains, J. Algebra 578 (2021), 186–212
work page 2021
-
[8]
Cossu, Some applications of a new approach to factorization in M
L. Cossu, Some applications of a new approach to factorization in M. Brešar et al. (eds.), Recent Progress in Ring and Factorization Theory, Springer Proceedings in Mathematic s & Statistics 477, 2025, to appear
work page 2025
Show all 29 references
-
[9]
Cossu and S
L. Cossu and S. Tringali, Abstract Factorization Theorems with Applications to Idemp otent Factorizations , Israel J. Math. 263 (2024), 349–395
2024
-
[10]
Cossu and S
L. Cossu and S. Tringali, Factorization under local finiteness conditions , J. Algebra 630 (Sep 2023), 128–161
2023
-
[11]
Cossu and S
L. Cossu and S. Tringali, On the finiteness of certain factorization invariants , Ark. Mat. 62 (2024), No. 2, 21–38
2024
-
[12]
Cossu and S
L. Cossu and S. Tringali, On factorization in power monoids , preprint
-
[13]
Coykendall and F
J. Coykendall and F. Gotti, On the atomicity of monoid algebras , J. Algebra 539 (2019), 138–151
2019
-
[14]
Coykendall and R
J. Coykendall and R. E. Hasenauer, Factorization in Prüfer domains , Glasg. Math. J. 60 (2018), no. 2, 401–409
2018
-
[15]
Facchini, Direct sum decomposition of modules, semilocal endomorphi sm rings, and Krull monoids , J
A. Facchini, Direct sum decomposition of modules, semilocal endomorphi sm rings, and Krull monoids , J. Algebra 256 (2002), 280–307
2002
-
[16]
Facchini, Semilocal Categories and Modules with Semilocal Endomorphi sm Rings , Progr
A. Facchini, Semilocal Categories and Modules with Semilocal Endomorphi sm Rings , Progr. Math. 331, Birkhäuser, 2019
2019
-
[17]
Facchini and R
A. Facchini and R. Wiegand, Direct-sum decomposition of modules with semilocal endomo rphism rings , J. Algebra 274 (2004), 689–707. 18 F. Campanini, L. Cossu , and S. Tringali
2004
-
[18]
Fan and S
Y. Fan and S. Tringali, Power monoids: a bridge between factorization theory and ar ithmetic combinatorics, J. Algebra 512 (2018), 252–294
2018
-
[19]
Geroldinger and F
A. Geroldinger and F. Gotti, On monoid algebras having every nonempty subset of N≥ 2 as a length set , preprint (arXiv:2404.11494)
-
[20]
Geroldinger and F
A. Geroldinger and F. Halter-Koch, Non-Unique Factorizations. Algebraic, Combinatorial and A nalytic Theory , Pure Appl. Math. 278, Chapman & Hall/CRC, 2006
2006
-
[21]
Geroldinger and Q
A. Geroldinger and Q. Zhong, Factorization theory in commutative monoids , Semigroup Forum 100 (2020), 22–51
2020
-
[22]
Geroldinger and Q
A. Geroldinger and Q. Zhong, A realization result for systems of sets of lengths , Israel J. Math. 247 (2022), 177–193
2022
-
[23]
Gotti, Puiseux monoids and transfer homomorphisms , J
F. Gotti, Puiseux monoids and transfer homomorphisms , J. Algebra 516 (2018), 95–114
2018
-
[24]
Gotti, Systems of sets of lengths of Puiseux monoids , J
F. Gotti, Systems of sets of lengths of Puiseux monoids , J. Pure Appl. Algebra 223 (2019), 1856–1868
2019
-
[25]
Gotti and B
F. Gotti and B. Li, Atomic semigroup rings and the ascending chain condition on principal ideals, Proc. Amer. Math. Soc. 151 (2023), 2291–2302
2023
-
[26]
J. M. Howie, Fundamentals of Semigroup Theory , London Mathematical Society Monographs, Vol. 12, Clarendon Press, Oxford University Press, New York, 1995
1995
-
[27]
Smertnig and J
D. Smertnig and J. Voight, Definite orders with locally free cancellation , Trans. London Math. Soc. 6 (2019), 53–86
2019
-
[28]
Tringali, An abstract factorization theorem and some applications , J
S. Tringali, An abstract factorization theorem and some applications , J. Algebra 602 (July 2022), 352–380
2022
-
[29]
Tringali, A characterisation of atomicity , Math
S. Tringali, A characterisation of atomicity , Math. Proc. Cambridge Phil. Soc. 175 (2023), No. 2, 459–465. (F. Campanini) Institut de Recherche en Mathématique et Phy sique, Université Catholique de Louv ain | Chemin du cyclotron 2, 1348 Louv ain-la-Neuve, Belgium Email addre...
2023
Reviewed August 8, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.