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. [1] Regular semigroups are one of the most-studied classes of semigroups, and their structure is particularly amenable to study via Green's relations. [2]
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. [3] 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, [4] [5] and it is still used occasionally. [6]
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. [8]
The set of inverses (in the above sense) of an element a in an arbitrary semigroup S is denoted by V(a). [9] 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. [10]
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
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. [12]
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. [13]
Recall that the principal ideals of a semigroup S are defined in terms of S1, 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:
In a regular semigroup S, every - and -class contains at least one idempotent. If a is any element of S and a' is any inverse for a, then a is -related to a'a and -related to aa'. [15]
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
If S is an inverse semigroup, then the idempotent in each - and -class is unique. [12]
Some special classes of regular semigroups are: [17]
The class of generalised inverse semigroups is the intersection of the class of locally inverse semigroups and the class of orthodox semigroups. [18]
All inverse semigroups are orthodox and locally inverse. The converse statements do not hold.
In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being 0.
In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it.
In mathematics, the concept of an inverse element generalises the concepts of opposite and reciprocal of numbers.
In mathematics, and in particular linear algebra, the Moore–Penrose inverse of a matrix is the most widely known generalization of the inverse matrix. It was independently described by E. H. Moore in 1920, Arne Bjerhammar in 1951, and Roger Penrose in 1955. Earlier, Erik Ivar Fredholm had introduced the concept of a pseudoinverse of integral operators in 1903. When referring to a matrix, the term pseudoinverse, without further specification, is often used to indicate the Moore–Penrose inverse. The term generalized inverse is sometimes used as a synonym for pseudoinverse.
In mathematics, a von Neumann regular ring is a ring R such that for every element a in R there exists an x in R with a = axa. One may think of x as a "weak inverse" of the element a; in general x is not uniquely determined by a. Von Neumann regular rings are also called absolutely flat rings, because these rings are characterized by the fact that every left R-module is flat.
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. John Mackintosh Howie, a prominent semigroup theorist, described this work as "so all-pervading that, on encountering a new semigroup, almost the first question one asks is 'What are the Green relations like?'". The relations are useful for understanding the nature of divisibility in a semigroup; they are also valid for groups, but in this case tell us nothing useful, because groups always have divisibility.
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 monoid describing the Dyck language of balanced pairs of parentheses. Thus, it finds common applications in combinatorics, such as describing binary trees and associative algebras.
In group theory, an inverse semigroupS is a semigroup in which every element x in S has a unique inversey in S in the sense that x = xyx and y = yxy, i.e. a regular semigroup in which every element has a unique inverse. Inverse semigroups appear in a range of contexts; for example, they can be employed in the study of partial symmetries.
In mathematics, and more specifically in abstract algebra, a rng is an algebraic structure satisfying the same properties as a ring, but without assuming the existence of a multiplicative identity. The term rng is meant to suggest that it is a ring without i, that is, without the requirement for an identity element.
In mathematics, a band is a semigroup in which every element is idempotent. Bands were first studied and named by A. H. Clifford (1954); the lattice of varieties of bands was described independently in the early 1970s by Biryukov, Fennemore and Gerhard. Semilattices, left-zero bands, right-zero bands, rectangular bands, normal bands, left-regular bands, right-regular bands and regular bands, specific subclasses of bands that lie near the bottom of this lattice, are of particular interest and are briefly described below.
In abstract algebra, a semiheap is an algebraic structure consisting of a non-empty set H with a ternary operation denoted that satisfies a modified associativity property:
In mathematics, and in particular, algebra, a generalized inverse of an element x is an element y that has some properties of an inverse element but not necessarily all of them. Generalized inverses can be defined in any mathematical structure that involves associative multiplication, that is, in a semigroup. This article describes generalized inverses of a matrix .
In mathematics, particularly in abstract algebra, a semigroup with involution or a *-semigroup is a semigroup equipped with an involutive anti-automorphism, which—roughly speaking—brings it closer to a group because this involution, considered as unary operator, exhibits certain fundamental properties of the operation of taking the inverse in a group: uniqueness, double application "cancelling itself out", and the same interaction law with the binary operation as in the case of the group inverse. It is thus not a surprise that any group is a semigroup with involution. However, there are significant natural examples of semigroups with involution that are not groups.
In mathematics, a nowhere commutative semigroup is a semigroup S such that, for all a and b in S, if ab = ba then a = b. A semigroup S is nowhere commutative if and only if any two elements of S are inverses of each other.
In mathematics, Nambooripad 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 discovered by Robert E Hartwig, some authors refer to it as Hartwig–Nambooripad order. "Natural" here means that the order is defined in terms of the operation on the semigroup.
In mathematics, Brandt semigroups are completely 0-simple inverse semigroups. In other words, they are semigroups without proper ideals and which are also inverse semigroups. They are built in the same way as completely 0-simple semigroups:
In mathematics, the four-spiral semigroup is a special semigroup generated by four idempotent elements. This special semigroup was first studied by Karl Byleen in a doctoral dissertation submitted to the University of Nebraska in 1977. It has several interesting properties: it is one of the most important examples of bi-simple but not completely-simple semigroups; it is also an important example of a fundamental regular semigroup; it is an indispensable building block of bisimple, idempotent-generated regular semigroups. A certain semigroup, called double four-spiral semigroup, generated by five idempotent elements has also been studied along with the four-spiral semigroup.
In mathematics, an orthodox semigroup is a regular semigroup whose set of idempotents forms a subsemigroup. In more recent terminology, an orthodox semigroup is a regular E-semigroup. The term orthodox semigroup was coined by T. E. Hall and presented in a paper published in 1969. Certain special classes of orthodox semigroups had been studied earlier. For example, semigroups that are also unions of groups, in which the sets of idempotents form subsemigroups were studied by P. H. H. Fantham in 1960.
In abstract algebra, an E-dense semigroup is a semigroup in which every element a has at least one weak inversex, meaning that xax = x. The notion of weak inverse is weaker than the notion of inverse used in a regular semigroup.
In the area of mathematics known as semigroup theory, an E-semigroup is a semigroup in which the idempotents form a subsemigroup.