Restriction semigroups and λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-Zappa-Szép products

The aim of this paper is to study λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-semidirect and λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-Zappa-Szép products of restriction semigroups. The former concept was introduced for inverse semigroups by Billhardt, and has been extended to some classes of left restriction semigroups. The latter was introduced, again in the inverse case, by Gilbert and Wazzan. We unify these concepts by considering what we name the scaffold of a Zappa-Szép product S⋈T\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S\bowtie T$$\end{document} where S and T are restriction. Under certain conditions this scaffold becomes a category. If one action is trivial, or if S is a semilattice and T a monoid, the scaffold may be ordered so that it becomes an inductive category. A standard technique, developed by Lawson and based on the Ehresmann-Schein-Nambooripad result for inverse semigroups, allows us to define a product on our category. We thus obtain restriction semigroups that are λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-semidirect products and λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-Zappa-Szép products, extending the work of Billhardt and of Gilbert and Wazzan. Finally, we explicate the internal structure of λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-semidirect products.


Introduction
The techniques of decomposing semigroups into direct, semidirect or Zappa-Szép products, are now well established. McAlister [17,18] demonstrated the utility of semidirect products in understanding inverse semigroups, results subsequently extended by a number of authors to the broader context of (left) restriction semigroups. Zappa-Szép products were introduced by Zappa [22] and after being widely developed in the context of groups (see for example Szép [20]) were applied to more general structures by Kunze [12] and Brin [4], who used the term Zappa-Szép product. As shown in [12] and explicated in [6], Zappa-Szép products are closely related to the action of Mealy machines (automata with output depending on input and current state). The concept being so natural, a number of other names have been used, in particular that of general product [13]. Such constructions may be approached from two directions: internal and external. We focus largely on the second in this article, but the two are closely related, as is well established.
For the convenience of the reader, we now give the relevant definitions, before outlining the direction of this article. A semigroup T is said to act on the left of a set S if there is a map T × S → S where (t, s) → t · s, such that for all s ∈ S, t, t ∈ T we have t · (t · s) = (tt ) · s. Clearly the action of T induces a morphism from T to T * S , the (dual of) the full transformation monoid on S. If S is a semigroup and for all s, s ∈ S and t ∈ T we have t · (ss ) = (t · s)(t · s ), that is, the morphism T → T * S is into the endomorphism monoid End S of S, then we naturally say that T acts by endomorphisms. and is called an (external) semidirect product of S by T .
If T is a monoid with identity 1 T acting on S then we normally insist that 1 T · s = s for all s ∈ S; where necessary we will emphasise this by saying that T acts monoidally. Definition 1.2 Let S and T be semigroups and suppose that we have maps T × S → S, (t, s) → t · s and T × S → T, (t, s) → t s such that for all s, s ∈ S, t, t ∈ T : (ZS1) tt · s = t · (t · s); (ZS3) (t s ) s = t ss ; (ZS2) t · (ss ) = (t · s)(t s · s ); (ZS4) (tt ) s = t t ·s t s .
Define a binary operation on S × T by (s, t)(s , t ) = (s(t · s ), t s t ).
Then S × T is a semigroup, referred to as the (external) Zappa-Szép product of S and T and denoted by S T .
In Definition 1.2 (ZS1) and (ZS3) are simply saying that S and T act on each other. Notice that a semidirect product S T (respectively, reverse semidirect product S T ) is merely a Zappa-Szép product S T in which the action of S on T (respectively, of T on S) is trivial, that is, t → t s = t (respectively, s → t · s = s) for all s ∈ S, t ∈ T . If both actions are trivial then we obtain the (external) direct product semigroup S × T .
Restriction semigroups are a variety of biunary semigroups, naturally extending the class of inverse semigroups. Our broad aim is to study restriction semigroups using semidirect and Zappa-Szép products. It is known that the former works reasonably well if one component is a semilattice [5]. However, difficulties arise in the general case even for inverse semigroups: the semidirect product of two inverse semigroups is not inverse in general. Billhardt showed how to modify the definition of a semidirect product of two inverse semigroups to obtain what he termed as a λ-semidirect product [1]. The λ-semidirect product of two inverse semigroups is again inverse. This result was generalised to the left ample case, again by Billhardt, where one component is a semilattice [2] (with an indication that the same should work for any two left ample semigroups). The case where S is a semilattice and T is weakly left ample (a left restriction semigroup with E T = E(T )) was considered in [7] and a subsequent extension of the techniques of [7] appear in [3].
In view of the above, it is clear that the Zappa-Szép product of two inverse semigroups is not inverse in general. Gilbert and Wazzan generalised Billhardt's concept of λ-semidirect product to what they named as λ-Zappa-Szép products [6,21]. Their approach is to pick out a subset of a Zappa-Szép product S T of inverse semigroups S and T and to show that with the restriction of the binary operation in S T the given subset is a groupoid. We refer to it here as the scaffold of S T . In the special case where S = E is a semilattice and T = G is a group, E G may be ordered such that it becomes an inductive groupoid. An application of the Ehresmann-Schein-Nambooripad Theorem [15,Theorem 4.1.8] results in an inverse semigroup.
Our article puts the work of Billhardt on λ-semidirect products, and that of Gilbert and Wazzan on λ-Zappa-Szép products, into the broader context of restriction semigroups. Note that even in the case for semidirect products with one component a semilattice, the arguments for two-sided restriction semigroups differ from those in the one-sided case. We also outline a number of examples, in Sects. 4 and 6, of Zappa-Szép products, that we believe to be of some independent interest.
In Sect. 2 we give the necessary preliminaries, including the result of Lawson [14] generalising the Ehresmann-Schein-Nambooripad Theorem, showing that the category of restriction semigroups and appropriate morphisms is isomorphic to a certain category of inductive categories. In Sect. 3 we consider restriction semigroups S and T and a Zappa-Szép product S T satisfying a number of extra conditions; in particular, S and T must act on each other on both sides in a way we name a double action. Note that all of these conditions are satisfied automatically if S and T are inverse. We define a subset V (S T ), the scaffold of S T , and show that under the restriction of the binary operation of S T we have a category. Sections 5 and 6 use the notion of scaffold in two different ways. In Sect. 5 we consider the case where one action is trivial. In this case, we can order V (S T ) so that it becomes and inductive category. According to Lawson's result, we then obtain a restriction semigroup. We show that the multiplication coincides with that in the previous case of a λ-semidirect product. In Sect. 6 we again show that V (S T ) is inductive, this time for a Zappa-Szép product where S is a semilattice and T a monoid. The resulting restriction semigroup has a multiplication corresponding to that in [6] in case T is a group. We therefore refer to it as a λ-Zappa-Szép product of S and T . In our final section we begin the investigation of the structure of restriction semigroups obtained as λ-semidirect products; they contain a 'core', that is, they have a restriction subsemigroup that is a strong semilattice of restriction semigroups that are isomorphic to restriction subsemigroups of S. On this core T acts in a way reflecting the original action on S.

Restriction semigroups and categories
Restriction semigroups and their one-sided versions arise from two rather distinct viewpoints, as algebraic models of partial mappings and as the setting for generalised Green's relations.
A left restriction semigroup S is a unary semigroup (S, · , + ), that is, a semigroup equipped with an additional unary operation s → s + , such that the following identities hold: x + x = x, x + y + = y + x + , (x + y) + = x + y + and x y + = (x y) + x.
Putting E S = {a + : a ∈ S}, it is easy to see that E S is a semilattice, the semilattice of projections of S.
For any set X the partial transformation semigroup PT X becomes left restriction under the map α → α + , where α + is the local identity on dom α. The semilattice of projections of PT X consists of the local identity maps of X , and thus is isomorphic to the semilattice of subsets of X under intersection. Moreover, any left restriction semigroup S embeds into PT S [10,Theorem 3.9]. If S is inverse, then defining a + = aa −1 , it is easy to see that S is left restriction. It follows from the the Wagner-Preston representation theorem that the embedding of S into PT S has image contained in the symmetric inverse semigroup I S . An example of a left restriction semigroup of quite another ilk is obtained from any monoid M: put a + = 1 for all a ∈ M. In this case the semilattice of projections is trivial; any left restriction semigroup with trivial semilattice of projections is said to be reduced.
Dually, a right restriction semigroup is a unary semigroup (S, · , * ) satisfying the dual of the above identities. A restriction semigroup S = (S, · , + , * ) is a biunary semigroup (that is, a semigroup equipped with two unary operations) such that (S, · , + ) is left restriction, (S, · , * ) is right restriction and the linking identities (x + ) * = x + and (x * ) + = x * hold. It follows that the semilattices of projections of S regarded as a left or as a right restriction semigroup coincide. As above, it is clear that inverse semigroups become restriction under the operations a → a + = aa −1 and a → a * = a −1 a. Moreover, reduced restriction semigroups, that is, restriction semigroups with trivial semilattices of projections, directly correspond to monoids.
A partial order on a left restriction semigroup S is defined by the rule for any a, b ∈ S a ≤ b if and only if a = eb for some e ∈ E S .
Clearly, ≤ restricts to the standard order on the semilattice E S . It is easy to see that a ≤ b if and only if a = a + b. In the case that S is restriction, this definition is left right dual, that is, a ≤ b if and only if a = b f for some f ∈ E S . Moreover, ≤ is compatible with all the basic operations of S. We therefore refer to ≤ as the natural partial order on S. Suppose now that T is a semigroup acting on the left of a semigroup S. If S is left restriction and the morphism T → T * S is into the semigroup of endomorphisms of S as a unary semigroup, then we may emphasise this by saying that T acts on S by left restriction endomorphisms or by restriction endomorphisms if the context is clear. The corresponding definition holds if S is restriction.

Lemma 2.1 Let T be a semigroup acting on the left of a left restriction semigroup S by restriction endomorphisms. Then the action of T preserves ≤ on S (and hence on E S ).
Proof Let a, b ∈ S and t ∈ T and let a ≤ b. Then a = a + b, so that As remarked in the Introduction, restriction semigroups may be obtained from inductive categories. We explain this connection by first giving the definition of a category convenient for our purpose.
Let C be a set and let · be a partial binary operation on C. For x, y ∈ C, whenever we write '∃ x · y', we mean that the product x · y is defined, so that when we will write '∃ (x · y) · z', it will be understood that we mean ∃ x · y and ∃ (x · y) · z. We say that an element e ∈ C is idempotent if ∃ e · e and e · e = e. If e is an idempotent of C which satisfies: then we say that e is an identity for C and we call this identity a local identity for C.
where · is a partial binary operation on C and d, r : C → C such that (C1) ∃ x · y if and only if r(x) = d(y) and then d(x · y) = d(x) and r(x · y) = r(y); It follows from the axioms that E C = {r(x) : x ∈ C} and C is a small category in the standard sense with set of local identities E C and set of objects identified with E C . Further, d(x) is the domain of x and r(x) is the range of x.
Small categories can be seen as generalisations of monoids as if C has precisely one object, then all products are necessarily defined and thus C is essentially a monoid. Correspondingly, if we define a groupoid to be a category C such that for every a ∈ C there exists a b ∈ C with a · b = d(a) and b · a = r(a), then a small groupoid with one object is a group.
We make it clear that whenever we write C = (C, · , d, r) for a category C, we mean that C is a small category, described as in Definition 2.2.
We now define what we mean by an ordering on our category C. Definition 2.3 Let C = (C, ·, d, r) be a category with set of local identities E C . Let ≤ be a partial order on C such that for all e ∈ E C , x, y ∈ C: then ∃ unique e |x ∈ C such that e |x ≤ x and d( e |x) = e; (IC4) if e ≤ r(x) then ∃ unique x| e ∈ C such that x| e ≤ x and r(x| e ) = e.
We then say that C = (C, ·, d, r, ≤) is an ordered category.
The element e |x of Condition (IC3) is called the restriction of x to e and the element x| e of Condition (IC4) is called the co-restriction of x to e. If C is an ordered category with set of local identities E C , then for e, f ∈ E C , we denote the greatest lower bound (meet) of e and f , where it exists, by e ∧ f .

Definition 2.4
Let C = (C, · , d, r, ≤) be an ordered category. Then C is an inductive category if (IC5) holds: Inductive categories correspond to restriction semigroups in a manner analogous to the correspondence, given by the Ehresmann-Schein-Nambooripad Theorem, between inverse semigroups and inductive groupoids. The latter result was generalised to restriction semigroups by Lawson [14] (though he used different terminology). Lawson's approach was made explicit for restriction semigroups in Hollings [9]. Conversely, let (C, · , d, r, ≤) be an inductive category. Then (C, ⊗, d, r) is a restriction semigroup where ⊗ is given by Moreover, the ordering ≤ from the category coincides with the natural partial order of the restriction semigroup and ⊗ coincides with · whenever it is defined.
The operation ⊗ in Theorem 2.5 is called a pseudoproduct.

The scaffold of a Zappa-Szép product of restriction semigroups
As commented earlier, a Zappa-Szép product S T of inverse semigroups S and T need not be inverse. Inspired by the work of Billhardt for semidirect products, Gilbert and Wazzan pick out a partial subalgebra of S T , and show that it is a groupoid. We refer to this groupoid as the scaffold of S T . We outline their approach, and then explain how to put it into the wider context of restriction semigroups.  Gilbert and Wazzan note that, in general, E B (Z ) does not form a semilattice under the partial order of idempotents inherited from the multiplication in Z . They proceed to specialise to the case where S = E is a semilattice and T = G is a group.

Theorem 3.2 [21, Proposition 4.5.19] Let Z = E
G where E is a semilattice and G is a group. Then B (Z ) = {(e, g) ∈ E × G : (g −1 ) e = g −1 } and has set of local identities

Restrictions and corestrictions are given by
The inverse of (e, g) simplifies to (g −1 · e, g −1 ).
Our aim is to extend the above ideas to Zappa-Szép products of restriction semigroups. To this end, we need a notion of double action, already apparent from the study of semidirect products of restriction semigroups [5].

Definition 3.3 Let S and T be restriction semigroups and suppose that S acts on the right of T and T acts on the left of S. We say that S and T act doubly on each other if in addition S acts on the left of T and T acts on the right of S via
such that the actions satisfy the following compatibility conditions: Consider a Zappa-Szép product Z = S T of two restriction semigroups S and T where S and T act doubly on each other. Let We first prove that if S and T are inverse semigroups and are regarded as restriction semigroups in the usual way, then with a canonical approach to the secondary actions, we have B (Z ) = V (Z ).

we have that S and T act doubly on each other. Moreover, B (Z ) = V (Z ).
Proof It is clear from the fact that a → a −1 is an involution for any inverse semigroup that the given maps are actions. Moreover, it is easy to check that (CP1) and (CP2) are satisfied, so that S and T indeed act doubly on each other. By definition Hence tt −1 · a −1 = a −1 . By left-right duality we must also have (t −1 ) a −1 a = t −1 . It follows that (a, t) ∈ B (Z ), so that V (Z ) ⊆ B (Z ) and equality follows.
The following lemma was an important tool in the proof that B (Z ) is a groupoid.

Lemma 3.5 [21, Lemma 4.5.2] Let S and T be inverse semigroups and Z = S
T be a Zappa-Szép product of S and T .
T be a Zappa-Szép product of two restriction semigroups S and T where S and T act doubly on each other. We define: and The result of the following lemma was used frequently in [21] to prove that B (Z ) is a groupoid. As it was not stated explicitly, we prove it now for completeness. The key is Lemma 3.5.

Lemma 3.6 Let S and T be inverse semigroups and Z = S
T be a Zappa-Szép product of S and T . Then (D1) and (D2) are satisfied, that is: Further, (D3) and (D4) are satisfied, that is: Thus (D1) and dually, (D2) hold.
We have not been able to show Conditions (D1)-(D4) hold for arbitrary Zappa-Szép products of restriction semigroups acting doubly on each other. We will see, however, that they do so in a variety of cases upon which we will expand later in the article. For the moment we must impose them to proceed to find a suitable scaffold below.

Theorem 3.7 Let S and T be restriction semigroups and suppose that Z = S T is the Zappa-Szép product of S and T where S and T act doubly on each other satisfying
Then V is a category under the restriction of the binary operation in Z where d(a, t) = (a + , a t + ) and r(a, t) = (a * • t, t * ).

The set of local identities is given by
Proof We first note that for any Now we prove some preliminary results needed to show that V is a category. (1) and (2) proved above , we have that t Conditions (6), (7) and (8) are dual of (3), (4) and (5), respectively. Now we continue with the proof of Theorem 3.7. We first check that · is a closed partial binary operation. For this let (a, t), We calculate (3) and (6)) Also, as (a, t) ∈ V and using (CP2) Together with the dual arguments, we have shown ( Next for e ∈ E S and f ∈ E T , we show that and by our assumption, a t + ∈ E T . Thus to show that d(a, t) ∈ V , we need only to show that ( a t + ) a + = a t + and a t + ·a + = a + . We see that so that a t + · a + = ( a t + · a) + = a + , using (D1). Dually, r(a, t) = (a * • t, t * ) ∈ V . Next we see that and We show below that V is a category, and it will follow that E V is as given in the statement of the theorem.
(C2) This directly follows from (C1) and the fact that multiplication is associative in a Zappa-Szép product.

Examples
This section presents a number of examples of Zappa-Szép products. The details of the verifications are left to the reader. [23,Chap. 4] This example is inspired by the corresponding example for inverse semigroups given in [6]. Let S be a left restriction semigroup with semilattice of projections E. It is easily checked that we have actions Example 4.2 A link is known between Zappa-Szép products and self-similar group actions [8] which provides some of the motivation for the approach of [16]. This idea may be extended from groups to monoids, as we now briefly explain. Let T be a k-regular rooted tree. The vertices of T may be labelled in a natural way by the elements of a free monoid X * on k generators, with the root labelled by . The elements of the monoid T T of endomorphisms of T (where here we compose right-to-left) may be identified with certain length-preserving elements of the full transformation monoid T X * .
For any w ∈ X * , the right ideal w X * labels the vertices of a subtree of T with root w. Moreover, the map X * → X * , where v → wv, corresponds to an isomorphism of T onto the subtree with vertices in w X * . It follows that if ϕ ∈ T T and x ∈ X , then ϕ x ∈ T T , where for all v ∈ X * , ϕ x (v) = (ϕ(x)) −1 ϕ(xv), the multiplication being taken in the free group on X . This gives, in a natural way, an action of the free monoid X * on the right of T T . On the other hand, T T acts on the left of X * by mappings, i.e. ϕ · w = ϕ(w). Using an inductive argument, one can show that (ZS2) and (ZS4) hold and further, (ZS5)-(ZS8) also hold. Thus we may form the monoidal Zappa-Szép product X * T T , which contains as a submonoid the Zappa-Szép product X * S T , where S T is the automorphism group of T. Lawson explains in [16] that Perrot's work [19] characterises the structure of Zappa-Szép products of X * with a group as what he calls left Rees monoids. Example 4.3 Let X be a set and let S = T = P(X ) be the power set of X , under the operation of union. Then S = T is a semilattice and so certainly inverse. For convenience we keep the separate labels S and T . We define two actions One can check that (ZS1)-(ZS4) hold and thus Z = S T is a Zappa-Szép product. Since S and T are inverse, Lemmas 3.4 and 3.6 give that all the conditions for Theorem 3.7 hold.
Example 4.4 Let X be a non empty set. For notational convenience we let T = PT X be the partial transformation monoid on X (with composition right-to-left) and let E = FSL(X ) be the free semilattice monoid on X , that is, E is the set of finite subsets of X under union. We define actions T is a Zappa-Szép product. However, regarding T as a reduced restriction monoid, in order for T to act doubly on E, we would need that the action be via bijections, which it is clearly not.
We may amend this example slightly by replacing PT X with the symmetric inverse monoid I X on X . We define Noticing that the action of I X on E is the restriction to I X of that of PT X , it is clear that the Zappa-Szép axioms hold. Since E and T are inverse, the same remarks apply as in Example 4.3.

λ-semidirect product of restriction semigroups
As mentioned in the Introduction, a semidirect product of inverse semigroups need not be inverse. To counter this, Billhardt [1] introduced the notion of a λ-semidirect product S λ T of inverse semigroups S and T , which has subsequently been extended as far as the case for left restriction semigroups in which one component is a semilattice. For completeness, we first give the following result, concerning the case where both components are left restriction, with no further conditions applied. Since we are primarily interested in the two-sided case in this article, we leave some details to the reader.

Proposition 5.1 Let S and T be left restriction semigroups such that T acts on S on the left by restriction endomorphisms. Then
and (a, t) + = (a + , t + ).
Proof Let (a, t), (b, u) ∈ S λ T . To show that (a, t)(b, u) ∈ S λ T , we see that Thus multiplication is closed. Now to check associativity, let (a, t), (b, u), (c, v) ∈ S λ T . Then, again using the above identity, and the fact that the identity x + (x y) + = (x y) + holds in any left restriction semigroup, we have: Thus the associative law holds and hence S λ T is a semigroup. It is a straightforward exercise to show that with + as defined, S λ T is left restriction.
The semigroup S λ T is called the λ-semidirect product of S and T . Recall that we may regard a monoid as a reduced left restriction semigroup. Notice that if T is a monoid, and acting as such (that is, 1 T · u = u for all u ∈ S), then the λ-semidirect product of S and T is simply the semidirect product.
Suppose now that we begin with restriction semigroups S and T . Even in the case where T is a monoid, the (λ−)semidirect product S T need not be restriction. It was this that prompted the introduction in [5] of the notion of a double action, in order to determine the structure of free ample monoids.

Definition 5.2 Let S and T be restriction semigroups. Then T acts doubly on S if T acts on the left and on the right of S satisfying (CP1).
The above definition is consistent with Definition 3.3, since if S acts trivially on T , then clearly (CP2) holds. The following is easy to check.

Lemma 5.3 Let S and T be restriction semigroups such that T acts doubly on S via restriction endomorphisms. With the trivial action of S on the left and right of T , conditions (D1)-(D4) hold.
Let T be a restriction semigroup and let S = E T = E. Suppose T acts on the left and right of S by t · e = (te) + and e • t = (et) * . It is shown in [5] that T acts on E by morphisms. We check that (CP1) holds. For this let t ∈ T and e ∈ E, then (t ·e)•t = (te) + •t = ((te) + t) * = (te) * . Also e • t * = (et * ) * = (t * e) * = (te) * and t * · e = (t * e) + = ((te) * ) + = (te) * . Hence we see that (t · e) • t = e • t * = t * · e. Dually, it is easy to check that t · (e • t) = e • t + = t + · e and hence (CP1) holds.

Theorem 5.4 Let S and T be restriction semigroups such that T acts doubly on S via restriction endomorphisms. Let Z = S T and put
Then C = (C, · , d, r) is a category under the restriction of the binary operation in Z where d(a, t) = (a + , t + ) and r(a, t) = (a * • t, t * ).

The set of local identities is
Proof Since the action of T on S preserves * , we have in particular that t + · a * = (t + · a) * , for all t ∈ T and a ∈ S. It follows that as in Theorem 3.7. The result now follows from that theorem.
In this case, where the action of S on T is trivial, we can order our category C, so that it becomes inductive.

Theorem 5.5 Let S and T be restriction semigroups such that T acts doubly on S via restriction endomorphisms. Let
A partial order ≤ on C is defined by is an inductive category under the restriction of the binary operation in S T where d(a, t) = (a + , t + ) and r(a, t) = (a * • t, t * ).

The set of local identities is
and restriction and co-restriction are given by r(a, t).
Proof From Theorem 5.4, we know that C is a category. We now show that C is inductive under the given relation.
We first check that ≤ is a partial order. It is clear that ≤ is reflexive. Let (a, t), (b, u) ∈ C and suppose that (a, t) ≤ (b, u) and (b, u) ≤ (a, t). Then a ≤ t + · b , t ≤ u and b ≤ u + · a , u ≤ t. By antisymmetry of the natural partial order we have t = u, and so a ≤ t + · b = u + · b = b. By symmetry b ≤ a and so a = b. Thus (a, t) = (b, u) and hence ≤ is antisymmetric.
Next let (a, t), (b, u), (c, v) ∈ C be such that (a, t) ≤ (b, u) and (b, u) ≤ (c, v). Then a ≤ t + · b, t ≤ u and b ≤ u + · c, u ≤ v. Clearly t ≤ v and using Lemma 2.1 Thus (a, t) ≤ (c, v) and hence ≤ is a partial order on C.
We now check that the conditions hold for C to be an ordered category. (IC1) Let (a, t), (b, u) ∈ C and let (a, t) ≤ (b, u). Then a ≤ t + · b and t ≤ u.
To show that d(a, t) ≤ d(b, u), we see that a + ≤ (t + · b) + = t + · b + and also t + ≤ u + .  Thus d(a, t) ≤ d(b, u). Next to show that r(a, t) ≤ r(b, u), we need to check that a * • t ≤ t * · (b * • u) and t * ≤ u * . We have Suppose also ∃ (a, t) · (c, v) and ∃ (b, u) · (d, p) in C . Then r(a, t) = d(c, v) and r( using the left ample condition and so a(t · c) ≤ (tv) (IC3) Let ( f · e, f ) ∈ E C and (a, t) ∈ C be such that ( f · e, f ) ≤ d(a, t) = (a + , t + ) so that f · e ≤ f · a + and f ≤ t + .
We show that ( f · ea, f t) is the unique element of C such that We first check that ( f · ea, f t) ∈ C. For this we see that Clearly f t ≤ t and Thus ( f · ea, f t) ≤ (a, t). Also Next suppose that (c, s) is another element such that (c, s) ≤ (a, t) and d(c, s) = ( f · e, f ).
, t f is the unique element such that As T acts by morphisms, we see that and so ((t f ) + · a)(t f · e), t f ∈ C. Now t f · e ∈ E S and so ≤ (a, t).
Clearly (t f ) * = f and Next, suppose that (c, n) is another element such that (c, n) ≤ (a, t) and r(c, n) = ( f · e, f ), so that c ≤ n + · a , n ≤ t , c * • n = f · e and n * = f . Then n = t f and c ≤ n + · a implies c = (n + · a)c * = ((t f ) + · a)c * . Now Hence ((t f ) + · a)(t f · e), t f is the unique element such that t f ≤ (a, t) and r ((t f ) + · a)(t f · e), t f = ( f · e, f ).
(IC5) To show that (E C , ≤) is a meet semilattice, let ( f · e, f ), (h · g, h) ∈ E C . An easy calculation gives that ( f h · (eg), f h) ∈ E C and is the greatest lower bound of ( f · e, f ) and (h · g, h). Thus ( f · e, f ) ∧ (h · g, h) exists and equals ( f h · (eg), f h).
We have now verified all the axioms to yield that C = (C, · , d, r, ≤) is an inductive category.
We now consider the pseudo-product on C and show that it coincides with that in Billhardt's λ-semidirect product as in the case for left restriction semigroups.

Theorem 5.6 Let S and T be restriction semigroups such that T acts doubly on S via restriction endomorphisms. Let
Then S λ T is a restriction semigroup with multiplication given by   (a, t) For any (a, t) ∈ S λ T we have (a, t) + = (a + , t + ) and (a, t) * = (a * • t, t * ). The natural partial order is given by u) if and only if a ≤ t + · b and t ≤ u.
Proof By Theorems 2.5 and 5.5, we need only show that the pseudo-product of the category C of Theorem 5.5 is given by the formula above. To this end, let (a, t), (b, u) ∈ S λ T . We first compute r(a, t) ∧ d(b, u). We have

λ-Zappa-Szép product of a semilattice and a monoid
Let S and T be restriction semigroups acting doubly on each other, satisfying (D1)-(D4). We would like to determine how to put a multiplication on the scaffold V (S T ) of the Zappa-Szép product in Theorem 3.7, thus extending the notion of λ-semidirect product. In the inverse case, Gilbert and Wazzan [6,21] succeeded in doing so where S is a semilattice and T a group. We extend this to the case where S is a semilattice and T is a monoid, regarded as a reduced restriction semigroup. First, we recall the result in the inverse case.
is an inverse semigroup with multiplication defined by We use the symbol ⊗ for the binary operation above since in [21] Theorem 6.1 is proved by showing that B (Z ) can be endowed with an order so that it becomes an inductive groupoid; ⊗ is the corresponding pseudoproduct.
An inverse semigroup B (Z ) as in Theorem 6.1 is referred to as a λ-Zappa-Szép product of E and G.
Suppose now that E T is a Zappa-Szép product of a semilattice E and a monoid T .

Note that E and T act doubly on each other if and only if there is an action
for all e ∈ E and t ∈ T ; the left action of E on T is perforce the same as the right action. Notice that (CP3) is simply saying that the action of T on the left of E is by bijections. It is convenient, however, to retain the notation for a right action of T . We suppose that (ZS7) holds. If (D2) holds, then for any e ∈ E we have 1 = (1 e ) + = 1 1·e = 1 e , so that (ZS8) holds. Conversely, if (ZS8) holds, then (D1)-(D4) are easily seen to be true. We therefore suppose that (ZS7) and (ZS8) hold. Clearly the description of V = V (E T ) simplifies to We now prove that, in this special case, V can be made into an inductive category if the extra condition holds, for all e, f ∈ E and t ∈ T . Notice that from [6, Lemma 3.1], this is automatically true if T is a group.  1) ≤ r( f, t), the co-restriction is given by · e), t e ).

Theorem 6.2 Let E T be a Zappa-Szép product of a semilattice E and a monoid T such that T acts by bijections and (ZS7), (ZS8) and (D5) hold. Let
Proof From Theorem 3.7, V is a category with set of local identities E V = {(e, 1) : e ∈ E S } where d(e, t) = (e, 1) and r(e, t) = (e • t, 1). We notice that for (e, 1), Before giving the proof of Theorem 6.2, we record some preliminary computations.
Suppose e ≤ f . Then e = e f , so that and hence t · e ≤ t · f .
We now continue the proof of Theorem 6.2 by showing that V is an inductive category. First we prove that ≤ is a partial order. It is clear that ≤ is reflexive. Let (e, s), ( f, t) ∈ V and suppose that (e, s) ≤ ( f, t) and ( f, t) ≤ (e, s). Then e ≤ f ≤ e implies e = f and s = t e•t = t f •t = t. Hence ≤ is antisymmetric.
To check transitivity, let (e, s), ( f, t), (g, u) ∈ V and suppose that (e, s) ≤ ( f, t) and ( f, t) ≤ (g, u). Then e ≤ f ≤ g, s = t e•t and t = u f •u . Now e ≤ f ≤ g implies that e ≤ g and Hence (e, s) ≤ (g, u) and thus ≤ is a partial order on V .
We now show that V satisfies the axioms of an inductive category.

Clearly d(e, t e•t ) = (e, 1) and (e, t e•t ) ≤ ( f, t).
We show that (e, t e•t ) is the unique element with these properties. Let (g, u) be another element such that (g, u) ≤ ( f, t) and d(g, u) = (e, 1). Then g ≤ f, u = t g•t and (g, 1) = (e, 1). Thus g = e and u = t g•t = t e•t . Hence (e, t e•t ) has the required properties.
We first check that ( f (t ·e), t e ) ∈ V . First we notice that as e ≤ f •t, so t ·e ≤ t ·( f •t) = f , by Lemma 6.3 (3). Next we see that •t e since t e · e = t · e by(D5) = (t e ) e = t e using (CP3).
Next to prove the uniqueness of ( f (t · e), t e ), let (g, u) be another element in V such that (g, u) ≤ ( f, t) and r(g, u) = (e, 1). Then g ≤ f, u = t g•t and g • u = e. Now and u = t g•t = t g•u = t e . Hence ( f (t · e), t e ) is the unique element with the required properties.
Hence V is an inductive category with restriction and co-restriction as given.
Next we define a pseudo-product on our inductive category to obtain a restriction semigroup. Thus

Theorem 6.4 Let E T be a Zappa-Szép product of a semilattice E and a monoid T such that T acts by bijections and (ZS7), (ZS8) and (D5) hold. Let
because t f •t = t. Remark 6.5 If E G is a Zappa-Szép product of a group G with a semilattice E, then (ZS7) (in our notation) is easily seen to imply that (ZS8) holds (indeed, we only require the unipotency of G here). It follows that, in view of Lemmas 3.4 and 3.6, Theorem 6.1 is an immediate specialisation of Theorem 6.4 to the inverse case.
We now construct examples in which we show that all the conditions of Theorems 6.2 and 6.4 hold. To construct these examples we utilise our knowledge that if Z = E G is a Zappa-Szép product of a semilattice and a group G such that (ZS7) holds, then so do (ZS8) and (D5).

Example 6.6 Let S
T be a Zappa-Szép product of monoids S and T . Suppose that U = T V = T V is a monoid semidirect product of T and a monoid V (certainly such U can be found -one needs only to consider forming direct products). Define actions It is straightforward to check the Zappa-Szép axioms (ZS1)-(ZS4) hold. Hence Z = S U is Zappa-Szép product of S and U .
Suppose now that in the above, S = E is a semilattice and T = G is a group and suppose that (ZS7) holds for the action of G on E. For examples of such, we refer the reader to [6]. Next we suppose that U = GV as above. It is then easy to check that U acts by bijections, and (ZS7), (ZS8) and (D5) hold for E U . Thus all the conditions of Theorems 6.2 and 6.4 hold.
For details of our final example, we refer the reader to [11]. Example 6.7 Let S be an ample monoid which is perfect. Consequently, every σ -class [s] (where σ is the least congruence identifying the projections) has a greatest element m s and for all s, t ∈ S we have m s m t = m st . Suppose in addition that G = S/σ is a group: for example, this will happen if S is finite.
Now let E be a semilattice and E G a Zappa-Szép product such that (ZS7) holds. We define One may verify that these actions satisfy the Zappa-Szép axioms and that all conditions of Theorem 6.2 hold for this Zappa-Szép product.

Internal structure of S λ T
Let S and T be (left) restriction semigroups such that T acts on S satisfying the conditions required to build the (left) restriction semigroup S λ T . What characterises the structure of S λ T ? This is known in some special cases (see, for example, [1][2][3]), where S is a semilattice. The same question could be asked for a restriction semigroup of the form S T , where S is a semilattice and T a monoid. Even in the case where T is a group, so that the latter semigroup is inverse, the connection between its internal structure and that of the constituent components T and S is a little mysterious. In this section we begin to consider these questions, by examining the structure of S λ T in the one-and two-sided cases.
Throughout this section, let S and T be left restriction semigroups such that T acts on S on the left by left restriction endomorphisms. From Theorem 5.1 we know that and (a, t) + = (a + , t + ). If, in addition, S and T are restriction, we suppose that T acts doubly on S via restriction endomorphisms. From Theorem 5.6, S λ T is then restriction, where (a, t) * = (a * • t, t * ).
Let θ : S λ T → T be defined by (a, t)θ = t. Then K e and K are (left) restriction subsemigroups of S λ T .
Proof In view of the given operations in S λ T , we need only show that θ is onto. Let t ∈ T . Then for any a ∈ S we have (t + · a, t) ∈ S λ T , and (t + · a, t)θ = t.
The semigroup K plays an important role in what follows. Essentially, if forms a 'core' of S λ T on which T acts by restriction endomorphisms -on the left in the one-sided case and on both sides and doubly in the two-sided case.

Lemma 7.2 The left restriction semigroup T acts on the left of S
such that T · (S λ T ) ⊆ K , and the restriction of the action of T to K is by left restriction endomorphisms.
If S and T are restriction, then in addition T acts on the right of S λ T preserving * via In this case we further have that (S λ T ) • T ⊆ K , the restriction of the actions of T to K is by restriction endomorphisms, and T acts doubly on K .
Proof To see that the actions are well-defined, let (a, u) ∈ S λ T and t ∈ T . As T is left restriction, In the two sided case, It is easy to check that T acts on S λ T with image contained in K and that the left and right action of T preserves + and * , respectively. Straightforward (but long) calculations give that the restriction of these actions to K are by restriction morphisms.
In the two-sided case, we now check that T acts doubly on K . To this end, let (a, e) ∈ K , t ∈ T and f ∈ E T . It is easy to see that f · (a, e) = ( f · a, f e) = (a • e f, e f ) = (a, e) • f.
On the other hand, In fact the relation between K and the left action of T is very rich. It is clear that K is a semilattice E T of the (left) restriction semigroups K e , e ∈ E T . Moreover, it is a strong semilattice with connecting morphisms ψ e, f for e f given by (a, e)ψ e, f = f · (a, e) = ( f · a, f ).
We now define ψ : K → S by (a, e)ψ = a and for any α ∈ S λ T we let α ∈ K be given by Clearly if αψ = βψ and αθ = βθ, then α = β. The next lemma is easily verified.
We begin with the one-sided case.
Theorem 7.4 Let Z, S and T be left restriction semigroups and suppose there is a left restriction epimorphism θ : Z → T . Let K = K (Z) = E T θ −1 and suppose there is a surjection ψ : K → S. Suppose also that T acts on the left of Z preserving + such that T · Z ⊆ K and T acts by left restriction endomorphisms on K . Further, we assume the restriction of ψ to any K e = K e (Z) = eθ −1 , e ∈ E T , is a left restriction morphism. For any α ∈ Z we let α ∈ K be defined by We suppose that (S1)-(S4) hold and if αψ = βψ and αθ = βθ, then α = β. Finally, we assume (U) : for any α, β ∈ K there exists e ∈ E T and α , β ∈ K e with αψ = α ψ and βψ = β ψ.
Then T acts on S on the left by left restriction endomorphisms, satisfying (U), such that Z is isomorphic to S λ T via αϕ = (αψ, αθ).
Conversely, if S and T are left restriction semigroups such that T acts on S by (left) restriction endomorphisms satisfying (U), then with Z = S λ T , we have that θ, ψ and the action of T on S λ T exists, satisfying the listed conditions.
Proof We have already shown the converse with the exception of the easily seen fact that (U) gives us (U) .
For the direct part, we assume the given conditions hold for Z, T and S. From (S1) we have α = α for any α ∈ K . As the restriction of ψ to each K e is a left restriction morphism, it follows that ψ preserves + .
Thus we have shown that T acts on S by left restriction endomorphisms.
With ϕ defined as above we have αϕ = (αψ, αθ). For any α ∈ Z we have (αθ ) + · αψ = ((αθ ) + · α)ψ = αψ, so that ϕ is well defined and is an injection into S λ T under the given conditions. Since the action of T and θ both preserve + it is easy to see that α + = α + and then since both ψ and θ preserve + we deduce that so does ϕ. Condition (S3) immediately gives that ϕ also preserves multiplication and hence is an embedding. Finally, (S4) guarantees that ϕ is onto.
We now consider the two sided version of Theorem 7.4. Theorem 7.5 Let Z, S and T be restriction semigroups such that, regarded as left restriction semigroups, the conditions of Theorem 7.4 hold. Suppose in addition that T acts on the right of Z preserving * such that Z • T ⊆ K , T acts doubly on K by restriction endomorphisms and (S5) and (S6) hold.
Then T acts doubly on S by restriction endomorphisms, satisfying (U), such that Z is isomorphic as a restriction semigroup to S λ T via αϕ = (αψ, αθ).
Conversely, if S and T are restriction semigroups such that T acts doubly on S by restriction endomorphisms satisfying (U), then with Z = S λ T , we have that θ, ψ and the actions of T on S λ T exist, satisfying the given conditions. Proof We need only prove the direct part. We assume the given conditions hold for Z, T and S and let the left action of T on S be as in Theorem 7.4. Define a map S × T → S by Since ψ is a surjection we have that the map is everywhere defined and it is well defined by (S5); as T acts on Z, it is easily seen to also be an action. That the right action preserves multiplication in S is similar to the proof for the left action in Theorem 7.4. It is then easy to show, as T acts doubly on K by restriction endomorphisms, that the same is true for the actions of T on S.
Theorems 7.4 and 7.5 are, as they stand, rather clumsy. The reader might hope that we would have a characterisation of S λ T involving an internal notion that replaces the use of ψ. Certainly, for any α, β ∈ S λ T we have that α = β if and only if α = β and αθ = βθ. We content ourselves here with the following observation in the special case that E T is updirected. In this case, for any e f we may define θ f,e : K f → K e by (a, f )θ f,e = (a, e), noting this is a well-defined morphism, and the collection of the restriction monoids K e , together with the morphisms θ f,e , e f , form a directed system. The direct limit of this system K / ∼ is isomorphic to S in a natural way. Thus conditions on ψ could be replaced by conditions on the direct limit, in particular, αψ = βψ if and only if α ∼ β, so that α = β if and only if α ∼ β and αθ = βθ.