Biordered set

Last updated November 18, 2022

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 set of idempotents of some semigroup.^[1]^[2] A regular biordered set is a biordered set with an additional property. The set of idempotents in a regular semigroup is a regular biordered set, and every regular biordered set is the set of idempotents of some regular semigroup.^[1]

History

The concept and the terminology were developed by K S S Nambooripad in the early 1970s.^[3]^[4]^[1] In 2002, Patrick Jordan introduced the term boset as an abbreviation of biordered set.^[5] The defining properties of a biordered set are expressed in terms of two quasiorders defined on the set and hence the name biordered set.

According to Mohan S. Putcha, "The axioms defining a biordered set are quite complicated. However, considering the general nature of semigroups, it is rather surprising that such a finite axiomatization is even possible."^[6] Since the publication of the original definition of the biordered set by Nambooripad, several variations in the definition have been proposed. David Easdown simplified the definition and formulated the axioms in a special arrow notation invented by him.^[7]

Definition

Preliminaries

If X and Y are sets and ρ ⊆ X × Y, let ρ ( y ) = { x ∈ X : x ρ y }.

Let E be a set in which a partial binary operation, indicated by juxtaposition, is defined. If D_E is the domain of the partial binary operation on E then D_E is a relation on E and (e,f) is in D_E if and only if the product ef exists in E. The following relations can be defined in E:

\omega ^{r}=\{(e,f)\,:\,fe=e\}

\omega ^{l}=\{(e,f)\,:\,ef=e\}

R=\omega ^{r}\,\cap \,(\omega ^{r})^{-1}

L=\omega ^{l}\,\cap \,(\omega ^{l})^{-1}

\omega =\omega ^{r}\,\cap \,\omega ^{l}

If T is any statement about E involving the partial binary operation and the above relations in E, one can define the left-right dual of T denoted by T*. If D_E is symmetric then T* is meaningful whenever T is.

Formal definition

The set E is called a biordered set if the following axioms and their duals hold for arbitrary elements e, f, g, etc. in E.

(B1) ω^r and ω^l are reflexive and transitive relations on E and D_E = ( ω^r ∪ ω ^l ) ∪ ( ω^r ∪ ω^l )⁻¹.

(B21) If f is in ω^r( e ) then f R fe ω e.

(B22) If g ω^lf and if f and g are in ω^r ( e ) then ge ω^lfe.

(B31) If g ω^rf and f ω^re then gf = ( ge )f.

(B32) If g ω^lf and if f and g are in ω^r ( e ) then ( fg )e = ( fe )( ge ).

In M ( e, f ) = ω^l ( e ) ∩ ω^r ( f ) (the M-set of e and f in that order), define a relation $\prec$ by

g\prec h\quad \Longleftrightarrow \quad eg\,\,\omega ^{r}\,\,eh\,,\,\,\,gf\,\,\omega ^{l}\,\,hf

.

Then the set

S(e,f)=\{h\in M(e,f):g\prec h{\text{ for all }}g\in M(e,f)\}

is called the sandwich set of e and f in that order.

(B4) If f and g are in ω^r ( e ) then S( f, g )e = S ( fe, ge ).

M-biordered sets and regular biordered sets

We say that a biordered set E is an M-biordered set if M ( e, f ) ≠ ∅ for all e and f in E. Also, E is called a regular biordered set if S ( e, f ) ≠ ∅ for all e and f in E.

In 2012 Roman S. Gigoń gave a simple proof that M-biordered sets arise from E-inversive semigroups.^[8]^{[ clarification needed ]}

Subobjects and morphisms

Biordered subsets

A subset F of a biordered set E is a biordered subset (subboset) of E if F is a biordered set under the partial binary operation inherited from E.

For any e in E the sets ω^r ( e ), ω^l ( e ) and ω ( e ) are biordered subsets of E.^[1]

Bimorphisms

A mapping φ : E → F between two biordered sets E and F is a biordered set homomorphism (also called a bimorphism) if for all ( e, f ) in D_E we have ( eφ ) ( fφ ) = ( ef )φ.

Illustrative examples

Vector space example

Let V be a vector space and

E = { ( A, B ) | V = A ⊕ B }

where V = A ⊕ B means that A and B are subspaces of V and V is the internal direct sum of A and B. The partial binary operation ⋆ on E defined by

( A, B ) ⋆ ( C, D ) = ( A + ( B ∩ C ), ( B + C ) ∩ D )

makes E a biordered set. The quasiorders in E are characterised as follows:

( A, B ) ω^r ( C, D ) ⇔ A ⊇ C

( A, B ) ω^l ( C, D ) ⇔ B ⊆ D

Biordered set of a semigroup

The set E of idempotents in a semigroup S becomes a biordered set if a partial binary operation is defined in E as follows: ef is defined in E if and only if ef = e or ef= f or fe = e or fe = f holds in S. If S is a regular semigroup then E is a regular biordered set.

As a concrete example, let S be the semigroup of all mappings of X = { 1, 2, 3 } into itself. Let the symbol (abc) denote the map for which 1 → a, 2 → b, and 3 → c. The set E of idempotents in S contains the following elements:

(111), (222), (333) (constant maps)

(122), (133), (121), (323), (113), (223)

(123) (identity map)

The following table (taking composition of mappings in the diagram order) describes the partial binary operation in E. An X in a cell indicates that the corresponding multiplication is not defined.

∗	(111)	(222)	(333)	(122)	(133)	(121)	(323)	(113)	(223)	(123)
(111)	(111)	(222)	(333)	(111)	(111)	(111)	(333)	(111)	(222)	(111)
(222)	(111)	(222)	(333)	(222)	(333)	(222)	(222)	(111)	(222)	(222)
(333)	(111)	(222)	(333)	(222)	(333)	(111)	(333)	(333)	(333)	(333)
(122)	(111)	(222)	(333)	(122)	(133)	(122)	X	X	X	(122)
(133)	(111)	(222)	(333)	(122)	(133)	X	X	(133)	X	(133)
(121)	(111)	(222)	(333)	(121)	X	(121)	(323)	X	X	(121)
(323)	(111)	(222)	(333)	X	X	(121)	(323)	X	(323)	(323)
(113)	(111)	(222)	(333)	X	(113)	X	X	(113)	(223)	(113)
(223)	(111)	(222)	(333)	X	X	X	(223)	(113)	(223)	(223)
(123)	(111)	(222)	(333)	(122)	(133)	(121)	(323)	(113)	(223)	(123)

Related Research Articles

In mathematics, especially in order theory, the cofinality cf(A) of a partially ordered set A is the least of the cardinalities of the cofinal subsets of A.

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 partial function $f$ 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.

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, mathematical physics and the theory of stochastic processes, a harmonic function is a twice continuously differentiable function $where U is an open subset of that satisfies Laplace's equation, that is,$

In abstract algebra, the free monoid on a set is the monoid whose elements are all the finite sequences of zero or more elements from that set, with string concatenation as the monoid operation and with the unique sequence of zero elements, often called the empty string and denoted by ε or λ, as the identity element. The free monoid on a set A is usually denoted A^∗. The free semigroup on A is the subsemigroup of A^∗ containing all elements except the empty string. It is usually denoted A⁺.

In mathematics, a Sobolev space is a vector space of functions equipped with a norm that is a combination of L^p-norms of the function together with its derivatives up to a given order. The derivatives are understood in a suitable weak sense to make the space complete, i.e. a Banach space. Intuitively, a Sobolev space is a space of functions possessing sufficiently many derivatives for some application domain, such as partial differential equations, and equipped with a norm that measures both the size and regularity of a function.

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 differential geometry, a Poisson structure on a smooth manifold $is a Lie bracket on the algebra of smooth functions on, subject to the Leibniz rule$

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

In mathematics, the trace operator extends the notion of the restriction of a function to the boundary of its domain to "generalized" functions in a Sobolev space. This is particularly important for the study of partial differential equations with prescribed boundary conditions, where weak solutions may not be regular enough to satisfy the boundary conditions in the classical sense of functions.

In mathematics, Cayley's Ω process, introduced by Arthur Cayley (1846), is a relatively invariant differential operator on the general linear group, that is used to construct invariants of a group action.

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.

<span class="mw-page-title-main">K. S. S. Nambooripad</span> Indian mathematician (1935–2020)

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 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, the Munn semigroup is the inverse semigroup of isomorphisms between principal ideals of a semilattice. Munn semigroups are named for the Scottish mathematician Walter Douglas Munn (1929–2008).

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.

References

1 2 3 4 Nambooripad, K S S (1979). Structure of regular semigroups – I. Memoirs of the American Mathematical Society. Vol. 224. American Mathematical Society. ISBN 978-0-8218-2224-1.
↑ Easdown, David (1985). "Biordered sets come from semigroups". Journal of Algebra. 96 (2): 581–91. doi: 10.1016/0021-8693(85)90028-6 .
↑ Nambooripad, K S S (1973). Structure of regular semigroups. University of Kerala, Thiruvananthapuram, India. ISBN 0-8218-2224-1.
↑ Nambooripad, K S S (1975). "Structure of regular semigroups I . Fundamental regular semigroups". Semigroup Forum . 9 (4): 354–363. doi:10.1007/BF02194864.
↑ Patrick K. Jordan. On biordered sets, including an alternative approach to fundamental regular semigroups. Master's thesis, University of Sydney, 2002.
↑ Putcha, Mohan S (1988). Linear algebraic monoids. London Mathematical Society Lecture Note Series. Vol. 133. Cambridge University Press. pp. 121–122. ISBN 978-0-521-35809-5.
↑ Easdown, David (1984). "Biordered sets are biordered subsets of idempotents of semigroups". Journal of the Australian Mathematical Society, Series A. 32 (2): 258–268.
↑ Gigoń, Roman (2012). "Some results on E-inversive semigroups". Quasigroups and Related Systems 20: 53-60.

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.

[namb-1] 1 2 3 4 Nambooripad, K S S (1979). Structure of regular semigroups – I. Memoirs of the American Mathematical Society. Vol. 224. American Mathematical Society. ISBN 978-0-8218-2224-1.

[2] Easdown, David (1985). "Biordered sets come from semigroups". Journal of Algebra. 96 (2): 581–91. doi: 10.1016/0021-8693(85)90028-6 .

[3] Nambooripad, K S S (1973). Structure of regular semigroups. University of Kerala, Thiruvananthapuram, India. ISBN 0-8218-2224-1.

[4] Nambooripad, K S S (1975). "Structure of regular semigroups I . Fundamental regular semigroups". Semigroup Forum . 9 (4): 354–363. doi:10.1007/BF02194864.

[5] Patrick K. Jordan. On biordered sets, including an alternative approach to fundamental regular semigroups. Master's thesis, University of Sydney, 2002.

[putcha-6] Putcha, Mohan S (1988). Linear algebraic monoids. London Mathematical Society Lecture Note Series. Vol. 133. Cambridge University Press. pp. 121–122. ISBN 978-0-521-35809-5.

[7] Easdown, David (1984). "Biordered sets are biordered subsets of idempotents of semigroups". Journal of the Australian Mathematical Society, Series A. 32 (2): 258–268.

[8] Gigoń, Roman (2012). "Some results on E-inversive semigroups". Quasigroups and Related Systems 20: 53-60.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]