HOME

TheInfoList



OR:

In mathematics, Nambooripad order (also called Nambooripad's partial order) is a certain natural
partial order In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary ...
on a
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 . Regular semigroups are one of the most-studied classes of 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 general Nambooripad's order in a regular semigroup is not compatible with multiplication. It is compatible with multiplication only if the semigroup is pseudo-inverse (locally inverse).


Precursors

Nambooripad's partial order is a generalisation of an earlier known partial order on the set 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 in any
semigroup In mathematics, a semigroup is an algebraic structure consisting of a Set (mathematics), set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplication, multiplicatively ...
. The partial order on the set ''E'' of idempotents in a semigroup ''S'' is defined as follows: For any ''e'' and ''f'' in ''E'', ''e'' ≤ ''f'' if and only if ''e'' = ''ef'' = ''fe''. Vagner in 1952 had extended this to
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 semi ...
s as follows: For any ''a'' and ''b'' in an inverse semigroup ''S'', ''a'' ≤ ''b'' if and only if ''a'' = '' eb'' for some idempotent ''e'' in ''S''. In the
symmetric inverse semigroup __NOTOC__ In abstract algebra, the set of all partial bijections on a set ''X'' ( one-to-one partial transformations) forms an inverse semigroup, called the symmetric inverse semigroup (actually a monoid) on ''X''. The conventional notation for ...
, this order actually coincides with the inclusion of partial transformations considered as sets. This partial order is compatible with multiplication on both sides, that is, if ''a'' ≤ ''b'' then ''ac'' ≤ ''bc'' and ''ca'' ≤ ''cb'' for all ''c'' in ''S''. Nambooripad extended these definitions to regular semigroups.


Definitions (regular semigroup)

The partial order in a regular semigroup discovered by Nambooripad can be defined in several equivalent ways. Three of these definitions are given below. The equivalence of these definitions and other definitions have been established by Mitsch.


Definition (Nambooripad)

Let ''S'' be any regular semigroup and ''S''1 be the semigroup obtained by adjoining the identity 1 to ''S''. For any ''x'' in ''S'' let ''Rx'' be the Green R-class of ''S'' containing ''x''. The relation ''Rx'' ≤ ''Ry'' defined by ''xS''1 ⊆ ''yS''1 is a partial order in the collection of Green R-classes in ''S''. For ''a'' and ''b'' in ''S'' the relation ≤ defined by *''a'' ≤ ''b'' if and only if ''Ra'' ≤ ''Rb'' and ''a'' = ''fb'' for some
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 ...
''f'' in ''Ra'' is a partial order in ''S''. This is a natural partial order in ''S''.


Definition (Hartwig)

For any element ''a'' in a regular semigroup ''S'', let ''V''(''a'') be the set of inverses of ''a'', that is, the set of all ''x'' in ''S'' such that ''axa'' = ''a'' and ''xax'' = ''x''. For ''a'' and ''b'' in ''S'' the relation ≤ defined by *''a'' ≤ ''b'' if and only if ''a'a'' = ''a'b'' and ''aa' '' = ''ba' '' for some ''a' '' in ''V''(''a'') is a partial order in ''S''. This is a natural partial order in ''S''.


Definition (Mitsch)

For ''a'' and ''b'' in a regular semigroup ''S'' the relation ≤ defined by *''a'' ≤ ''b'' if and only if ''a'' = ''xa'' = ''xb'' = ''by'' for some element ''x'' and ''y'' in ''S'' is a partial order in ''S''. This is a natural partial order in ''S''.


Extension to arbitrary semigroups (P.R. Jones)

For ''a'' and ''b'' in an arbitrary semigroup ''S'', ''a'' ≤J ''b'' iff there exist ''e'', ''f'' idempotents in S1 such that ''a'' = ''be'' = ''fb''. This is a reflexive relation on any semigroup, and if ''S'' is regular it coincides with the Nambooripad order.


Natural partial order of Mitsch

Mitsch further generalized the definition of Nambooripad order to arbitrary semigroups. The most insightful formulation of Mitsch's order is the following. Let ''a'' and ''b'' be two elements of an arbitrary semigroup ''S''. Then ''a'' ≤M ''b'' iff there exist ''t'' and ''s'' in S1 such that ''tb'' = ''ta'' = ''a'' = ''as'' = ''bs''. In general, for an arbitrary semigroup ≤J is a subset of ≤M. For
epigroup In abstract algebra, an epigroup is a semigroup in which every element has a power that belongs to a subgroup. Formally, for all ''x'' in a semigroup ''S'', there exists a positive integer ''n'' and a subgroup ''G'' of ''S'' such that ''x'n'' be ...
s however, they coincide. Furthermore if ''b'' is a regular element of ''S'' (which need not be all regular), then for any ''a'' in ''S'' a ≤J b iff a ≤M b.


See also

*
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 . Regular semigroups are one of the most-studied classes of semigroup ...
*
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 semi ...


References

{{reflist Semigroup theory