The main purpose of this paper is to establish a mechanical procedure to determine the membership functions using the data collected from the economic and engineering problems. Determining the membership functions from the collected data may depend on the subjective viewpoint of decision makers. The mechanical procedure proposed in this paper can get rid of the subjective bias of decision makers. The concept of solid families is also proposed by regarding the sets in a family to be continuously varied. The desired fuzzy sets will be generated in the sense that its α-level sets will be identical to the sets of the original family. In order to achieve this purpose, any arbitrary families will be rearranged as the nested families by applying some suitable functions to the original families that are formulated from the collected data.
In economic and engineering problems, when the fuzziness is taken into account, the observed data sometimes are fuzzified to be fuzzy numbers. This kind of fuzzification may result in many different types of fuzzy numbers depending on the methodology adopted by the decision makers, where the subjectivity via the viewpoint of decision makers may have bias from the reality. In this paper, we propose a general methodology that can get rid of the subjectivity by directly generating the related fuzzy sets based on the observed data without involving the possible biased viewpoint of decision makers. The main idea is based on the solid and nested families of sets.
Suppose that we want to measure the water level in the season of summer. Owing to the fluctuation of water level, we cannot simply say that the water level is now 10 meters. We should say that the water level is around 10 meters. Therefore, the reasonable way to model the water level is to treat it as a fuzzy interval or fuzzy number. Under this consideration, the water level should be taken as a fuzzy number . The problem is that the determination of membership function of is subjective depending on the viewpoint of decision makers. In other words, there are infinite ways to setup the membership functions. It may happen that the different membership functions can result in the different final results. Therefore, the better way is to follow a mechanical procedure to setup the membership functions, which is the main purpose of this paper. We briefly address this mechanical procedure as follows.
We assume that there are 100 days in summer. Suppose that the engineers can measure the water level two times each day. In other words, the engineers can obtain a bounded closed interval each day by setting the lower and upper bounds of this interval as the low and high water levels, respectively. More precisely, we consider 100 values of α in the unit intervals [0, 1]. Then, we can obtain a bounded closed interval , where denotes the low water level and denotes the high water level in the (100 * α)th day. For example, the value α = 0.08 means the 8th day of this summer. In this case, we obtain a family of closed intervals given by
This family cannot be nested in the sense of Mα ⊆ Mβ for α > β. However, we can rearrange this family as a nested family given by
for some suitable function η : (0, 1] → (0, 1] such that we have the nestedness for α > β. The main purpose of this paper is to generate a fuzzy set such that its α-level set is identical to the closed interval . In this case, the fuzzy set can be used to describe the water level in summer in which the biased subjectivity raised by the decision makers can be avoided. In other words, this mechanical procedure is independent on decision makers.
In general, given an arbitrary family of nonempty subsets of a universal set U, where U can be or , the purpose of this paper is to generate a fuzzy set in U such that its α-level set is equal to Mα for each α ∈ (0, 1] when is a nested family in the sense of Mβ ⊆ Mα for β > α. The nestedness of the family plays an important role for guaranteeing the existence of such kind of fuzzy sets. The concept of nested families was taken into account for the possibility and random set theories by referring to Alvarez [1], Baudrit et al. [2] and Dubois et al. [3].
The family cannot be nested in general. However, we can always rearrange the family by applying a function η : (0, 1] → (0, 1] to the original family to form a new family
such that is a nested family in the sense of for β > α. In this case, we can also generate a fuzzy set in U satisfying for each α ∈ (0, 1]. More general in this paper, we shall generate a fuzzy set in U satisfying for each α ∈ (0, 1], where ζ : (0, 1] → (0, 1] is an increasing and bijective function. In particular, when ζ is taken to be an identity function, we shall recover the equality .
In this paper, we do not consider M0 in the family , since the 0-level set of a generated fuzzy set from the family does not necessarily include M0. The concept of 0-level set is also an important issue. There are two different concepts regarding the 0-level set. The simple concern is to take the whole universal set U as the 0-level set based on the definition of α-level sets for α ∈ [0, 1] given by
However, this kind of consideration is not helpful for identifying the effective domain of fuzzy sets. Therefore, the more reasonable way is to define the 0-level set as
where the topological concept of closure is considered. In this case, the 0-level set can be treated as the effective domain of the membership function . More concern on the concept of 0-level set can also refer to Wu [16, 17]. On the other hand, Šešelja, Stojić and Tepavčević [11–14] also studied the relationship between the α-level sets and fuzzy sets in which the 0-level set was not taken into account. In this paper, the 0-level set will be seriously considered. Jaballah and Saidi [8–10] studied the existence of fuzzy set whose family of α-level sets can represent a pre-determined nested family, where the 0-level set was defined as the whole universal set U. In this paper, the 0-level set will not be assumed to be U and the arbitrary families instead of nested families will be considered.
In Section 2, we present some basic properties of non-normal fuzzy sets that will be used in the discussions. In Section 3, we propose the concept of solid family that will be used to generate a fuzzy set. In Section 4, we consider the arbitrary families that can be rearranged as the nested families by assigning some suitable function. Many interesting properties will be presented and will be used to generate the desired fuzzy sets. In Section 5, two theorems will be established to present the way of generating the desired fuzzy sets from the arbitrary families of sets.
Non-normal fuzzy sets
Let be a fuzzy set in a universal set U with membership function . The range of membership function is denoted by . The range can be a proper subset of [0, 1] with . For example, the range can be some disjoin union of intervals in [0, 1].
For α ∈ (0, 1], the α-level set of is defined by
For α ∈ [0, 1], we also define the strong α-level set of as follows
When is endowed with a usual topology, the 0-level set is defined to be the closure of the support of , i.e., . Notice that if , we still can consider the α-level set .
Since the range is not necessarily equal to the whole unit interval [0, 1], it is possible that the α-level set can be an empty set for some α ∈ [0, 1]. In this case, we need to carefully treat the α-level sets for avoiding the emptiness.
Since the range plays an important role for the non-empty α-level sets, the following interesting equalities will be used in the further discussion:
and
We can rewrite the above equalities by considering the concept of interval range of .
Recall that the supremum of the set S, denoted by sup S, is not necessarily in S. Suppose that the supremum sup S is attained; that is, there exists α* ∈ S satisfying α* = sup S. Then it is also denoted by max S = α* ∈ S, i.e., the maximum of S. Define and
It is clear to see . We also see that for all and for all . The interval presented in (2) is also called an interval range of . The role of interval range can be used to clarify for all and for all . Since in general, the interval plays an important role for considering the α-level sets. The range is not helpful for identifying the α-level sets.
By referring to Wu [18], we also have
For α ∈ [0, 1), since for , we can show that
Recall that is called a normal fuzzy set in when there exists satisfying . In this case, the interval range of is given by . However, the range is still not necessarily equal to the whole unit interval [0, 1] even though is normal. The following interesting results will be used in the subsequent discussion.
Proposition 2.1. Let be a fuzzy set in a universal U, and let for with α > 0. Then Dα≠ ∅ for any with α > 0, and the support is the disjoin union of sets Dα given by
where Dα∩ Dβ = ∅ for α ≠ β.
Proof. Given any with α > 0, we have
From (5), we obtain
For α ≠ β, it is obvious that
This completes the proof. ■
Solid families
Let be a family of nonempty subsets of a universal set U. Let T be a subset of (0, 1]. Then, we can consider the subfamily of defined by
Let η : S → [0, 1] be a function defined on S. The range of η is denoted by . Then, we take and rename the elements of to form a new family
For convenience, we write for α ∈ S. Then, we consider the following family
We have the following observations.
Suppose that η is an identity function id. Then .
Suppose that η is an injective function from S into (0, 1]. Then, for each , there exists β ∈ S such that η (β) = α. In this case, we also write β = η-1 (α). Therefore, if the function η is injective, we have
for .
Example 3.1. Given any real numbers a1, a2, b1, b2 satisfying the order b1 < a1 < a2 < b2, for α ∈ [0, 1], we take
and
It is clear to see for all α ∈ [0, 1]. Therefore, we define a closed interval Mα in by for α ∈ (0, 1]. Now, we take S = [0.2, 0.9) and define a function η from S into (0, 1] by η (α) =1 - α. We also define
It is clear to see that
and
Therefore, we have
where with for α > β.
In the sequel, we shall propose the concept of solid family. Let S be a subset of (0, 1] with sup S = α*. For α ∈ S with α < α*, we write
Inspired by Proposition 2, by including the infimum inf S of S, we propose the following definition.
Definition 3.2. Let S be a subset of (0, 1] with sup S = α* and , and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U.
We say that is a solid family with respect to (η, S) when for α ∈ S with α < α*.
We say that is a relaxed solid family with respect to (η, S) when for α ∈ S with .
We also remark that if , the concepts of solid family and relaxed solid family are equivalent.
Example 3.3. Continued from Example 3, we want to show
If , then for some β0 ∈ S with β0 > α. Since is a strictly nested family in the sense of with for β > α, we have
which says that . Therefore, we obtain the inclusion On the other hand, since and are continuous with respect to α, using the strict monotonicity of and with respect to α, for any , there exists β1 ∈ S with β1 > α such that and , which says that , i.e., . Therefore, we obtain the desired equality. Since is a strictly nested family, we can also obtain
which implies
This shows that is a solid family with respect to (η, S).
Proposition 3.4. Let S be a subset of (0, 1] with sup S = α* and , and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that it is a relaxed solid family with respect to (η, S). Then the following statements hold true.
We have for α, β ∈ S with , and α ≠ β.
Suppose that α* ∈ S. Then for α ∈ S with .
Suppose that α* ∉ S and there exists M* satisfying for all α ∈ S. Then for α ∈ S with .
Moreover, when is a solid family with respect to (η, S), we can have the same results without assuming .
Proof. To prove part (i), given α, β ∈ S with , we have
which says that for α ≠ β with and .
To prove part (ii), suppose that for α ∈ S with . By the definition of , we see that , i.e., for all β ∈ S with β > α, which implies , since α* ∈ S with α* > α. Therefore, we obtain the desired result.
To prove part (iii), suppose that for α ∈ S with . It says that , i.e., for all β ∈ S with β > α. Since β ∈ S, the assumption says that , which implies x ∉ M*, since . Therefore, we obtain . This completes the proof. ■
Proposition 3.5. Let S be a subset of (0, 1] with sup S = α* and , and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that it is a relaxed solid family with respect to (η, S). Let T be a subset of S. Given any α ∈ S with , we have
When is a solid family with respect to (η, S), we can have the same equality without assuming .
Proof. Given any fixed and for some β ∈ T with , we have
If α > β, then the equality (7) says that , which contradicts . Therefore, we must have α ≤ β < α*, which implies the following inclusion
Another direction of inclusion is obvious. This completes the proof.■
Restricted nested families
In the sequel, we shall consider the concept of nested families with respect to a subset S of (0, 1] and a function η : S → [0, 1], and provide some interesting properties that will be used to study the existence of fuzzy sets.
Definition 4.1. Let S be a subset of (0, 1], and let be a family of nonempty subsets of a universal set U. We consider the subfamily of .
We say that is a nested family when Mα ⊆ Mβ for α, β ∈ S with β < α.
We say that is a strictly nested family when Mα ⊂ Mβ with Mα ≠ Mβ for α, β ∈ S with β < α.
If S = (0, 1], then we simply say that is a (strictly) nested family if and only if is a (strictly) nested family.
Even though is not a nested family, it is possible that there exists a subset S of (0, 1] such that is a nested subfamily.
Definition 4.2.Let S be a subset of (0, 1], and let be a family of nonempty subsets of a universal set U. Let η be a function from S into (0, 1].
We say that is a nested family with respect to (η, S) when for α, β ∈ S with β < α.
We say that is a strictly nested family with respect to (η, S) when with for α, β ∈ S with β < α.
Definition 4.3.Let S be a subset of (0, 1], and let be a family of nonempty subsets of a universal set U. We say that the family has a focal set M* when M* ⊆ Mα for all α ∈ S. If M* ≠ Mα for any α ∈ S, we also say that the nested family has a strict focal set M*.
Proposition 4.4.Let S be a subset of (0, 1] with sup S = α*, and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that it is a solid and nested family with respect to (η, S).
Suppose that α* ∈ S. Then is a focal set of the family . Given any α ∈ S with α < α*, we also have
Suppose that α* ∉ S. Then, given any α ∈ S, we have
Suppose that α* ∉ S, and that the family has a focal set M*. Given any α ∈ S, we have
Proof. To prove part (i), since is a nested family with respect to (η, S), we first have . Given any α ∈ S with α < α*, since is a solid family with respect to (η, S), we have
for β ∈ S with α < β. Therefore, we obtain the inclusion (8). Part (ii) can be realized from the proof of part (i).
To prove part (iii), by definition, we have for all α ∈ S, i.e., α < α*. Since we also have and for β ∈ S with α < β, we immediately have the inclusion (10), and the proof is complete. ■
Proposition 4.5Let S be a subset of (0, 1] with sup S = α*, and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that is a solid and nested family with respect to (η, S).
Suppose that α* ∈ S. Then
if and only if, given any α ∈ S with α < α*,
Suppose that α* ∉ S. Then
if and only if, given any α ∈ S,
Suppose that α* ∉ S, and that the family has a focal set M*. Then
if and only if, given any α ∈ S,
Proof. To prove the sufficiency of part (i), using (8), we have the following inclusion
For proving another direction of inclusion, we have
which implies
For proving the necessity of part (i), we have
Part (ii) can be realized from part (i) by using (9). Part (iii) can be similarly obtained by using (10). This completes the proof. ■
Proposition 4.6. ıLet S be a subset of (0, 1] with sup S = α*, and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that is a solid and nested family with respect to (η, S).
Suppose that α* ∈ S. Then, for any α ∈ S with α < α*, we have the strict inclusion .
Suppose that α* ∉ S, and that the family has a focal set M*. Then, for any α ∈ S, we have the strict inclusion ; that is to say, the family has a strict focal set M*.
Proof. To prove part (i), since is a nested family with respect to (η, S) and α* ∈ S, for any α ∈ S, we have the inclusion . Suppose that there exists β0 ∈ S with β0 < α* satisfying . Then, for any β ∈ S with β > β0, since
it follows that
for any β ∈ S with β > β0, which implies
Since is a nested family with respect to (η, S), we also have
Therefore, we obtain
which contradicts for any α ∈ S with α < α*.
To prove part (ii), since the family has a focal set M*, we have the inclusion for any α ∈ S. Suppose that there exists β0 ∈ S satisfying . Then, for any β ∈ S with β > β0, since
it follows that
for any β ∈ S with β > β0, which implies
The remaining proof follows from the above same argument. This completes the proof. ■
We say that S is a disjoin union of intervals in (0, 1] if S can be expressed as
for m subintervals of (0, 1] satisfying Ii∩ Ij = ∅ for i ≠ j. In this paper, we allow m = 1 for the special case.
Proposition 4.7.Let S be a disjoin union of intervals in (0, 1] with sup S = α*, and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that is a solid and nested family with respect to (η, S).
Suppose that α* ∈ S, and that, for any α ∈ S with α < α*,
Then
for αn ↑ α* with αn ∈ S and αn < α* for all n.
Suppose that α* ∉ S, and that, for any α ∈ S,
Then
for αn ↑ α* with αn ∈ S for all n.
Suppose that α* ∉ S, that the family has a focal set M*, and that, for any α ∈ S,
Then
for αn ↑ α* with αn ∈ S for all n.
Proof. To prove part (i), according to part (i) of Proposition 4, we define
Then, we immediately have Nα ⊆ Nβ for β < α < α*. Suppose that for αn ↑ α* with αn ∈ S and αn < α* for all n. We are going to lead to a contradiction. For x ∈ Nαn for all n, given any α ∈ S with α < α*, since αn ↑ α* with αn ∈ S and αn < α* for all n, there exists αm1 satisfying α* > αm1 > α, which says that x ∈ Nαm1 ⊆ Nα, i.e., x ∈ Nα. Using (16) and the assumption (13), we see that for some β1 ∈ S with α* > β1 ≥ α. Since S is a disjoin union of intervals and α* ∈ S, given any β1 ∈ S with β1 < α*, there exists β2 ∈ S satisfying α* > β2 > β1. We consider the following cases.
Since for β1 ∈ S with β1 < α* by part (ii) of Proposition 3, it follows that .
For any β ∈ S with α* > β ≥ β2, since β2 > β1, it follows that β ≠ β1. Since by part (i) of Proposition 3, we obtain .
Therefore, by the assumption (13), the above cases conclude that
Since , it follows that x ∉ Nβ2. Since β2 < α* and αn ↑ α* with αn ∈ S and αn < α* for all n, there exists αm2 such that αm2 ∈ S and α* > αm2 > β2, which says that Nαm2 ⊆ Nβ2. Therefore, we obtain x ∉ Nαm2, which contradicts x ∈ Nαn for all n. This shows that . It is easy to see that
when αn ↑ α* with αn ∈ S and αn < α* for all n.
To prove part (ii), suppose that for αn ↑ α* with αn ∈ S and αn < α* for all n. We are going to lead to a contradiction. For for all n, given any α ∈ S with α < α*, since αn ↑ α* with αn ∈ S and α* ∉ S, it follows that αn < α* for all n. Therefore, there exists αm3 satisfying α* > αm3 > α, which says that , i.e., . Using the assumption (14), we see that for some β3 ∈ S with β3 ≥ α. Since α* ∉ S, it means that α* > β3. Since S is a disjoin union of intervals, there exists β4 ∈ S satisfying α* > β4 > β3. For any β ∈ S with β ≥ β4, since β4 > β3, it follows that β ≠ β3. Since by part (i) of Proposition 3, we obtain . Therefore, by the assumption (14), we see that
Since β4 < α* and αn ↑ α* with αn ∈ S, i.e., αn < α* for all n, there exists αm4 satisfying αm4 ∈ S and αm4 > β4, which says that . Therefore, we obtain , which contradicts for all n. This shows that .
To prove part (iii), since α* ∉ S, we see that α < α* for all α ∈ S. By part (ii) of Proposition 4, we have for all α ∈ S. Let for α ∈ S. Then, we immediately have Nα ⊆ Nβ for β < α with α, β ∈ S. Suppose that for αn ↑ α*, and that x ∈ Nαn for all n. Given any α ∈ S, i.e., α < α*, since αn ↑ α*, there exists m5 satisfying m5 > α, which says that x ∈ Nαm5 ⊆ Nα, i.e., and x ∉ M*. By the assumption (15), we see that for some β5 ∈ S with β5 ≥ α. Since α* ∉ S, it means that α* > β5. Since S is a disjoin union of intervals, there exists β6 ∈ S satisfying α* > β6 > β5. For any β ∈ S with β ≥ β6, since β6 > β5, it follows that β ≠ β5. Since by part (i) of Proposition 3, it follows that . Since x ∉ M*, using the assumption (15), we obtain
Since , it follows that x ∉ Nβ6. Since αn ↑ α* and β6 < α*, there exists αm6 such that αm6 > β6, which says that Nαm6 ⊆ Nβ6. Therefore, we obtain x ∉ Nαm6, which contradicts x ∈ Nαn for all n. This shows that . It is easy to see that
when αn ↑ α* with αn ∈ S for all n. This completes the proof. ■
The converse of Proposition 2 can be obtained by providing some mild assumptions. We first present some useful inclusions
Proposition 4.8Let S be a subset of (0, 1], and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that is a solid and nested family with respect to (η, S). We have the following properties.
Suppose that α* ∈ S. Then, for any α ∈ S with α < α*, we have the strict inclusion .
Suppose that α* ∉ S, and that the family has a focal set M*. Then, for any α ∈ S, we have the strict inclusion .
Proof. To prove part (i), for any α ∈ S with α < α*, since for all γ ∈ S, we have
We want to show . Suppose that . We are going to lead to a contradiction. Since sup S = α*, for any α ∈ S with α < α*, according to the concept of supremum, there exists γ ∈ S such that α* > γ > α. Therefore, we obtain
i.e., . Since is a nested family with respect to (η, S), we also have
Since from (17), we obtain
which contradicts for α ∈ S with α < α*. Therefore, we have the desired strict inclusion.
To prove part (ii), by the definition of focal set, we have for all γ ∈ S. Therefore, for any α ∈ S, we have . We want to show . Suppose that . We are going to lead to a contradiction. Since sup S = α* and α* > α, there exists γ ∈ S such that γ > α. Since α* ∉ S, it follows that α < γ < α*. Therefore, we obtain
i.e., . The remaining proof can follow from the arguments of part (i) by changing the role of as M*. This completes the proof. ■
Theorem 4.9.Let S be a disjoin union of intervals in (0, 1] with sup S = α*, and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that the following conditions are satisfied:
is a solid and nested family with respect to (η, S);
when αn ↑ α for α < α*.
We have the following properties.
Suppose that α* ∈ S. Then, for any α ∈ S with α < α*,
if and only if
for αn ↑ α* with αn ∈ S and αn < α* for all n.
Suppose that α* ∉ S. Then, for any α ∈ S,
if and only if
for αn ↑ α* with αn ∈ S for all n.
Suppose that α* ∉ S, and that the family has a focal set M*. Then, for any α ∈ S,
if and only if
for αn ↑ α* with αn ∈ S for all n.
Proof. To prove part (i), the sufficiency follows from part (i) in Proposition 2 immediately. To prove the necessity, assume that for αn ↑ α* with αn ∈ S and αn < α* for all n. From part (i) of Proposition 4, we have the following inclusion
To prove another direction of inclusion, for any α ∈ S with α < α*, according to part (i) of Proposition 4, we define
We want to show
If for some β ∈ S with β > α and , then it means that for some β ∈ S with α* > β > α and ; that is to say, x ∈ Nβ for some β ∈ S with α < β < α*. Therefore, we obtain the inclusion
To prove another direction of inclusion, if y ∈ Nβ for some β ∈ S with α* > β > α, then for some β ∈ S with α* > β > α and , which also says that for some β ∈ S with β > α and . This shows the equality (22). From (21), it is easy to we see that, for αn ↑ α* with αn ∈ S and αn < α*, we have
Now, we are in a position to prove the following inclusion
For α ∈ S with α < α* and , suppose that and for all β ∈ S with α* > β > α. We shall lead to a contradiction. Since x ∈ Nα and by the hypothesis, it follows that . Using part (i) of Proposition 2, i.e., , we also have . Now, from (22), we obtain
which says that there exists β1 ∈ S with α* > β1 > α such that x ∈ Nβ1. Since by the hypothesis, we can similarly show that there exists β2 ∈ S with α* > β2 > β1 such that x ∈ Nβ2. Also, since by the hypothesis, there exists β3 ∈ S with α* > β3 > β2 such that x ∈ Nβ3. Continuing this process and argument, we can construct a strictly increasing sequence contained in the open interval (α, α*) such that x ∈ Nβn for all n, i.e., . We shall claim . Suppose that it is not true, i.e., . Then, we have by the second condition. Therefore, we obtain
which says that x ∈ Nβ* and . Using the previous arguments for the procedure of constructing the strictly increasing sequence, we can similarly show that there exists β° ∈ S with α* > β° > β* such that x ∈ Nβ°. This says that β° must be in the sequence, and that
which contradicts . Therefore, we must have , i.e., βn ↑ α* and , which also contradicts the assumption given in (23). Therefore, we conclude that or for some β ∈ S with α* > β > α, which proves the equality (18). Part (ii) can be realized from part (i) without considering .
To prove part (iii), the sufficiency follows from part (iii) of Proposition 2 immediately. To prove the necessity, by part (ii) of Proposition 4, we have the following inclusion
To prove another direction of inclusion, let for α ∈ S. Then Nα≠ ∅ for α ∈ S by part (ii) of Proposition 4. Now, we have
It is easy to see that, for αn ↑ α* with αn ∈ S for all n,
Now, we are in a position to prove the following inclusion
For α ∈ S and , suppose that and for all β ∈ S with β > α. We shall lead to a contradiction. Since by the hypothesis and by part (ii) of Proposition 2, using (24), we obtain
which says that there exists β1 ∈ S with β1 > α such that x ∈ Nβ1. Similarly, we can construct a strictly increasing sequence contained in the open interval (α, α*) such that x ∈ Nβn for all n. We shall claim . Suppose that it is not true, i.e., . Then, we have by the second condition. Therefore, we obtain
which says that x ∈ Nβ* and . Using the previous arguments for the procedure of constructing the strictly increasing sequence, we can similarly show that there exists β° ∈ S with α* > β° > β* such that x ∈ Nβ°. This says that β° must be in the sequence, and that
which contradicts . Therefore, we must have , i.e., βn ↑ α* and , which also contradicts the assumption given in (25). Therefore, we conclude that or for some β ∈ S with β > α, which proves the equalities (20). This completes the proof. ■
Generating fuzzy sets
In the sequel, we are going to construct a fuzzy set in U satisfying for each α ∈ S, where ζ is an increasing and bijective function on S. In particular, when ζ is taken to be an identity function, we have the equality .
Theorem 5.1.Let S be a subset of (0, 1] with sup S = α*, and let η be a function from S into (0, 1]. Let be a family of nonempty subsets of a universal set U such that is a solid and nested family with respect to (η, S). Let ζ be an increasing and bijective function on S.
Suppose that α* ∈ S, and that
We consider two cases for defining the fuzzy sets.
When , we define a fuzzy subset of U with membership function given by
When , we define a fuzzy subset of U with membership function given by
Then, we have the following properties:
and ;
for each α ∈ S; if η is injective, then
for each .
Suppose that α* ∉ S, and that
We consider two cases for defining the fuzzy sets.
When , we define a fuzzy subset of U with membership function given by for and α ∈ S.
When , we define a fuzzy subset of U with membership function given by
Then, we have the following properties:
and ;
for each α ∈ S; if η is injective, then
for each .
Suppose that α* ∉ S, that the family has a focal set M*, and that
We consider two cases for defining the fuzzy sets.
When , we define a fuzzy subset of U with membership function given by
When , we define a fuzzy subset of U with membership function given by
Then, we have the following properties:
and ;
and for each α ∈ S; if η is injective, then
for each .
Moreover, for parts (i)-(iii), we have for x ∈ U and for with
If U is endowed with a topology, then
Proof. From Proposition 3, we see that the membership functions and defined in parts (i)-(iii) are well-defined. Next, we want to show
for each α ∈ S. It suffices to show for each α ∈ S. We first claim that
where denotes the inverse image of the closed interval [ζ (α) , 1] and denotes the inverse image of singleton set {γ} for function . Given , we have . Let . Then, we have γ ≥ ζ (α) and , which says that . On the other hand, given , there exists with γ ≥ ζ (α) satisfying , which also says that . Therefore, it follows that , which proves the equality (18).
To prove part (i), since ζ is an increasing and bijective function on S, it follows that
and ζ (α) >0 for α ∈ S, the equality (18) can be rewritten as
We also see that if α* ∈ S then ζ (α*) = α*. Therefore, for α ∈ S with α < α*, we have
Now, for each α ∈ S with α < α*, we obtain
We also have
and
We can similarly obtain
which proves (30). If η is injective, then for by (6). Therefore, we can obtain . Part (ii) can be similarly obtained from part (i) without considering .
To prove part (iii), since ζ (α) >0 and , the equality (18) can be rewritten as
We also have
Now, for each α ∈ S, we have
We also have
Finally, we can obtain
We can similarly obtain
which proves (30). This completes the proof. ■
When S is taken to be a disjoin union of intervals in (0, 1], we can have the different sufficient conditions to guarantee the existence of fuzzy sets in U.
Theorem 5.2.Let S be a disjoin union of intervals in (0, 1] with sup S = α*, and let η be a function from S into (0, 1] with sup S = α*. Let be a family of nonempty subsets of a universal set U such that is a solid and nested family with respect to (η, S). Let ζ be an increasing and bijective function on S.
Suppose that α* ∈ S, and that
We consider two cases for defining the fuzzy sets.
When , we define a fuzzy subset of U with membership function given by
When , we define a fuzzy subset of U with membership function given by
Then, we have the following properties:
and ;
for each α ∈ S with α < α*; if η is injective, then
for each .
The interval ranges and of and , respectively, are given by
Suppose that α* ∉ S, and that
We consider two cases for defining the fuzzy sets.
When , we define a fuzzy subset of U with membership function given by for and α ∈ S.
When , we define a fuzzy subset of U with membership function given by
Then, we have the following properties:
and ;
for each α ∈ S; if η is injective, then
for each .
The interval ranges and of and are given by
Suppose that α* ∉ S, that the family has a focal set M*, and that
We consider two cases for defining the fuzzy sets.
When , we define a fuzzy subset of U with membership function given by
When , we define a fuzzy subset of U with membership function given by
Then, we have the following properties:
and ;
and for each α ∈ S; if η is injective, then
for each .
Moreover, for parts (i)-(iii), we have for x ∈ U and for with
If U is endowed with a topology, then
The interval ranges and of and are given by
Proof. To prove part (i), using the nestedness, we see that
Therefore, combining it with the assumption, we obtain
By Theorem 2* and Proposition 4, we see that the assumption of part (i) of Theorem 5 is satisfied. Therefore, the results follow from part (i) of Theorem 5 immediately. Part (ii) can be similarly obtained.
To prove part (iii), since M* is a focal set, it follows that for α ∈ S. This also says that
Therefore, combining it with the assumption, we obtain
The remaining proof follows from the above arguments. Finally, the interval ranges and can be realized immediately from (2). This completes the proof. ■
Example 5.3. Continued from Example 3, we can obtain
Therefore, according to part (iii) of Theorem 5, we can generate a fuzzy subset of with membership function given by
such that the following properties are satisfied.
The range of is given by .
For each α ∈ [0.2, 0.9), we have
We also have . For α ∈ [0.2, 0.9), the α-level set of is given by
The interval range of is .
Conclusions
A mechanical procedure has been proposed in this paper to generate a fuzzy set from an arbitrary family of subsets of a universal set U. This kind of generation is mainly based on the concepts of solid and nested family. The basic idea of solid family considers the sets in the family to be continuously varied. In other words, the cardinalities of the sets will be changed smoothly (continuously) rather than abruptly. Also, the idea of nested family means that the sets in the family will be shrunk gradually from the largest set. In general, an arbitrary family
of subsets of U is not necessarily nested in the sense of Mα ⊆ Mβ for β < α. However, we can always rearrange the original family to be a nested family
by designing a suitable function η : (0, 1] → (0, 1] such that for β < α.
The main purpose of this paper is to generate a fuzzy set in U such that the α-level set is identical to for each α ∈ S ⊂ [0, 1]. In this case, when η is an one-to-one function on S, we see the following families
are identical. In other words, we are going to generate a fuzzy set such that the original family is equal to the family of α-level sets of .
In real applications, suppose that the economic and engineering problems will be considered under fuzzy environment. Then, we shall consider the fuzzy data instead of real number data. However, we can just collect the real number data from the real world. In order to model the fuzzy data based on the real number data, this paper proposes a mechanical procedure to determine the fuzzy data by using the observed real number data to formulate the original family that can be used to generate a reasonable fuzzy data. This kind of mechanical procedure can avoid the bias of directly determining the fuzzy data raised by the subjectivity of decision makers.
References
1.
AlvarezD.A., On the Calculation of the Bounds of Probability of Events Using Infinite Random Sets, International Journal ofApproximate Reasoning43 (2006), 241–267.
2.
BaudritC., CousoI. and DuboisD., Joint Propagation of Probability and Possibility in Risk Analysis: Towards a Formal Framework, International Journal of Approximate Reasoning45 (2007), 82–105.
3.
DuboisD., PradeH. and SmetsP., A Definition of Subjective Possibility, International Journal of Approximate Reasoning48 (2008), 352–364.
4.
HerenciaJ.A., Graded Sets and Points: A Stratified Approach toFuzzy Sets and Points, Fuzzy Sets and Systems77 (1996), 191–202.
5.
NegoitaC.V. and RalescuD.A., Applications of Fuzzy Sets to Systems Analysis, Wiley, New York, (1975).
6.
RalescuD.A., A Generalization of the Representation Theorem, Fuzzy Sets and Systems51 (1992), 309–311.
7.
RoydenH.L., Real Analysis, 2nd, (1968).
8.
SaidiF.B. and JabalahA., From Fuzzy Sets to the Decompositions of Non-Rigid Sets, Fuzzy Sets and Systems158 (2007), 1751–1766.
9.
SaidiF.B. and JabalahA., Uniqueness in the Generalized Representation by Fuzzy Sets, Fuzzy Sets and Systems159(2008), 2176–2184.
10.
SaidiF.B. and JabalahA., Alternative Characterization for the Representation of Families of Sets by Fuzzy Sets, Information Sciences178 (2008), 2639–2647.
11.
ŠešeljaB., StojićD. and TepavčevićA., On Existence of P-Valued Fuzzy Sets with a Given Collection of Cuts, Fuzzy Sets and Systems161 (2010), 763–768.
12.
ŠešeljaB. and TepavčevićA., On a Representation of Posets by Fuzzy Sets, Fuzzy Sets and Systems98 (1998), 127–132.
13.
ŠešeljaB. and TepavčevićA., Completion of Ordered Structures by Cuts of Fuzzy Sets: An Overview, Fuzzy Sets and Systems136 (2003), 1–19.
14.
ŠešeljaB. and TepavčevićA., Representing Ordered Structures by Fuzzy Sets: An Overview, Fuzzy Sets and Systems136 (2003), 21–39.
15.
WuH.-C., Existence and Uniqueness for the Construction of Fuzzy Sets from a Solidly Nested Family, Fuzzy Optimization and Decision Making14 (2015), 1–41.