up | next | prev | ptail | tail |
In the previous chapter, we have described the construction of a regular groupoid starting with a symmetric presheaf of groups over a biordered set with respect to a regular equivalence relation on and a regular family of matrices for . Here we describe the construction of regular semigroups from regular groupoids.
Throughout this chapter, will denote a regular groupoid, , the set of idempotents of and , the equivalence relation on induced by the distinct Rees groupoids of . Since inverses of elements of can be defined as in the case of regular semigroups, notations used for regular semigroups in (1.14) and (1.15) can be carried over to regular groupoids also. In particular, will denote the inverse relation (cf. (1.14)) of and the set of inverse of .
A partial transformation of is said to be idempotent preserving if and only if for all , .
Definition 8.1. Let be a regular groupiod. For let denote a mapping of into and let
(8.1) |
Then is a regular system if the following axioms (and their duals) are satisfied. In these statements products shown are products in .
if either or for some .
is an -isomorphism.
Remarks:
(8.1) is a mapping of into such that for all is the identity map of .
Proof. Since by (R3) , is an inverse of (where and ), is an idempotent in the Rees groupoid of and hence . By (R4), is a mapping of into and the statement above implies that for all .
If , and , by (R1) and . Thus . □
(8.2) For all and .
Proof. By axioms (R2) and (R1),
for every .
where denotes the product of and in .
(8.3) Let and . If . Then
for all . In particular for .
Proof. Suppose that . Let . Then and hence, , and by axiom (R2), . Now by (R3), is an inverse of and hence is in the -class of . Since by definitions , we have the required result.
It follows from the remarks above that and hence is -equivalent to □
(8.4) For all .
Proof. Let where . If and , then
By (R5) and , and . Hence
This proves that is the identity map of . Similarly it can be shown that is the identity map on . Hence
(8.5) Let , and . If then
Proof. Choose and let and . Thus by (R2)
By axioms , and are -equivalent inverses of . Thus the required result follows from the fact that is also an inverse in , the product being defined in . □
(8.6) If and are as in (R6), .
Proof. Since and , we have . Since is an -isomorphism we have
Remark 8.2: Let and be as in axiom (R6). Then
Then the partial transformation and the products and are defined.
Proof. Since and ,
Hence
□
By the definition of and hence . Similarly it can be seen that . Consequently
and .
Proof. Since is idempotent preserving is an idempotent of . Choose .
Then
by axiom (R1). Hence for
Again by axiom (R2), since we have
Thus is the idempotent of . Consequently
The bracketed statement can be proved dually. □
Theorem 8.4. Let be a regular system. Then the partial operation of may be extended by means of and so as to make a regular semigroup. Conversely, if is the regular groupoid of a regular semigroup and can be defined in such a way that is a regular system. The regular semigroup obtained by extending the operation of by and coincides with .
Proof. For define
(8.2) |
where and denotes the product in . This product is defined in since .
If and , then by axiom (R2),
(8.3) |
By axioms (R3), (R3)* and Lemma 2.6, the right hand side of (8.2) does not depend on the choice of and . Hence to prove that (8.2) defines a binary operation on , it is necessary to show that for ,
(8.4) |
First suppose that . Then , and hence by (R3)*,
Further by axiom (R4),
Thus
Now and so, the products and are defined in . Since is associative and since is a right identity of , we see that (8.4) holds.
If , dually we can prove that (8.4) holds. If and are any two members of by Lemma 2.7, there exists such that . Hence combining the two cases we see that (8.4) holds in general.
For , if the product is defined in then contains an idempotent (say) and by Lemma 2.4, . Therefore by axiom (R1) and (R1)*
Thus the operation in , whenever it is defined, coincides with that given by (8.2).
If , by Lemma 2.5, . Hence by axiom (R1)* and (R2) we obtain
Dually if
(8.5*) |
Thus (8.2), (8.5) and (8.5*) together give
We shall now prove that the operation defined by (8.2) is associative. Let , and . Choose , and let . Then is an -isomorphism of onto and by axiom (R5)
Hence if and , then by Lemma 3.9, there exist and such that
Now by axioms (R3)* and (R5) we have
(8.6) |
Since
and , we have
Hence by axioms (R3), (R6) and (8.2)
Therefore by (8.5) and (8.5*) we get
Dually we have
and so
Now the products and are defined in . Thus
We have proved that with the operation defined by (8.2) is a semigroup. Let this semigroup be denoted by . Evidently two elements that are -equivalent in are also -equivalent in . An idempotent in is also an idempotent in . This implies that is a regular semigroup.
Conversely let be a regular semigroup and be its regular groupoid. For , we define as the -isomorphism given by Lemma 4.11. Then it is clear that is a mapping of into where in this case . Further for and define
(8.7) |
If
we then show that
(8.8) |
is a regular system.
Axioms (R1) and (R1)* are clearly satisfied. Also if and if then by Lemma 4.11.
and similarly
By Lemma 4.1 (Lemma 4.1*) translates to an class of and therefore . Also . Hence axioms (R2) and (R2)* hold. Axioms (R3), (R3)*, (R4) and (R4)* are easily verified. Axioms (R5) and (R5)* follow from the fact that for every and are mutually inverse -isomorphisms (cf. Lemma 4.11) and the equality
where .
To verify axiom (R6), assume that and . Then
and
Therefore by (4.8) and (8.7) we have
Axiom (R6)* can be verified similarly.
We have now proved that is a regular system. With respect to this system the product of is given by
where and .
where the product on the right is that of . Therefore the new operation coincides with the operation in .
Hence the theorem. □
Definition 8.2. If is a regular system, we call the regular semigroup constructed in the above theorem, the regular semigroup of . Conversely, given the regular semigroup , the regular system defined by (8.8) is the regular system of .
Lemma 8.5. Let be a regular system. Then and where denotes the regular groupoid of the regular semigroup .
Proof. Let , and . Denote by and etc. the quasi-orders and partial translations of and by etc. those of . Since is the biordered set of idempotents of the regular semigroup etc. are quasi-orders and partial translations defined by (1.10), (1.11) and (4.1). For the product of and in , if it is defined, will be denoted by . The product of the same elements in is denoted by .
Since the operation of is the extension of the partial operation in , it is evident that
On the other hand suppose that . Choose and . Then using the fact that is an idempotent in , (8.5) and (8.5*), we obtain
By the definition of product in , we obtain from above that
and therefore
Dually and hence . Further, since contains an idempotent, . But . Hence , and so is an idempotent in . This implies that and are equivalent idempotents in and therefore
Therefore and hence . This implies that and dually we can show that . Hence and therefore . Thus .
This proves that .
Let . Then by Lemma 2.5 and by (8.2),
Now by Remark 8.3 . Since in , by axioms (R1) and (R3),
Thus . Hence
But in and hence
This implies by (4.1) that . Consequently and dually .
Further if , by Remarks 8.3, 8.5 and (4.1),
Hence
Now for suppose that . Then for ,
Since ,
and
Since is the product in , and . But and hence , i.e., . Since is defined in and , . This implies that
and so . This shows that
and hence . Therefore .
Thus and dually . Suppose that , where . Since is an idempotent in ,
Now the product of and is defined in and hence by (8.2), (8.5) and (8.5*)
Therefore by Theorem 4.4, . Thus we have proved that is a biordered subset of .
Now let and let , . Then by (8.2),
where .
Now is the product in and hence and . Since are idempotents in and , and . Hence . But since , . This implies that and dually . Consequently and . But since , and hence . Similarly . This implies that . Therefore , and thus .
Now the sets underlying and are the same. Also product of and is defined in if it is defined in . Conversely if is defined in , contains an idempotent. Since this idempotent is an idempotent of , is defined in also. Thus and denote the same regular groupoids. □
Consequently and dually .
Now let . By the definition of the mapping , the domain of is which is the same as the domain of (cf. Lemma 4.11). Now let . Then if
by axiom (R5)
Since , we obtain from the above equality that
Therefore for all
By Lemma 8.5, and hence
Remark 8.7: If and denote the classes of all regular systems and regular semigroups respectively, then by Theorem 8.4 the correspondence is a surjection of onto . Again by Theorem 8.6 this correspondence is also an injection. By defining morphisms of regular systems suitably, it is possible to make the correspondence (referred to above) an equivalence of categories of regular systems and regular semigroups.
Theorem 8.8. Let , be two regular systems and let be a homomorphism (an isomorphism). Then can be extended to a homomorphism (an isomorphism) of into (onto) if and only if the following condition and its dual are satisfied: For every and
(8.9) |
Proof. Let , and . Then by (8.2)
where the product on the right hand side is defined in hence if is a homomorphism of into , then
By the definition of homomorphisms of regular groupoids is a bimorphism and hence . and . Hence if satisfies (8.9), then
i.e., extends to a homomorphism.
Conversely if is a homomorphism and if , , then and
Statement (8.9)* can be verified dually.
If is an isomorphism it is clear that its extension is also an isomorphism. Hence the bracketed statement now follows. □
By Theorem 5.17 and the definiton of strictly regular groupoid we notice that the regular groupoid of a regular semigroup is strictly regular if and only if is strictly regular. Similarly is an inverse semigroup if and only if is an inverse groupoid. Thus we have the following theorem:
Theorem 8.9. The regular semigroup of a regular system is strictly regular if and only if the regular groupoid of is strictly regular. Similarly is an inverse semigroup if and only if is an inverse groupoid.
Remark 8.10: If is an inverse groupoid, axioms for regular systems containing can be simplified considerably. In this case for each , there exists unique such that so that the mapping (in this case we can write instead of ) may be regarded as a mapping of into where . Hence we may write this mapping as instead of . The fact that is a semilattice implies that the mappings and defined by (8.1) reduce to and respectively. Further, axioms (R3) and (R4) are superfluous when is an inverse groupoid.
If we define an inverse system as a regular system whose regular groupoid is an inverse groupoid, then we can state the axioms for inverse system as follows (here except for the changes introduced above, all other notations are those of definition (8.1)).
and
Theorems corresponding to Theorems 8.4 and 8.6 can also be proved for inverse systems in a similar manner.
up | next | prev | ptail | top |