Powerset Theory of Fuzzy Soft Sets

Jiří Močkoř

doi:10.5391/IJFIS.2020.20.4.298

Original Article

Split Viewer

International Journal of Fuzzy Logic and Intelligent Systems 2020; 20(4): 298-315

Published online December 25, 2020

https://doi.org/10.5391/IJFIS.2020.20.4.298

Powerset Theory of Fuzzy Soft Sets

Jiří Močkoř

Institute for Research and Applications of Fuzzy Modeling, University of Ostrava, Ostrava, Czech Republic

Correspondence to :
Jiří Močkoř (Jiri.Mockor@osu.cz)

Received: May 28, 2019; Revised: December 8, 2020; Accepted: December 10, 2020

This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0/) which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

Fuzzy powerset theory is defined by a monad, and therefore it can be applied in computer science. Fuzzy soft sets generalize fuzzy sets and have considerable application potential in, for instance, decision-making and optimization. In this study, we prove that fuzzy soft sets also give rise to a powerset theory, which is also defined by a monad. As in the case of fuzzy sets, in fuzzy soft set theory, it is possible to use several theoretical constructions requiring the existence of a powerset theory and monads. We describe the construction of fuzzy soft relations as an example of the use of monads in fuzzy soft sets.

Keywords: Fuzzy soft set, Monad powerset theory, Fuzzy soft relations

1. Introduction

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

Several methods have been developed for problems related to incomplete or inaccurate information. Examples of such methods are, for example, the theory of probability, fuzzy set theory, interval mathematics, and rough set theory. These can be considered mathematical methods for handling imperfect knowledge, and each have their own theoretical foundation and range of potential applications. However, it should be noted that even though the last three theories are quite different, they share several common features, and under certain conditions, we can transform theoretical results of one theory into results of the other. This process then leads to the emergence of new theories at the borders of these basic theories. This enables the use of diverse theoretical tools, thus increasing their application potential.

An example of such a boundary theory that does not fully fit in these basic areas is soft set theory. This is a rather recent approach for modeling uncertainty and was introduced by Molodtsov [1] in 1999, who established the fundamental results and proposed possible applications. Further extensions of the theoretical part and applications of soft sets subsequently appeared, for example, Maji et al. [2, 3], Majumdar and Samanta [4], Aktas and Cagman [5], Feng et al. [6], Chen et al. [7], and Mushrif et al. [8]. Both fuzzy set theory and soft set theory are concerned with problems that involve vagueness and uncertainties from different areas. Hence, the combination of these two approaches naturally led to the concept of fuzzy soft sets as a fuzzy generalization of soft sets. This was introduced by Maji et al. [9], where the basic properties of fuzzy soft sets were provided. Several studies have since appeared, extending the theoretical features of fuzzy soft sets (e.g., [10–13]).

Recently, the properties and applications of soft and fuzzy soft sets have attracted considerable attention. Xiao et al. [13] studied a synthetic evaluation method for business competitive capacity. Zou and Xiao [14] exploited the link between soft sets and data analysis in incomplete information systems. Pei and Miao [15] demonstrated that soft sets are a class of special information systems. Mushrif et al. [8] presented a new algorithm based on soft set theory for classification of natural textures. Kovkov et al. [16] considered optimization problems in the framework of soft set theory. Zou and Xiao [14] presented data analysis approaches for soft sets under incomplete information. Finally, Majumdar and Samanta [4] studied similarity measures for soft sets.

From this review, it follows that fuzzy soft set theory is a highly lively research area with great application potential. However, fuzzy soft set theory itself and its position in uncertainty theories have not been sufficiently investigated. Only a limited number of studies are concerned with the theoretical properties of fuzzy soft sets and their relation to, for example, classical fuzzy sets, or general categorical properties of fuzzy soft sets. Fuzzy set theory already has a large system of theoretical techniques that allow combining fuzzy sets with, for example, standard algebraic and topological methods; however, in the case of fuzzy soft sets, such techniques have not been systematically developed.

In fuzzy set theory, one of the key theoretical techniques that allows the application of standard algebraic and topological methods to fuzzy sets is powerset theory. Powerset theories are widely used in algebra, logic, topology, and computer science. The standard example of a powerset theory is based on the powerset object P(X) = {A : A ⊆ X} of a set X, and the corresponding (Zadeh’s) extension of a mapping f : X → Y to the map f_P⃗ : P(X) → P(Y) is widely used in almost all branches of mathematics and their applications, including computer science. As classical set theory can be considered a special case of fuzzy set theory, powerset objects associated with fuzzy sets were soon investigated as generalizations of classical powerset objects. This was first carried out by Zadeh [17], who defined [0, 1]^X (or L^X, where L is an appropriate ordered structure) as a new powerset object Z(X) instead of P(X), and introduced the new powerset operator f_Z⃗ : Z(X) → Z(Y). Zadeh’s extension was extensively studied by Rodabaugh [18] for lattice-valued fuzzy sets. in [18], the author provided a serious basis for further research on powerset objects and operators. This new approach to powerset theories was based on the application of the theory of monads in clone form, introduced by Manes [19]. A special example of monads in clone form was introduced by Rodabaugh [20] as a special structure describing powerset objects.

Instead of a monad in clone form, a more explicit powerset theory was introduced by Rodabaugh [20] as a structure describing powerset objects. A slight modification of this structure defined in a category K is represented by a system T = (T, →, V, η), where T : K → CSLAT is an object function representing a powerset generator (where CSLAT is the category of complete ⋁-semilattices), → is a forward powerset operator such that for each f : X → Y in K, f_T⃗ : T(X) → T(Y) in CSLAT, V : K → Set is a concrete functor, and for each object X, η_X : V(X) → T(X) is a map in the category Set of sets. He then proved that some powerset theories can be generated by algebraic theories. In particular, T(X) can be considered to consist of objects of a category K rather than of semilattices only.

Unfortunately, such a powerset theory is not available for fuzzy soft sets. The existence of such a theory would allow not only the application of standard algebraic and topological techniques to this area, but also the precise definition of the relationships between classical fuzzy sets and fuzzy soft sets.

Accordingly, this study focuses on obtaining a fuzzy soft set powerset theory. Our objective is not only to provide an analog of classical powerset theory for fuzzy soft sets, as in the case of classical fuzzy sets, but also to handle the case of L-valued fuzzy soft sets for different lattices L. Hence, instead of the so-called fixed-basis fuzzy soft set powerset theory, where the value lattice L is fixed, we consider the so-called variable-basis fuzzy soft set powerset theory, where the value lattices can be different. To this end, we first prove that, as in the case of fixed-basis fuzzy set powerset theory, a variable-basis fuzzy set powerset theory exists and is defined by a suitable monad. Subsequently, we show that there exists a variable-basis fuzzy soft set powerset theory, which is a generalization of fuzzy set powerset theory, and we prove that it is also defined by a suitable monad. This allows us to use a series of constructs from fuzzy set theory that, by their very nature, require the existence of a powerset theory defined by a monad. To illustrate this, we use fuzzy soft set powerset theory and monads to define the theory of fuzzy soft relations and the composition of these relations.

All these results prove that fuzzy set powerset theory is a special case of fuzzy soft set powerset theory. However, we also prove that fuzzy soft set powerset theory can be understood as a special case of fuzzy set powerset theory, as instead of fixed-basis theories, we consider a variable-basis theory. Thereby, we obtain a detailed description of the relationships between the two theories.

2. Preliminaries

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

Let U be an initial universe, and X be the set of all possible parameters, which are properties of objects in U. An L-valued fuzzy set in U is a mapping s : U → L, where L is a complete lattice, the largest and smallest elements of which are 1_L and 0_L, respectively. The category of complete lattices with complete lattice homomorphisms is denoted by . For , the set of all L-valued fuzzy sets in U is denoted by L^X. Instead of a lattice L, we occasionally consider a lattice L with a t-norm (denoted by ⊗) such that a ⊗ ⋁_i_∈_I a_i = ⋁_i_∈_I (a ⊗ a_i). An example of a complete lattice with a t-norm is a complete residuated lattice (see, e.g., [21]).

We also use the category CSLAT of complete⋁-semilatices with complete⋁-preserving homomorphisms. As S ∈ CSLAT is a complete semilattice, it is also a complete lattice. The only difference between the category of complete lattices and the category of complete ⋁-semilattices CSLAT is that the morphisms in the former preserve both complete suprema and infima, whereas in the latter, we require that the morphisms preserve only complete suprema.

We use the following definition of a fuzzy soft set, introduced in [9].

Definition 1

A pair (E, s) is called a fuzzy soft set in a space (X, U, L) if E ⊆ X and s : E → L^U.

The interpretation of individual sets in this definition implies that a fuzzy set s(e) ∈ L^U, where e ∈ E, represents a fuzzy evaluation of how individual objects in U correspond to the parameter e in E, that is, s(e)(u) ∈ L is an L-valued measure of how the object u ∈ U corresponds to parameter e ∈ E. We now present an example of an application of fuzzy soft sets in image processing.

Example 1

(Color image segmentation as a fuzzy soft set)

Let (U, d) represent a finite metric space of pixels of a color image with metric d. For each pixel u ∈ U, we define a value S(u) representing the color of u. This value can be represented in different ways. For instance, we can use the so-called HSV representation, that is, a vector S(u) = [h, s, v], where h represents the hue of the color, s represents the saturation dimension, corresponding to various shades of brightly colored paint, and v represents the value dimension, corresponding to a mixture with varying amounts of black or white paint. Accordingly, the color image can be represented as a mapping S : U → E = {e = [h, s, v] : h ∈ I_h, s ∈ I_s, v ∈ I_v}, where I_h, I_s, I_v are the value sets of corresponding parameters.

However, we can use a different interpretation of S, particularly when we are interested in segmenting a given image because of its color. Let E_S = S(U) = {e ∈ E : ∃u ∈ U, S(u) = e} ⊆ E. Then, we can consider a [0, 1]-fuzzy soft set (E_S, s) in the set E, where s : E_S → [0, 1]^U, and s(e)(u) is a membership value that quantifies the grade of membership of the pixel u ∈ U to the color segment represented by a color e ∈ E_S. Evidently, a larger membership value implies that there are more pixels v ∈ U with color S(u), or a color similar to S(u), in the immediate vicinity of pixel u. After a simplification, we can formally describe this situation as follows.

On the set E of colors, we can define a fuzzy similarity relation σ : E × E → [0, 1] such that σ(e, e′) represents the similarity degree of two colors e, e′ ∈ E. Analogously, using the metric space (U, d) of pixels, we can define another fuzzy similarity relation ρ : U × U → [0, 1] such that ρ(u, v) expresses the fact that the pixels u and v are “similar,” that is, they are close to each other. Then, the grade of membership s(e)(u) of the pixel u ∈ U to the color segment represented by the color e can be described by the value

e∈ES,u∈U, s(e) (u)=∑v∈Uρ(u,v),σ(S(v),e)∑v∈Uρ(u,v),

which defines how true it is that in the vicinity of pixel u, there are sufficiently many pixels with a color similar to e.

Therefore, from this perspective, the color segmentation of an image S can be identified with the fuzzy soft set (E_S, s) in a set E, or with the α-cut (E_S, s)(e)_α = {u ∈ U : s(e)(u) ≥ α} of a color segmentation corresponding to the colore. More details regarding this application can be found in [22].

As mentioned in Introduction, powerset theories are widely used in algebra, logic, topology, and computer science. Numerous studies have been concerned with Zadeh’s extension and its generalizations, which could be considered the first example of a powerset operator in fuzzy set theory. The theoretical justification of Zadeh’s extension principle was first presented by Rodabaugh [18].

As general powerset theories and monads are not commonly used in the community of readers interested in fuzzy set structures, we repeat the basic definitions of these notions. For more details on category theory, readers are referred to, for example, [23]. The following definition by Rodabaugh [18] introduces a CSLAT-powerset theory. If f : X → Y and g : Y → Z are morphisms in a category, g.f : X → Z denotes their composition. Morphisms in a category K are sometimes abbreviated as K-morphisms.

Definition 2

Let K be a category. Then, T = (M, →, V, η) is called a CSLAT-powerset theory in K if

1) T : K → CSLAT is an object-mapping.
2) For each morphism f : A → B in K, there exists a morphism fT→ : T(A) → T(B) in the category CSLAT.
3) V : K → Set is a functor.
4) For each object X ∈ K, η determines in Set a mapping η_X : V (X) → WT(X), where W : CSLAT → Set is a forgetful functor.
5) For each f : X → Y in K, we have W(f_T→).η_X = η_Y.V(f).

For simplicity, a CSLAT-powerset theory will be referred to as a powerset theory. A set T(A) is called a powerset object of X ∈ K. Let us consider the following standard examples.

Example 2

The powerset theory P = (P, →, id, ρ) in the category Set is defined as follows:

1) The object function P : Set → CSLAT is defined by P(X) = (2^X, ⊆).
2) For each mapping f : X → Y in Set, f_P→ : 2^X → 2^Y is defined by f_P→ (A) = f(A), A ∈ 2^X.
3) For each X ∈ Set, ρ_X : X → 2^X is defined by ρ_X(x) = {x} ∈ 2^X.

Example 3

The powerset theory Z = (Z, →, id, χ) in the category Set is defined as follows:

1) The object function Z : Set → CSLAT is defined by Z(X) = (L^X, ≤), where ≤ is the pointwise ordering derived from a lattice .
2) For each mapping f : X → Y in Set, f_Z→ : L^X → L^Y is defined by

s∈LX,y∈Y,fZ→(s) (y)={⋁x∈f-1(y)s(x),f-1(y)≠∅,0L,otherwise.
3) For each X ∈ Set, χ_X : X → L^X is the map such that χ_X(a) is the characteristic map of the singleton {a} in the set X, that is,

x∈X, χX(a) (x)={1L,x=a0L,otherwise.

These basic powerset theories P, Z are often used not only in mathematical constructions related to sets and fuzzy sets, but also in other fields, such as computer science and automata theory. In these cases, however, additional properties of these powerset theories are used, which are not derived from the general properties of powerset objects, but are based on special properties of the objects L^X. These special properties of some powerset objects (including L^X) can be summarized in monads and powerset theories defined by monads. Monads over a category have been used in fuzzifying mathematical objects, and there are several equivalent notions of a monad [19]. Their so-called clone form in a category K appears to be suitable for applications in both computer science and mathematics, and it intuitively expresses the basic notion of fuzzification. The use of monads for fuzzification is based on the extension of objects X of a category K to another object T̃(X) ∈ K, which may be regarded as an object of a “cloud of fuzzy states” with a morphism η : X → T̃(X) representing “crisp” states in the object of “fuzzy states.” Then, a “fuzzy morphism” f : X ⇝ Y is simply a morphism f : X → T̃(Y) in the category K, and a composition of fuzzy morphisms is defined by a special operation ◊. The result of these constructions is a triple T̃ = (T̃, ◊, η), which Manes [19] called a fuzzy theory and is, in fact, a monad (or algebraic theory) in clone form. A system of objects of a category K with fuzzy morphisms and a composition ◊ of fuzzy morphisms is then a Kleisli category in the categoryK ( [19]).

The following definition of a monad in clone form was introduced by Manes [19].

Definition 3

T̃ = (T̃, ◊, η) is a monad in a category K if

1) T̃ : K → K is an object function.
2) η is a system of K-morphisms η_A : A → T̃(A) for any object A.
3) For each pair of K-morphisms f : A → T̃(B) and g : B → T̃(C), there exists a K-morphism (called a Kleisli composition) g◊f : A → T̃(C) such that the operation ◊ is associative.
4) For every K-morphism f : A → T̃(B), η_B◊f = f.
5) ◊ is compatible with composition of morphisms of K, that is, for each pair of K-morphisms f : A → B and g : B → T̃(C), we have g◊(η_B.f) = g.f.

It should be noted that if (T̃, ◊, η) is a monad in a category K, then T̃ : K → K is a functor. In fact, for each morphism f : A → B, the morphism T̃(f) is defined by

T˜(f)=(ηB.f)⋄1T˜(A).

Moreover, η represents identities on both sides for ◊, that is, for each A → T̃(B),

ηB⋄f=f, f⋄ηA=f.

In this case, η : 1_K → T̃ is a natural transformation.

Let us recall some simple properties of Kleisli composition.

Lemma 1

Let T̃ = (T̃, ◊, η) be a monad in a category K. Let f : X → Y, g : Y → T̃(Z), h : Z → T̃(U), e : T̃(U) → W be morphisms in K. Then,

h⋄(g.f)=(h⋄g).f, e.(h⋄g)=(e.h)⋄g,ηz⋄g=g⋄ηy.

We now present well-known examples of monads in the category Set.

Example 4

The structure P̃ = (P̃, ◊, ρ) is defined as follows:

1) For each object X ∈ Set, P̃(X) = 2^X.
2) For each object X ∈ Set, η_X : X → P̃(X) is defined by ρ_X(x) = {x}.
3) For each f : X → P̃(Y), g : Y → P̃(Z), g◊f : X → P̃(Z) is defined by

(g⋄f) (x)=⋃y∈f(x)g(y).

Example 5

Let L be a complete lattice with a t-norm ⊗. The structure Z̃ = (Z̃, ◊, χ) is defined as follows:

1) For each object X ∈ Set, the object function Z̃ : Set → Set is defined by Z̃(X) = L^X.
2) For each X ∈ Set, χ_X : X → L^X is the map such that χ_X(a) is the characteristic map of the singleton {a} in the set X.
3) For each f : X → Z̃(Y) and g : Y → Z̃(Q) in Set, g◊f : X → Z̃(Q) is defined by

x∈X,z∈Q, [(g⋄f) (x)] (z)=⋁y∈Yf(x) (y)⊗g(y) (z).

As mentioned previously, some powerset theories have additional properties related to special properties of fuzzy sets. Examples of such theories are powerset theories in a category defined by monads. We present a general definition of such a powerset theory.

Definition 4

Let T = (T, →, V, χ) be a powerset theory in a category K. Then, T is defined by a monad T̃ = (T̃, ◊, η) in K (or equivalently, the monad T̃ defines a powerset theory T) if the following diagram of functors commutes:

where for an arbitrary K-morphism f : X → Y, T(f) and T̃(f) are defined as follows:

T(f)=fT→, T˜(f)=(ηY.f)⋄1T˜(X).

Let us consider the following simple example of a powerset theory defined by a monad.

Example 6

The powerset theory Z is defined by the monad Z̃. In fact, by a simple calculation, for a map f : X → Y, we obtain

s∈Z(X), y∈Y,Z(f) (s) (y)=fZ→(s) (y)=⋁x∈X,f(x)=ys(x)=(χY.f)⋄1Z˜(X)(s) (y)=Z˜(s) (y),

and the diagram from Definition 4 commutes. Hence, Z is defined by Z̃.

It is also clear that the powerset theory P is defined by the monad P̃.

3. Powerset Theory of Fuzzy Soft Sets

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

Herein, we show that, as classical fuzzy sets in a set X define Zadeh’s powerset theory with objects Z(X) in the category Set, fuzzy soft sets define another powerset theory in another category. This powerset theory is a variant of the variable-basis fuzzy set powerset theory that Rodabaugh [18] introduced. The ground category for the variable-basis fuzzy set powerset theory is the category , where Set is the standard category of sets and mappings, and is the category of appropriate complete lattices with the corresponding homomorphisms. We recall the construction of this powerset theory.

Let the object function W : and the functor V : be defined by

W(X,L)={f|f:X→L}=(LX,≤),V(X,L)=X,V(f,ϕ)=f,

where ≤ is the pointwise ordering, and for an arbitrary morphism (f, ϕ) : (X, L) → (Y, M), the powerset extension (f, ϕ)_W⃗ : W(X, L) → W(Y, M) is defined by

s∈LX,y∈Y,(f,ϕ)W→(s) (y)={⋁x∈X,f(x)=yϕ(s(x)),f-1(y)≠∅,0M,otherwise.

Moreover, for (X, L), the map χ₍_X_,_L₎ : X → W(X, L) is defined by

x,z∈X, χ(X,L)(x) (z)={1L,iff x=z,0L,otherwise,

The following theorem ensuring the existence of variable-base fuzzy set powerset theory was proven by Rodabaugh [24].

Theorem 1

Let be the category of complete lattices with complete lattice-preserving homomorphisms. Then, W = (W, →, V, χ) is a CSLAT-powerset theory in the category . This powerset theory is called Zadeh’s variable-basis fuzzy set powerset theory.

As we showed in Example 6, the classical fixed-basis Zadeh’s power set theory Z is defined by a monad. By a simple modification of the proof, it can be proven that Zadeh’s variable-basis powerset theory W is also defined by a suitable monad in the category . For simplicity, we prove a variant in which the category consists of complete residuated lattices, although it can also be proven under slightly weaker conditions.

Proposition 1

Let be the category of complete residuated lattices. Then, there exists a monad W̃ = (W̃, Δ, ν) in the category such that W̃ defines the powerset theory W.

Proof

Let the object function W̃ : be defined by

(X,L)∈Set×C,W˜(X,L)=(W(X,L),L)∈Set×C.

For (X, L), we set ν₍_X_,_L₎ = (χ_X, id_L) : (X, L) → W̃(X, L), where χ_X is the characteristic function of subsets in X. Finally, for two morphisms (f, ϕ) : (X, L) → W̃(Y, M) and (g, ψ) : (Y, M) → W̃(Z, N), we set

(g,ψ)Δ(f,ϕ)=(g⋄f,ψ.ϕ),g⋄f:X→W(Z,N),x∈X,z∈Y, g⋄f(x) (z)=⋁y∈Yψ(f(x) (y))⊗g(y) (z).

By a simple computation, it can be proven that the operation Δ is associative, and that the following equalities hold:

∀(f,ϕ):(X,L)→(Y,M),(g,ψ):(Y,M)→W˜(Z,N),ν(Y,M)Δ(f,ϕ)=(f,ϕ),(g,ψ).(f,ϕ)=(g,ψ)Δ(χY,idM).(f,ϕ),

by the identity g ◇ (χ_Y.f) = (g ◇ χ_Y ).f = g.f. Hence, W̃ is a monad in the category .

We now show that the powerset theory W is defined by W̃. To this end, we should prove that the following diagram commutes:

where for an arbitrary morphism (f, ϕ) : (X, L) → (Y, M),

1) W(f, ϕ) := (f, ϕ)_W→,
2) W̃(f, ϕ) = (ν₍_Y_,_M₎.(f, ϕ) Δ 1_W̃₍_X_,_L₎.

We have VW̃(f, ϕ) = V(χ_Y.f ◇ 1_W₍_X_,_L₎, id_L) = χ_Y.f ◇ 1_W₍_X_,_L₎, and for arbitrary s ∈ W(X, L), y ∈ Y, we obtain

χY.f⋄1W(X,L)(s) (y)=⋁x∈Xϕ(1W(X,L)(s) (x))⊗χY(f(x)) (y)=(f,ϕ)X→(s) (y).

Therefore, W is defined by the monad W̃.

to study the properties of powerset objects of fuzzy soft sets, Definition 1 implies that we cannot define them for objects of the category , but we must use a “richer” category. Instead of the category , we consider some subcategories of . This reduction of the category involves two steps. In the first, we construct a fuzzy soft set powerset theory analogous to the classical fuzzy set powerset theory. In this step, instead of the category , we use the subcategory , where Set₀ is the subcategory of Set with surjective morphisms. In the second step, we define a monad, which in turn generates the fuzzy soft set powerset theory, as in the case of the classical fuzzy set powerset theory, which is defined by monad. We use the subcategory , where Set₁ is the subcategory with bijective maps as morphisms.

This restriction of the category Set to the subcategory Set₁ is based on several considerations concerning both the analogy of fuzzy soft sets with classical fuzzy sets, and the most common types of relationship (i.e., morphisms) among fuzzy soft sets. In the next part of the paper, we show that, as expected, any L-valued fuzzy set in the basic space (X, L), that is, a map s : X → L, can be identified with a fuzzy soft set in the space (X, {*}, L), that is, with the map s̄ : X → L^{*}. Hence, morphisms (f,ϕ) in the basic space for variable-basis fuzzy set powerset theory, which are used to derive relationships between fuzzy sets, can be identified with morphisms (f, 1_{*}, ϕ) in .

Analogously, the relationships between fuzzy soft sets are derived from the morphisms between the corresponding objects of the basic spaces of the fuzzy soft sets, that is, from morphisms (f, g, ϕ) : (X, U, L) → (Y, V, M). A typical example of such a relationship between fuzzy soft sets may be a change in the value structures by which we evaluate individual objects, that is, instead of a lattice L we use another lattice M, but the evaluated objects remain unchanged. In this case, we use a morphism (1_X, 1_U, ϕ) from . We can proceed analogously if we change the criteria from the set X and replace them with other criteria. The morphism that we use in this case is (f, 1_U, ϕ). In all these cases, we use morphisms from the category .

Under these assumptions, we will show that, as in variable-basis fuzzy set powerset theory, fuzzy soft sets define a variable-base powerset theory, and the corresponding powerset theory is also defined by a monad.

In [11], the set of all L-valued fuzzy soft sets in a space (X, U) was introduced, and an extension of maps between two spaces (X, U) and (Y, V) to maps between the corresponding sets of fuzzy soft sets was defined. Additional properties of extended maps between powerset objects of fuzzy soft sets were also investigated in [10]. To compare the relationships between fuzzy sets and fuzzy soft sets in the variable-basis case, we should define sets of variable-basis powerset objects of objects from the category sets and extensions of the corresponding morphisms. The sets of variable-basis powerset objects can be defined by the object function T : , where

(X,U,L)∈Set×Set0×C,T(X,U,L)={(E,s)|E⊆X,s:E→LU}.

According to Definition 1, the elements (E, s) of the set T(X, U, L) are called fuzzy soft sets in a space (X, U, L). In the next theorem, we show that this object function is an object function of a CSLAT-powerset theory in the category .

Theorem 2

Let be the category of complete lattices with complete lattice homomorphisms. The object function T can be extended to the CSLAT-powerset theory T = (T, →, R, η) in the category , called the variable-basis fuzzy soft set powerset theory of fuzzy soft sets.

Proof

Let (X, U, L) be an object in the category . In the set T(X, U, L), we define an order relation by

(E,s),(F,t)∈T(X,U,L),(E,s)≼(F,t) iff E⊆F,(∀e∈E)s(e)≤t(e) in LU.

It is clear that T(X, U, L) is a complete ⋁-semilattice with respect to this ordering, where for a system {(E_i, s_i) : i ∈ I} ⊆ T(X, U, L), we have

⋁i∈I(Ei,si)=(⋃i∈IEi,s),s:⋃i∈IEi→LU,x∈⋃i∈IEi,s(x)=⋁j∈I,x∈Ejsj(x).

Let R : be a forgetful functor defined by R(X, U, L) = X, R(f, g, ϕ) = f.

For an arbitrary object (X, U, L) and x, z ∈ X, we set

η(X,U,L):X→T(X,U,L), η(X,U,L)(x)=({x},ηx),ηx:{x}→LU, ηx(x)=1_L,

where 1_L, 0_L are constant fuzzy sets in U with values 1_L, 0_L, respectively, and for a K-morphism (f, g, ϕ) : (X, U, L) → (Y, V, M), we set

(f,g,ϕ)T→:T(X,U,L)→T(Y,V,M),(E,s)∈T(X,U,L), (f,g,ϕ)T→(E,s)=(f(E),s→),s→:f(E)→MV,y∈f(E), v∈V,s→(y) (v)=⋁u∈g-1(v)⋁{z∈f-1(y)⋁E}ϕ(s(z) (u)),

for all (E, s) ∈ T(X, U, L), y ∈ f(E), v ∈ V. As y ∈ f(E), we have f⁻¹(y) ∩ E ≠ ∅︀, and therefore (f, g, ϕ)_T⃗ is well defined. It should be mentioned that the map (f, g,ϕ)_T⃗ represents a variable-basis extension of a map introduced in [11]. As ϕ from a morphism (f, g, ϕ) is a complete lattice homomorphism, by a simple computation, we can prove that (f, g,ϕ)_T⃗ is a morphism in the category CSLAT. For a morphism (f, g, ϕ) : (X, U, L) → (Y, V, M), let us consider the following diagram:

We prove that this diagram commutes. In fact, as g is a surjective map, for x ∈ X, v ∈ V, we have

(f,g,ϕ)T→(η(X,U,L)(x))=(f,g,ϕ)T→({x},ηx)=({f(x)},ηx→),ηx→(f(x)) (v)=⋁u∈g-1(v)⋁z∈f-1(f(x))⋁{x}ϕ(ηx(z) (u))=1M=η{f(x)}(f(x)).

Hence, ({f(x)}, η_→) = ({f(x)}, η_{_f₍_x_)}), and the diagram commutes. Therefore, T is a CSLAT-powerset theory.

We prove that, as in a variable-basis fuzzy set powerset theory, the variable-basis fuzzy soft set powerset theory is defined by a monad. However, to prove this, we should consider the restriction of the powerset theory T to the subcategory and a monad in this subcategory. Under this assumption, we prove that this restriction (which, for simplicity, is denoted again by T) is actually defined by a monad. As seen in the next section, this restriction does not disrupt the generality of the relationship between the fuzzy soft set powerset theory and fuzzy set powerset theory. This is because (as follows from Proposition 2), the transformation of classical fuzzy sets into fuzzy soft sets takes place in the base space and uses this reduced fuzzy soft sets powerset theory.

Unlike the proof of this statement in the case of fuzzy sets, the proof for fuzzy soft sets is more complicated.

Theorem 3

Let be the category of complete residuated lattices. There exists a monad T̃ = (T̃, ⊙, ξ) in the category such that the variable-basis fuzzy soft set powerset theory T is defined by T̃.

Proof

Let the object function T̃ : be defined by

(X,U,L)∈Set×Set0×C,T˜(X,U,L)=(T(X,U,L),U,L),

where T(X, U, L) is identified with the underlying set of a complete lattice from Theorem 2. Let the morphism ξ₍_X_,_U_,_L₎ be defined by

ξ(X,U,L):(X,U,L)→T˜(X,U,L),ξ(X,U,L)=(η(X,U,L),1U,1L),

where η₍_X_,_U_,_L₎ is from Theorem 2. For morphisms

(f,k,ϕ):(X,U,L)→T˜(Y,V,M),(g,j,ψ):(Y,V,M)→T˜(Z,W,N),

we define the composition

(1)(g,j,ψ)⊙(f,k,ϕ)=(g⋄f,j.k,ψ.ϕ):(X,U,L)→T˜(Z,W,N),

where ◊ is a composition map that is defined as follows. If f : X → T(Y, V, M) is a map, then for x ∈ X, we use the notation

(2)f(x)=(Yxf,fx)∈T(Y,V,M),

where ∅≠Yxf⊆Y and fx:Yxf→MV. Then, for maps f : X → T(Y, V, M) and g : Y → T(Z, W, N), we define the composition map g◊f : X → T(Z, W, N) by

(3)x∈X, g⋄f(x)=(Zxg⋄f,(g⋄f)x)∈T(Z,W,N),

(4)Zxg⋄f=⋃y∈YxfZyg, (g⋄f)x:Zxg⋄f→NW,

(5)a∈Zxg⋄f,w∈W,(g⋄f)x(a) (w)=⋁{y∈Yxf:a∈Zyg}ψ(fx(y) (j-1(w)))⊗gy(a) (w),

where

∀x∈X,∀y∈Yxf f(x)=(Yxf,fx), g(y)=(Zyg,gy).

◊ is well defined because j is a bijection. We now prove that T̃ = (T̃, ⊙, ξ) is a monad in the category . In fact, let

(f,k,ϕ):(X,U,L)→T˜(Y,V,M),(g,j,ψ):(Y,V,M)→T˜(Z,W,N),(h,m,ω):(Z,W,N)→T˜(R,Q,S).

We prove that the operation ⊙ is associative. We have

(h,m,ω)⊙((g,j,ψ)⊙(f,k,ϕ))=(h⋄(g⋄f),m.j.k,ω.ψ.ϕ),((h,m,ω)⊙(g,j,ψ))⊙(f,k,ϕ)=((h⋄g)⋄f),m.j.k,ω.ψ.ϕ),

and we need only prove that h◊(g◊f) = (h◊g)◊f : X → T(R, Q, S). Let x ∈ X. Then, using relations (2), (3), and (4), we obtain

(h⋄(g⋄f)) (x)=(Rxh⋄(g⋄f),(h⋄(g⋄f))x)=(⋃z∈Xxg⋄fRzh,(h⋄(g⋄f))x)=(⋃z∈∪y∈YxfZygRzh,(h⋄(g⋄f))x)((h⋄g)⋄f) (x)=(Rx(h⋄g)⋄f,((h⋄g)⋄f)x)=(⋃y∈YxfRyh⋄g,((h⋄g)⋄f)x)=(⋃y∈Yxf⋃z∈ZygRzh,((h⋄g)⋄f)x).

By a simple calculation, it can be proven that

Rxh⋄(g⋄f)=⋃z∈∪y∈YxfZygRzh=⋃y∈Yxf⋃z∈ZygRzh=Rx(h⋄g)⋄f.

We prove that ((h◊g)◊f)_x = (h◊(g◊f))_x. Using the notation (2), we obtain the following maps:

x∈X,fx:Yxf→MV, Yxf⊆Y,y∈Y,gy:Zyg→NW, Zyg⊆Z,z∈Z,hz:Rzh→SQ, Rzh⊆R,x∈X,(g⋄f)x:Zxg⋄f→NW,Zxg⋄f⊆Z,y∈Y,(h⋄g)y:Rxh⋄g→SQ,Ryh⋄g⊆R.

For a∈Rxh⋄(g⋄f), q ∈ Q, using definition (5), we obtain

(h⋄(g⋄f))x(a) (q)=⋁{z∈Zxg⋄f:a∈Rzh}ω((g⋄f)x(z) (m-1(q)))⊗hz(a) (q)=⋁{z∈Zxg⋄f:a∈Rzh}⋁{y∈Yxf:z∈Zyg}[ω.ψ(fx(y) (j-1(w)))⊗ω(gy(z) (m-1(q)))⊗hz(a) (q)]=⋁{z∈∪y∈YxfZyg:a∈Rzh}⋁{y∈Yxf:z∈Zyg}[ω.ψ(fx(y) (j-1(w)))⊗ω(gy(b) (m-1(q)))⊗hz(a) (q)]=⋁(v,w,z,y)∈AΔ(v,w,z,y),

where

A={(v,w,z,y):j(v)=w,m(w)=q,y∈Yxf,z∈Zyg,a∈Rzh},Δ(v,w,z,y)=ω.ψ(fx(y) (v))⊗ω(gy(z) (w))⊗hz(a) (q).

Analogously, we obtain

((h⋄g)⋄f)x(a) (q)=⋁{y∈Yxf:a∈Ryh⋄g}ω.ψ(fx(y) ((m.j)-1(q)))⊗(h⋄g)y(a) (q)=⋁{y∈Yxf:a∈∪z∈ZygRzh}⋁{z∈Zyg:a∈Rzh}[ωψ(fx(y) ((m.j)-1(q)))⊗ω(gy(z) (m-1(q)))⊗hz(a) (q)]=⋁(v,w,z,y)∈BΔ(v,w,z,y),

where

B={(v,w,z,y):m(w)=q,m.j(v)=q,y∈Yxf,z∈Zyg,a∈Rzh}.

As j and m are bijective maps, we obtain A=B, (h◊(g◊f))_x = ((h◊g)◊f)_x, and the operation ◊ is associative. Thus, the operation ⊙ is associative.

We show that for arbitrary morphism (f, k, ϕ) : (X, U, L) → T̃(Y, V, M), the identity

ξ(Y,V,M)⊙(f,k,ϕ)=(η(X,U,L),1V,1M)⊙(f,k,j)=(η(X,U,L)⋄f,k,ϕ)=(f,k,ϕ)

holds. In fact, from the definition of η and relations (3) and (4), we obtain

x∈X,(η(X,U,L)⋄f) (x)=(⋃y∈Yx{y}=Yxf,(η(X,U,L)⋄f)x),(η(X,U,L)⋄f)x:Yxf→MV,a∈Yxf,v∈V,(η(X,U,L)⋄f)x(a) (v)=fx(a) (v)⊗ηa(a) (v)=fx(a) (v),and (η(X,U,L)⋄f) (x)=(Yxf,(η(X,U,L)⋄f)x)=(Yxf,fx)=f(x).

We show that for morphisms (f, k, ϕ):(X, U, L)→(Y, V, M) and (g, j, ψ) : (Y, V, M) → T̃(Z, W, M), the following identity holds:

(6)(g,j,ψ)⊙(ξ(Y,V,M),(f,k,ϕ))=(g,j,ψ),(f,k,ϕ),

In fact, we have

(g,j,ψ)⊙(ξ(Y,V,M),(f,k,ϕ))=(g⋄(η(Y,V,M),f),j.k,ψ.ϕ).

Hence, we should prove that g◊(η₍_Y_,_V_,_M₎.f) = g.f. For simplicity, instead of η₍_Y_,_V_,_M₎, we write only η. For x ∈ X, according to relations (3) and (4), we have

η.f(x)=η(f(x))=(Yxη.f={f(x)},ηf(x)),(g⋄η.f) (x)=(Zxg⋄η.f,(g⋄η.f)x),Zxg⋄η.f=⋃y∈Yxη.fZyg=Zf(x)g,(g⋄η.f)x:Zf(x)g→NW.

Let a∈Zf(x)g, w ∈ W. Then, according to relation (5), we have

(g⋄η.f)x(a) (w)=⋁{y∈Yxη.f|a∈Zyg}(η.f)x(y) (j-1(w))⊗gy(a) (w)=ηf(x)(f(x)) (j-1(w))⊗gf(x)(a) (w)=gf(x)(a)=(g.f)x(a) (w).

Furthermore, we have

(g.f) (x)=g(f(x))=(Zf(x)g,gf(x))=(Zxg⋄η.f,(g⋄η.f)x)=(g⋄η.f) (x).

Hence, identity (6) holds, and we proved that T̃ = (T̃, ⊙, ξ) is a monad in the category .

Finally, we prove that the monad T̃ defines the powerset theory T. We should prove that the following functor diagram commutes:

where for a morphism (f, k, ϕ) : (X, U, L) → (Y, V, M) in the category ,

T(f,k,ϕ)=(f,k,ϕ)T→:T(X,U,L)→T(Y,V,M),T˜(f,k,ϕ)=(ξ(Y,V,M).(f,k,ϕ))⊙1T˜(X,U,L):T˜(X,U,L)→T˜(Y,V,M).

It is clear that the diagram commutes for objects of the category. According to the definition of the powerset theory in Theorem 2, for (E, s) ∈ T(X, U, L), we have

(f,k,ϕ)T→(E,s)=(f(E),s→),RT˜(f,k,ϕ) (E,s)=R((ξ(Y,V,M).(f,k,ϕ))⊙1T˜(X,U,L)) (E,s)=R((η(Y,V,M).f⋄1T(X,U,L),k,ϕ)) (E,s)=(η(Y,V,M).f⋄1T(X,U,L)) (E,s).

According to relations (3) and (4), we have

(η.f⋄1T(X,U,L)) (E,s)=(Y(E,s)η.f⋄1T(X,U,L),(η.f⋄1T(X,U,L))(E,s)),Y(E,s)η.f⋄1T(X,U,L)=⋃x∈EYxη.f⋃x∈E{f(x)}=f(E),(E,s)=1T(X,U,L)(E,s)=(X(E,s)1T(x,U,L),1T(X,U,L),(E,s)).

Therefore, for a ∈ f(E), v ∈ V, we obtain

(η.f⋄1T(X,U,L))(E,s)(a)(v)=⋁{z∈E|a=f(z)}ϕ(s(z)(k-1(v)))⊗(η.f)z(a) (v)=⋃{z∈E|a=f(z)}ϕ(s(z) (k-1(v)))⊗ηa(a) (v)=s→(a) (v).

Therefore, RT̃(f, k, ϕ)(E, s) = (f(E), s^→) = T(f, k, ϕ)(E, s), and the functor diagram commutes. Hence, T is defined by the monad T̃.

As expected, any L-valued fuzzy set (i.e., an element of W(X, L)) can also be considered a fuzzy soft set in the space (X, {*}, L), that is, an element of T(X, {*}, L). In fact, if s ∈ W(X, L), then s can be identified with (E_s, [s]) ∈ T(X, {*}, L), where E_s = {x ∈ X : s(x) ≠ 0_L} and [s] : E_s → L^{*} is defined by [s](x)(*) = s(x) ∈ L. Moreover, the embedding W(X, L) ↪ T(X, {*}, L) can be extended to a more precisely defined relationship between W and T, using the notion of a morphism between the powerset theories. The existence of a morphism between these powerset theories allows for a more precise understanding of the relationship between classical fuzzy sets and fuzzy soft sets.

The notion of a morphism of powerset theories is introduced in the following definition. We recall that the commutativity of the diagram

implies that g.u ≥ v.f, where D is an object with ordering ≤.

Definition 5

Let T = (T, →, V, η) and R = (R, ⇒, U, τ) be CSLAT-powerset theories in the categories K and J, respectively. Then, (G, Φ, Ψ) : (K, T) → (J, R) is a morphism of CSLAT-powerset pairs if for each object X ∈ K, we have the following:

1) G : K → J is a functor.
2) Φ_X : T(X) → R(G(X)) is a morphism in the category CSLAT.
3) Ψ_X : V (X) → U(G(X)) is a map in the category Set.
4) For each morphism f : X → Y in K, the following diagrams commute:

that is, G(f)^⇒.Φ_X ≥ Φ_Y.f_T⃗, where ≤ is the ordering in the CSLAT object R(G(Y)).

A morphism (G, Φ, Ψ) is called an embedding if R : K ↪ J is an embedding functor, Φ_X is a monomorphism in the category CSLAT, and Ψ is an injective map.

We now prove that there is an embedding morphism between the powerset theories W and T that interprets the relationship between classical fuzzy sets and fuzzy soft sets.

Proposition 2

Let be the category of complete lattices. Then, there exists an embedding morphism of CSLAT-powerset pairs

(G,Φ,Ψ):(Set×C,W)→(Set×Set1×C,T).

Therefore, the variable-basis fuzzy set powerset theory is a special case of the variable-basis fuzzy soft set powerset theory.

Proof

We define the functor G : by

G(X,L)=(X,{*},L), G(f,ϕ)=(f,1*,ϕ),

where 1_* : {*} → {*}. It is clear that G is an embedding functor. For , we set

Φ(X,L):W(X,L)↪T(G(X,L))=T(X,{*},L),s∈W(X,L), Φ(X,L)(s)=(Es,[s]),Es={z∈X:s(x)≠0L}, [s]:Es→L{*},z∈Es, [s] (z) (*)=s(z),Ψ(X,L)=1X:X→X.

It is clear that Φ₍_X_,_L₎ is a complete ⋁-semilattice homomorphism. In fact, we have

Φ(X,L)(⋁i∈Isi)=(E⋁i∈Isi,[⋁i∈Isi])=(⋃i∈IEsi,⋁i∈I[si])=⋁i∈IΦ(X,L)(si),

where [s_i] is considered an L^{*}-valued fuzzy set in E_{⋁_i}_s_{_i}. We show that the following diagram commutes:

Let x ∈ X. We obtain

η(G(X,L)(x)=({x},ηx),ηx:{x}→L{*}, ηx(x) (*)=1L,Φ(X,L)(χ(X,L)(x))=(Eχ(X,L)(x),[χ(X,L)(x)])=({x},[χ(X,L)(x)]),[χ(X,L)(x)] (x) (*)=1L.

Hence, the diagram commutes. We show that for an arbitrary morphism (f,ϕ) : (X, L) → (Y, M), inequality holds in the diagram

Let s ∈ W(X, L). From the proof of Theorem 2, we have

(f,1*,ϕ)T→(φ(X,L)(s))=(f,1*,ϕ)T→(Es,[s])=(f(Es),[s]→),[s]→:f(Es)→M{*},f(x)∈f(Es), [s]→(f(x)) (*)=⋁z∈f-1(f(x))⋁Esϕ(s(z)).

Moreover, we have

Φ(Y,M)((f,ϕ)W→(s))=(F,t→),F={y∈Y:(f,ϕ)W→(s) (y)≠0M}={y∈Y:f-1(y)≠∅,⋁x∈f-1(y)ϕ(s(x))≠0M},t→:F→M{*},y∈F,t→(y) (*)=(f,ϕ)W→(s) (y)=⋁x∈f-1(y)ϕ(s(x))=⋁x∈f-1(y)⋁Esϕ(s(x)).

As F ⊆ f(E_s), for f(x) ∈ F, we obtain

t→(f(x)) (*)=⋁z∈f-1(f(x))⋁Esϕ(s(z))=[s]→(f(x)) (*),

and (F, t^→) ⪯ (f(E_s), [s]^→). Therefore,

(G,Φ,Ψ):(Set×C,W)→(Set×Set1×C,T).

is a morphism of powerset pairs.

In Proposition 2, we showed that any fuzzy set can be considered a special fuzzy soft set. In the next proposition, we prove the converse: Any fuzzy soft set can be extended to a fuzzy set, and this extension process is a morphism from the powerset theory T to the powerset theory W.

To this end, we recall that for an arbitrary lattice L and a set X, L^X is also a lattice with the ordering defined pointwise and with properties analogous to those of the lattice L.

Proposition 3

Let be the category of complete ⋁-semilattices with complete semilattice homomorphisms. Then, there exists a morphism of powerset pairs

(H,Λ,Θ):(Set×Set1×C,T)→(Set×C,W),

called a transformation of a fuzzy soft sets to fuzzy sets.

Proof

For arbitrary morphism (f, g, ϕ) : (X, U, L) → (Y, V, M), let the functor H : be defined by

H(X,U,L)=(X,LU),H(f,g,ϕ)=(f,(g,ϕ)W→):(X,LU)→(Y,MV),

where (g, ϕ)_W⃗ is a morphism from the definition of the variable-basis powerset theory W. For an arbitrary object (X, U, L), we set

Λ(X,U,L):T(X,U,L)→W(X,LU),(E,s)∈T(X,U,L), Λ(X,U,L)(E,s):X→LU,x∈X,u∈U,Λ(X,U,L)(E,s) (x) (u)={s(x) (u),x∈E,0L,otherwise,Θ(X,U,L)=1X:X=R(X,U,L)→X=V(X,LU).

It can be easily proven that Λ₍_X_,_U_,_L₎ is a complete ⋁-semilattice homomorphism, that is, Λ₍_X_,_U_,_L₎(⋁_i(E_i, s_i)) = ⋁_i Λ₍_X_,_U_,_L₎ (E_i, s_i) holds. We prove that the following diagram commutes:

For x, z ∈ X, u ∈ U,

χ(H(X,U,L)(x) (z) (u)={1L,x=z,oL,otherwise.

Moreover,

Λ(X,U,L)(η(X,U,L)(x))=Λ(X,U,L)({x},ηx):X→LU,Λ(X,U,L)({x},ηx) (z) (u)={ηx(x) (u)=1L,z=x,0L,otherwise,

and the diagram commutes. Finally, we prove that for any morphism (f, g, ϕ) : (X, U, L) → (Y, V, M), the following diagram commutes:

We recall that g is a bijection map. For (E, s) ∈ T(X, U, L) and y ∈ Y, v ∈ V, we have

(f,(g,ϕ)W→)W→(Λ(X,U,L)(E,s)) (y) (v)={⋁x∈f-1(y)(g,ϕ)W→(Λ(X,U,L)(E,s) (x)),f-1(y)≠∅,0M,otherwise={⋁x∈f-1(y)ϕ(Λ(X,U,L)(E,s) (x) (g-1(v))),f-1(y)≠∅,0M,otherwise,={⋁x∈f-1(y)⋁Eϕ(s(x) (g-1(v))),f-1(y)⋁E≠∅,0M,otherwise.

Moreover, we have

Λ(X,U,L)((f,g,ϕ)T→(E,s) (y) (v))=Λ(X,U,L)(f(E),s→) (y) (v)={s→(y) (v),y∈f(E),0M,otherwise={⋁x∈f-1(y)⋁Eϕ(s(x) (g-1(v))),f-1(y)⋁E≠∅0M,otherwise.

Therefore, the diagram commutes, and (H, Λ, Θ) is a morphism of powerset pairs.

By a simple calculation we obtain the following corollary.

Corollary 1

The composition

(H,Λ,Θ).(G,Φ,Ψ):(Set×C,W)→(Set×C,W)

is the identity morphism of powerset pairs.

4. Fuzzy Soft Relations: An Application of Powerset Theory

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

In set and fuzzy set theory, there are a number of concepts and methods that are, in fact, defined using powerset objects. To illustrate this, let us mention at least two typical powerset applications: relations and topology. If T = (T, →, V, η) is an arbitrary powerset theory in a category K, then a co-topology on an object X of this category can be defined as the morphism c : T(X) → T(X) in the category CSLAT so that the following axioms are satisfied (see [25]):

1) a ∈ T(X), c(a) ≥ a,
2) a, b ∈ T(X), c(a ∨ b) = c(a) ∨ c(b),
3) a ∈ T(X), c(c(a)) = c(a).

The set {a ∈ T(X) : c(a) = a} represents the set of all closed elements in T(X). A morphism between co-topological spaces (X, c) and (Y, d) is a morphism f : X → Y in a category K such that f_T→ : T(X) → T(Y) is continuous, that is, for arbitrary a ∈ T(X), we have f_T→ (c(a)) ≤ d(f_T→ (a)).

If, for example, instead of a category K, we consider the category Set of sets and the powerset theory P or Z from examples 2 and 3, the obtained co-topology c : P(X) → P(X) represents the classical set topology in a set X, and c : Z(X) → Z(X) represents a variant of a fuzzy topology, namely, the set of all closed elements of Z(X) with respect to c is the topology defined by C.L. Chang [26].

Herein, we focus on the relationship between powerset theory and relations, particularly between the fuzzy soft set powerset theory T, or the monad T̃, which defines this powerset theory, and fuzzy soft relations in objects of the category .

To clarify this relationship, we first consider the general situation of the powerset objects in a category that is defined by a monad in this category.

Hence, let K be a category, and let T = (T, →, V, χ) be a powerset theory in K. Let T be defined by a monad T̃ = (T̃, ◊, η) in K. For a monad T̃, a new category K_T̃ can be defined, called the Kleisli category of a monadT̃. We recall the definition of K_T̃ (e.g., [19, 27]).

Definition 6

Let K be a category, and let T̃ = (T̃, ◊, η) be a monad in K. Then, the Kleisli category K_T̃ of T̃ is defined as follows:

1) Objects of K_T̃ are the same as objects of K.
2) For arbitrary objects A, B ∈ K, Hom_K_{_T̃} (A, B)=Hom_K (A, T̃(B)). Morphisms in K_T̃ are denoted by A ⇝ B.
3) A composition of morphisms f : A ⇝ B, g : B ⇝ C is defined by g◊f.

If we understand the objects T̃(X) as an analog of the cloud of fuzzy objects over the object X, then the Klesli category in fact represents a category analogous to that of fuzzy morphisms between objects. Thus, this category is also used in areas other than the classical theory of fuzzy sets, for example, in computer science. This category also allows us to introduce the notion of a relation between objects of this category. Let us consider the following general definition.

Definition 7

Let K be a category, and let T = (T, →, V, χ) be a powerset theory in K defined by a monad T̃ = (T̃, ◊, η).

1) Let X be an object of K. Then, R is a T-relation on X if R : V (X) → T(X) is a morphism in Set such that R = V (R̃), where R̃ : X → T̃(X) is a morphism in K.
2) Let R and S be T-relations on X and Y, respectively. A morphism f : R → S between relations is a morphism f : X → Y in K such that in the diagram

we have

fT→.R≤S.V(f),

where ≤ is the pointwise ordering inherited from the semilattice T(X).

This definition directly implies the possibility of composing two T-relations. In fact, let R and S be T-relations on X. Then, there exist morphisms R̃ : X → T̃(X) and S̃ : X → T̃(X) such that V (R̃) = R, V (S̃) = S. The composition S ∘ R : V (X) → T(X) can be defined by the composition of morphisms R̃ and S̃ in the Kleisli category K_T̃:

S∘R:=V(S˜⋄R˜):V(X)→VT˜(X)=T(X).

The following examples illustrate the importance of T-relations in classical set and fuzzy set theories.

Example 7

Let K = Set, and let P be the classical powerset theory from Example 2. If R is a P-relation n X, then R can be identified with the relation R ⊆ X × X, and conversely, for any relation R in X, R is a P-relation. Morphisms f : R → S are maps f : X → Y such that

that is, (x, y) ∈ R ⇒ (f(x), f(y)) ∈ S holds for arbitrary x, y ∈ X. As P is defined by the monad P̃ from Example 4, and any map R : X → P(X) is also a morphism X → P̃(X), using ◊, it is possible to define the composition of P-relations, and this composition is identical to the standard composition of relations in sets.

Therefore, the category of P-relations is isomorphic to the classical category of sets with relations with the corresponding morphisms. This category is isomorphic to the Kleisli category Set_P̃.

Example 8

Let K = Set, and let Z = (Z, →, V, χ) be the classical Zadeh’s powerset theory from Example 3. If R is a Z-relation on X, R can be identified with a fuzzy relation R ⫇ X ×X, and conversely, any fuzzy relation R : X ×X → L defines a Z-relation. Morphisms f : R → S are maps f : X → Y such that

It can be easily proven that f is a morphism if and only if

R(x,x′)≤S(f(x),f(x′))

for each x, x′ ∈ X. As Z is defined by the monad Z̃ from Example 5, and any map R : X → Z(X) is also a morphism X → Z̃(X), using ◊, it is possible to define the composition of Z-relations, and this composition is identical to the standard composition of L-valued fuzzy relations. Hence, the category of Z-relational pairs is isomorphic to the standard category of L-fuzzy relations.

Both Examples 7 and 8 indicate that the classical relations in sets or fuzzy relations can be fully replaced by morphisms in Kleisli categories. This now provides the opportunity to consider fuzzy soft relations defined on the basic objects of fuzzy soft sets from the perspective of Kleisli categories. Although it is common practice in fuzzy set theory to explicitly define new terms without justifying motivation, it is always advisable to attempt to interpret such an established concept in the context of a broader theory. An example of this procedure can be the aforementioned notion of relation in fuzzy structures. Using the standard procedure, we can independently define a fuzzy soft relation in a space (X, U, L), even in various ways. However, if we realize the previous relationship between relations in sets and the monad P, or between fuzzy relations in fuzzy sets and the monad Z, then the correct procedure requires that the exclusive definition of a fuzzy soft relation also follows an analogous relationship between fuzzy soft relations and the Kleisli category K_T̃.

If we use the common procedure in the theory of fuzzy sets, we can introduce, for example, the following explicit definition of a fuzzy soft relation in a space (X, U, L), a composition of such fuzzy soft relations and morphisms between fuzzy soft relations in different spaces.

Definition 8

Let (X, U, L) be an object in .

1) A fuzzy soft relation in (X, U, L) is a fuzzy soft set in the space (X × X, U, L).
2) If (E, R) and (F, S) are fuzzy soft relations in (X, U, L), their composition is a fuzzy soft relation defined by

(F,S)⊕(E,R)=(E.F,S∘R),E.F={(x,z)∈X2:∃y∈X,(x,y)∈E,(y,z)∈F},(x,z)∈E.F,(S∘R) (x,z) (u)=⋁{y|(x,y)∈E,(y,z)∈F}R(x,y) (u)⊗S(y,z) (u).
3) Let (E, R) and (F, S) be fuzzy soft relations in (X, U, L) and (Y, V, M), respectively. Then, (f, g, ϕ) : (E, R) → (F, S) is a morphism of fuzzy soft relations if
- (a) (f, g, ϕ) : (X, U, L) → (Y, V, M) is a morphism in the category K.
- (b) For arbitrary (a, b)∈E and u∈U, we have (f(a), f(b)) ∈ F and
  
  ϕ(R(a,b) (u))≤S(f(a),f(b)) (g(u)).

However, to maintain the analogy of the relationships between sets, fuzzy sets, and fuzzy soft sets, we should show that, as in the case of relations in sets or fuzzy relations in fuzzy sets, fuzzy soft relations can be derived from morphisms in the Kleisli category of the monad T̃ defining the fuzzy soft set powerset theory T, and that the composition of fuzzy soft relations corresponds to the composition of morphisms in the Kleisli category. We prove this in the next proposition.

Proposition 4

Let T = (T, →, R, η) be the fuzzy soft set powerset theory from Theorem 2, and let T̃ = (T̃, ⊙, ξ) be the monad from Theorem 3 in the category defining T. For an object of this category, we set

ℛ(χ)={(E,S)|(E,S) is a fuzzy soft relation (Definition 8) in χ},ℛT(χ)={r|r:X→T(χ) is a T-relation (Definition 7) on χ}.

1) There exists a bijective map

α:ℛ(χ)→≅ℛT(χ).
2) If , then

α((F,S)⊕(E,Q))=α(F,S)⋄α(E,Q),

where the clone composition ◊ is defined by relations (3) and (4).

Proof

1) Let (E, S) be a fuzzy soft relation in defined in Definition 8. To define the map α, for arbitrary x ∈ X, we set XxE={z∈X:(z,x)∈E}. Clearly, E=∪x∈XXxE×{x}, and we can define a map α by

α(E,R)=r:X→T(χ),∀x∈X, r(x)=(XxE,Sx)∈T(χ),z∈XxE,u∈U, Sx(z) (u):=S(z,x) (u).

Conversely, let s : be a map, where, using the notation (2), we have

∀x∈X, s(x)=(Xxs,sx)∈T(χ),

Xxs⊆X,sx:Xxs→LU. We define a fuzzy soft relation α⁻¹(s) = (F, Q) in by

F=⋃x∈XXxs×{x}⊆X×X,(y,x)∈F,u∈U, Q(y,x) (u)=sx(y) (u).

By a simple calculation, we obtain α⁻¹.α(E, S) = (E, S) and α.α⁻¹(s) = s.

2) Let (E, Q), (F, S) be fuzzy soft relations in (X, U, L), and let

α(E,Q)=r, α(F,S)=s,∀x∈X, r(x)=(XxE,rx), s(x)=(XxF,sx).

According to identities (3), (4), and (5), we obtain

x∈X, (s⋄r) (x)=(Xxs⋄r,(s⋄r)x),Xxs⋄r=⋃y∈XxEXyF,z∈Xxs⋄r,(s⋄r)x(z)=⋁{y∈XxE|z∈XyF}rx(y) (u)⊗sy(z) (u)=⋁{y|(x,y)∈E,(y,z)∈F}Q(x,y) (u)⊗S(y,z) (u)=S∘Q(x,z).

It follows that ⋃x∈XXxs⋄r×{x}=E.F and s◊r = α(E.F, S∘ Q) = α((F, S) ⊕ (E, Q)).

5. Conclusion

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

In this study, we focused on constructing a fuzzy soft set powerset theory, including its variable-basis variant, that enables the use of L-valued fuzzy soft sets for various lattices L. We proved that there exists a variable-basis fuzzy soft set powerset theory in the category , which is a generalization of both the classical and fuzzy set powerset theory in the category Set and the variable-basis fuzzy set powerset theory in the category . We proved that this powerset theory is also defined by a suitable monad in the category . This allows us to use a series of constructs from the theory of fuzzy sets that, by their very nature, require the existence of a powerset theory defined by a monad. As an example, we used the monad defining a fuzzy soft set powerset theory to define fuzzy soft relations and compositions of these relations.

Acknowledgments

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

This research was partially supported by the ERDF/ESF project CZ.02.1.01/0.0/0.0/17-049/0008414.

Conflict of Interest

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

No potential conflict of interest relevant to this article was reported.

References

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

Molodtsov, D (1999). Soft set theory—first results. Computers & Mathematics with Applications. 37, 19-31. https://doi.org/10.1016/S0898-1221(99)00056-5
Maji, PK, Biswas, R, and Roy, AR (2003). Soft set theory. Computers & Mathematics with Applications. 45, 555-562. https://doi.org/10.1016/S0898-1221(03)00016-6
Maji, PK, Roy, AR, and Biswas, R (2002). An application of soft sets in a decision making problem. Computers & Mathematics with Applications. 44, 1077-1083. https://doi.org/10.1016/s0898-1221(02)00216-x
Majumdar, P, and Samanta, SK (2008). Similarity measure of soft sets. New Mathematics and Natural Computation. 4, 1-12. https://doi.org/10.1142/S1793005708000908
Aktas, H, and Cagman, N (2007). Soft sets and soft groups. Information Sciences. 177, 2726-2735. https://doi.org/10.1016/j.ins.2006.12.008
Feng, F, Jun, YB, and Zhao, X (2008). Soft semirings. Computers & Mathematics with Applications. 56, 2621-2628. https://doi.org/10.1016/j.camwa.2008.05.011
Chen, D, Tsang, ECC, Yeung, DS, and Wang, X (2005). The parameterization reduction of soft sets and its applications. Computers & Mathematics with Applications. 49, 757-763. https://doi.org/10.1016/j.camwa.2004.10.036
Mushrif, MM, Sengupta, S, and Ray, AK (2006). Texture classification using a novel, soft-set theory based classification algorithm. Computer Vision – ACCV2006. Heidelberg, Germany: Springer, pp. 246-254 https://doi.org/10.1007/1161203226
Maji, PK, Roy, AR, and Biswas, R (2001). Fuzzy soft sets. Journal of Fuzzy Mathematics. 9, 589-602.
Tanay, B, and Kandemir, MB (2015). Results on fuzzy soft functions. New Trends in Mathematical Sciences. 3, 1-17.
Athar, K, and Ahmad, B (2009). Mappings on fuzzy soft classes. Advances in Fuzzy Systems. 2009. article no. 407890
Roy, AR, and Maji, PK (2007). A fuzzy soft set theoretic approach to decision making problems. Journal of Computational and Applied Mathematics. 203, 412-418. https://doi.org/10.1016/j.cam.2006.04.008
Xiao, Z, Gong, K, and Zou, Y (2009). A combined forecasting approach based on fuzzy soft sets. Journal of Computational and Applied Mathematics. 228, 326-333. https://doi.org/10.1016/j.cam.2008.09.033
Zou, Y, and Xiao, Z (2008). Data analysis approaches of soft sets under incomplete information. Knowledge-Based Systems. 21, 941-945. https://doi.org/10.1016/j.knosys.2008.04.004
Pei, D, and Miao, D . From soft sets to information systems., Proceedings of 2005 IEEE International Conference on Granular Computing, 2005, Beijing, China, Array, pp.617-621. https://doi.org/10.1109/GRC.2005.1547365
Kovkov, DV, Kolbanov, VM, and Molodtsov, DA (2007). Soft sets theory-based optimization. Journal of Computer and Systems Sciences International. 46, 872-880. https://doi.org/10.1134/S1064230707060032
Zadeh, LA (1965). Fuzzy sets. Information and Control. 8, 338-353. https://doi.org/10.1016/S0019-9958(65)90241-X
Rodabaugh, SE (1999). Powerset operator foundations for poslat fuzzy set theories and topologies. Mathematics of Fuzzy Sets. Boston, MA: Springer, pp. 91-116 https://doi.org/10.1007/978-1-4615-5079-23
Manes, EG (1976). Algebraic Theories. Berlin, Germany: Springer-Verlag
Rodabaugh, SE (2007). Relationship of algebraic theories to powerset theories and fuzzy topological theories for lattice-valued mathematics. International Journal of Mathematics and Mathematical Sciences. 2007. article no. 043645
Novak, V, Perfilijeva, I, and Mockor, J (1999). Mathematical Principles of Fuzzy Logic. Boston, MA: Kluwer Academic Publishers
Mockor, J, and Hurtik, P 2020. Fuzzy soft sets and image processing application., 14th International Conference on Theory and Application of Fuzzy Systems and Soft Computing – ICAFS-2020, Array. https://doi.org/10.1007/978-3-030-64058-3
Mac Lane, S (1998). Categories for the Working Mathematician. New York, NY: Springer
Rodabaugh, SE (1997). Powerset operator based foundation for point-set lattice-theoretic (poslat) fuzzy set theories and topologies. Quaestiones Mathematicae. 20, 463-530. https://doi.org/10.1080/16073606.1997.9632018
Goguen, JA (1973). The fuzzy Tychonoff theorem. Journal of Mathematical Analysis and Applications. 43, 734-742. https://doi.org/10.1016/0022-247X(73)90288-6
Chang, CL (1968). Fuzzy topological spaces. Journal of Mathematical Analysis and Applications. 24, 182-190. https://doi.org/10.1016/0022-247x(68)90057-7
Kleisli, H (1965). Every standard construction is induced by a pair of adjoint functors. Proceedings of the American Mathematical Society. 16, 544-546. https://doi.org/10.2307/2034693
Mockor, J (2008). Powerset operators of extensional fuzzy sets. Iranian Journal of Fuzzy Systems. 15, 143-163. https://dx.doi.org/10.22111/ijfs.2018.3765
Mockor, J (2010). Cut systems in sets with similarity relations. Fuzzy Sets and Systems. 161, 3127-3140. https://doi.org/10.1016/j.fss.2010.07.009
Mockor, J, and Holcapek, M (2017). Fuzzy objects in spaces with fuzzy partitions. Soft Computing. 21, 7269-7284. https://doi.org/10.1007/s00500-016-2431-4

Biography

Go to

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion
Acknowledgments
Conflict of Interest
References
Biography

Jiří Močkoř is a Professor of algebra at the University of Ostrava and Senior Researcher at the Institute for Research and Application of Fuzzy Modeling at this University. He has been working on research related to category theory with applications in fuzzy set theory and fuzzy logic. He is the author or co-author of 4 monographs on theoretical algebra and fuzzy logic and published more than 100 articles in peer-reviewed journals and conferences.

E-mail: mockor@osu.cz

Article

Original Article

International Journal of Fuzzy Logic and Intelligent Systems 2020; 20(4): 298-315

Published online December 25, 2020 https://doi.org/10.5391/IJFIS.2020.20.4.298

Powerset Theory of Fuzzy Soft Sets

Jiří Močkoř

Institute for Research and Applications of Fuzzy Modeling, University of Ostrava, Ostrava, Czech Republic

Correspondence to:Jiří Močkoř (Jiri.Mockor@osu.cz)

Received: May 28, 2019; Revised: December 8, 2020; Accepted: December 10, 2020

Abstract

Keywords: Fuzzy soft set, Monad powerset theory, Fuzzy soft relations

1. Introduction

2. Preliminaries

We use the following definition of a fuzzy soft set, introduced in [9].

Definition 1

A pair (E, s) is called a fuzzy soft set in a space (X, U, L) if E ⊆ X and s : E → L^U.

Example 1

(Color image segmentation as a fuzzy soft set)

e \in E_{S}, u \in U, s (e) (u) = \frac{\sum_{v \in U} ρ (u, v), σ (S (v), e)}{\sum_{v \in U} ρ (u, v)},

which defines how true it is that in the vicinity of pixel u, there are sufficiently many pixels with a color similar to e.

Definition 2

Let K be a category. Then, T = (M, →, V, η) is called a CSLAT-powerset theory in K if

1) T : K → CSLAT is an object-mapping.
2) For each morphism f : A → B in K, there exists a morphism fT→ : T(A) → T(B) in the category CSLAT.
3) V : K → Set is a functor.
4) For each object X ∈ K, η determines in Set a mapping η_X : V (X) → WT(X), where W : CSLAT → Set is a forgetful functor.
5) For each f : X → Y in K, we have W(f_T→).η_X = η_Y.V(f).

For simplicity, a CSLAT-powerset theory will be referred to as a powerset theory. A set T(A) is called a powerset object of X ∈ K. Let us consider the following standard examples.

Example 2

The powerset theory P = (P, →, id, ρ) in the category Set is defined as follows:

1) The object function P : Set → CSLAT is defined by P(X) = (2^X, ⊆).
2) For each mapping f : X → Y in Set, f_P→ : 2^X → 2^Y is defined by f_P→ (A) = f(A), A ∈ 2^X.
3) For each X ∈ Set, ρ_X : X → 2^X is defined by ρ_X(x) = {x} ∈ 2^X.

Example 3

The powerset theory Z = (Z, →, id, χ) in the category Set is defined as follows:

1) The object function Z : Set → CSLAT is defined by Z(X) = (L^X, ≤), where ≤ is the pointwise ordering derived from a lattice .
2) For each mapping f : X → Y in Set, f_Z→ : L^X → L^Y is defined by

$\begin{array}{l} s \in L^{X}, y \in Y, \\ f_{\vec{Z}} (s) (y) = {\begin{array}{l} ⋁_{x \in f^{- 1} (y)} s (x), & f^{- 1} (y) \neq \emptyset, \\ 0_{L}, & otherwise . \end{array} \end{array}$
3) For each X ∈ Set, χ_X : X → L^X is the map such that χ_X(a) is the characteristic map of the singleton {a} in the set X, that is,

$x \in X, χ_{X} (a) (x) = {\begin{array}{l} 1_{L}, & x = a \\ 0_{L}, & otherwise . \end{array}$

The following definition of a monad in clone form was introduced by Manes [19].

Definition 3

T̃ = (T̃, ◊, η) is a monad in a category K if

1) T̃ : K → K is an object function.
2) η is a system of K-morphisms η_A : A → T̃(A) for any object A.
3) For each pair of K-morphisms f : A → T̃(B) and g : B → T̃(C), there exists a K-morphism (called a Kleisli composition) g◊f : A → T̃(C) such that the operation ◊ is associative.
4) For every K-morphism f : A → T̃(B), η_B◊f = f.
5) ◊ is compatible with composition of morphisms of K, that is, for each pair of K-morphisms f : A → B and g : B → T̃(C), we have g◊(η_B.f) = g.f.

It should be noted that if (T̃, ◊, η) is a monad in a category K, then T̃ : K → K is a functor. In fact, for each morphism f : A → B, the morphism T̃(f) is defined by

\tilde{T} (f) = (η_{B} . f) ⋄ 1_{\tilde{T} (A)} .

Moreover, η represents identities on both sides for ◊, that is, for each A → T̃(B),

η_{B} ⋄ f = f, f ⋄ η_{A} = f .

In this case, η : 1_K → T̃ is a natural transformation.

Let us recall some simple properties of Kleisli composition.

Lemma 1

Let T̃ = (T̃, ◊, η) be a monad in a category K. Let f : X → Y, g : Y → T̃(Z), h : Z → T̃(U), e : T̃(U) → W be morphisms in K. Then,

\begin{array}{l} h ⋄ (g . f) = (h ⋄ g) . f, e . (h ⋄ g) = (e . h) ⋄ g, \\ η_{z} ⋄ g = g ⋄ η_{y} . \end{array}

We now present well-known examples of monads in the category Set.

Example 4

The structure P̃ = (P̃, ◊, ρ) is defined as follows:

1) For each object X ∈ Set, P̃(X) = 2^X.
2) For each object X ∈ Set, η_X : X → P̃(X) is defined by ρ_X(x) = {x}.
3) For each f : X → P̃(Y), g : Y → P̃(Z), g◊f : X → P̃(Z) is defined by

$(g ⋄ f) (x) = ⋃_{y \in f (x)} g (y) .$

Example 5

Let L be a complete lattice with a t-norm ⊗. The structure Z̃ = (Z̃, ◊, χ) is defined as follows:

1) For each object X ∈ Set, the object function Z̃ : Set → Set is defined by Z̃(X) = L^X.
2) For each X ∈ Set, χ_X : X → L^X is the map such that χ_X(a) is the characteristic map of the singleton {a} in the set X.
3) For each f : X → Z̃(Y) and g : Y → Z̃(Q) in Set, g◊f : X → Z̃(Q) is defined by

$x \in X, z \in Q, [(g ⋄ f) (x)] (z) = \underset{y \in Y}{⋁} f (x) (y) \otimes g (y) (z) .$

Definition 4

where for an arbitrary K-morphism f : X → Y, T(f) and T̃(f) are defined as follows:

T (f) = f_{\vec{T}}, \tilde{T} (f) = (η_{Y} . f) ⋄ 1_{\tilde{T} (X)} .

Let us consider the following simple example of a powerset theory defined by a monad.

Example 6

The powerset theory Z is defined by the monad Z̃. In fact, by a simple calculation, for a map f : X → Y, we obtain

\begin{array}{l} s \in Z (X), y \in Y, \\ Z (f) (s) (y) = f_{\vec{Z}} (s) (y) = \underset{x \in X, f (x) = y}{⋁} s (x) \\ = (χ_{Y} . f) ⋄ 1_{\tilde{Z} (X)} (s) (y) = \tilde{Z} (s) (y), \end{array}

and the diagram from Definition 4 commutes. Hence, Z is defined by Z̃.

It is also clear that the powerset theory P is defined by the monad P̃.

3. Powerset Theory of Fuzzy Soft Sets

Let the object function W : and the functor V : be defined by

\begin{array}{l} W (X, L) = {f | f : X \to L} = (L^{X}, \leq), \\ V (X, L) = X, V (f, ϕ) = f, \end{array}

where ≤ is the pointwise ordering, and for an arbitrary morphism (f, ϕ) : (X, L) → (Y, M), the powerset extension (f, ϕ)_W⃗ : W(X, L) → W(Y, M) is defined by

\begin{array}{l} s \in L^{X}, y \in Y, \\ {(f, ϕ)}_{\vec{W}} (s) (y) = {\begin{array}{l} ⋁_{x \in X, f (x) = y} ϕ (s (x)), & f^{- 1} (y) \neq \emptyset, \\ 0_{M}, & otherwise . \end{array} \end{array}

Moreover, for (X, L), the map χ₍_X_,_L₎ : X → W(X, L) is defined by

x, z \in X, χ_{(X, L)} (x) (z) = {\begin{array}{l} 1_{L}, & iff x = z, \\ 0_{L}, & otherwise, \end{array}

The following theorem ensuring the existence of variable-base fuzzy set powerset theory was proven by Rodabaugh [24].

Theorem 1

Proposition 1

Let be the category of complete residuated lattices. Then, there exists a monad W̃ = (W̃, Δ, ν) in the category such that W̃ defines the powerset theory W.

Proof

Let the object function W̃ : be defined by

(X, L) \in Set \times C, \tilde{W} (X, L) = (W (X, L), L) \in Set \times C .

\begin{array}{l} (g, ψ) Δ (f, ϕ) = (g ⋄ f, ψ . ϕ), \\ g ⋄ f : X \to W (Z, N), \\ x \in X, z \in Y, g ⋄ f (x) (z) = \underset{y \in Y}{⋁} ψ (f (x) (y)) \otimes g (y) (z) . \end{array}

By a simple computation, it can be proven that the operation Δ is associative, and that the following equalities hold:

\begin{array}{l} \forall (f, ϕ) : (X, L) \to (Y, M), (g, ψ) : (Y, M) \to \tilde{W} (Z, N), \\ ν_{(Y, M)} Δ (f, ϕ) = (f, ϕ), \\ (g, ψ) . (f, ϕ) = (g, ψ) Δ (χ_{Y}, {i d}_{M}) . (f, ϕ), \end{array}

by the identity g ◇ (χ_Y.f) = (g ◇ χ_Y ).f = g.f. Hence, W̃ is a monad in the category .

We now show that the powerset theory W is defined by W̃. To this end, we should prove that the following diagram commutes:

where for an arbitrary morphism (f, ϕ) : (X, L) → (Y, M),

1) W(f, ϕ) := (f, ϕ)_W→,
2) W̃(f, ϕ) = (ν₍_Y_,_M₎.(f, ϕ) Δ 1_W̃₍_X_,_L₎.

We have VW̃(f, ϕ) = V(χ_Y.f ◇ 1_W₍_X_,_L₎, id_L) = χ_Y.f ◇ 1_W₍_X_,_L₎, and for arbitrary s ∈ W(X, L), y ∈ Y, we obtain

\begin{array}{l} χ_{Y} . f ⋄ 1_{W (X, L)} (s) (y) \\ = \underset{x \in X}{⋁} ϕ (1_{W (X, L)} (s) (x)) \otimes χ_{Y} (f (x)) (y) \\ = {(f, ϕ)}_{\vec{X}} (s) (y) . \end{array}

Therefore, W is defined by the monad W̃.

\begin{array}{l} (X, U, L) \in Set \times {Set}_{0} \times C, \\ T (X, U, L) = {(E, s) | E \subseteq X, s : E \to L^{U}} . \end{array}

Theorem 2

Proof

Let (X, U, L) be an object in the category . In the set T(X, U, L), we define an order relation by

\begin{array}{l} (E, s), (F, t) \in T (X, U, L), \\ (E, s) ≼ (F, t) iff E \subseteq F, (\forall e \in E) s (e) \leq t (e) in L^{U} . \end{array}

It is clear that T(X, U, L) is a complete ⋁-semilattice with respect to this ordering, where for a system {(E_i, s_i) : i ∈ I} ⊆ T(X, U, L), we have

\begin{array}{l} \underset{i \in I}{⋁} (E_{i}, s_{i}) = (⋃_{i \in I} E_{i}, s), s : ⋃_{i \in I} E_{i} \to L^{U}, \\ x \in ⋃_{i \in I} E_{i}, s (x) = \underset{j \in I, x \in E_{j}}{⋁} s_{j} (x) . \end{array}

Let R : be a forgetful functor defined by R(X, U, L) = X, R(f, g, ϕ) = f.

For an arbitrary object (X, U, L) and x, z ∈ X, we set

\begin{array}{l} η_{(X, U, L)} : X \to T (X, U, L), η_{(X, U, L)} (x) = ({x}, η_{x}), \\ η_{x} : {x} \to L^{U}, η_{x} (x) = {\underline{1}}_{L}, \end{array}

where 1_L, 0_L are constant fuzzy sets in U with values 1_L, 0_L, respectively, and for a K-morphism (f, g, ϕ) : (X, U, L) → (Y, V, M), we set

\begin{array}{l} {(f, g, ϕ)}_{\vec{T}} : T (X, U, L) \to T (Y, V, M), \\ (E, s) \in T (X, U, L), {(f, g, ϕ)}_{\vec{T}} (E, s) = (f (E), \vec{s}), \\ \vec{s} : f (E) \to M^{V}, \\ y \in f (E), v \in V, \\ \vec{s} (y) (v) = \underset{u \in g^{- 1} (v)}{⋁} \underset{{z \in f^{- 1} (y) ⋁ E}}{⋁} ϕ (s (z) (u)), \end{array}

We prove that this diagram commutes. In fact, as g is a surjective map, for x ∈ X, v ∈ V, we have

\begin{array}{l} {(f, g, ϕ)}_{\vec{T}} (η_{(X, U, L)} (x)) = {(f, g, ϕ)}_{\vec{T}} ({x}, η_{x}) \\ = ({f (x)}, η_{\vec{x}}), \\ η_{\vec{x}} (f (x)) (v) = \underset{u \in g^{- 1} (v)}{⋁} \underset{z \in f^{- 1} (f (x)) ⋁ {x}}{⋁} ϕ (η_{x} (z) (u)) \\ = 1_{M} = η_{{f (x)}} (f (x)) . \end{array}

Hence, ({f(x)}, η_→) = ({f(x)}, η_{_f₍_x_)}), and the diagram commutes. Therefore, T is a CSLAT-powerset theory.

Unlike the proof of this statement in the case of fuzzy sets, the proof for fuzzy soft sets is more complicated.

Theorem 3

Let be the category of complete residuated lattices. There exists a monad T̃ = (T̃, ⊙, ξ) in the category such that the variable-basis fuzzy soft set powerset theory T is defined by T̃.

Proof

Let the object function T̃ : be defined by

\begin{array}{l} (X, U, L) \in Set \times {Set}_{0} \times C, \\ \tilde{T} (X, U, L) = (T (X, U, L), U, L), \end{array}

where T(X, U, L) is identified with the underlying set of a complete lattice from Theorem 2. Let the morphism ξ₍_X_,_U_,_L₎ be defined by

\begin{array}{l} ξ_{(X, U, L)} : (X, U, L) \to \tilde{T} (X, U, L), \\ ξ_{(X, U, L)} = (η_{(X, U, L)}, 1_{U}, 1_{L}), \end{array}

where η₍_X_,_U_,_L₎ is from Theorem 2. For morphisms

\begin{array}{l} (f, k, ϕ) : (X, U, L) \to \tilde{T} (Y, V, M), \\ (g, j, ψ) : (Y, V, M) \to \tilde{T} (Z, W, N), \end{array}

we define the composition

(1)

\begin{array}{l} (g, j, ψ) ⊙ (f, k, ϕ) \\ = (g ⋄ f, j . k, ψ . ϕ) : (X, U, L) \to \tilde{T} (Z, W, N), \end{array}

where ◊ is a composition map that is defined as follows. If f : X → T(Y, V, M) is a map, then for x ∈ X, we use the notation

(2)

f (x) = (Y_{x}^{f}, f_{x}) \in T (Y, V, M),

where $\emptyset \neq Y_{x}^{f} \subseteq Y$ and $f_{x} : Y_{x}^{f} \to M^{V}$ . Then, for maps f : X → T(Y, V, M) and g : Y → T(Z, W, N), we define the composition map g◊f : X → T(Z, W, N) by

(3)

x \in X, g ⋄ f (x) = (Z_{x}^{g ⋄ f}, {(g ⋄ f)}_{x}) \in T (Z, W, N),

(4)

Z_{x}^{g ⋄ f} = ⋃_{y \in Y_{x}^{f}} Z_{y}^{g}, {(g ⋄ f)}_{x} : Z_{x}^{g ⋄ f} \to N^{W},

(5)

\begin{array}{l} a \in Z_{x}^{g ⋄ f}, w \in W, \\ {(g ⋄ f)}_{x} (a) (w) = \underset{{y \in Y_{x}^{f} : a \in Z_{y}^{g}}}{⋁} ψ (f_{x} (y) (j^{- 1} (w))) \otimes g_{y} (a) (w), \end{array}

where

\forall x \in X, \forall y \in Y_{x}^{f} f (x) = (Y_{x}^{f}, f_{x}), g (y) = (Z_{y}^{g}, g_{y}) .

◊ is well defined because j is a bijection. We now prove that T̃ = (T̃, ⊙, ξ) is a monad in the category . In fact, let

\begin{array}{l} (f, k, ϕ) : (X, U, L) \to \tilde{T} (Y, V, M), \\ (g, j, ψ) : (Y, V, M) \to \tilde{T} (Z, W, N), \\ (h, m, ω) : (Z, W, N) \to \tilde{T} (R, Q, S) . \end{array}

We prove that the operation ⊙ is associative. We have

\begin{array}{l} (h, m, ω) ⊙ ((g, j, ψ) ⊙ (f, k, ϕ)) = (h ⋄ (g ⋄ f), m . j . k, ω . ψ . ϕ), \\ ((h, m, ω) ⊙ (g, j, ψ)) ⊙ (f, k, ϕ) = ((h ⋄ g) ⋄ f), m . j . k, ω . ψ . ϕ), \end{array}

and we need only prove that h◊(g◊f) = (h◊g)◊f : X → T(R, Q, S). Let x ∈ X. Then, using relations (2), (3), and (4), we obtain

\begin{array}{l} (h ⋄ (g ⋄ f)) (x) = (R_{x}^{h ⋄ (g ⋄ f)}, {(h ⋄ (g ⋄ f))}_{x}) \\ = (⋃_{z \in X_{x}^{g ⋄ f}} R_{z}^{h}, {(h ⋄ (g ⋄ f))}_{x}) \\ = (⋃_{z \in \cup_{y \in Y_{x}^{f}} Z_{y}^{g}} R_{z}^{h}, {(h ⋄ (g ⋄ f))}_{x}) \\ ((h ⋄ g) ⋄ f) (x) = (R_{x}^{(h ⋄ g) ⋄ f}, {((h ⋄ g) ⋄ f)}_{x}) \\ = (⋃_{y \in Y_{x}^{f}} R_{y}^{h ⋄ g}, {((h ⋄ g) ⋄ f)}_{x}) \\ = (⋃_{y \in Y_{x}^{f}} ⋃_{z \in Z_{y}^{g}} R_{z}^{h}, {((h ⋄ g) ⋄ f)}_{x}) . \end{array}

By a simple calculation, it can be proven that

R_{x}^{h ⋄ (g ⋄ f)} = ⋃_{z \in \cup_{y \in Y_{x}^{f}} Z_{y}^{g}} R_{z}^{h} = ⋃_{y \in Y_{x}^{f}} ⋃_{z \in Z_{y}^{g}} R_{z}^{h} = R_{x}^{(h ⋄ g) ⋄ f} .

We prove that ((h◊g)◊f)_x = (h◊(g◊f))_x. Using the notation (2), we obtain the following maps:

\begin{array}{l} x \in X, f_{x} : Y_{x}^{f} \to M^{V}, Y_{x}^{f} \subseteq Y, \\ y \in Y, g_{y} : Z_{y}^{g} \to N^{W}, Z_{y}^{g} \subseteq Z, \\ z \in Z, h_{z} : R_{z}^{h} \to S^{Q}, R_{z}^{h} \subseteq R, \\ x \in X, {(g ⋄ f)}_{x} : Z_{x}^{g ⋄ f} \to N^{W}, Z_{x}^{g ⋄ f} \subseteq Z, \\ y \in Y, {(h ⋄ g)}_{y} : R_{x}^{h ⋄ g} \to S^{Q}, R_{y}^{h ⋄ g} \subseteq R . \end{array}

For $a \in R_{x}^{h ⋄ (g ⋄ f)}$ , q ∈ Q, using definition (5), we obtain

\begin{array}{l} {(h ⋄ (g ⋄ f))}_{x} (a) (q) \\ = \underset{{z \in Z_{x}^{g ⋄ f} : a \in R_{z}^{h}}}{⋁} ω ({(g ⋄ f)}_{x} (z) (m^{- 1} (q))) \otimes h_{z} (a) (q) \\ = \underset{{z \in Z_{x}^{g ⋄ f} : a \in R_{z}^{h}}}{⋁} \underset{{y \in Y_{x}^{f} : z \in Z_{y}^{g}}}{⋁} [ω . ψ (f_{x} (y) (j^{- 1} (w))) \otimes ω (g_{y} (z) (m^{- 1} (q))) \otimes h_{z} (a) (q)] \\ = \underset{{z \in \cup_{y \in Y_{x}^{f}} Z_{y}^{g} : a \in R_{z}^{h}}}{⋁} \underset{{y \in Y_{x}^{f} : z \in Z_{y}^{g}}}{⋁} [ω . ψ (f_{x} (y) (j^{- 1} (w))) \otimes ω (g_{y} (b) (m^{- 1} (q))) \otimes h_{z} (a) (q)] \\ = \underset{(v, w, z, y) \in A}{⋁} Δ (v, w, z, y), \end{array}

where

\begin{array}{l} A = {(v, w, z, y) : j (v) = w, m (w) = q, y \in Y_{x}^{f}, z \in Z_{y}^{g}, a \in R_{z}^{h}}, \\ Δ (v, w, z, y) = ω . ψ (f_{x} (y) (v)) \otimes ω (g_{y} (z) (w)) \otimes h_{z} (a) (q) . \end{array}

Analogously, we obtain

\begin{array}{l} {((h ⋄ g) ⋄ f)}_{x} (a) (q) \\ = \underset{{y \in Y_{x}^{f} : a \in R_{y}^{h ⋄ g}}}{⋁} ω . ψ (f_{x} (y) ({(m . j)}^{- 1} (q))) \otimes {(h ⋄ g)}_{y} (a) (q) \\ = \underset{{y \in Y_{x}^{f} : a \in \cup_{z \in Z_{y}^{g}} R_{z}^{h}}}{⋁} \underset{{z \in Z_{y}^{g} : a \in R_{z}^{h}}}{⋁} [ω ψ (f_{x} (y) ({(m . j)}^{- 1} (q))) \otimes ω (g_{y} (z) (m^{- 1} (q))) \otimes h_{z} (a) (q)] \\ = \underset{(v, w, z, y) \in B}{⋁} Δ (v, w, z, y), \end{array}

where

B = {(v, w, z, y) : m (w) = q, m . j (v) = q, y \in Y_{x}^{f}, z \in Z_{y}^{g}, a \in R_{z}^{h}} .

As j and m are bijective maps, we obtain A=B, (h◊(g◊f))_x = ((h◊g)◊f)_x, and the operation ◊ is associative. Thus, the operation ⊙ is associative.

We show that for arbitrary morphism (f, k, ϕ) : (X, U, L) → T̃(Y, V, M), the identity

\begin{array}{l} ξ_{(Y, V, M)} ⊙ (f, k, ϕ) = (η_{(X, U, L)}, 1_{V}, 1_{M}) ⊙ (f, k, j) \\ = (η_{(X, U, L)} ⋄ f, k, ϕ) = (f, k, ϕ) \end{array}

holds. In fact, from the definition of η and relations (3) and (4), we obtain

\begin{array}{l} x \in X, \\ (η_{(X, U, L)} ⋄ f) (x) = (⋃_{y \in Y_{x}} {y} = Y_{x}^{f}, {(η_{(X, U, L)} ⋄ f)}_{x}), \\ {(η_{(X, U, L)} ⋄ f)}_{x} : Y_{x}^{f} \to M^{V}, \\ a \in Y_{x}^{f}, v \in V, \\ {(η_{(X, U, L)} ⋄ f)}_{x} (a) (v) = f_{x} (a) (v) \otimes η_{a} (a) (v) = f_{x} (a) (v), \\ and (η_{(X, U, L)} ⋄ f) (x) = (Y_{x}^{f}, {(η_{(X, U, L)} ⋄ f)}_{x}) = (Y_{x}^{f}, f_{x}) = f (x) . \end{array}

We show that for morphisms (f, k, ϕ):(X, U, L)→(Y, V, M) and (g, j, ψ) : (Y, V, M) → T̃(Z, W, M), the following identity holds:

(6)

(g, j, ψ) ⊙ (ξ_{(Y, V, M)}, (f, k, ϕ)) = (g, j, ψ), (f, k, ϕ),

In fact, we have

\begin{array}{l} (g, j, ψ) ⊙ (ξ_{(Y, V, M)}, (f, k, ϕ)) \\ = (g ⋄ (η_{(Y, V, M)}, f), j . k, ψ . ϕ) . \end{array}

Hence, we should prove that g◊(η₍_Y_,_V_,_M₎.f) = g.f. For simplicity, instead of η₍_Y_,_V_,_M₎, we write only η. For x ∈ X, according to relations (3) and (4), we have

\begin{array}{l} η . f (x) = η (f (x)) = (Y_{x}^{η . f} = {f (x)}, η_{f (x)}), \\ (g ⋄ η . f) (x) = (Z_{x}^{g ⋄ η . f}, {(g ⋄ η . f)}_{x}), \\ Z_{x}^{g ⋄ η . f} = ⋃_{y \in Y_{x}^{η . f}} Z_{y}^{g} = Z_{f (x)}^{g}, \\ {(g ⋄ η . f)}_{x} : Z_{f (x)}^{g} \to N^{W} . \end{array}

Let $a \in Z_{f (x)}^{g}$ , w ∈ W. Then, according to relation (5), we have

\begin{array}{l} {(g ⋄ η . f)}_{x} (a) (w) = \underset{{y \in Y_{x}^{η . f} | a \in Z_{y}^{g}}}{⋁} {(η . f)}_{x} (y) (j^{- 1} (w)) \otimes g_{y} (a) (w) \\ = η_{f (x)} (f (x)) (j^{- 1} (w)) \otimes g_{f (x)} (a) (w) = g_{f (x)} (a) \\ = {(g . f)}_{x} (a) (w) . \end{array}

Furthermore, we have

\begin{array}{l} (g . f) (x) = g (f (x)) = (Z_{f (x)}^{g}, g_{f (x)}) \\ = (Z_{x}^{g ⋄ η . f}, {(g ⋄ η . f)}_{x}) \\ = (g ⋄ η . f) (x) . \end{array}

Hence, identity (6) holds, and we proved that T̃ = (T̃, ⊙, ξ) is a monad in the category .

Finally, we prove that the monad T̃ defines the powerset theory T. We should prove that the following functor diagram commutes:

where for a morphism (f, k, ϕ) : (X, U, L) → (Y, V, M) in the category ,

\begin{array}{l} T (f, k, ϕ) = {(f, k, ϕ)}_{\vec{T}} : T (X, U, L) \to T (Y, V, M), \\ \tilde{T} (f, k, ϕ) = (ξ_{(Y, V, M)} . (f, k, ϕ)) ⊙ 1_{\tilde{T} (X, U, L)} : \tilde{T} (X, U, L) \to \tilde{T} (Y, V, M) . \end{array}

It is clear that the diagram commutes for objects of the category. According to the definition of the powerset theory in Theorem 2, for (E, s) ∈ T(X, U, L), we have

\begin{array}{l} {(f, k, ϕ)}_{\vec{T}} (E, s) = (f (E), s^{\to}), \\ R \tilde{T} (f, k, ϕ) (E, s) \\ = R ((ξ_{(Y, V, M)} . (f, k, ϕ)) ⊙ 1_{\tilde{T} (X, U, L)}) (E, s) \\ = R ((η_{(Y, V, M)} . f ⋄ 1_{T (X, U, L)}, k, ϕ)) (E, s) \\ = (η_{(Y, V, M)} . f ⋄ 1_{T (X, U, L)}) (E, s) . \end{array}

According to relations (3) and (4), we have

\begin{array}{l} (η . f ⋄ 1_{T (X, U, L)}) (E, s) \\ = (Y_{(E, s)}^{η . f ⋄ 1_{T (X, U, L)}}, {(η . f ⋄ 1_{T (X, U, L)})}_{(E, s)}), \\ Y_{(E, s)}^{η . f ⋄ 1_{T (X, U, L)}} = ⋃_{x \in E} Y_{x}^{η . f} ⋃_{x \in E} {f (x)} = f (E), \\ (E, s) = 1_{T (X, U, L)} (E, s) = (X_{(E, s)}^{1_{T (x, U, L)}}, 1_{T (X, U, L), (E, s)}) . \end{array}

Therefore, for a ∈ f(E), v ∈ V, we obtain

\begin{array}{l} {(η . f ⋄ 1_{T (X, U, L)})}_{(E, s)} (a) (v) \\ = \underset{{z \in E | a = f (z)}}{⋁} ϕ (s (z) (k^{- 1} (v))) \otimes {(η . f)}_{z} (a) (v) \\ = ⋃_{{z \in E | a = f (z)}} ϕ (s (z) (k^{- 1} (v))) \otimes η_{a} (a) (v) = \vec{s} (a) (v) . \end{array}

Therefore, RT̃(f, k, ϕ)(E, s) = (f(E), s^→) = T(f, k, ϕ)(E, s), and the functor diagram commutes. Hence, T is defined by the monad T̃.

The notion of a morphism of powerset theories is introduced in the following definition. We recall that the commutativity of the diagram

implies that g.u ≥ v.f, where D is an object with ordering ≤.

Definition 5

1) G : K → J is a functor.
2) Φ_X : T(X) → R(G(X)) is a morphism in the category CSLAT.
3) Ψ_X : V (X) → U(G(X)) is a map in the category Set.
4) For each morphism f : X → Y in K, the following diagrams commute:

that is, G(f)^⇒.Φ_X ≥ Φ_Y.f_T⃗, where ≤ is the ordering in the CSLAT object R(G(Y)).

A morphism (G, Φ, Ψ) is called an embedding if R : K ↪ J is an embedding functor, Φ_X is a monomorphism in the category CSLAT, and Ψ is an injective map.

We now prove that there is an embedding morphism between the powerset theories W and T that interprets the relationship between classical fuzzy sets and fuzzy soft sets.

Proposition 2

Let be the category of complete lattices. Then, there exists an embedding morphism of CSLAT-powerset pairs

(G, Φ, Ψ) : (Set \times C, W) \to (Set \times {Set}_{1} \times C, T) .

Therefore, the variable-basis fuzzy set powerset theory is a special case of the variable-basis fuzzy soft set powerset theory.

Proof

We define the functor G : by

G (X, L) = (X, {*}, L), G (f, ϕ) = (f, 1_{*}, ϕ),

where 1_* : {*} → {*}. It is clear that G is an embedding functor. For , we set

\begin{array}{l} Φ_{(X, L)} : W (X, L) ↪ T (G (X, L)) = T (X, {*}, L), \\ s \in W (X, L), Φ_{(X, L)} (s) = (E_{s}, [s]), \\ E_{s} = {z \in X : s (x) \neq 0_{L}}, [s] : E_{s} \to L^{{*}}, \\ z \in E_{s}, [s] (z) (*) = s (z), \\ Ψ_{(X, L)} = 1_{X} : X \to X . \end{array}

It is clear that Φ₍_X_,_L₎ is a complete ⋁-semilattice homomorphism. In fact, we have

\begin{array}{l} Φ_{(X, L)} (\underset{i \in I}{⋁} s_{i}) = (E_{⋁_{i \in I} s_{i}}, [\underset{i \in I}{⋁} s_{i}]) = (⋃_{i \in I} E_{s_{i}}, \underset{i \in I}{⋁} [s_{i}]) \\ = \underset{i \in I}{⋁} Φ_{(X, L)} (s_{i}), \end{array}

where [s_i] is considered an L^{*}-valued fuzzy set in E_{⋁_i}_s_{_i}. We show that the following diagram commutes:

Let x ∈ X. We obtain

\begin{array}{l} η_{(G (X, L)} (x) = ({x}, η_{x}), \\ η_{x} : {x} \to L^{{*}}, η_{x} (x) (*) = 1_{L}, \\ Φ_{(X, L)} (χ_{(X, L)} (x)) = (E_{χ (X, L)} (x), [χ_{(X, L)} (x)]) \\ = ({x}, [χ_{(X, L)} (x)]), \\ [χ_{(X, L)} (x)] (x) (*) = 1_{L} . \end{array}

Hence, the diagram commutes. We show that for an arbitrary morphism (f,ϕ) : (X, L) → (Y, M), inequality holds in the diagram

Let s ∈ W(X, L). From the proof of Theorem 2, we have

\begin{array}{l} {(f, 1_{*}, ϕ)}_{\vec{T}} (φ_{(X, L)} (s)) = {(f, 1_{*}, ϕ)}_{\vec{T}} (E_{s}, [s]) \\ = (f (E_{s}), {[s]}^{\to}), \\ {[s]}^{\to} : f (E_{s}) \to M^{{*}}, \\ f (x) \in f (E_{s}), {[s]}^{\to} (f (x)) (*) = \underset{z \in f^{- 1} (f (x)) ⋁ E_{s}}{⋁} ϕ (s (z)) . \end{array}

Moreover, we have

\begin{array}{l} Φ_{(Y, M)} ({(f, ϕ)}_{\vec{W}} (s)) = (F, t^{\to}), \\ F = {y \in Y : {(f, ϕ)}_{\vec{W}} (s) (y) \neq 0_{M}} \\ = {y \in Y : f^{- 1} (y) \neq \emptyset, \underset{x \in f^{- 1} (y)}{⋁} ϕ (s (x)) \neq 0_{M}}, \\ t^{\to} : F \to M^{{*}}, \\ y \in F, t^{\to} (y) (*) = {(f, ϕ)}_{\vec{W}} (s) (y) = \underset{x \in f^{- 1} (y)}{⋁} ϕ (s (x)) \\ = \underset{x \in f^{- 1} (y) ⋁ E_{s}}{⋁} ϕ (s (x)) . \end{array}

As F ⊆ f(E_s), for f(x) ∈ F, we obtain

t^{\to} (f (x)) (*) = \underset{z \in f^{- 1} (f (x)) ⋁ E_{s}}{⋁} ϕ (s (z)) = {[s]}^{\to} (f (x)) (*),

and (F, t^→) ⪯ (f(E_s), [s]^→). Therefore,

(G, Φ, Ψ) : (Set \times C, W) \to (Set \times {Set}_{1} \times C, T) .

is a morphism of powerset pairs.

To this end, we recall that for an arbitrary lattice L and a set X, L^X is also a lattice with the ordering defined pointwise and with properties analogous to those of the lattice L.

Proposition 3

Let be the category of complete ⋁-semilattices with complete semilattice homomorphisms. Then, there exists a morphism of powerset pairs

(H, Λ, Θ) : (Set \times {Set}_{1} \times C, T) \to (Set \times C, W),

called a transformation of a fuzzy soft sets to fuzzy sets.

Proof

For arbitrary morphism (f, g, ϕ) : (X, U, L) → (Y, V, M), let the functor H : be defined by

\begin{array}{l} H (X, U, L) = (X, L^{U}), \\ H (f, g, ϕ) = (f, {(g, ϕ)}_{\vec{W}}) : (X, L^{U}) \to (Y, M^{V}), \end{array}

where (g, ϕ)_W⃗ is a morphism from the definition of the variable-basis powerset theory W. For an arbitrary object (X, U, L), we set

\begin{array}{l} Λ_{(X, U, L)} : T (X, U, L) \to W (X, L^{U}), \\ (E, s) \in T (X, U, L), Λ_{(X, U, L)} (E, s) : X \to L^{U}, \\ x \in X, u \in U, \\ Λ_{(X, U, L)} (E, s) (x) (u) = {\begin{array}{l} s (x) (u), & x \in E, \\ 0_{L}, & otherwise, \end{array} \\ Θ_{(X, U, L)} = 1_{X} : X = R (X, U, L) \to X = V (X, L^{U}) . \end{array}

For x, z ∈ X, u ∈ U,

χ_{(H (X, U, L)} (x) (z) (u) = {\begin{array}{l} 1_{L}, & x = z, \\ o_{L}, & otherwise . \end{array}

Moreover,

\begin{array}{l} Λ_{(X, U, L)} (η_{(X, U, L)} (x)) = Λ_{(X, U, L)} ({x}, η_{x}) : X \to L^{U}, \\ Λ_{(X, U, L)} ({x}, η_{x}) (z) (u) = {\begin{array}{l} η_{x} (x) (u) = 1_{L}, & z = x, \\ 0_{L}, & otherwise, \end{array} \end{array}

and the diagram commutes. Finally, we prove that for any morphism (f, g, ϕ) : (X, U, L) → (Y, V, M), the following diagram commutes:

We recall that g is a bijection map. For (E, s) ∈ T(X, U, L) and y ∈ Y, v ∈ V, we have

\begin{array}{l} {(f, {(g, ϕ)}_{\vec{W}})}_{\vec{W}} (Λ_{(X, U, L)} (E, s)) (y) (v) \\ = {\begin{array}{l} \underset{x \in f^{- 1} (y)}{⋁} {(g, ϕ)}_{\vec{W}} (Λ_{(X, U, L)} (E, s) (x)), & f^{- 1} (y) \neq \emptyset, \\ 0_{M}, & otherwise \end{array} \\ = {\begin{array}{l} \underset{x \in f^{- 1} (y)}{⋁} ϕ (Λ_{(X, U, L)} (E, s) (x) (g^{- 1} (v))), & f^{- 1} (y) \neq \emptyset, \\ 0_{M}, & otherwise, \end{array} \\ = {\begin{array}{l} \underset{x \in f^{- 1} (y) ⋁ E}{⋁} ϕ (s (x) (g^{- 1} (v))), & f^{- 1} (y) ⋁ E \neq \emptyset, \\ 0_{M}, & otherwise \end{array} . \end{array}

Moreover, we have

\begin{array}{l} Λ_{(X, U, L)} ({(f, g, ϕ)}_{\vec{T}} (E, s) (y) (v)) \\ = Λ_{(X, U, L)} (f (E), s^{\to}) (y) (v) \\ = {\begin{array}{l} s^{\to} (y) (v), & y \in f (E), \\ 0_{M}, & otherwise \end{array} \\ = {\begin{array}{l} ⋁_{x \in f^{- 1} (y) ⋁ E} ϕ (s (x) (g^{- 1} (v))), & f^{- 1} (y) ⋁ E \neq \emptyset \\ 0_{M}, & otherwise. \end{array} \end{array}

Therefore, the diagram commutes, and (H, Λ, Θ) is a morphism of powerset pairs.

By a simple calculation we obtain the following corollary.

Corollary 1

The composition

(H, Λ, Θ) . (G, Φ, Ψ) : (Set \times C, W) \to (Set \times C, W)

is the identity morphism of powerset pairs.

4. Fuzzy Soft Relations: An Application of Powerset Theory

1) a ∈ T(X), c(a) ≥ a,
2) a, b ∈ T(X), c(a ∨ b) = c(a) ∨ c(b),
3) a ∈ T(X), c(c(a)) = c(a).

To clarify this relationship, we first consider the general situation of the powerset objects in a category that is defined by a monad in this category.

Definition 6

Let K be a category, and let T̃ = (T̃, ◊, η) be a monad in K. Then, the Kleisli category K_T̃ of T̃ is defined as follows:

1) Objects of K_T̃ are the same as objects of K.
2) For arbitrary objects A, B ∈ K, Hom_K_{_T̃} (A, B)=Hom_K (A, T̃(B)). Morphisms in K_T̃ are denoted by A ⇝ B.
3) A composition of morphisms f : A ⇝ B, g : B ⇝ C is defined by g◊f.

Definition 7

Let K be a category, and let T = (T, →, V, χ) be a powerset theory in K defined by a monad T̃ = (T̃, ◊, η).

1) Let X be an object of K. Then, R is a T-relation on X if R : V (X) → T(X) is a morphism in Set such that R = V (R̃), where R̃ : X → T̃(X) is a morphism in K.
2) Let R and S be T-relations on X and Y, respectively. A morphism f : R → S between relations is a morphism f : X → Y in K such that in the diagram

we have

$f_{\vec{T}} . R \leq S . V (f),$

where ≤ is the pointwise ordering inherited from the semilattice T(X).

S \circ R : = V (\tilde{S} ⋄ \tilde{R}) : V (X) \to V \tilde{T} (X) = T (X) .

The following examples illustrate the importance of T-relations in classical set and fuzzy set theories.

Example 7

Therefore, the category of P-relations is isomorphic to the classical category of sets with relations with the corresponding morphisms. This category is isomorphic to the Kleisli category Set_P̃.

Example 8

It can be easily proven that f is a morphism if and only if

R (x, x^{'}) \leq S (f (x), f (x^{'}))

Definition 8

Let (X, U, L) be an object in .

1) A fuzzy soft relation in (X, U, L) is a fuzzy soft set in the space (X × X, U, L).
2) If (E, R) and (F, S) are fuzzy soft relations in (X, U, L), their composition is a fuzzy soft relation defined by

$\begin{array}{l} (F, S) \oplus (E, R) = (E . F, S \circ R), \\ E . F = {(x, z) \in X^{2} : \exists y \in X, (x, y) \in E, (y, z) \in F}, \\ (x, z) \in E . F, \\ (S \circ R) (x, z) (u) \\ = \underset{{y | (x, y) \in E, (y, z) \in F}}{⋁} R (x, y) (u) \otimes S (y, z) (u) . \end{array}$
3) Let (E, R) and (F, S) be fuzzy soft relations in (X, U, L) and (Y, V, M), respectively. Then, (f, g, ϕ) : (E, R) → (F, S) is a morphism of fuzzy soft relations if
- (a) (f, g, ϕ) : (X, U, L) → (Y, V, M) is a morphism in the category K.
- (b) For arbitrary (a, b)∈E and u∈U, we have (f(a), f(b)) ∈ F and
  
  $ϕ (R (a, b) (u)) \leq S (f (a), f (b)) (g (u)) .$

Proposition 4

\begin{array}{l} ℛ (χ) = {(E, S) | (E, S) is a fuzzy soft relation (Definition 8) in χ}, \\ ℛ_{T} (χ) = {r | r : X \to T (χ) is a T - relation (Definition 7) on χ} . \end{array}

1) There exists a bijective map

$α : ℛ (χ) \overset{≅}{\to} ℛ_{T} (χ) .$
2) If , then

$α ((F, S) \oplus (E, Q)) = α (F, S) ⋄ α (E, Q),$

where the clone composition ◊ is defined by relations (3) and (4).

Proof

1) Let (E, S) be a fuzzy soft relation in defined in Definition 8. To define the map α, for arbitrary x ∈ X, we set $X_{x}^{E} = {z \in X : (z, x) \in E}$ . Clearly, $E = \cup_{x \in X} X_{x}^{E} \times {x}$ , and we can define a map α by

\begin{array}{l} α (E, R) = r : X \to T (χ), \\ \forall x \in X, r (x) = (X_{x}^{E}, S_{x}) \in T (χ), \\ z \in X_{x}^{E}, u \in U, S_{x} (z) (u) : = S (z, x) (u) . \end{array}

Conversely, let s : be a map, where, using the notation (2), we have

\forall x \in X, s (x) = (X_{x}^{s}, s_{x}) \in T (χ),

$X_{x}^{s} \subseteq X, s_{x} : X_{x}^{s} \to L^{U}$ . We define a fuzzy soft relation α⁻¹(s) = (F, Q) in by

\begin{array}{l} F = ⋃_{x \in X} X_{x}^{s} \times {x} \subseteq X \times X, \\ (y, x) \in F, u \in U, Q (y, x) (u) = s_{x} (y) (u) . \end{array}

By a simple calculation, we obtain α⁻¹.α(E, S) = (E, S) and α.α⁻¹(s) = s.

2) Let (E, Q), (F, S) be fuzzy soft relations in (X, U, L), and let

\begin{array}{l} α (E, Q) = r, α (F, S) = s, \\ \forall x \in X, r (x) = (X_{x}^{E}, r_{x}), s (x) = (X_{x}^{F}, s_{x}) . \end{array}

According to identities (3), (4), and (5), we obtain

\begin{array}{l} x \in X, (s ⋄ r) (x) = (X_{x}^{s ⋄ r}, {(s ⋄ r)}_{x}), \\ X_{x}^{s ⋄ r} = ⋃_{y \in X_{x}^{E}} X_{y}^{F}, \\ z \in X_{x}^{s ⋄ r}, \\ {(s ⋄ r)}_{x} (z) = \underset{{y \in X_{x}^{E} | z \in X_{y}^{F}}}{⋁} r_{x} (y) (u) \otimes s_{y} (z) (u) \\ = \underset{{y | (x, y) \in E, (y, z) \in F}}{⋁} Q (x, y) (u) \otimes S (y, z) (u) \\ = S \circ Q (x, z) . \end{array}

It follows that $⋃_{x \in X} X_{x}^{s ⋄ r} \times {x} = E . F$ and s◊r = α(E.F, S∘ Q) = α((F, S) ⊕ (E, Q)).

5. Conclusion

Abstract
1. Introduction
2. Preliminaries
3. Powerset Theory of Fuzzy Soft Sets
4. Fuzzy Soft Relations: An Application of Powerset Theory
5. Conclusion

References

Molodtsov, D (1999). Soft set theory—first results. Computers & Mathematics with Applications. 37, 19-31. https://doi.org/10.1016/S0898-1221(99)00056-5
Maji, PK, Biswas, R, and Roy, AR (2003). Soft set theory. Computers & Mathematics with Applications. 45, 555-562. https://doi.org/10.1016/S0898-1221(03)00016-6
Maji, PK, Roy, AR, and Biswas, R (2002). An application of soft sets in a decision making problem. Computers & Mathematics with Applications. 44, 1077-1083. https://doi.org/10.1016/s0898-1221(02)00216-x
Majumdar, P, and Samanta, SK (2008). Similarity measure of soft sets. New Mathematics and Natural Computation. 4, 1-12. https://doi.org/10.1142/S1793005708000908
Aktas, H, and Cagman, N (2007). Soft sets and soft groups. Information Sciences. 177, 2726-2735. https://doi.org/10.1016/j.ins.2006.12.008
Feng, F, Jun, YB, and Zhao, X (2008). Soft semirings. Computers & Mathematics with Applications. 56, 2621-2628. https://doi.org/10.1016/j.camwa.2008.05.011
Chen, D, Tsang, ECC, Yeung, DS, and Wang, X (2005). The parameterization reduction of soft sets and its applications. Computers & Mathematics with Applications. 49, 757-763. https://doi.org/10.1016/j.camwa.2004.10.036
Mushrif, MM, Sengupta, S, and Ray, AK (2006). Texture classification using a novel, soft-set theory based classification algorithm. Computer Vision – ACCV2006. Heidelberg, Germany: Springer, pp. 246-254 https://doi.org/10.1007/1161203226
Maji, PK, Roy, AR, and Biswas, R (2001). Fuzzy soft sets. Journal of Fuzzy Mathematics. 9, 589-602.
Tanay, B, and Kandemir, MB (2015). Results on fuzzy soft functions. New Trends in Mathematical Sciences. 3, 1-17.
Athar, K, and Ahmad, B (2009). Mappings on fuzzy soft classes. Advances in Fuzzy Systems. 2009. article no. 407890
Roy, AR, and Maji, PK (2007). A fuzzy soft set theoretic approach to decision making problems. Journal of Computational and Applied Mathematics. 203, 412-418. https://doi.org/10.1016/j.cam.2006.04.008
Xiao, Z, Gong, K, and Zou, Y (2009). A combined forecasting approach based on fuzzy soft sets. Journal of Computational and Applied Mathematics. 228, 326-333. https://doi.org/10.1016/j.cam.2008.09.033
Zou, Y, and Xiao, Z (2008). Data analysis approaches of soft sets under incomplete information. Knowledge-Based Systems. 21, 941-945. https://doi.org/10.1016/j.knosys.2008.04.004
Pei, D, and Miao, D . From soft sets to information systems., Proceedings of 2005 IEEE International Conference on Granular Computing, 2005, Beijing, China, Array, pp.617-621. https://doi.org/10.1109/GRC.2005.1547365
Kovkov, DV, Kolbanov, VM, and Molodtsov, DA (2007). Soft sets theory-based optimization. Journal of Computer and Systems Sciences International. 46, 872-880. https://doi.org/10.1134/S1064230707060032
Zadeh, LA (1965). Fuzzy sets. Information and Control. 8, 338-353. https://doi.org/10.1016/S0019-9958(65)90241-X
Rodabaugh, SE (1999). Powerset operator foundations for poslat fuzzy set theories and topologies. Mathematics of Fuzzy Sets. Boston, MA: Springer, pp. 91-116 https://doi.org/10.1007/978-1-4615-5079-23
Manes, EG (1976). Algebraic Theories. Berlin, Germany: Springer-Verlag
Rodabaugh, SE (2007). Relationship of algebraic theories to powerset theories and fuzzy topological theories for lattice-valued mathematics. International Journal of Mathematics and Mathematical Sciences. 2007. article no. 043645
Novak, V, Perfilijeva, I, and Mockor, J (1999). Mathematical Principles of Fuzzy Logic. Boston, MA: Kluwer Academic Publishers
Mockor, J, and Hurtik, P 2020. Fuzzy soft sets and image processing application., 14th International Conference on Theory and Application of Fuzzy Systems and Soft Computing – ICAFS-2020, Array. https://doi.org/10.1007/978-3-030-64058-3
Mac Lane, S (1998). Categories for the Working Mathematician. New York, NY: Springer
Rodabaugh, SE (1997). Powerset operator based foundation for point-set lattice-theoretic (poslat) fuzzy set theories and topologies. Quaestiones Mathematicae. 20, 463-530. https://doi.org/10.1080/16073606.1997.9632018
Goguen, JA (1973). The fuzzy Tychonoff theorem. Journal of Mathematical Analysis and Applications. 43, 734-742. https://doi.org/10.1016/0022-247X(73)90288-6
Chang, CL (1968). Fuzzy topological spaces. Journal of Mathematical Analysis and Applications. 24, 182-190. https://doi.org/10.1016/0022-247x(68)90057-7
Kleisli, H (1965). Every standard construction is induced by a pair of adjoint functors. Proceedings of the American Mathematical Society. 16, 544-546. https://doi.org/10.2307/2034693
Mockor, J (2008). Powerset operators of extensional fuzzy sets. Iranian Journal of Fuzzy Systems. 15, 143-163. https://dx.doi.org/10.22111/ijfs.2018.3765
Mockor, J (2010). Cut systems in sets with similarity relations. Fuzzy Sets and Systems. 161, 3127-3140. https://doi.org/10.1016/j.fss.2010.07.009
Mockor, J, and Holcapek, M (2017). Fuzzy objects in spaces with fuzzy partitions. Soft Computing. 21, 7269-7284. https://doi.org/10.1007/s00500-016-2431-4

Article Tools

Metrics

View1423
Download245
SCOPUS 6

International Journalof Fuzzy Logic andIntelligent Systems

Original Article

Powerset Theory of Fuzzy Soft Sets

Abstract

1. Introduction

2. Preliminaries

Definition 1

Example 1

Definition 2

Example 2

Example 3

Definition 3

Lemma 1

Example 4

Example 5

Definition 4

Example 6

3. Powerset Theory of Fuzzy Soft Sets

Theorem 1

Proposition 1

Theorem 2

Theorem 3

Definition 5

Proposition 2

Proposition 3

Corollary 1

4. Fuzzy Soft Relations: An Application of Powerset Theory

Definition 6

Definition 7

Example 7

Example 8

Definition 8

Proposition 4

5. Conclusion

Acknowledgments

Conflict of Interest

References

Biography

Article

Original Article

Powerset Theory of Fuzzy Soft Sets

Abstract

1. Introduction

2. Preliminaries

Definition 1

Example 1

Definition 2

Example 2

Example 3

Definition 3

Lemma 1

Example 4

Example 5

Definition 4

Example 6

3. Powerset Theory of Fuzzy Soft Sets

Theorem 1

Proposition 1

Theorem 2

Theorem 3

Definition 5

Proposition 2

Proposition 3

Corollary 1

4. Fuzzy Soft Relations: An Application of Powerset Theory

Definition 6

Definition 7

Example 7

Example 8

Definition 8

Proposition 4

5. Conclusion

References

Article Tools

Metrics

Share this article on :

Effective Fuzzy Soft Expert Set Theory and Its Applications

Shadow Soft Set Theory

Compactness on Fuzzy Soft r-Minimal Spaces

International Journal
of Fuzzy Logic and
Intelligent Systems