Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite

View through CrossRef
A subset A of a semigroup S is called a chain (antichain) if ab∈{a,b} (ab∉{a,b}) for any (distinct) elements a,b∈A. A semigroup S is called periodic if for every element x∈S there exists n∈N such that xn is an idempotent. A semigroup S is called (anti)chain-finite if S contains no infinite (anti)chains. We prove that each antichain-finite semigroup S is periodic and for every idempotent e of S the set e∞={x∈S:∃n∈N(xn=e)} 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. Furthermore, we present an example of an antichain-finite semilattice that is not a union of finitely many chains.
Title: A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite
Description:
A subset A of a semigroup S is called a chain (antichain) if ab∈{a,b} (ab∉{a,b}) for any (distinct) elements a,b∈A.
A semigroup S is called periodic if for every element x∈S there exists n∈N such that xn is an idempotent.
A semigroup S is called (anti)chain-finite if S contains no infinite (anti)chains.
We prove that each antichain-finite semigroup S is periodic and for every idempotent e of S the set e∞={x∈S:∃n∈N(xn=e)} 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.
Furthermore, we present an example of an antichain-finite semilattice that is not a union of finitely many chains.

Related Results

Order-preserving generalized transformation semigroups
Order-preserving generalized transformation semigroups
For a set X, let P(X), T(X) and I(X) denote respectively the partial transformation semigroup on X, the full transformation semigroup on X and the 1-1 partial transformation semigr...
Semiprimeness of semigroup algebras
Semiprimeness of semigroup algebras
AbstractAbundant semigroups originate from p.p. rings and are generalizations of regular semigroups. The main aim of this paper is to study the primeness and the primitivity of abu...
The honest embedding dimension of a numerical semigroup
The honest embedding dimension of a numerical semigroup
Abstract To a curve germ in d -space we can associate a numerical semigroup called its value semigrou...
IDEAL PROJECTIONS AND FORCING PROJECTIONS
IDEAL PROJECTIONS AND FORCING PROJECTIONS
AbstractIt is well known that saturation of ideals is closely related to the “antichain-catching” phenomenon from Foreman–Magidor–Shelah [10]. We consider several antichain-catchin...
Partial orders in regular semigroups
Partial orders in regular semigroups
First we have obtained equivalent conditions for a regular semigroup and is equivalent to N = N1 It is observed that every regular semigroup is weakly separative and C ⊆ S and on a...
Regular elements and the BQ - Property of transformation semigroups and rings of linear transformations
Regular elements and the BQ - Property of transformation semigroups and rings of linear transformations
An element x of a semigroup [ring] A is said to regular if there is an element y of A such that x = xyx, and A is called a regular semigroup [(Von Neumann) regular ring] if every e...
RESULTS ON GREEN'S RELATIONS OF ORDER PRESERVING STAR-LIKE FULL TRANSFORMATION SEMIGROUP
RESULTS ON GREEN'S RELATIONS OF ORDER PRESERVING STAR-LIKE FULL TRANSFORMATION SEMIGROUP
T α ω n ∗ is the star - like transformation semigroup of the finite set X n . Basic extraction of elements were done using | X n + 1 − λ X n | ≤ | X n − λ X n + 1 | from Full Trans...
Enhancing supply chain performance through supply chain practices
Enhancing supply chain performance through supply chain practices
Background: The recognised relationship between company performance and supply chain performance has prompted managers, practitioners and researchers alike to seek a better underst...

Back to Top