Open Access

A new monoid construction under crossed products

  • Ahmet Emin1,
  • Fırat Ateş1,
  • Sebahattin Ikikardeş1Email author and
  • Ismail Naci Cangül2
Journal of Inequalities and Applications20132013:244

https://doi.org/10.1186/1029-242X-2013-244

Received: 12 December 2012

Accepted: 26 April 2013

Published: 15 May 2013

Abstract

In this paper we define a new monoid construction under crossed products for given monoids. We also present a generating set and a relator set for this product. Finally, we give the necessary and sufficient conditions for the regularity of it.

MSC:05C10, 05C12, 05C25, 20E22, 20M05.

Keywords

crossed productsemi-direct productmonoid presentation

1 Introduction and preliminaries

In [1], some conditions for the regularity of the semi-direct product are given. Moreover, in [2], a new monoid construction under semi-direct product and Schützenberger product for any two monoids is defined, and its regularity is examined. Also, in [3], necessary and sufficient conditions for this new product to be strongly π-inverse are determined. The regularity and π-inverse property for the Schützenberger product are studied in [4]. By using similar methods as in these above papers, the purpose of this paper is to define a new monoid construction under a crossed product and to give its regularity.

Definition 1 A crossed system of monoids is a quadruple ( A , B , α , f ) , where A and B are two monoids, and f : B × B A and α : B End ( A ) , where End ( A ) denotes the collection of endomorphism of A, are two maps such that the following conditions hold:
(1)
(2)

for all b 1 , b 2 , b 3 B , a A . The crossed system ( A , B , α , f ) is called normalized if f ( 1 B , 1 B ) = 1 A . The map α : B End ( A ) is called weak action and f : B × B A is called an α-cocycle.

If ( A , B , α , f ) is a normalized crossed system, then we have f ( 1 B , b ) = f ( b , 1 B ) = 1 A and α 1 B ( a ) = a by [5].

Let A and B be monoids, and let f : B × B A and α : B End ( A ) be two maps. Let A # α f B : = A × B as a set with a binary operation defined by the formula
( a 1 , b 1 ) ( a 2 , b 2 ) : = ( a 1 ( α b 1 ( a 2 ) ) f ( b 1 , b 2 ) , b 1 b 2 )

for all b 1 , b 2 B , a 1 , a 2 A . Then ( A # α f B , ) is a monoid with unit 1 A # α f B = ( 1 A , 1 B ) if and only if ( A , B , α , f ) is a normalized crossed system. In this case, the monoid A # α f B is called a crossed product of A and B associated to the crossed system ( A , B , α , f ) [5]. The reader is referred to [6] and [5] for more details on this material.

Definition 2 Let A and B be monoids. For a subset P of A × B and a A , b B , we let define P b = { ( c , d b ) ; ( c , d ) P } and a P = { ( a c , d ) ; ( c , d ) P } . Then the Schützenberger product of the monoids A and B, denoted by A B , is the set A × ( A × B ) × B (where ( ) denotes the power set) with the multiplication given by
( a 1 , P 1 , b 1 ) ( a 2 , P 2 , b 2 ) = ( a 1 a 2 , P 1 b 2 a 1 P 2 , b 1 b 2 ) .

It is known that A B is a monoid with identity ( 1 A , , 1 B ) , where is an empty set (see [7]).

2 A new monoid construction

In this section, as one of the main results of the paper, we define a new monoid construction under a crossed product and the Schützenberger product by considering the definitions given in the above section. In order to do that, firstly we give the definition of this new product and then we define its presentation.

Definition 3 Let A and B be monoids. For P A × B and b B , we define
P b = { ( a , d b ) ; ( a , d ) P } .
Let us consider the following multiplication:
( a 1 , P 1 , b 1 ) ( a 2 , P 2 , b 2 ) = ( a 1 α b 1 ( a 2 ) f ( b 1 , b 2 ) , P 1 b 2 P 2 , b 1 b 2 )

on the set A × ( A × B ) × B , where f : B × B A and α : B End ( A ) are given in Definition 1.

Let us show the associative property:
( ( a 1 , P 1 , b 1 ) ( a 2 , P 2 , b 2 ) ) ( a 3 , P 3 , b 3 ) = ( a 1 α b 1 ( a 2 ) f ( b 1 , b 2 ) , P 1 b 2 P 2 , b 1 b 2 ) ( a 3 , P 3 , b 3 ) = ( a 1 α b 1 ( a 2 ) f ( b 1 , b 2 ) α b 1 b 2 ( a 3 ) f ( b 1 b 2 , b 3 ) , ( P 1 b 2 P 2 ) b 3 P 3 , b 1 b 2 b 3 ) = ( a 1 α b 1 ( a 2 ) α b 1 ( α b 2 ( a 3 ) ) f ( b 1 , b 2 ) f ( b 1 b 2 , b 3 ) , P 1 b 2 b 3 P 2 b 3 P 3 , b 1 b 2 b 3 ) = ( a 1 α b 1 ( a 2 ) α b 1 ( α b 2 ( a 3 ) ) α b 1 ( f ( b 2 , b 3 ) ) f ( b 1 , b 2 b 3 ) , P 1 b 2 b 3 P 2 b 3 P 3 , b 1 b 2 b 3 )
and
( a 1 , P 1 , b 1 ) ( ( a 2 , P 2 , b 2 ) ( a 3 , P 3 , b 3 ) ) = ( a 1 , P 1 , b 1 ) ( a 2 α b 2 ( a 3 ) f ( b 2 , b 3 ) , P 2 b 3 P 3 , b 2 b 3 ) = ( a 1 α b 1 ( a 2 α b 2 ( a 3 ) f ( b 2 , b 3 ) ) f ( b 1 , b 2 b 3 ) , P 1 b 2 b 3 P 2 b 3 P 3 , b 1 b 2 b 3 ) = ( a 1 α b 1 ( a 2 ) α b 1 ( α b 2 ( a 3 ) ) α b 1 ( f ( b 2 , b 3 ) ) f ( b 1 , b 2 b 3 ) , P 1 b 2 b 3 P 2 b 3 P 3 , b 1 b 2 b 3 ) .

Let us denote this new product by A c p # α f B . Then, by the above argument, we say that A c p # α f B is a monoid with the identity ( 1 A , , 1 B ) .

By the following remark, we explain why this new product is worked on in this paper.

Remark 1 In [813] the authors give some new results about the p-Cockcroft property of some extensions. So, by using these papers, one can also work on this subject by using this new product. So, one can give some new efficient (equivalently, p-Cockcroft) presentation examples. By the way, one can also do further algebraic works on this new product. For instance, in this paper, we give necessary and sufficient conditions for this new product to be regular.

3 Presentation of A c p # α f B

Let us consider Remark 1. In order to do such algebraic work, we need to define the presentation of this new product. So, in the following theorem, we give a presentation of A c p # α f B as one of the main results of this paper.

Theorem 1 Let us suppose that the monoids A and B are defined by presentations [ X ; R ] and [ Y ; S ] , respectively. Then A c p # α f B is defined by generators
Z = X Y { z a , b ; a A , b B }
and the relations
(3)
(4)
(5)
(6)
(7)

where W S is the word on X.

Proof Let us denote the set of all words in Z by Z . Let
ψ : Z A c p # α f B
be a homomorphism defined by ψ ( x ) = ( x , , 1 B ) , ψ ( y ) = ( 1 A , , y ) and ψ ( z a , b ) = ( 1 A , { ( a , b ) } , 1 B ) , where x X , y Y , a A and b B . Also, we can easily see that we have
(8)
(9)
(10)
for a , a 1 , a 2 A , b , b 1 , b 2 B and P 1 , P 2 A × B . This says that ψ is onto. Now let us show that A c p # α f B satisfies relations (3)-(7). Let R = x 1 x 2 x s , where x 1 , x 2 , , x s X . Thus the relation (3) follows from ( x 1 , , 1 ) ( x 2 , , 1 ) ( x s , , 1 B ) = ( R , , 1 B ) = ( 1 A , , 1 B ) . Also, let S = y 1 y 2 y k , where y 1 , y 2 , , y k Y , then the relation (4) follows from
( 1 A , , y 1 ) ( 1 A , , y 2 ) ( 1 A , , y k ) = ( W S , , S ) = ( W S , , 1 B ) ,
where W S = f ( y 1 , y 2 ) f ( y 1 y 2 , y 3 ) f ( y 1 y 2 y 3 , y 4 ) f ( y 1 y 2 y k 1 , y k ) . For relations (5), we have
( 1 A , , y ) ( x , , 1 B ) = ( α y ( x ) f ( y , 1 B ) , , y ) = ( α y ( x ) , , 1 B ) ( 1 A , , y ) .
In fact the relations given in (6) follow from (8), (9) and (10). Now let us show that relations (7) hold by the following:

Thus these above arguments say that ψ induces an epimorphism ψ ¯ from the monoid defined by (3)-(7), say M, onto A c p # α f B .

Let us consider the relations (5) and (7). By using these relations, there exist words w x in X , w y Y and w a , b { z a , b : a A , b B } such that w = w x w y w a , b in M for w Z . Moreover, it can be noted that relations (6) can be used to prove that there exists a set P ( w ) A × B such that w a , b = ( a , b ) P ( w ) z a , b . So, we have
ψ ¯ ( w ) = ψ ( w ) = ψ ( w x w y w a , b ) = ψ ( w x ) ψ ( w y ) ψ ( w a , b ) = ( w x , , 1 B ) ( 1 A , , w y ) ( 1 A , P ( w ) , 1 B ) = ( w x , P ( w ) , w y )

for any word w Z .

Now, let us take w = w x w y w a , b and w = w x w y w a , b for some w , w Z . If ψ ( w ) = ψ ( w ) , then, by the equality of these components, we deduce that w x = w x in A, w y = w y in B and P ( w ) = P ( w ) . Relations (3) and (4) imply that w x = w x and w y = w y hold in M. So that w = w holds. Thus ψ ¯ is injective. □

4 Regularity of A c p # α f B

Let A and B be monoids. As depicted in Remark 1, one can work on this new product to show some algebraic properties. To this end, in this section we define the necessary and sufficient conditions for A c p # α f B to be regular.

For an element a in a monoid M, let us take a 1 for the set of inverses of a in M, that is, a 1 = { b B : a b a = a  and  b a b = b } . Hence M is regular if and only if, for all a M , the set a 1 is not equal to the empty set.

The reader is referred to [24] and [1] for more details.

Let us consider the notations given in Definition 3. Then we have the following theorem as a final main result of this paper.

Theorem 2 Let A and B be any monoids. The product A c p # α f B is regular if and only if A is a regular monoid and B is a group.

Proof Let us suppose that A c p # α f B is regular. Thus, for ( a , { ( 1 A , 1 B ) } , 1 B ) A c p # α f B , there exists ( x , P , y ) such that
Thus we have y = 1 B . This gives that a = a x a and x = x a x . Hence A is regular. By using the similar argument, for ( 1 A , { ( 1 A , 1 B ) } , b ) A c p # α f B , there exists ( x , P , y ) such that
Here, since we have

and, in particular, ( 1 A , y b ) = ( 1 A , 1 B ) and P b y = P , we get y b = b y = 1 B . This says that B is a group.

Suppose conversely that A is a regular monoid and B is a group. Let us take ( a , P , b ) A c p # α f B . Since B is a group, then there exists y in B such that b y = y b = 1 B . Also, since A is regular, we can take c = α y ( v ) for some f ( b , y ) v a 1 such that v ( a f ( b , y ) ) 1 . Now, let us consider the following:
Also, by choosing, P 2 = P 1 y A × B , where P 1 A × B , we get
Consequently, for every ( a , P 1 , b ) A c p # α f B , there exists ( c , P 2 , y ) A c p # α f B such that

where P 2 = P 1 y , b y = y b = 1 B and c = α y ( v ) for some f ( b , y ) v a 1 such that v ( a f ( b , y ) ) 1 . Hence the result. □

Declarations

Acknowledgements

Dedicated to Professor Hari M Srivastava.

Authors’ Affiliations

(1)
Department of Mathematics, Faculty of Art and Science, Balikesir University
(2)
Department of Mathematics, Faculty of Arts and Science, Uludag University

References

  1. Nico WR: On the regularity of semi-direct products. J. Algebra 1983, 80: 29–36. 10.1016/0021-8693(83)90015-7MathSciNetView ArticleGoogle Scholar
  2. Ateş F: Some new monoid and group constructions under semidirect products. Ars Comb. 2009, 91: 203–218.Google Scholar
  3. Karpuz EG, Çevik AS: A new example of strongly π -inverse monoids. Hacet. J. Math. Stat. 2011, 40: 461–468.MathSciNetGoogle Scholar
  4. Ateş F, Karpuz EG, Çevik AS: Regular and π -inverse monoids under Schutzenberger products. Algebras Groups Geom. 2010, 27(4):455–470.MathSciNetGoogle Scholar
  5. Agore AL, Militaru G: Crossed product of groups applications. Arab. J. Sci. Eng. 2008, 33: 1–17.MathSciNetGoogle Scholar
  6. Agore AL, Fratila D: Crossed product of cyclic groups. Czechoslov. Math. J. 2010, 60(135):889–901.MathSciNetView ArticleGoogle Scholar
  7. Howie JM, Ruskuc N: Constructions and presentations for monoids. Commun. Algebra 1994, 22(15):6209–6224. 10.1080/00927879408825184MathSciNetView ArticleGoogle Scholar
  8. Ateş F, Çevik AS: Separability and efficiency under standard wreath product in terms of Cayley graphs. Rocky Mt. J. Math. 2008, 38: 779–800. 10.1216/RMJ-2008-38-3-779View ArticleGoogle Scholar
  9. Ateş F, Çevik AS: Minimal but inefficient presentations for semi-direct products of finite cyclic monoids. L.M.S Lecture Note Series 1. In Proceedings of Groups St Andrews 2005. Cambridge University Press, Cambridge; 2006:175–180.Google Scholar
  10. Ateş F, Çevik AS: The p -Cockcroft property of central extensions of groups II. Monatshefte Math. 2007, 150: 181–191. 10.1007/s00605-006-0435-3View ArticleGoogle Scholar
  11. Cevik AS: The p -Cockcroft property of semi-direct products of monoids. Int. J. Algebra Comput. 2003, 13(1):1–16. 10.1142/S0218196703001298MathSciNetView ArticleGoogle Scholar
  12. Cevik AS: Minimal but inefficient presentations of the semi-direct product of some monoids. Semigroup Forum 2003, 66(1):1–17.MathSciNetView ArticleGoogle Scholar
  13. Cevik AS: Efficiency for self semi-direct products of the free Abelian monoid on two generators. Rocky Mt. J. Math. 2005, 35(1):47–59. 10.1216/rmjm/1181069767MathSciNetView ArticleGoogle Scholar

Copyright

© Emin et al.; licensee Springer. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.