Hindawi Publishing Corporation

Advances in Fuzzy Systems

Volume 2009, Article ID 407890, 6 pages
doi:10.1155/2009/407890

Research Article
Mappings on Fuzzy Soft Classes

Athar Kharal1 and B. Ahmad2, 3

1 College of Aeronautical Engineering, National University of Sciences and Technology (NUST),
PAF Academy Risalpur 24090, Pakistan
2 Department of Mathematics, King Abdul Aziz University, P.O. Box 80203, Jeddah-21589, Saudi Arabia
3 Centre for Advanced Studies in Pure and Applied Mathematics (CASPAM), Bahauddin Zakariya University, Multan 60800, Pakistan

Correspondence should be addressed to Athar Kharal, atharkharal@gmail.com

Received 31 December 2008; Revised 12 May 2009; Accepted 23 June 2009

Recommended by Krzysztof Pietrusewicz

We define the concept of a mapping on classes of fuzzy soft sets and study the properties of fuzzy soft images and fuzzy soft inverse
images of fuzzy soft sets, and support them with examples and counterexamples.

Copyright © 2009 A. Kharal and B. Ahmad. 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 that the problem of setting the membership function or any

To solve complicated problems in economics, engineering
and environment, we cannot successfully use classical meth-
ods because of different kinds of incomplete knowledge,
typical for those problems. There are four theories: Theory of
Probablity, Fuzzy Set Theory (FST) [1], Interval Mathemat-
ics and Rough Set Theory (RST) [2], which we can consider
as mathematical tools for dealing with imperfect knowledge.
All these tools require the pre-specification of some param-
eter to start with, for example, probablity density function
in Probability Theory, membership function in FST and an
equivalence relation in RST. Such a requirement, seen in the
backdrop of imperfect or incomplete knowledge, raises many
problems. At the same time, incomplete knowledge remains
the most glaring characteristic of humanistic systems—
systems exemplified by biological systems, economic systems,
social systems, political systems, information systems and
more generally man-machine systems of various types.
Noting problems in parameter specification, Molodtsov
[3] introduced the notion of soft set to deal with problems
of incomplete information. Soft Set Theory (SST) does
not require the specification of a parameter, instead it
accommodates approximate descriptions of an object as
its starting point. This makes SST a natural mathematical
formalism for approximate reasoning. We can use any
parametrization we prefer: with the help of words, sentences,
real numbers, functions, mappings, and so on. This means
similar problem does not arise in SST.
Applications of SST in other disciplines and real life
problems are now catching momentum. Molodtsov [3]
successfully applied the SST into several directions, such
as smoothness of functions, Riemann integration, Perron
integration, Theory of Probability, Theory of Measurement
and so on. Kovkov et al. [4] have found promising results by
applying soft sets to Optimization Theory, Game Theory and
Operations Research. Maji et al. [5] gave practical application
of soft sets in decision making problems. It is based on the
notion of knowledge reduction of rough sets. Zou and Xiao
[6] have exploited the link between soft sets and data analysis
in incomplete information systems.
In [7], Yang et al. emphasized that soft sets needed to be
expanded to improve its potential ability in practical engi-
neering applications. Fuzzy soft sets combine the strengths
of both soft sets and fuzzy sets. Maji et al. [8] introduced the
notion of fuzzy soft set and discussed its several properties.
He proposed it as an attractive extension of soft sets, with
extra features to represent uncertainty and vagueness, on top
of incompleteness. Recent investigations [7–10] have shown
how both theories can be combined into a more flexible,
more expressive framework for modelling and processing
incomplete information in information systems.
The main purpose of this paper is to continue investigat-
ing fuzzy soft sets. In [11], Kharal and Ahmad introduced the
notions of a mapping on the classes of soft sets and studied
2 Advances in Fuzzy Systems

the properties of soft images and soft inverse images. In this (Λ, Σ) and (Δ, Ω) is a fuzzy soft set (Θ, Ξ), where Ξ = Σ ∩ Ω,
paper, we define the notion of a mapping on classes of fuzzy and for all ε ∈ Ξ, Θ(ε) = Λ(ε) ∧ Δ(ε). We write
soft sets. We also define and study the properties of fuzzy soft

images and fuzzy soft inverse images of fuzzy soft sets, and (Λ, Σ)  (Δ, Ω) = (Θ, Ξ). (1)
support them with examples and counterexamples.
Definition 2.8 (see [8]). Union of two fuzzy soft sets (Λ, Σ)
2. Preliminaries and (Δ, Ω) over X is a fuzzy soft set (Θ, Ξ), where Ξ = Σ ∪ Ω,
and for all ε ∈ Ξ,
First we recall basic definitions and results. ⎧
Molodtsov defined a soft set in the following manner. ⎪
⎪ Λ(ε), if ε ∈ Σ − Ω,
⎪
⎪
⎨
Definition 2.1 (see [3]). A pair (F, A) is called a soft set over Θ(ε) = ⎪Δ(ε), if ε ∈ Ω − Σ, (2)
⎪
⎪
a universe X and with a set A of attribues from E, where F : ⎪
⎩Λ(ε) ∨ Δ(ε), if ε ∈ Σ ∩ Ω,
A → P(X) is a mapping.
In other words, a soft set over X is a parameterized

family of subsets of the universe X. For ε ∈ A, F(ε) may be and is written as (Λ, Σ)  (Δ, Ω) = (Θ, Ξ).
considered as the set of ε-elements of the soft set (F, A), or as
the set of ε-approximate elements of the soft set. 3. Mappings on Classes of Fuzzy Soft Sets
Maji et al. defined a fuzzy soft set in the following Definition 3.1. Let X be an universe and E a set of attributes.
manner. Then the collection of all fuzzy soft sets over X with attributes

from E is called a fuzzy soft class and is denoted as (X, E).
Definition 2.2 (see [8]). A pair (Λ, Σ) is called a fuzzy soft set
over X, where Λ : Σ → P(X)  
is a mapping, P(X) being the  
Definition 3.2. Let (X, E) and (Y , E
) be classes of fuzzy soft
set of all fuzzy sets of X. sets over X and Y with attributes from E and E
, respectively.
Let u : X → Y and p : E → E
be mappings. Then a
Definition 2.3 (see [8]). A fuzzy soft set (Λ, Σ) over X is said
 if for all ε ∈ Σ, Λ(ε) = mapping f = (u, p) : (X, E) → (Y  , E
) is defined as follows:
to be null fuzzy soft set denoted by Φ,
0, where 0 denotes null fuzzy set over X. 
for a fuzzy soft set (Λ, Σ) in (X, E), f (Λ, Σ) is a fuzzy soft set

in (Y , E
) obtained as follows: for β ∈ p(E) ⊆ E
and y ∈ Y ,
Definition 2.4 (see [8]). A fuzzy soft set (Λ, Σ) is said to be
 if for all ε ∈ Σ, Λ(ε) = 1
absolute fuzzy soft set denoted by Σ, , ⎧ ⎛ ⎞
⎪
⎪
⎪
⎪ ⎜ ⎟
where 1 denotes absolute fuzzy set over X. ⎪
⎪ ⎝ Λ(α)⎠(x),
⎪
⎪
⎪
⎨x∈u−1 ( y ) α∈ p−1 (β)∩Σ
  
Definition 2.5 (see [8]). For two fuzzy soft sets (Λ, Σ) and f (Λ, Σ) β y = ⎪
⎪    
(Δ, Ω) over X, we say that (Λ, Σ) is a fuzzy soft subset of ⎪ ⎪
⎪ if u−1 y =
/ φ, p−1 β ∩ Σ =
/ φ,
⎪
⎪
(Δ, Ω), if ⎪
⎪
⎩ 0, otherwise.
(3)
(i) Σ ⊆ Ω,
f (Λ, Σ) is called a fuzzy soft image of a fuzzy soft set (Λ, Σ).
(ii) for all ε ∈ Σ, Λ(ε) ≤ Δ(ε),
Definition 3.3. Let u : X → Y and p : E → E
be mappings.
 (Δ, Ω).
and is written as (Λ, Σ)≤ 
Let f : (X, E) → (X,  E) be a mapping and (Δ, Ω), a fuzzy

soft set in (Y , E
), where Ω ⊆ E
. Then f −1 (Δ, Ω), is a fuzzy
Maji et al. defined the intersection of two fuzzy soft sets
as follows. 
soft set in (X, E), defined as follows: for α ∈ p−1 (Ω) ⊆ E, and
x ∈ X,
Definition 2.6 (see [8]). Intersection of two fuzzy soft sets ⎧  
(Λ, Σ) and (Δ, Ω) over X is a fuzzy soft set (Θ, Ξ), where ⎨Δ p(α) (u(x)), for p(α) ∈ Ω,
−1
Ξ = Σ ∩ Ω, and for all ε ∈ Ξ, Θ(ε) = Λ(ε) or Δ(ε), (as both f (Δ, Ω)(α)(x) = ⎩ (4)
 0, otherwise.
are same fuzzy set), and is written as (Λ, Σ)  (Δ, Ω) = (Θ, Ξ).

We point out that generally Λ(ε) and Δ(ε) may not be f −1 (Δ, Ω) is called a fuzzy soft inverse image of (Δ, Ω).
identical. Moreover, Σ ∩ Ω must be nonempty to avoid the
degenerate case. Thus we revise Definition 2.6 as follows. Above Definitions 3.2 and 3.3 are illustrated as follows.

Definition 2.7. Let (Λ, Σ) and (Δ, Ω) be two fuzzy soft sets Example 3.4. Let X = {a, b, c}, Y = {x, y, z}, E =
over X with Σ∩Ω = / φ. Then intersection of two fuzzy soft sets 
{e1 , e2 , e3 , e4 }, E
= {e1
, e2
, e3
} and (X, 
E), (Y , E
), classes of
Advances in Fuzzy Systems 3

fuzzy soft sets. Let u : X → Y and p : E → E

be mappings By similar calculations, consequently, we get
defined as
f −1 (Δ, Ω) = {e1 = {a0.1 , b0.5 , c0.5 }, e2 = {a0.1 , b0.5 , c0.5 },
u(a) = z, u(b) = y, u(c) = y,
e3 = {a0.6 , b0.5 , c0.5 }, e4 = {a0.5 , b0.1 , c0.1 }}.
p(e1 ) = e1
, p(e2 ) = e1
, p(e3 ) = e3
, p(e4 ) = e2
. (10)
(5)
Remark 3.5. Note that the null (resp., absolute) fuzzy soft set

Choose two fuzzy soft sets in (X, 
E) and (Y , E
), respectively, as defined by Maji et al. [8], is not unique in a fuzzy soft class
as 
(X, E), rather it depends upon Σ ⊆ E. Therefore, we denote
it by Φ Σ (resp., XΣ ). If Σ = E, then we denote it simply by
(Λ, Σ) = {e1 = {a0.5 , b0 , c0.8 }, e2 = {a0.1 , b0.9 , c0.5 },  (resp., X),
 which is unique null (resp., absolute) fuzzy soft
Φ
e4 = {a0.4 , b0.3 , c0.6 }}, set, called full null (resp., full absolute) fuzzy soft set.
     (6)
(Δ, Ω) = e1
= x0.3 , y0.5 , z0.1 , e2
= x0.9 , y0.1 , z0.5 , 
Definition 3.6. Let f : (X, E) → (Y  , E
) be a mapping and
 

e3 = x0.7 , y0.5 , z0.6 . 

(Λ, Σ), (Δ, Ω) fuzzy soft sets in (X, E). Then for β ∈ E
, y ∈
Y , the fuzzy soft union and intersection of fuzzy soft images

Then the fuzzy soft image of (Λ, Σ) under f : (X, E) → 
f (Λ, Σ) and f (Δ, Ω) in (Y , E
) are defined as

(Y , E ) is obtained as

 
  
⎛ ⎞ f (Λ, Σ)  f (Δ, Ω) β y

 ⎜ ⎟      
f (Λ, Σ) e1 (x) = ⎝ Λ(α)⎠(s) = f (Λ, Σ) β y f (Δ, Ω) β y ,
s∈u−1 (x) α∈ p−1 (e1
)∩Σ
   (11)
   
 −1
 f (Λ, Σ) f (Δ, Ω) β y
= 0, as u (x) = φ ,
⎛ ⎞       
= f (Λ, Σ) β y f (Δ, Ω) β y ,

  ⎜ ⎟
f (Λ, Σ) e1 y = ⎝ Λ(α)⎠(s)

s∈u−1 ( y ) α∈ p−1 (e1
)∩Σ where  and  denote fuzzy soft union and intersection of
⎛ ⎞ 
fuzzy soft images in (Y , E
).

= ⎝ Λ(α)⎠(s) (7)
s∈{b,c} α∈{e1 ,e2 }

Definition 3.7. Let f : (X, E) → (Y  , E
) be a mapping and

(Λ, Σ), (Δ, Ω) fuzzy soft sets in (Y , E
). Then for α ∈ E, x ∈
= (Λ(e1 ) ∨ Λ(e2 ))(s) X, the fuzzy soft union and intersection of fuzzy soft inverse
s∈{b,c}

images f −1 (Λ, Σ) and f −1 (Δ, Ω) in (X, E) are defined as

= ({a0.5 , b0.9 , c0.8 })(s)  
s∈{b,c} f −1 (Λ, Σ)  f −1 (Δ, Ω) (α)(x)

= (0.9, 0.8) = 0.9, = f −1 (Λ, Σ)(α)(x) f −1 ((Δ, Ω))(α)(x),
    (12)
f (Λ, Σ) e1
(z) = 0.5. −1

 −1
f (Λ, Σ) f (Δ, Ω) (α)(x)
By similar calculations, consequently, we get 
       = f −1 (Λ, Σ)(α)(x) f −1 ((Δ, Ω))(α)(x).

f (Λ, Σ), Ω = e1 = x0 , y0.9 , z0.5 , e2 = x0 , y0.6 , z0.4 ,

  Theorem 3.8. Let f : (X,  E) → (Y  , E
) and u : X → Y and
e3
= x0 , y0 , z0 .
p : E → E be mappings. For fuzzy soft sets (Λ, Σ), (Δ, Ω) and

(8)

a family of fuzzy soft sets (Λi , Σi ) in (X, E), we have
Next, for p(ei ) ∈ Ω, i = 1, 2, 4, we calculate
 = Φ,
(1) f (Φ) 
−1
  

f (Δ, Ω)(e1 )(a) = Δ p(e1 ) (u(a)) = Δ e1 (z)  ≤
(2) f (X)  Y ,
 

= x0.3 , y0.5 , z0.1 (z) = 0.1, (3) f ((Λ, Σ)  (Δ, Ω)) = f (Λ, Σ)  f (Δ, Ω).

     In general, f ( i (Λi , Σi )) = i f (Λi , Σi ),

f −1 (Δ, Ω)(e1 )(b) = Δ p(e1 ) (u(b)) = Δ e1
y (9)  
   (4) f ((Λ, Σ)  (Δ, Ω))≤ f ((Λ, Σ))  f ((Δ, Ω)).
= x0.3 , y0.5 , z0.1 y = 0.5,  
  i f (Λi , Σi ),
In general, f ( i (Λi , Σi ))≤
f −1 (Δ, Ω)(e1 )(c) = 0.5. (5) if (Λ, Σ)≤
 (Δ, Ω), then f (Λ, Σ)≤
 f (Δ, Ω).
4 Advances in Fuzzy Systems

Proof. We only prove (3)–(5). By (I) and (II), we have (3).

(3) For β ∈ E
and y ∈ Y , we show that (4) For β ∈ E
and y ∈ Y , and using Definition 3.6, we
  have
  
f (Λ, Σ)  (Δ, Ω) β y   
  
(13) f (Λ, Σ)  (Δ, Ω) β y
     
= f (Λ, Σ) β y f (Δ, Ω) β y .     
= f (Θ, Σ ∩ Ω) β y , say
Consider ⎛ ⎞
 
    ⎜
f (Λ, Σ) (Δ, Ω) β y = ⎝ Θ(α)⎠(x)
⎟
     x∈u−1 ( y ) α∈ p−1 (β)∩(Σ∩Ω)
= f (Θ, Σ ∪ Ω) β y say
⎛ ⎞
⎧ ⎛ ⎞
⎪   
⎪
⎪ ⎜ ⎟
⎪
⎪ ⎜ ⎟ = ⎝ Λ(α) Δ(α) ⎠(x)
⎪
⎪ ⎝ Θ(α)⎠(x),
⎪
⎨x∈u−1 ( y ) α∈ p−1 (β)∩(Σ∪Ω) x∈u−1 ( y ) α∈ p−1 (β)∩(Σ∩Ω)
=     ⎛ ⎞
⎪
⎪
⎪
⎪
⎪ if u−1 y = / φ, p−1 β ∩ (Σ ∪ Ω) =
/ φ, ⎜   
⎟
⎪
⎪ = ⎝ Λ(α)(x) Δ(α)(x) ⎠
⎪
⎩
0, otherwise, x∈u−1 ( y) α∈ p−1 (β)∩(Σ∩Ω)
(14) ⎛ ⎞
⎜ ⎟
where ≤⎝ Λ(α)(x)⎠
⎧  
⎪
⎪Λ(α), α∈Σ−Ω∩ p β ,
−1
⎪ x∈u−1 ( y) α∈ p−1 (β)∩Σ
⎪
⎨   ⎛ ⎞
Θ(α) = ⎪Δ(α), α∈Ω−Σ∩ p −1
β , (15) ⎜
⎪
⎪   ⎟
⎪
⎩Λ(α) Δ(α), ⎝ Δ(α)(x)⎠
α ∈ Σ ∩ Ω ∩ p−1 β ,
x∈u−1 ( y) α∈ p−1 (β)∩Ω
for α ∈ (Σ ∪ Ω) ∪ p−1 (β).       
Considering only the non-trivial case, we have = f ((Λ, Σ)) β y f ((Δ, Ω)) β y , for β = p(α)
   
   
f (Λ, Σ)  (Δ, Ω) β y    
= f (Λ, Σ) f (Δ, Ω) β y .
⎛⎧  ⎞ (16)
⎪Λ(α)(x), α ∈ Σ − Ω ∩ p−1 β
⎪
⎪
⎜ ⎪ ⎜ ⎨ ⎟
 ⎟ This gives (4).
⎜ α ∈ Ω − Σ ∩ p−1 β ⎟
= ⎜ ⎪Δ(α)(x), ⎟. (5) Considering only the non-trivial case, for β ∈ E
and
x∈u−1 ( y )
⎝ ⎪
⎪
⎪   ⎠
⎩ Λ(α) Δ(α) (x), α∈Σ∩Ω∩ p β −1 y ∈ Y , and since (Λ, Σ)≤
 (Δ, Ω), we have
⎛ ⎞
(I)
  ⎜ ⎟
Next, by Definition 3.6, we have f ((Λ, Σ))β y = ⎝ Λ(α)⎠(x)
  x∈u−1 ( y) α∈ p−1 (β)∩Σ
  
f (Λ, Σ)  f (Δ, Ω) β y
= Λ(α)(x)
      x∈u−1 ( y ) α∈ p−1 (β)∩Σ (17)
= f (Λ, Σ) β y f (Δ, Ω) β y
⎛ ⎞ ≤ Δ(α)(x)
⎜ ⎟ x∈u−1 ( y ) α∈ p−1 (β)∩Ω
=⎝ Λ(α)(x)⎠
  
x∈u−1 ( y ) α∈ p−1 (β)∩Σ = f (Δ, Ω) β y .
⎛ ⎞
⎜ This gives (5).
⎟
⎝ Δ(α)(x)⎠
In Theorem 3.8, inequalities (2), (4) and implication (5)
x∈u−1 ( y ) α∈ p−1 (β)∩Ω
 
cannot be reversed, in general, as is shown in the following.

= Λ(α) Δ(α) (x)
x∈u−1 ( y ) α∈ p−1 (β)∩(Σ∪Ω)

Example 3.9. Let (X, E), (Y , E
) be classes of fuzzy soft sets
⎛⎧  ⎞ 
and f : (X, 
E) → (Y , E
) as defined in Example 3.4. For (2),
⎪Λ(α)(x), α ∈ Σ − Ω ∩ p−1 β
⎪
⎪ we define mappings u : X → Y and p : E → E
as
⎜ ⎪ ⎜ ⎨ ⎟
 ⎟
⎜ α ∈ Ω − Σ ∩ p−1 β ⎟
= ⎜ ⎪Δ(α)(x), ⎟. u(a) = x, u(b) = z, u(c) = x,
x∈u−1 ( y )
⎝ ⎪
⎪
⎪   ⎠
⎩ Λ(α) Δ(α) (x), α∈Σ∩Ω∩ p −1
β p(e1 ) = e2 ,

p(e2 ) = e1 ,

p(e3 ) = e2
, p(e4 ) = e2
.
(II) (18)
Advances in Fuzzy Systems 5

Then calculations give Proof. We only prove (3)–(5).

(3) For α ∈ E and x ∈ X, we have
      
Y ≤
/ e2
= x1 , y0 , z1 , e3
= x0 , y0 , z0 , e1
= x1 , y0 , z1  
  f −1 (Λ, Σ)  (Δ, Ω) (α)(x)
= f X .
(19) = f −1 ((Θ, Σ ∪ Ω))(α)(x)
   
= Θ p(α) (u(x)), p(α) ∈ Σ ∪ Ω, u(x) ∈ Y
For (4) and (5), define mappings u : X → Y and p : E → E

  (I)
as = Θ β (u(x)), where β = p(α)
u(a) = y, ⎛⎧   ⎞
u(b) = y, u(c) = y, ⎪ Λ β (u(x)), β ∈Σ−Ω
⎪
⎪
⎜⎪ ⎟
p(e1 ) = e3
, p(e2 ) = e2
, p(e3 ) = e2
, p(e4 ) = e1
. ⎜⎨   ⎟
=⎜⎜⎪ Δ β (u(x)), β ∈ Ω − Σ ⎟.
⎟
(20) ⎝⎪⎪ ⎠
⎩Λβ ∪ Δβ(u(x)), β ∈ Σ ∩ Ω
⎪


Choose two fuzzy soft sets in (X, E) as Next, we use Definition 3.7 and get
 
(Λ, Σ) = {e3 = {a0.4 , b0.8 , c0.6 }}, f −1 (Λ, Σ) f −1 (Δ, Ω) (α)(x)
(21)
(Δ, Ω) = {e3 = {a0.6 , b0.1 , c1 }}. = f −1 (Λ, Σ)(α)(x) f −1 ((Δ, Ω))(α)(x)
   
Then calculations give = Λ p(α) (u(x)) Δ p(α) (u(x)), β = p(α) ∈ Σ ∪ Ω
 ⎛⎧   ⎞
f (Λ, Σ)  f (Δ, Ω) ⎪
⎪Λ β (u(x)),
⎪ β ∈Σ−Ω
⎜⎪ ⎟
       ⎜⎨   ⎟

= e1 = x0 , y0 , z0 , e2 = x0 , y0.8 , z0 , e3 = x0 , y0 , z0 =⎜
⎜⎪Δ β (u(x)), β ∈ Ω − Σ⎟
⎟.
⎝⎪⎪ ⎠
       ⎩Λβ ∪ Δβ(u(x)),
⎪
β ∈Σ∩Ω
/ e1
= x0 , y0 , z0 , e2
= x0 , y0.6 , z0 , e3
= x0 , y0 , z0
≤
(II)
  

= f (Λ, Σ) (Δ, Ω) From (I) and (II), we get (3).
(22) (4) For α ∈ E, x ∈ X and using Definition 3.7, we have
  
also we have f −1 (Λ, Σ)  (Δ, Ω) (α)(x)

f (Λ, Σ) = f −1 ((Θ, Σ ∩ Ω))(α)(x)

        
= e1
= x0 , y0 , z0 , e2
= x0 , y0.8 , z0 , e3
= x0 , y0 , z0 = Θ p(α) (u(x)), p(α) ∈ Σ ∪ Ω
        
 e1
= x0 , y0 , z0 , e2
= x0 , y1 , z0 , e3
= x0 , y0 , z0
≤ = Θ β (u(x)), β = p(α)
     (24)
= f (Δ, Ω) = Λ β ∧ Δ β (u(x))
(23)    
= Λ p(α) (u(x)) ∧ Δ p(α) (u(x))
/ (Δ, Ω).
but (Λ, Σ)≤ = f −1 (Λ, Σ)(α)(x) ∧ f −1 (Δ, Ω)(α)(x)
  
Theorem 3.10. Let f : (X,  E) → (Y  , E
), u : X → Y and 
= f −1 (Λ, Σ) f −1 (Δ, Ω) (α)(x).
p : E → E
be mappings. For fuzzy soft sets (Λ, Σ), (Δ, Ω) and

a family of fuzzy soft sets (Λi , Σi ) in (Y , E
), we have This gives (4).
 (Δ, Ω), we have
(5) Since (Λ, Σ)≤
 = Φ,
(1) f −1 (Φ) 
f −1 ((Λ, Σ))(α)(x)
(2) f −1 (Y ) = X,
    


= Λ p(α) (u(x)) = Λ β (u(x)), p(α) = β
(3) f ((Λ, Σ)  (Δ, Ω)) = f −1 (Λ, Σ)  f −1 (Δ, Ω).
−1
    (25)


≤ Δ β (u(x)) = Δ p(α) (u(x))
In general, f −1 ( i (Λi , Σi )) = i f −1 (Λi , Σi ),
 
(4) f −1 ((Λ, Σ)  (Δ, Ω)) = f −1 (Λ, Σ)  f −1 (Δ, Ω)
. = f −1 ((Δ, Ω))(α)(x).
 
In general, f −1 ( i (Λi , Σi )) = i f −1 ((Λi , Σi )),
The implication in (5) is not reversible, in general, as is
 (Δ, Ω), then f −1 (Λ, Σ)≤
(5) If (Λ, Σ)≤  f −1 (Δ, Ω). shown in the following.
6 Advances in Fuzzy Systems


Example 3.11. Let (X, 
E), (Y , E
) be classes of fuzzy soft sets [8] P. K. Maji, R. Biswas, and A. R. Roy, “Fuzzy soft sets,” Journal
  of Fuzzy Mathematics, vol. 9, no. 3, pp. 589–602, 2001.
and f : (X, E) → (Y , E
) as defined in Example 3.4. For (5) [9] Z. Kong, L. Gao, and L. Wong, “Comment on “A fuzzy soft set
define mappings u : X → Y and p : E → E
as theoretic approach to decision making problems”,” Journal of
u(a) = y, u(b) = y, u(c) = z, Computational and Applied Mathematics, vol. 223, no. 2, pp.
542–540, 2009.

p(e1 ) = e1 , p(e2 ) = e2 , p(e3 ) = e2

, p(e4 ) = e1
. [10] A. R. Roy and P. K. Maji, “A fuzzy soft set theoretic approach
(26) to decision making problems,” Journal of Computational and
Applied Mathematics, vol. 203, no. 2, pp. 412–418, 2007.

Choose two fuzzy soft sets in (Y , E
) as [11] A. Kharal and B. Ahmad, “Mappings on soft classes,” submit-
   ted.
(Λ, Σ) = e3
= x0.8 , y0 , z0 ,
   (27)
(Δ, Ω) = e3
= x0.3 , y0.1 , z0.5 .
Then calculations give
≤
f −1 (Λ, Σ) = Φ  = f −1 (Δ, Ω),
Φ (28)
/ (Δ, Ω).
but (Λ, Σ)≤

4. Conclusion
Fuzzy sets and soft sets complement each other to represent
vague and incomplete knowledge, respectively. Synergy of
these approaches has been proposed through the notion of
fuzzy soft sets in [8]. In this paper, we have defined the
notion of a mapping on the classes of fuzzy soft sets which
is a pivotal notion for advanced development of any new
area of mathematical sciences. We have studied the properies
of fuzzy soft images and inverse images which have been
supported by examples and counterexamples. We hope these
fundamental results will help the researchers to enhance and
promote the research on Fuzzy Soft Set Theory.

Acknowledgment
We are grateful to the referee for his valueable comments
which led to the improvement of this paper.

References
[1] L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8, pp.
338–353, 1965.
[2] Z. Pawlak, “Rough sets,” International Journal of Computer and
Information Sciences, vol. 11, pp. 341–356, 1982.
[3] D. Molodtsov, “Soft set theory—first results,” Computers &
Mathematics with Applications, vol. 37, no. 4-5, pp. 19–31,
1999.
[4] D. V. Kovkov, V. M. Kolbanov, and D. A. Molodtsov, “Soft sets
theory-based optimization,” Journal of Computer and Systems
Sciences International, vol. 46, no. 6, pp. 872–880, 2007.
[5] 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.
[6] Y. Zou and Z. Xiao, “Data analysis approaches of soft sets
under incomplete information,” Knowledge-Based Systems,
vol. 21, no. 8, pp. 941–945, 2008.
[7] 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.