Next Article in Journal
Feature Selection Methods for Extreme Learning Machines
Previous Article in Journal
Computer-Aided Analysis of Solvable Rigid Lie Algebras with a Given Eigenvalue Spectrum
Previous Article in Special Issue
Neighborhood Structures and Continuities via Cubic Sets
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Study on Groupoids, Ideals and Congruences via Cubic Sets

1
Division of Applied Mathematics, Wonkwang University, 460 Iksan-daero, Iksan-si 54538, Korea
2
Department of Mathematics, Faculty of Education, Ain Shams University, Roxy, Cairo 11566, Egypt
3
School of Big Data and Financial Statistics, Wonkwang University, 460 Iksan-daero, Iksan-si 54538, Korea
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(9), 443; https://doi.org/10.3390/axioms11090443
Submission received: 30 June 2022 / Revised: 14 August 2022 / Accepted: 23 August 2022 / Published: 30 August 2022
(This article belongs to the Special Issue Cubic Set Structure and Its Applications)

Abstract

:
The inclusion, the intersection and the union between cubic sets are each defined in two ways. From this point of view, we introduce the concepts of cubic subgroupoids, cubic ideals, cubic subgroups, and cubic congruences as two types, respectively, and discuss their various properties. In particular, we give a relationship between the set of all cubic normal subgroups of a group and all cubic congruences on the group.

1. Introduction

The concepts of fuzzy sets as the generalization of crisp sets and interval-valued fuzzy sets as the generalization of fuzzy sets was introduced by Zadeh [1] in 1965 and [2] in 1971. In 2012, Jun et al. [3] proposed the notion of cubic sets combined with interval-valued fuzzy sets and fuzzy sets. After that, Chinnadurai et al. [4] studied further properties of cubic sets, and Kang and Kim [5] dealt with some properties for a mapping of cubic set. Zeb et al. [6] and Rashid et al. [7] applied cubic sets to topological structures and decision-making problems, respectively. Additionally, many researchers [8,9,10,11,12,13] investigated ideal structures based on cubic sets in various algebras. Now, let us take a look at recent research trends based on cubic sets. Lee et al. [14] formed the concrete category of cubic relations and morphisms between them, and studied some of its categorical structures in the sense of the topological universe. Loganayaki and Jayanthi [15] defined P-cubic and R-cubic continuous mappings, and dealt with some of their properties. Muhiuddin et al. [16] discussed various properties of cubic graphs and gave an example for a traffic flow problem as an application of cubic graphs. Alhazaymeh et al. [17] introduced the notion of cubic vague sets and applied it to decision-making problems. Riaz et al. [18] proposed the concept of correlation coefficients for cubic bipolar fuzzy sets and applied it to pattern recognition.
Jun et al. [19] defined a cubic subgroup and obtained its various properties. Jun and Khan [20] studied ideal structures based on cubic sets in semigroups. Recently, Muhiuddin [21] defined a cubic interior ideal in semigroups and obtained some of its properties. Amalanila and Jayalakshmi [22] discussed cubic near-ring structures. Gaketem and Iampan [23] introduced the notion of cubic filters in semigroups and investigated its various properties.
In many books (for example, Rosenfeld [24] and Howie [25]), we can see that a complete description of the congruences on a group in terms of its normal subgroups was proposed as follows:
There exists a one to one mapping from N ( G ) onto C ( G )
where N ( G ) and C ( G ) denote the set of all normal subgroups of a group G and all congruences on G.
The order between cubic numbers is defined by two types called P-order and R-order. The purpose of our study is to define cubic subgroupoid, cubic ideal, cubic subgroup and congruence in two ways and discuss the properties of each. To do this, first, we introduce the concepts of P-cubic subgroupoids and P-cubic ideals [respectively, R-cubic subgroupoids and R-cubic ideals] and obtain some of their properties. Furthermore, we define a level set of a cubic set and we give a necessary and sufficient condition for it to be subgroupoid (resp., ideal) (See Theorem 2). Next, we define a cubic subgroup (resp., a cubic normal subgroup) and find a necessary and sufficient condition for the level set of a cubic set to be subgroup (resp., normal subgroup) (See Theorem 4 [resp., Theorem 5]). Finally, we define a cubic congruence and provide the necessary and sufficient condition that the product of two cubic congruences is also a cubic congruence (See Theorem 10 and 11). Furthermore, we give the extension of (1) already mentioned in the introduction via cubic sets (See Proposition 35).

2. Preliminaries

In this section, we list some basic notions needed in the next sections. Throughout this paper, let I = [ 0 , 1 ] , let X , Y , Z denote nonempty sets, let P ( X ) denote the power set of X and let χ A be the characteristic function of A P ( X ) .
A mapping A : X I is called a fuzzy set in X (See [1]). 0 [resp., 1 ] is called the empty [resp., whole] fuzzy set in X and defined by 0 ( x ) = 0 [ r e s p . 1 ( x ) = 1 ] for each x X . I X denotes the set of all fuzzy sets in X.
Each member of the set [ I ] = { a ˜ = [ a , a + ] I : 0 a a + 1 } is called an interval-valued fuzzy number. Refer to [3] for the definitions of order ≤, the equality =, the complement c , the infimum ⋀ and the supremum ⋁ on [ I ] .
A mapping A ˜ : X [ I ] is called an interval-valued fuzzy set (briefly, an IVFS) in X (See [26,27,28]). 0 ˜ [resp., 1 ˜ ] is called the empty [resp., whole] interval-valued fuzzy set in X and defined by 0 ˜ ( x ) = [ 0 , 0 ] [ resp . 1 ˜ ( x ) = [ 1 , 1 ] ] for each x X . We denote the set of all IVFSs in X as I V F S ( X ) . See [26,27,28] for the definitions of the inclusion ⊂, the equality =, the complement c , the intersection ∩ and the union ∪ on I V F S ( X ) .
Members of the set [ I ] × I are called cubic numbers and are written as a ˜ ˜ = a ˜ , a , b ˜ ˜ = b ˜ , b , c ˜ ˜ = c ˜ , c , . Refer to [29] for the definitions of two types of orders between two cubic numbers, and two types of infimums and supremums of any collection of cubic numbers.
Definition 1
([3]). A mapping A = A ˜ , A : X [ I ] × I is called a cubic set in X. There are four special cubic sets in X, defined as follows:
0 ¨ = 0 ˜ , 1 , 1 ¨ = 1 ˜ , 0 , 0 ^ = 0 ˜ , 0 , 1 ^ = 1 ˜ , 1 .
Then 0 ^ [resp., 1 ^ ] is called the empty [resp., whole] cubic set in X and C S ( X ) denotes the set of all cubic sets in X.
Definition 2
([3]). For a nonempty set X, let a ˜ ˜ be a cubic number and let A C S ( X ) . Then, A is called a constant cubic set with a ˜ ˜ , denoted by C a ˜ ˜ , if C a ˜ ˜ ( x ) = a ˜ ˜ for each x X .
Definition 3
([3]). Let A , B C S ( X ) . Then, the equality and the inclusion between A and B are defined as follows:
(i) (Equality) A = B A ˜ = B ˜ a n d A = B .
(ii) (P-inclusion) A B A ˜ B ˜ a n d A B .
(iii) (R-inclusion) A B A ˜ B ˜ a n d A B .
Refer to [3] for the definitions of the compliment ( c ) of a cubic set, two types of unions (, ) and two types of intersection (,) between two cubic sets.
It is obvious that 0 ^ A 1 ^ and 0 ¨ A 1 ¨ for each A C S ( X ) . Moreover, 0 ^ 0 ¨ , 1 ¨ 1 ^ and 0 ¨ 0 ^ , 1 ^ 1 ¨ .
Definition 4
([5,29]). Let f : X Y and let A C S ( X ) , B C S ( Y ) .
(i) The pre-image of B under f, denoted by f 1 ( B ) = f 1 ( B ˜ ) , f 1 ( B ) , is a cubic set in X defined as follows: for each x X ,
f 1 ( B ) ( x ) = f 1 ( B ˜ ) ( x ) , f 1 ( B ) ( x ) = B ˜ ( f ( x ) ) , B ( f ( x ) ) .
(ii) The P-image and the R-image of A under f, denoted by f P ( A ) and f R ( A ) , are cubic sets in Y, respectively defined as follows: for each y Y ,
f P ( A ) ( y ) = x f 1 ( y ) A ˜ ( x ) , x f 1 ( y ) A ( x ) i f f 1 ( y ) [ 0 , 0 ] , 0 o t h e r w i s e ,
f R ( A ) ( y ) = x f 1 ( y ) A ˜ ( x ) , x f 1 ( y ) A ( x ) i f f 1 ( y ) [ 0 , 0 ] , 1 o t h e r w i s e .
In fact, f P ( A ) = f ( A ˜ ) , f ( A ) and f R ( A ) = f ( A ˜ ) , f R ( A ) , where f ( A ˜ ) and f ( A ) denote the image of A ˜ and A under f, respectively, and f R ( A ) is a fuzzy set in X defined as the second component of f R ( A ) (see [19] for the definition of f R ( A ) ).

3. Cubic Subgroupoids and Cubic Ideals

In this section, we introduce the concepts of cubic groupoids and cubic ideals of a groupoid, and obtain their various properties and give some examples related to them. We define the level set of a cubic set of a groupoid and we give the relationship between a cubic subgroupoid of a groupoid and its level set. Additionally, we obtain the relationship between a cubic left ideal (resp., right ideal and ideal) and its level set. Moreover, we provide a sufficient condition that the image of a cubic subgroupoid (resp., left ideal, right ideal and ideal) under a groupoid homomorphism is also a cubic subgroupoid (resp., left ideal, right ideal and ideal).
Definition 5
([30]). For a groupoid ( X , · ) , let A , B I X . Then, the product A F B of A and B is a fuzzy set in X defined as follows: for each x X ,
( A F B ) ( x ) = y z = x [ A ( y ) B ( z ) ] i f   y z = x 0 o t h e r w i s e .
Definition 6
([31]). For a groupoid ( X , · ) , let A ˜ , B ˜ I V F S ( X ) . Then, the product A ˜ I V F B ˜ of A ˜ and B ˜ is an IVFS in X, defined as follows: for each x X ,
( A ˜ I V F B ˜ ) ( x ) = y z = x [ A ( y ) B ( z ) ] , y z = x [ A + ( y ) B + ( z ) ] i f   y z = x 0 , 0 o t h e r w i s e .
By using the definitions of the inf and the sup of cubic numbers, we can define the product of two cubic sets as follows.
Definition 7.
For a groupoid ( X , · ) , let A , B C S ( X ) . Then, two types product of A and B , denoted by A P B and A R B , are cubic sets in X defined as follows: for each x X ,
( A P B ) ( x ) = y z = x P [ A ( y ) P B ( z ) ] i f   y z = x [ 0 , 0 ] , 0 o t h e r w i s e ,
( A R B ) ( x ) = y z = x R [ A ( y ) R B ( z ) ] i f   y z = x [ 0 , 0 ] , 1 o t h e r w i s e .
Remark 1.
From Definitions 5–7, we can easily see that the following holds:
(1) A P B = A ˜ I V F B ˜ , A F B ,
(2) A R B = A ˜ I V F B ˜ , A R B , where
( A R B ) ( x ) = y z = x [ A ( y ) B ( z ) ] i f   y z = x 1 o t h e r w i s e .
Example 1.
Let X = { a , b , c } be the groupoid with the following Cayley table (see Table 1):
Consider two octahedron sets A and B in X, respectively given by:
A ( a ) = [ 0.3 , 0.6 ] , 0.5 , A ( b ) = [ 0.2 , 0.4 ] , 0.7 , A ( c ) = [ 0.4 , 0.7 ] , 0.3 ,
B ( a ) = [ 0.2 , 0.6 ] , 0.7 , B ( b ) = [ 0.3 , 0.5 ] , 0.6 , B ( c ) = [ 0.4 , 0.7 ] , 0.8 .
Then, we can easily calculate A P B and A R B (see Table 2):
x a I X is called a fuzzy point with the support x X and the value a I with a > 0 (See [32]), if for each y X ,
x a ( y ) = a if   y = x 0 otherwise .
We denote the set of all fuzzy points in X by F P ( X ) .
It is well known [33] that A = x a A x a for each A I X .
x a ˜ I V F S ( X ) is called an interval-valued fuzzy point (briefly, IVFP) with the support x X and the value a ˜ [ I ] with a > 0 (see [28]), if for each y X ,
x a ˜ ( y ) = a ˜ if   y = x 0 , 0 otherwise .
We denote the set of all IVFPs in X by I V F P ( X ) .
It is well known [28] that A ˜ = x a ˜ A ˜ x a ˜ for each A ˜ [ I ] X .
Definition 8
([34]). Let A C S ( X ) and let a ˜ ˜ = a ˜ , a be any cubic number such that a > 0 and a > 0 . Then, A is called a cubic point in X with the support x X and the value a ˜ ˜ , denoted by x a ˜ ˜ , if for each y X ,
x a ˜ ˜ ( y ) = a ˜ ˜ i f   y = x [ 0 , 0 ] , 0 o t h e r w i s e .
The set of all cubic points in X is denoted by C P ( X ) . It is clear that x a ˜ ˜ = x a ˜ , x a .
Definition 9
([34]). Let x a ˜ ˜ C P ( X ) and let A C S ( X ) .
(i) x a ˜ ˜ is said to P-belong to A , denoted by x a ˜ ˜ P A , if
a ˜ A ˜ ( x ) and a A ( x ) , i.e., x a ˜ A ˜ and x a A .
(ii) x a ˜ ˜ is said to R-belong to A , denoted by x a ˜ ˜ R A , if
a ˜ A ˜ ( x ) and a A ( x ) , i.e., x a ˜ A ˜ and x 1 a A c .
It is obvious that A = x a ˜ ˜ P A x a ˜ ˜ and A = x a ˜ ˜ R A x a ˜ ˜ for each A C S ( X )
Proposition 1.
For a groupoid ( X , · ) , let A , B C S ( X ) and let x a ˜ ˜ , y b ˜ ˜ C P ( X ) . Then, we have
(1) x a ˜ ˜ P y b ˜ ˜ = ( x y ) a ˜ b ˜ , ( x y ) a b , x a ˜ ˜ R y b ˜ ˜ = ( x y ) a ˜ b ˜ , ( x y ) a b ,
(2) A P B = x a ˜ ˜ P A , y b ˜ ˜ P B x a ˜ ˜ P y b ˜ ˜ , A R B = x a ˜ ˜ R A , y b ˜ ˜ R B x a ˜ ˜ R y b ˜ ˜ .
Proof. 
(1) The proofs are straightforward from Definition 7, Remark 1, Proposition 3.2 (a) in [31] and Proposition 1.1 (i) in [30].
(2) The proof of the first part follows from Definition 7, Remark 1, Proposition 3.2 (b) in [31] and Proposition 1.1 (ii) in [30]. Then, we prove only the second part. From Remark 1 (2), it is sufficient to show that A R B = x a R A , y b R B x a R y b .
Let C = x a R A , y b R B x a R y b . For each z X , we may suppose that there are u , v X , such that u v = z , x a 1 and y b 1 without loss of generality. Then, we can easily check that
( A R B ) ( z ) = z = u v [ A ( u ) B ( v ) ] ( x a R A , y b R B x a R y b ) ( z ) = C ( z ) .
Since u A ( u ) R A and v B ( v ) R B , we get
C ( z ) ( z ) = x a R A , y b R B z = u v [ x a ( u ) y b ( v ) ] z = u v [ u A ( u ) v B ( v ) ] = ( A R B ) ( z ) .
Thus, ( A R B ) ( z ) = C ( z ) . So A R B = x a ˜ ˜ R A , y b ˜ ˜ R B x a ˜ ˜ R y b ˜ ˜ . □
The following are the immediate consequences of Definition 7.
Proposition 2.
Let ( X , · ) be a groupoid.
(1) If “·" is associative (resp., commutative) in X, then so are “ P " and “ R " in C S ( X ) .
(2) If “·" has an identity e X , then we have
  ( 2 a ) e 1 ^ C P ( X ) is an identity of “ P " in C S ( X ) , i.e.,
A P e 1 ^ = e 1 ^ P A = A for each A C S ( X ) ,
  ( 2 b ) e 1 ¨ I V I O P ( X ) is an identity of “ R " in C S ( X ) , i.e.,
A R e 1 ¨ = e 1 ¨ R A = A for each A C S ( X ) .
Definition 10.
For a groupoid ( X , · ) , let A C S ( X ) . Then,
(i) 0 ^ A is called a P-cubic subgroupoid in X, if A P A A , i.e.,
A ˜ I V F A ˜ A ˜ , A F A A ,
(ii) 0 ¨ A is called an R-cubic subgroupoid in X, if A R A A , i.e.,
A ˜ I V F A ˜ A ˜ , A R A A .
P C G P ( X ) [resp., R C G P ( X ) ] denotes the set of all P-[resp., R-] cubic subgroipoids in X. In (ii), if A R A A , then A is called a fuzzy anti-subgroupoid in X and F A G P ( X ) denotes the set of all fuzzy anti-subgroupoids in X.
Let F G P ( X ) [resp., I V F G P ( X ) ] denote the set of all fuzzy [resp., interval-valued fuzzy] subgroupoids in a groupoid X in the sense of Liu [30] [resp., Kang and Hur [31]].
Remark 2.
(1) For a groupoid X, let A C S ( X ) . Then,
  (1 a ) A P C G P ( X ) if and only if A ˜ I V F G P ( X ) , A F G P ( X ) ,
  (1 b ) A R C G P ( X ) if and only if A ˜ I V F G P ( X ) , A F A G P ( X ) .
(2) If A is a subgroupoid of a groupoid X, then we can easily see that
χ A P = [ χ A , χ A ] , χ A P C G P ( X ) a n d χ A R = [ χ A , χ A ] , χ A c R C G P ( X ) .
(3) For a groupoid X, let A I X . If A F G P ( X ) , then clearly,
[ A , A ] , A P C G P ( X ) a n d [ A , A ] , A c R C G P ( X ) .
(4) For a groupoid X, let A ˜ I V F S ( X ) . If A ˜ I V F G P ( X ) , then
A ˜ , A , A ˜ , A + P C G P ( X ) a n d A ˜ , ( A ) c , A ˜ , ( A + ) c R C G P ( X ) .
(5) For a groupoid X, it is clear that for each A P C G P ( X ) [resp., R C G P ( X ) ] and each x X ,
A ( x n ) P A ( x ) [ resp . A ( x n ) R A ( x ) ] ,
where x n is any composite of x’s.
(6) For a groupoid X, let a ˜ ˜ be any cubic number. Then, C a ˜ ˜ P C G P ( X ) and C a ˜ ˜ R C G P ( X ) .
Example 2.(1) Let ( X , · ) be the groupoid and A be the cubic set in X given in Example 1. Then, we can easily calculate that
( A ˜ I V F A ˜ ) ( a ) = [ 0.4 , 0.7 ] [ 0.3 , 0.6 ] = A ˜ ( a ) ,
( A R B ) ( a ) = 0.3 0.5 = A ( a ) .
Thus, A P C G P ( X ) and A R C G P ( X ) .
(2) Let X = { a , b , c } be the groupoid with the following Cayley table (see Table 3):
Consider the cubic sets A , B in X defined as follows:
A ( a ) = [ 0.3 , 0.6 ] , 0.8 , A ( b ) = [ 0.2 , 0.4 ] , 0.7 , A ( c ) = [ 0.4 , 0.7 ] , 0.6 ,
B ( a ) = [ 0.3 , 0.6 ] , 0.6 , B ( b ) = [ 0.2 , 0.4 ] , 0.7 , B ( c ) = [ 0.4 , 0.7 ] , 0.8 .
Then, we can easily check that A P C G P ( X ) and B R C G P ( X ) .
From Definitions 7 and 10, Proposition 2 (1) and Remark 2 (1 a ), we obtain the following consequence.
Proposition 3.
For a groupoid ( X , · ) , let 0 ^ A C S ( X ) . Then, the following are equivalent:
(1) A P C G P ( X ) ,
(2) for any x a ˜ ˜ , y a ˜ ˜ P A , x a ˜ ˜ P y a ˜ ˜ P A , i.e., ( A , P ) is a groupoid,
(3) for any x , y X , A ( x y ) P A ( x ) P A ( y ) , i.e.,
  (i) A ( x y ) A ( x ) A ( y ) , A + ( x y ) A + ( x ) A + ( y ) ,
  (ii) A ( x y ) A ( x ) B ( y ) .
From Remark 2 (1 a ) and the above Proposition, it is obvious that ( A , P ) is a groupoid if and only if ( A ˜ , I V F ) and ( A , F ) are groupoids.
Proposition 4.
For a groupoid ( X , · ) , let A P C G P ( X ) .
(1) If “·” is associative in X, then so is “ P ” in A , i.e., for any x a ˜ ˜ , y a ˜ ˜ , z a ˜ ˜ P A ,
( x a ˜ ˜ P y a ˜ ˜ ) P z a ˜ ˜ = x a ˜ ˜ P ( y a ˜ ˜ P z a ˜ ˜ ) ,
(2) If “·" is commutative in X, then so is “ P " in A , i.e., for any x a ˜ ˜ , y a ˜ ˜ P A ,
x a ˜ ˜ P y a ˜ ˜ = y a ˜ ˜ P x a ˜ ˜ ,
(3) If “·" has an identity e X , then for each x a ˜ ˜ P A ,
e 1 ^ P x a ˜ ˜ = x a ˜ ˜ = x a ˜ ˜ P e 1 ^ .
From Definitions 7 and 10, Proposition 2 (1) and Remark 2 (1 b ), we have the following.
Proposition 5.
For a groupoid ( X , · ) , let 0 ¨ A C S ( X ) . Then, the following are equivalent:
(1) A R C G P ( X ) ,
(2) for any x a ˜ ˜ , y a ˜ ˜ R A , x a ˜ ˜ R y a ˜ ˜ R A , i.e., ( A , R ) is a groupoid,
(3) for any x , y X , A ( x y ) R A ( x ) R A ( y ) , i.e.,
(i) A ( x y ) A ( x ) A ( y ) , A + ( x y ) A + ( x ) A + ( y ) ,
(ii) A ( x y ) A ( x ) B ( y ) .
Proposition 6.
For a groupoid ( X , · ) , let A R C G P ( X ) .
(1) If “·" is associative in X, then so is “ R " in A , i.e., for any x a ˜ ˜ , y a ˜ ˜ , z a ˜ ˜ R A ,
( x a ˜ ˜ R y a ˜ ˜ ) R z a ˜ ˜ = x a ˜ ˜ R ( y a ˜ ˜ R z a ˜ ˜ ) ,
(2) If “·" is commutative in X, then so is “ R " in A , i.e., for any x a ˜ ˜ , y a ˜ ˜ R A ,
x a ˜ ˜ R y a ˜ ˜ = y a ˜ ˜ R x a ˜ ˜ ,
(3) If “·" has an identity e X , then for each x a ˜ ˜ R A ,
e 1 ¨ R x a ˜ ˜ = x a ˜ ˜ = x a ˜ ˜ R e 1 ¨ .
Definition 11.
For a groupoid ( X , · ) , let A C S ( X ) . Then, A is called a:
(i) P-cubic left ideal (briefly, PCLI) of X, if for any x , y X ,
A ( x y ) P A ( y ) ,
(ii) P-cubic right ideal (briefly, PCRI) of X, if for any x , y X ,
A ( x y ) P A ( x ) ,
(iii) P-cubic ideal (briefly, PCI) of X, if it is both a PCLI and a PCRI of X,
(iv) R-cubic left ideal (briefly, RCLI) of X, if for any x , y X ,
A ( x y ) R A ( y ) ,
(v) R-cubic right ideal (briefly, RCRI) of X, if for any x , y X ,
A ( x y ) R A ( x ) ,
(vi) R-cubic ideal (briefly, RCI) of X, if it is both an RCLI and an RCRI of X.
We will denote the set of all PCIs [resp., PCLIs, PCRIs, RCIs, RCLIs and RCRIs] of X as P C I ( X ) [resp., P C L I ( X ) , P C R I ( X ) , R C I ( X ) , R C L I ( X ) and R C R I ( X ) ].
For a groupoid X, let F I ( X ) [resp., F L I ( X ) and F R L ( X ) ] and I V F I ( X ) [resp., I V F L I ( X ) and I V F R L ( X ) ] denote the set of all fuzzy ideals [resp., left ideals and right ideals] (See [35]) and the set of all IVFIs [resp., IVLIs, IVRIs] (See [31]) of X.
Remark 3.
From Definition 11, we have the following (a)–(f).
(a) A P C L I ( X ) for any x , y X ,
A ˜ ( x y ) A ˜ ( y ) , A ( x y ) A ( y ) , i . e . ,
A ( x y ) A ( y ) , A + ( x y ) A + ( y ) , A ( x y ) A ( y ) .
Consequently, A P C L I ( X ) A ˜ I V F L I ( X ) , A F L I ( x ) .
(b) A R C L I ( X ) A ˜ I V F L I ( X ) and A satisfies the condition (3),
A ( x y ) A ( y ) f o r a n y x , y X ,
The fuzzy set A satisfying the condition (3) will be called a fuzzy left anti-ideal in X, and we denote the set of all fuzzy left anti-ideals in X as F L A I ( X ) .
(c) A P C R I ( X ) for any x , y X ,
A ˜ ( x y ) A ˜ ( x ) , A ( x y ) A ( x ) , i . e . ,
A ( x y ) A ( x ) , A + ( x y ) A + ( x ) , A ( x y ) A ( x ) .
Consequently, A P C R I ( X ) A ˜ I V F R I ( X ) , A F R I ( X ) .
(d) A R C R I ( X ) A ˜ I V F R I ( X ) and A satisfies the condition (5),
A ( x y ) A ( x ) f o r a n y x , y X .
The fuzzy set A satisfying the condition (5) will be called a fuzzy right anti-ideal in X and we denote the set of all fuzzy anti-right ideals in X as F R A I ( X ) .
(e) A P C I ( X ) for any x , y X ,
A ˜ ( x y ) A ˜ ( x ) A ˜ ( y ) , A ( x y ) A ( x ) A ( y ) , A ˜ i . e . ,
A ( x y ) A ( x ) A ( y ) , A + ( x y ) A + ( x ) A + ( y ) , A ( x y ) A ( x ) A ( y ) .
consequently, A R C I ( X ) A ˜ I V F I ( X ) , A F I ( X ) .
(f) A R C I ( X ) A ˜ I V F I ( X ) and A satisfies the condition (7),
A ( x y ) A ( x ) A ( y ) .
The fuzzy set A satisfying the condition (7) will be called a fuzzy anti-ideal in X, and we denote the set of all fuzzy anti-ideals in X as F A I ( X ) .
(g) For a groupoid X, let A I X . If A F L I ( X ) [resp., F R I ( X ) and F I ( X ) ], then [ A , A ] , A P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ] and [ A , A ] , A c R C L I ( X ) [resp., R C R I ( X ) and R C I ( X ) ].
(h) For a groupoid X, let A I X . If A F L A I ( X ) [resp., F R A I ( X ) and F A I ( X ) ], then [ A c , A c ] , A R C L I ( X ) [resp., R C R I ( X ) and R C I ( X ) ] and [ A c , A c ] , A c P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ].
(i) For a groupoid X, let A ˜ I V F S ( X ) . If A ˜ I V F L I ( X ) [resp., I V F R I ( X ) and I V F I ( X ) ], then A ˜ , A , A ˜ , A + P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ] and A ˜ , ( A ) c , A ˜ , ( A + ) c R C L I ( X ) [resp., R C R I ( X ) and R C I ( X ) ]
Remark 4.
(1) For a groupoid X, let a ˜ ˜ be any cubic number. Then, C a ˜ ˜ P C L I ( X )
[ resp . PCRI ( X ) , P C I ( X ) ] and C a ˜ ˜ R C L I P ( X ) [ r e s p . R C R I ( X ) , R C I ( X ) ] .
(2) A PCLI [resp., PCRI, PCI, RCLI, RCRI and RCI] in a semigroup S, a group G and a ring R is defined as Definition 11.
(3) It is obvious that A P C G P ( X ) for each A P C I ( X ) [resp., P C L I ( X ) and P C R I ( X ) ] and A R C G P ( X ) for each A R C I ( X ) [resp., R C L I ( X ) and R C R I ( X ) ] but the converses are not true in general (see Example 3 (1)).
Example 3.
(1) Let ( X , · ) be the groupoid and A P C G P ( X ) given in Example 2 (2). Then, clearly, A ( a b ) = 0.5 0.7 = A ( b ) . Thus, A F I ( X ) . So A P C L I ( X ) .
(2) Let X = { a , b , c } be the groupoid with the following Cayley table (see Table 4):
Consider two cubic sets A and B in X given by:
A ( a ) = [ 0.4 , 0.8 ] , 0.8 , A ( b ) = [ 0.3 , 0.7 ] , 0.7 , A ( c ) = [ 0.2 , 0.6 ] , 0.5 ,
B ( a ) = [ 0.4 , 0.8 ] , 0.5 , B ( b ) = [ 0.3 , 0.7 ] , 0.7 , B ( c ) = [ 0.2 , 0.6 ] , 0.8 .
Then, we can easily calculate that A P C L I ( X ) and B R C L I ( X ) . But A ( b c ) = B ( b c ) = 0.2 0.3 = A ( b ) = B ( b ) . Thus, A ˜ , B ˜ I V F R I ( X ) . So A P C R I ( X ) and B R C R I ( X ) .
(3) Let X = { a , b , c } be the groupoid with the following Cayley table (see Table 5):
Consider two cubic sets A and B in X given by:
A ( a ) = [ 0.4 , 0.8 ] , 0.9 , A ( b ) = [ 0.3 , 0.7 ] , 0.7 , A ( c ) = [ 0.2 , 0.6 ] , 0.8 ,
B ( a ) = [ 0.4 , 0.8 ] , 0.9 , B ( b ) = [ 0.3 , 0.7 ] , 0.7 , B ( c ) = [ 0.2 , 0.6 ] , 0.8 .
Then, we can easily check that A P C R I ( X ) and B R C R I ( X ) . however, A ( b a ) = B ( b a ) = 0.3 0.4 = A ( a ) = B ( a ) . Thus, A ˜ , B ˜ I V F L I ( X ) . So A P C L I ( X ) and B R C L I ( X ) .
Theorem 1.
For a groupoid X, let A 2 X .
(1) χ A P P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ] if and only if A is a left ideal [resp., a right ideal and an ideal] of X.
(2) χ A R P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ] if and only if A is a left ideal [resp., a right ideal and an ideal] of X.
Proof. 
(1) The proof follows from Propositions 3.7, 6.6 in [31] and 3.2 in [35].
(2) The proof is similar to (1). □
Definition 12.
Let a ˜ ˜ be any cubic number and let A C S ( X ) . Then, four subsets [ A ] P , a ˜ ˜ , [ A ] P , a ˜ ˜ * , [ A ] R , a ˜ ˜ and [ A ] R , a ˜ ˜ * of X are defined as follows:
[ A ] P , a ˜ ˜ = { x X : A P a ˜ ˜ } = { x X : A ˜ ( x ) a ˜ , A ( x ) a } ,
[ A ] P , a ˜ ˜ * = { x X : A > P a ˜ ˜ } = { x X : A ˜ ( x ) > a ˜ , A ( x ) > a } ,
[ A ] R , a ˜ ˜ = { x X : A R a ˜ ˜ } = { x X : A ˜ ( x ) a ˜ , A ( x ) a } ,
[ A ] R , a ˜ ˜ * = { x X : A > R a ˜ ˜ } = { x X : A ˜ ( x ) > a ˜ , A ( x ) < a } .
In this case, [ A ] P , a ˜ ˜ [resp., [ A ] P , a ˜ ˜ * , [ A ] R , a ˜ ˜ and [ A ] a ˜ ˜ * ] is called a P- a ˜ ˜ - [resp., a strong P- a ˜ ˜ -, an R- a ˜ ˜ - and a strong R- a ˜ ˜ -] level set of A . In particular, we will denote the subset { x X : A ( x ) a } of X as [ A ] R , a .
Jun et al. [19] called the subset [ A ] R , a ˜ ˜ of X a cubic level set of A .
Proposition 7.
Let a ˜ ˜ , b ˜ ˜ be any cubic numbers and let A C S ( X ) .
(1) If a ˜ ˜ P b ˜ ˜ , then [ A ] P , b ˜ ˜ [ A ] P , a ˜ ˜ and [ A ] P , b ˜ ˜ * [ A ] P , a ˜ ˜ * .
(2) If a ˜ ˜ R b ˜ ˜ , then [ A ] R , b ˜ ˜ [ A ] R , a ˜ ˜ and [ A ] R , b ˜ ˜ * [ A ] R , a ˜ ˜ * .
Proof. 
The proofs are straightforward from Definitions 2 and 12. □
Theorem 2.
For a groupoid X, let A C S ( X ) and let [ A ] P , a ˜ ˜ or [ A ] R , a ˜ ˜ for each cubic number a ˜ ˜ .
(1) A P C G P ( X ) if and only if [ A ] P , a ˜ ˜ is a subgroupoid.
(2) A P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ] if and only if [ A ] P , a ˜ ˜ is a left ideal[resp., a right ideal and an ideal].
(3) A R C G P ( X ) if and only if [ A ] R , a ˜ ˜ is a subgroupoid.
(4) A P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ]if and only if [ A ] R , a ˜ ˜ is a left ideal[resp., a right ideal and an ideal].
Proof. 
(1) Suppose A P C G P ( X ) and let x , y [ A ] P , a ˜ ˜ . Then, clearly, A ( x ) P a ˜ ˜ and A ( y ) P a ˜ ˜ . Thus, by the hypothesis, A ( x y ) P A ( x ) P A ( y ) P a ˜ ˜ . So x y [ A ] P , a ˜ ˜ . Hence, [ A ] P , a ˜ ˜ is a subgroupoid.
Conversely, suppose [ A ] P , a ˜ ˜ is a subgroupoid and let A ( x ) = a ˜ ˜ , A ( y ) = b ˜ ˜ , say a ˜ ˜ P b ˜ ˜ . Then clearly, x [ A ] a ˜ ˜ and y [ A ] b ˜ ˜ . Moreover, by Proposition 7 (1), [ A ] b ˜ ˜ [ A ] a ˜ ˜ . Thus, x , y [ A ] a ˜ ˜ . By the hypothesis, x y [ A ] a ˜ ˜ . So, we have
A ( x y ) P a ˜ ˜ = a ˜ ˜ P b ˜ ˜ = A ( x ) P A ( y ) .
Hence, A P C G P ( X ) .
(2) The proof is similar to (1).
(3) Suppose A R C G P ( X ) and let x , y [ A ] R , a ˜ ˜ . Then, clearly, A ( x ) R a ˜ ˜ and A ( y ) R a ˜ ˜ . Thus, we have
A ˜ ( x ) a ˜ , A ( x ) a , a n d A ˜ ( y ) a ˜ , A ( y ) a .
According to the hypothesis, we get A ˜ ( x y ) A ˜ ( x ) A ˜ ( y ) a ˜ a n d A ( x y ) A ( x ) A ( y ) a . So x y [ A ] R , a ˜ ˜ . Hence, [ A ] R , a ˜ ˜ is a subgroupoid.
Conversely, suppose [ A ] R , a ˜ ˜ is a subgroupoid and let A ( x ) = a ˜ ˜ , A ( y ) = b ˜ ˜ , say a ˜ ˜ R b ˜ ˜ . Then, clearly, x [ A ] R , a ˜ ˜ and y [ A ] R , b ˜ ˜ . Moreover, by Proposition 7 (2), [ A ] R , b ˜ ˜ [ A ] R , a ˜ ˜ . Thus, x , y [ A ] R , a ˜ ˜ . According to the hypothesis, x y [ A ] a ˜ ˜ . So, we have
A ( x y ) R a ˜ ˜ = a ˜ ˜ R b ˜ ˜ = A ( x ) R A ( y ) .
Hence, A R C G P ( X ) .
(4) The proof is similar to (3). □
Proposition 8.
For a groupoid X, the following holds:
(1) If ( A j ) j J = ( A ˜ j , A j ) j J P C G P ( X ) , then j J A j P C G P ( X ) .
(2) If ( A j ) j J = ( A ˜ j , A j ) j J R C G P ( X ) , then j J A j R C G P ( X ) .
Proof. 
(1) The proof is obvious from Propositions 3.7 in [31] and 3.1 in [35].
(2) Suppose ( A j ) j J = ( A ˜ j , A j ) j J R C G P ( X ) . According to Proposition 3.7 in [31], j J A ˜ j J I V F G P ( X ) . It is sufficient to show that for any x , y X ,
( j J A j ) ( x y ) [ ( j J A j ) ( x ) ( j J A j ) ( y ) ] .
Since A j R C G P ( X ) for each j J , by Proposition 5 (3),
A j ( x y ) A j ( x ) A j ( y ) f o r e a c h j J .
Thus, j J A j ( x y ) j J [ A j ( x ) A j ( y ) ] = j J A j ( x ) j J A j ( y ) . So, according to Proposition 5, j J A j R C G P ( X ) .
Remark 5.
For any A , B P C G P ( X ) [resp., R C G P ( X ) ], A B P C G P ( X ) [resp., A B R C G P ( X ) ] in general.
Example 4.
Let ( X , · ) be the groupoid and A P C G P ( X ) , B R C G P ( X ) given in Example 3 (1). Consider two cubic sets A and B in X defined as follows: for each x X ,
A ( a ) = [ 0.2 , 0.5 ] , 0.6 , A ( b ) = A ( c ) = [ 0.4 , 0.8 ] , 0.7 ,
B ( a ) = [ 0.3 , 0.4 ] , 0.7 , B ( b ) = B ( c ) = [ 0.5 , 0.7 ] , 0.8 .
Then, we can easily see that A , B P C G P ( X ) . Moreover, we have
( A ˜ B ˜ ) ( b b ) = [ 0.3 , 0.5 ) ¬ [ 0.5 , 0.8 ] = ( A ˜ B ˜ ) ( b ) = ( A ˜ B ˜ ) ( b ) ( A ˜ B ˜ ) ( b ) .
Thus, A ˜ B ˜ I V F G P ( X ) . So A B P C G P ( X ) .
Remark 6.
For a groupoid X, let ( A j ) j J P C G P ( X ) [resp., R C G P ( X ) . Then, from Proposition 8, we can easily see that
{ A P C G P ( X ) : j J A j A } P C G P ( X )
[ resp . { A R C G P ( X ) : j J A j A } R C G P ( X ) ] .
In this case, we will denote { A P C G P ( X ) : j J A j A } P C G P ( X ) [resp., resp . { A R C G P ( X ) : j J A j A } R C G P ( X ) ] as j J P A j [resp., j J R A j ].
It is obvious that ( P C G P ( X ) , ) [resp., ( R C G P ( X ) , ) ] is a complete lattice with the least element 0 ^ [resp., 0 ¨ ] and the greatest element 1 ^ [resp., 1 ¨ ] , where for each ( A j ) j J P C G P ( X ) [resp., R C G P ( X ) ], the inf and the sup of ( A j ) j J are P i n f j J A j = j J P A j [resp., R i n f j J A j = j J R A j and P s u p j J A j = j J P A j [resp., R s u p j J A j = j J R A j ].
The following is an immediate consequence of Proposition 8.
Corollary 1.
For a groupoid X, let A C S ( X ) and let
( A ) P = { B P C G P ( X ) : A B } [ resp . ( A ) R = { B R C G P ( X ) : A B } ] .
Then, ( A ) P P C G P ( X ) [resp., ( A ) R R C G P ( X ) ].
In this case, ( A ) P [resp., ( A ) R ] is called the P-[resp., R-]cubic subgroupoid in X generated by A .
Proposition 9.
For a groupoid X, let ( A ) be the subgroupoid generated by A and let χ ( A ) P = [ χ ( A ) , χ ( A ) ] , χ ( A ) [resp., χ ( A ) R = [ χ ( A ) , χ ( A ) ] , χ ( A c ) ], where A 2 X . Then, we get
( χ A P ) = χ ( A ) P [ resp . ( χ A R ) = χ ( A ) R ] .
Proof. 
From Remark 2 (2) and Corollary 1, it is obvious that χ ( A ) P P C G P ( X ) [resp., χ ( A ) R R C G P ( X ) ]. Let B P C G P ( X ) [resp., B R C G P ( X ) ] such that B χ A P [resp., B χ A R ]. Then, clearly, for each x A ,
B ( x ) = [ 1 , 1 ] , 1 [ resp . B ( x ) = [ 1 , 1 ] , 0 ] .
Since B P C G P ( X ) [resp., B R C G P ( X ) ], we have: for any for any x , y A ,
B ( x y ) = [ 1 , 1 ] , 1 [ resp . B ( x y ) = [ 1 , 1 ] , 0 ] .
Thus B χ A P [resp., B χ A R ]. So, we get
χ ( A ) P { B P C G P ( X ) : B χ A P } = ( χ A P )
[ resp . χ ( A ) R { B R C G P ( X ) : B χ A R } = ( χ A R ) ] .
We can easily show that ( χ A P ) χ ( A ) P [resp., ( χ A R ) χ ( A ) R ]. Hence, the results hold. □
From the above Proposition, the subgoupoid lattice of X can be regarded as a sublattice of the cubic subgroupoid lattice of X. The following is an immediate consequence of Remark 3 and Proposition 3.3 in [35].
Proposition 10.
For a groupoid X, let ( A j ) j J P C L I ( X ) [resp., P C R I ( X ) , P C I ( X ) , R C L I ( X ) , R C R I ( X ) and R C I ( X ) ]. Then j J A j P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ], j J A j R C L I ( X ) [resp., R C R I ( X ) and R C I ( X ) ]and j J A j P C L I ( X ) [resp., P C R I ( X ) and P C I ( X ) ], j J A j R C L I ( X ) [resp., R C R I ( X ) and R C I ( X ) ].
Proposition 11.
Let f : X Y be a groupoid homomorphism and let B C S ( Y ) .
(1) If B P C G P ( Y ) [resp., R C G P ( Y ) ], then f 1 ( B ) P C G P ( X ) [resp., R C G P ( X ) ].
(2) If B P C L I ( Y ) [resp., P C R I ( Y ) , P C I ( Y ) , R C L I ( Y ) , R C R I ( Y ) and R C I ( Y ) ], then f 1 ( B ) P C L I ( X ) [resp., P C R I ( Y ) , P C I ( Y ) , R C L I ( Y ) , R C R I ( Y ) and R C I ( Y ) .
Proof. 
(1) Suppose B P C G P ( Y ) . Then, from Propositions 3.9 (c) in [31] and 4.1 in [35], f 1 ( B ˜ ) I V F G P ( X ) and f 1 ( B ) F G P ( X ) . Thus, according to Remark 2 (1), f 1 ( B ) P C G P ( X ) .
Now, suppose B R C G P ( Y ) . Since f 1 ( B ˜ ) I V F G P ( X ) , it is sufficient to show that f 1 ( B ) is a fuzzy anti-subgroupoid of X. Let x , y X . Then, we have
f 1 ( B ) ( x y ) = B ( f ( x y ) ) = B ( f ( x ) f ( y ) ) (Since f is a groupoid homomorphism).
B ( f ( x ) ) B ( f ( y ) ) (Since B is fuzzy anti-groupoid of Y).
= f 1 ( B ) ( x ) f 1 ( B ) ( y ) .
Then, f 1 ( B ) is a fuzzy anti-subgroupoid of X. Thus, according to Remark 2 (1), f 1 ( B ) R C G P ( X ) .
(2) Suppose B R C L I ( Y ) and let x , y X . Since B ˜ I V F L I ( Y ) , it is sufficient to show that f 1 ( B ) is a fuzzy anti-left ideal of X. Let x , y X . Then, we have
f 1 ( B ) ( x y ) = B ( f ( x y ) ) = B ( f ( x ) f ( y ) )
B ( f ( y ) ) (Since B is a fuzzy anti-left ideal of X).
= f 1 ( B ) ( y ) .
Thus, f 1 ( B ) is a fuzzy anti-left ideal of X. So, by Remark 3 (2), f 1 ( B ) R C L I ( X ) . The remainder’s proofs are similar. □
Definition 13.
Let A C S ( X ) . Then, we say that A has the P-sup-property [resp., R-sup-property], if for each T 2 X , there is t 0 T , such that
A ( t 0 ) = t T P A ( t ) = t T A ˜ ( t ) , t T A ( t )
resp . A ( t 0 ) = t T R A ( t ) = t T A ˜ ( t ) , t T A ( t ) .
It is clear that A C S ( X ) has the P-sup-property if and only if A ˜ and A have the sup-property. Furthermore, if A takes on only finitely many values, then it has the P-sup-property [resp., R-sup-property]. Jun et al. [19] called “ A C S ( X ) has the R-sup-property" as A has the cubic property.
Proposition 12.
Let f : X Y be a groupoid homomorphism, let A C S ( X ) has the P-sup-property [resp., R-sup-property].
(1) If A P C G P ( X ) [resp., R C G P ( X ) ], then f P ( A ) P C G P ( Y ) [resp., f R ( A ) R C G P ( Y ) ].
(2) If A P C L I ( X ) [resp., P C R I ( X ) , P C I ( X ) , R C L I ( X ) , R C R I ( X ) and R C I ( X ) ], then f P ( A ) P C L I ( Y ) [resp., P C R I ( Y ) , P C I ( Y ) ]and f R ( A ) R C L I ( Y ) [resp., R C R I ( Y ) , R C I ( Y ) ].
Proof. 
(1) Let A C S ( X ) have the P-sup-property and suppose A P C G P ( X ) . Then, according to Remark 2 (1), A ˜ I V F G P ( X ) and A F G P ( X ) . Thus, according to Propositions 3.11 in [31] and 4.2 in [35], f ( A ˜ ) I V F G P ( Y ) and f ( A ) F G P ( Y ) . So, f ( A ) P C G P ( Y ) .
Now, let A C S ( X ) have the R-sup-property and suppose A R C G P ( X ) . Since A ˜ I V F G P ( X ) , it is sufficient to prove that f R ( A ) is a fuzzy anti-subgroupoid of Y Let y , y Y . Then, we have
(i) f 1 ( y ) and f 1 ( y ) , (ii) f 1 ( y ) and f 1 ( y ) = ,
(iii) f 1 ( y ) = and f 1 ( y ) , (iv) f 1 ( y ) = and f 1 ( y ) = .
We prove only the case (i) and omit the remainders. Since A has the R-sup-property, there are x 0 f 1 ( y ) and x 0 f 1 ( y ) such that
A ( x 0 ) = t f 1 ( y ) A ( t ) a n d A ( x 0 ) = t f 1 ( y ) A ( t ) .
Then,
[ f R ( A ) ] ( y y ) = z f 1 ( y y ) A ( z )
A ( x 0 x 0 ) (Since f ( x 0 x 0 ) = f ( x 0 ) f ( x 0 ) = y y ).
[ A ( x 0 ) A ( x 0 ) ] (Since A is a fuzzy anti-subgroupoid).
= t f 1 ( y ) A ( t ) t f 1 ( y ) A ( t )
= [ f R ( A ) ] ( y ) [ f R ( A ) ] ( y ) .
Thus, f R ( A ) is a fuzzy anti-subgroupoid in Y. So, f R ( A ) R C G P ( Y ) .
(2) Since the proof is similar to (1), the proofs are omitted. □
Definition 14.
Let f : X Y be a mapping and let A C S ( X ) . Then, A is said to be f-invariant, if for any x , y X , f ( x ) = f ( y ) implies A ( x ) = A ( y ) .
It is obvious that A is f-invariant if and only if A ˜ and A are f-invariant. Moreover, we can easily see that if A is f-invariant, then f 1 ( f P ( A ) ) = A and f 1 ( f R ( A ) ) = A .
Example 5.
Let X = { a , b , c } , Y = { x , y } be sets and f : X Y be the mapping defined by f ( a ) = f ( b ) = x and f ( c ) = y . Consider two IVI-octahedron sets A , A in X given by:
A ( a ) = [ 0.4 , 0.8 ] , 0.8 , A ( b ) = [ 0.4 , 0.8 ] , , 0.8 , A ( c ) = [ 0.2 , 0.6 ] , 0.5 ,
B ( a ) = [ 0.4 , 0.8 ] , 0.5 , B ( b ) = [ 0.3 , 0.7 ] , 0.7 , B ( c ) = [ 0.2 , 0.6 ] , 0.8 .
Then, we can easily check that A is invariant but B is not invariant. Moreover, we can easily confirm that f 1 ( f P ( A ) ) = A and f 1 ( f R ( A ) ) = A .

4. Cubic Subgroups and Cubic Normal Subgroups

Throughout this section and the next section, G and G are grouped with the identities e and e , respectively, unless mentioned.
Definition 15.
Let S be a semigroup and A C S ( S ) . Then, A is called a P- [resp., an R-]cubic subsemigroup of S, if it satisfies the following condition: for any x , y S ,
A ( x y ) P A ( x ) P A ( y ) , i . e . , A ˜ ( x y ) A ˜ ( x ) A ˜ ( y ) , A ( x y ) A ( x ) A ( y )
[ resp . A ( x y ) R A ( x ) R A ( y ) , i . e . , A ˜ ( x y ) A ˜ ( x ) A ˜ ( y ) , A ( x y ) A ( x ) A ( y ) ] .
For each A I S , if A ( x y ) A ( x ) A ( y ) for any x , y S , then A will be called a fuzzy anti-subsemigroup of S.
Definition 16.
Let A C S ( G ) . Then, A is called a P- [resp., R-]cubic subgroup of S, if it satisfies the following conditions: for any x , y S ,
A ( x y ) P A ( x ) P A ( y ) [ resp . A ( x y ) R A ( x ) R A ( y ) ] ,
A ( x 1 ) P A ( x ) [ resp . A ( x 1 ) R A ( x ) ] .
We will denote the set of all P- [resp., R-]cubic subgroups of G as P C G ( G ) [resp., R C G ( G ) ]. An R-cubic subgroup was called a cubic subgroup by Jun et al. [19].
Let us denote the set of all interval-valued fuzzy subgroups (See [36]) [resp., fuzzy subgroups (See [35]) and fuzzy anti-subgroups (See [37]) of G as I V F G ( G ) [resp., F G ( G ) and F A G ( G ) ].
Remark 7.
(1) For each A C S ( G ) ,
  (a) A P C G ( G ) A ˜ I V F G ( G ) , A F G ( G ) .
  (b) A R C G ( G ) A ˜ I V F G ( G ) , A F A G ( G ) .
(2) For each H 2 G .
  (a) χ H P P C G ( G ) if and only if H is a subgroup.
  (b) χ H R R C G ( G ) if and only if H is a subgroup.
(3) Let A I G . If A F G ( G ) , then [ A , A ] , A P C G ( G ) and [ A , A ] , A c R C G ( G ) .
(4) Let A I G . If A F A G ( G ) , then we have
[ A c , A c ] , A R C G ( G ) a n d [ A c , A c ] , A c P C G ( G ) .
(5) Let A ˜ I V F S ( G ) . If A ˜ I V F G ( G ) , then we get
A ˜ , A , A ˜ , A + P C G ( G ) a n d A ˜ , ( A ) c , A ˜ , ( A + ) c R C G ( G ) .
Example 6.
Consider the additive group ( Z , + ) . Let A and B be the cubic sets in Z , defined as follows: for each 0 n Z ,
A ( n ) = [ 0.4 , 0.7 ] , 0.6 i f   n is odd [ 0.6 , 0.8 ] , 0.7 i f   n is even ,
B ( n ) = [ 0.4 , 0.7 ] , 0.7 i f   n is odd [ 0.6 , 0.8 ] , 0.6 i f   n is even ,
A ( 0 ) = [ 0.7 , 0.9 ] , 0.8 , B ( 0 ) = [ 0.7 , 0.9 ] , 0.4 .
Then, we can easily check that A P C G ( Z ) and B R C G ( Z ) .
Proposition 13.
If ( A j ) j J P C G ( G ) , then j J A j P C G ( G ) .
(2) If R C G ( G ) , then j J A j R C G ( G ) .
Proof. 
(1) The proof follows from Propositions 4.3 in [31] and 5.2 in [35].
(2) From Proposition 8 (2), it is clear that j J A j F A G P ( G ) . Then, it is sufficient to prove that ( j J A j ) ( x 1 ) ( j J A j ) ( x ) for each x G . Let x G . Then, we have
( j J A j ) ( x 1 ) = j J A j ( x 1 )
j J A j ( x ) (Since A j F A G ( G ) ).
= ( j J A j ) ( x ) .
Thus j J A j F A F ( G ) . So, according to Remark 7 (b) and Proposition 4.3 in [31], j J A j R C G ( G ) . □
Proposition 14.
(1) If A P C G ( G ) , then A ( x 1 ) = A ( x ) , i.e., A ˜ ( x 1 ) = A ˜ ( x ) , A ( x 1 ) = A ( x ) for each x G .
(2) (See Proposition 3.6, [19]) If A R C G ( G ) , then A ( x 1 ) = A ( x ) , i.e., A ˜ ( x 1 ) = A ˜ ( x ) , A ( x 1 ) = A ( x ) for each x G .
Proof. 
(1) The proof follows from Propositions 3.1 (i) in [36] and 5.4 in [35].
(2) See the proof of Proposition 3.6 in [19]. □
Proposition 15.
(1) If A P C G ( G ) , then A ( e ) P A ( x ) , i.e., A ˜ ( e ) A ˜ ( x ) , A ( e ) A ( x ) for each x G .
(2) (See Proposition 3.7, [19]) If A R C G ( G ) , then A ( e ) R A ( x ) , i.e., A ˜ ( e ) A ˜ ( x ) , A ( e ) A ( x ) for each x G .
Proof. 
(1) The proof follows from Propositions 3.1 (ii) in [36] and 5.4 in [35].
(2) See the proof of Proposition 3.7 in [19]. □
Theorem 3.
(1) A P C G ( G ) if and only if A ( x y 1 ) P A ( x ) P A ( y ) , i.e., A ˜ ( x y 1 ) A ˜ ( x ) A ˜ ( y ) , A ( x y 1 ) A ( x ) A ( y ) for each x G .
(2) (See Theorem 3.10, [19]) A R C G ( G ) if and only if A ( x y 1 ) R A ( x ) R A ( y ) , i.e., A ˜ ( x y 1 ) A ˜ ( x ) A ˜ ( y ) , A ( x y 1 ) A ( x ) A ( y ) for each x G .
Proof. 
The proof follows from Propositions 3.2 in [36] and 5.6 in [35].
(2) See the proof of Theorem 3.10 in [19]. □
The following can be easily seen.
Proposition 16.
If A P C G ( G ) [resp., A R C G ( G ) ], then A P A = A [resp., A R A = A .]
Proposition 17.
(1) Let A P C G ( G ) . If A ( x y 1 ) = A ( e ) for any x , y G , then A ( x ) = A ( y ) , i.e., A ˜ ( x ) = A ˜ ( y ) , A ( x ) = A ( y ) .
(2) (See Proposition 3.7, [19]) If A ( x y 1 ) = A ( e ) for any x , y G , then A ( x ) = A ( y ) , i.e., A ˜ ( x ) = A ˜ ( y ) , A ( x ) = A ( y ) .
Proof. 
(1) The proof follows from Propositions 4.7 in [31] and 5.5 in [35].
(2) See the proof of Proposition 3.7 in [19]. □
Proposition 18.
For each A C S ( G ) , consider the subset G A of G defined as follows:
G A = { x G : A ( x ) = A ( e ) } = { x G : A ˜ ( x ) = A ˜ ( e ) , A ( x ) = A ( e ) } .
If A P C G ( G ) [resp., A R C G ( G ) ], then G A is a subgroup of G.
Proof. 
(The proof of the first part follows from Proposition 4.6 in [31] and Corollary of 5.4 in [35]. For the proof of second part, see Theorem 3.11 in [19]. □
Theorem 4.
Let A C S ( G ) and let [ A ] P , a ˜ ˜ and [ A ] R , a ˜ ˜ for any cubic number a ˜ ˜ .
(1) A P C G ( G ) if and only if [ A ] P , a ˜ ˜ is a subgroup of G.
(2) A R C G ( G ) if and only if [ A ] R , a ˜ ˜ is a subgroup of G.
Proof. 
(1) The proof is straightforward from Propositions 4.16, 4.17 in [31] and Theorems 2.1, 2.2 in [38].
(2) See the proof of Theorem 3.12 in [19]. □
Proposition 19.
(1) Every A P C L I ( G ) [resp., P C L I ( G ) and P C I ( G ) ]is a constant.
(2) Every A R C L I ( G ) [resp., R C L I ( G ) and R C I ( G ) ]is a constant.
Proof. 
(1) The proof is straightforward from Propositions 4.14 in [31] and 5.9 in [35].
(2) The proof is similar to (1). □
Proposition 20.
let f : G G be a group homomorphism. If B P C G ( G ) [resp., R C G ( G ) ], then f 1 ( A ) P C G ( G ) [resp., R C G ( G ) ].
Proof. 
From Propositions 3.4 in [36] and 5.8 in [35], the proof of the first part is easy. For the proof of the second part, see Theorem 3.13 (2) in [19]. □
Proposition 21.
let f : G G be a group homomorphism and let A C S ( G ) .
(1) If A P C G ( G ) and A have the P-sup-property, then f P ( A ) P C G ( G ) .
(2) If A R C G ( G ) and A have the R-sup-property, then f R ( A ) P C G ( G ) .
Proof. 
(1) The proof follows from Propositions 4.11 (b) in [31] and 5.8 in [35]
(2) See Theorem 3.13 (1) in [19]. □
Definition 17.
Let A C S ( G ) . Consider the following condition:
A ( x y ) = A ( y x ) , i . e . , A ˜ ( x y ) = A ˜ ( y x ) , A ( x y ) = A ( y x ) f o r a n y x , y G .
Then, A is called:
(1) a P-cubic normal subgroup (briefly, PCNG) of G, if A P C G ( G ) and (10) holds,
(2) an R-cubic normal subgroup (briefly, RCNG) of G, if A R C G ( G ) and (10) holds.
We will denote the set of all PCNGs [resp., RCNGs] of G as P C N G ( G ) [resp., R C N G ( G ) ].
Let us denote the set of all interval-valued fuzzy normal subgroups [resp., fuzzy normal subgroups and fuzzy anti-normal subgroups] of G as I V F N G ( G ) [resp., F N G ( G ) and F A N G ( G ) ]
Remark 8.
(1) Let G be a commutative group and let A P C G ( G ) [resp., R C G ( G ) ]. Then, A P C N G ( G ) [resp., R C N G ( G ) ].
(2) A P C N G ( G ) if and only if A ˜ I V F N G ( G ) and A F N G ( G ) .
(3) A R C N G ( G ) if and only if A ˜ I V F N G ( G ) and A F A N G ( G ) .
Example 7.
Consider the general linear group of degree n G L ( n ; R ) . Then, clearly, G L ( n ; R ) is a noncommutative group. Let A , B be the cubic sets in G L ( n ; R ) as follows: for any I n M G L ( n ; R ) , where I n is the unit matrix, is the unit matrix,
A ( M ) = [ 0.2 , 0.6 ] , 0.4 i f   M i s n o t a t r i a n g u l a r m a t r i x [ 0.3 , 0.5 ] , 0.8 i f   M i s a t r i a n g u l a r m a t r i x ,
B ( M ) = [ 0.2 , 0.6 ] , 0.8 i f   M i s n o t a t r i a n g u l a r m a t r i x [ 0.3 , 0.5 ] , 0.4 i f   M i s a t r i a n g u l a r m a t r i x ,
A ( I n ) = [ 1 , 1 ] , 1 , B ( I n ) = [ 1 , 1 ] , 0 .
Then, we can easily check that A P C N G ( G L ( n ; R ) ) and B R C N G ( G L ( n ; R ) ) .
Proposition 22.
Let A , B C S ( G ) .
(1) If B P C N G ( G ) , then A P B = B P A .
(2) If B R C N G ( G ) , then A R B = B R A .
Proof. 
(1) The proof is straightforward from Propositions 5.2 in [31] and 2.1 (i) in [30].
(2) Suppose B R C N G ( G ) and let x G . Then, we have
( A R B ) ( x ) = x = y ( y 1 x ) [ A ( y ) B ( y 1 x ) ] [By Remark 1 (2)]
= x = y ( y 1 x ) [ B ( y 1 x ) A ( y ) ]
= x = ( x y 1 ) y ) [ B ( x y 1 ) A ( y ) ] [By the hypothesis]
= ( B R A ) ( x ) .
Thus, by Remark 1 (2) and Proposition 5.2 in [31], A R B = B R A .
Proposition 23.
Let A , B C S ( G ) .
(1) If A P C N G ( G ) and B P C G ( G ) , then B P A P C G ( G ) .
(2) If A R C N G ( G ) and B R C G ( G ) , then B R A R C G ( G ) .
Proof. 
(1) The proof follows from Propositions 5.3 in [31] and 2.1 (ii) in [30].
(2) Suppose B R C N G ( G ) and B R C G ( G ) . Then, from Definitions 7 and 10 (ii), we can easily see that B R A F A G P ( G ) . Thus, it is sufficient to show that ( B R A ) ( x 1 ) ( B R A ) ( x ) for each x G . Let x G . Then, we get
( B R A ) ( x 1 ) = x 1 = y z [ B ( y ) A ( z ) ]
= x = z 1 y 1 [ B ( ( y 1 ) 1 ) A ( ( z 1 ) 1 ) ]
x = z 1 y 1 [ B ( y 1 ) A ( z 1 ) ] (According to the second part of (10))
= ( A R B ) ( x )
= ( B R A ) ( x ) . (According to Proposition 22 (2))
Thus, B R A F A G ( G ) . So, according to Proposition 4.3 in [31] and Remark 7 (1), B R A R C G ( G ) .
Proposition 24.
Let A , B C S ( G ) .
(1) If A , B P C N G ( G ) , then A P B P C N G ( G ) .
(2) If A , B R C N G ( G ) , then A R B R C N G ( G ) .
Proof. 
(1) The proof is clear from Corollary 5.3 in [31] and Theorem 3.11 in [39].
(2) Since A ˜ B ˜ I V F N G ( G ) by (Corollary 5.3 [31]), it is sufficient to show that A R B F A N G ( G ) . Let a , b G . Then, there are x , y G such that a b = x y . Since b = a 1 x y , b a = ( a 1 x a ) ( a 1 y a ) . Thus, we have
( A R B ) ( a b ) = a b = x y [ A ( x ) B ( y ) ]
= b a = ( a 1 x a ) ( a 1 y a ) [ A ( a 1 x a ) B ( a 1 y a ) ]
= ( A R B ) ( b a ) .
So A R B F A N G ( G ) . Hence, A R B R C N G ( G ) .
The following is an immediate consequence of Propositions 22, 16 and 24.
Corollary 2.
( P C N G ( G ) , P ) [resp., ( R C N G ( G ) , R ) ]is a semilattice (i.e., a commutative idempotent semigroup).
Proposition 25.
If A P C N G ( G ) [resp., A R C N G ( G ) ], then G A is a normal subgroup of G.
In this case, G / G A is called a cubic quotient group of G with respect to A .
Proof. 
The proof is straightforward. □
Remark 9.
It is obvious that if N is a normal subgroup of G, then χ N P P C N G ( G ) [resp., χ N R R C N G ( G ) ] and G χ N P = N = G χ N R .
Proposition 26.
Let A , B C S ( G ) . If A P C N G ( G ) [resp., A R C N G ( G ) ], then π 1 ( π P ( B ) ) = χ G A P B [resp., π 1 ( π R ( B ) ) = χ G A R B ], where π : G G / G A denotes the natural mapping.
Proof. 
The proof of the first part is straightforward from Propositions 5.6 in [31] and 2.3 in [30]. To prove the second part, let x G . Then, we have
[ π 1 ( π R ( B ) ) ] ( x ) = [ π R ( B ) ] ( π ( x ) ) = π ( x ) = π ( y ) B ( y ) = x y 1 G A B ( y )
and
( χ G A R B ) ( x ) = x = z y [ χ G A ( z ) B ( y ) ] = z = x y 1 G A B ( y ) .
Thus, π 1 ( π R ( B ) ) = χ G A R B . So, according to Proposition 5.6 in [31] and Definition 4, π 1 ( π R ( B ) ) = χ G A R B . □
Theorem 5.
Let A C S ( G ) and let [ A ] P , a ˜ ˜ and [ A ] R , a ˜ ˜ for any cubic number a ˜ ˜ .
(1) A P C N G ( G ) if and only if [ A ] P , a ˜ ˜ is a normal subgroup of G.
(2) A R C N G ( G ) if and only if [ A ] R , a ˜ ˜ is a normal subgroup of G.
Proof. 
(1) From Theorem 4 (1), it is obvious that A ˜ I V F G ( G ) if and only if [ A ˜ ] a ˜ is a subgroup of G and A F G ( G ) if and only if [ A ] a is a subgroup of G. Moreover, A F N G ( G ) if and only if [ A ˜ ] a is a normal subgroup of G (see Propositions 3.2 and 3.4 in [40] and [41] respectively). Then, it is sufficient to prove that A ˜ I V F N G ( G ) if and only if [ A ˜ ] a ˜ is a normal subgroup of G.
Suppose A ˜ I V F N G ( G ) and let y [ A ˜ ] a ˜ , x G . Then,
A ˜ ( x y x 1 ) = A ˜ ( y ) (According to the hypothesis)
a ˜ . (Since y [ A ˜ ] a ˜ )
Thus, x y x 1 [ A ˜ ] a ˜ . So, according to Theorem 4 (1), [ A ˜ ] a ˜ is a normal subgroup of G.
Conversely, suppose [ A ˜ ] a ˜ is a normal subgroup of G. Assume that there are x , y G such that A ˜ ( x y ) A ˜ ( y x ) , say A ˜ ( x y ) > A ˜ ( y x ) . Then, there is a cubic number a ˜ , such that A ˜ ( x y ) > a ˜ > A ˜ ( y x ) . Thus, x y [ A ˜ ] a ˜ but y x [ A ˜ ] a ˜ . This contradicts the normality of [ A ˜ ] a ˜ . So A ˜ ( x y ) = A ˜ ( y x ) . Hence, A ˜ is normal.
(2) From 4 (2), it is obvious that A ˜ I V F G ( G ) if and only if [ A ˜ ] a ˜ is a subgroup of G and A F A G ( G ) if and only if [ A ] R , a is a subgroup of G. Since A ˜ is normal if and only if [ A ˜ ] a ˜ is normal by (1), it is sufficient to show that the fuzzy anti-subgroup A is normal if and only if [ A ] R , a is normal.
Suppose A F A G ( G ) is normal and let x G , y [ A ] R , a . Then, we have
A ( x y x 1 ) = A ( y ) a .
Thus, x y x 1 [ A ] R , a . So [ A ] R , a is normal. The proof of the converse is similar to the converse of (1). □
Proposition 27.
let f : G G be a group homomorphism. If B P C N G ( G ) [resp., R C N G ( G ) ], then f 1 ( A ) P C N G ( G ) [resp., R C N G ( G ) ].
Proof. 
The proof follows from Proposition 20, Definitions 4 and 17. □
Proposition 28.
let f : G G be a group homomorphism and let A C S ( G ) .
(1) If A P C N G ( G ) and A has the P-sup-property, then f P ( A ) P C N G ( G ) .
(2) If A R C N G ( G ) and A has the R-sup-property, then f R ( A ) P C N G ( G ) .
Proof. 
The proof is straightforward from Proposition 21, Definitions 4 and 17. □

5. Cubic Congruences

A relation R on a groupoid X is said to be left compatible [resp., right compatible and compatible], if for any a , b , c , d , x X ,
( a , b ) R i m p l i e s ( x a , x b ) R
[ r e s p . ( a , b ) R i m p l i e s ( a x , b x ) R a n d ( a , b ) R , ( c , d ) R i m p l y ( a c , b d ) R ] .
A left [resp., right] compatible equivalence relation on X is called a left [resp. right] congruence on X. A compatible equivalence relation on X is called a congruence on X. It is well known (Proposition 1.5 [25]) that a relation R on a groupoid X if and only if it is both a left and a right congruence on X.
Definition 18
(See [34]). For a groupoid X, a mapping R = R , R : X × X [ I ] × I is called a cubic relation on X. In fact, R is an interval-valued fuzzy relation on X (See [36]) and R is a fuzzy relation on X (see [2]). We denote the set of all cubic (resp., interval-valued fuzzy and fuzzy) relation on X as C R ( X ) (resp., I V F R ( X ) and F R ( X ) ).
Definition 19.
For a groupoid X, let R , S C R ( X ) .
(i) The P-composition of R and S (See [34]), denoted by S P R = S ˜ R ˜ , S R , is a cubic relation on X defined as follows: for each ( x , z ) X × X ,
( S P R ) ( x , z ) = y X [ R ( x , y ) P S ( y , z ) ] = ( S ˜ R ˜ ) ( x , z ) , ( S R ) ( x , z ) ,
where ( S ˜ R ˜ ) ( x , z ) = y X [ R ˜ ( x , y ) S ˜ ( y , z ) and ( S R ) ( x , z ) = y X [ R ( x , y ) S ( y , z ) .
(ii) The R-composition of R and S , denoted by S R R = S ˜ R ˜ , S R R , is a cubic relation on X defined as follows: for each ( x , z ) X × X ,
( S R R ) ( x , z ) = y X [ R ( x , y ) R S ( y , z ) ] = ( S ˜ R ˜ ) ( x , z ) , ( S R R ) ( x , z ) ,
where ( S ˜ R ˜ ) ( x , z ) = y X [ R ˜ ( x , y ) S ˜ ( y , z ) and ( S R R ) ( x , z ) = y X [ R ( x , y ) S ( y , z ) .
Definition 20.
For a groupoid X, let R = R ˜ , R C R ( X ) . Then, R is said to be called a P-cubic equivalence relation on X (see [34]), if it satisfies the following conditions:
(i) P-cubic reflexive (see [34]), if R ( x , x ) = [ 1 , 1 ] , 1 , i.e., R ˜ ( x , x ) = [ 1 , 1 ] and R ( x , x ) = 1 for each x X ,
(ii) R-cubic reflexive, if R ( x , x ) = [ 1 , 1 ] , 0 , i.e., R ˜ ( x , x ) = [ 1 , 1 ] and R ( x , x ) = 0 for each x X ,
(iii) symmetric (see [34]), if R ( x , y ) = R ( y , x ) for each ( x , y ) X × X ,
(iv) P-cubic transitive (See [34]), if R P R R , i.e., R ˜ R ˜ R ˜ (see [42]) and R R R (see [2]),
(v) R-cubic transitive, if R R R R , i.e., R ˜ R ˜ R ˜ and R R R R ,
(vi) a P-cubic equivalence relation on X, if it satisfies the conditions (i), (iii) and (iv),
(vii) an R-cubic equivalence relation on X, if it satisfies the conditions (ii), (iii) and (v).
We will denote the set of all P-cubic (resp.,, R-cubic, interval-valued fuzzy and fuzzy) equivalence relations on X as P C E ( X ) (resp.,, R C E ( X ) , I V F E ( X ) and F E ( X ) ).
If a fuzzy relation R on X satisfies the second part of (ii), (iii) and the second part of (v), then R is called a fuzzy anti-equivalence relation on X, and we denote the set of all fuzzy anti-equivalence relations on X as F A E ( X ) .
Remark 10.
(1) Let R be a classical equivalence relation on a groupoid X. Then, clearly,
χ R P = [ χ R , χ R ] , χ R P C E ( X ) a n d χ R R = [ χ R , χ R ] , χ R c R C E ( X ) .
(2) Let X be a groupoid and let R ˜ I V F E ( X ) . Then, we can easily check that
R ˜ , R , R ˜ , R + P C E ( X ) a n d R ˜ , ( R ) c , R ˜ , ( R + ) c R C E ( X ) .
(3) Let X be a groupoid and let R F E ( X ) . Then, we have
[ R , R ] , R P C E ( X ) a n d [ R , R ] , R c R C E ( X ) .
Definition 21.
For a groupoid X, let R C R ( X ) .
(i) R is said to be P-cubic left compatible, if for any a , b , x G ,
R ( a , b ) P R ( x a , x b ) , i . e . , R ˜ ( a , b ) R ˜ ( x a , x b ) a n d R ( a , b ) R ( x a , x b ) ,
(ii) R is said to be P-cubic right compatible, if for any a , b , x G ,
R ( a , b ) P R ( a x , b x ) , i . e . , R ˜ ( a , b ) R ˜ ( a x , b x ) a n d R ( a , b ) R ( a x , b x ) ,
(iii) R said to be P-cubic compatible, if for any a , b , c , d G ,
R ( a c , b d ) P R ( a , b ) P R ( c , d ) , i . e . ,
R ˜ ( a c , b d ) R ˜ ( a , b ) R ˜ ( c , d ) a n d R ( a c , b d ) R ( a , b ) R ( c , d ) ,
(iv) R is said to be R-cubic left compatible, if for any a , b , x G ,
R ( a , b ) R R ( x a , x b ) , i . e . , R ˜ ( a , b ) R ˜ ( x a , x b ) a n d R ( a , b ) R ( x a , x b ) ,
(v) R is said to be R-cubic right compatible, if for any a , b , x G ,
R ( a , b ) R R ( a x , b x ) , i . e . , R ˜ ( a , b ) R ˜ ( a x , b x ) a n d R ( a , b ) R ( a x , b x ) ,
(vi) R is said to be R-cubic compatible, if for any a , b , c , d G ,
R ( a c , b d ) R R ( a , b ) P R ( c , d ) , i . e . ,
R ˜ ( a c , b d ) R ˜ ( a , b ) R ˜ ( c , d ) a n d R ( a c , b d ) R ( a , b ) R ( c , d ) .
If a fuzzy relation R on X satisfies the second part of (iv) (resp., (v) and (vi)), then R is called a fuzzy anti-left compatible [resp., anti-right compatible and anti-compatible].
Example 8.
Let X = { e , a , b } be the groupoid with the following Cayley table (see Table 6):
Consider six cubic relations R i ( i { 1 , 2 , 3 , 4 , 5 , 6 } ) on X given by (see Table 7):
where a ˜ ˜ i j is a cubic number. Let us give the relationships between cubic numbers in R i .
The relationships between cubic numbers in R 1 :
a ˜ ˜ 21 a n d a ˜ ˜ 31 a r e a r b i t r a r y , a n d a ˜ ˜ 23 = a ˜ ˜ 32 , a ˜ ˜ 22 = a ˜ ˜ 33 , a ˜ ˜ 11 P a ˜ ˜ 22 ,
a ˜ ˜ 12 P a ˜ ˜ 23 P a ˜ ˜ 22 , a ˜ ˜ 13 P a ˜ ˜ 23 P a ˜ ˜ 22 , a ˜ ˜ 21 P a ˜ ˜ 23 P a ˜ ˜ 22 , a ˜ ˜ 31 P a ˜ ˜ 23 P a ˜ ˜ 22 .
The relationships between cubic numbers in R 2 :
a ˜ ˜ 11 P a ˜ ˜ 21 , a ˜ ˜ 12 P a ˜ ˜ 31 , a ˜ ˜ 13 P a ˜ ˜ 31 , a ˜ ˜ 21 P a ˜ ˜ 31 , a ˜ ˜ 32 P a ˜ ˜ 22 ,
a ˜ ˜ 33 P a ˜ ˜ 23 = a ˜ ˜ 22 , a n d t h e r e m a i n d e r s a r e a r b i t r a r y .
The relationships between cubic numbers in R 3 :
a ˜ ˜ 11 P a ˜ ˜ 12 P a ˜ ˜ 12 , a ˜ ˜ 11 P a ˜ ˜ 13 P a ˜ ˜ 13 , a ˜ ˜ 12 P a ˜ ˜ 13 P a ˜ ˜ 12 ,
a ˜ ˜ 21 P a ˜ ˜ 22 P a ˜ ˜ 32 , a ˜ ˜ 21 P a ˜ ˜ 23 P a ˜ ˜ 33 , a ˜ ˜ 22 P a ˜ ˜ 23 P a ˜ ˜ 32 ,
a ˜ ˜ 31 P a ˜ ˜ 32 P a ˜ ˜ 22 , a ˜ ˜ 31 P a ˜ ˜ 33 P a ˜ ˜ 22 , a ˜ ˜ 31 P a ˜ ˜ 33 P a ˜ ˜ 23 ,
a ˜ ˜ 32 P a ˜ ˜ 33 P a ˜ ˜ 22 .
The relationships between cubic numbers in R 4 :
a ˜ ˜ 21 a n d a ˜ ˜ 31 a r e a r b i t r a r y , a n d a ˜ ˜ 23 = a ˜ ˜ 32 , a ˜ ˜ 22 = a ˜ ˜ 33 , a ˜ ˜ 11 R a ˜ ˜ 22 ,
a ˜ ˜ 12 R a ˜ ˜ 23 R a ˜ ˜ 22 , a ˜ ˜ 13 R a ˜ ˜ 23 R a ˜ ˜ 22 , a ˜ ˜ 21 R a ˜ ˜ 23 R a ˜ ˜ 22 , a ˜ ˜ 31 R a ˜ ˜ 23 R a ˜ ˜ 22 .
The relationships between cubic numbers in R 5 :
a ˜ ˜ 11 R a ˜ ˜ 21 , a ˜ ˜ 12 R a ˜ ˜ 31 , a ˜ ˜ 13 R a ˜ ˜ 31 , a ˜ ˜ 21 R a ˜ ˜ 31 , a ˜ ˜ 32 R a ˜ ˜ 22 ,
a ˜ ˜ 33 R a ˜ ˜ 23 = a ˜ ˜ 22 , a n d t h e r e m a i n d e r s a r e a r b i t r a r y .
The relationships between cubic numbers in R 6 :
a ˜ ˜ 11 R a ˜ ˜ 12 R a ˜ ˜ 12 , a ˜ ˜ 11 R a ˜ ˜ 13 R a ˜ ˜ 13 , a ˜ ˜ 12 R a ˜ ˜ 13 R a ˜ ˜ 12 ,
a ˜ ˜ 21 R a ˜ ˜ 22 R a ˜ ˜ 32 , a ˜ ˜ 21 R a ˜ ˜ 23 R a ˜ ˜ 33 , a ˜ ˜ 22 R a ˜ ˜ 23 R a ˜ ˜ 32 ,
a ˜ ˜ 31 R a ˜ ˜ 32 R a ˜ ˜ 22 , a ˜ ˜ 31 R a ˜ ˜ 33 R a ˜ ˜ 22 , a ˜ ˜ 31 R a ˜ ˜ 33 R a ˜ ˜ 23 ,
a ˜ ˜ 32 R a ˜ ˜ 33 R a ˜ ˜ 22 .
Then, we can easily check that R 1 [resp., R 2 and R 3 ] is a P-cubic left [resp., P-cubic right and P-cubic] compatible relation on X and R 4 [resp., R 5 and R 6 ] is an R-cubic left [resp., R-cubic right and R-cubic] compatible relation on X.
Theorem 6.
Let R be a relation on a groupoid X. Then, the following are equivalent:
(1) R is left compatible.
(2) χ R P is P-cubic left compatible.
(3) χ R R is R-cubic left compatible.
Proof. 
(1)⟺(2): The proof follows from Lemmas 3.4 in [43] and 2.1 in [39].
(1)⟺(3): Suppose the condition (1) holds. Since [ χ R , χ R ] is an interval-valued fuzzy left compatible by (Lemmas 3.4 [43]), it is sufficient to prove that χ R c is fuzzy left compatible. Let a , b , x X .
Case 1. Suppose ( a , b ) R . Then, clearly, χ R c ( a , b ) = 0 . By the condition (1), ( x a , x b ) R . Thus, χ R c ( x a , x b ) = 0 . So χ R c ( x a , x b ) = χ R c ( a , b ) .
Case 2. Suppose ( a , b ) R . Then, we have
χ R c ( a , b ) = 1 χ R c ( x a , x b ) .
In either cases, χ R c ( a , b ) χ R c ( x a , x b ) . Hence, χ R R is R-cubic left compatible.
Suppose the condition (3) holds. Let ( a , b ) R and let x X . Then, according to condition (3), we have
χ R R ( a , b ) = [ 1 , 1 ] , 0 R χ R R ( x a , x b ) .
Thus, χ R c ( a , b ) = 0 χ R c ( x a , x b ) . So ( x a , x b ) R . Hence, R is left compatible. □
Then, we follow the dual of Theorem 6.
Theorem 7.
Let R be a relation on a groupoid X. Then, the following are equivalent:
(1) R is right compatible.
(2) χ R P is P-cubic right compatible.
(3) χ R R is R-cubic right compatible.
Definition 22.
Let X be a groupoid and let R C R ( X ) .
(i) R is called a P-cubic left congruence (briefly, PCLC), if R P C E and R is P-cubic left compatible.
(ii) R is called a P-cubic right congruence (briefly, PCRC) on X, if R P C E and R is P-cubic right compatible.
(iii) R is called a P-cubic congruence (briefly, PCC) on X, if R P C E and R is P-cubic compatible.
(iv) R is called a R-cubic left congruence (briefly, RCLC) on X, if R R C E and R is R-cubic left compatible.
(v) R is called a R-cubic right congruence (briefly, RCRC) on X, if R R C E and R is R-cubic right compatible.
(vi) R is called a R-cubic congruence (briefly, RCC) on X, if R R C E and R is R-cubic compatible.
A fuzzy relation R is called a fuzzy anti-left congruence (briefly, FALC) [resp., anti-right congruence (briefly, FARC) and anti-congruence (briefly, FAC)] on X, if R F A E ( X ) and R is fuzzy anti-left compatible [resp., anti-right compatible and anti-compatible].
We will denote the set of all PCLCs [resp., PCRCs, PCCs, RCLCs, RCRCs and RCCs] on X as P C L C ( X ) [resp., P C R C ( X ) , P C C ( X ) , R C L C ( X ) , R C R C ( X ) and R C C ( X ) ].
Example 9.
Let X = { e , a , b } be the groupoid given in Example 8. Consider two cubic relations, R and S , on X, defined as follows (see Table 8 and Table 9):
Then, we can easily check that R P C C ( X ) and S R C C ( X ) .
Let us denote the set of all fuzzy left congruences [resp., right congruences and congruences] and all interval-valued fuzzy left congruences [resp., right congruences and congruences] on X as F L C ( X ) [resp., F R C ( X ) and F C ( X ) ] and I V F L C ( X ) [resp., I V F R C ( X ) and I V F C ( X ) ].
Remark 11.
(1) For a groupoid X, let R F L C ( X ) [resp., F R C ( X ) , F C ( X ) , F A L C ( X ) , F A R C ( X ) and F A C ( X ) ]. Then, [ R , R ] , R P C L C ( X ) [resp., P C R C ( X ) , P C C ( X ) , R C L C ( X ) , R C R C ( X ) and R C C ( X ) ].
(2) For a groupoid X, let R I V F L C ( X ) [resp., I V F R C ( X ) and I V F C ( X ) ]. Then, R , R , R , R + P C L C ( X ) [resp., P C R C ( X ) and P C C ( X ) ]. Moreover, R , ( R ) c , R , ( R + ) c R C L C ( X ) [resp., R C R C ( X ) and R C C ( X ) ].
Theorem 8.
For a groupoid X, let R P C E ( X ) or R R C E ( X ) . Then,
(1) R P C C ( X ) if and only if R P C L C ( X ) and R P C R C ( X ) .
(2) R R C C ( X ) if and only if R R C L C ( X ) and R R C R C ( X ) .
Proof. 
(1) The proof is straightforward from Proposition 3.8 in [43] and Theorem 2.3 in [39].
(2) From Proposition 3.8 in [43], it is obvious that R ˜ I V F C ( X ) if and only if R ˜ I V F L C ( X ) and R ˜ I V F R C ( X ) . Then, it is sufficient to show that R F A C ( X ) if and only if R F A L C ( X ) and R F A R C ( X ) .
Suppose R F A C ( X ) and let a , b , x X . Then, we have
R ( x a , x b ) R ( x , x ) R ( a , b ) (Since R is fuzzy anti-compatible).
= 0 R ( a , b ) (Since R is fuzzy anti-reflexive)
= R ( a , b ) .
Thus, R is fuzzy anti-left compatible. It is clear that R F A E ( X ) . So R F A L C ( X ) . Similarly, we can see that R F A R C ( X ) .
Conversely, suppose R F A L C ( X ) and R F A R C ( X ) . Let a , ! b , c , d X . Then, we get
R ( a c , b d ) x X [ R ( a c , x ) R ( x , b d ) ] [Since R R R R ]
R ( a c , b c ) R ( b c , b d ) (Since b c X )
R ( a , b ) R ( c , d ) . (According to the hypothesis)
Thus R is fuzzy anti-compatible. So, R F A C ( X ) . □
From Remark 10 (1), Theorems 6, 7 and 8, we obtain the following.
Theorem 9.
Let R be a relation on a groupoid X. Then, the following are equivalent:
(1) R is a congruence.
(2) χ R P P C C ( X ) .
(3) χ R R R C C ( X ) .
Lemma 1.
For a groupoid X, let R , S C R ( X ) .
(1) If R and S are P-cubic reflexive, then S P R is P-cubic reflexive.
(2) If R and S are R-cubic reflexive, then S R R is R-cubic reflexive.
Proof. 
(1) Let x X . Then, we have
( S ˜ R ˜ ) ( x , x ) = y X [ R ˜ ( x , y ) R ˜ ( y , x ) ]
R ˜ ( x , x ) R ˜ ( x , x )
= [ 1 , 1 ] . (Since R ˜ and S ˜ are reflexive).
It is obvious that ( S ˜ R ˜ ) ( x , x ) [ 1 , 1 ] . Thus, ( S ˜ R ˜ ) ( x , x ) = [ 1 , 1 ] . So S ˜ R ˜ is interval-valued fuzzy reflexive. Moreover, S R is fuzzy reflexive from Proposition 4.7 in [44]. Hence, S P R is P-cubic reflexive.
(2) Let x X . Then, we have
( S R R ) ( x , x ) = y X [ R ( x , y ) S ( y , x ) ]
R ( x , x ) S ( x , x )
= 0 . (Since R and S are fuzzy anti-reflexive).
It is obvious that ( S R R ) ( x , x ) 0 . Thus, ( S R R ) ( x , x ) = 0 . So, S R R is fuzzy anti-reflexive. From (1), S ˜ R ˜ is interval-valued fuzzy reflexive. Hence, S R R is R-cubic reflexive. □
Lemma 2.
For a groupoid X, let R , S C R ( X ) .
(1) If R and S are P-cubic compatible, then S P R is P-cubic compatible.
(2) If R and S are R-cubic compatible, then S R R is R-cubic compatible.
Proof. 
(1) The proof is clear from Lemmas 3.13 in [43] and 2.7 in [39].
(2) Let a , b , x X . Then, we have
( S R R ) ( x a , x b ) = z X [ R ( x a , z ) S ( z , x b ) ]
R ( x a , x z ) S ( x z , x b )
R ( a , z ) S ( z , b )
[Since R and S are fuzzy anti-left compatible]
z X [ R ( a , z ) S ( z , b ) ]
= ( S R R ) ( a , b ) .
Thus, S R R is fuzzy anti-left compatible. Similarly, we can see that S R R is fuzzy anti-right compatible. So S R R is fuzzy anti-compatible. From Lemma 3.13 in [43], S ˜ R ˜ is interval-valued fuzzy compatible. Hence, S R R is R-cubic compatible. □
The following is an immediate consequence of (Theorem 3.14 [43]) and (Theorem 2.8 [39]).
Theorem 10.
Let R and S be P-cubic congruences on a groupoid X. Then, the following are equivalent:
(1) S P R P C C ( X ) .
(2) S P R P C E ( X ) .
(3) S P R is cubic symmetric.
(4) S P R = R P S .
Lemma 3.
Let R and S be fuzzy anti-congruences on a groupoid X. Then, the following are equivalent:
(1) S R R F A C ( X ) .
(2) S R R F A E ( X ) .
(3) S R R is fuzzy symmetric.
(4) S R R = R R S .
Proof. 
(1)⟺(2): The proof is straightforward.
(2)⟺(3): The proof is straightforward.
(3)⟺(4): Suppose the condition (3) holds and let ( x , z ) X × X . Then, we have
( R R S ) ( x , z ) = y X [ S ( x , y ) R ( y , z ) ]
= y X [ S ( y , x ) R ( z , y ) ]
(Since R and S are fuzzy symmetric)
= y X [ R ( z , y ) S ( y , x ) ]
= ( S R R ) ( y , z )
= ( S R R ) ( x , y ) . (According to the hypothesis)
Thus, R R S = S R R .
(4)⟺(1): Suppose the condition (4) holds. Then, we have
( S R R ) R ( S R R ) = S R ( R R S ) R R
= S R ( S R R ) R R
= ( S R S ) R ( R R R )
S R R .
(Since R and S are fuzzy anti-transitive).
Thus, S R R is fuzzy anti-transitive. It is obvious that S R R is fuzzy anti-reflexive due to Lemma 1 (2). Moreover, S R R is fuzzy symmetric from the proof’s procedure of Theorem 2.8 in [39]. So S R R F A E ( X ) . It follows from Lemma 2 (2) that S R R is fuzzy anti-compatible. Hence, (1) holds. □
The following is an immediate consequence of Theorem 3.14 in [43] and Lemma 3.
Theorem 11.
Let R and S be R-cubic congruences on a groupoid X. Then, the following are equivalent:
(1) S R R R C C ( X ) .
(2) S R R R C E ( X ) .
(3) S R R is cubic symmetric.
(4) S R R = R R S .
Proposition 29.
If R P C C ( G ) [resp., R R C C ( G ) ], then the following holds:
R ( x a y ) = R ( x a , x b ) = R ( a y , b y ) = R ( a , b ) f o r a l l , a , b , x , y G .
Proof. 
The proof of the first part is straightforward from (Lemma 3.16 [43]) and Lemma 3.1 [39]), and the second part can be easily proved. □
Proposition 30.
If R P C C ( G ) [resp., R R C C ( G ) ], then the following holds:
R ( x 1 , y 1 ) = R ( x , y ) f o r a n y x , y G .
Proof. 
The proof of the first part is straightforward from (Lemma 3.16 [43]) and Lemma 3.1 [39]) and the second part can be easily proved. □
Proposition 31.
Let A P C N G ( G ) [resp., A R C N G ( G ) ]and let R A = R ˜ A ˜ , R A be the cubic relation on G defined as follows: for each ( x , y ) G × G ,
R A ( x , y ) = A ( x y 1 ) = A ˜ ( x y 1 ) , A ( x y 1 ) .
Then, R A P C C ( G ) [resp., R A R C C ( G ) ].
In this case, we will call R A as a P-cubic congruence [resp., an R-cubic congruence] on G induced by A .
Proof. 
The proof of the first part is straightforward from (Lemma 3.16 [43]) and Lemma 3.1 [39]), and the second part can be easily proved. □
Proposition 32.
Let A , B P C G ( G ) [resp., R C G ( G ) ]. Then
R B P R A = R A P B [ resp . , R B R R A = R A R B ] .
Proof. 
To show the first part, let ( a , b ) G × G and let z G . Let a z 1 = x and z b 1 = y . Then, clearly, x y = a b 1 . Thus, we get
( R ˜ B ˜ R ˜ A ˜ ) ( a , b ) = z G [ R ˜ A ˜ ( a , z ) R ˜ B ˜ ( z , b ) ]
= z G [ A ˜ ( a z 1 ) B ˜ ( z b 1 ) ]
= a b 1 = x y [ A ˜ ( x ) B ˜ ( y ) ]
= ( A ˜ B ˜ ) ( a b 1 )
= ( R ˜ A ˜ R ˜ B ˜ ) ( a , b ) .
So R B P R A = R A P B .
Now, let us prove the second part. Since R ˜ B ˜ R ˜ A ˜ = R ˜ A ˜ B ˜ from the above, it is sufficient to show that R B R R A = R A R B . Then, we have
( R B R R A ) ( a , b ) = z G [ R A ( a , z ) R B ( z , b ) ]
= z G [ A ( a z 1 ) B ( z b 1 ) ]
= a b 1 = x y [ A ( x ) B ( y ) ]
= ( A R B ) ( a b 1 )
= ( R A R R B ) ( a , b ) .
Thus, R B R R A = R A R R B . So, the second part holds. □
Proposition 33.
( P C C ( G ) , P ) [resp., ( R C C ( G ) , R ) ]is a semilattice.
Proof. 
Let R ˜ , S ˜ I V F C ( G ) and let ( x , z ) G × G . Then, we have
( S ˜ R ˜ ) ( x , z ) = y G [ R ˜ ( x , y ) S ˜ ( y , z ) ]
= y G [ R ˜ ( x y 1 , e ) S ˜ ( e , y 1 z ) ]
= y G [ S ˜ ( e , y 1 z ) R ˜ ( x y 1 , e ) ]
= x y 1 z [ S ˜ ( x , x y 1 z ) R ˜ ( x y 1 z , z ) ]
= ( R ˜ S ˜ ) ( x , z ) .
Thus, S ˜ R ˜ = R ˜ S ˜ . From Theorem 10, it is obvious that S ˜ R ˜ I V F C ( G ) . Thus ( I V F C ( G ) , ) is a semigroup. We can easily see that R ˜ R ˜ = R ˜ . So ( I V F C ( G ) , ) is a semilattice. It is well-known (Theorem 3.7 [39]) that ( F C ( G ) , ) is a semilattice. Hence, ( P C C ( G ) , P ) is a semilattice.
To prove the second part, it is sufficient to show that ( F A C ( G ) , R ) is a semilattice. We can easily see that S R R = R R S and R R R = R for any R , S F A C ( G ) . Moreover, from Theorem 10, S R R F A C ( G ) for any R , S F A C ( G ) . Then, ( F A C ( G ) , R ) is a semilattice. □
Proposition 34.
Let R P C C ( G ) [resp., R R C C ( G ) ]and let A R = A ˜ R ˜ , A R be the cubic set in G defined as follows: for each x G ,
A R ( x ) = R ( x , e ) = R ˜ ( x , e ) , R ( x , e ) .
Then, A R P C N G ( G ) [resp., A R R C N G ( G ) ].
In this case, we will call A R a P-cubic normal subgroup [resp., an R-cubic normal subgroup] of G induced by R .
Proof. 
To prove the first part, let x , y G . Then, we have
A ˜ R ˜ ( x y 1 ) = R ˜ ( x y 1 , e )
= R ˜ ( x , y ) (Since R ˜ is compatible)
z G [ R ˜ ( x , z ) R ˜ ( z , y ) ] (Since R ˜ is transitive)
R ˜ ( x , e ) R ˜ ( e , y )
= R ˜ ( x , e ) R ˜ ( y , e ) (Since R ˜ is symmetric)
= A ˜ R ˜ ( x ) A ˜ R ˜ ( y ) .
Thus A ˜ R ˜ I V F G ( G ) . On the other hand, we get
A ˜ R ˜ ( x y ) = R ˜ ( x y , e )
= R ˜ ( y ( x y ) y 1 , y e y 1 ) (Since R ˜ is compatible)
= R ˜ ( y x , e )
= A ˜ R ˜ ( y x ) .
So, according to Theorem 3 (1), A ˜ R ˜ I V F N G ( G ) . It is well known (Theorem 3.4 [39]) that A R F N G ( G ) . Hence, A R P C N G ( G )
Now let us show the second part. Since A ˜ R ˜ I V F N G ( G ) , it is sufficient to prove that A R F A N G ( G ) . Let x , y G . Then, we have
A R ( x y 1 ) = R ( x y 1 , e )
= R ( x , y )
z G [ R ( x , z ) R ( z , y ) ] (Since R is fuzzy anti-transitive)
R ( x , e ) R ( e , y )
= R ( x , e ) R ( y , e ) (Since R is fuzzy symmetric)
= A R ( x ) A R ( y ) .
Thus, according to Theorem 3 (2), A R F A N G ( G ) . So A R R C N G ( G ) . □
Now, we give the extension of (1) already mentioned in the introduction via cubic sets.
Proposition 35.
There is a bijection between P C N ( G ) and P C C ( G ) [resp., R C N ( G ) and R C C ( G ) ].
Proof. 
We define Ψ : P C N ( G ) P C C ( G ) [resp., Φ : R C N ( G ) R C C ( G ) ] as follows: for each A P C N ( G ) [resp., R C N ( G ) ],
Ψ ( A ) = R A [ resp . Φ ( A ) = R A ] .
Then, we can easily see that Ψ [resp., Φ ] is well defined. Furthermore, it can be seen that Ψ [resp., Φ ] is bijective. □

6. Conclusions

We saw thar P-cubic subgroupoids (resp., ideals, subgroups and congruences) have almost similar properties to fuzzy subgroupoids (resp., ideals, subgroups and comgruences) and interval-valued fuzzy groupoids (resp., ideals, subgroups and congruences). Although R-cubic subgroupoids (resp., ideals, subgroups and congruences) have a different structure than P-cubic subgroupoids (resp., ideals, subgroups and congruences), we could confirm it has properties similar to those of the corresponding fuzzy and interval-valued fuzzy concepts. In the future, we expect that one will study various algebraic structures based on cubic sets. In particular, we want to find the characteristics of several types of semigroups by cubic ideals and cubic bi-ideals. Moreover, we will study the graph problem based on a cubic set and present a smooth transportation network system as an example.

7. Discussions

In classical semigropus, special semigroups—for example, a semigroup which is regular (resp., complete regular, intra-regular, a semilattice of simple semigroups, a semilattice of groups)—are known for their characterization by ideal and bi-ideal. Can such characterizations be extended by cubic-ideal and cubic bi-ideal? We think this study is necessary.

Author Contributions

The content of our article was conceived by the co-authors by e-mail or in person, and it was decided to proceed as follows. S.-H.H. collected necessary literature data, J.-I.B. handled similarity problems and checked typos, J.-G.L. and K.H. wrote handwritten content, and S.M.M. reviewed completed it and made additional suggestions. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors wish to thank the anonymous reviewers for their valuable suggestions. This paper was supported by Wonkwang Uinversity in 2022.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Zadeh, L.A. Similarity relations and fuzzy ordering. Inform. Sci. 1971, 3, 177–200. [Google Scholar] [CrossRef]
  3. Jun, Y.B.; Kim, C.S.; Yang, K.O. Cubic sets. Ann. Fuzzy Math. Inform. 2012, 4, 83–98. [Google Scholar]
  4. Chinnadurai, V.; Suganya, K.; Swaminathan, A. Some characterizations on cubic sets. Int. J. Multidiscip. Res. Mod. Educ. IJMRME II 2016, II, 258–264. [Google Scholar]
  5. Kang, J.G.; Kim, C.S. Mappings of cubic sets. Commun. Korean Math. Soc. 2016, 31, 423–431. [Google Scholar] [CrossRef]
  6. Zeb, A.; Abdullah, S.; Khan, M.; Majid, A. Cubic topoloiy. Int. J. Comput. Inf. Secur. IJCSIS 2016, 14, 659–669. [Google Scholar]
  7. Mahmood, T.; Abdullah, S.; Rashid, S.R.; Bila, M. Multicriteria decision making based on cubic set. J. New Theory 2017, 16, 1–9. [Google Scholar]
  8. Jun, Y.B.; Lee, K.J. Closed cubic ideals and cubic 0-subalgebras in BCK/BCI-algebras. Appl. Math. Sci. 2009, 4, 3395–3402. [Google Scholar]
  9. Jun, Y.B.; Lee, K.J.; Kang, M.S. Cubic structures applied to ideals of BCI-algebras. Comput. Math. Appl. 2011, 62, 3334–3342. [Google Scholar] [CrossRef]
  10. Akram, M.; Yaqoob, N.; Gulistan, M. Cubic KU-subalgebras. Int. J. Pure Appl. Math. 2013, 89, 659–665. [Google Scholar] [CrossRef]
  11. Yaqoob, N.; Mostafa, S.M.; Ansari, M.A. On cubic KU-ideals of KU-algebras. ISRN Algebra 2013, 2013, 935905. [Google Scholar] [CrossRef]
  12. Ahn, S.S.; Ko, J.M. Cubic subalgebras and filters of CI-algebras. Honam Math. J. 2014, 36, 43–54. [Google Scholar] [CrossRef]
  13. Senapati, T.; Kim, C.S.; Bhowmik, M.; Pal, M. Cubic subalgebras and cubic closed ideals of B-algebras. Fuzzy Inf. Eng. 2015, 7, 129–149. [Google Scholar] [CrossRef]
  14. Lee, J.-G.; Hur, K.; Chen, X. A study on cubic H-relations in a topological universe viewpoint. Mathematics 2020, 8, 482. [Google Scholar] [CrossRef]
  15. Loganayaki, P.; Jayanthi, D. Almost continuous mappings on cubic topological spaces. Adv. Fuzzy Math. 2020, 15, 1–12. [Google Scholar]
  16. Muhiuddin, G.; Takallo, M.M.; Jun, Y.B.; Borzooei, R.A. Cubic graphs and their application to a traffic flow problem. Int. J. Comput. Intell. Syst. 2020, 13, 1265–1280. [Google Scholar] [CrossRef]
  17. Alhazaymeh, K.; Al-Qudah, Y.; Hassan, N.; Nasruddin, A.M. Cubic vague set and its application in decision making. Entropy 2020, 22, 963. [Google Scholar] [CrossRef]
  18. Riaz, M.; Habibi, A.; Khan, M.J.; Kumam, P. Correlation coefficients for cubic bipolar fuzzy sets with applications to pattern recognition and clustering analysis. IEEE Access 2021, 9, 109053–109066. [Google Scholar] [CrossRef]
  19. Jun, Y.B.; Jun, S.T.; Kim, M.S. Cubic subgroups, Ann. Fuzzy Math. Inform. 2011, 2, 9–15. [Google Scholar]
  20. Jun, Y.B.; Khan, A. Cubic ideals in semigroups. Honam Math. J. 2013, 35, 607–623. [Google Scholar] [CrossRef]
  21. Muhiuddin, G. Cubic interior ideals in semigroups. Appl. Appl. Math. Int. J. AAM 2019, 14, 463–474. [Google Scholar]
  22. Amalanila, S.; Jayalakshmi, S. Cubic near-ring. J. Math. Comput. Sci. 2021, 11, 3406–3417. [Google Scholar]
  23. Gaketem, T.; Iampan, A. Cubic filters of semigroups. Appl. Sci. 2022, 24, 131–141. [Google Scholar]
  24. Rosenfeld, A. An Introduction to Algebraic Structures; Holden-Day: San Francisco, CA, USA, 1968. [Google Scholar]
  25. Howie, J.M. An Introduction to Semigroup Theory; Academic: New York, NY, USA, 1976. [Google Scholar]
  26. Zadeh, L.A. The concept of a linguistic variable and its application to approximate reasoning-I. Inform. Sci. 1975, 8, 199–249. [Google Scholar] [CrossRef]
  27. Gorzalczany, M.B. A method of inference in approximate reasoning based on interval-valued fuzzy sets. Fuzzy Sets Syst. 1987, 21, 1–17. [Google Scholar] [CrossRef]
  28. Mondal, T.K.; Samanta, S.K. Topology of interval-valued fuzzy sets. Indian J. Pure Appl. Math. 1999, 30, 23–38. [Google Scholar]
  29. Lee, J.G.; cSenel, G.; Baek, J.I.; Han, S.H.; Hur, K. Neighborhood structures and continuities via cubic sets. Axioms 2022, 11, 406. [Google Scholar] [CrossRef]
  30. Liu, W.J. Fuzzy invariant subgroups and fuzzy ideals. Fuzzy Sets Syst. 1982, 8, 133–139. [Google Scholar] [CrossRef]
  31. Kang, H.W.; Hur, K. Interval-valued fuzzy subgroups and rings. Honam Math. J. 2010, 32, 593–617. [Google Scholar] [CrossRef]
  32. Pu, P.-M.; Liu, Y.-M. Fuzzy topology I. Neighborhood structure of a fuzzy point and Moore-Smith convergence. J. Math. Anal. Appl. 1980, 76, 571–599. [Google Scholar]
  33. de Mitri, C.; Pascali, E. Characterization of fuzzy topologies from neighborhoods of fuzzy points. J. Math. Anal. Appl. 1983, 93, 1–14. [Google Scholar] [CrossRef]
  34. Kim, J.; Lim, P.K.; Lee, J.G.; Hur, K. Cubic relations. Ann. Fuzzy Math. Inform. 2020, 19, 21–43. [Google Scholar] [CrossRef]
  35. Rosenfeld, A. Fuzzy groups. J. Math. Anal. Appl. 1971, 35, 512–517. [Google Scholar] [CrossRef]
  36. Biswas, R. Rosenfeld’s fuzzy subgroups with interval-valued membership functions. Fuzzy Set Syst. 1994, 63, 87–90. [Google Scholar] [CrossRef]
  37. Biswas, R. Fuzzy subgroups and anti fuzzy subgroups. Fuzzy Sets Syst. 1990, 35, 121–124. [Google Scholar] [CrossRef]
  38. Das, P.S. Fuzzy groups and lebel subgroups. J. Math. Anal. Appl. 1981, 84, 264–269. [Google Scholar] [CrossRef]
  39. Kuroki, N. Fuzzy congruences and normal subgroups. Inform. Sci. 1992, 60, 257–259. [Google Scholar] [CrossRef]
  40. Kumar, I.J.; Saxena, P.K.; Yadav, P. Fuzzy normal subgroups and fuzzy quotients. Fuzzy Sets Syst. 1992, 46, 121–132. [Google Scholar] [CrossRef]
  41. Ajmal, N. Homomorphism fuzzy groups, correspondence theorem and fuzzy quotient groups. Fuzzy Sets Syst. 1994, 461, 329–339. [Google Scholar] [CrossRef]
  42. Hur, K.; Lee, J.G.; Choi, J.Y. Interval-valued fuzzy relations. J. Korean Inst. Intell. Syst. JKIIS 2009, 19, 425–432. [Google Scholar] [CrossRef]
  43. Lee, J.G.; Hur, K.; Lim, P.K. Interval-valued fuzzy congruences on a semi- group. Int. J. Fuzzy Logic Intell. Syst. 2013, 13, 231–244. [Google Scholar] [CrossRef] [Green Version]
  44. Rosenfeld, A. Fuzzy graphs, in Fuzzy Sets and Their Applications; Zadeh, L., Fu, K.S., Simura, M., Eds.; Academic: New York, NY, USA, 1975; pp. 77–95. [Google Scholar]
Table 1. The Cayley table of the groupoid X.
Table 1. The Cayley table of the groupoid X.
·abc
aaaa
bbab
ccca
Table 2. The products of A and B .
Table 2. The products of A and B .
( A P B ) ( t ) ( A R B ) ( t )
a [ 0.4 , 0.7 ] , 0.6 [ 0.4 , 0.7 ] , 0.6
b [ 0.2 , 0.4 ] , 0.7 [ 0.2 , 0.4 ] , 0.7
c [ 0.3 , 0.6 ] , 0.3 [ 0.3 , 0.6 ] , 0.7
Table 3. The Cayley table of the groupoid X.
Table 3. The Cayley table of the groupoid X.
·abc
aaaa
bbab
cccc
Table 4. The Cayley table of the groupoid X.
Table 4. The Cayley table of the groupoid X.
·abc
aaaa
baac
cabc
Table 5. The Cayley table of the groupoid X.
Table 5. The Cayley table of the groupoid X.
·abc
aaaa
bbba
ccac
Table 6. The Cayley table of the groupoid X.
Table 6. The Cayley table of the groupoid X.
·eab
eeab
aaba
bbba
Table 7. The values of the cubic relations R i .
Table 7. The values of the cubic relations R i .
R i eab
e a ˜ ˜ 11 a ˜ ˜ 12 a ˜ ˜ 13
a a ˜ ˜ 21 a ˜ ˜ 22 a ˜ ˜ 23
b a ˜ ˜ 31 a ˜ ˜ 32 a ˜ ˜ 33
Table 8. The values of the cubic relation R .
Table 8. The values of the cubic relation R .
R eab
e [ 1 , 1 ] , 1 0.4 , 0.6 ] , 0.6 [ 0.4 , 0.6 ] , 0.6
a [ 0.4 , 0.6 ] , 0.6 [ 1 , 1 ] , 1 0.2 , 0.7 ] , 0.7
b [ 0.4 , 0.6 ] , 0.6 0.2 , 0.7 ] , 0.7 [ 1 , 1 ] , 1
Table 9. The values of the cubic relation S .
Table 9. The values of the cubic relation S .
S eab
e [ 1 , 1 ] , 0 0.4 , 0.6 ] , 0.6 [ 0.4 , 0.6 ] , 0.6
a [ 0.4 , 0.6 ] , 0.6 [ 1 , 1 ] , 0 0.2 , 0.7 ] , 0.4
b [ 0.4 , 0.6 ] , 0.6 0.2 , 0.7 ] , 0.4 [ 1 , 1 ] , 0
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Lee, J.-G.; Mostafa, S.M.; Baek, J.-I.; Han, S.-H.; Hur, K. A Study on Groupoids, Ideals and Congruences via Cubic Sets. Axioms 2022, 11, 443. https://doi.org/10.3390/axioms11090443

AMA Style

Lee J-G, Mostafa SM, Baek J-I, Han S-H, Hur K. A Study on Groupoids, Ideals and Congruences via Cubic Sets. Axioms. 2022; 11(9):443. https://doi.org/10.3390/axioms11090443

Chicago/Turabian Style

Lee, Jeong-Gon, Samy M. Mostafa, Jong-Il Baek, Sang-Hyeon Han, and Kul Hur. 2022. "A Study on Groupoids, Ideals and Congruences via Cubic Sets" Axioms 11, no. 9: 443. https://doi.org/10.3390/axioms11090443

APA Style

Lee, J. -G., Mostafa, S. M., Baek, J. -I., Han, S. -H., & Hur, K. (2022). A Study on Groupoids, Ideals and Congruences via Cubic Sets. Axioms, 11(9), 443. https://doi.org/10.3390/axioms11090443

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop