Abstract
This paper attempts to study the properties of Hsueh fuzzy matroids. Two equivalent descriptions of the fuzzy augmentation property are given and fuzzy submatroids are introduced. Moreover, the existence of fuzzy bases for Hsueh fuzzy matroids is proved. Based on the properties of fuzzy bases, fuzzy base axioms for Hsueh fuzzy matroids are obtained. Additionally, an application of fuzzy base axioms is presented.
Introduction
The concept of matroid was coined by Whitney in 1935 to study an abstract theory of independence. Matroids also play an important role in combinatorial optimization. It is well-known that for an independent set systems of a finite set, the problem of finding a maximum weight set can be solved by a greedy algorithm if and only if the system is a matroid. Generalizations of matroids interest many scholars, and when we generalize matroids and related optimization problems to fuzzy setting, there usually exist two natural ways. One is using interval weights or something like to instead of precise values in a matroid-based optimization problems; the other is to fuzzify matroids.
Goetschel and Voxman [1] first introduced fuzzy matroids (named G-V fuzzy matroids) in 1988. The greedy algorithm and other related topics concerning G-V fuzzy matroids were discussed subsequently (see [2, 3]). Note if a fuzzy matroid on X is to be defined as a pair (X, Ψ), where Ψ is a nonempty family of fuzzy subsets of X satisfying some conditions, then this fuzzy matroid in fact is some structure on [0, 1] X . Since [0, 1] X is an infinite set, fuzzy matroids on X should be members of the class of infinite matroids. Based on this idea, Hsueh [4] in 1993 proposed his fuzzy matroids. [6] compares Hsueh fuzzy matroids with other four kinds of fuzzy matroids and studies fuzzy bases of Hsueh fuzzy matroids. As a continuation of these results, we studies axioms for fuzzy bases of Hsueh fuzzy matroids in this paper. When generalizing some axiom system of matroids to fuzzy setting, the corresponding axiom system usually becomes complicated and only determines some very special kind of fuzzy matroids (see, e.g. [5, 7, 10, 5, 7, 10]), while the main result in this paper shows that the fuzzy analog of base axioms for crisp matroids can determine general Hsueh fuzzy matroids. In addition, properties of fuzzy matroids are studied and H fuzzy matroids on two-element sets are characterized.
The arrangement of this paper is as follows. In the next section, we present some fundamental results which will be needed in this paper. Section 3 studies properties of H fuzzy matroids. we generalize the concept of submatroid to fuzzy setting and then two equivalent descriptions of H fuzzy matroids are given. After these preliminaries, fuzzy base axioms for H fuzzy matroids are obtained in Section Hsueh. Finally, a concluding remark is given in the last section.
Preliminaries
Now we present some fundamental notions and results on matroids, fuzzy sets and fuzzy matroids.
(I1) If and Z ⊆ Y, then (hereditary property).(I2) If and |Y| < |Z| (where |Y| denotes the cardinality of Y), then there exists such that Y ⊂ W ⊆ Y ∪ Z (augmentation property).
Let M=(X, ) be a matroid. The members of are the independent sets of M, maximal independent sets are bases of M. Matroids have many equivalent descriptions. For a more detailed discussion of axiom systems of matroids, see [9].
Let X be a finite set. A fuzzy set μ on X is a mapping μ : X ⟶ [0, 1]. We use [a] to denote the fuzzy set taking constant value a on X (a∈ [0, 1]) and χ Y the characteristic function of Y (Y ⊆ X) . The fuzzy set [a] ∧ χ {x} (a > 0) (usually denoted by x a ) is called a fuzzy point. We denote the family of all fuzzy sets on X by [0, 1] X , and denote the set of all fuzzy points on X by J ([0, 1] X ). For any μ, ν ∈ [0, 1] X , we write μ ≤ ν if μ (x) ≤ ν (x) for each x ∈ X, and μ < ν if μ ≤ ν and μ ≠ ν. μ ∨ ν and μ ∧ ν are fuzzy sets which satisfy (μ ∨ ν) (x) = max {μ (x) , ν (x)} and (μ ∧ ν) (x) = min {μ (x) , ν (x)} (∀ x ∈ X). For each μ ∈ [0, 1] X , the non-negative real number ∑x∈X μ (x) (written as |μ|) is called the cardinality of μ; we write supp μ = {x ∈ X ∣ μ (x) >0}, m (μ)= min{μ (x)∣ x ∈ supp μ}, μ [a] = {x ∈ X ∣ μ (x) ≥ a} (where 0 ≤ a ≤ 1),, R + (μ) = {μ (x) ∣ μ (x) >0, x ∈ X} and ↓μ = {ν ∣ μ ≥ ν, ν ∈ [0, 1] X }.
Goetschel and Voxman generalized Definition 2.1 to fuzzy setting and introduced the concept of fuzzy matroids as follows.
(FI1) If μ ∈ Ψ, ν ∈ [0, 1]
X
and ν < μ, then ν ∈ Ψ.(GVFI2) If μ, ν ∈ Ψ and 0 < |supp μ| < |supp ν|, then there exists ω ∈ Ψ such that μ < ω ≤ μ ∨ ν . m (ω) ≥ min {m (μ) , m (ν)} .
Unlike Goetschel and Voxman’ definition, Hsueh subsequently defined a fuzzy matroid as follows.
(FI1) If μ ∈ Ψ, ν ∈ [0, 1] X and ν < μ, then ν ∈ Ψ.(HFI2) If μ, ν ∈ Ψ and |μ| < |ν|, then there exists an element x ∈ X and a fuzzy subset ω ∈ Ψ such that ω (y) = μ (y) (∀ y ∈ X - {x}) and μ (x) < ω (x) ≤ ν (x) . (FI3) Let μ be a fuzzy subset of X. If {ν ∈ [0, 1] X ∣ ν < μ} ⊆ Ψ, then μ ∈ Ψ.
Then we call X, Ψ) an H fuzzy matroid.
(2) G-V fuzzy matroids and H fuzzy matroids are all special kinds of fuzzy independent set systems. That is to say, the difference between G-V fuzzy matroids and H fuzzy matroids just lies in using different ways to fuzzify (I2).
Properties of H fuzzy matroids
In this section, we begin with a result corresponding to submatroids in crisp matroids.
(2) Fuzzy bases of the H fuzzy matroids (X, Ψ) and (X, Ψ| μ ) in Example 3.2 have the same cardinality respectively. Actually, all fuzzy bases of an H fuzzy matroid have the same cardinality and we shall prove this result in the following. For a G-V fuzzy matroid (X, Ψ), fuzzy bases need not exist and even if (X, Ψ) has fuzzy bases and its fuzzy bases have the same cardinality, (X, Ψ| μ ) does not necessarily have fuzzy bases with the same cardinality (see Example 3.4).
The following result gives an equivalent description of (HFI2).
(HFI2 ∗) If μ, ν ∈ Ψ and |μ| < |ν|, then there exists ω ∈ Ψ such that μ < ω ≤ μ ∨ ν .
By (FI1), ω x 0 ∈ Ψ, and then (HFI2) holds obviously.
b μ = sup{a ∈ [0, 1] ∣ μ ∨ (x k+1) a ∈ Ψ}
If b μ = 0, then μ is obviously a fuzzy base of (X, Ψ). Thus we consider the case b μ > 0 in the following. Let
b ∗ = sup{b ν ∣ ν is a fuzzy base of (X k , Ψ| χ X k )}.
Again, let
Ψ k = {ν ∈ [0, 1] X k ∣ ν ∨ (x k+1) b ∗ ∈ Ψ}
Note (x k+1) b ∗ ∈ Ψ, thus [0] ∈ Ψ k . That is Ψ k ≠ ∅.
We can routinely check that Ψ k satisfies (FI1),(FI2) and (FI3), thus (X k , Ψ k ) is an H fuzzy matroid. Use the induction hypothesis again, there is a fuzzy base of (X k , Ψ k ). Note Ψ k ⊆ Ψ| χ X k , by Proposition 3.5, we can easily verify that .
We assume and derive a contradiction. Let c = min. By the definition of b ∗, we can find a fuzzy base μ ★ of (X k , Ψ| χ X k ) such that b ∗ - b μ ★ < c/4 . Let d = b μ ★ - c/4, then μ ★ ∨ (x k+1) d ∈ Ψ holds from the definition of b μ ★ . Note μ ★ and μ are fuzzy bases of (X k , Ψ| χ X k ), Proposition 3.5 can easily imply |μ ★| = |μ|. Because
we have ω ∈ Ψ satisfying . Obviously, ω (x k+1) = b ∗, thus there exists x 1 ∈ X k such that . Therefore, ω ∧ χ X k ∈ Ψ and , contrary to the fact that is a fuzzy base of (X k , Ψ k ).
Finally, we show that is a fuzzy base of (X, Ψ) and our lemma is proved. Since ∈Ψ, we need only to show that for any υ ∈ [0, 1] X and holds. Two cases are considered in the following.
0 = a
0 < a
1 < . . . < a
n
= 1 (such a sequence will be denoted by 〈a
0, a
1, . . . , a
n
〉). If a
i
< a < b < a
i+1 (0 ≤ i ≤ n - 1), then . If a
i
< a < a
i+1 < b < a
i+2 (0 ≤ i ≤ n - 2), then . If 0 < a < b ≤ 1, then .
A fuzzy independent set system (X, Ψ) with a fundamental sequence 〈a
0, a
1, . . . , a
n
〉 is said to be closed if whenever a
i
< a < a
i+1 (0 ≤ i ≤ n - 1), then
ai +1
.
(2) As stated above, a G-V fuzzy matroid need not have fuzzy bases. The condition “closed" is proposed to ensure the existence of fuzzy bases for G-V fuzzy matroids (see Theorem 1.10 of [2]). The fuzzy independent set system with the property (FI2) is closed, but does not satisfies (FI3). Conversely, we assert here that an H fuzzy matroid is a closed fuzzy independent set system. The relations of “closed", (FI3) and other conditions concerning the existence of fuzzy bases for fuzzy independent set systems will be discussed thoroughly in our future work.
The following result concerns with the level structure of H fuzzy matroids.
|χ A ∧ [b] | < |x a | = a.
It follows from Proposition 3.5 that there existsω ∈ Ψ such that
(χ A ∧ [b]) < ω ≤ (χ A ∧ [b]) ∨ x a .
Note ω [m(ω)] = A ∪ {x}, thus m (ω) . Since 0 < m (ω) < a ≤ a 1, it holds from Remark 3.8 that m (ω) a . Thus we have a , it contradicts the fact that A is a maximal element of a .
At last of this section, we give another equivalent description of (HFI2).
(HFI2 ∗∗) For every μ ∈ [0, 1] X , all maximal fuzzy independent sets of μ (i.e., elements in Max{ν ∈ Ψ|ν ≤ μ}) have the same cardinality.
Then ω ∗ ≤ ω implies ω ∗ ∈ Ψ, and so (HFI2) holds.
Proposition 3.10 implies
Fuzzy base axioms of H fuzzy matroids
After some preliminaries of Section 3, we come to the major goal of this paper, a theorem that characterize H fuzzy matroids by means of fuzzy bases.
(FB1) All the members of Φ have the same cardinality.
(FB2) If μ, ν ∈ Φ and ω ∈ [0, 1] X satisfying μ ∧ ν < ω < ν, then there is ω 1 ∈ [0, 1] X satisfying μ ∧ ν < ω 1 ≤ μ such that ω ∨ ω 1 ∈ Φ.
X μν = {x ∈ X|μ (x) = ν (x)} ,
It is easy to check that μ ≠ ν, thus and Since μ ∧ ν < ω < ν, it holds that ω (x) = ν (x) for And ω < ν implies that there is such that μ (x
0) < ω (x
0) . Define ω
∗ ∈ [0, 1]
X
as follows:
Obviously, μ < ω ∗ and ω < ω ∗ . Note that μ ∈ Φ and ω is a fuzzy independent set, it follows from Proposition 3.10 that there exists μ ∗ ∈ Φ such that ω ≤ μ ∗ ≤ ω ∗ . Let
We can check that and ω 1 (x) = thus μ ∗ = ω ∨ ω 1 ∈ Φ . Finally, μ ∧ ν < ω 1 ≤ μ can be easily verified, as desired.
Conversely, suppose that Φ ⊆ [0, 1] X satisfies (FB1) and (FB2), we shall prove that Φ is the set of fuzzy bases of an H fuzzy matroid on [0, 1] X . Let ↓Φ = {μ ∈ [0, 1] X | there exists ω μ ∈ Φ such that μ ≤ ω μ } . By (FB1), we have Max↓Φ = Φ . Now we need only to show that (X, ↓ Φ) is an H fuzzy matroid. Since (FI1) holds trivially for (X, ↓ Φ), we shall show that (X, ↓ Φ) has the property of (HFI2 ∗) in the following, and then by Proposition 3.5, we finish the proof.
Suppose μ, ν ∈ ↓ Φ and |μ| < |ν| . By the definition of ↓Φ, we can choose ω
μ
∈ Φ such that μ < ω
μ
. If there is such that ω
μ
(x
0) > μ (x
0), then define
Obviously, , thus . It is easy to check that satisfies as desired. Now we assume that ω
μ
(x) = μ (x) < ν (x) for all . Choose ω
ν
∈ Φ such that ω
ν
≥ ν, and then for , ω
μ
< ω
ν
holds obviously. If for every , we have μ (x) ≤ ω
ν
(x), then define
Then implies , and it follows from the definition of that as desired. Now we consider the case that there exists such that ν (y
0)≤ ω
ν
(y
0) < μ (y
0) . Obviously, , so For every , we define as follows:
Observe that , thus (FB2) implies that there exists with such that (∀n ∈ {1, 2, 3, . . .}). Let and the following properties are satisfied trivially:
ω ν (x) ≥ ω n (x) ≥ μ (x) = ω μ (x), if ;
ω ν (x) < ω n (x) < μ (x) , if
ω ν (x) ≥ ω n (x) ≥ μ (x), if ;
ω n (x) = μ (x), if x ∈ X μω ν .
Note that the above four sets (i.e., and X μω ν ) are pairwise disjoint and their union is X.
Since is a sequence of points of the compact set Φ, has a limit point which belongs to Φ and we denote the limit point by ω° . When , it can be easily verified that ω° (x) ≥ μ (x). Moreover, ω° (x) = μ (x) holds apparently when x ∈ X μω ν . For every , we have
so it follows that ω° (x) = μ (x) .
We now assert that there exists satisfying ω° (z 0) > μ (z 0). To prove this assertion, we assume that ω° (x) = μ (x) for all and derive a contradiction. In the following, we consider some inequalities concerning cardinalities of fuzzy sets. By the relation of ω° and μ preceding discussed, we have
+
+∑x∈Y (ω° (x) - μ (x)) +∑x∈X μω ν (ω° (x) - μ (x))
=∑x∈Y (ω° (x) - μ (x))
≤∑x∈Y (ω ν (x) - μ (x)) ,
where .
Since |μ| < |ν|, it holds that
That is
Note that
and
∑x∈X μω ν (ω ν (x) - μ (x)) =0 .
Thus, we have
+ +∑x∈Y (ω ν (x) - μ (x))
+∑x∈X μω ν (ω ν (x) - μ (x))
>∑x∈Y (ω ν (x) - μ (x))
≥|ω°| - |μ|,
contrary to the fact that all the members of Φ have the same cardinality.
Finally, we define
Then ω < ω° implies ω ∈ ↓ Φ, and it follow from the definition of ω that μ < ω ≤ ν ∨ μ, this finishes the proof.
Finally, we show a simple application of Theorem 4.1.
Conclusion
In general, when we generalize axiom systems of crisp matroids to fuzzy setting, two problems may arise. One is that the system of fuzzy analogs of crisp axioms does not determine fuzzy matroids. That is to say, we need add additional conditions to systems of fuzzification of crisp axioms. Another problem is that complicated axiom systems often suit very special kinds of fuzzy matroids. Theorem 4.1 gives a group of two axioms by which an H fuzzy matroid can be determined. The two axioms correspond nicely to base axioms of crisp matroids and contain no extra conditions. More importantly, our result holds for arbitrary H fuzzy matroids.
Acknowledgments
The authors would like to thank very sincerely Prof. Tofigh Allahviranloo and the unknown reviewers for their valuable comments and helpful suggestions. This work is supported by the National Natural Science Foundation of China (No. 61202178) and the Fundamental Research Funds for the Central Universities (No. JB150709).
