2. Preliminaries
Firstly, we give some concepts of some logical algebras and connections between -algebra and -algebra that play an important role in discussions of special -algebra. In -algebra, define ≤: iff .
Definition 1 ([
1,
2])
. Assume that <> is an algebraic structure; then, it is a BCI-algebra if it meets: ;
;
;
and .
If a BCI-algebra meets the below condition: ,
,
we call it a BCK-algebra.
Definition 2 ([
10])
. Assume that <> is an algebraic structure; then, it is a BCC-algebra if it meets: ;
;
;
;
and imply .
Definition 3 ([
14])
. Assume that <> is an algebraic structure; then, it is a BZ-algebra if it meets: ;
;
, imply .
An algebra of type (2,0) means that this algebra is composed of a non-empty set and an operation as well as a constant. Clearly, all the above algebras are algebras of type (2,0).
Definition 4 ([
9])
. An algebraic structure <> is a quasi-alter BCK-algebra iff it meets: , if , , otherwise, . Theorem 1 ([
35])
. Assume that <> is a -algebra; it is a -algebra iff , In paper [
36], Xiaohong Zhang and Ruifen Ye introduced a kind of
-algebra and revealed the connection between
-algebra and a general group.
Definition 5 ([
36])
. A BZ-algebra <> is called an anti-grouped BZ-algebra if, for any , it satisfies . Theorem 2 ([
36])
. A BZ-algebra <> is anti-grouped iff it meets: Theorem 3 ([
36])
. Let <> be an anti-grouped BZ-algebra. Define “⊛
”:Then, <> is a group.
Theorem 4 ([
36])
. Assume that <> is a group. Define "·":Then, <> is an anti-grouped BZ-algebra.
In the following, we give the definitions of semihypergroup and some hyper logical algebras.
Definition 6 ([
16])
. Assume that is a hypergroupoid. If , we have , so is a semihypergroup. Then, there isNote that, if is a semihypergroup, there is for all , where represents nonempty subset of H.
Definition 7 ([
16])
. Assume that is a semihypergroup. is called a hypergroup if () . In a study of hyperstructures, represents . For each , represents that, for all , there is , s.t. .
Definition 8 ([
20])
. Assume that is a hypergroupoid containing 0. If it meets these axioms: ,
and imply
then it is a hyper -algebra.
Definition 9 ([
26])
. Assume that is a hypergroupoid containing 0. If it meets these axioms: ,
and imply ,
then it is a hyper BCC-algebra (Jun’s definition).
Definition 10 ([
27])
. Assume that is a hypergroupoid containing 0. If it meets these axioms: ,
and imply ,
then it is a hyper BCC-algebra (Borzooei’s definition).
Jun and Borzooei, in [
26,
27], gave different definitions of hyper
-algebra, respectively. However, in this paper, we mainly use Definition 10 for hyper
-algebra.
Definition 11 ([
28])
. Assume that is a hypergroupoid containing 0. If it meets these axioms: ,
and imply
,
then it is a hyper -algebra.
Definition 12 ([
13])
. Assume that is a hypergroupoid containing 0. If it meets these axioms: ,
and imply
implies ,
then it is a quasi-hyper -algebra.
Definition 13 ([
34])
. Assume that is a hypergroupoid containing 0. If it meets these axioms: ,
and imply
then it is a hyper -algebra.
Proposition 1 ([
34])
. In any hyper BZ-algebra , the following holds: For all and for all non-empty subsets A and B of H,;
;
;
;
;
;
;
is a singleton set;
and ;
;
;
;
.
Definition 14 ([
34])
. A hyper -algebra is called a generalized anti-grouped hyper -algebra if , it satisfies . 3. QM-BZ-Algebra
Firstly, we introduce a method to construct -algebra by using -algebra and anti-grouped -algbera.
Proposition 2. Assume that is a -algebra and is an anti-grouped -algebra. Denote , and . An operation on A is as below: Therefore, is -algebra.
Proof. (1) ,
Case 1: , ;
Case 2: , ;
Case 3: , , ;
Case 4: , , , ;
Case 5: , , , ;
Case 6: , , ;
Case 7: , , , ;
Case 8: , , , .
Above all, (BZ1) holds.
(2) Obviously, , , that is, (BZ2) holds.
(3) , (i) , , and imply ; (ii) , , and imply ; (iii) , , if , there is . Because , there does not exist . Then, (BZ3) holds.
To sum up, is a -algebra. □
Definition 15. Assume that K is a -algebra and G is an anti-grouped -algebra, . Denote according to Proposition 2; then, A is -algebra. Then, A is called the -union of K and G, and is written as .
Assume that <
> is a
-algebra.
, denote a map
:
, , denote :
where ∗ means the composition operation of mappings.
Theorem 5. Denote as a set which is all compositional results of finite mappings which are for all ; thus, we have . Then, is a monoid.
Proof. , and
; therefore:
Obviously, . So, satisfies associative law, that is, is a semigroup.
,
, there is,
Then, is the identity element in . Thus, is a monoid. □
Example 1. Let . The operation ∗ on X is shown in Table 1. Then, <> is a -algebra and , where .
We can verify the following:
;
;
;
;
;
.
Then, is a monoid, and the operation ∗ on it is shown in Table 2. However, it is not commutative, since . Definition 16. Assume that is a partial order containing a constant 0. x is called a quasi-minimal element in X, if , implies or .
Definition 17. A -algebra is called QM--algebra if all elements of X are quasi-minimal elements.
Theorem 6. Assume that is a -algebra. Then, X is a QM--algebra iff it meets: ,
Proof. , assume that , according to Definition 16, or . However, . So, .
Assume that , . If , then , and we can obtain . If , , there is by condition. So, y is a quasi-minimal element. Thus, X is a QM--algebra. □
Theorem 7. Assume that is a -algebra, is a -part of X, and AG(X) is an anti-grouped part of X. Then, the below conditions are equivalent:
(1) X is QM--algebra;
(2) is quasi-alter -algebra and .
Proof. (1)⇒(2) Assume that X is a QM--algebra. Then, , if , . If , it can be divided into the below three cases:
Case 1: , , , that is, ; , that is, . According to Definition 3, ;
Case 2: , , , that is, ; , that is, . According to Definition 3, ;
Case 3: , , , that is, . Because and , according to Theorem 6, .
According to Definition 4, is a quasi-alter -algebra. If , then and . Because , that is, . According to Theorem 6, . Thus, . Additionally, ; then, .
(2)⇒(1) Let (2) hold; then, , :
Case 1: , assume that , , and it does not hold. So, ;
Case 2:
, assume that
, that is,
. Then,
So, . Then, , and . That is, . So, .
Case 3:
, assume that
, that is,
. Then,
Clearly, does not hold. Then, .
Case 4:
, assume that
, that is,
. Then,
Clearly, does not hold. Then, .
According to Theorem 6, X is a QM--algebra. □
According to Theorem 7, the -union of quasi-alter -algebra and anti-grouped -algebra is QM--algebra.
Theorem 8. Assume that is QM--algebra, that is the -part, and that is the -remainder. Then:
(1) , ;
(2) , .
Proof. (1) , assume that . Then, . Clearly, does not hold. So, , that is, .
(2) , assume that . Then, . Clearly, does not hold. So, , that is, . □
Definition 18. -algebra <> is called generalized quasi-left alter -algebra if it meets: , Theorem 9. Let <> be a generalized quasi-left alter -algebra. , either , or .
Proof. Let
. Assume that
. Because
, then:
There is , because if , . Then, , and this conflicts with assumption . So, .
According to Definition 18:
Therefore, . In addition, , . This conflicts with assumption , so . □
According to Theorem 9, let be the -part of a generalized quasi-left alter -algebra, be -remainder of a generalized quasi-left alter -algebra. Then, is an anti-grouped -subalgebra.
Theorem 10. Assume that <> is a generalized quasi-left alter -algebra. Therefore, X is -algebra.
Proof. Let be the -part of X and be the -remainder of X. :
If , , that is, .
If , there are two cases according to Theorem 9:
Case 1: , , that is, ;
Case 2: , , that is .
To sum up, , . According to Theorem 1, X is -algebra. □
Theorem 11. Assume that <> is a generalized quasi-left alter -algebra. Then, X is a QM--algebra.
Proof. Let
be the
-part of
X, and
be the
-remainder of
X. Then,
, assume that
and
. Therefore,
(1) When , .
(2) When , , but . So, y is a quasi-minimal element of X. Because y is arbitrary, X is a QM--algebra. □
In the following, the concepts of QM-hyper -algebra and generalized quasi-left alter hyper -algebra are shown.
Definition 19. Let be a partial order that contains a constant 0 in a hyper structure. x is said to be a quasi-minimal element in H, if for any element a in H, implies or .
Definition 20. A hyper -algebra is said to be QM-hyper -algebra if all elements of H are quasi-minimal elements.
Theorem 12. Assume that is a hyper -algebra. Then, H is a QM-hyper -algebra iff it meets: for all ,
Proof. For all , let , according to Definition 19, or . However, . So, .
Assume that , . If , then , and we can obtain . If , ; therefore, by condition. So, y is a quasi-minimal element of H. Thus, H is a QM-hyper -algebra. □
Definition 21. Hyper -algebra is called a generalized quasi-left alter hyper -algebra if, , Theorem 13. Assume that is a generalized quasi-left alter hyper -algebra. Thus, H is -algebra.
Proof. Assume that is a generalized quasi-left alter hyper -algebra. Let be hyper -part of H. and , , according to Proposition 1, . According to Definition 21, . Assume that , ; clearly, is not true. So, .
If , and , there is . Assume that , . So, , according to Proposition 1, . Therefore, . That is, . Beasuse , , so is not true. That is, . So, .
Above all, , . Moreover, , according to Proposition 1, is -algebra. According to Theorem 10, is -algebra. □
Theorem 14. Let be generalized quasi-left alter hyper -algebra. Then, H is a QM-hyper algebra.
Proof. Assume that
be a generalized quasi-left alter hyper
-algebra. According to Theorem 13,
H is
-algebra. Let
be the
-part of
H, and
G(
H) be the
-remainder of
H. Then,
, let
and
. Therefore,
(1) When , .
(2) When , , but . So, y is a quasi-minimal element of H. Because y is arbitrary, H is QM-hyper -algebra. □
However, not every QM-hyper -algebra is generalized quasi-left alter hyper -algebra; see Example 2.
Example 2. Let . The operation ∘ on H is shown in Table 3. Clearly, is QM-hyper -algebra, but it is not a generalized quasi-left alter hyper -algebra, since , , .
Additionally, Example 2 shows that not every QM-hyper -algebra is QM--algebra.
4. Quasi-Hyper BZ-Algebras
In this part, we propose the definition of quasi-hyper BZ-algebras. In the following, we replace the singleton set with x.
Definition 22. Assume that is a hypergroupoid containing 0. If it meets these axioms: ,
and
,
then it is a quasi-hyper -algebra.
Remark 1. Every BZ-algebra is a quasi-hyper BZ-algebra;
Every hyper -algebra is a quasi-hyper BZ-algebra;
Every quasi-hyper -algebra is a quasi-hyper -algebra.
Now, we give some examples about quasi-hyper -algebras and some examples which explain that not every quasi-hyper -algebra is a hyper -algebra.
Example 3. Assume that . Define an operation ∗ on H in Table 4, Then, is a -algebra, and it is a quasi-hyper -algebra.
Assume that . Define an operation ∘ on H in Table 5, Then, is a quasi-hyper -algebra, but it is not a hyper -algebra since and is not true); this means that the condition (HZ4) in Definition 13 does not hold.
Assume that . Define an operation ∘ on H in Table 6, Then is a quasi-hyper -algebra, but it is not a quasi-hyper -algebra, since , and .
Proposition 3. In any quasi-hyper BZ-algebra , the followings hold: for all and for all non-empty subsets A and B of H:
;
;
;
;
and ;
;
;
.
Proof. (1) By (QHZ1) and (QHZ2), . Then, .
(2) By (QHZ2), for any , there is , that is . Then, .
(3) Let . Then, . By (QHZ2), and . Then, .
(4) Let . Then, , and so . Then, .
(5) By (QHZ1), . By (4), . So, .
(6) Assume that ; then, . So, .
(7) Assume that . Then, , and so . Hence, .
(8) For any
, let
.
, assume that
, let
, and
. Then,
thus,
,
, and
. Thus,
, and so
. □
Proposition 4. In any quasi-hyper -algebra satisfying , the followings hold: ,
;
is a singleton set;
.
Proof. , . By Proposition 3 (4), .
For any , and . , , by (QHZ3), , so . Thus, is a singleton set.
By (2), let . By(QHZ4), and . Assume that , let . , , so , . In addition, . So, . Because , and , . That is, . □
In the following, we give the concepts of standard quasi-hyper -algebra and transitive quasi-hyper -algebra.
Definition 23. A quasi-hyper BZ algebra is called a standard quasi-hyper BZ algebra if, , it satisfies .
Proposition 5. Every standard quasi-hyper -algebra is a hyper -algebra.
Proof. Assume that is a standard quasi-hyper algebra. For all , . That is, . So, is a hyper -algebra. □
Definition 24. A quasi-hyper BZ-algebra is called a transitive quasi-hyper BZ algebra if, , it satisfies and .
Proposition 6. In any transitive quasi-hyper BZ-algebra , the following conditions hold: for all , and for all non-empty subsets , and C of H:
and imply ;
implies .
Proof. (TQHZ1) Let . s.t. . Additionally, for any , such that . So, . Then, for any , s.t. , that is .
(TQHZ2) By (QHZ1), , and . So, . □
Example 4. Assume that . Define an operation ∘ on H in Table 7, Then, is a transitive quasi-hyper -algebra and a transitive hyper -algebra.
Assume that . Define an operation ∘ on H in Table 8, Then, is a transitive quasi-hyper -algebra, but it is not standard.
Proposition 7. Every transitive standard quasi-hyper -algebra is a hyper -algebra.
Proof. According to Proposition 5. □
In the following, we investigate some kinds of quasi-hyper -subalgebra.
Definition 25. Assume that is a quasi-hyper -algebra, that S is a subset of H, and that S contains 0. If S is a quasi-hyper -algebra under the hyper operation "∘" on H, then S is a hyper subalgebra of H.
Proposition 8. Assume that S is a nonempty subset of a quasi-hyper -algebra . If , there is .
Proof. Let , and . Because , there is . □
Theorem 15. Assume that S is a nonempty subset of a quasi-hyper -algebra . S is a hyper subalgebra of H iff , .
Proof. (⇒) This is clear.
(⇐)
, assume that
. By Proposition 8,
.
, there is
,
, and
. Thus,
Because , Therefore, in S, (QHZ1) holds. In a similar way, (QHZ2), (QHZ3), (QHZ4), and (QHZ5) hold in S. So, S is a hyper subalgebra of H. □
Theorem 16. Assume that is a quasi-hyper -algebra. Then,is a hyper subalgebra of H and , is a singleton set whenever . Proof. Assume that and . Then, there is and and . Therefore, . By Theorem 15, is a hyper subalgebra of H.
According to Proposition 3 (8), , is a singleton set.
However, is not necessarily a -algebra; see Example 5.
Example 5. Assume that . Define an operation ∘ on H in Table 9, Then, is a quasi-hyper -algebra, and is a quasi-hyper -subalgebra. But it is not a -algebra, since .
Theorem 17. Assume that is a standard quasi-hyper -algebra. Then,is a hyper -subalgebra of H. Theorem 18. Assume that is a transitive standard quasi-hyper -algebra. Then,is a quasi-hyper -subalgebra of H and an anti-grouped -algebra. Proof. Obviously, . Let . According to Proposition 7 and (TSHZ4), , then . So, . By Theorem 15, is a hyper subalgebra of H. , by Proposition 4 (2), is a singleton set, □. So, for any , . Because is a standard quasi-hyper -algebra, it is a -algebra. According to Definition 5, we know is an anti-grouped -algebra. □
In the following, we study the connection between quasi-hyper -algebra and semigroups.
Assume that
is a quasi-hyper
-algebra.
, denote a map:
where
represents a nonempty subset of
H.
,
, denote
:
where ∘ means the composition operation of mappings.
Theorem 19. Denote as a set which is all compositional results of finite mappings which are for all ; therefore, . Then, is a semigroup.
Proof. , , for any , there exists s.t. . Then, s.t. and . Then, and .
For any , there exists such that . Then, s.t. and . Then, and .
So, . Then, satisfies associative law. □
Example 6. Assume that . The operation ∘ on H is shown in Table 10, Then, is a quasi-hyper -algebra, and , where .
We can verify the following:
;
;
;
;
.
Then is a semigroup, but it is not commutative, since . The operation on is shown in Table 11. In the following, we give the concepts of anti-grouped quasi-hyper -algebra and generalized anti-grouped quasi-hyper -algebra. Moreover, we study the relations between quasi-hyper -algebra and semihypergroups by generalized anti-grouped quasi-hyper -algebra and associative quasi-hyper -algebra.
Definition 26. A quasi-hyper -algebra is called an anti-grouped quasi-hyper -algebra if, , it satisfies .
Proposition 9. Assume that is an anti-grouped quasi-hyper -algebra. Therefore, it is an anti-grouped -algebra.
Proof. Assume that , let , and . According to Definition 26, , and , . Because , . Then, , , according to Definition 26, . So, , but . So, and . According to Proposition 4, , is singleton set.
, assume that , that is, . Then, , and . According to Definition 22, . Then, implies . By Definition 22, , then . Then, . So, , because is singleton set. Therefore, . According to Proposition 3, , , and . So, H is anti-grouped -algebra. □
Definition 27. A quasi-hyper -algebra is called a generalized anti-grouped quasi-hyper -algebra if, , it satisfies .
Remark 2. Every generalized anti-grouped hyper -algebra is a generalized anti-grouped quasi-hyper -algebra.
The following example shows that not every generalized anti-grouped quasi-hyper -algebra is a generalized anti-grouped hyper -algebra.
Example 7. Assume that . The operation ∘ on H is shown in Table 12, Then, is a generalized anti-grouped quasi-hyper -algebra. However, it is not a hyper -algebra, since and is not true.
Proposition 10. In any generalized anti-grouped quasi-hyper -algebra , , define “⊕”: Then, is a semihypergroup.
Proof. , . Then, is a semihypergroup. □
Example 8. Assume that . An operation ∘ on H is shown in Table 13, Then, is a generalized anti-grouped quasi-hyper -algebra. According to Proposition 10, we get a semihypergroup and the operation ⊕ on it is shown in Table 14. Assume that . An operation ∘ on H in shown in Table 15. Then is a generalized anti-grouped quasi-hyper -algebra. According to Proposition 10, we get a semihypergroup and the operation ⊕ on it is shown in Table 16. Definition 28. A quasi-hyper -algebra is called associative if, , it satisfies .
Remark 3. Every associative quasi-hyper algebra is a generalized anti-grouped quasi-hyper algebra.
Example 7 shows that not every generalized anti-grouped quasi-hyper algebra is an associative quasi-hyper algebra, since .
Proposition 11. Assume that is an associative quasi-hyper -algebra. Then, the below conditions hold: ,
;
;
is a singleton set;
;
;
;
.
Proof. (1) Assume that , and let and . Therefore, . So, s.t. . That is, , and by (QHZ5), . Therefore, . That is, and . So, is not true, and .
(2) This follows from Proposition 4.
(3) This follows from Proposition 4.
(4) This follows from Proposition 4.
(5) By (2) and (4), for any , . Because is a singleton set, . For any , , so . By (QHZ3), .
(6) .
(7) According to (6) and Proposition 3 (8), , . Then, . By (QHZ4), , and by (QHZ3), . □
Theorem 20. Assume that is an associative quasi-hyper -algebra. Then, it is an associative -algebra.
Proof. By Propositions 11 (6) and 3 (8), , , and Definition 1 (1) holds. and Definition 1 (2) holds. Obviously, and Definition 1 (3) holds. Clearly, Definition 1 (4) holds. So, is an associative -algebra. □
In the following, we give the concepts of generalized quasi-left alter quasi-hyper -algebra and QM-quasi-hyper -algebra.
Definition 29. A quasi-hyper -algebra is called QM-quasi-hyper -algebra if every element of H is a quasi-minimal element.
Theorem 21. Assume that is a quasi-hyper -algebra. Then, H is a QM-quasi-hyper -algebra iff it meets: ,
Proof. The proof is similar to Theorem 12. □
According to Remark 1, we know that both -algebra and hyper -algbera are quasi-hyper -algebra. So, both QM--algebra and QM-hyper -algebra are QM-quasi-hyper -algebra, but not every QM-quasi-hyper -algebra is QM--algebra and QM-hyper -algebra (see Example 9).
Example 9. Assume that . An operation on H is shown in Table 17. Then, is a QM-quasi-hyper -algebra, but it is not a QM-hyper -algebra since , is not true. Moreover, it is not a QM--algebra.
Definition 30. Quasi-hyper -algebra is called a generalized quasi-left alter quasi-hyper algebra if, , Example 10. Assume that . Define an operation ∘ on H in Table 18, Then, is generalized quasi-left alter quasi-hyper -algebra.
Proposition 12. Let be a generalized quasi-left alter quasi-hyper -algebra satisfying . Therefore, H is a -algebra.
Proof. The proof is similar to Theorem 13. □
According to Theorems 11 and 14, we know generalized quasi-left alter -algebra is QM--algebra and generalized quasi-left alter hyper -algebra is QM-hyper -algebra. However, not every generalized quasi-left alter quasi-hyper -algebra is QM-quasi-hyper -algebra; see Example 10.
In addition, not every QM-quasi-hyper algebra is a generalized quasi-left alter quasi-hyper -algbera; see Example 11.
Example 11. Let . The operation on H is shown in Table 19. Then, is QM-quasi-hyper -algebra, but it is not a generalized quasi-left alter quasi-hyper -algebra since , and .