up | next | prev | ptail | tail |
Let and be biordered sets and and be regular semigroups. Let be a bimorphism and , a homomorphism. We say that extends to and is a restriction of to if and only if
(6.1) |
where and . If and , is the usual restriction of to since
By Theorem 4.10, every homomorphism of a regular semigroup is an extension of some bimorphism. In this chapter we shall show that every bimorphism is the restriction of some homomorphism of a regular semigroup to its set of idempotents.
Definition 6.1. Let be a bimorphism of a biordered set into a biordered set . Suppose that and . Then we shall say that a mapping
is compatible with if and only if the following conditions are satisfied.
(c1)
where denotes the image of under
(c2) If is a -chain in and if then
(c3) If and if either or , then
Theorem 6.1. Let and be biordered sets, and . If is a bimorphism and if is compatible with then defined by
(6.2) |
is a homomorphism of into which extends .
Conversely if is a homomorphism and if denotes the bimorphism defined by
(6.3) |
where and are isomorphisms defined by (5.13), then there exists a mapping compatible with such that
Proof. First we prove that is a mapping. Suppose that and . Then from (5.5) and the fact that is a bimorphism we obtain
Further if
by (c2) and (c3). Therefore
(6.4) |
Hence by (5.5)
which implies that . Thus is a mapping. Moreover by (5.8), and (6.2)
where , . Since we have by (c3) and (6.4),
Thus is a homomorphism of into . Also for ,
and therefore extends .
If is a homomorphism, Theorem 4.10 and Lemma 5.9 show that is a bimorphism. Evidently is a restriction of to . Now define by
(6.5) |
for all . Since and by (5.14), . By definition of
and hence . Similarly . Hence satisfies axiom (c1).
Let and . Since we have
and
Substituting these in (6.5), we obtain
Since we have by (4.16) that
Therefore
Similarly it can be seen that the same equality holds when . Thus satisfies (c3) also.
To verify (c2), let . Then
Hence
Since
we have
Similarly if we obtain
This together with axiom (c3) implies axiom (c2). Hence the theorem. □
Theorem 6.2. Let and be as given in Theorem 6.1. Then the following statements are equivalent.
Proof. If is injective, since
is also injective. On the other hand, if is injective
is also injective and so is an idempotent separating homomorphism. Since is fundamental, this implies that is injective. Thus (a) (c).
Let and . Then by Definition 6.1
and since is injective we have . Further, since ,
which implies that . Hence i.e., is injective and thus (a) (b).
Let . Then
Since is injective we have and hence . Thus (b) (c). □
Proof. If then and hence . But since also belongs to . Further and are inverse of in the -class of and therefore , which implies that . Thus .
To prove (b), let and . Then for
Thus
(6.6) |
For we have by (5.14), (6.1), (6.2) and (6.6)
Since is an isomorphism, we have for all
□
Lemma 6.4. Let and be as given above and let be surjective. Then if and then there exists such that .
Proof. Since is surjective, there exist such that
Let and . Then since ; and
Thus
and .
Dually we can prove that there exist and such that
and
Now let . Then and by Lemma 6.3.
Thus
and if
Since and , for
we have
and
By definitions of and
Therefore by (6.4)
Now if
then and . Thus
and
Consequently and , which imply that . □
Theorem 6.5. Let be compatible with bimorphism . Then we have the following:
Proof. (a) If is surjective, by (4.6) and (6.1), is also surjective. For , there exists such that . Also by Lemma 6.4 there exists such that and thus is surjective.
If is surjective, by definition, is also surjective.
(b) If is surjective, we have by (4.6), and (6.1)
Denoting by we see that is a regular subsemigroup of such that since is a homomorphism of onto and is fundamental, we have
It now follows from (a) that maps into . □
From Theorems 6.2 and 6.5 we notice that is an isomorphism if and only if is a bijection. A similar characterization of isomorphisms in terms of is not possible since, need not be a surjection when is a surjection. This is true for a limited class of fundamental semigroups.
Theorem 6.6. Let be a bimorphism of into . For every -chain in , define by
(6.7) |
where . Then is a homomorphism of into and is injective (surjective) if and only if is injective (surjective).
Proof. Let be a -chain in and define by
(6.8) |
Then clearly
(6.9) |
We now prove that is compatible with which will imply that .
Since and , axiom (c1) is clearly satisfied. Axiom (c2) follows from the definition of itself.
Let , and suppose that . Then by 3.2 we have
Consequently
But by definition of
and . Thus
and
The same equality can be proved when . Hence satisfies (c3) and we conclude that is compatible with .
By Theorem 6.2, is injective if and only if is injective. If is surjective, clearly is also surjective. On the other hand, if is surjective, by Theorem 6.5(b),
and hence . But clearly maps into and therefore . Thus is surjective and hence by Theorem 6.5(a), is surjective. □
Remark 6.7: It is clear that the partial groupoids of idempotents of and are isomorphic if and only if is isomorphic to (as biordered sets). Hence the statement that is an isomorphism if and only if has this property is essentially equivalent to Corollary 17 of [5].
Proof. By Theorem 6.6, is a homomorphism of into and hence is a regular subsemigroup of . is therefore a biordered subset of . But by (4.6),
and hence is a biordered subset of . Since
and , we notice that
is a biordered subset of □
Remark 6.9: We have already noted that the restriction of a homomorphism to the set of idempotents of a regular semigroup is a bimorphism (Theorem 4.10). Theorem 6.6 shows that the converse of this is also true (ie., every bimorphism extends to a homomorphism of a regular semigroup). Just as biordered sets are charecterized as idempotent sets of regular semigroup, these results show that bimorphisms may be characterized as those mappings of biordered sets that extend to homomorphisms.
up | next | prev | ptail | top |