HOME

TheInfoList



OR:

In mathematics, a regular semigroup is a
semigroup In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively: ''x''·''y'', or simply ''xy'', ...
''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, Green's relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of 1951 ...
.


History

Regular semigroups were introduced by J. A. Green in his influential 1951 paper "On the structure of semigroups"; this was also the paper in which
Green's relations In mathematics, Green's relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of 1951 ...
were introduced. The concept of ''regularity'' in a semigroup was adapted from an analogous condition for rings, already considered by
John von Neumann John von Neumann (; hu, Neumann János Lajos, ; December 28, 1903 – February 8, 1957) was a Hungarian-American mathematician, physicist, computer scientist, engineer and polymath. He was regarded as having perhaps the widest c ...
. It was Green's study of regular semigroups which led him to define his celebrated relations. According to a footnote in Green 1951, the suggestion that the notion of regularity be applied to
semigroup In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively: ''x''·''y'', or simply ''xy'', ...
s was first made by
David Rees David or Dai Rees may refer to: Entertainment * David Rees (author) (1936–1993), British children's author * Dave Rees (born 1969), American drummer for SNFU and Wheat Chiefs * David Rees (cartoonist) (born 1972), American cartoonist and televis ...
. The term inversive semigroup (French: demi-groupe inversif) was historically used as synonym in the papers of
Gabriel Thierrin In Abrahamic religions ( Judaism, Christianity and Islam), Gabriel (); Greek: grc, Γαβριήλ, translit=Gabriḗl, label=none; Latin: ''Gabriel''; Coptic: cop, Ⲅⲁⲃⲣⲓⲏⲗ, translit=Gabriêl, label=none; Amharic: am, ገብ ...
(a student of Paul Dubreil) in the 1950s, and it is still used occasionally.


The basics

There are two equivalent ways in which to define a regular semigroup ''S'': :(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 In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively: ''x''·''y'', or simply ''xy'', ...
''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 Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
: ''abab'' = ''ab'', since ''aba'' = ''a''.


Examples of regular semigroups

*Every group is a regular semigroup. *Every band (idempotent semigroup) is regular in the sense of this article, though this is not what is meant by a regular band. *The
bicyclic semigroup In mathematics, the bicyclic semigroup is an algebraic object important for the structure theory of semigroups. Although it is in fact a monoid, it is usually referred to as simply a semigroup. It is perhaps most easily understood as the syntactic ...
is regular. *Any full transformation semigroup is regular. *A Rees matrix semigroup is regular. * The homomorphic image of a regular semigroup is regular.


Unique inverses and unique pseudoinverses

A regular semigroup in which idempotents commute (with idempotents) is an
inverse semigroup In group theory, an inverse semigroup (occasionally called an inversion semigroup) ''S'' is a semigroup in which every element ''x'' in ''S'' has a unique ''inverse'' ''y'' in ''S'' in the sense that ''x = xyx'' and ''y = yxy'', i.e. a regular semig ...
, or equivalently, every element has a ''unique'' inverse. To see this, let ''S'' be a regular semigroup in which idempotents commute. Then every element of ''S'' has at least one inverse. Suppose that ''a'' in ''S'' has two inverses ''b'' and ''c'', i.e., :''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 In group theory, an inverse semigroup (occasionally called an inversion semigroup) ''S'' is a semigroup in which every element ''x'' in ''S'' has a unique ''inverse'' ''y'' in ''S'' in the sense that ''x = xyx'' and ''y = yxy'', i.e. a regular semig ...
is a regular semigroup in which idempotents commute. Theorem 5.1.1 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.


Green's relations

Recall that the
principal ideal In mathematics, specifically ring theory, a principal ideal is an ideal I in a ring R that is generated by a single element a of R through multiplication by every element of R. The term also has another, similar meaning in order theory, where ...
s 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
ideal Ideal may refer to: Philosophy * Ideal (ethics), values that one actively pursues as goals * Platonic ideal, a philosophical idea of trueness of form, associated with Plato Mathematics * Ideal (ring theory), special subsets of a ring considered ...
s 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 In mathematics, Green's relations are five equivalence relations that characterise the elements of a semigroup in terms of the principal ideals they generate. The relations are named for James Alexander Green, who introduced them in a paper of 1951 ...
can therefore be redefined for regular semigroups as follows: :a\,\mathcal\,b if, and only if, ''Sa'' = ''Sb''; :a\,\mathcal\,b if, and only if, ''aS'' = ''bS''; :a\,\mathcal\,b if, and only if, ''SaS'' = ''SbS''. In a regular semigroup ''S'', every \mathcal- and \mathcal-class contains at least one
idempotent Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
. If ''a'' is any element of ''S'' and ''a''' is any inverse for ''a'', then ''a'' is \mathcal-related to ''a'a'' and \mathcal-related to ''aa'''. 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\,b iff there exist ''a''' in ''V''(''a'') and ''b''' in ''V''(''b'') such that ''a'a'' = ''b'b''; *a\,\mathcal\,b iff there exist ''a''' in ''V''(''a'') and ''b''' in ''V''(''b'') such that ''aa''' = ''bb''', *a\,\mathcal\,b iff there exist ''a''' in ''V''(''a'') and ''b''' in ''V''(''b'') such that ''a'a'' = ''b'b'' and ''aa''' = ''bb'''. If ''S'' is an
inverse semigroup In group theory, an inverse semigroup (occasionally called an inversion semigroup) ''S'' is a semigroup in which every element ''x'' in ''S'' has a unique ''inverse'' ''y'' in ''S'' in the sense that ''x = xyx'' and ''y = yxy'', i.e. a regular semig ...
, then the idempotent in each \mathcal- and \mathcal-class is unique.


Special classes of regular semigroups

Some special classes of regular semigroups are: *''Locally inverse semigroups'': a regular semigroup ''S'' is locally inverse if ''eSe'' is an inverse semigroup, for each
idempotent Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
''e''. *'' Orthodox semigroups'': a regular semigroup ''S'' is orthodox if its subset of
idempotent Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
s forms a subsemigroup. *''Generalised inverse semigroups'': a regular semigroup ''S'' is called a generalised inverse semigroup if its
idempotent Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
s form a normal band, i.e., for all
idempotent Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
s ''x'', ''y'', ''z''. The
class Class or The Class may refer to: Common uses not otherwise categorized * Class (biology), a taxonomic rank * Class (knowledge representation), a collection of individuals or objects * Class (philosophy), an analytical concept used differently ...
of generalised inverse semigroups is the
intersection In mathematics, the intersection of two or more objects is another object consisting of everything that is contained in all of the objects simultaneously. For example, in Euclidean geometry, when two lines in a plane are not parallel, thei ...
of the class of locally inverse semigroups and the class of orthodox semigroups. p. 222 All inverse semigroups are orthodox and locally inverse. The converse statements do not hold.


Generalizations

*
eventually regular semigroup In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists ...
* ''E''-dense (aka ''E''-inversive) semigroup


See also

*
Biordered set A biordered set (otherwise known as boset) is a mathematical object that occurs in the description of the structure of the set of idempotents in a semigroup. The set of idempotents in a semigroup is a biordered set and every biordered set is the ...
*
Special classes of semigroups In mathematics, a semigroup is a nonempty set together with an associative binary operation. A special class of semigroups is a class of semigroups satisfying additional properties or conditions. Thus the class of commutative semigroups consists ...
*
Nambooripad order In mathematics, Nambooripad order (also called Nambooripad's partial order) is a certain natural partial order on a regular semigroup discovered by K S S Nambooripad in late seventies. Since the same partial order was also independently discove ...
*
Generalized inverse In mathematics, and in particular, algebra, a generalized inverse (or, g-inverse) of an element ''x'' is an element ''y'' that has some properties of an inverse element but not necessarily all of them. The purpose of constructing a generalized in ...


References


Sources

* * *M. Kilp, U. Knauer, A.V. Mikhalev, ''Monoids, Acts and Categories with Applications to Wreath Products and Graphs'', De Gruyter Expositions in Mathematics vol. 29, Walter de Gruyter, 2000, . * *J. M. Howie, Semigroups, past, present and future, ''Proceedings of the International Conference on Algebra and Its Applications'', 2002, 6–20. *{{cite journal , author=J. von Neumann , title=On regular rings , journal=Proceedings of the National Academy of Sciences of the USA , year=1936 , volume=22 , pages=707–713 , doi=10.1073/pnas.22.12.707 , pmid=16577757 , issue=12 , pmc=1076849, bibcode=1936PNAS...22..707V , doi-access=free Semigroup theory Algebraic structures