The Flat Cover Conjecture for Monoid Acts
Sean Cox

TL;DR
This paper proves the Flat Cover Conjecture for acts over right-reversible monoids under certain conditions, establishing cofibrant generation results and bounds on indecomposable flat acts, advancing monoid act theory.
Contribution
It demonstrates the Flat Cover Conjecture for right-reversible monoids with flat acts closed under stable Rees extensions and explores cofibrant generation implications.
Findings
Flat Cover Conjecture holds for right-reversible monoids.
Cofibrant generation of certain classes implies bounds on indecomposable flat acts.
Introduces a new characterization of cofibrant generation via 'almost everywhere' effectiveness.
Abstract
We prove that the Flat Cover Conjecture holds for the category of (right) acts over any right-reversible monoid , provided that the flat -acts are closed under stable Rees extensions. The argument shows that the class -Mono (-act monomorphisms with flat Rees quotient) is cofibrantly generated in such categories, answering a question of Bailey and Renshaw. But cofibrant generation of -Mono (-act monomorphisms with \emph{strongly} flat Rees quotient) appears much stronger, since we show it implies that there is a bound on the size of the indecomposable strongly flat acts. Similarly, cofibrant generation of (unitary monomorphisms with flat complement) implies a bound on the size of indecomposable flat acts. The key tool is a new characterization of cofibrant generation of a class of monomorphisms in terms of ``almost…
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.
Taxonomy
Topicssemigroups and automata theory · Computability, Logic, AI Algorithms · Logic, programming, and type systems
