3. Neutrosophic Hesitant Fuzzy Subalgebras of Pseudo-BCI Algebras
In the following, let X be a pseudo-BCI algebra, unless otherwise specified.
Definition 10. A hesitant fuzzy set is called a hesitant fuzzy pseudo-subalgebra (hesitant fuzzy subalgebra) of X if it satisfies:
- (HFS2)
, ;
- (HFS3)
, .
Definition 11. A neutrosophic hesitant fuzzy set is called a neutrosophic hesitant fuzzy pseudo-subalgebra (neutrosophic hesitant fuzzy subalgebra) of X if it satisfies:
- (1)
, , ;
- (2)
, , ;
- (3)
, , .
Example 3. Let with two binary operations in Table 1 and Table 2. Then, is a pseudo-BCI algebra. Let:then, N is a neutrosophic hesitant fuzzy subalgebra of X. Considering three hesitant fuzzy sets
,
,
by:
Therefore, is called a generated hesitant fuzzy set by function ; is called a generated hesitant fuzzy set by function ; is called a generated hesitant fuzzy set by function .
Theorem 1. Let be a neutrosophic hesitant fuzzy set on X. Then, N is a neutrosophic hesitant fuzzy subalgebra of X if and only if it satisfies the conditions: , and , are hesitant fuzzy subalgebras of X.
Proof. Necessity: (i) By Definition 10 and Definition 11, we can obtain that is a hesitant fuzzy subalgebra of X.
(ii) , .
Similarly, . Therefore, , and are hesitant fuzzy subalgebras of X.
Sufficiency: (i) Let . Obviously, .
(ii) Let . By Definition 10, we have , thus .
Similarly, Let ; we have .
That is, N is a neutrosophic hesitant fuzzy subalgebra of X. ☐
Theorem 2. Let be a neutrosophic hesitant fuzzy set on X. Then, the following conditions are equivalent:
(1) is a neutrosophic hesitant fuzzy subalgebra of X;
(2) , the nonempty hesitant fuzzy level sets are subalgebras of X, where is the power set of , Proof. (1)⇒(2) Suppose
are nonempty sets. If
, then
. Since
N is a neutrosophic hesitant fuzzy subalgebra of
X, by Definition 11, we can obtain:
then
,
is a subalgebra of
X.
If
, then
. Since
N is a neutrosophic hesitant fuzzy subalgebra of
X, by Definition 11, we can obtain:
Thus,
,
is a subalgebra of
X.
Similarly, we can obtain then that is a subalgebra of X.
(2)⇒(1) Suppose that
are nonempty subalgebras of
X,
. Let
with
. Let
. Therefore, we have
. Since
is a subalgebra, we can obtain
. Hence, we can obtain:
Let with . Let . Then, we have . Since is a subalgebra, we can obtain . Hence, we can obtain , . Then, we have , .
Similarly, let with ; we can obtain , .
Thus, N is a neutrosophic hesitant fuzzy subalgebra of X. ☐
Definition 12. Let be a neutrosophic hesitant fuzzy set on X. , , , , are called generated subsets by N: , ,where “a” appears “k” times, “*” represents any binary operation “→” or “↪” on X, Theorem 3. Let be a neutrosophic hesitant fuzzy set on X. If N satisfies the following conditions:
(1) , ;
(2) , ;
(3) , ;
then , .
Proof. By Proposition 1, we can obtain
,
Thus,
,
.
Conversely, it is easy to check that .
Finally, we can obtain . ☐
Corollary 1. Let be a neutrosophic hesitant fuzzy set on X. If N satisfies the following conditions:
(1) , ;
(2) , ;
(3) , ;
then , .
Theorem 4. Let be a neutrosophic hesitant fuzzy set on X. N satisfies the following conditions:
(1) , ;
(2) , .
If , , then .
Proof: Let
. If
, by Proposition 1, we can obtain:
Similarly, we can obtain:
That is,
,
.
Corollary 2. Let be a neutrosophic hesitant fuzzy set on X. N satisfies the following conditions:
(1) , ;
(2) , .
If , , then .
The following example shows that may not be a filter of X.
Example 4. Let with two binary operations in Table 3 and Table 4. Then, is a pseudo-BCI algebra. Let:then is not a filter of X. Since , but . Theorem 5. Let be a neutrosophic hesitant fuzzy set on X. Let X be a type-2 positive implicative pseudo-BCK algebra. If functions and are injective, then is a filter of X for all .
Proof. (1) If X is a pseudo-BCK algebra, then by Definition 1 and Proposition 1, we can obtain .
(2) Let
with
. Thus,
. Since functions
and
are injective, by Definition 5, we have:
Similarly, we can obtain
. Thus, we have
.
(3) Similarly, let with ; we have . ☐
This means that is a filter of X for all .
Theorem 6. Let be a neutrosophic hesitant fuzzy set on X. Let X be a type-2 positive implicative pseudo-BCK algebra. If functions and satisfy the following identifies: ,
(1) ;
(2) ;
(3) ;
then is a filter of X for all .
Proof. (1) If X is a pseudo-BCK algebra, by Definition 1 and Proposition 1, .
(2) Let
with
. We have
,
. By Definition 5, we have:
Similarly, we can obtain
. Thus, we have
.
(3) Similarly, let with ; we have .
This means that is a filter of X for all . ☐
Theorem 7. Let be a neutrosophic hesitant fuzzy set on X and F be a filter of X. If functions and are injective, then for all .
Proof. (1) Let . By Definition 12, we have . Since F is a filter of X and are injective, thus we can obtain and . Continuing, we can obtain . Since , thus , .
(2) Let . When , we can obtain . Similarly, we have . Thus, we have .
This means that for all . ☐
Theorem 8. Let be a neutrosophic hesitant fuzzy set on X.
(1) If is a filter of X, then N satisfies: ,
(i) ;
(ii) .
(2) If N satisfies Conditions (i), (ii) and for all , then is a filter of X.
Proof. (1) (i) Let with ; we have . Since is a filter, thus we can have , .
(ii) Similarly, we know that (ii) is correct.
(2) Since for all , thus . Let with ; we can obtain . By Condition (i), we have . Thus, we can obtain . Similarly, let with , by Condition (1)(ii); we can obtain .
This means that is a filter of X. ☐
4. Neutrosophic Hesitant Fuzzy Filters of Pseudo-BCI Algebras
In the following, let X be a pseudo-BCI algebra, unless otherwise specified.
Definition 13. ([22]) A hesitant fuzzy set is called a hesitant fuzzy pseudo-filter (briefly, hesitant fuzzy filter) of X if it satisfies: (HFF1) , ;
(HFF2) , ;
(HFF3) , .
Definition 14. A neutrosophic hesitant fuzzy set is called a neutrosophic hesitant fuzzy pseudo-filter (neutrosophic hesitant fuzzy filter) of X if it satisfies:
(NHFF1) , ;
(NHFF2) , ;
(NHFF3) , .
A neutrosophic hesitant fuzzy set
is called a neutrosophic hesitant fuzzy closed filter of
X if it is a neutrosophic hesitant fuzzy filter such that:
.
Example 5. Let with two binary operations in Table 5 and Table 6. Then, is a pseudo-BCI algebra. Let:Then, N is a neutrosophic hesitant fuzzy filter of X. Theorem 9. Let be a neutrosophic hesitant fuzzy set on X. Then, N is a neutrosophic hesitant fuzzy filter of X if and only if it satisfies the following conditions: , , , are hesitant fuzzy filters of X.
Proof. Necessity: If N is a neutrosophic hesitant fuzzy filter:
(1) Obviously, is a hesitant fuzzy filter of X.
(2) By Definition 14, we have , ; similarly, by Definition 14, we have . Thus, is hesitant fuzzy filter of X.
(3) Similarly, we have that is a hesitant fuzzy filter of X.
Sufficiency: If , , are hesitant fuzzy filters of X. It is easy to prove that , , satisfies Definition 14. Therefore, is a neutrosophic hesitant fuzzy filter of X. ☐
Theorem 10. Let be a neutrosophic hesitant fuzzy set on X. Then, the following are equivalent:
(1) is a neutrosophic hesitant fuzzy filter of X;
(2) , the nonempty hesitant fuzzy level sets are filters of X, where is the power set of , Proof. (1)⇒(2) (i) Suppose . Let , then . Since N is a neutrosophic hesitant fuzzy filter of X, by Definition 14, we have . Thus, .
Let with , then . Since N is a neutrosophic hesitant fuzzy filter of X, by Definition 14, we have . Thus . Similarly, let with . We have .
Thus, we can obtain that is a filter of X.
(ii) Suppose . Let , then . Since N is a neutrosophic hesitant fuzzy filter of X, we have . Thus, , .
Let with , then . Since N is a neutrosophic hesitant fuzzy filter of X, we have . Thus, , . Similarly, let with . We have .
Thus, we can obtain that is a filter of X.
(iii) We have that is a filter of X. The progress of proof is similar to (ii).
(2)⇒(1) Suppose , for all .
(i’) Let with . Let . Since is a filter of X, we have . Thus, .
Let with . Let . Since is a filter of X for all , we have . Thus, .
Similarly, let with . We can obtain .
(ii’) Let with . Let . Since is a filter of X for all , we have . Thus, .
Let with . Let . Since is a filter of X for all , we have . Thus, .
Similarly, let with ; we have .
(iii’) Similarly, we can obtain .
Therefore, is a neutrosophic hesitant fuzzy filter of X. ☐
Definition 15. is a neutrosophic hesitant fuzzy set on X. Define a neutrosophic hesitant fuzzy set by:where , . Then, is called a generated neutrosophic hesitant fuzzy set by hesitant fuzzy level sets and . Theorem 11. Let be a neutrosophic hesitant fuzzy filter of X. Then, is a neutrosophic hesitant fuzzy filter of X.
Proof. (1) If N is a neutrosophic hesitant fuzzy filter of X, by Theorem 10, we know that are filters of X. Thus, , , , ,
(2) (i) Let with . By Theorem 9, Theorem 10 and Definition 15, we know .
Let with . By Theorem 9, Theorem 10 and Definition 15, we know . Thus, we have .
Similarly, let with ; we have .
(ii) Let with or . By Definition 15, we have or . Thus, we can obtain .
Let with or . By Definition 15, we have or . Since ; thus, we can obtain .
Similarly, let with or ; we have .
(3) We can obtain , , . The process of proof is similar to (2).
Thus is a neutrosophic hesitant fuzzy filter of X. ☐
Theorem 12. Let be a neutrosophic hesitant fuzzy filter of X. Then, N satisfies the following properties, ,
(1) ;
(2) , ;
, ;
, ;
(3) , ;
, ;
, ;
(4) , , ;
, , .
Proof. (1) Let with . By Proposition 1, we know (or ). If N is a neutrosophic hesitant fuzzy filter of X, by Definition 14, we have (). Thus, .
Similarly, we have .
(2) By Proposition 1, Definition 14, we know,
,
Similarly, we have,
:
(3) By Definition 1 and Definition 14, with regard to the function
, we can obtain,
,
Similarly, we have .
With regard to the function
, we can obtain,
,
Similarly, we have .
Similarly, with regard to the function , we can obtain , .
(4) Let
with
. By Remark 1 and Definition 14, we can obtain:
Similarly, we can obtain
.
Let with . We can obtain , , . The process of the proof is similar to the above. ☐
Theorem 13. A neutrosophic hesitant fuzzy set is a neutrosophic hesitant fuzzy filter of X if and only if hesitant fuzzy sets satisfy the following conditions, respectively.
(1) , ;
(2) , ;
(3) , .
Proof. Necessity: By Theorem 9, Theorem 12 and Definition 14, (1)∼(3) holds.
Sufficiency: (1) , by Proposition 1, we can obtain and . We have for all . Thus, is a hesitant fuzzy filter of X.
(2) , by Proposition 1, we can obtain ; thus, we have .
Similarly, we can have .
It is easy to obtain for all . Thus, is a hesitant fuzzy filter of X.
(3) We have that is a hesitant fuzzy filter of X. The process of the proof is similar (2).
Therefore, are hesitant fuzzy filters of X. By Theorem 9, we know that N is a neutrosophic hesitant fuzzy filter of X. ☐
Theorem 14. Let be a neutrosophic hesitant fuzzy filter of X. Then:where , Proof. If N is a neutrosophic hesitant fuzzy filter of X:
(i) By Theorem 12, we know that for .
(ii) By Theorem 12, we know that for . By Definition 14, we have . Thus, .
(iii) Suppose that the above formula is true for
; thus,
,
, and we can obtain
. Therefore, suppose that
,
, then we have
. By Definition 14, we can obtain:
which complete the proof. ☐
Corollary 3. Let be a neutrosophic hesitant fuzzy filter of X. Then:where “*” represents any binary operation “→” or “↪” on X, , Theorem 15. Let be a neutrosophic hesitant fuzzy filter of X and X be a pseudo-BCK algebra, then N is a neutrosophic hesitant fuzzy subalgebra of X.
Proof. If
is a neutrosophic hesitant fuzzy filter of
X, then we can obtain
,
Similarly, we can obtain
. Thus,
N is a neutrosophic hesitant fuzzy subalgebra of
X. ☐
Theorem 16. Let be a neutrosophic hesitant fuzzy closed filter of X. Then, N is a neutrosophic hesitant fuzzy subalgebra of X.
Proof. The process of proof is similar to Theorem 15. ☐
If is a neutrosophic hesitant fuzzy subalgebra of X, then N may not be a neutrosophic hesitant fuzzy filter of X.
Example 6. Let with two binary operations in Table 1 and Table 2. Then, is a pseudo-BCI algebra. N is a neutrosophic hesitant fuzzy subalgebra of X. However, N is not a neutrosophic hesitant fuzzy filter of X. Since , , we cannot obtain . Definition 16. is a neutrosophic hesitant fuzzy set on X. Define a neutrosophic hesitant fuzzy set by ,where , . Then, is called a generated neutrosophic hesitant fuzzy set. A generated neutrosophic hesitant fuzzy set may not be a neutrosophic hesitant fuzzy filter of X.
Example 7. Let with two binary operations in Table 1 and Table 2. Then, is a pseudo-BCI algebra. N is a neutrosophic hesitant fuzzy set of X. However, is not a neutrosophic hesitant fuzzy filter of X. Since , , we cannot obtain . Theorem 17. Let X be a pseudo-BCK algebra. If X is a type-2 positive implicative pseudo-BCK algebra, then is a neutrosophic hesitant fuzzy filter of X for all .
Proof. If X is a pseudo-BCK algebra, (1) by Definition 1 and Proposition 1, we can obtain . for all .
(2) (i) Let
with
or
or
or
. Thus, we can obtain:
(ii) Let
with
,
and
,
. Then, by Proposition 1 and Definition 4, we can obtain:
Therefore, we can obtain,
Similarly, we can obtain,
This means that is a neutrosophic hesitant fuzzy filter of X. ☐
Example 8. Let with two binary operations in Table 7 and Table 8. Then, is a type-2 positive implicative pseudo-BCI algebra. Let N be a neutrosophic hesitant fuzzy set. We take as an example; thus, we have satisfy . Let , , , , , ,
Then, we can obtain that is a neutrosophic hesitant fuzzy filter of X. Theorem 18. Let be a neutrosophic hesitant fuzzy filter of X. Then, is a filter of X for all .
Proof. (1) Let with . Then, we have . Since is a neutrosophic hesitant fuzzy filter, thus we have . Similarly, we can get .
(2) Similarly, let with ; we have , .
This means that satisfies the conditions of Definition 2 (F1), (F2) and (F3); is a filter of X. ☐
Example 9. Let with two binary operations in Table 5 and Table 6. Then, is a pseudo-BCI algebra. Let:Then, N is a neutrosophic hesitant fuzzy filter of X. Let . It is easy to get that is a filter.