FUZZY SOFT SET THEORY AND ITS

APPLICATIONS

In 1999, Molodtsov introduced soft sets and

established the fundamental results of the
new theory that can be seen as a new
mathematical theory for dealing with
uncertainty. Applications of Soft Set Theory
in other disciplines and real life problems
are now catching momentum. Molodtsov
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. worked on theoretical study of
soft sets in detail, and presented an
application of soft set in the decision
making problem using the reduction of
rough sets . Chen et al.propose
parametrization reduction of soft sets, and
then Kong et al. presented the
normal parametrization reduction of soft
sets. 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.
been studied in more detail. Aktas. and C.
a_gman introduced a definition of soft
groups, and derived their basic properties.
Park et al. [28] worked on the notion
of soft WS-algebras, soft sub algebras and
soft deductive systems. Jun dealt
with the algebraic structure of BCK/BCIalgebras by applying soft set theory. and
Park presented the notion of soft ideals,
idealistic soft and idealistic soft
BCK/BCI-algebras .A soft set FA over U is a
set de_ned by a function fA representing
a mapping. the problem of setting
the membership function or any similar
problem does not
arise in 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.
fA : E ! P(U) such that fA(x) = ; if x = A
fA is called approximate function of the soft
set FA, and the value fA(x) is
a set called x-element of the soft set for all x
E.
For two fuzzy soft sets (, ) and
(,) in a fuzzy soft class
_
(X, E), we say that (, ) is a fuzzy
soft subset of (,), if
(i) ,
(ii) For all ,() (),
and is written as (, ) _(,).
Union of two fuzzy soft sets (, ) and
(,) in a soft class (X, E) is a fuzzy soft set
(,), where
= , and for all ,

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 (, ) (,) = (,).
Example. Suppose that
X = {h, i, j, k}
E ={very costly, costly, beautiful,
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}
and suppose that
( very costly) = [h0.3, i0.4, j0.1, k0.8]
(costly) = [h0.5, i0.2, j0.7, k1.0]

 (cheap) = [h0.3, i0.1, j0.8, k0.9]

(beautiful) = [h0.4, i0.7, j0.2, k0.1]
(in the green surrounding)= [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 ofMaji et al., we
get two diferent
values for (cheap), that is,
(cheap)= (cheap)
=[h0.3, i0.1, j0.8, k0.9]
/=[h0.5, i0.6, j0.2, k0.5]
= (cheap)
Therefore, ceases to be a
function as (cheap) and (cheap) are not
identical and
so this definition is not applicable. However
by using
(cheap)= (cheap) (cheap)=[h0.3, i0.1,
j0.2, k0.5]

THEOREM
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

THEOREM
Let F = {(i, )|i I} be
a family of fuzzy soft sets in a fuzzy soft
class(X, E). Then one has the following:

Let U = {ul; u2; u3; u4; u5} be a

universal set and E = {x1; x2; x3; x4}

fs-aggregation
In this section, we define an fs-aggregation
operator that produces an aggregate
fuzzy set from an fs-set and its cardinal set.
The approximate functions of an fs-set are
fuzzy. An fs-aggregation operator on the
fuzzy sets is an operation by which several
approximate functions of an fs-set are
combined to produce a single
fuzzy set which is the aggregate fuzzy set of
the fs-set. Once an aggregate fuzzy set
has been arrived at, it may be necessary to
choose the best single crisp alternative

from this set.

Definition

Definition

Definition

Definition

Application
Once an aggregate fuzzy set has
been arrived at, it may be necessary
to choose the best alternative from
this set. Therefore, we can make a
decision by the following algorithm.

THEOREM

THEOREM

Conclusion
The soft set theory proposed by
Molodtsov ofers a general
mathematical tool for dealing with
uncertain and vague

(u).

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. De Morgan Inclusions
and De Morgan 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.

Project on fuzzy soft set

theory

Chintan
saluja
Bsc (h)
mathematics
3rd
semester

Roll
no. - 36