Finite factorization is detected by undermonoids
Pith reviewed 2026-05-21 01:59 UTC · model grok-4.3
The pith
For every cancellative commutative monoid, every submonoid is a finite factorization monoid if and only if every undermonoid is.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
For a cancellative commutative monoid M, the conditions that every submonoid is an FFM and that every undermonoid is an FFM are equivalent. The proof isolates a fixed length ell and an infinite set of length-ell factorizations of one element b. In the non-group case a divisor-complement ideal I = {m in M : m does not divide b} enlarges the bad submonoid to a bad undermonoid while preserving the factorizations. In the group case a maximality argument is combined with the two-sided perturbation S maps to S + N0(2b + u) that creates no new units and does not split atoms, yielding an undermonoid with infinitely many factorizations of b.
What carries the argument
Divisor-complement ideal or two-sided perturbation that enlarges a submonoid with infinite factorizations into an undermonoid with the same infinite factorizations of a fixed element b.
Load-bearing premise
The enlargement of the bad submonoid via the divisor-complement ideal or the perturbation preserves the chosen infinite set of length-ell factorizations without introducing new units or splitting atoms.
What would settle it
Finding a cancellative commutative monoid M together with a submonoid S that is not an FFM while every undermonoid of M is an FFM.
read the original abstract
Let $M$ be a cancellative commutative monoid and call a submonoid $S$ of $M$ an undermonoid if $\G(S)=\G(M)$ inside the Grothendieck group of $M$. Gotti and Li asked whether the finite factorization property is hereditary once it is known on all undermonoids: if every undermonoid of $M$ is a finite factorization monoid, must every submonoid of $M$ be a finite factorization monoid? We give an affirmative answer. Equivalently, for every cancellative commutative monoid $M$, the following two conditions coincide: every submonoid of $M$ is an FFM, and every undermonoid of $M$ is an FFM. The proof isolates a fixed length $\ell$ and an infinite set of length-$\ell$ factorizations of one element $b$. In the non-group case, a divisor-complement ideal $I=\{m\in M:m\nmid_M b\}$ enlarges the bad submonoid to a bad undermonoid while preserving the chosen length-$\ell$ factorizations. In the group case, a maximality argument over submonoids for which these factorizations survive is combined with a two-sided perturbation $S\mapsto S+\Nzero(2b+u)$. The key point is that the perturbation creates no new units and does not split any atom occurring in the fixed factorizations. This yields an undermonoid with infinitely many factorizations of $b$, contradicting the hypothesis.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proves that for a cancellative commutative monoid M, every submonoid is a finite factorization monoid (FFM) if and only if every undermonoid is an FFM, where an undermonoid S satisfies G(S)=G(M) in the Grothendieck group of M. This affirmatively resolves a question of Gotti and Li by constructing, from any bad submonoid with infinitely many length-ℓ factorizations of an element b, a corresponding bad undermonoid. The non-group case enlarges via the divisor-complement ideal I={m∈M : m∤_M b}; the group case combines a maximality argument on factorization-preserving submonoids with the two-sided perturbation S↦S+ℕ₀(2b+u).
Significance. The result shows that the finite factorization property is detected precisely by the undermonoids. The argument is a direct, parameter-free construction from the definitions of cancellative commutative monoids, Grothendieck groups, and finite factorization; it explicitly verifies that the perturbation creates no new units and does not split the relevant atoms, with no reduction to previously fitted quantities or circularity.
minor comments (2)
- [§2] §2 (non-group case): the claim that I enlarges any bad submonoid to a bad undermonoid while preserving the chosen length-ℓ factorizations of b is central; a brief verification that G(I∪S)=G(M) holds under the standing cancellativity assumption would strengthen the exposition.
- [Abstract] Abstract and §3 (group case): the notation ℕ₀(2b+u) is clear in context but would benefit from an explicit sentence confirming it denotes the submonoid generated by 2b+u.
Simulated Author's Rebuttal
We thank the referee for the careful and positive assessment of the manuscript, including the accurate summary of the main result and the recommendation for minor revision. No specific major comments were raised in the report.
Circularity Check
No significant circularity
full rationale
The paper's proof proceeds by direct construction from the definitions of cancellative commutative monoids, Grothendieck groups, and finite factorization monoids. It isolates a fixed length ℓ with infinitely many factorizations of an element b, then applies the divisor-complement ideal I = {m ∈ M : m ∤_M b} in the non-group case to enlarge a bad submonoid to an undermonoid while preserving those factorizations, and uses a maximality argument plus the perturbation S ↦ S + ℕ₀(2b + u) in the group case, verifying no new units or split atoms. These steps rely only on cancellativity and commutativity with no reduction to fitted inputs, self-citations, or ansatzes; the derivation is self-contained against the stated assumptions.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption M is a cancellative commutative monoid
Reference graph
Works this paper leans on
-
[1]
D.D. Anderson, D.F. Anderson and M. Zafrullah, Factorization in integral domains,J. Pure Appl. Algebra69(1) (1990), 1–19. https://doi.org/10.1016/0022-4049(90)90074-R
-
[2]
D.D. Anderson, D.F. Anderson and M. Zafrullah, Rings betweenD[X] andK[X], Houston J. Math.17(1) (1991), 109–129
work page 1991
-
[3]
Cohn, Bezout rings and their subrings,Proc
P.M. Cohn, Bezout rings and their subrings,Proc. Cambridge Philos. Soc.64(2) (1968), 251–264. https://doi.org/10.1017/S0305004100042791
-
[4]
J. Coykendall, F. Gotti and R.E. Hasenauer, Hereditary atomicity in integral domains,J. Pure Appl. Algebra227(4) (2023), Article 107249. https://doi.org/10.1016/j.jpaa.2022.107249
-
[5]
J. Coykendall and W.W. Smith, On unique factorization domains,J. Algebra 332(1) (2011), 62–70. https://doi.org/10.1016/j.jalgebra.2010.10.024
-
[6]
A. Geroldinger and F. Halter-Koch,Non-Unique Factorizations: Algebraic, Com- binatorial and Analytic Theory, Pure and Applied Mathematics, vol. 278, Chap- man & Hall/CRC, Boca Raton, 2006. https://doi.org/10.1201/9781420003208
-
[7]
F. Gotti and B. Li, Arithmetic properties encoded in undermonoids,Semigroup Forum112(2026), 427–449. https://doi.org/10.1007/s00233-025-10578-3 20
-
[8]
F. Gotti and M. Zafrullah, Integral domains and the IDF property,J. Algebra 614(2023), 564–591. https://doi.org/10.1016/j.jalgebra.2022.08.034
-
[9]
Grams, Atomic rings and the ascending chain condition for prin- cipal ideals,Proc
A. Grams, Atomic rings and the ascending chain condition for prin- cipal ideals,Proc. Cambridge Philos. Soc.75(3) (1974), 321–329. https://doi.org/10.1017/S0305004100048532
-
[10]
Grillet,Commutative Semigroups, Advances in Mathematics, vol
P.A. Grillet,Commutative Semigroups, Advances in Mathematics, vol. 2, Kluwer Academic Publishers, Dordrecht, 2001. https://doi.org/10.1007/978-1-4757-3389- 1
-
[11]
Halter-Koch, Finiteness theorems for factorizations,Semigroup Forum44 (1992), 112–117
F. Halter-Koch, Finiteness theorems for factorizations,Semigroup Forum44 (1992), 112–117. https://doi.org/10.1007/BF02574329
-
[12]
F. Gotti and J. Vulakh, On the atomic structure of torsion-free monoids,Semi- group Forum107(2023), 402–423. https://doi.org/10.1007/s00233-023-10385-8
-
[13]
Zaks, Half factorial domains,Bull
A. Zaks, Half factorial domains,Bull. Amer. Math. Soc.82(5) (1976), 721–723. https://doi.org/10.1090/S0002-9904-1976-14130-4 21
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.