Hindawi Publishing Corporation
Advances in Fuzzy Systems
Volume 2009, Article ID 586507, 6 pages
doi:10.1155/2009/586507
Research Article
On Fuzzy Soft Sets
B. Ahmad1, 2 and Athar Kharal1
1 Centre
for Advanced Studies in Pure and Applied Mathematics, Bahauddin Zakariya University, 60800 Multan, Pakistan
of Mathematics, King Abdul Aziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia
2 Department
Correspondence should be addressed to Athar Kharal, atharkharal@gmail.com
Received 17 November 2008; Revised 28 February 2009; Accepted 5 June 2009
Recommended by Yasar Becerikli
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.
Copyright © 2009 B. Ahmad and A. Kharal. This is an open access article distributed under the Creative Commons Attribution
License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly
cited.
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, [6–8]. 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, X refers to an initial universe, E is a
set of parameters, Σ, Ω ⊆ E, and P(X)
is the set of all fuzzy
sets of X.
2
Advances in Fuzzy Systems
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 X, where Λ : Σ → P(X)
is a mapping
from Σ into P(X).
Definition 2. Let X be a universe and E a set of attributes.
Then the pair (X,
E) denotes the collection of all fuzzy soft
sets on X with attributes from E and is called a fuzzy soft
class.
Definition 3 (see [6]). For two fuzzy soft sets (Λ, Σ) and
(∆, Ω) in a fuzzy soft class (X,
E), we say that (Λ, Σ) is a fuzzy
soft subset of (∆, Ω), if
set (Θ, Ξ), where Ξ = Σ ∩ Ω, and for all ε ∈ Ξ, Θ(ε) =
Λ(ε) or ∆(ε) (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 (X,
E) with Σ ∩ Ω =
/ φ. Then intersection of
two fuzzy soft sets (Λ, Σ) and (∆, Ω) is a fuzzy soft set (Θ, Ξ),
where Ξ = Σ ∩ Ω, and for all ε ∈ Ξ, Θ(ε) = Λ(ε) ∧ ∆(ε). We
write (Λ, Σ) (∆, Ω) = (Θ, Ξ).
The following example explains Definition 7.
Example 1. Suppose that
(i) Σ ⊆ Ω,
(ii) For all ε ∈ Σ, Λ(ε) ≤ ∆(ε),
X = h, i, j, k ,
(∆, Ω).
and is written as (Λ, Σ)⊆
E = very costly, costly, beautiful,
Definition 4 (see [6]). The complement of a fuzzy soft set
(Λ, Σ) is denoted by (Λ, Σ)c and is defined by (Λ, Σ)c =
(Λc , ⌉Σ), where Λc :⌉Σ → P(X)
is a mapping given by
Λc (σ) = (Λ(¬σ))c , for all σ ⌉ ∈ Σ.
Union of two fuzzy soft sets is defined by Maji et al. [6]
as follows.
in the green surroundings, cheap .
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 Σ, ∆ ⊆ E as
Σ = very costly, costly, cheap ,
∆ = beautiful, in the green surroundings, cheap .
Definition 5 (see [6]). Union of two fuzzy soft sets (Λ, Σ) and
(∆, Ω) in a soft class (X, E) is a fuzzy soft set (Θ, Ξ), where
Ξ = Σ ∪ Ω, and for all ε ∈ Ξ,
⎧
⎪
Λ(ε),
⎪
⎪
⎪
⎨
if ε ∈ Σ − Ω,
Θ(ε) = ⎪∆(ε),
⎪
⎪
⎪
⎩Λ(ε) ∨ ∆(ε),
if ε ∈ Ω − Σ,
(3)
and suppose that
Λ very costly = h0.3 , i0.4 , j0.1 , k0.8 ,
Λ costly = h0.5 , i0.2 , j0.7 , k1.0 ,
(1)
if ε ∈ Σ ∩ Ω,
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 (X,
E). Then one has the following:
(2)
(1) (Λ, Σ) (∆, Ω) = (∆, Ω) (Λ, Σ),
(2) (Λ, Σ) ((∆, Ω) (Θ, Ξ)) = ((Λ, Σ) (∆, Ω)) (Θ, Ξ),
(Λ, Σ) (∆, Ω) and (∆, Ω)⊆
(Λ, Σ) (∆, Ω),
(3) (Λ, Σ)⊆
(∆, Ω) ⇒ (Λ, Σ) (∆, Ω) = (∆, Ω),
(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 (X,
E) is a fuzzy soft
Λ cheap = h0.3 , i0.1 , j0.8 , k0.9
∆(beautiful) = h0.4 , i0.7 , j0.2 , k0.1 ,
(4)
∆ in the green surroundings = h0.9 , i0.3 , j0.4 , k0.6 ,
∆ cheap = h0.5 , i0.6 , j0.2 , k0.5 .
Then (Λ, Σ) (∆, Ω) = (Θ, Ξ) where Ξ = Σ ∩ Ω = {cheap}.
Now if we use the definition of Maji et al., we get two different
values for Θ(cheap), that is,
Θ cheap = Λ cheap
= h0.3 , i0.1 , j0.8 , k0.9
=
/ h0.5 , i0.6 , j0.2 , k0.5
(5)
= ∆ cheap .
Therefore, by using [6, Definition 7], Θ ceases to be a
function as Λ(cheap) and ∆(cheap) are not identical and
so this definition is not applicable. However by using
Definition 7, we have
Θ cheap = Λ cheap ∧ ∆ cheap = h0.3 , i0.1 , j0.2 , k0.5 .
(6)
Advances in Fuzzy Systems
3
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 (X,
E). Then one has following:
Then calculations show that
c
(Λ, Σ) (∆, Ω)
¬e3 = {a0.6 , b0.4 , c0.3 },
¬e4 = {a0.3 , b0.2 , c0 }}
(1) (Λ, Σ) (Λ, Σ) = (Λ, Σ),
(2) (Λ, Σ) (∆, Ω) = (∆, Ω) (Λ, Σ),
= {¬e2 = {a0.8 , b0.8 , c0.3 } ,
=
/ {¬e2 = {a0.8 , b0.8 , c0.3 },
¬e3 = {a0.6 , b0.4 , c0.3 },
(Λ, Σ) and (Λ, Σ) (∆, Ω)⊆
(∆, Ω),
(3) (Λ, Σ) (∆, Ω)⊆
(∆, Ω) ⇒ (Λ, Σ) (∆, Ω) = (Λ, Σ),
(4) (Λ, Σ)⊆
(5) ((Λ, Σ) (∆, Ω)) (Θ, Ξ) = (Λ, Σ) ((∆, Ω) (Θ, Ξ)).
In [6, Definition 3.6], it is shown that
c = Φ,
Σ
Φc = Σ.
(7)
¬e4 = {a0.6 , b0.7 , c0.4 }}
c
(Λ, Σ) (∆, Ω)
X = {a, b, c},
E = {e 1 , e 2 , e 3 , e 4 } ,
(8)
(9)
Φ = {e1 = {a0 , b0 , c0 }, e3 = {a0 , b0 , c0 }}.
(∆, Ω)c .
However, we partially establish identities (14) and (16) of
[6, Proposition 3.3] as follows.
c
(Λ, Σ)c (∆, Ω)c ,
(1) [(Λ, Σ) (∆, Ω)] ⊆
c
Proof. (1) Suppose that (Λ, Σ) (∆, Ω) = (Θ, Σ ∪ Ω).
Therefore,
Φc = {¬e1 = {a1 , b1 , c1 }, ¬e3 = {a1 , b1 , c1 }}
c = {¬e1 = {a0 , b0 , c0 }, ¬e3 = {a0 , b0 , c0 }}
Σ
c
= (Λ, Σ)
[(Λ, Σ) (∆, Ω)] .
(2) (Λ, Σ)c (∆, Ω)c ⊆
Calculations give
=
/ {e1 = {a1 , b1 , c1 }, e3 = {a1 , b1 , c1 }} = Σ,
= {¬e4 = {a0.6 , b0.7 , c0.4 }}
Theorem 1. For fuzzy soft sets (Λ, Σ) and (∆, Ω) in (X,
E), one
has the following:
choose Σ = {e1 , e3 }, and
= {e1 = {a1 , b1 , c1 }, e3 = {a1 , b1 , c1 }}
Σ
(∆, Ω)c ,
=
/ {¬e4 = {a0.3 , b0.2 , c0 }}
The following example shows that these do not hold in
general.
Example 2. Let (X,
E) be a fuzzy soft class, where
c
= (Λ, Σ)
(12)
(10)
c
(Λ, Σ) (∆, Ω)
= (Θ, Σ ∪ Ω)
c
= ( Θc , ⌉(Σ ∪ Ω)) = ( Θc , ⌉ Σ ∪ ⌉Ω)
=
/ {e1 = {a0 , b0 , c0 }, e3 = {a0 , b0 , c0 }} = Φ.
(13)
3. DeMorgan Inclusions and Laws
by [6, Proposition 2.1]. For ¬α ∈⌉Σ ∪ ⌉Ω
Maji et al. proved the following Proposition.
Θc (¬α) = [Θ(α)]c
Proposition 3 (see [6, Proposition 3.3]). It holds that
c
(1) [(Λ, Σ) (∆, Ω)] = (Λ, Σ)c (∆, Ω)c ,
c
(2) [(Λ, Σ) (∆, Ω)] = (Λ, Σ)c (∆, Ω)c .
=
The following example shows that (14) and (16) of
Proposition 3 do not hold.
Example 3. Let X = {a, b, c} and E = {e1 , e2 , e3 , e4 } and
(Λ, Σ) and (∆, Ω) fuzzy soft sets in a fuzzy soft class (X,
E)
given as
(Λ, Σ) = {e3 = {a0.4 , b0.6 , c0.7 }, e4 = {a0.4 , b0.3 , c1 }},
⎧
c
⎪
⎪
⎪[Λ(α)] ,
⎪
⎨
c
[∆(α)] ,
⎪
⎪
⎪
⎪
⎩[Λ(α) ∨ ∆(α)]c ,
(11)
if ¬α ∈⌉ Ω−⌉Σ,
if ¬α ∈⌉ Σ∩⌉Ω,
⎧
c
⎪
⎪
⎪Λ (¬α),
⎪
⎨
= ∆c (¬α),
⎪
⎪
⎪
⎪
⎩Λc (¬α) ∧ ∆c (¬α),
(14)
if ¬α ∈⌉ Σ−⌉Ω,
if ¬α ∈⌉ Ω−⌉Σ,
if ¬α ∈⌉ Σ∩⌉Ω.
Now consider
(∆, Ω) = {e2 = {a0.2 , b0.2 , c0.7 }, e4 = {a0.7 , b0.8 , c0.6 }}.
if ¬α ∈⌉ Σ−⌉Ω,
(∆, Ω)c (∆, Ω)c = ( Λc , ⌉Σ) ( ∆c , ⌉Ω)
= ( Γ, ⌉ Σ∩⌉Ω),
say ,
(15)
4
Advances in Fuzzy Systems
where
by [6, Proposition 2.1]. For ¬α ∈ Σ ∪ Ω, we have
⎧
⎪
Λc (¬α),
⎪
⎪
⎪
⎨
Γ(¬α) = ⎪∆c (¬α),
⎪
⎪
⎪ c
⎩
Λ (¬α) ∨ ∆c (¬α),
if ¬α ∈⌉ Ω−⌉Σ,
if ¬α ∈ ¬α ∈⌉ Σ∩⌉Σ.
(16)
From (14) and (16), we get (1).
(2) Consider (Λ, Σ)c (∆, Ω)c = (Λc , ⌉Σ) (∆c , ⌉Ω) =
(Θ, ⌉Σ∩⌉Ω) (say), where
Θ(¬α) = Λc (¬α) ∧ ∆c (¬α),
On the other hand
c
(Λ, Σ) (∆, Ω)
∀ ¬α ∈⌉ Σ∩⌉Ω.
= (Γ, Σ ∩ Ω)
c
say
(17)
(25)
From (22) and (24), we get (1).
(2) Suppose that (Λ, Σ) (∆, Ω) = (Θ, Σ ∩ Ω), where
for α ∈ Σ ∩ Ω.
Θ(α) = Λ(α) ∧ ∆(α),
c
(26)
c
= (Θ, Σ ∩ Ω)
(27)
= ( Θc , ⌉(Σ ∩ Ω)) = ( Θc , ⌉ Σ∩⌉Ω)
(19)
c
= Λ (¬α) ∨ ∆ (¬α).
by [6, Proposition 2.1]. Now take ¬α ∈ ⌉Σ∩⌉Ω, then
Clearly,
Θ(¬α) = Λc (¬α) ∧ ∆c (¬α) ⊆ Λc (¬α) ∨ ∆c (¬α) = Γc (¬α).
(20)
Θc (¬α) = [Θ(α)]c = [Λ(α) ∧ ∆(α)]c
c
c
= [Λ(α)] ∨ [∆(α)] .
(28)
Θc (¬α) = Λc (¬α) ∨ ∆c (¬α).
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
(X,
E), one has the following.
c
[(Λ, Σ) (∆, Ω)] ,
(1) (Λ, Σ)c (∆, Ω)c ⊆
c
(Λ, Σ)c (∆, Ω)c .
(2) [(Λ, Σ) (∆, Ω)] ⊆
Proof. (1)Consider
(Λ, Σ)c (∆, Ω)c = ( Λc , ⌉Σ) ( ∆c , ⌉Ω)
= ( Θ, ⌉ Σ∩⌉Ω),
¬α ∈ Σ ∩ Ω.
(22)
= (Γ, Σ ∪ Ω)
= ( Γ, ⌉ Σ∩⌉Ω)
(29)
say .
For ¬α ∈ ⌉Σ ∪ ⌉Ω, we have
⎧
⎪
Λc (¬α),
⎪
⎪
⎪
⎨
Γ(¬α) = ⎪∆c (¬α),
⎪
⎪
⎪
⎩Λc (¬α) ∨ ∆c (¬α),
¬α ∈⌉ Σ−⌉Ω,
¬α ∈⌉ Ω−⌉Σ,
(30)
¬α ∈⌉ Σ∩⌉Ω.
The above DeMorgan Inclusions are, in general, irreversible, as is shown in the following.
Again suppose that (Λ, Σ) (∆, Ω) = (Γ, Σ ∪ Ω). Therefore,
c
(Λ, Σ)c (∆, Ω)c = ( Λc , ⌉Σ) ( ∆c , ⌉Ω)
From (28) and (30), we get (2).
say ,
Θ(¬α) = Λc (¬α) ∧ ∆c (¬α),
Now consider
(21)
where
(Λ, Σ) (∆, Ω)
Γc (¬α) = [Λ(α) ∨ ∆(α)]c = Λc (¬α) ∧ ∆c (¬α).
c
α ∈⌉ Σ∩⌉Ω.
For ¬α ∈ ⌉Σ∩⌉Ω, we have
(Λ, Σ) (∆, Ω)
c
= [Λ(α) ∧ ∆(α)]
α ∈⌉ Ω−⌉Σ, (24)
Therefore,
Now for ¬α ∈]Σ∩]Ω
c
α ∈⌉ Σ−⌉Ω,
Γc (¬α) = [Γ(α)]c = ⎪[∆(α)]c ,
⎪
⎪
⎪
⎩[Λ(α) ∨ ∆(α)]c ,
(18)
= ( Γc , ⌉ Σ∩⌉Ω).
Γc (¬α) = [Γ(α)]
⎧
⎪
[Λ(α)]c ,
⎪
⎪
⎪
⎨
if ¬α ∈⌉ Σ−⌉Ω,
Example 4. Let X = {a, b, c} and E = {e1 , e2 , e3 , e4 } and
(Λ, Σ) and (∆, Ω) fuzzy soft sets in a fuzzy soft class (X,
E)
given as
(Λ, Σ) = {e1 = {a0.2 , b0 , c0.1 }, e2 = {a0.1 , b1 , c0.4 } ,
c
(23)
= ( Γc , ⌉ Σ∩⌉Ω) = (Γc , Σ ∪ Ω)
e4 = {a0.4 , b0.7 , c1 }},
(∆, Ω) = {e2 = {a0.9 , b0.2 , c0.6 }, e4 = {a0.9 , b0.4 , c0.7 }}.
(31)
Advances in Fuzzy Systems
5
4. Generalized DeMorgan Inclusions and Laws
Then calculations show that
c
(Λ, Σ) (∆, Ω)
First, we define arbitrary union and arbitrary intersection of
a family of fuzzy soft sets in a fuzzy soft class (X,
E) as follows.
= {¬e1 = {a0.8 , b1 , c0.9 },
¬e2 = {a0.1 , b0 , c0.4 },
Definition 8. Let F = {(Λi , Σi )|i ∈ I } be a family of fuzzy soft
sets in a fuzzy soft class (X,
E). Then
the union of fuzzy soft
sets in F is a fuzzy soft set (Θ, Ξ), Ξ = i Σi and for all ε ∈ Ξ,
¬e4 = {a0.1 , b0.3 , c0 }}
⊆{¬
/ e2 = {a0.1 , b0 , c0.4 },
Θ(ε) =
¬e4 = {a0.1 , b0.3 , c0 }}
(Λ, Σ)
c
c
= (Λ, Σ)
∆i (ε, Σi ),
(∆, Ω)c ,
(32)
where
⎧
⎨Λi (ε),
∆i (ε, Σi ) = ⎩
¬e2 = {a0.9 , b0.8 , c0.6 },
Φ,
⊆{¬
/ e2 = {a0.9 , b0.8 , c0.6 },
(∆, Ω) .
Theorem 3. For the fuzzy soft sets (Λ, Σ) and (∆, Σ) in a fuzzy
soft class (X,
E), one has the following:
c
(1) (Λ, Σ)c (∆, Σ)c = [(Λ, Σ) (∆, Σ)] ,
c
(2) [(Λ, Σ) (∆, Σ)] = (Λ, Σ)c (∆, Σ)c .
e4 = {a0.3 , b0.2 , c0 }}
(Λ2 , Σ2 ) = {e1 = {a0.4 , b0.6 , c0.8 }, e4 = {a0 , b0.9 , c0.1 }},
Calculations give
(Λ1 , Σ1 ) (Λ2 , Σ2 ) (Λ3 , Σ3 ) ={e1 = {a0.9 , b0.6 , c0.8 },
e2 = {a0.6 , b0.7 , c0.9 },
e3 = {a0.4 , b0.1 , c0.7 },
(∆, Σ) = ( Λc , ⌉Σ) ( ∆c , ⌉Σ)
= ( Θ, ⌉Σ),
say
Now, we generalize Definition 7 as follows.
Θ(¬α) = Λc (¬α) ∧ ∆c (¬α).
(34)
Again suppose that (Λ, Σ) (∆, Σ) = (Γ, Σ). Therefore,
c
(Λ, Σ) (∆, Σ)
c
= (Γ, Σ)
(35)
Definition 9. Let F = {(Λi , Σi )|i ∈ I } be a family of fuzzy
soft sets in a fuzzy soft class (X,
E), with i Σi =
/ φ. Then the
intersectionof fuzzy soft sets in F is a fuzzy soft set (Θ, Ξ),
where Ξ = i Σi and for all ε ∈ Ξ,
Θ(ε) =
Λi (ε).
(42)
i
c
= ( Γ , ⌉Σ),
We may now generalize Theorem 2.
where
Γc (¬α) = [Γ(α)]c = [Λ(α) ∨ ∆(α)]c .
(36)
For all ¬α ∈⌉Σ, we have
c
e4 = {a0.3 , b0.9 , c0.1 }}.
(41)
(33)
where for all ¬α ∈⌉Σ
(40)
(Λ3 , Σ3 ) = {e1 = {a0.8 , b0.4 , c0.3 }, e2 = {a0.6 , b0.7 , c0.9 }}.
Proof. (1) Consider
(Λ, Σ)
(39)
(Λ1 , Σ1 ){e1 = {a0.9 , b0.2 , c0.2 }, e3 = {a0.4 , b0.1 , c0.7 },
It is natural to ask when the DeMorgan Inclusions in
Theorem 2 beome DeMorgan Laws. This is answered in the
following.
c
if ε ∈
/ Σi .
Example 5. Let (X,
E) be a fuzzy soft class and
(Λ1 , Σ1 ), (Λ2 , Σ2 ), and (Λ3 , Σ3 ), fuzzy soft sets given
as
¬e4 = {a0.6 , b0.6 , c0.3 }}
c
if ε ∈ Σi ,
The union of three fuzzy soft sets is illustrated as under
follows.
¬e4 = {a0.6 , b0.6 , c0.3 }}
c
(38)
i
(∆, Ω)c = {¬e1 = {a0.8 , b1 , c0.9 },
= (Λ, Σ)
c
c
c
Γ (¬α) = [Λ(α) ∨ ∆(α)] = Λ (¬α) ∧ ∆ (¬α).
From (34) and (37), we obtain (2).
(2) Similar to (1).
(37)
Theorem 4. Let S = {(Λi , Σi )|i ∈ I } be a family of fuzzy soft
sets in a fuzzy soft class (X,
E). Then one has the following:
(1) i (Λi , Σi )c ⊆ ( i (Λi , Σi ))c ,
(2) ( i (Λi , Σi ))c ⊆ i (Λi , Σi )c .
Finally, Theorem 3 may also be generalized.
6
Advances in Fuzzy Systems
Theorem 5. Let F = {(Λi , Σ)|i ∈ I } be a family of fuzzy soft
sets in a fuzzy soft class (X,
E). Then one has the following:
(1) i (Λi , Σ)c = ( i (Λi , Σ))c ,
(2) ( i (Λi , Σ))c = i (Λi , Σ)c .
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 [6–8] 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.
Journal of
Advances in
Industrial Engineering
Multimedia
Hindawi Publishing Corporation
http://www.hindawi.com
The Scientific
World Journal
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Applied
Computational
Intelligence and Soft
Computing
International Journal of
Distributed
Sensor Networks
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Advances in
Fuzzy
Systems
Modelling &
Simulation
in Engineering
Hindawi Publishing Corporation
http://www.hindawi.com
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Volume 2014
Submit your manuscripts at
http://www.hindawi.com
Journal of
Computer Networks
and Communications
Advances in
Artificial
Intelligence
Hindawi Publishing Corporation
http://www.hindawi.com
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Volume 2014
Advances in
International Journal of
Biomedical Imaging
Artificial
Neural Systems
International Journal of
Computer Engineering
Computer Games
Technology
Hindawi Publishing Corporation
http://www.hindawi.com
Hindawi Publishing Corporation
http://www.hindawi.com
Advances in
Volume 2014
Advances in
Software Engineering
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
International Journal of
Reconfigurable
Computing
Computational
Intelligence and
Neuroscience
Advances in
Journal of
Human-Computer
Interaction
Robotics
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Journal of
Electrical and Computer
Engineering
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014