Dual Hesitant Fuzzy Probability

Intuitionistic fuzzy probabilities are an extension of the concept of probabilities with application in several practical problem solving tasks. The former are probabilities represented through intuitionistic fuzzy numbers, to indicate the uncertainty of the membership and nonmembership degrees in the value assigned to probabilities. Moreover, a dual hesitant fuzzy set (DHFS) is an extension of an intuitionistic fuzzy set, and its membership degrees and nonmembership degrees are represented by two sets of possible values; this new theory of fuzzy sets is known today as dual hesitant fuzzy set theory. This work will extend the notion of dual hesitant fuzzy probabilities by representing probabilities through the dual hesitant fuzzy numbers, in the sense of Zhu et al., instead of intuitionistic fuzzy numbers. We also give the concept of dual hesitant fuzzy probability, based on which we provide some main results including the properties of dual hesitant fuzzy probability, dual hesitant fuzzy conditional probability, and dual hesitant fuzzy total probability.


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 (α, β) − cuts 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.

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 h(x) and g(x) are two sets of some values in [0, 1], denoting the possible membership degrees and nonmembership degrees of the element x ∈ X to the set D, respectively, with the conditions: 0 ≤ γ, η ≤ 1 and 0 max{γ}, and η + ∈ g + (x) = ∪ η∈g(x) max{η} for x ∈ X.For convenience, the pair e(x) = {< h(x), g(x) >} is called a DHFE denoted by all e = {< h, g >}.
The support of the DHFS D is the crisp set Supp(D) = {t ∈ X : max h(t) = 0 and max g(t) = 1} ⊆ X, whereas the kernel of the DHFS D is the crisp set Ker(D) = {t ∈ X : max h(t) = 1 and max g(t) = 0} ⊆ X.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.
The following operations are also given by Zhu et al. [2], for any DHFEs, d, d 1 and d 2 , (1) ⊕ − union: where n is a positive integral and all the results are also DHFEs.
, where h and g are the numbers of the elements in h and g, respectively, then In order to give the level set of a DHFS, we give the following notion: Let d = {h, g} be a DHFE.Then, s(h) = 1 h ∑ γ∈h γ and s(g) = 1 g ∑ η∈g η are the score function of the membership degrees and nonmembership degrees of DHFEs, respectively, where h and g are the numbers of elements in h and g, respectively.

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] Define on T a binary relation ≤ T given by (x 1 , x 2 ) ≤ T (y 1 , y 2 ) provided that x 1 ≤ y 1 and y 2 ≤ x 2 .Then, (T, ≤ T , 0 T , 1 T ) is a bounded complete lattice, where 0 T stands for (0,1) and 1 T 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 ≤ T , could be obtained as follows: and Given (α, β) ∈ T and a DHFS D of universe X, the (α, β) − cut of D is the set: On the other hand, every DHFS can be recovered from its (α, β) − cuts.In fact, (h , where the supremum is with respect to ≤ T .Definition 4. Let D be a dual hesitant fuzzy set with universe R. D is convex if its cuts D (α,β) are convex subsets of X for all α, β ∈ (0, 1].
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 x, y ∈ X and λ ∈ [0, 1] it holds that (min{s(h >} is a DHFS and we denote by D 1 the hesitant fuzzy set defined by means of the membership function of D (i.e., Remark 1. (D 1 ) α and α − cut of the hesitant fuzzy set in Lemma 1 is given in [16].
Thus, for the convex DHFS, its (α, β) − cuts 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 Important subclasses of a DHFN are those in which s(h D ), as well as its complement s(g D ), 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 s(h D ) and s(g D ) in Figure 1.We can denote it by (S a , S b /S c /S d , S e ); one advantage of the DHTFN is that its (α, β) − cut can be expressed as follows: where 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.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, . Proof.Straightforward.

Dual Hesitant Fuzzy Probability
Let X = {x 1 , ..., x 2 } be a finite set.Let be the set of all strictly positive DHFN and let di ∈ , i = 1, ..., n, with di 1, for all i = 1, ..., n.A family of fixed DHFNs such that there are di ∈ ( di ) (α,β) with Define also, for each A ⊆ X and DHFS (α, β) ∈ L, the following set: where I A is the set of indexes of A, that is, Theorem 4. Let A ⊆ X, ( P(A)) (α,β) are the (α, β) − cuts of a DHFN, P(A), that is, P : ℘(X) → , where ℘(X) is the powerset of X.
Proof.Let S = {y 1 , y 2 , ..., We have that f is continuous and Dom is bounded and closed.Then, the images of f are some bounded and closed intervals of R. For each (α, By Equation ( 13), we have that, for each α, β ∈ (0, 1], ( P is called a dual hesitant fuzzy probability function.
Remark 3. If the DHFS reduces to a fuzzy set or an intuitionistic fuzzy set, then the dual hesitant fuzzy probability reduces to a fuzzy probability or an intuitionistic fuzzy probability.
Then, for each A, B ⊆ X, the following properties hold:

Proof.
(i) Notice that A ∩ B = ∅ if and only if I A ∩ I B = ∅.In order to prove (i), we only need to prove that: Namely, for each (α, β) ∈ L, α and ∑ n l=1 d l = 1}, which proves that P(A ∪ B) ⊆ P(A) + P(B) − P(A ∩ B).

Dual Hesitant Fuzzy Conditional Probability
Let A, B ⊆ X with I A and I B being their index sets, respectively.Define the dual hesitant fuzzy conditional probability of A with B as being the DHFS P(A|B) whose (α, β) − cuts are: Theorem 6. P(A|B) ⊆ P(A∩B) P(B) .
Proof.It is sufficient to prove that: Notice that A ∩ B = ∅ if and only if To prove Equation ( 17), it is sufficient to prove that for each α ∈ [0, 1], , which is obvious.
Proof.Analogous to the proof of Theorem 4 by replacing the function f in Equation ( 14) by .
Theorem 9. Let A 1 , A 2 , ..., A k be subsets of X, i.e., A i ∩ A j = ∅ when i = j and X = ∪ k i=1 A i .Let B, C ⊆ X, then P(B|C) ⊆ ∑ k i=1 P(A j |C) • P(B|A j ∩ C).
Proof.Since B = ∪ k i=1 B ∩ A i , by Theorem 8 item 1, we have that P(B|C) ⊆ ∑ k i=1 P(B ∩ A i |C).So, by Lemma 4, we have P(B ∩ A j |C) = P(A j |C) • P(B|A j ∩ C), and therefore, P(B|C) ⊆ ∑ k i=1 P(A j |C) • P(B|A j ∩ C).
Theorem 10.Let A 1 , A 2 , ..., A k be subsets of X = {x 1 , x 2 , ..., x n } such that A i ∩ A j = ∅ when i = j and X = ∪ k i=1 A i .Let D by any event, then P(D) ⊆ P(A i ) • P(D|A i ).
Proof.Since D = ∪ k i=1 D ∩ A i , then by Theorem 8 item 1, we have P(D) ⊆ ∑ k i=1 P(A i |D).Therefore, by Lemma 5, P(D) ⊆ P(A i ) • P(D|A i ).
Next, we give the dual hesitant fuzzy Bayes' theorem.
Theorem 11.Let A 1 , A 2 , ..., A k be subsets of X = {x 1 , x 2 , ..., x n } such that A i ∩ A j = ∅ when i = j and X = ∪ k i=1 A i .Let D by any event, then P(A i |D) ⊆ .
Proof.From Theorems 6 and 7, we have that P(A i |D) ⊆ P(A i ∩D) P(D) ⊆ P(A i ∩D) ∑ k j=1 P(A j ) P(D|A j ) .

Application of Color Blindness
Although fuzzy probabilities have been applied to the problem of color blindness by Buckley [11], sometimes they are not suitable for the practical environment.The following example is given to show the application of dual hesitant fuzzy probabilities.
Example 2. Some people believe that red-green color blindness is more prevalent in males than in females.To test this hypothesis, we gather a random sample from the adult population.Let M be the event that a person is male, F is the event that a person is female, C is the event that a person has red-green color blindness and C is the event that he/she does not have red-green color blindness.
Assume that researchers investigate three cities to reflect red-green color blindness in males and in females.As we cannot avoid information loss and some people do not participate in the survey, we can make it a DHFE.Thus, a dual hesitant fuzzy set of the point estimates of probabilities is given to indicate the results of the investigation: Assume that the uncertainty in these point estimates has been shown in their fuzzy values as follows: We wish to calculate the dual hesitant fuzzy conditional probabilities P(M|C) and P(F|C).The (α, β) − cuts of the first fuzzy probability are: for (α, β) ∈ L and S donates "p i ∈ (p i ) (α,β) (i =

Conclusions and Further Study
This work extends the notion of dual hesitant fuzzy probabilities by representing probabilities through the dual hesitant fuzzy numbers, in the sense of Zhu et al., instead of intuitionistic fuzzy numbers.We also give the concept of dual hesitant fuzzy probability, based on which we provide some main results including the properties of dual hesitant fuzzy probability, dual hesitant fuzzy conditional probability, and dual hesitant fuzzy total probability.It is an extension of the approach of [13] to intuitionistic fuzzy probability, since all intuitionistic fuzzy sets (and thus intuitionistic fuzzy numbers and fuzzy probabilities) are a dual hesitant fuzzy set (with h D = u, g D = v).
This extension may be useful in some situations where some uncertain probabilities are hesitant, but where this uncertainty can be modeled using dual hesitant fuzzy numbers.As a future work, we intend, using this same approach, to generalize the notion of probability spaces as well as other concepts related to probability.We also expect to extend the notions of Markov chain, and the hidden Markov model, etc.Furthermore, DEHFSs are likely to play an important role in decision making with more studies on the theory and applications.

Theorem 2 .
Let A and B be two DHFNs.Then, A + B, A − B, A • B and A/B(0 / ∈ B) are DHFNs.Proof.Straightforward.