1. Introduction
After the introduction of the concept of fuzzy sets by Zadeh in [
1], several surveys were conducted on possible extensions of the concept of fuzzy set. Among these extensions, one that has attracted the attention of much research in recent decades is dual hesitant fuzzy set theory, introduced by Zhu et al. [
2]. In 2011, Xu and Xia [
3] defined the concept of dual hesitant fuzzy element (DHFE), which can be considered as the basic unit of a DHFS, and is also a simple and effective tool used to express the decision makers’ hesitant preferences in the process of decision making. Since then, many scholars [
4,
5,
6,
7,
8,
9] have conducted much research work on aggregation, distance measures, correlation coefficient, and decision making with dual hesitant fuzzy information.
On the other hand, probability theory is an old uncertainty method which is appropriate to deal with another kind of uncertainty. However, since probabilities consider an absolute knowledge, and in many real situations this knowledge is partially known or uncertain, there were several ways to extend the notion of probabilities to deal with such situations. An original conception of connecting fuzzy set theory with probability theory was first introduced by Hirota and Wright [
10]. For James Buckley [
11], the probabilities of events, in practice, should be known exactly, however, these values are very often estimated or provided by experts, and therefore are of vague nature. He modeled this vagueness using fuzzy numbers. This approach has been applied in several subjects (see [
11,
12]), such as testing for HIV, and other blood type problems. Besides, according to fuzzy probability, James Buckley [
11] also proposed fuzzy Markov chains, and joint fuzzy probability distributions, etc., then applied them to the fuzzy queuing decision problem, machine servicing problem, fuzzy decisions under risk and fuzzy reliability theory. In 2010, Costa et al. [
13] introduced a generalization of the concept of fuzzy probabilities by using an original notion of intuitionistic fuzzy numbers instead of usual fuzzy numbers and gave some notions about intuitionistic fuzzy probabilities. In 2013, Costa et al. [
14] investigated Atanassov’s intuitionistic fuzzy probability and Markov chains. Rashid et al. [
15] introduced a convex hesitant fuzzy set and a quasi-convex hesitant fuzzy set with an example and investigated aggregation functions for convex hesitant fuzzy sets, which are available in the optimization problem.
As discussed above, a DHFS has its own desirable characteristics and advantages and appears to be a more flexible method—which is to be valued in multifold ways due to the practical demands—than the existing fuzzy sets, taking into account much more information given by decision makers, and at the same time, fuzzy probability and intuitionistic fuzzy probability play a crucial role in applications [
11]; we urgently need to put forward dual hesitant fuzzy probability to satisfy the same problems. In this paper, we will introduce probabilities to a DHFS by using an original notion of dual hesitant fuzzy numbers instead of usual fuzzy numbers. Thus, we give an original generalization, in the context of a DHFS, to the intuitionistic fuzzy probability approach of Costa et al. in [
13]; thus, we introduce a theory to deal with probabilities in a framework where it does not only model uncertainty in the probability of some events but also models the dual hesitation which is naturally present in the uncertainty.
Motivated by earlier research work, the remainder of the paper is organized as follows: In
Section 2, some basic concepts of dual hesitant fuzzy sets are presented. In
Section 3, we give some convexity for DHFSs, which contains a convex dual hesitant fuzzy set with respect to
and a quasi-convex dual hesitant fuzzy set; we also introduce intuitionistic fuzzy numbers that are fundamental to the paper. In
Section 4, we provide the main definitions and results of this work.
Section 5 introduces a dual hesitant fuzzy extension of (fuzzy intuitionistic) conditional probability and it is proven that this extension satisfies more analogous properties than conditional probabilities. In
Section 6, an example of the application of color blindness is given to show the actual need of dual hesitant fuzzy probability. A conclusion to the paper and further topics are given in
Section 7.
2. Some Basic Concepts about DHFS
Zhu et al. [
2] defined a DHFS—which is an extension of the hesitant fuzzy set, in terms of two functions that return two sets of membership values and nonmembership values, respectively, for each element in the domain—as follows.
Definition 1. [2] Let X be a fixed set, then a DHFS D on X is defined as:where and are two sets of some values in [0, 1], denoting the possible membership degrees and nonmembership degrees of the element to the set D, respectively, with the conditions: and , where , , , and for . For convenience, the pair is called a DHFE denoted by all . The support of the DHFS D is the crisp set and max , whereas the kernel of the DHFS D is the crisp set and . The DHFS D is said to be normal provided that it has a non-empty kernel.
From the above definition, we can see that it consists of two parts, that is, the membership hesitancy function and the nonmembership hesitancy function; this supports more exemplary and flexible access to assign values for each element in the domain, and two kinds of hesitancy can be handled in this situation. The existing sets, including fuzzy sets, intuitionistic fuzzy sets, hesitant fuzzy sets, and fuzzy multisets, can be regarded as special cases of DHFSs.
Example 1. Let D be a dual hesitant fuzzy set in , and we give three dual hesitant fuzzy elements to a set D as follows:
,
,
,
then .
The following operations are also given by Zhu et al. [
2], for any DHFEs,
d,
and
,
- (1)
: ;
- (2)
: ;
- (3)
;
- (4)
, where n is a positive integral and all the results are also DHFEs.
Definition 2. [2] Let be any two DHFEs, the score function of , and the accuracy function of , where and are the numbers of the elements in h and g, respectively, then - (i)
if , then is superior to , denoted by ;
- (ii)
if , then
- (1)
if , then is equivalent to , denoted by ;
- (2)
if , then is superior to , denoted by .
In order to give the level set of a DHFS, we give the following notion: Let be a DHFE. Then, and are the score function of the membership degrees and nonmembership degrees of DHFEs, respectively, where and are the numbers of elements in h and g, respectively.
3. Dual Hesitant Fuzzy Numbers
In this section, we carry out a brief introduction to some kinds of convexity for dual hesitant fuzzy sets, based on which we give some concepts about dual hesitant fuzzy numbers for a better understanding of the main body of the paper. Next, let us start by recalling a unit triangular lattice.
Definition 3. [16,17] Let Define on T a binary relation given by provided that and . Then, is a bounded complete lattice, where stands for (0,1) and stands for (1, 0). This new lattice T is called the unit triangular lattice. The unit triangular lattice
T has been proven to be a helpful tool in the theory of representability of several ordered structures as total preorders, interval orders and semiorders (see [
16,
17] for further details).
Given a DHFS
D, its supremum and infimum, with respect to
, could be obtained as follows:
and
Given
and a DHFS
D of universe
X, the
of
D is the set:
Notice that , where and . On the other hand, every DHFS can be recovered from its . In fact, , where the supremum is with respect to .
Definition 4. Let D be a dual hesitant fuzzy set with universe R. D is convex if its cuts are convex subsets of X for all .
An equivalent statement is shown as follows:
Definition 5. Let X be a vector space. A dual hesitant fuzzy set D of the universe X is said to be quasi-convex, if for all and it holds that .
Lemma 1. If is a DHFS and we denote by the hesitant fuzzy set defined by means of the membership function of D , then for any . This means that .
Proof. It is trivial that . Let , then . Since D is a DHFS, we have that , then and therefore . Then, . ☐
Remark 1. and of the hesitant fuzzy set in Lemma 1 is given in [16]. Theorem 1. Let X be a universe. The following statements are equivalent:
- (1)
D is a quasi-convex DHFS;
- (2)
any of DHFS D are convex crisp sets, for any ;
- (3)
is the membership function of a convex hesitant fuzzy set with respect to [16].
Proof. : To prove the direct implication, given , for all and such that , if D is a quasi-convex DHFS, we have that . Then, any of a DHFS D are convex crisp sets, for any .
On the contrary, given and , if we call and , it is clear that belong to the of the dual hesitant fuzzy set defined by . By hypothesis, also lies in this , so that . Thus, .
: Based on Lemma 1, it is easy to prove that it holds. ☐
Definition 6. Let D be a DHFS with universe R. D is continuous if and are continuous; D is normalized if there exists such that .
Thus, for the convex DHFS, its
are closed intervals of real numbers, and so it is possible to represent them via their end points, which can be obtained as follows:
and
that is,
. Where
and
.
Definition 7. A DHFS D with the real universe is a dual hesitant fuzzy number (DHFN) if it is convex, normalized and continuous. Denote by ℑ the set of all DHFN.
Important subclasses of a DHFN are those in which
, as well as its complement
, have a triangular shape, that is, they are triangular fuzzy numbers in the usual sense; then, we call the corresponding dual hesitant fuzzy number a dual hesitant triangular fuzzy number (DHTFN). Thus, as can be seen in
Figure 1, the DHTFN is completely determined by the score functions of
and
in
Figure 1. We can denote it by
; one advantage of the DHTFN is that its
can be expressed as follows:
Remark 2. If the DHFS reduces to a fuzzy set or an intuitionistic fuzzy set, then the DHFN reduces to a fuzzy number or an intuitionistic fuzzy number.
Let
A and
B be two DHFNs. Then, define the addition, subtraction, multiplication and division of
A with
B from the corresponding interval arithmetic operations on their
. Let
,
where
and
.
Notice that this method is equivalent to the extension principle method of fuzzy arithmetic [
12] and intuitionistic fuzzy arithmetic [
13]. Obviously, this procedure is more user friendly.
Theorem 2. Let A and B be two DHFNs. Then, , , and are DHFNs.
Proof. Straightforward.
It is possible to establish several orders on intuitionistic fuzzy numbers [11] which could be extended to DHFNs. Here, we give the following order on DHFNs:
where,
A DHFN D is strictly positive if for each , . Then, we have
Lemma 2. D is strictly positive if .
Proof. Straightforward.
Lemma 3. If A and B are strictly positive DHFNs, thenand Proof. Straightforward.
Theorem 3. Let A, B and C be three strictly positive DHFNs. Then,
- (i)
If then ;
- (ii)
If then ;
- (iii)
.
Proof. Let ,
- (i)
If , we have , thus or and . Then ;
- (ii)
If , we have , thus , namely, ;
- (iii)
As , namely, .
☐
5. Dual Hesitant Fuzzy Conditional Probability
Let
with
and
being their index sets, respectively. Define the dual hesitant fuzzy conditional probability of A with B as being the DHFS
whose
are:
Theorem 6.
Proof. It is sufficient to prove that:
Notice that
if and only if
.
To prove Equation (
17), it is sufficient to prove that for each
which is obvious. ☐
Theorem 7. is a DHFN.
Proof. Analogous to the proof of Theorem 4 by replacing the function
f in Equation (
14) by
. ☐
Theorem 8. Let and let be a dual hesitant fuzzy probability function. Then, for each the following properties hold:
- 1.
If then ;
- 2.
;
- 3.
, ;
- 4.
If then ;
- 5.
If then .
Proof. The proof of items 2–5, is trivial.
Notice that if , then To prove item 1, it is sufficient to prove that for each , .
However, this follows by the fact that lies in + , which is obvious.
Notice that the last term in the above equality coincides with . Then, . ☐
Lemma 4. Let . Then,
Proof. We only need to prove that for each ,
Furthermore, by Equation (
16),
which proves the Lemma. ☐
Theorem 9. Let be subsets of X, i.e., when and . Let , then .
Proof. Since , by Theorem 8 item 1, we have that . So, by Lemma 4, we have , and therefore, . ☐
Lemma 5. .
Proof. Let and with Then, and for any . ☐
Theorem 10. Let be subsets of such that when and . Let D by any event, then .
Proof. Since , then by Theorem 8 item 1, we have Therefore, by Lemma 5, .
Next, we give the dual hesitant fuzzy Bayes’ theorem. ☐
Theorem 11. Let be subsets of such that when and . Let D by any event, then .
Proof. From Theorems 6 and 7, we have that . ☐