up | next | prev | ptail | tail |
Let be a nonempty set and , a quasi-order (a reflexive and transitive relation) on . The pair is called a quasi-ordered set. For every , the set
(1.1) |
is described as the (principal) -ideal of generated by . The relation which is clearly an equivalence relation on , is termed as the equivalence relation associated with . An element is said to be universally maximal in if
(1.2) |
Let and be quasi-ordered sets. Then,
(1.3) |
is a quasi-order on . The quasi-ordered set is called product ordered set and is denoted by
Let be a mapping. The image of under is denoted by (or by ). is called an order preserving map or an order morphism if
(1.4) |
for all .
If and then denotes the composition
(1.5) |
An order morphism is called a retraction (co-retraction) if there exists an order morphism such that
(1.6) |
where denotes the identity map on . (We shall use this notation for identity maps throughout this work).
An order morphism which is both a retraction and a co-retraction is called an order isomorphism (or isomorphism when there is no confusion). An order isomorphism of onto may also be defined as a bijection satisfying the following condition: For all ,
(1.7) |
We regard composition of functions as a particular case of composition of relations defined on p. 13 of [2], so that is defined even when range (so that if range ), being written in the order shown in (1.5) which agrees with the definition given in [2].
All notations associated with semigroups, not explicitly defined here, are from [2] and [3]. We give below some additional notations which are used throughout this work.
By a semigroup we mean a regular semigroup which we denote by . For we denote by and the and -classes of and respectively. We write
(1.8) |
so that if , it is an -class of . Further, if , we define
so that denotes the set of idempotents of , and when there is no confusion, we write instead of . On , define
Clearly denotes the quasi-order on induced by the inclusion relation among the principal right (left) ideals. Thus for all ,
and
It can be easily verified that
(1.13) |
and in particular, is a partial order.
On , define
(1.14) |
and for and ,
(1.15) |
For convenience, denote by . If and , then is the unique inverse of in .
Let and be two -classes of . If the right (left) translation determined by is a one-to-one -class preserving map of onto , then we say that translates onto so that . Clearly, if translates onto and if translates onto , then translates onto and by the associativity of multiplication in ,
In this investigation we deal with the left–right duals of statements and concepts. Left–right dual of a statement or concept is denoted by while the actual statement or definition of is omitted. Thus the quasi-order is the left–right dual of . Corresponding to any statement or concept involving , there is a statement or concept involving which will be the left–right dual of the former. The same remark applies to definitions of biordered sets (Definition 2.1), bimorphisms (Definition 2.2) etc., where the quasi-order , function etc., are regarded as duals of etc. Unless otherwise stated, with every statement, axiom or definition we assume its dual and its explicit formulation is omitted.
up | next | prev | ptail | top |