Advances in Fuzzy Systems
Volume 2009 (2009), Article ID 407890, 6 pages
doi:10.1155/2009/407890
Research Article

Mappings on Fuzzy Soft Classes

Athar Kharal1 and B. Ahmad1,2

1College of Aeronautical Engineering, National University of Sciences and Technology (NUST), PAF Academy Risalpur 24090, Pakistan
2Department of Mathematics, King Abdul Aziz University, P.O. Box 80203, Jeddah-21589, Saudi Arabia

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

Academic Editor: Krzysztof Pietrusewicz

Copyright © 2009 Athar 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.

Abstract

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.

1. Introduction

To solve complicated problems in economics, engineering and environment, we cannot successfully use classical methods because of different kinds of incomplete knowledge, typical for those problems. There are four theories: Theory of Probablity, Fuzzy Set Theory (FST) [1], Interval Mathematics 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 parameter 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 that the problem of setting the membership function or any 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 engineering 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 investigating fuzzy soft sets. In [11], Kharal and Ahmad introduced the notions of a mapping on the classes of soft sets and studied the properties of soft images and soft inverse images. In this paper, we define the notion of a mapping on classes of fuzzy soft sets. We also define and study the properties of fuzzy soft images and fuzzy soft inverse images of fuzzy soft sets, and support them with examples and counterexamples.

2. Preliminaries

First we recall basic definitions and results.

Molodtsov defined a soft set in the following manner.

Definition 2.1 (see [3]). A pair ( 𝐹 , 𝐴 ) is called a soft set over a universe 𝑋 and with a set 𝐴 of attribues from 𝐸 , where 𝐹 ∶ 𝐴 → 𝑃 ( 𝑋 ) is a mapping.
In other words, a soft set over 𝑋 is a parameterized family of subsets of the universe 𝑋 . For 𝜀 ∈ 𝐴 , 𝐹 ( 𝜀 ) may be considered as the set of 𝜀 -elements of the soft set ( 𝐹 , 𝐴 ) , or as the set of 𝜀 -approximate elements of the soft set.

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

Definition 2.2 (see [8]). A pair ( Λ , Σ ) is called a fuzzy soft set over 𝑋 , where Λ ∶ Σ → 𝑃 ( 𝑋 ) is a mapping, 𝑃 ( 𝑋 ) being the set of all fuzzy sets of 𝑋 .

Definition 2.3 (see [8]). A fuzzy soft set ( Λ , Σ ) over 𝑋 is said to be null fuzzy soft set denoted by Φ , if for all 𝜀 ∈ Σ , ̃ 0 Λ ( 𝜀 ) = , where ̃ 0 denotes null fuzzy set over 𝑋 .

Definition 2.4 (see [8]). A fuzzy soft set ( Λ , Σ ) is said to be absolute fuzzy soft set denoted by Σ , if for all 𝜀 ∈ Σ , ̃ 1 Λ ( 𝜀 ) = , where ̃ 1 denotes absolute fuzzy set over 𝑋 .

Definition 2.5 (see [8]). For two fuzzy soft sets ( Λ , Σ ) and ( Δ , Ω ) over 𝑋 , we say that ( Λ , Σ ) is a fuzzy soft subset of ( Δ , Ω ) , if(i) Σ ⊆ Ω ,(ii)for all 𝜀 ∈ Σ , Λ ( 𝜀 ) ≤ Δ ( 𝜀 ) , and is written as ( Λ , Σ ) ≤ ( Δ , Ω ) .

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

Definition 2.6 (see [8]). Intersection of two fuzzy soft sets ( Λ , Σ ) and ( Δ , Ω ) over 𝑋 is a fuzzy soft 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 2.6 as follows.

Definition 2.7. Let ( Λ , Σ ) and ( Δ , Ω ) be two fuzzy soft sets over X with Σ ∩ Ω ≠ 𝜙 . Then intersection of two fuzzy soft sets ( Λ , Σ ) and ( Δ , Ω ) is a fuzzy soft set ( Θ , Ξ ) , where Ξ = Σ ∩ Ω , and for all 𝜀 ∈ Ξ , ⋀ Θ ( 𝜀 ) = Λ ( 𝜀 ) Δ ( 𝜀 ) . We write ( ⋀ ( Λ , Σ ) Δ , Ω ) = ( Θ , Ξ ) . ( 1 )

Definition 2.8 (see [8]). Union of two fuzzy soft sets ( Λ , Σ ) and ( Δ , Ω ) over 𝑋 is a fuzzy soft set ( Θ , Ξ ) , where Ξ = Σ ∪ Ω , and for all 𝜀 ∈ Ξ , ⎧ ⎪ ⎨ ⎪ ⎩ Θ ( 𝜀 ) = Λ ( 𝜀 ) , i f 𝜀 ∈ Σ − Ω , Δ ( 𝜀 ) , i f 𝜀 ∈ Ω − Σ , Λ ( 𝜀 ) ∨ Δ ( 𝜀 ) , i f 𝜀 ∈ Σ ∩ Ω , ( 2 ) and is written as ⋁ ( Λ , Σ ) ( Δ , Ω ) = ( Θ , Ξ ) .

3. Mappings on Classes of Fuzzy Soft Sets

Definition 3.1. Let 𝑋 be an universe and 𝐸 a set of attributes. Then the collection of all fuzzy soft sets over 𝑋 with attributes from 𝐸 is called a fuzzy soft class and is denoted as ( 𝑋 , 𝐸 ) .

Definition 3.2. Let ( 𝑋 , 𝐸 ) and ( 𝑌 , 𝐸 ) be classes of fuzzy soft sets over 𝑋 and 𝑌 with attributes from 𝐸 and 𝐸 , respectively. Let 𝑢 ∶ 𝑋 → 𝑌 and 𝑝 ∶ 𝐸 → 𝐸 be mappings. Then a mapping 𝑓 = ( 𝑢 , 𝑝 ) ∶ ( 𝑋 , 𝐸 ) → ( 𝑌 , 𝐸 ) is defined as follows: for a fuzzy soft set ( Λ , Σ ) in ( 𝑋 , 𝐸 ) , 𝑓 ( Λ , Σ ) is a fuzzy soft set in ( 𝑌 , 𝐸 ) obtained as follows: for 𝛽 ∈ 𝑝 ( 𝐸 ) ⊆ 𝐸 and 𝑦 ∈ 𝑌 , ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩ ⋁ 𝑓 ( Λ , Σ ) ( 𝛽 ) ( 𝑦 ) = 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) ⋁ 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ Σ Λ ( 𝛼 ) ( 𝑥 ) , i f 𝑢 − 1 ( 𝑦 ) ≠ 𝜙 , 𝑝 − 1 ( 𝛽 ) ∩ Σ ≠ 𝜙 , 0 , o t h e r w i s e . ( 3 ) 𝑓 ( Λ , Σ ) is called a fuzzy soft image of a fuzzy soft set ( Λ , Σ ) .

Definition 3.3. Let 𝑢 ∶ 𝑋 → 𝑌 and 𝑝 ∶ 𝐸 → 𝐸 be mappings. Let 𝑓 ∶ ( 𝑋 , 𝐸 ) → ( 𝑋 , 𝐸 ) be a mapping and ( Δ , Ω ) , a fuzzy soft set in ( 𝑌 , 𝐸 ) , where Ω ⊆ 𝐸 . Then 𝑓 − 1 ( Δ , Ω ) , is a fuzzy soft set in ( 𝑋 , 𝐸 ) , defined as follows: for 𝛼 ∈ 𝑝 − 1 ( Ω ) ⊆ 𝐸 , and 𝑥 ∈ 𝑋 , 𝑓 − 1 ( Δ , Ω ) ( 𝛼 ) ( 𝑥 ) = Δ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) , f o r 𝑝 ( 𝛼 ) ∈ Ω , 0 , o t h e r w i s e . ( 4 ) 𝑓 − 1 ( Δ , Ω ) is called a fuzzy soft inverse image of ( Δ , Ω ) .

Above Definitions 3.2 and 3.3 are illustrated as follows.

Example 3.4. Let 𝑋 = { 𝑎 , 𝑏 , 𝑐 } , 𝑌 = { 𝑥 , 𝑦 , 𝑧 } , 𝐸 = { 𝑒 1 , 𝑒 2 , 𝑒 3 , 𝑒 4 } , 𝐸 = { 𝑒 1 , 𝑒 2 , 𝑒 3 } and ( 𝑋 , 𝐸 ) , ( 𝑌 , 𝐸 ) , classes of fuzzy soft sets. Let 𝑢 ∶ 𝑋 → 𝑌 and 𝑝 ∶ 𝐸 → 𝐸 be mappings defined as 𝑝 𝑒 𝑢 ( 𝑎 ) = 𝑧 , 𝑢 ( 𝑏 ) = 𝑦 , 𝑢 ( 𝑐 ) = 𝑦 , 1 = 𝑒 1 𝑒 , 𝑝 2 = 𝑒 1 𝑒 , 𝑝 3 = 𝑒 3 𝑒 , 𝑝 4 = 𝑒 2 . ( 5 ) Choose two fuzzy soft sets in ( 𝑋 , 𝐸 ) and ( 𝑌 , 𝐸 ) , respectively, as 𝑒 ( Λ , Σ ) = 1 = 𝑎 0 . 5 , 𝑏 0 , 𝑐 0 . 8 , 𝑒 2 = 𝑎 0 . 1 , 𝑏 0 . 9 , 𝑐 0 . 5 , 𝑒 4 = 𝑎 0 . 4 , 𝑏 0 . 3 , 𝑐 0 . 6 , 𝑒 ( Δ , Ω ) = 1 = 𝑥 0 . 3 , 𝑦 0 . 5 , 𝑧 0 . 1 , 𝑒 2 = 𝑥 0 . 9 , 𝑦 0 . 1 , 𝑧 0 . 5 , 𝑒 3 = 𝑥 0 . 7 , 𝑦 0 . 5 , 𝑧 0 . 6 . ( 6 ) Then the fuzzy soft image of ( Λ , Σ ) under 𝑓 ∶ ( 𝑋 , 𝐸 ) → ( 𝑌 , 𝐸 ) is obtained as 𝑓 𝑒 ( Λ , Σ ) 1 ( 𝑥 ) = 𝑠 ∈ 𝑢 − 1 ( 𝑥 ) ⎛ ⎜ ⎜ ⎝ 𝛼 ∈ 𝑝 − 1 𝑒 ′ 1 ∩ Σ Λ ⎞ ⎟ ⎟ ⎠ ( 𝛼 ) ( 𝑠 ) = 0 , a s 𝑢 − 1 , 𝑒 ( 𝑥 ) = 𝜙 𝑓 ( Λ , Σ ) 1 ( 𝑦 ) = 𝑠 ∈ 𝑢 − 1 ( 𝑦 ) ⎛ ⎜ ⎜ ⎝ 𝛼 ∈ 𝑝 − 1 𝑒 ′ 1 ∩ Σ ⎞ ⎟ ⎟ ⎠ = Λ ( 𝛼 ) ( 𝑠 ) 𝑠 ∈ { 𝑏 , 𝑐 } ⎛ ⎜ ⎜ ⎝ 𝑒 𝛼 ∈ 1 , 𝑒 2 ⎞ ⎟ ⎟ ⎠ = Λ ( 𝛼 ) ( 𝑠 ) 𝑠 ∈ { 𝑏 , 𝑐 } Λ 𝑒 1 𝑒 ∨ Λ 2 = ( 𝑠 ) 𝑠 ∈ { 𝑏 , 𝑐 } 𝑎 0 . 5 , 𝑏 0 . 9 , 𝑐 0 . 8 = 𝑓 𝑒 ( 𝑠 ) ( 0 . 9 , 0 . 8 ) = 0 . 9 , ( Λ , Σ ) 1 ( 𝑧 ) = 0 . 5 . ( 7 ) By similar calculations, consequently, we get 𝑒 ( 𝑓 ( Λ , Σ ) , Ω ) = 1 = 𝑥 0 , 𝑦 0 . 9 , 𝑧 0 . 5 , 𝑒 2 = 𝑥 0 , 𝑦 0 . 6 , 𝑧 0 . 4 , 𝑒 3 = 𝑥 0 , 𝑦 0 , 𝑧 0 . ( 8 ) Next, for 𝑝 ( 𝑒 𝑖 ) ∈ Ω , 𝑖 = 1 , 2 , 4 , we calculate 𝑓 − 1 𝑒 ( Δ , Ω ) 1 𝑝 𝑒 ( 𝑎 ) = Δ 1 𝑒 ( 𝑢 ( 𝑎 ) ) = Δ 1 = 𝑥 ( 𝑧 ) 0 . 3 , 𝑦 0 . 5 , 𝑧 0 . 1 𝑓 ( 𝑧 ) = 0 . 1 , − 1 𝑒 ( Δ , Ω ) 1 𝑝 𝑒 ( 𝑏 ) = Δ 1 𝑒 ( 𝑢 ( 𝑏 ) ) = Δ 1 = 𝑥 ( 𝑦 ) 0 . 3 , 𝑦 0 . 5 , 𝑧 0 . 1 𝑓 ( 𝑦 ) = 0 . 5 , − 1 𝑒 ( Δ , Ω ) 1 ( 𝑐 ) = 0 . 5 . ( 9 ) By similar calculations, consequently, we get 𝑓 − 1 𝑒 ( Δ , Ω ) = 1 = 𝑎 0 . 1 , 𝑏 0 . 5 , 𝑐 0 . 5 , 𝑒 2 = 𝑎 0 . 1 , 𝑏 0 . 5 , 𝑐 0 . 5 , 𝑒 3 = 𝑎 0 . 6 , 𝑏 0 . 5 , 𝑐 0 . 5 , 𝑒 4 = 𝑎 0 . 5 , 𝑏 0 . 1 , 𝑐 0 . 1 . ( 1 0 )

Remark 3.5. Note that the null (resp., absolute) fuzzy soft set as defined by Maji et al. [8], is not unique in a fuzzy soft class ( 𝑋 , 𝐸 ) , rather it depends upon Σ ⊆ 𝐸 . Therefore, we denote it by Φ Σ (resp., 𝑋 Σ ). If Σ = 𝐸 , then we denote it simply by Φ (resp., 𝑋 ), which is unique null (resp., absolute) fuzzy soft set, called full null (resp., full absolute) fuzzy soft set.

Definition 3.6. Let 𝑓 ∶ ( 𝑋 , 𝐸 ) → ( 𝑌 , 𝐸 ) be a mapping and ( Λ , Σ ) , ( Δ , Ω ) fuzzy soft sets in ( 𝑋 , 𝐸 ) . Then for 𝛽 ∈ 𝐸 , 𝑦 ∈ 𝑌 , the fuzzy soft union and intersection of fuzzy soft images 𝑓 ( Λ , Σ ) and 𝑓 ( Δ , Ω ) in ( 𝑌 , 𝐸 ) are defined as ⋁ ⋀ 𝑓 ( Λ , Σ ) 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) = 𝑓 ( Λ , Σ ) ( 𝛽 ) ( 𝑦 ) 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) , 𝑓 ( Λ , Σ ) 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) = 𝑓 ( Λ , Σ ) ( 𝛽 ) ( 𝑦 ) 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) , ( 1 1 ) where ⋁ and ⋀ denote fuzzy soft union and intersection of fuzzy soft images in ( 𝑌 , 𝐸 ) .

Definition 3.7. Let 𝑓 ∶ ( 𝑋 , 𝐸 ) → ( 𝑌 , 𝐸 ) be a mapping and ( Λ , Σ ) , ( Δ , Ω ) fuzzy soft sets in ( 𝑌 , 𝐸 ) . Then for 𝛼 ∈ 𝐸 , 𝑥 ∈ 𝑋 , the fuzzy soft union and intersection of fuzzy soft inverse images 𝑓 − 1 ( Λ , Σ ) and 𝑓 − 1 ( Δ , Ω ) in ( 𝑋 , 𝐸 ) are defined as 𝑓 − 1 ⋁ 𝑓 ( Λ , Σ ) − 1 ( Δ , Ω ) ( 𝛼 ) ( 𝑥 ) = 𝑓 − 1 𝑓 ( Λ , Σ ) ( 𝛼 ) ( 𝑥 ) − 1 𝑓 ( ( Δ , Ω ) ) ( 𝛼 ) ( 𝑥 ) , − 1 ⋀ 𝑓 ( Λ , Σ ) − 1 ( Δ , Ω ) ( 𝛼 ) ( 𝑥 ) = 𝑓 − 1 𝑓 ( Λ , Σ ) ( 𝛼 ) ( 𝑥 ) − 1 ( ( Δ , Ω ) ) ( 𝛼 ) ( 𝑥 ) . ( 1 2 )

Theorem 3.8. Let 𝑓 ∶ ( 𝑋 , 𝐸 ) → ( 𝑌 , 𝐸 ) and 𝑢 ∶ 𝑋 → 𝑌 and 𝑝 ∶ 𝐸 → 𝐸 be mappings. For fuzzy soft sets ( Λ , Σ ) , ( Δ , Ω ) and a family of fuzzy soft sets ( Λ 𝑖 , Σ 𝑖 ) in ( 𝑋 , 𝐸 ) , we have (1) 𝑓 ( Φ ) = Φ , (2) ≤ 𝑓 ( 𝑋 ) 𝑌 , (3) ⋁ ⋁ 𝑓 ( ( Λ , Σ ) ( Δ , Ω ) ) = 𝑓 ( Λ , Σ ) 𝑓 ( Δ , Ω ) . In general, ⋁ 𝑓 ( 𝑖 ( Λ 𝑖 , Σ 𝑖 ⋁ ) ) = 𝑖 𝑓 ( Λ 𝑖 , Σ 𝑖 ) , (4) ⋀ ⋀ 𝑓 ( ( Λ , Σ ) ( Δ , Ω ) ) ≤ 𝑓 ( ( Λ , Σ ) ) 𝑓 ( ( Δ , Ω ) ) . In general, ⋀ 𝑓 ( 𝑖 ( Λ 𝑖 , Σ 𝑖 ≤ ⋀ ) ) 𝑖 𝑓 ( Λ 𝑖 , Σ 𝑖 ) , (5)if ( Λ , Σ ) ≤ ( Δ , Ω ) , then 𝑓 ( Λ , Σ ) ≤ 𝑓 ( Δ , Ω ) .

Proof. We only prove ( 3 )–( 5 ).
( 3 ) For 𝛽 ∈ 𝐸 and 𝑦 ∈ 𝑌 , we show that 𝑓 ⋁ ( Λ , Σ ) ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) = 𝑓 ( Λ , Σ ) ( 𝛽 ) ( 𝑦 ) 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) . ( 1 3 ) Consider 𝑓 ⋁ = ⎧ ⎪ ⎪ ⎨ ⎪ ⎪ ⎩ ⋁ ( Λ , Σ ) ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) = 𝑓 ( Θ , Σ ∪ Ω ) ( 𝛽 ) ( 𝑦 ) ( s a y ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) ⋁ 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ ( Σ ∪ Ω ) Θ ( 𝛼 ) ( 𝑥 ) , i f 𝑢 − 1 ( 𝑦 ) ≠ 𝜙 , 𝑝 − 1 ( 𝛽 ) ∩ ( Σ ∪ Ω ) ≠ 𝜙 , 0 , o t h e r w i s e , ( 1 4 ) where Θ ⎧ ⎪ ⎨ ⎪ ⎩ ( 𝛼 ) = Λ ( 𝛼 ) , 𝛼 ∈ Σ − Ω ∩ 𝑝 − 1 ( 𝛽 ) , Δ ( 𝛼 ) , 𝛼 ∈ Ω − Σ ∩ 𝑝 − 1 ⋁ ( 𝛽 ) , Λ ( 𝛼 ) Δ ( 𝛼 ) , 𝛼 ∈ Σ ∩ Ω ∩ 𝑝 − 1 ( 𝛽 ) , ( 1 5 ) for 𝛼 ∈ ( Σ ∪ Ω ) ∪ 𝑝 − 1 ( 𝛽 ) .
Considering only the non-trivial case, we have 𝑓 ⋁ = ( Λ , Σ ) ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) ⎛ ⎜ ⎜ ⎜ ⎝ ⎧ ⎪ ⎨ ⎪ ⎩ Λ ( 𝛼 ) ( 𝑥 ) , 𝛼 ∈ Σ − Ω ∩ 𝑝 − 1 ( 𝛽 ) Δ ( 𝛼 ) ( 𝑥 ) , 𝛼 ∈ Ω − Σ ∩ 𝑝 − 1 ⋁ ( 𝛽 ) Λ ( 𝛼 ) Δ ( 𝛼 ) ( 𝑥 ) , 𝛼 ∈ Σ ∩ Ω ∩ 𝑝 − 1 ⎞ ⎟ ⎟ ⎟ ⎠ . ( 𝛽 ) ( I ) Next, by Definition 3.6, we have ⋁ = ⎛ ⎜ ⎜ ⎝ 𝑓 ( Λ , Σ ) 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) = 𝑓 ( Λ , Σ ) ( 𝛽 ) ( 𝑦 ) 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ Σ ⎞ ⎟ ⎟ ⎠ ⎛ ⎜ ⎜ ⎝ Λ ( 𝛼 ) ( 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ Ω ⎞ ⎟ ⎟ ⎠ = Δ ( 𝛼 ) ( 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ ( Σ ∪ Ω ) = Λ ( 𝛼 ) Δ ( 𝛼 ) ( 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) ⎛ ⎜ ⎜ ⎜ ⎝ ⎧ ⎪ ⎨ ⎪ ⎩ Λ ( 𝛼 ) ( 𝑥 ) , 𝛼 ∈ Σ − Ω ∩ 𝑝 − 1 ( 𝛽 ) Δ ( 𝛼 ) ( 𝑥 ) , 𝛼 ∈ Ω − Σ ∩ 𝑝 − 1 ⋁ ( 𝛽 ) Λ ( 𝛼 ) Δ ( 𝛼 ) ( 𝑥 ) , 𝛼 ∈ Σ ∩ Ω ∩ 𝑝 − 1 ⎞ ⎟ ⎟ ⎟ ⎠ . ( 𝛽 ) ( I I ) By (I) and (II), we have ( 3 ).
(4) For 𝛽 ∈ 𝐸 and 𝑦 ∈ 𝑌 , and using Definition 3.6, we have 𝑓 ⋀ = ( Λ , Σ ) ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) = 𝑓 ( Θ , Σ ∩ Ω ) ( 𝛽 ) ( 𝑦 ) , ( s a y ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) ⎛ ⎜ ⎜ ⎝ 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ ( Σ ∩ Ω ) ⎞ ⎟ ⎟ ⎠ ( = Θ ( 𝛼 ) 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) ⎛ ⎜ ⎜ ⎝ 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ ( Σ ∩ Ω ) ⎞ ⎟ ⎟ ⎠ = Λ ( 𝛼 ) Δ ( 𝛼 ) ( 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) ⎛ ⎜ ⎜ ⎝ 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ ( Σ ∩ Ω ) Λ Δ ⎞ ⎟ ⎟ ⎠ ≤ ⎛ ⎜ ⎜ ⎝ ( 𝛼 ) ( 𝑥 ) ( 𝛼 ) ( 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ Σ ⎞ ⎟ ⎟ ⎠ ⎛ ⎜ ⎜ ⎝ Λ ( 𝛼 ) ( 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ Ω ⎞ ⎟ ⎟ ⎠ = ⋀ Δ ( 𝛼 ) ( 𝑥 ) = 𝑓 ( ( Λ , Σ ) ) ( 𝛽 ) ( 𝑦 ) 𝑓 ( ( Δ , Ω ) ) ( 𝛽 ) ( 𝑦 ) , f o r 𝛽 = 𝑝 ( 𝛼 ) 𝑓 ( Λ , Σ ) 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) . ( 1 6 ) This gives ( 4 ).
( 5 ) Considering only the non-trivial case, for 𝛽 ∈ 𝐸 and 𝑦 ∈ 𝑌 , and since ( Λ , Σ ) ≤ ( Δ , Ω ) , we have 𝑓 ( ( Λ , Σ ) ) 𝛽 ( 𝑦 ) = 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) ⎛ ⎜ ⎜ ⎝ 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ Σ Λ ⎞ ⎟ ⎟ ⎠ = ( 𝛼 ) ( 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ Σ ≤ Λ ( 𝛼 ) ( 𝑥 ) 𝑥 ∈ 𝑢 − 1 ( 𝑦 ) 𝛼 ∈ 𝑝 − 1 ( 𝛽 ) ∩ Ω Δ ( 𝛼 ) ( 𝑥 ) = 𝑓 ( Δ , Ω ) ( 𝛽 ) ( 𝑦 ) . ( 1 7 ) This gives ( 5 ).

In Theorem 3.8, inequalities ( 2 ), ( 4 ) and implication ( 5 ) cannot be reversed, in general, as is shown in the following.

Example 3.9. Let ( 𝑋 , 𝐸 ) , ( 𝑌 , 𝐸 ) be classes of fuzzy soft sets and 𝑓 ∶ ( 𝑋 , 𝐸 ) → ( 𝑌 , 𝐸 ) as defined in Example 3.4. For ( 2 ), we define mappings 𝑢 ∶ 𝑋 → 𝑌 and 𝑝 ∶ 𝐸 → 𝐸 as 𝑝 𝑒 𝑢 ( 𝑎 ) = 𝑥 , 𝑢 ( 𝑏 ) = 𝑧 , 𝑢 ( 𝑐 ) = 𝑥 , 1 = 𝑒 2 𝑒 , 𝑝 2 = 𝑒 1 𝑒 , 𝑝 3 = 𝑒 2 𝑒 , 𝑝 4 = 𝑒 2 . ( 1 8 ) Then calculations give 𝑌 ≰ 𝑒 2 = 𝑥 1 , 𝑦 0 , 𝑧 1 , 𝑒 3 = 𝑥 0 , 𝑦 0 , 𝑧 0 , 𝑒 1 = 𝑥 1 , 𝑦 0 , 𝑧 1 𝑋 . = 𝑓 ( 1 9 ) For ( 4 ) and ( 5 ), define mappings 𝑢 ∶ 𝑋 → 𝑌 and 𝑝 ∶ 𝐸 → 𝐸 as 𝑝 𝑒 𝑢 ( 𝑎 ) = 𝑦 , 𝑢 ( 𝑏 ) = 𝑦 , 𝑢 ( 𝑐 ) = 𝑦 , 1 = 𝑒 3 𝑒 , 𝑝 2 = 𝑒 2 𝑒 , 𝑝 3 = 𝑒 2 𝑒 , 𝑝 4 = 𝑒 1 . ( 2 0 ) Choose two fuzzy soft sets in ( 𝑋 , 𝐸 ) as 𝑒 ( Λ , Σ ) = 3 = 𝑎 0 . 4 , 𝑏 0 . 8 , 𝑐 0 . 6 , ( 𝑒 Δ , Ω ) = 3 = 𝑎 0 . 6 , 𝑏 0 . 1 , 𝑐 1 . ( 2 1 ) Then calculations give ⋀ = 𝑒 𝑓 ( Λ , Σ ) 𝑓 ( Δ , Ω ) 1 = 𝑥 0 , 𝑦 0 , 𝑧 0 , 𝑒 2 = 𝑥 0 , 𝑦 0 . 8 , 𝑧 0 , 𝑒 3 = 𝑥 0 , 𝑦 0 , 𝑧 0 ≰ 𝑒 1 = 𝑥 0 , 𝑦 0 , 𝑧 0 , 𝑒 2 = 𝑥 0 , 𝑦 0 . 6 , 𝑧 0 , 𝑒 3 = 𝑥 0 , 𝑦 0 , 𝑧 0 ⋀ = 𝑓 ( Λ , Σ ) ( Δ , Ω ) ( 2 2 ) also we have = 𝑒 𝑓 ( Λ , Σ ) 1 = 𝑥 0 , 𝑦 0 , 𝑧 0 , 𝑒 2 = 𝑥 0 , 𝑦 0 . 8 , 𝑧 0 , 𝑒 3 = 𝑥 0 , 𝑦 0 , 𝑧 0 ≤ 𝑒 1 = 𝑥 0 , 𝑦 0 , 𝑧 0 , 𝑒 2 = 𝑥 0 , 𝑦 1 , 𝑧 0 , 𝑒 3 = 𝑥 0 , 𝑦 0 , 𝑧 0 = 𝑓 ( Δ , Ω ) ( 2 3 ) but ( Λ , Σ ) ≰ ( Δ , Ω ) .

Theorem 3.10. Let 𝑓 ∶ ( 𝑋 , 𝐸 ) → ( 𝑌 , 𝐸 ) , 𝑢 ∶ 𝑋 → 𝑌 and 𝑝 ∶ 𝐸 → 𝐸 be mappings. For fuzzy soft sets ( Λ , Σ ) , ( Δ , Ω ) and a family of fuzzy soft sets ( Λ 𝑖 , Σ 𝑖 ) in ( 𝑌 , 𝐸 ) , we have (1) 𝑓 − 1 ( Φ ) = Φ , (2) 𝑓 − 1 ( 𝑌 ) = 𝑋 , (3) 𝑓 − 1 ⋁ ( ( Λ , Σ ) ( Δ , Ω ) ) = 𝑓 − 1 ⋁ 𝑓 ( Λ , Σ ) − 1 ( Δ , Ω ) . In general, 𝑓 − 1 ( ⋁ 𝑖 ( Λ 𝑖 , Σ 𝑖 ⋁ ) ) = 𝑖 𝑓 − 1 ( Λ 𝑖 , Σ 𝑖 ) , (4) 𝑓 − 1 ⋀ ( ( Λ , Σ ) ( Δ , Ω ) ) = 𝑓 − 1 ⋀ 𝑓 ( Λ , Σ ) − 1 ( Δ , Ω ) . In general, 𝑓 − 1 ( ⋀ 𝑖 ( Λ 𝑖 , Σ 𝑖 ⋀ ) ) = 𝑖 𝑓 − 1 ( ( Λ 𝑖 , Σ 𝑖 ) ) , (5)If ( Λ , Σ ) ≤ ( Δ , Ω ) , then 𝑓 − 1 ( Λ , Σ ) ≤ 𝑓 − 1 ( Δ , Ω ) .

Proof. We only prove ( 3 )–( 5 ).
( 3 ) For 𝛼 ∈ 𝐸 and 𝑥 ∈ 𝑋 , we have 𝑓 − 1 ⋁ ( Λ , Σ ) ( Δ , Ω ) ( 𝛼 ) ( 𝑥 ) = 𝑓 − 1 = ⎛ ⎜ ⎜ ⎜ ⎝ ⎧ ⎪ ⎨ ⎪ ⎩ ⎞ ⎟ ⎟ ⎟ ⎠ . ( ( Θ , Σ ∪ Ω ) ) ( 𝛼 ) ( 𝑥 ) = Θ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) , ( 𝑝 ( 𝛼 ) ∈ Σ ∪ Ω , 𝑢 ( 𝑥 ) ∈ 𝑌 ) = Θ ( 𝛽 ) ( 𝑢 ( 𝑥 ) ) , w h e r e 𝛽 = 𝑝 ( 𝛼 ) Λ ( 𝛽 ) ( 𝑢 ( 𝑥 ) ) , 𝛽 ∈ Σ − Ω Δ ( 𝛽 ) ( 𝑢 ( 𝑥 ) ) , 𝛽 ∈ Ω − Σ ( Λ ( 𝛽 ) ∪ Δ ( 𝛽 ) ) ( 𝑢 ( 𝑥 ) ) , 𝛽 ∈ Σ ∩ Ω ( I ) Next, we use Definition 3.7 and get 𝑓 − 1 𝑓 ( Λ , Σ ) − 1 ( Δ , Ω ) ( 𝛼 ) ( 𝑥 ) = 𝑓 − 1 𝑓 ( Λ , Σ ) ( 𝛼 ) ( 𝑥 ) − 1 = ⎛ ⎜ ⎜ ⎜ ⎝ ⎧ ⎪ ⎨ ⎪ ⎩ ⎞ ⎟ ⎟ ⎟ ⎠ . ( ( Δ , Ω ) ) ( 𝛼 ) ( 𝑥 ) = Λ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) Δ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) , 𝛽 = 𝑝 ( 𝛼 ) ∈ Σ ∪ Ω Λ ( 𝛽 ) ( 𝑢 ( 𝑥 ) ) , 𝛽 ∈ Σ − Ω Δ ( 𝛽 ) ( 𝑢 ( 𝑥 ) ) , 𝛽 ∈ Ω − Σ ( Λ ( 𝛽 ) ∪ Δ ( 𝛽 ) ) ( 𝑢 ( 𝑥 ) ) , 𝛽 ∈ Σ ∩ Ω ( I I ) From (I) and (II), we get ( 3 ).
(4) For 𝛼 ∈ 𝐸 , 𝑥 ∈ 𝑋 and using Definition 3.7, we have 𝑓 − 1 ⋀ ( Λ , Σ ) ( Δ , Ω ) ( 𝛼 ) ( 𝑥 ) = 𝑓 − 1 ( ( Θ , Σ ∩ Ω ) ) ( 𝛼 ) ( 𝑥 ) = Θ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) , 𝑝 ( 𝛼 ) ∈ Σ ∪ Ω = Θ ( 𝛽 ) ( 𝑢 ( 𝑥 ) ) , 𝛽 = 𝑝 ( 𝛼 ) = ( Λ ( 𝛽 ) ∧ Δ ( 𝛽 ) ) ( 𝑢 ( 𝑥 ) ) = Λ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) ∧ Δ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) = 𝑓 − 1 ( Λ , Σ ) ( 𝛼 ) ( 𝑥 ) ∧ 𝑓 − 1 = 𝑓 ( Δ , Ω ) ( 𝛼 ) ( 𝑥 ) − 1 ⋀ 𝑓 ( Λ , Σ ) − 1 ( Δ , Ω ) ( 𝛼 ) ( 𝑥 ) . ( 2 4 ) This gives ( 4 ).
( 5 ) Since ( Λ , Σ ) ≤ ( Δ , Ω ) , we have 𝑓 − 1 ( ( Λ , Σ ) ) ( 𝛼 ) ( 𝑥 ) = Λ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) = Λ ( 𝛽 ) ( 𝑢 ( 𝑥 ) ) , 𝑝 ( 𝛼 ) = 𝛽 ≤ Δ ( 𝛽 ) ( 𝑢 ( 𝑥 ) ) = Δ ( 𝑝 ( 𝛼 ) ) ( 𝑢 ( 𝑥 ) ) = 𝑓 − 1 ( ( Δ , Ω ) ) ( 𝛼 ) ( 𝑥 ) . ( 2 5 )

The implication in ( 5 ) is not reversible, in general, as is shown in the following.

Example 3.11. Let ( 𝑋 , 𝐸 ) , ( 𝑌 , 𝐸 ) be classes of fuzzy soft sets and 𝑓 ∶ ( 𝑋 , 𝐸 ) → ( 𝑌 , 𝐸 ) as defined in Example 3.4. For ( 5 ) define mappings 𝑢 ∶ 𝑋 → 𝑌 and 𝑝 ∶ 𝐸 → 𝐸 as 𝑝 𝑒 𝑢 ( 𝑎 ) = 𝑦 , 𝑢 ( 𝑏 ) = 𝑦 , 𝑢 ( 𝑐 ) = 𝑧 , 1 = 𝑒 1 𝑒 , 𝑝 2 = 𝑒 2 𝑒 , 𝑝 3 = 𝑒 2 𝑒 , 𝑝 4 = 𝑒 1 . ( 2 6 ) Choose two fuzzy soft sets in ( 𝑌 , 𝐸 ) as