Some algebraic structures on the generalization general products of monoids and semigroups

For arbitrary monoids A and B, in Cevik et al. (Hacet J Math Stat 2019:1–11, 2019), it has been recently defined an extended version of the general product under the name of a higher version of Zappa products for monoids (or generalized general product) $$A^{\oplus B}$$

A

⊕
B


$$_{\delta }\bowtie _{\psi }B^{\oplus A}$$



δ


⋈
ψ


B

⊕
A



 and has been introduced an implicit presentation as well as some theories in terms of finite and infinite cases for this product. The goals of this paper are to present some algebraic structures such as regularity, inverse property, Green’s relations over this new generalization, and to investigate some other properties and the product obtained by a left restriction semigroup and a semilattice.


Introduction and preliminaries
The notion of Zappa-Szép products generalizes those of direct and semidirect products; the key property is that every element of the Zappa-Szép product can be written uniquely as a product of two elements, one from each factor, in any given order. In the literature, there are some key stone studies on the general product which is also referred as bilateral semidirect products (see [11]), Zappa products (see [7,12,16,18]) or knit products (see [1,14]). As a next step of general product, in [4], the same authors of this paper have recently introduced the generalization of the general product under the name of a higher version of Zappa products for monoids as in the following: For arbitrary monoids A and B, it is known that the A ×B denotes the Cartesian product of the number of B copies of the monoid A while the set A ⊕B denotes the corresponding direct product. Then a generalization of the general products (both restricted and unrestricted) of the monoid A ⊕B by the monoid B ⊕A is defined on A ×B × B ×A  Moreover, for all f, f ∈ A ⊕B and h, h ∈ B ⊕A , the following properties are satisfied: (1) It is easy to show that (both restricted and unrestricted) the generalized general product A ⊕B δ ψ B ⊕A is a monoid with the identity 1, 1 , where 1 : B −→ A, (b) 1 = 1 A and 1 : A −→ B, (a) 1 = 1 B , for all a ∈ A and b ∈ B. We note that throughout this paper all generalized general products will be assumed to be restricted. We also note that this above definition of the generalized general product should be considered as the external generalized general product as similar .
In the remaining parts of this paper, we will first investigate the isomorphism between the internal and external generalized general products as a generalization of the ordinary general products (in Sect. 2) and then using the result in this section, we will state and prove some results on regularity as well as inverse property (in Sect. 3). After that, in Sect. 4, we will study on Green's relations over this new generalization. Additionally, in Sect. 5, we will investigate some other properties while the generalized general product obtained by a left restriction semigroup and a semilattice.

Correspondence between internal and external cases
A monoid M is named as the internal Zappa-Szép product of two submonoids if every element of M admits a unique factorization as the product of one element of each of the submonoids in a given order. This definition yields actions of the submonoids on each other that must be structure preserving (see details, for instance, in [6]). In [17], the author made a detailed investigation between the internal and external Zappa-Szép products (or equivalently, general products) of any two monoids in terms of general products, and then presented some results dealing with the isomorphism of internal and external cases. Thus, it is natural to transfer these decompositions into the generalized general products. In fact, by taking into account the main result of this section (see Theorem 2.2 below) which is about the isomorphism between internal and external cases, we will state and prove the regularity over generalized general products of monoids in Sect. 3.
A simple calculation shows that the product A ⊕B δ ψ B ⊕A cannot be a group in general except the cases A is a group and B is the trivial group which is not useful for studying the group properties on it since it only becomes the group A up to isomorphism. However, by keeping our mind A and B are any monoids, we expect to obtain an equivalence between internal and external generalized general product as in the ordinary general product of monoids. To do that, we will present the following lemma and theorem which are the generalization of [ Proof Since M = A ⊕B B ⊕A , each element m ∈ M is uniquely expressible as m = f g with f ∈ A ⊕B and g ∈ B ⊕A . We must have unique elements g ∈ B ⊕A and f ∈ A ⊕B such that g f = f g . Writing f = g f and g = g f , we have mutual actions defined by the multiplication [3] for similar actions). Thus, these actions unique subject to the relation g f = ( g f ) g f which clearly gives ( f g) f g = f g f g f g for all f, f ∈ A ⊕B and g, g ∈ B ⊕A . Now, according to the associativity of the monoid M and the uniqueness property of the decomposition, we certainly obtain the properties p1 • -p4 • in (1) for these actions. In detail, by the associativity, we have g f f = (g f ) f that implies On the other hand, by uniqueness, we have Now, we can form the external generalized general product A ⊕B δ ψ B ⊕A of A ⊕B and B ⊕A . Let us define a map α : M −→ A ⊕B δ ψ B ⊕A by ( f g) α = ( f, g). Clearly α is well defined, one-to-one and onto. Since it is also a homomorphism. Hence, M ∼ = A ⊕B δ ψ B ⊕A , as required.
The following theorem is an extended version of Lemma 2.1.
Therefore, by uniqueness, the properties p5 • -p8 • are held as well. Thus we obtain the monoid A ⊕B δ ψ B ⊕A as the external generalized general product. With the same approach as in Lemma 2.1, by defining a map β : Conversely, let us consider the external generalized general product M = A ⊕B δ ψ B ⊕A of the monoids A ⊕B and B ⊕A . By denoting two submonoids A ⊕B = ( f, 1) : f ∈ A ⊕B and B ⊕A = (1, g) : g ∈ B ⊕A of M and taking into account the maps f −→ ( f, 1) and g −→ (1, g), we can easily see that the submonoids A ⊕B and B ⊕A are isomorphic to A ⊕B and B ⊕A , respectively. Additionally, since each element ( f, g) ∈ M can be written as a unique decomposition ( f, g) = ( f, 1)(1, g), we finally obtain the internal generalized general Hence, the result.
We note that, for semigroups, there is no such a correspondence between the internal and external generalized general products (as proved in Lemma 2.1 and Theorem 2.2) and indeed not even for the general product as remarked by Brin ([3]). In fact, in Sect. 3, we will use this important correspondence to discuss the regularity for only monoids by considering the internal generalized general product of monoids which will also be true for the external generalized general product of monoids.

Regularity and inverse properties
In this section, we determine the all criterion when the generalized general product A ⊕B δ ψ B ⊕A to be a regular and to be an inverse monoid.
First, we will recall some basic definitions as in the following: a semigroup S is called regular if for each x ∈ S, there exists an element y ∈ S such that x yx = x and yx y = y ( [10]) in which the element y is called the inverse of x. The set of regular elements of S is denoted by Reg (S) while the set of inverses of the element x is denoted by V (x). (Remind that the inverse element is not unique in semigroups unless the semigroup is not an inverse semigroup). A simple fact says that, in a semigroup S, if x yx = x, then y = yx y ∈ V (x) and so to show the regularity of S, we need only to find an element y such that x yx = x. In addition, an idempotent in S is an element e ∈ S such that e 2 = e and the set of all idempotent elements of S is denoted by E(S). Clearly, if y ∈ V (x) then x y, yx are idempotents. By Hall's theorem ([9, Theorem 3.3.3]), S is regular if and only if the product of any two idempotent element is regular.

Proposition 3.1 If A is a regular monoid and B is a group, then
Proof Since A is regular, A ⊕B is a regular monoid ( [15]) and since B is a group, B ⊕A is a group ( [13]). For The proof of the following result is quite similar as the proof of Zappa-Szép product (i.e ordinary general product) version which has been done by Wazzan in [17].

Proposition 3.2 Let A ⊕B be a left zero semigroup and B
⊕A be a regular semigroup. For all g ∈ B ⊕A , suppose there exists some f ∈ A ⊕B such that g f = g and, for all t ∈ A ⊕B , suppose there exists some g ∈ V (g) such that g t = g . Therefore, A ⊕B δ ψ B ⊕A is regular.
In the following theorem, we will present necessary and sufficient conditions on regularity of the monoid A ⊕B δ ψ B ⊕A using the method sandwich set which was defined by Howie in [10, Proposition 2.5.1]. We should note that, by Theorem 2.2, since there exists an isomorphism between the internal and external generalized general products, we will use the internal forms in the proofs of some results at the remaining part of this section.

Theorem 3.3 For regular monoids A and B, the generalized general product
Proof By the proof of Proposition 3.1, we know that A ⊕B and B ⊕A are regular since A and B are regular.
Let us prove the sufficiency part.
Then by keeping our minds the assumption f f hh ∈ Reg A ⊕B δ ψ B ⊕A , the sandwich set ([10, Proposition 2.5.1]) of the elements f f and hh is defined by We aim now to show that this set really exists, and then by [10, Proposition 2.5.3], we will say that the generalized general product A ⊕B δ ψ B ⊕A is regular.
By the assumption f f hh ∈ Reg A ⊕B δ ψ B ⊕A , we definitely have an element k ∈ V f f hh such that g = hh k f f . Then Furthermore, we can write ( Now, in (2), which implies ( f, h) is an idempotent in A ⊕B δ ψ B ⊕A . Therefore, ( f, h) ∈ Reg A ⊕B δ ψ B ⊕A , and hence A ⊕B δ ψ B ⊕A is regular.
In the next theorem, we give necessary conditions for A ⊕B δ ψ B ⊕A to be an inverse monoid.  h f h and (g, k) (g, k) = (g, k) = g k g , k g k which yield f = f h f , h = h f h and g = g k g , k = k g k. By (iii), since f and h as well as g and k act trivially on each others, we get f = f 2 , g = g 2 , h = h 2 and k = k 2 . But, by (i), since A ⊕B and B ⊕A are inverse monoids, the idempotents commutes that is f g = g f ∈ A ⊕B and hk = kh ∈ B ⊕A . Therefore, hk) since h and g are idempotents, they act trivially by (ii) Thus, A ⊕B δ ψ B ⊕A is an inverse monoid, as required.

Remark 3.6
There also exists a particular class of regular semigroup, namely coregular semigroups. An element α of a semigroup S is called coregular if there is a β ∈ S such that α = αβα = βαβ as well as the semigroup S is called coregular if each element of it is coregular ( [2,5]). In fact, we leave the coregularity and its properties over generalized general products as an open problem for the future studies.

Some Green's relations on generalized general product
Green's relations R and L on Zappa-Szép products (general products) of semigroups have been first investigated in the paper [11]. Nevertheless, Wazzan ([17]) studied some related results on the same topic as well.
As a next step of the studies in [11,17,20], in this section, we will study on some Green's relations for generalized general product A ⊕B δ ψ B ⊕A .
The following proposition is the generalized version of a result in [11] over semigroups.

Proposition 4.1 Let A ⊕B δ ψ B ⊕A be the generalized general product of semigroups A ⊕B and B ⊕A . Then
Then there exists any two elements (h 1 , In other words, we must have which imply h 1 It follows that g 1 Lg 2 in B ⊕A . Similar argument can be discussed for the proof of (ii). To prove the sufficiency part, let us suppose that f 1 R f 2 in A ⊕B . So there must exist t 1 and t 2 in A ⊕B such that f 1 t 1 = f 2 and f 2 t 2 = f 1 . To show the existence of ( f 1 , g 1 ) R ( f 2 , g 2 ), we have to find (h 1 , l 1 ) g 1 ), or equivalently, f 1 ( g 1 h 1 ) = f 2 , g h 1 1 l 1 = g 2 , f 2 ( g 2 h 2 ) = f 1 and g h 2 2 l 2 = g 1 . Notice that the second and forth equalities can also be written as In fact, by setting h 1 = g −1 1 t 1 and h 2 = g −1 2 t 2 , we obtain With a similar approximation, we also obtain the equality (

where A ⊕B is a monoid and B ⊕A is a group.
Proof Suppose g −1 1 f 1 L g −1 2 f 2 holds with its conditions. Then there exist t 1 and t 2 in A ⊕B such that We set (h 1 , l 1 ) = g 2 t 1 , g t 1 2 g − 1   1 and (h 2 , l 2 ) = g 1 t 2 , g t 2 1 g −1

2
. Then we obtain Similarly, one can obtain (h 2 ,

Remark 4.4
It is known that there also exist some other types of Green's relations. One may study those relations with their properties over generalized general products for a future project.

Generalized general product of a left restriction semigroup by a semilattice
In this section, by considering the generalized general product of a left restriction semigroup with a semilattice of projections, we will determine some algebraic properties of it. Recall that left restriction semigroups are a class of semigroups which generalize inverse semigroups. A semigroup S is called a semilattice if all its elements are idempotents and commute. For inverse semigroups A and B, by [13,Proposition 3], if A and B are semilattices then A ⊕B and B ⊕A are semilattices, respectively. On the other hand, an inverse semigroup S is an unary semigroup S, ·, −1 , where −1 represents the inverse unary operation on S.

Definition 5.1 ([19]) A left restriction semigroup
S is a unary semigroup S, ·, + , where (S, ·) is a semigroup and + is an unary operation such that the following identities hold: a + a = a, a + b + = b + a + , a + b + = a + b + and ab + = (ab) + a.
Putting E = {a + : a ∈ S}, it is easy to see that E becomes a semilattice. These idempotents are called projections of S and we call E is the semilattice of projections of S. If S is a left restriction semigroup with semilattice of projections E, then a natural partial order on S is defined by the rule for some e ∈ E and all a, b ∈ S. We refer the reader to [19] for detailed study on left (right, two sided) restriction semigroups.
If S is a semigroup and E is a non-empty subset of E (S) which is called the distinguished set of idempotents, then the relations ≤ R E and ≤ L E are defined by the rules By defining a left action of B ⊕A on A ⊕B and a right action of A ⊕B on B ⊕A , we will see that A ⊕B B ⊕A becomes a generalized general product. We will also determine the set of idempotents of A ⊕B δ ψ B ⊕A . We will actually see that A ⊕B δ ψ B ⊕A is not itself left restriction but it contains a subsemigroup which is left restriction. Proof To proof this lemma, we need to check these two actions whether they actually satisfy the properties defined in (1).
For f 1 , f 2 ∈ B ⊕A and g ∈ A ⊕B , since we have condition p1 • holds. Let f ∈ B ⊕A and g 1 , g 2 ∈ A ⊕B . Then Thus, p2 • holds. For f ∈ B ⊕A and g 1 , For f 1 , f 2 ∈ B ⊕A and g ∈ A ⊕B , we get Thus, p4 • holds. Therefore, A ⊕B δ ψ B ⊕A is the generalized general product under the binary operation ( f 1 , g 1 ) ( f 2 , g 2 ) = f (g 1 f 2 ) + , g 1 f 2 g 2 , as required.
We now compute the set of idempotents of A ⊕B δ ψ B ⊕A , where B ⊕A is a left restriction semigroup with semilattice of projections A ⊕B .

Lemma 5.3 Let B ⊕A is a left restriction semigroup with semilattice of projections A ⊕B . Then
Clearly A ⊕B ⊆ E A ⊕B δ ψ B ⊕A , and easy to check that A ⊕B is a semilattice isomorphic to is an element of E A ⊕B δ ψ B ⊕A then we obtain g f = g f g f = (g f ) + = g + by the equality g = g f g. Thus, we have g = g f g = (g f ) f g = g + f g = f g which gives g + ≤ f . So, since f ≤ g + , it follows that g + = f . As a result of that g = g f g = g 2 = g + = f .
As a main result of this section, we now record some properties of the generalized general product of a left restriction semigroup B ⊕A with semilattice of projections A ⊕B . (e) ( f, g) (l, l) = ( f, g) if and only if f ≤ g + , g = gl; Proof (a) From Lemma 5.3, we know that A ⊕B is a semilattice which is isomorphic to E B ⊕A .
Clearly α is surjective. Also, for any elements ( f, g), (h, l) ∈ A ⊕B δ ψ B ⊕A , we write (d) Suppose now ( f, g) R A ⊕B ( f, f ). By (c), we have f g = g.
Conversely, if f g = g then ( f, f ) is a left identity of ( f, g) since ( f, f ) ( f, g) = ( f, f g) = ( f, g). Now suppose that (h, h) ∈ A ⊕B exists with (h, h) ( f, g) = ( f, g). Then h f = f by (c), so that we have g).  Conversely, if f ≤ g + and g L A ⊕B l, then gl = g ⇒ ( f, g) (l, l) = ( f, g), and if ( f, g) (h, h) = ( f, g) then gh = g and so lh = l which gives (l, l) (h, h) = (l, l). Therefore, ( f, g) L A ⊕B (l, l). (g) For some g, l ∈ A ⊕B , it is a direct proof to show that using (c) and (e). Now suppose S = g + , g : g ∈ B ⊕A . To prove that S is a subsemigroup of A ⊕B δ ψ B ⊕A , let g + , g , f + , f ∈ S. Then g + , g , f + , f = g + (g f ) + , g f + f = g + g f + , g f = (g f ) + , g f ∈ S.
Hence, the result.

Conclusions
In this paper, we investigated some specific theories such as internal, external, regularity, inverse, and Green's relations over generalized general products A ⊕B δ ψ B ⊕A . Of course, there are still so many different properties that can be checked on this important product. On the other hand, in Remarks 3.6 and 4.4, we indicated some problems for the future studies.