Regular semigroup
≈ 4 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, a regular semigroup is a semigroup S in which every element is regular, i.e., for each element a in S there exists an element x in S such that . Regular semigroups are one of the most-studied classes of semigroups, and their structure is particularly amenable to study via Green's relations.
In mathematics, a regular semigroup is a semigroup S in which every element is regular, i.e., for each element a in S there exists an element x in S such that . Regular semigroups are one of the most-studied classes of semigroups, and their structure is particularly amenable to study via Green's relations. (1) for each a in S, there is an x in S, which is called a pseudoinverse, with axa = a; (2) every element a has at least one inverse b, in the sense that aba = a and bab = b. To see the equivalence of these definitions, first suppose that S is defined by (2). Then b serves as the required x in (1). Conversely, if S is defined by (1), then xax is an inverse for a, since a(xax)a = axa(xa) = axa = a and (xax)a(xax) = x(axa)(xax) = xa(xax) = x(axa)x = xax. The set of inverses (in the above sense) of an element a in an arbitrary semigroup S is denoted by V(a). Thus, another way of expressing definition (2) above is to say that in a regular semigroup, V(a) is nonempty, for every a in S. The product of any element a with any b in V(a) is always idempotent: abab = ab, since aba = a. aba = a, bab = b, aca = a and cac = c. Also ab, ba, ac and ca are idempotents as above. Then b = bab = b(aca)b = bac(a)b = bac(aca)b = bac(ac)(ab) = bac(ab)(ac) = ba(ca)bac = ca(ba)bac = c(aba)bac = cabac = cac = c. So, by commuting the pairs of idempotents ab & ac and ba & ca, the inverse of a is shown to be unique. Conversely, it can be shown that any inverse semigroup is a regular semigroup in which idempotents commute. The existence of a unique pseudoinverse implies the existence of a unique inverse, but the opposite is not true. For example, in the symmetric inverse semigroup, the empty transformation Ø does not have a unique pseudoinverse, because Ø = ØfØ for any transformation f. The inverse of Ø is unique however, because only one f satisfies the additional constraint that f = fØf, namely f = Ø. This remark holds more generally in any semigroup with zero. Furthermore, if every element has a unique pseudoinverse, then the semigroup is a group, and the unique pseudoinverse of an element coincides with the group inverse. Recall that the principal ideals of a semigroup S are defined in terms of S 1 , the semigroup with identity adjoined; this is to ensure that an element a belongs to the principal right, left and two-sided ideals which it generates. In a regular semigroup S, however, an element a = axa automatically belongs to these ideals, without recourse to adjoining an identity. Green's relations can therefore be redefined for regular semigroups as follows: a\,\mathcal{L}\,b if, and only if, Sa = Sb; a\,\mathcal{R}\,b if, and only if, aS = bS; a\,\mathcal{J}\,b if, and only if, SaS = SbS. In a regular semigroup S, every \mathcal{L} - and \mathcal{R} -class contains at least one idempotent. If a is any element of S and is any inverse for a, then a is \mathcal{L} -related to a and \mathcal{R} -related to a . Theorem. Let S be a regular semigroup; let a and b be elements of S, and let V(x) denote the set of inverses of x in S. Then a\,\mathcal{L}\,b iff there exist in V(a) and in V(b) such that a = b; a\,\mathcal{R}\,b iff there exist in V(a) and in V(b) such that a = b , a\,\mathcal{H}\,b iff there exist in V(a) and in V(b) such that a = b and a = b . If S is an inverse semigroup, then the idempotent in each \mathcal{L} - and \mathcal{R} -class is unique.
Generalizations
eventually regular semigroup E-dense (aka E-inversive) semigroup
Text derived from https://en.wikipedia.org/w/index.php?oldid=1364673969 under CC BY-SA 4.0; modifications have been made.