up | next | prev | ptail | tail |
Definition 5.1. We call a regular semigroup a fundamental regular semigroup if and only if the greatest idempotent separating congruence on is the identity congruence. Given a regular semigroup , it can be easily seen that is a fundamental regular semigroup.
Throughout this chapter, we denote a biordered set by and a partially transitive set on by . We give below some additional notations needed in the sequel. For define
(5.1) |
Then
If , then by axiom we have
(5.2) |
Also for and define
(5.3) |
Then if and . Also for any and , it follows from (5.2) and (5.3) that
(5.4) |
For , is the domain restriction ( is the range restriction) of to . Therefore when , (5.4) reduces to (5.2) if we choose .
In define a releation as follows:
(5.5) |
It is not difficult to see that is an equivalence relation on . We denote the -class of by . If since it is clear from (5.5) that for all or . Hence
(5.6) |
and therefore if
(5.7) |
Following is the main structure theorem of this chapter.
Theorem 5.1. Let be a biordered set and . Define for ,
(5.8) |
Then is a fundamental regular semigroup under the operation defined by (5.8) and is isomorphic to .
Conversely if is a fundamental regular semigroup, then is isomorphic to .
We prove this theorem through a sequence of lemmas.
Proof. By hypothesis and for all ,
Since ,
Hence the required result is equivalent to the following:
Since is a partial -isomorphism, this is equivalent to the equality established in Lemma 3.7. Statement (2), which is the dual of (1), can be proved similarly. □
Proof. First suppose that . Then and therefore
If then , and by Lemma 5.2,
If , by (5.4),
and hence by (5.5) .
If , the required relation can be proved analogously. If and are any two members of then by Lemma 2.7 there exists such that and hence the lemma. □
Proof. The hypotheses imply that
and
Then by Lemma 2.6, . In view of Lemma 5.3, we need only establish that for any
The statement implies that
Hence if and
Dually and thus we get and .
Since we need only establish the following assertion:
For Lemma 3.1, taking we get
Similarly it can be seen that
and
Hence if
Therefore
The dual statement
can be proved similarly. Thus
and hence the lemma. □
Proof. By (5.4), we have for , . Also and . We obtain the lemma if we establish the following equality:
(5.9) |
From the fact that is a partial -isomorphism we have
where is defined by (3.26). Similarly
Hence (5.9) is equivalent to
where
Since and are partial -isomorphisms, this is equivalent to
which is the same as the equality in Lemma 3.8. □
Proof. By (5.4)
and
Hence the expressions on either side of in the required relation are defined. Further by Lemma 3.9, there exist and such that
By Lemma 5.3 we may without loss of generality choose and so as to satisfy the above equality. □
Since and and satisfy conditions of Lemma 5.5 and hence we get by the equality ,
It is clear that
and
Hence
But
Since , the range of is and the domain of is , and therefore,
Hence
and the dual statement
can be obtained in the same way. Since , the lemma is proved.
Lemma 5.7. If , is a regular semigroup under the operation defined by Lemma 5.8.
Proof. If , for and , by Lemma 5.8
□
By Lemma 5.4, the -class does not depend on the choice of in , in and . Hence is a -class of depending only on the classes and , and therefore Lemma 5.8 defines a binary operation on .
Let , , and . Then if , by (5.4)
Now for ,
Similarly, if , where then
Thus by Lemma 5.6,
If , then and by axiom () of Definition 3.1, . Also if
Hence is a regular semigroup.
Moreover, the mapping
(5.11) |
is a bijection of onto the -class of . Consequently,
(5.12) |
Proof. That for all is clear from the definition of operation in . □
Now let . Then and = . But clearly and hence
which implies that in , by (1.10)
On the other hand if and if then
Hence
Since implies or . Hence .
Let . Then and we have
Hence and so the mapping maps into . Let . Then if as observed earlier,
Hence by (5.10) and (5.10)*, , . Then if and . Thus the mapping defined by (5.11) is onto . From the definition of it is clear that
which shows that the mapping defined by (5.11) is one-to-one.
Further
which is statement (5.12).
Lemma 5.9. Let denote the mapping of into defined by
(5.13) |
for every . Then is an isomorphism of onto the biordered set of idempotents of . Moreover,
(5.14) |
for every .
Proof. We have already noted that maps into and that and preserve both and (by (5.10) and (5.10)*).
Let where . Then if we have
Hence
Since is a partial -isomorphism we have
Hence
Therefore
By Lemma 5.8, we see that and are -equivalent idempotents and consequently
This proves that is onto. Being one-to-one, it is a bijection.
Let . Then and by (4.1),
But
and therefore
Let and . Then and hence
Then by (4.4) .
Hence is a bimorphism and similarly is also a bimorphism. Thus is an isomorphism.
Let and . Then
Now
and therefore
This proves (5.14). □
Remark 5.10: We have already noted that given any regular semigroup we can associate with a partially transitive set on (of Theorem 4.12). For any is a regular semigroup and hence we can define a partially transitive set on by (4.13). It will be of interest to find out the relation between and . In fact the mapping
(5.15) |
is a bijection of onto which reduces to identity mapping when and are identified by .
That (5.15) defines a mapping of into , is clear. Now suppose that and . Let so that and . By Lemma 5.8, there exists such that . Then is an inverse of in and so . Thus
and this proves that the mapping defined by (5.15) is onto. Now if for some and , we have
where , then and therefore there exists such that
However, for all , by (5.14)
Thus and this being true for all we conclude that . Hence the mapping defined by (5.15) is also one-to-one.
Proof. For , by Theorem 4.13,
for some and . is fundamental if we establish that
(5.16) |
Suppose that and . Choose so that and .
Then
Hence by Remark 5.10 and consequently
Thus we have established the first part of Theorem 5.1 (i.e., for all under the operation defined by (5.8), is a fundamental regular semigroup and is isomorphic to ). We obtain the converse part of Theorem 5.1 from the following theorem. □
Theorem 5.12. Let be a regular semigroup and denote the partially transitive set on defined by (4.13). Then for and
(5.17) |
defines a homomorphism of onto such that
(5.18) |
Proof. It follows from the definition of and Lemma 4.11 (c), that for all and ,
and thus defines a mapping of into . For , and we have by Theorem (4.8) . Therefore by Lemma 4.11 (b) and (d),
where and . By (5.8)
and so
Now suppose that . Then by the definition of for some ,
and thus
On the other hand if , then for some
Thus by (5.5)
In other words and for ,
and
We now conclude that
and thus .
Proof of the theorem is now complete. □
For any biordered set , since , we have the following corollary:
Corollary 5.13. Every biordered set is isomorphic to the biordered set of idempotents of some regular semigroup.
(5.19) |
then is a complete lattice under inclusion relation and the mapping
(5.20) |
is a lattice isomorphism of onto .
Proof. The mapping defined by (5.20) is an order isomorphism of onto by (5.7) and hence the result follows from this and Theorem 3.5. □
Remark 5.15: A different construction for the greatest and the least members of the lattice is given by Hall [5].
Remark 5.16: If is a regular semigroup, the operation of induces a biordered structure on (cf. Theorem 4.5). By 5.13, the structure of any biordered set may be registered as having been induced by the operation of a regular semigroup that contains isomorphically as its idempotent set. It is clear that the operation of induces a partial operation of and the partial groupoid so formed determines the structure of (as a biordered set). But there are in general more than one such partial groupoids on that determine the same biorder structure on .
For example let be any group, be distinct elements of and e be its identity. Suppose that
Then
(where 2 denotes the index set {1, 2}) are two completely simple semigroups such that and are isomorphic as biordered sets but are different as partial groupoids. In fact, as partial groupoids is a band, but may not.
It is natural to define a biordered set E as a band if is a band semigroup. Also is a band in if the partial groupoid is a band semigroup. Clearly if is a band in it is a band (as a biordered set). But as the previous example shows, the converse of this is not true.
The structure of band semigroup was determined by McLean [8], and of those semigroups whose biordered set of idempotents is a band in that semigroup was determined by Yamada [13] (Yamada [13] calls such semigroups as strictly regular semigroups). The following theorem characterizes bands in the class of all biordered sets and strictly regular semigroups in terms of generalised Brandt groupoids (cf [14]).
Theorem 5.17. Let be a biordered set. Then is a band if and only if the following conditions are satisfied.
(i) |
where denotes the ()-class of containing e.
(ii) |
If is a regular semigroup, is a band in if and only if the trace (cf. p. 92 of [2]) of each -class of is isomorphic to a generalized Brandt semigroup.
Proof. Suppose that the biordered set satisfies the hypothesis and let . Then by Theorem 3.3, there exists a -chain such that . We may assume that for , the elementary factors () and () of are not similar. Let . Then by hypothesis
Hence there exists such that
and again by hypothesis we conclude that there exists such that
Continuing this process, we obtain by induction that there exist such that
and
Now suppose that . Then by the definition of , and (ii),
Thus
Hence by Lemma 5.9, . It follows that is a band semigroup, and hence is a band.
Conversely let be a band. Then is a band semigroup. Let . Then there exists such that and therefore . Clearly
Further,
and this is an idempotent. Hence by Lemma 5.9, there exists such that
which implies that
Let be a regular semigroup such that is a band in and be a -class of . Fix a maximal subgroup of contained in . We shall show that it is possible to choose elements
such that if and only if if and only if and
For this let be a subset of such that for any . Choose and let be its inverse in . For each define
Clearly and if and only if . Also if
(since is an idempotent -equivalent to , ). Since the mapping of onto is one-to-one, we have . Thus we have chosen for all . In a similar way we can choose for all also by defining if . Then we can show that if and only if .
Now let . Then
Now and hence . Therefore
Similarly
Hence
It is clear that if we define the matrix
by
where is the -class of containing and is the -class of containing , then every nonzero entry of is the identity of . Using the fact that if and only if there exist such that
We can prove that the matrix constructed above is the semi-identity matrix of type (cf. Yamada [14]).
Now by Theorem 3.4 of [2], the trace of is isomorphic to
and this is a generalized Brandt semigroup by lemma 5 of [14].
Suppose now that trace of each -class of is a generalized Brandt semigroup. Let . Then for any and . Hence the product is not zero in the trace of . Since the set of idempotents of the trace of is a band, it follows that is a nonzero idempotent of the trace of and hence . Hence is a band. This completes the proof of Theorem 5.17.
If is a semilattice (i.e., ) it can be easily seen that it is a semilattice in (i.e., a commutative subsemigroup of ). Hence in this case the statement that is a semilattice is equivalent to the statement that is a semilattice in . □
When is a semilattice, it is clear that defined in by (5.5) reduces to the identity relation. Moreover, the operation defined by (5.8) is then equivalent to the usual composition of relations. Therefore is an inverse semigroup whose semilattice is isomorphic to . Also, any partially transitive set on is a subsemigroup of since axiom () in this case is equivalent to the fact that implies . Hence every fundamental inverse semigroup whose semilattice is isomorphic to is isomorphic to a subsemigroup of .
The analogous results for bisimple inverse semigroup are due to W. D. Munn (cf. [11]).
up | next | prev | ptail | top |