Nambooripad order

Last updated

In mathematics, Nambooripad order [1] (also called Nambooripad's partial order) is a certain natural partial order on a regular semigroup discovered by K S S Nambooripad [2] in late seventies. Since the same partial order was also independently discovered by Robert E Hartwig, [3] some authors refer to it as Hartwig–Nambooripad order. [4] "Natural" here means that the order is defined in terms of the operation on the semigroup.

Contents

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 idempotents in any semigroup. 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 semigroups 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, 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. [5]

Definition (Nambooripad)

Let S be any regular semigroup and S1 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 xS1 ⊆ yS1 is a partial order in the collection of Green R-classes in S. For a and b in S the relation ≤ defined by

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

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

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 ≤Jb 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. [6]

Natural partial order of Mitsch

Mitsch further generalized the definition of Nambooripad order to arbitrary semigroups. [7] [8]

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 ≤Mb 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 epigroups 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. [6]

See also

Related Research Articles

Monoid Algebraic structure with an associative operation and an identity element

In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element.

In mathematics, a partial functionf from a set X to a set Y is a function from a subset S of X to Y. The subset S, that is, the domain of f viewed as a function, is called the domain of definition of f. If S equals X, that is, if f is defined on every element in X, then f is said to be total.

Semigroup

In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation.

In abstract algebra, the idea of an inverse element generalises the concepts of negation and reciprocation. The intuition is of an element that can 'undo' the effect of combination with another given element. While the precise definition of an inverse element varies depending on the algebraic structure involved, these definitions coincide in a group.

In mathematics, an algebraic structure consists of a nonempty set A, a collection of operations on A of finite arity, and a finite set of identities, known as axioms, that these operations must satisfy.

Semiring algebraic ring that need not have additive negative elements

In abstract algebra, a semiring is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse.

In mathematics, a join-semilattice is a partially ordered set that has a join for any nonempty finite subset. Dually, a meet-semilattice is a partially ordered set which has a meet for any nonempty finite subset. Every join-semilattice is a meet-semilattice in the inverse order and vice versa.

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, 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, 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.

Semifield one of two generalizations of fields, either relaxing associativity and commutativity of multiplication, or relaxing the existence of additive inverses

In mathematics, a semifield is an algebraic structure with two binary operations, addition and multiplication, which is similar to a field, but with some axioms relaxed.

A biordered set ("boset") is a mathematical object that occurs in the description of the structure of the set of idempotents in a semigroup. The concept and the terminology were developed by K S S Nambooripad in the early 1970s. The defining properties of a biordered set are expressed in terms of two quasiorders defined on the set and hence the name biordered set. Patrick Jordan, while a master's student at University of Sydney, introduced in 2002 the term boset as an abbreviation of biordered set.

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.

K. S. S. Nambooripad Indian mathematician

K. S. S. Nambooripad was an Indian mathematician who has made fundamental contributions to the structure theory of regular semigroups. Nambooripad was also instrumental in popularising the TeX software in India and also in introducing and championing the cause of the free software movement in India.

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 xn belongs to G.

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.

References

  1. ↑ Thomas Scott Blyth (2005). Lattices and ordered algebraic structures . Springer. pp.  228–232. ISBN   978-1-85233-905-0.
  2. ↑ K.S.S. Nambooripad (1980). "The natural partial order on a regular semigroup". Proceedings of the Edinburgh Mathematical Society. 23 (3): 249–260. doi: 10.1017/s0013091500003801 .
  3. ↑ R. Hartwig (1980). "How to partially order regular elements". Mathematica Japonica. 25 (1): 1–13.
  4. ↑ J.B. Hickey (2004). "On regularity preservation on a semigroup". Bulletin of the Australian Mathematical Society. 69: 69–86. doi: 10.1017/s0004972700034274 .
  5. ↑ H. Mitsch (July 1986). "A natural partial order for semigroups" (PDF). Proceedings of the American Mathematical Society. 97 (3): 384. doi: 10.1090/s0002-9939-1986-0840614-0 . Retrieved 11 April 2011.
  6. 1 2 Peter M. Higgins (1992). Techniques of semigroup theory . Oxford University Press. pp.  46–48. ISBN   978-0-19-853577-5.
  7. ↑ Peter M. Higgins (1994). "The Mitsch order on a semigroup". Semigroup Forum . 49 (1): 261–266. doi:10.1007/BF02573488.
  8. ↑ Mario Petrich (2001). "Certain partial orders on semigroups" (PDF). Czechoslovak Mathematical Journal. 51 (2): 415–432. doi:10.1023/a:1013711417539. hdl: 10338.dmlcz/127657 . Retrieved 11 April 2011.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.