`Advances in Fuzzy SystemsVolume 2009 (2009), Article ID 586507, 6 pageshttp://dx.doi.org/10.1155/2009/586507`
Research Article

## On Fuzzy Soft Sets

1Centre for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, 60800 Multan, Pakistan
2Department of Mathematics, King Abdul Aziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia

Received 17 November 2008; Revised 28 February 2009; Accepted 5 June 2009

#### Abstract

We further contribute to the properties of fuzzy soft sets as defined and studied in the work of Maji et al. ( 2001), Roy and Maji (2007), and Yang et al. (2007) and support them with examples and counterexamples. We improve Proposition 3.3 by Maji et al., (2001). Finally we define arbitrary fuzzy soft union and fuzzy soft intersection and prove DeMorgan Inclusions and DeMorgan Laws in Fuzzy Soft Set Theory.

#### 1. Introduction

In 1999, Molodtsov [1] introduced soft sets and established the fundamental results of the new theory. It is a general mathematical tool for dealing with objects which have been defined using a very loose and hence very general set of characteristics. A soft set is a collection of approximate descriptions of an object. Each approximate description has two parts: a predicate and an approximate value set. In classical mathematics, we construct a mathematical model of an object and define the notion of the exact solution of this model. Usually the mathematical model is too complicated and we cannot find the exact solution. So, in the second step, we introduce the notion of approximate solution and calculate that solution. In the Soft Set Theory (SST), we have the opposite approach to this problem. The initial description of the object has an approximate nature, and we do not need to introduce the notion of exact solution. The absence of any restrictions on the approximate description in SST makes this theory very convenient and easily applicable in practice. We can use any parametrization we prefer with the help of words and sentences, real numbers, functions, mappings, and so on. It means that the problem of setting the membership function or any similar problem does not arise in SST. In [1], besides demarcating the basic contours of SST, Molodtsov also showed how SST is free from parametrization inadequacy syndrom of Fuzzy Set Theory (FST), Rough Set Theory (RST), Probability Theory, and Game Theory. SST is a very general framework. Many of the established paradigms appear as special cases of SST.

Applications of Soft Set Theory in other disciplines and real life problems are now catching momentum. Molodtsov [1] successfully applied the soft theory into several directions, such as smoothness of functions, game theory, operations research, Riemann integration, Perron integration, theory of probability, theory of measurement, and so on. Maji et al. [2] gave first practical application of soft sets in decision making problems. It is based on the notion of knowledge reduction in rough set theory. Maji et al. [3] defined and studied several basic notions of soft set theory in 2003. In 2005, Pei and Miao [4] and Chen et al. [5] improved the work of Maji et al. [2, 3].

Many researchers have contributed towards the fuzzification of the notion of soft set, for example, [68]. In this paper, we present some more properties of fuzzy soft union and fuzzy soft intersection as defined by Maji et al. [6], and support them by examples and counterexamples. We also revise Maji's definition of fuzzy soft intersection and improve [6, Proposition  3.3]. Finally we define arbitrary fuzzy soft union and intersection and prove DeMorgan Inclusions and DeMorgan Laws in Fuzzy Soft Set Theory.

#### 2. Basic Definitions Revisited

Throughout this paper, refers to an initial universe, is a set of parameters, , and is the set of all fuzzy sets of .

Maji et al. defined a fuzzy soft set in the following manner.

Definition 1 (see [6]). A pair is called a fuzzy soft set over where is a mapping from

Definition 2. Let be a universe and a set of attributes. Then the pair denotes the collection of all fuzzy soft sets on with attributes from and is called a fuzzy soft class.

Definition 3 (see [6]). For two fuzzy soft sets and in a fuzzy soft class we say that is a fuzzy soft subset of , if(i)(ii)For all and is written as .

Definition 4 (see [6]). The complement of a fuzzy soft set is denoted by and is defined by where is a mapping given by

Union of two fuzzy soft sets is defined by Maji et al. [6] as follows.

Definition 5 (see [6]). Union of two fuzzy soft sets and in a soft class is a fuzzy soft set where and and is written as

For a few basic properties of fuzzy soft union, we refer to [6, Proposition  3.2]. Moreover, we have some more properties.

Proposition 1. Let and be fuzzy soft sets in . Then one has the following:(1)(2)(3) and (4)

Maji et al. defined the intersection of two fuzzy soft sets as follows.

Definition 6 (see [6]). Intersection of two fuzzy soft sets and in a fuzzy soft class is a fuzzy soft set where and (as both are same fuzzy set), and is written as We point out that generally and may not be identical. Moreover, must be nonempty to avoid the degenerate case. Thus we revise Definition 6 as follows.

Definition 7. Let and be two fuzzy soft sets in a fuzzy soft class with . Then intersection of two fuzzy soft sets and is a fuzzy soft set where and . We write .

The following example explains Definition 7.

Example 1. Suppose that Consider the soft set which describes the “cost of the houses” and the soft set which describes the “attractiveness of the houses.” Thus we take as and suppose that Then where Now if we use the definition of Maji et al., we get two different values for , that is, Therefore, by using [6, Definition  7], ceases to be a function as and are not identical and so this definition is not applicable. However by using Definition 7, we have For some basic properties of fuzzy soft intersection, we refer to [6, Proposition  3.2]. Moreover, we have some more properties:

Proposition 2. Let , and be fuzzy soft sets in a fuzzy soft class Then one has following:(1)(2)(3) and (4)(5)

In [6, Definition  3.6], it is shown that The following example shows that these do not hold in general.

Example 2. Let be a fuzzy soft class, where choose , and Calculations give

#### 3. DeMorgan Inclusions and Laws

Maji et al. proved the following Proposition.

Proposition 3 (see [6, Proposition  3.3]). It holds that(1)(2)

The following example shows that (14) and (16) of Proposition 3 do not hold.

Example 3. Let and and fuzzy soft sets in a fuzzy soft class given as Then calculations show that

However, we partially establish identities (14) and (16) of [6, Proposition  3.3] as follows.

Theorem 1. For fuzzy soft sets and in one has the following:(1),(2).

Proof. () Suppose that Therefore, by  [6, Proposition  2.1]. For Now consider where From (14) and (16), we get ().
() Consider (say), where On the other hand Now for Clearly, hence is the result.

In general, these inclusions cannot be reversed, as is evident from Example 3.

It is well known that DeMorgan Laws interrelate union and intersection via complements. Here first, we prove the following DeMorgan Inclusions.

Theorem 2. For soft sets and of a soft class one has the following.(1)(2)

Proof. ()Consider where
Again suppose that Therefore,
by  [6, Proposition  2.1]. For we have For we have From (22) and (24), we get ().
() Suppose that where Therefore, by  [6,  Proposition  2.1]. Now take then Now consider For we have From (28) and (30), we get ().

The above DeMorgan Inclusions are, in general, irreversible, as is shown in the following.

Example 4. Let and and fuzzy soft sets in a fuzzy soft class given as Then calculations show that

It is natural to ask when the DeMorgan Inclusions in Theorem 2 beome DeMorgan Laws. This is answered in the following.

Theorem 3. For the fuzzy soft sets and in a fuzzy soft class one has the following: (1)(2)

Proof. () Consider where for all Again suppose that Therefore, where For all we have From (34) and (37), we obtain ().
() Similar to ().

#### 4. Generalized DeMorgan Inclusions and Laws

First, we define arbitrary union and arbitrary intersection of a family of fuzzy soft sets in a fuzzy soft class as follows.

Definition 8. Let be a family of fuzzy soft sets in a fuzzy soft class Then the union of fuzzy soft sets in is a fuzzy soft set and where The union of three fuzzy soft sets is illustrated as under follows.

Example 5. Let be a fuzzy soft class and , and , fuzzy soft sets given as Calculations give

Now, we generalize Definition 7 as follows.

Definition 9. Let be a family of fuzzy soft sets in a fuzzy soft class with . Then the intersection of fuzzy soft sets in is a fuzzy soft set where and We may now generalize Theorem 2.

Theorem 4. Let be a family of fuzzy soft sets in a fuzzy soft class Then one has the following: (1)(2)

Finally, Theorem 3 may also be generalized.

Theorem 5. Let be a family of fuzzy soft sets in a fuzzy soft class Then one has the following: (1)(2)

#### 5. Conclusion

The soft set theory proposed by Molodtsov offers a general mathematical tool for dealing with uncertain and vague objects. The researchers have contributed towards the fuzzification of Soft Set Theory. This paper contributes some more properties of fuzzy soft union and fuzzy soft intersection as defined and studied in [68] and supports them with examples and counterexamples. Arbitrary fuzzy soft union, arbitrary fuzzy soft intersection have been defined. DeMorgan Inclusions and DeMorgan Laws have also been given for an arbitrary collection of fuzzy soft sets. It is hoped that our findings will help enhancing this study on fuzzy soft sets for the researchers.

#### Acknowledgment

The authors gratefully acknowledge the comments of the referee which led to the improvment of this paper.

#### References

1. D. Molodtsov, “Soft set theory—first results,” Computers & Mathematics with Applications, vol. 37, no. 4-5, pp. 19–31, 1999.
2. P. K. Maji, A. R. Roy, and R. Biswas, “An application of soft sets in a decision making problem,” Computers & Mathematics with Applications, vol. 44, no. 8-9, pp. 1077–1083, 2002.
3. P. K. Maji, R. Biswas, and A. R. Roy, “Soft set theory,” Computers & Mathematics with Applications, vol. 45, no. 4-5, pp. 555–562, 2003.
4. D. Pei and D. Miao, “From soft sets to information systems,” in Proceedings of the IEEE International Conference on Granular Computing, vol. 2, pp. 617–621, 2005.
5. D. Chen, E. C. C. Tsang, D. S. Yeung, and X. Wang, “The parameterization reduction of soft sets and its applications,” Computers & Mathematics with Applications, vol. 49, no. 5-6, pp. 757–763, 2005.
6. P. K. Maji, R. Biswas, and A. R. Roy, “Fuzzy soft sets,” Journal of Fuzzy Mathematics, vol. 9, no. 3, pp. 589–602, 2001.
7. A. R. Roy and P. K. Maji, “A fuzzy soft set theoretic approach to decision making problems,” Journal of Computational and Applied Mathematics, vol. 203, no. 2, pp. 412–418, 2007.
8. X. Yang, D. Yu, J. Yang, and C. Wu, “Generalization of soft set theory: from crisp to fuzzy case,” in Proceedings of the 2nd International Conference of Fuzzy Information and Engineering (ICFIE '07), vol. 40 of Advances in Soft Computing, pp. 345–354, 2007.
9. T. Y. Lin, “A set theory for soft computing a unified view of fuzzy sets via neighborhoods,” in Proceedings of the IEEE International Conference on Fuzzy Systems, vol. 2, pp. 1140–1146, New Orleans, La, USA, September 1996.
10. A. Rosenfeld, “Fuzzy groups,” Journal of Mathematical Analysis and Applications, vol. 35, pp. 512–517, 1971.
11. Z. Xiao, L. Chen, B. Zhong, and S. Ye, “Recognition for soft information based on the theory of soft sets,” in Proceedings of the International Conference on Services Systems and Services Management (ICSSSM '05), vol. 2, pp. 1104–1106, Chongquing, China, June 2005.