A semigroup is finite if and only if it is chain-finite and antichain-finite
Iryna Banakh, Taras Banakh, Serhii Bardyla

TL;DR
This paper characterizes finite semigroups as those that are both chain-finite and antichain-finite, establishing new properties of antichain-finite semigroups and providing a counterexample involving semilattices.
Contribution
It proves that antichain-finite semigroups are periodic with finite roots of idempotents and characterizes finiteness via chain- and antichain-finiteness, including a counterexample.
Findings
Antichain-finite semigroups are periodic.
For each idempotent, the set of roots is finite.
A semigroup is finite iff it is both chain- and antichain-finite.
Abstract
A subset of a semigroup is called a () if () for any (distinct) elements . A semigroup is called ()- if contains no infinite (anti)chains. We prove that each antichain-finite semigroup is periodic and for every idempotent of the set is finite. This property of antichain-finite semigroups is used to prove that a semigroup is finite if and only if it is chain-finite and antichain-finite. Also we present an example of an antichain-finite semilattice that is not a union of finitely many chains.
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.
