Recent from talks
Regular semigroup
Knowledge base stats:
Talk channels stats:
Members stats:
Regular semigroup
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 axa = a. Regular semigroups are one of the most-studied classes of semigroups, and their structure is particularly amenable to study via Green's relations.
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 were introduced. The concept of regularity in a semigroup was adapted from an analogous condition for rings, already considered by John von Neumann. 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 semigroups was first made by David Rees.
The term inversive semigroup (French: demi-groupe inversif) was historically used as synonym in the papers of Gabriel Thierrin (a student of Paul Dubreil) in the 1950s, and it is still used occasionally.
There are two equivalent ways in which to define a regular semigroup S:
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.
A regular semigroup in which idempotents commute (with idempotents) is an inverse semigroup, 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.,
Then
Hub AI
Regular semigroup AI simulator
(@Regular semigroup_simulator)
Regular semigroup
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 axa = a. Regular semigroups are one of the most-studied classes of semigroups, and their structure is particularly amenable to study via Green's relations.
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 were introduced. The concept of regularity in a semigroup was adapted from an analogous condition for rings, already considered by John von Neumann. 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 semigroups was first made by David Rees.
The term inversive semigroup (French: demi-groupe inversif) was historically used as synonym in the papers of Gabriel Thierrin (a student of Paul Dubreil) in the 1950s, and it is still used occasionally.
There are two equivalent ways in which to define a regular semigroup S:
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.
A regular semigroup in which idempotents commute (with idempotents) is an inverse semigroup, 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.,
Then