Skip to main content
The Scientific World Journal logoLink to The Scientific World Journal
. 2014 Apr 28;2014:164176. doi: 10.1155/2014/164176

On Topological Structures of Fuzzy Parametrized Soft Sets

Serkan Atmaca 1,*, İdris Zorlutuna 1
PMCID: PMC4032704  PMID: 24955386

Abstract

We introduce the topological structure of fuzzy parametrized soft sets and fuzzy parametrized soft mappings. We define the notion of quasi-coincidence for fuzzy parametrized soft sets and investigated its basic properties. We study the closure, interior, base, continuity, and compactness and properties of these concepts in fuzzy parametrized soft topological spaces.

1. Introduction

In 1965, after Zadeh [1] generalized the usual notion of a set with the introduction of fuzzy set, the fuzzy set was carried out in the areas of general theories and applied to many real life problems in uncertain, ambiguous environment. In this manner, in 1968, Chang [2] gave the definition of fuzzy topology and introduced the many topological notions in fuzzy setting.

In 1999, Molodtsov [3] introduced the concept of soft set theory which is a completely new approach for modelling uncertainty and pointed out several directions for the applications of soft sets, such as game theory, perron integrations, and smoothness of functions. To improve this concept, many researchers applied this concept on topological spaces (e.g., [49]), group theory, ring theory (e.g., [1014]), and also decision making problems (e.g., [1518]).

Recently, researchers have combined fuzzy set and soft set to generalize the spaces and to solve more complicated problems. By this way, many interesting applications of soft set theory have been expanded. First combination of fuzzy set and soft set is fuzzy soft set and it was given by Maji et al. [19]. Then fuzzy soft set theory has been applied in several directions, such as topology (e.g., [2023]), various algebraic structures (e.g., [24, 25]), and especially decision making (e.g., [2629]). Another combination of fuzzy set and soft set was given by Çag˘man et al. [30] who called it fuzzy parametrized soft set (for short FP-soft set). In that paper, Çag˘man et al. defined operations on FP-soft sets and improved several results. After that, Çag˘man and Deli [31, 32] applied FP-soft sets to define some decision making methods and applied these methods to problems that contain uncertainties and fuzzy object.

In the present paper, we consider the topological structure of FP-soft sets. Firstly, we give some basic ideas of FP-soft sets and also studied results. We define FP-soft quasi-coincidence, as a generalization of quasi-coincidence in fuzzy manner [33], and use this notion to characterize concepts of FP-soft closure and FP-soft base in FP-soft topological spaces. We also introduce the notion of mapping on FP-soft classes and investigate the properties of FP-soft images and FP-soft inverse images of FP-soft sets. We define FP-soft topology in Chang's sense. We study the FP-soft closure and FP-soft interior operators and properties of these concepts. Lastly we define FP-soft continuous mappings and we show that image of a FP-soft compact space is also FP-soft compact.

2. Preliminaries

Throughout this paper X denotes initial universe, E denotes the set of all possible parameters which are attributes, characteristic, or properties of the objects in X, and the set of all subsets of X will be denoted by P(X).

Definition 1 (see [1]) —

A fuzzy set A in X is a function defined as follows:

A={μA(x)x:xX}, (1)

where μ A : X → [0,1].

Here μ A is called the membership function of A, and the value μ A(x) is called the grade of membership of xX. This value represents the degree of x belonging to the fuzzy set A.

A fuzzy point in X, whose value is α  (0 < α ≤ 1) at the support xX, is denoted by x α. A fuzzy point x αA, where A is fuzzy set in X if αμ A(x).

Definition 2 (see [3]) —

A pair (F, E) is called a soft set over X if F is a mapping defined by F : EP(X).

In other words, a soft set is a parametrized family of subsets of the set X. Each set F(e), eE, from this family may be considered as the set of e-elements of the soft set (F, E).

Definition 3 (see [30]) —

Let A be a fuzzy set over E. A FP-soft set F A on the universe X is defined as follows:

FA={(μA(e)e,fA(e)):eE,fA(e)P(X),μA(e)[0,1]}, (2)

where the function f A : EP(X) is called approximate function such that f A(e) = if μ A(e) = 0, and the function μ A : E → [0,1] is called membership function of the set A.

From now on, the set of all FP-soft sets over X will be denoted by FPS(X, E).

Definition 4 (see [30]) —

Let F A ∈ FPS(X, E).

  1. F A is called the empty FP-soft set if μ A(e) = 0 for every eE, denoted by F .

  2. F A is called A-universal FP-soft set if μ A(e) = 1 and f A(e) = X for all eA, denoted by FA~.

  3. If A = E, then A-universal FP-soft set is called universal FP-soft set, denoted by FE~.

Definition 5 (see [30]) —

Let F A, F B ∈ FPS(X, E).

  1. F A is called a FP-soft subset of F B if AB and f A(e)⊆f B(e) for every eE and one writes FA~FB.

  2. F A and F B are said to be equal, denoted by F A = F B if FA~FB and FB~FA.

  3. The union of F A and F B, denoted by FA~FB, is the FP-soft set, defined by the membership and approximate functions μ AB(e) = max⁡{μ A(e), μ B(e)} and f AB(e) = f A(e) ∪ g B(e) for every eE, respectively.

  4. The intersection of F A and F B, denoted by FA~GB, is the FP-soft set, defined by the membership and approximate functions μ AB(e) = min⁡{μ A(e), μ B(e)} and f AB(e) = f A(e)∩g B(e) for every eE, respectively.

Definition 6 (see [30]) —

Let F A ∈ FPS(X, E). Then the complement of F A, denoted by F A c, is the FP-soft set, defined by the membership and approximate functions μ Ac(e) = 1 − μ A(e) and f A c(e) = Xf A(e) for every eE, respectively.

Clearly (F A c)c = F A, FE~c=F, and Fc=FE~.

Proposition 7 (see [30]) —

Let F A, F B, and F CFPS(X, E). Then

  1. (FA~FB)c=FAc~FBc ;

  2. (FA~FB)c=FAc~FBc ;

  3. FA~FA=FA, FA~FA=FA ;

  4. FA~F=F, FA~FE~=FA ;

  5. FA~FB=FB~FA, FA~FB=FB~FA ;

  6. FA~(FB~FC)= (FA~FB)~FC, FA~(FB~FC)= (FA~FB)~FC ;

  7. FA~F=FA, FA~FE~=FE~.

3. Some Properties of FP-Soft Sets and FP-Soft Mappings

Definition 8 —

Let J be an arbitrary index set and F AiFPS(X, E) for all iJ.

  1. The union of F Ai's, denoted by ~iJFAi, is the FP-soft set, defined by the membership and approximate functions μ iJAi(e) = sup⁡iJ⁡{μ Ai(e)} and f iJAi(e) = ∪iJ f Ai(e) for every eE, respectively.

  2. The intersection of F Ai's, denoted by ~iJFAi, is the FP-soft set, defined by the membership and approximate functions μ iJAi(e) = inf⁡iJ⁡{μ Ai(e)} and f iJAi(e) = ∩iJ f Ai(e) for every eE, respectively.

Proposition 9 —

Let J be an arbitrary index set and F Ai ∈ FPS(X, E) for all iJ. Then

  1. (~iJFAi)c=~iJFAic ;

  2. (~iJFAi)c=~iJFAic.

Proof —

(1) Put FB=(~iJFAi)c and FC=~iJFAic. Then for all eE,

μB(e)=1μiJAi(e)=1supiJ{μAi(e)}=infiJ{1μAi(e)}=infiJ{μAic(e)}=μC(e),fB(e)=XfiJAi(e)=XiJfAi(e)=iJ(XfAi(e))=iJfAic(e)=fiJAic(e)=fC(e). (3)

This completes the proof. The other can be proved similarly.

Definition 10 —

The FP-soft set F A ∈ FPS(X, E) is called FP-soft point if A is fuzzy singleton and f A(e) ∈ P(X) for e ∈ supp⁡A. If A = {e}, μ A(e) = α ∈ (0,1], then one denotes this FP-soft point by e α f.

Definition 11 —

Let e α f, F A ∈ FPS(X, E). One says that eαf~FA read as e α f belongs to the FP-soft set F A if αμ A(e) and f(e)⊆f A(e).

Proposition 12 —

Every nonempty FP-soft set F A can be expressed as the union of all the FP-soft points which belong to F A.

Proof —

This follows from the fact that any fuzzy set is the union of fuzzy points which belong to it [33].

Definition 13 —

Let F A,  F B ∈ FPS(X, E). F A is said to be FP-soft quasi-coincident with F B, denoted by F A qF B, if there exists eE such that μ A(e) + μ B(e) > 1 or f A(e) is not subset of f B c(e). If F A is not FP-soft quasi-coincident with F B, then one writes FAq¯FB.

Definition 14 —

Let e α f,  F A ∈ FPS(X, E). e α f is said to be FP-soft quasi-coincident with F A, denoted by e α f qF A, if α + μ A(e) > 1 or f(e) is not subset of f A c(e). If e α f is not FP-soft quasi-coincident with F A, then one writes eαfq¯FA.

Proposition 15 —

Let F A, F B ∈ FPS(X, E). Then the following are true: 

  1. FA~FBFAq¯FBc ;

  2. FAqFBFA~FBF.

  3. FAq¯FAc ;

  4. F A qF B there exists an eαf~FA such that e α f qF B ;

  5. eαf~FAceαfq¯FA ;

  6. FA~FB if e α f qF A , then e α f qF B for all e α fFPS(X, E);

Proof —

(1) Consider

FA~FBeE,μA(e)μB(e),fA(e)fB(e)eE,μA(e)μB(e)0,fA(e)fB(e)eE,μA(e)+1μB(e)1,fA(e)fB(e)FAq¯FBc. (4)

(2) Let F A qF B. Then there exists an eE such that μ A(e) + μ B(e) > 1 or f A(e) is not subset of f B c(e). If μ A(e) + μ B(e) > 1, AB ≠ 0E and the proof is easy. If f A(e) is not subset of f B c(e), then f A(e)∩f B(e) ≠ . Hence FA~FBF.

(3) Suppose F A qF A c. Then there exists eE such that μ A(e) + μ Ac(e) > 1 or f A(e) is not subset of (f A c(e))c. But this is impossible.

(4) If F A qF B, then there exists an eE such that μ A(e) + μ B(e) > 1 or f A(e) is not subset of f B c(e). Put α = μ A(e) and f(e) = f A(e). Then we have eαf~FA and e α f qF B.

Conversely, suppose e α f qF B for some eαf~FA. Then α + μ B(e) > 1 or f(e) is not subset of f B c(e). Therefore, we have μ A(e) + μ B(e) > 1 or f A(e) is not subset of f B c(e) for eE. This shows F A qF B.

(5) It is obvious from (1).

(6) Let e α f, F AFPS(X, E) and e α f qF A. Then α + μ A(e) > 1 or f(e) is not subset of f A c(e). Since FA~FB, α + μ B(e) > 1 or f(e) is not subset of f B c(e). Hence we have e α f qF B.

Proposition 16 —

Let {F Ai : iJ} be a family of FP-soft sets in FPS(X, E), where J is an index set. Then e α f is FP-soft quasi-coincident with ~iJFAi if and only if there exists some F Ai ∈ {F Ai : iJ} such that e α f qF Ai.

Proof —

Obvious.

Definition 17 —

Let FPS(X, E) and FPS(Y, K) be families of all FP-soft sets over X and Y, respectively. Let u : XY and p : EK be two functions. Then a FP-soft mapping f up : FPS(X, E) → FPS(Y, K) is defined as follows.

  • (1)
    For F A ∈ FPS(X, E), the image of F A under the FP-soft mapping f up is the FP-soft set G S over Y defined by the approximate function, ∀kK,
    gS(k)={ep1(k)u(fA(e)),ifp1(k);,otherwise, (5)

where p(A) = S is fuzzy set in K.

  • (2)
    For G S ∈ FPS(Y, K), then the preimage of G S under the FP-soft mapping f up is the FP-soft set F A over X defined by the approximate function,  ∀eE,
    fA(e)=u1(gS(p(e))), (6)

where p −1(S) = A is fuzzy set in E.

If u and p are injective, then the FP-soft mapping f up is said to be injective. If u and p are surjective, then the FP-soft mapping f up is said to be surjective. The FP-soft mapping f up is called constant, if u and p are constant.

Theorem 18 —

Let X and Y be crips sets F A, F AiFPS(X, E), G S, G SiFPS(Y, K)  ∀iJ, where J is an index set. Let f up : FPS(X, E) → FPS(Y, K) be a FP-soft mapping. Then,

  1. if  FA1~FA2 then fup(FA1)~fup(FA2);

  2. if GS1~GS2 then fup-1(GS1)~fup-1(GS2);

  3. FA~fup-1(fup(FA)); the equality holds if f up is injective;

  4. fup(fup-1(GS))~GS; the equality holds if f up is surjective;

  5. fup(~iJFAi)=~iJfup(FAi);

  6. fup(~iJFAi)~~iJfup(FAi); the equality holds if f up is injective;

  7. fup-1(~iJGSi)=~iJfup-1(GSi);

  8. fup-1(~iJGSi)=~iJfup-1(GSi);

  9. (f up −1(G S))c = f up −1(G S c);

  10. (fup(FA))c~fup(FAc);

  11. fup-1(GK~)=FE~;

  12. f up −1(G ) = F ;

  13. fup(FE~)~GK~; the equality holds if f up is surjective;

  14. f up(F ) = G .

Proof —

We only prove (3), (5), (7), (9), (11), and (12). The others can be proved similarly.

(3) Put G S = f up(F A) and F B = f up −1(G S). Since Ap −1(p(A)) = p −1(S) = B, it is sufficient to show that f A(e)⊆f B(e) for all eE,

fB(e)=u1(gS(p(e)))=u1(ep1(p(e))u(fA(e)))=ep1(p(e))u1(u(fA(e)))fA(e). (7)

This completes the proof.

(5) Put G Si = f up(F Ai) and GS=fup(~iJ(FAi)). Then S = p(∨A i) = ∨p(A i) = ∨S i and for all kK,

gS(k)={ep1(k)u(iJfAi(e))ifp1(k);otherwise={ep1(k)iJu(fAi(e))ifp1(k);otherwise={iJep1(k)u(fAi(e))ifp1(k);otherwise=iJ{ep1(k)u(fAi(e))ifp1(k);otherwise=iJgSi(k). (8)

This completes the proof.

(7) Put F Ai = f up −1(G Si) and FA=fup-1(~iJGSi). Then A = p −1(∨S i) = ∨p −1(S i) = ∨A i and for all eE,

fA(e)=u1(iIgSi(p(e)))=iIu1(gSi(p(e)))=iJfAi(e). (9)

This completes the proof.

(9) Put f up −1(G S) = F A and f up −1(G S c) = F B. Then for all eE,

fB(e)=fp1(Sc)(e)=f(p1(S))c(e)=fAc(e), (10)

where p −1(S) and p −1(S c) are fuzzy sets over E. This shows that the approximate functions of F B and F A c are equal. This completes the proof.

(11) Put FA=fup-1(GK~). Then for all eE,

fA(e)=u1(GK~(p(e)))=u1(Y)=X=fE(e). (11)

This shows that FA=FE~.

(12) Since p −1(K) is fuzzy empty set, that is, 0E, the proof is clear.

4. FP-Soft Topological Spaces

Definition 19 —

A FP-soft topological space is a pair (X, τ), where X is a nonempty set and τ is a family of FP-soft sets over X satisfying the following properties:

  • (T1)

    F,FE~τ;

  • (T2)

    if F A, F Bτ, then FA~FBτ;

  • (T3)

    if F Aiτ, ∀iJ, then ~iJFAiτ.

τ is called a topology of FP-soft sets on X. Every member of τ is called FP-soft open in (X, τ). F B is called FP-soft closed in (X, τ) if F B cτ.

Example 20 —

τindiscrete={F,FE~} is a FP-soft topology on X.

τ discrete = FPS(X, E) is a FP-soft topology on X.

Example 21 —

Assume that X = {x 1, x 2, x 3, x 4} is a universal set and E = {e 1, e 2, e 3} is a set of parameters. If

FA1={((e1)0,2,{x1,x3}),((e2)0,3,{x1,x4}),((e3)0,4,{x2})},FA2={((e1)0,2,{x1,x2,x3}),((e2)0,5,{x1,x4}),((e3)0,4,{x1,x2})},FA3={((e1)0,7,{x1,x3}),((e2)0,3,X),((e3)0,9,{x2,x3})},FA4={((e1)0,7,{x1,x2,x3}),((e2)0,5,X),((e3)0,9,{x2,x3})}, (12)

then τ={F,FA1,FA2,FA3,FA4,FE~} is a FP-soft topology on X.

Theorem 22 —

Let (X, τ) be a FP-soft topological space and let τ′ denote family of all closed sets. Then,

  1. F,FE~τ;

  2. if F A, F Bτ′, then FA~FBτ;

  3. if F Aiτ′, ∀iJ, then ~iJFAiτ.

Proof —

Straightforward.

Definition 23 —

Let (X, τ) be a FP-soft topological space and F A ∈ FPS(X, E). The FP-soft closure of F A in (X, τ), denoted by FA¯, is the intersection of all FP-soft closed supersets of F A.

Clearly, FA¯ is the smallest FP-soft closed set over X which contains F A, and FA¯ is closed.

Theorem 24 —

Let (X, τ) be a FP-soft topological space and F A, F BFPS(X, E). Then,

  1. F¯=F and FE~¯=FE~;

  2. FA~FA¯;

  3. FA¯¯=FA¯;

  4. if FA~FB, then FA¯~FB¯;

  5. F A is a FP-soft closed set if and only if FA=FA¯;

  6. FA~FB¯=FA¯~FB¯.

Proof —

(1), (2), (3), and (4) are obvious from the definition of FP-soft closure.

(5) Let F A be a FP-soft closed set. Since FA¯ is the smallest FP-soft closed set which contains F A, then FA¯~FA. Therefore, FA=FA¯.

(6) Since FA~FA~FB and FB~FA~FB, then, by (4), FA¯~FA~FB¯, FB¯~FA~FB¯, and hence FA¯~FB¯~FA~FB¯.

Conversely, since FA¯ and FB¯ are FP-soft closed sets, FA¯~FB¯ is a FP-soft closed set. Again since FA~FB~FA¯~FB¯, by (4), then FA~FB¯~FA¯~FB¯.

Definition 25 —

Let (X, τ) be a FP-soft topological space. A FP-soft set F A in FPS(X, E) is called FP-Q-neighborhood (briefly, FP-Q-nbd) of a FP-soft set F B if there exists a FP-soft open set F C in τ such that F B qF C and FC~FA.

Theorem 26 —

Let e α f, F AFPS(X, E). Then eαf~FA¯ if and only if each FP-Q-nbd of e α f is FP-soft quasi-coincident with F A.

Proof —

Let eαf~FA¯. Suppose that F C is a FP-Q-nbd of e α f and FCq¯FA. Then there exists a FP-soft open set F B such that eαfqFB~FC. Since FCq¯FA, by Proposition 15(1), FA~FCc~FBc. Again since e α f qF B, e α f does not belong to F B c. This is a contradiction with FA¯~FBc.

Conversely, let each Q-nbd of e α f be FP-soft quasi-coincident with F A. Suppose that e α f does not belong to FA¯. Then there exists a FP-soft closed set F B which is containing F A such that e α f does not belong to F B. By Proposition 15(5), we have e α f qF B c. Then F B c is a FP-Q-nbd of e α f and, by Proposition 15(1), FAq¯FBc. This is a contradiction with the hypothesis.

Definition 27 —

Let (X, τ) be a FP-soft topological space and F A ∈ FPS(X, E). The FP-soft interior of F A denoted by F A° is the union of all FP-soft open subsets of F A.

Clearly, F A° is the largest fuzzy soft open set contained in F A, and F A° is FP-soft open.

Theorem 28 —

Let (X, τ) be a FP-soft topological space and F A, F BFPS(X, E). Then,

  1. (F )° = F and (FE~)°=FE~;

  2. FA°~FA;

  3. (F A°)° = F A°;

  4. if FA~FB, then FA°~FB°;

  5. F A is a FP-soft open set if and only if F A = F A°;

  6. (FA~FB)°=FA°~FB°.

Proof —

Similar to that of Theorem 24.

Theorem 29 —

Let (X, τ) be a FP-soft topological space and F AFPS(X, E). Then,

  1. (FA°)c=FAc¯;

  2. (FA¯)c=(FAc)°.

Proof —

We only prove (1). The other is similar. Consider

(FA°)c=(~{FBFBτ,FA~FB})c=~{FBcFBτ,FA~FB}=~{FBcFBcτ,FBc~FAc}=FAc¯. (13)

Theorem 30 —

Let c : FPS(X, E) → FPS(X, E) be an operator satisfying the following:

  • (c1)

    c(F ) = F ;

  • (c2)

    FA~c(FA),FAFPS(X,E);

  • (c3)

    c(FA~FB)=c(FA)~c(FB),FA,FBFPS(X,E);

  • (c4)

    c(c(F A)) = c(F A), ∀F AFPS(X, E).

Then one can associate FP-soft topology in the following way:

τ={FAcFPS(X,E)c(FA)=FA}. (14)

Moreover with this FP-soft topology τ, FA¯=c(FA) for every F AFPS(X, E).

Proof —

(T1) By (c1), Fc=FE~τ. By (c2) FE~~c(FE~), so c(FE~)=FE~ and F τ.

(T2) Let F A, F Bτ. By the definition of τ, c(F A c) = F A c and c(F B c) = F B c. By (c3), c((FA~FB)c)=c(FAc~FBc)=c(FAc)~c(FBc)=FAc~FBc=(FA~FB)c. So FA~FBτ.

(T3) Let {F Ai | iJ} ⊂ τ. Since c is order preserving and ~iJFAic~FAkc,∀kJ, then c(~iJFAic)~c(FAkc)=FAkc. Then we have c(~iJFAic)~~iJFAic. Conversely, by (c2) we have ~iJFAic~c(~iJFAic). Hence, c((~iJFAi)c)=c(~iJFAic)=~iJFAic=(~iJFAi)c and ~iJFAiτ.

Now we will show that with this FP-soft topology τ, FA¯=c(FA) for every F A ∈ FPS(X, E). Let F A ∈ FPS(X, E). Since (FA¯)cτ, then c(FA¯)=FA¯. Since c is order preserving, c(FA)~c(FA¯)=FA¯. Conversely, by (c4) we have (c(F A))cτ. Then since FA~c(FA) and FA¯ is the smallest FP-soft closed set over X which contains F A, FA¯~c(FA).

The operator c is called the FP-soft closure operator.

Remark 31 —

By Theorem 24(1), (2), (3), and (6) and Theorem 30, we see that with a FP-soft closure operator we can associate a FP-soft topology and conversely with a given FP-soft topology we can associate a FP-soft closure operator.

Theorem 32 —

Let i : FPS(X, E) → FPS(X, E) be an operator satisfying the following:

  • (i1)

    i(FE~)=FE~;

  • (i2)

    i(FA)~FA, ∀F AFPS(X, E);

  • (i3)

    i(FA~FB)=i(FA)~i(FB), ∀F A, F BFPS(X, E);

  • (i4)

    i(i(F A)) = i(F A), ∀F AFPS(X, E).

Then one can associate a FP-soft topology in the following way:

τ={FAFPS(X,E)i(FA)=FA}. (15)

Moreover, with this fuzzy soft topology τ, (F A)° = i(F A) for every F AFPS(X, E).

Proof —

Similar to that of Theorem 30.

The operator i is called the FP-soft interior operator.

Remark 33 —

By Theorem 28(1), (2), (3), and (6) and Theorem 32, we see that with a FP-soft interior operator we can associate a FP-soft topology and conversely with a given FP-soft topology we can associate a FP-soft interior operator.

Definition 34 —

Let (X, τ) be a FP-soft topological space. A subcollection B of τ is called a base for τ if every member of τ can be expressed as a union of members of B.

Example 35 —

If we consider the FP-soft topology τ in Example 21, then one easily sees that the family B={F,FA1,FA2,FA3,FE~} is a basis for τ.

Proposition 36 —

Let (X, τ) be a FP-soft topological space and B is subfamily of τ. B is a base for τ if and only if for each e α f in FPS(X, E) and for each FP-soft open Q-nbd F A of e α f, there exists a F BB such that eαfqFB~FA.

Proof —

Let B be a base for τ, eαf~FPS(X,E) and let F A be a FP-soft open Q-nbd of e α f. Then there exists a subfamily B′ of B such that FA=~{FBFBB}. Suppose that eαfq¯FB for all F BB′. Then α + μ B(e) ≤ 1 and f(e)⊆f B c(e) for every F BB′. Therefore, we have α + μ A(e) ≤ 1 and f(e) is not subset of f A(e) since μ A(e) = sup⁡{μ B(e) | F BB′} and f A(e) = ∪f B(e). This is a contradiction.

Conversely, if B is not a base for τ, then there exists a F Aτ such that FC=~{FBB:FB~FA}FA. Since F CF A, there exists eE such that μ C(e) < μ A(e) or f C(e) ⊂ f A(e). Put α = 1 − μ C(e) and f(e) = f C c(e). Then in both cases, we obtain e α f qF A and eαfq¯FC. Therefore, we have μ B(e) + αμ C(e) + α = 1 and f(e)∩f B(e)⊆f(e)∩f C(e) = , that is, eαfq¯FB for all F BB which is contained in F A. This is a contradiction.

Definition 37 —

Let (X, τ 1) and (Y, τ 2) be two FP-soft topological spaces. A FP-soft mapping f up : (X, τ 1)→(Y, τ 2) is called FP-soft continuous if f up −1(G S) ∈ τ 1, ∀G Sτ 2.

Example 38 —

Assume that X = {x 1, x 2, x 3}, Y = {y 1, y 2, y 3} are two universal sets, E = {e 1, e 2}, K = {k 1, k 2} are two parameter sets, and f up : (X, τ 1)→(Y, τ 2) is a FP-soft mapping, where u(x 1) = y 2, u(x 2) = y 1, u(x 3) = y 3, and p(e 1) = k 2 and p(e 2) = k 1. If we take F A = {((e 1)0,3, {x 2, x 3}), ((e 2)0,2, {x 1, x 2})}, G S = {((k 1)0,2, {y 1, y 2}), ((k 2)0,3, {y 1, y 3})}, τ 1 = {F,FE~,FA}, and τ 2 = {0~K,1~K,GS}, then f up is a FP-soft continuous mapping.

The constant mapping f up : (X, τ 1)→(Y, τ 2) is not continuous in general.

Example 39 —

Assume that X = {x 1, x 2, x 3}, Y = {y 1, y 2} are two universal sets, E = {e 1, e 2}, K = {k 1, k 2} are two parameter sets, and f up : (X, τ 1)→(Y, τ 2) is a constant FP-soft mapping, where u(x 1) = u(x 2) = u(x 3) = y 2 and p(e 1) = p(e 2) = k 1. If we take G S = {((k 1)0,2, {y 1, y 2}), ((k 2)0,5, {y 2, y 3})}, τ 1 = {F,FE~}, and τ 2 = {F,FK~,GS}, f up is not a FP-soft continuous since f up −1(G S) ∉ τ 1.

Let α ∈ [0,1]. We denote by α E the constant fuzzy set on E; that is, μ αE(e) = α for all eE and α ∈ [0,1].

Definition 40 —

Let F A ∈ FPS(X, E). F A is called α-A-universal FP-soft set if μ A(e) = α and f A(e) = X for all eA, denoted by Fα~A.

Definition 41 (see [21]) —

A FP-soft topology is called enriched if it satisfies Fα~Aτ and Fα~Acτ for all α ∈ (0,1].

Theorem 42 —

Let (X, τ 1) be an enriched FP-soft topological space, (Y, τ 2) a FP-soft topological space, and f up : FPS(X, E) → FPS(Y, K) a constant FP-soft mapping. Then f up is FP-soft continuous.

Proof —

Let G Sτ 2. Put f up −1(G S) = F A. Then A = p −1(S) = α E, where α = sup⁡kK{μ S(k)} and

fA(e)=u1(gS(p(e)))={X,gS(p(e)),otherwise (16)

for all eE. Hence FA=Fα~Eτ1 or FA=Fα~Ecτ1 and so f up : (X, τ 1)→(Y, τ 2) is FP-soft continuous.

Theorem 43 —

Let (X, τ 1) and (Y, τ 2) be two FP-soft topological spaces and let f up : FPS(X, E) → FPS(Y, K) be a FP-soft mapping. Then the following are equivalent:    

  1. f up is FP-soft continuous;

  2. f up −1(G S) is FP-soft closed for every FP-closed set G S over Y;

  3. fup(FA¯)~fup(FA)¯, ∀F AFPS(X, E);

  4. fup-1(GS)¯~fup-1(GS¯), ∀G SFPS(Y, K);

  5. fup-1(GS°)~(fup-1(GS))°, ∀G SFPS(Y, K).

Proof —

(1)⇒(2) It is obvious from Theorem 18(9).

(2)⇒(3) Let F A ∈ FPS(X, E). Since FA~fup-1(fup(FA))FA~fup-1(fup(FA)¯)τ1, therefore we have FA¯~fup-1(fup(FA)¯). By Theorem 18(4), we get fup(FA¯)~ fup(fup-1(fup(FA)¯)~fup(FA)¯.

(3)⇒(4) Let G S ∈ FPS(Y, K). If we choose f up −1(G S) instead of F A in (3), then fup(fup-1(GS)¯)~fup(fup-1(GS))¯~GS¯. Hence by Theorem 18(3), fup-1(GS)¯~fup-1(fup(fup-1(GS)¯)) ~fup-1(GS¯).

(4)⇔(5) These follow from Theorem 18(9) and Theorem 29.

(5)⇒(1) Let G Sτ 2. Since G S is a FP-soft open set, then fup-1(GS)=fup-1(GS°)~(fup-1(GS))°~fup-1(GS). Consequently, f up −1(G S) is a FP-soft open and so f up is FP-soft continuous.

Theorem 44 —

Let f up:(X, τ 1)→(Y, τ 2) be a FP-soft mapping and let B be a base for τ 2. Then f up is FP-soft continuous if and only if f up −1(G S) ∈ τ 1, ∀G SB.

Proof —

Straightforward.

Definition 45 —

A family C of FP-soft sets is a cover of a FP-soft set F A if FA~~{FAi:FAiC,iJ}. It is a FP-soft open cover if each member of C is a FP-soft open set. A subcover of C is a subfamily of C which is also a cover.

Definition 46 —

A family C of FP-soft sets has the finite intersection property if the intersection of the members of each finite subfamily of C is not empty FP-soft set.

Definition 47 —

A FP-soft topological space (X, τ) is FP-compact if each FP-soft open cover of FE~ has a finite subcover.

Example 48 —

Let X = {x 1, x 2,…}, E = {e 1, e 2,…}, and F An = {((e i)1/n, X − {x 1, x 2,…, x n}) : i = 1,2,…}. Then τ={FAn:n=1,2,}{F,FE~} is a FP-soft topology on X, and (X, τ) is FP-compact.

Theorem 49 —

A FP-soft topological space is FP-soft compact if and only if each family of FP-soft closed sets with the finite intersection property has a nonempty FP-soft intersection.

Proof —

If C is a family of FP-soft sets in a FP-soft topological space (X, τ), then C is a cover of FE~ if and only if one of the following conditions hold:

  1. ~{FAi:FAiC,iJ}= FE~;

  2. (~{FAi:FAiC,iJ})c= FE~c=F;

  3. ~{FAic:FAiC,iJ}=F.

Hence the FP-soft topological space is FP-soft compact if and only if each family of FP-soft open sets over X such that no finite subfamily covers FE~ fails to be a cover, and this is true if and only if each family of FP-soft closed sets which has the finite intersection property has a nonempty FP-soft intersection.

Theorem 50 —

Let (X, τ 1) and (Y, τ 2) be FP-soft topological spaces and let f up : FPS(X, E) → FPS(Y, K) be a FP-soft mapping. If (X, τ 1) is FP-soft compact and f up is FP-soft continuous surjection, then (Y, τ 2) is FP-soft compact.

Proof —

Let C = {G Si : iJ} be a cover of GK~ by FP-soft open sets. Then since f up is FP-soft continuous, the family of all FP-soft sets of the form f up −1(G S), for G SC, is a FP-soft open cover of FE~ which has a finite subcover. However, since f up is surjective, then f up(f up −1(G S)) = G S for any FP-soft set G S over Y. Thus, the family of images of members of the subcover is a finite subfamily of C which covers GK~. Consequently, (Y, τ 2) is FP-soft compact.

5. Conclusion

Topology is a branch of mathematics, whose concepts exist not only in almost all branches of mathematics, but also in many real life applications. In this paper, we introduce the topological structure of fuzzy parametrized soft sets and fuzzy parametrized soft mappings. We study some fundamental concepts in fuzzy parametrized soft topological spaces such as closures, interiors, bases, compactness, and continuity. Some basic properties of these concepts are also presented. This paper will form the basis for further applications of topology.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  • 1.Zadeh LA. Fuzzy sets. Information and Control. 1965;8(3):338–353. [Google Scholar]
  • 2.Chang CL. Fuzzy topological spaces. Journal of Mathematical Analysis and Applications. 1968;24(1):182–190. [Google Scholar]
  • 3.Molodtsov D. Soft set theory—first results. Computers and Mathematics with Applications. 1999;37(4-5):19–31. [Google Scholar]
  • 4.Çağman N, Karataş S, Enginoglu S. Soft topology. Computers and Mathematics with Applications. 2011;62(1):351–358. [Google Scholar]
  • 5.Chen B. Soft semi-open sets and related properties in soft topological spaces. Applied Mathematics and Information Sciences. 2013;7(1):287–294. [Google Scholar]
  • 6.Chen B. Some local properties of soft semi-open sets. Discrete Dynamics in Nature and Society. 2013;2013:6 pages.298032 [Google Scholar]
  • 7.Georgiou DN, Megaritis AC, Petropoulos VI. On soft topological spaces. Applied Mathematics and Information Sciences. 2013;7(5):1889–1901. [Google Scholar]
  • 8.Shabir M, Naz M. On soft topological spaces. Computers and Mathematics with Applications. 2011;61(7):1786–1799. [Google Scholar]
  • 9.Zorlutuna I, Akdag M, Min WK, Atmaca S. Remarks on soft topological spaces. Annals of Fuzzy Mathematics and Informatics. 2011;3(2):171–185. [Google Scholar]
  • 10.Acar U, Koyuncu F, Tanay B. Soft sets and soft rings. Computers and Mathematics with Applications. 2010;59(11):3458–3463. [Google Scholar]
  • 11.Aktaş H, Çağman N. Soft sets and soft groups. Information Sciences. 2007;177(13):2726–2735. [Google Scholar]
  • 12.Çelik Y, Ekiz C, Yamak S. A new view on soft rings. Hacettepe Journal of Mathematics and Statistics. 2011;40(2):273–286. [Google Scholar]
  • 13.Feng F, Jun YB, Zhao X. Soft semirings. Computers and Mathematics with Applications. 2008;56(10):2621–2628. [Google Scholar]
  • 14.Jun YB, Park CH. Applications of soft sets in ideal theory of BCK/BCI-algebras. Information Sciences. 2008;178(11):2466–2475. [Google Scholar]
  • 15.Aman N, Enginolu S. Soft set theory and uni-int decision making. European Journal of Operational Research. 2010;207(2):848–855. [Google Scholar]
  • 16.Çağman N, Enginoğlu S. Soft matrix theory and its decision making. Computers and Mathematics with Applications. 2010;59(10):3308–3314. [Google Scholar]
  • 17.Chen D, Tsang ECC, Yeung DS, Wang X. The parameterization reduction of soft sets and its applications. Computers and Mathematics with Applications. 2005;49(5-6):757–763. [Google Scholar]
  • 18.Maji PK, Roy AR, Biswas R. An application of soft sets in a decision making problem. Computers and Mathematics with Applications. 2002;44(8-9):1077–1083. [Google Scholar]
  • 19.Maji PK, Biswas R, Roy AR. Fuzzy soft sets. Journal of Fuzzy Mathematics. 2001;203(2):589–602. [Google Scholar]
  • 20.Atmaca S, Zorlutuna I. On fuzzy soft topological spaces. Annals of Fuzzy Mathematics and Informatics. 2013;5(2):377–386. [Google Scholar]
  • 21.Varol BP, Aygün H. Fuzzy soft topology. Hacettepe Journal of Mathematics and Statistics. 2012;41(3):407–419. [Google Scholar]
  • 22.Tanay B, Kandemir MB. Topological structures of fuzzy soft sets. Computers and Mathematics with Applications. 2011;61:412–418. [Google Scholar]
  • 23.Simsekler T, Yüksel S. Fuzzy soft topological spaces. Annals of Fuzzy Mathematics and Informatics. 2013;5(1):87–96. [Google Scholar]
  • 24.Aygünoglu A, Aygün H. Introduction to fuzzy soft groups. Computers and Mathematics with Applications. 2009;58:1279–1286. [Google Scholar]
  • 25.Inan E, Öztürk MA. Fuzzy soft rings and fuzzy soft ideals. Neural Computing and Applications. 2012;21(1) supplement:1–8. [Google Scholar]
  • 26.Feng F, Jun YB, Liu X, Li L. An adjustable approach to fuzzy soft set based decision making. Journal of Computational and Applied Mathematics. 2010;234(1):10–20. [Google Scholar]
  • 27.Kong Z, Gao L, Wang L. Comment on “A fuzzy soft set theoretic approach to decision making problems”. Journal of Computational and Applied Mathematics. 2009;223(2):540–542. [Google Scholar]
  • 28.Roy AR, Maji PK. A fuzzy soft set theoretic approach to decision making problems. Journal of Computational and Applied Mathematics. 2007;203(2):412–418. [Google Scholar]
  • 29.Xiao Z, Gong K, Zou Y. A combined forecasting approach based on fuzzy soft sets. Journal of Computational and Applied Mathematics. 2009;228(1):326–333. [Google Scholar]
  • 30.Çağman N, Çıtak F, Enginoglu S. FP-soft set theory and its applications. Annals of Fuzzy Mathematics and Informatics. 2011;2(2):219–226. [Google Scholar]
  • 31.Çağman N, Deli İ. Products of FP-soft sets and their applications. Hacettepe Journal of Mathematics and Statistics. 2012;41(3):365–374. [Google Scholar]
  • 32.Çağman N, Deli İ. Means of FP-soft sets and their applications. Hacettepe Journal of Mathematics and Statistics. 2012;41(5):615–625. [Google Scholar]
  • 33.Ming PB, Ming LY. Fuzzy topology I. Neighbourhood structure of a fuzzy point and Moore-Smith convergence. Journal of Mathematical Analysis and Applications. 1980;76:571–599. [Google Scholar]

Articles from The Scientific World Journal are provided here courtesy of Wiley

RESOURCES