Authors: Ya I Diasamidze Sh I Makharadze I Ya Diasamidze
Publish Date: 2008/09/03
Volume: 153, Issue: 4, Pages: 481-494
Abstract
As is known see 5 6 idempotent elements of semigroups play an important role in the investigation of semigroups themselves Moreover it is known that any semigroup can be isomorphically embedded into some semigroup of binary relations on some nonempty set X This has generated great interest in the investigation of idempotent binary relations Different authors used different approaches to study the construction of these elements and obtained different answers to the question under consideration see eg 1–3 7 8 In this work first we characterize the complete Xsemilattices of unions D for which there exist idempotent binary relations such that the set of all their cuts to the elements of D coincides with the given semilattice Then we give a description of the structure of these idempotent binary relations in the language of limiting elements of some subset of the semilattice D see Lemma 1 and Theorem 5 and show how we can find all idempotents of the complete group of binary relations B X D defined by the complete Xsemilattice of unions D see Theorem 6 and Corollary 4 Moreover with the help of chains of the semilattice D we give a rule for constructing the semigroups of idempotent elements of the semigroup B X D see Theorem 7 In Theorem 9 we give a description of the structure of all regular elements of the semigroup B X D
Keywords: