Abstract
As a generalization of single value neutrosophic rough sets, the concept of multi-granulation neutrosophic rough sets was proposed by Bo et al., and some basic properties of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators were studied. However, they did not do a comprehensive study on the algebraic structure of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators. In the present paper, we will provide the lattice structure of the pessimistic multigranulation neutrosophic rough approximation operators. In particular, in the one-dimensional case, for special neutrosophic relations, the completely lattice isomorphic relationship between upper neutrosophic rough approximation operators and lower neutrosophic rough approximation operators is proved.
1. Introduction
In order to deal with imprecise information and inconsistent knowledge, Smarandache [1,2] first introduced the notion of neutrosophic set by fusing a tri-component set and the non-standard analysis. A neutrosophic set consists of three membership functions, where every function value is a real standard or non-standard subset of the nonstandard unit interval . Since then, many authors have studied various aspects of neutrosophic sets from different points of view, for example, in order to apply the neutrosophic idea to logics, Rivieccio [3] proposed neutrosophic logics which is a generalization of fuzzy logics and studied some basic properties. Guo and Cheng [4] and Guo and Sengur [5] obtained good applications in cluster analysis and image processing by using neutrosophic sets. Salama and Broumi [6] and Broumi and Smarandache [7] first introduced the concept of rough neutrosophic sets, handled incomplete and indeterminate information, and studied some operations and their properties.
In order to apply neutrosophic sets conveniently, Wang et al. [8] proposed single valued neutrosophic sets by simplifying neutrosophic sets. Single valued neutrosophic sets can also be viewed as a generalization of intuitionistic fuzzy sets (Atanassov [9]). Single valued neutrosophic sets have become a new majorly research issue. Ye [10,11,12] proposed decision making based on correlation coefficients and weighted correlation coefficient of single valued neutrosophic sets, and gave an application of proposed methods. Majumdar and Samant [13] studied similarity, distance and entropy of single valued neutrosophic sets from a theoretical aspect.
Şahin and Küçük [14] gave a subsethood measure of single valued neutrosophic sets based on distance and showed its effectiveness through an example. We know that there’s a certain connection among fuzzy rough approximation operators and fuzzy relations (resp., fuzzy topologies, information systems [15,16,17]). Hence, Yang et al. [18] firstly proposed neutrosophic relations and studied some kinds of kernels and closures of neutrosophic relations. Subsequently they proposed single valued neutrosophic rough sets [19] by fusing single valued neutrosophic sets and rough sets (Pawlak, [20]), and they studied some properties of single value neutrosophic upper and lower approximation operators. As a generalization of single value neutrosophic rough sets, Bao and Yang [21] introduced -dimension single valued neutrosophic refined rough sets, and they also gave some properties of -dimension single valued neutrosophic upper and lower approximation operators.
As another generalization of single value neutrosophic rough sets, Bo et al. [22] proposed the concept of multi-granulation neutrosophic rough sets and obtained some basic properties of the pessimistic (optimistic) multigranulation neutrosophic rough approximation operators. However, the lattice structures of those rough approximation operators in references [19,21,22], were not well studied. Following this idea, Zhao and Zhang [23] gave the supremum and infimum of the -dimension neutrosophic upper and lower approximation operators, but they did not study the relationship between the -dimension neutrosophic upper approximation operators and the -dimension neutrosophic lower approximation operators, especially in the one-dimensional case. Inspired by paper [23], a natural problem is: Can the lattice structure of pessimistic (optimistic) multigranulation neutrosophic approximation operators be given?
In the present paper, we study the algebraic structure of optimistic (pessimistic) multigranulation single valued neutrosophic approximation operators.
The structure of the paper is organized as follows. The next section reviews some basic definitions of neutrosophic sets and one-dimensional multi-granulation rough sets. In Section 3, the lattice structure of the pessimistic multigranulation neutrosophic rough approximation operators are studied. In Section 4, for special neutrosophic relations, a one-to-one correspondence relationship between neutrosophic upper approximation operators and lower approximation operators is given. Finally, Section 5 concludes this article and points out the deficiencies of the current research.
2. Preliminaries
In this section, we briefly recall several definitions of neutrosophic set (here “neutrosophic set” refers exclusively to “single value neutrosophic set”) and one-dimensional multi-granulation rough set.
Definition 1
([8]). A neutrosophic set in is defined as follows: ,
where , , , . The set of all neutrosophic sets on will be denoted by .
Definition 2
([11]). Let and be two neutrosophic sets in , if
for each , then we called is contained in , i.e., . If and , then we called is equal to , denoted by .
Definition 3
([18]). Let and be two neutrosophic sets in ,
- (1)
- The union ofandis a s neutrosophic set, denoted by, where,
- (2)
- The intersection ofandis a neutrosophic set, denoted by, where,
Definition 4
([18]). A neutrosophic relation in is defined as follows:
where , and
The family of all neutrosophic relations in X will be denoted by, and the pairis called a neutrosophic approximation space.
Definition 5
([19]). Let be a neutrosophic approximation space, , the lower and upper approximations of with respect to , denoted by and , are two neutrosophic sets whose membership functions are defined as: ,
The pairis called the one-dimensional multi-granulation rough set (also called single value neutrosophic rough set or one-dimension single valued neutrosophic refined rough set) of A with respect to.andare referred to as the neutrosophic lower and upper approximation operators,respectively.
Lemma 1
([19]). Let and be two neutrosophic relations in , , we have
- (1)
- ;
- (2)
- ;
- (3)
- ;
- (4)
3. The Lattice Structure of the Pessimistic Multigranulation Neutrosophic Rough Approximation Operators
In this section, set is called a multigranulation neutrosophic relations set on if each is a neutrosophic relation on . In this case, the pair will be called an -dimensional multigranulation neutrosophic apptoximation space.
Definition 6
([22]). Let be an -dimensional multigranulation neutrosophic apptoximation space. We define two pairs of approximation operators as follows, for all and ,
where
Then the pairis called an optismistic multigranulation neutrosophic rough set, and the pairis called an pessimistic multigranulation neutrosophic rough setandare referred to as the optimistic and pessimistic multigranulation neutrosophic upper approximation operators, respectively. Similarly,andare referred to as the optimistic and pessimistic multigranulation neutrosophic lower approximation operators, respectively.
Remark 1.
If, then the multigranulation neutrosophic rough set will degenerated to a one-dimensional multi-granulation rough set (see Definition 5). In the following, the family of all multigranulation neutrosophic relations set onwill be denoted by. Defined a relationonas follows:if and only if, thenis a poset, whereand.
, whereandbe a index set, we can define union and intersection ofas follows:
where
Thenandare two multigranulation neutrosophic relations on, and we easily show thatandare infimum and supremum of, respectively. Hence we can easily obtain the following theorem:
Theorem 1.
is a complete lattice,andare its top element and bottom element, respectively, whereandare two neutrosophic relations inand defined as follows:,,,and,,. In particular,is a complete lattice.
Theorem 2.
Letandbe two multigranulation neutrosophic relations set on,, we have
- (1)
- ,;
- (2)
- ,;
- (3)
- ,;
- (4)
- ,
Proof.
We only show that the case of the optimistic multigranulation neutrosophic approximation operators.
- (1)
- , by Lemma 1 and Definition 6, we have the following:Hence, .
- (2)
- , by Lemma 1 and Definition 6, we have the following:Hence, .
- (3)
- , by Lemma 1 and Definition 6, we have the following:Hence,
- (4)
- , by Lemma 1 and Definition 6, we have the following:Hence, □
From Theorem 2, we can easily obtain the following corollary:
Corollary 1.
Letandbe two multigranulation neutrosophic relations set on. If, then,
Let and be the set of pessimistic multigranulation neutrosophic upper and lower approximation operators in , respectively.
- Defined a relation on as follows: if and only if for each . Then is a poset.
- Defined a relation on as follows: if and only if for each . Then is a poset.
Let and be the set of optimistic multigranulation neutrosophic upper and lower approximation operators in , respectively.
- Defined a relation on as follows: if and only if for each . Then is a poset.
- Defined a relation on as follows: if and only if for each . Then is a poset.
Theorem 3.
(1)andbe a index set, we can define union and intersection ofas follows:
whereThenandare supremum and infimum of, respectively.
(2)andbe a index set, we can define union and intersection ofas follows:
whereThenandare supremum and infimum of, respectively.
Proof.
We only show (1).
Let , then for each By Corollary 1, we have for any . Thus . If is a multigranulation neutrosophic relations set such that for each , then , . Hence,
Thus So is the supremum of .
Let , then , we have
Thus for each . If is a multigranulation neutrosophic relations set such that for each , then
By the construction of , we can easily obtain . Hence,
So is the infimum of . □
Remark 2.
(1), ∀a ∈ X, we can calculate that the following formula holds.
Hence,,and. It shows thatand, i.e.,is the bottom element ofandis the bottom element of. By Theorem 3, we have the following result: Bothandare complete lattices.
(2) Similarly, we can prove that bothandare complete lattices if we can use the generalization formula of
However, by Theorem 2, we known that
So, naturally, there is the following problem:
How to give the supremum and infimum of the optimistic multigranulation neutrosophic rough approximation operators?
In the one-dimensional case, for convenience, we will use and to denote the set of neutrosophic upper and lower approximation operators in X, respectively. According to Lemma 1, Remark 2 and Theorem 3, we have the following result: both and are complete lattices (it is also the one-dimensional case of Reference [23]).
4. The Relationship between Complete Lattices and
In this section, we will study the relationship between complete lattices and . Set
Firstly, we will give an example to illustrate that is not an empty family.
Example 1.
Letbe a single point set,andare two single valued neutrosophic relations in.
- (1)
- If, then. In fact, if, thenfor eachThus, ,Moreover,,, andConsidering the arbitrariness of, in particular, take, we have,andHence,.Similarly, we also can show that the following result:
- (2)
- If, then.So, by (1), (2) and Corollary 1, we have, i.e.,is not an empty family.
Now, we will give the relationship between complete lattices and .
Proposition 1.
If, then, whereis a index set, andfor each.
Proof.
We first show that . Let be a neutrosophic relation in such that for each , then , this is equivalent to since . Thus Moreover, by the construction of , we have On the other hand, we can show that for each . So
Hence
Now, we show that Let be a single valued neutrosophic relation in such that for each , then , this is equivalent to since . Thus Moreover, by the construction of . We have
On the other hand, we can show that for each . So
Hence,
From above proved, we know that □
Theorem 4.
If, thenandare complete lattice isomorphism.
Proof.
Define a mapping as follows: , Obviously, is surjective. If , notice that , we know that So is one-one. and be a index set. By Theorem 3 and Proposition 1, we have
and
Hence, preserves arbitrary union and arbitrary intersection. □
From above proved, we know that and are complete lattice isomorphism.
Theorem 5.
If, thenandare complete lattice isomorphism.
Proof.
Define a mapping as follows:, Obviously, is surjective. If , notice that , we know that So is one-one. and be an index set. By Theorem 3 and Proposition 1, we have
and
Hence, preserves arbitrary union and arbitrary intersection. □
From the above proof, we know that and are complete lattice isomorphism.
Theorem 6.
If, thenandare complete lattice isomorphism.
Proof.
Through Theorems 4 and 5, we immediately know that the conclusion holds. We can also prove it by the following way:
Define a mapping as follows: , Through Theorems 4 and 5, there must be one and only one such that for each This shows is surjective. If , notice that , we know that So is one-one. and be a index set. Through Theorem 3 and Proposition 1, we have
and
Hence, preserves arbitrary union and arbitrary intersection. So, and are complete lattice isomorphism. □
Remark 3.
Through Theorems 4–6, we can ascertain that,andare isomorphic mappings among complete lattices. Moreover, the following diagram can commute, i.e.,(see Figure 1).
Figure 1.
Correspondence relationship among three complete lattices.
5. Conclusions
Following the idea of multigranulation neutrosophic rough sets on a single domain as introduced by Bo et al. (2018), we gave the lattice structure of the pessimistic multigranulation neutrosophic rough approximation operators. In the one-dimensional case, for each special , we gave a one-to-one correspondence relationship between complete lattices and . Unfortunately, at the moment, we haven’t solved the following problems:
- (1)
- Can the supremum and infimum of the optimistic multigranulation neutrosophic rough approximation operators be given?
- (2)
- For any set , are and isomorphic between complete lattices?
Author Contributions
H.Z. provided the idea of the paper and proved the theorems. H.-Y.Z. provided helpful suggestions.
Funding
This research received no external funding.
Acknowledgments
The work is partly supported by the National Natural Science Foundation of China (Grant No. 61473181, 11771263 and 11671007), the Doctoral Scientific Research Foundation of Xi’an Polytechnic University (Grant No. BS1426), the Construction Funding of Xi’an Polytechnic University for Mathematics (Grant No. 107090701), and the Scientific Research Program Funded by Shaanxi Provincial Education Department (2018).
Conflicts of Interest
The authors declare no conflict of interest.
References
- Smarandache, F. Neutrosophy: Neutrosophic Probability, Set, and Logic; American Research Press: Rehoboth, MA, USA, 1998. [Google Scholar]
- Smarandache, F. Neutrosophic set––A generialization of the intuitionistics fuzzy sets. Int. J. Pure Appl. Math. 2005, 24, 287–297. [Google Scholar]
- Rivieccio, U. Neutrosophic logics: Prospects and problems. Fuzzy Sets Syst. 2008, 159, 1860–1868. [Google Scholar] [CrossRef]
- Guo, Y.; Cheng, H.D. A new neutrosophic approach to image segmentation. Pattern Recogn. 2009, 42, 587–595. [Google Scholar] [CrossRef]
- Guo, Y.; Sengur, A. NCM: Neutrosophic c-means clustering algorithm. Pattern Recogn. 2015, 48, 2710–2724. [Google Scholar] [CrossRef]
- Salama, A.A.; Broumi, S. Roughness of neutrosophic sets. Elixir Appl. Math. 2014, 74, 26833–26837. [Google Scholar]
- Broumi, S.; Smarandache, F. Rough neutrosophic sets. Ital. J. Pure Appl. Math. 2014, 32, 493–502. [Google Scholar]
- Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets, Multispace Multistruct. Google Sch. 2010, 4, 410–413. [Google Scholar]
- Atanassov, K. Intuitionistic fuzzy sets. Fuzzy Sets Syst. 1986, 20, 87–96. [Google Scholar] [CrossRef]
- Ye, J. Multicriteria decision-making method using the correlation coefficient under single-valued neutrosophic environment. Int. J. Gen. Syst. 2013, 42, 386–394. [Google Scholar] [CrossRef]
- Ye, J. Improved correlation coefficients of single valued neutrosophic sets and interval neutrosophic sets for multiple attribute decision making. J. Intell. Fuzzy Syst. 2014, 27, 2453–2462. [Google Scholar]
- Ye, S.; Ye, J. Dice similarity measure among single valued neutrosophic multisets and its applcation in medical diagnosis. Neutrosophic Sets Syst. 2014, 6, 48–53. [Google Scholar]
- Majumdar, P.; Samant, S.K. On similarity and entropy of neutrosophic sets. J. Intell. Fuzzy Syst. 2014, 26, 1245–1252. [Google Scholar]
- Şahin, R.; Küçük, A. Subsethood measure for single valued neutrosophic sets. J. Intell. Fuzzy Syst. 2015, 29, 525–530. [Google Scholar] [CrossRef]
- Li, Z.W.; Cui, R.C. T-similarity of fuzzy relations and related algebraic structures. Fuzzy Sets Syst. 2015, 275, 130–143. [Google Scholar] [CrossRef]
- Li, Z.W.; Cui, R.C. Similarity of fuzzy relations based on fuzzy topologies induced by fuzzy rough approximation operators. Inf. Sci. 2015, 305, 219–233. [Google Scholar] [CrossRef]
- Li, Z.W.; Liu, X.F.; Zhang, G.Q.; Xie, N.X.; Wang, S.C. A multi-granulation decision-theoretic rough set method for distributed fc-decision information systems: An application in medical diagnosis. Appl. Soft Comput. 2017, 56, 233–244. [Google Scholar] [CrossRef]
- Yang, H.L.; Guo, Z.L.; She, Y.H.; Liao, X.W. On single valued neutrosophic relations. J. Intell. Fuzzy Syst. 2016, 30, 1045–1056. [Google Scholar] [CrossRef]
- Yang, H.L.; Zhang, C.L.; Guo, Z.L.; Liu, Y.L.; Liao, X.W. A hybrid model of single valued neutrosophic sets and rough sets: Single valued neutrosophic rough set model. Soft Comput. 2017, 21, 6253–6267. [Google Scholar] [CrossRef]
- Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
- Bao, Y.L.; Yang, H.L. On single valued neutrosophic refined rough set model and its applition. J. Intell. Fuzzy Syst. 2017, 33, 1235–1248. [Google Scholar] [CrossRef]
- Bo, C.X.; Zhang, X.H.; Shao, S.T.; Smarandache, F. Multi-Granulation Neutrosophic Rough Sets on a Single Domain and Dual Domains with Applications. Symmetry 2018, 10, 296. [Google Scholar] [CrossRef]
- Zhao, H.; Zhang, H.Y. A result on single valued neutrosophic refined rough approximation operators. J. Intell. Fuzzy Syst. 2018, 1–8. [Google Scholar] [CrossRef]
© 2018 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).