Finite factorization is detected by undermonoids
Yutong Zhang, Yaoran Yang

TL;DR
This paper proves that in cancellative commutative monoids, the finite factorization property is equivalent for all submonoids and undermonoids, confirming a conjecture by Gotti and Li.
Contribution
It establishes that the finite factorization property is hereditary from undermonoids to all submonoids in cancellative commutative monoids.
Findings
Every submonoid of a cancellative commutative monoid is an FFM if and only if every undermonoid is an FFM.
The proof uses fixed length factorizations and ideal enlargements to derive a contradiction.
The result confirms that finite factorization is a hereditary property in this context.
Abstract
Let be a cancellative commutative monoid and call a submonoid of an undermonoid if inside the Grothendieck group of . Gotti and Li asked whether the finite factorization property is hereditary once it is known on all undermonoids: if every undermonoid of is a finite factorization monoid, must every submonoid of be a finite factorization monoid? We give an affirmative answer. Equivalently, for every cancellative commutative monoid , the following two conditions coincide: every submonoid of is an FFM, and every undermonoid of is an FFM. The proof isolates a fixed length and an infinite set of length- factorizations of one element . In the non-group case, a divisor-complement ideal enlarges the bad submonoid to a bad undermonoid while preserving the chosen length- factorizations. In the group…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
