# Categorical Properties of Soft Sets

Authors: Min Zhou; Shenggang Li; Muhammad Akram
Journal: The Scientific World Journal
 (2014)

---

## Abstract

The present study investigates some novel categorical properties of soft sets. By combining categorical theory with soft set theory, a categorical framework of soft set theory is established. It is proved that the categorySFun of soft sets and soft functions has equalizers, finite products, pullbacks, and exponential properties. It is worth mentioning that we find that SFun is both a topological construct and Cartesian closed. The category SRel of soft sets and Z-soft set relations is also characterized, which shows the existence of the zero objects, biproducts, additive identities, injective objects, projective objects, injective hulls, and projective covers. Finally, by constructing proper adjoint situations, some intrinsic connections between SFun and SRel are established.


---

## Body

## 1. Introduction

It is well known that many traditional mathematical tools such as fuzzy set theory, probability theory, rough set theory, and interval mathematic theory have their own limitations in dealing with some uncertain problems caused by the incompatibility of various parameter tools. To overcome the difficulties mentioned above, Molodtsov [1] initiated soft set theory by introducing enough compatible parameters. In the context of soft set, researchers can choose freely the form of parameters to simplify the decision-making process, which often makes the process more efficient under the absence of partial information. Consequently, Ali et al. [2] further introduced some new operations in soft set theory. Recently, soft set theory has opened up keen insights and has a rich potential for application in many different fields such as ontology [3], data analysis [4, 5], forecasting [6], simulation [7], decision making [8–11], medical science [12], rule mining [13], algebraic systems [14–20], optimization [21], and textures classification [22]. However, being originated from relatively simple information models, classical soft set theory may not be suitable for those complex information models. In order to solve practical problems better by employing soft set theory, it is important to allure capable pure mathematicians to participate in the study of soft set theory. On the other hand, category theory is not only a basic tool for characterizing all kinds of mathematical structures, but also a tie which can connect easily the fields of mathematics and theoretical computer science (see [23–28]). Many researchers (see [29]) even argue that it is category theory, rather than set theory, that provides the proper setting for the study of pure mathematics. Based on the above analysis, a natural question is whether we can research by combining soft set theory with category theory. The fact is that there exists some categorical concepts, such as product, in soft set theory. Moreover, category theory has been successfully applied to fuzzy set theory [30, 31] and rough set theory [32, 33]. In 2007, Aktaş and Çağman [15] showed that both a fuzzy set and a rough set can be regarded as a soft set, which makes it possible to investigate soft set theory and category theory in a common setting. Inspired by this, recently, Zahiri [34] introduced a category whose objects are soft sets. Sardar and Gupta [35] defined another soft category which is a parameterized family of subcategories of a category. Varol et al. [36] defined a new category of soft sets and soft mapping. These studies have presented a preliminary, but potentially interesting, research direction. However, some basic problems still need further investigation. Based on these analyses, we further study the categorical framework of soft set theory in the present paper.The main contributions of the paper have 3-fold. First, we show that the categorySFun of soft sets and soft functions is Cartesian closed. On the one hand, because of the consistency of expression function between Cartesian closed category and λ-calculation with types, many researchers have been devoted to establishing all kinds of Cartesian closed categories in the universe theory for denotational semantics of computer programming language. On the other hand, soft set theory has been widely applied to many fields. Based on this, we further study the categorySFun of soft sets and soft functions and prove that it is Cartesian closed. Second, we give a new characterization on soft set relations by employing category theory. There is no doubt that soft set relations play a significant role in the study of soft set theory and they can not only characterize the theoretical relations of two soft sets but also enrich the soft set theory. Presently, researches on soft set relations have received widespread attention and have made great progress (see [37–42]). Meanwhile, it is worth noting that category of binary relations has been widely applied to mathematics and computer science [43, 44]. Inspired by this, we make a further discussion on the categorySRel of soft sets and Z-soft set relations. Third, we construct a concrete adjoint situation between the categorySFun andSRel and characterize its basic relationships.The remaining parts of the paper are arranged as follows. Section2 shows some preliminaries. We present in Section 3 the concept of soft functions and discuss the fundamental properties of the categorySFun. In Section 4, the characterizations of the categorySRel are investigated. Section 5 focuses on studying the intrinsic connections betweenSFun andSRel.


## 2. Preliminaries

In this section, we recall some elementary notions and facts related to soft set theory [1], category theory (see [23–27]) which will be often used in this paper. In what follows, we denote by U an initial universe of objects and by E the set of parameters that relate to objects in U. P
(
U
) presents the power set of U. A, B, C, and J are the subsets of E.Definition 1 (see [1]).
A pair (F, A) is called a soft set over U, where F is a function given by F
:
A
→
P
(
U
).In other words, a soft set overU is a parameterized family of subsets of U. For any parameter x
∈
A, F
(
x
) may be considered as the set of x-approximate elements of the soft set (
F
,
A
).Proposition 2 (see [24]).
If a categoryC has finite products and equalizers, then C has pullbacks.Definition 3 (see [26]).
LetZ be an object in a category C. One calls Z initial if for each object A there is exactly one morphism from Z to A; one calls Z terminal if for each object A there is exactly one morphism from A to Z; and one calls Z a zero object if it is both initial and terminal.For objectsA
,
B in a category with zero object Z, we use 0
A
,
B for the unique morphism A
→
Z
→
B.Definition 4 (see [26]).
A categoryC with zero has biproducts if for each family {
A
i
}
i
∈
I of objects there is an object ⊕
I
A
i, together with families of morphisms μ
i
:
A
i
→
⊕
I
A
j and π
i
:
⊕
I
A
j
→
A
i such that (i)
the morphismsμ
i
:
A
i
→
⊕
I
A
j are a coproduct of the family {
A
i
}
i
∈
I;
(ii)
the morphismsπ
i
:
⊕
I
A
j
→
A
i are a product of the family {
A
i
}
i
∈
I;
(iii)
π
i
∘
μ
j
=
δ
i
j for each i
,
j
∈
I; here δ
i
j is the identity map 1
A
i if i
=
j and the zero map 0
A
i
,
A
j if i
≠
j.Example 5 (see [23]).
In categoryRel of sets and the relations between them, for a family of sets {
X
i
}
i
∈
I, let X be their disjoint union ⨆

I
X
i
=
{
(
x
,
i
)
∣
x
∈
X
i
for
some
i
∈
I
} and define relations μ
i from X
i to X and π
i from X to X
i by setting μ
i
=
{
(
x
,
(
x
,
i
)
)
∣
x
∈
X
i
} and π
i
=
{
(
(
x
,
i
)
,
x
)
∣
x
∈
X
i
}. Then the disjoint union X with morphisms μ
i and π
i is a biproduct of the family {
X
i
}
i
∈
I.Definition 6 (see [26]).
A semiadditive category is a categoryC where each homset C
(
B
,
C
) is equipped with the structure of a commutative monoid with operation + such that, for any f
:
A
→
B
,
g
,
h
:
B
→
C, and k
:
C
→
D,
(1)
(
g
+
h
)
∘
f
=
(
g
∘
f
)
+
(
h
∘
f
)
,
k
∘
(
g
+
h
)
=
(
k
∘
g
)
+
(
k
∘
h
)
.Definition 7 (see [26]).
An involution on a categoryC is a contravariant functor from C to itself of period two.Definition 8 (see [26]).
LetZ be a C-object. Then Z is injective if, for every monic f
:
X
→
Y and each g
:
X
→
Z, there is an h
:
Y
→
Z with g
=
h
∘
f:
(2)
The map e
:
X
→
Z is called an injective hull of X if e is monic, Z is injective, and for any k
:
Z
→
V we have k
∘
e being monic which implies that k is monic.Definition 9 (see [27]).
For categoriesC and D and functors F
:
C
→
D and G
:
D
→
C, one says (
F
,
G
) is an adjoint situation if F is left adjoint to G and G is right adjoint to F. This implies that, for objects X
∈
C and Y
∈
D, there is a natural isomorphism between the homsets C
(
X
,
G
(
Y
)
)
≈
D
(
F
(
X
)
,
Y
).Definition 10.
One calls that a categoryC has exponential properties if it has finite products and for each of the C-objects A
,
B, there exists a C-object B
A and a C-morphism e
v
:
B
A
×
A
→
B such that, for each C-object D and C-morphism F
:
D
×
A
→
B, there exists a unique C-morphism F
-
:
D
→
B
A with e
v
∘
(
F
-
×
i
d
A
)
=
F. That is, the diagram
(3)
is commutative.Definition 11 (see [26]).
A categoryC is called Cartesian closed if it has equalizers, finite products, terminal objects, and exponential properties.For the other standard terminology of category theory, see [24, 26].


## 3. The Category SFun of Soft Sets and Soft Functions

The properties of the categorySFun will be investigated in this section. Particularly, we will prove thatSFun is a topological construct and Cartesian closed.Definition 12.
Let(
F
,
A
) and (
G
,
B
) be two soft sets over U. Then one says that the mapping f
:
A
→
B is a soft function from (
F
,
A
) to (
G
,
B
) if it satisfies F
(
a
)
⊆
(
G
∘
f
)
(
a
) for each a
∈
A.Example 13.
LetU
=
{
u
1
,
u
2
,
u
3
,
u
4
,
u
5
,
u
6
} be the set of candidate dresses and E
=
{
e
1
,
e
2
,
e
3
,
e
4
} the set of parameters, where e
i
(
i
=
1,2
,
3,4
) stands for expensive, beautiful, elegant, and classical, respectively. Let A
=
{
e
1
,
e
2
}, B
=
{
e
1
,
e
4
}, F
(
e
1
)
=
{
u
3
}, F
(
e
2
)
=
{
u
1
,
u
2
,
u
6
}, G
(
e
1
)
=
{
u
3
,
u
5
}, and G
(
e
4
)
=
{
u
1
,
u
2
,
u
5
,
u
6
}. It is easy to check that (
F
,
A
) and (
G
,
B
) are two soft sets over U. Define a function f
:
A
→
B by f
(
e
1
)
=
e
1
,
f
(
e
2
)
=
e
4. By routine calculations, we can prove that F
(
e
1
)
⊆
(
G
∘
f
)
(
e
1
) and F
(
e
2
)
⊆
(
G
∘
f
)
(
e
2
). By Definition 12, f is a soft function from (
F
,
A
) to (
G
,
B
).Remark 14.
The concept of soft functions is different from soft set functions defined in [37].LetSFun denote the category of all soft sets over U and soft functions. We next discuss the properties of the categorySFun.Lemma 15.
S
F
u
n has equalizers
(4)Proof.
Suppose that(
F
,
A
) and (
G
,
B
) are twoSFun-objects over U; f and g are twoSFun-morphisms from (
F
,
A
) to (
G
,
B
). Define C
=
{
a
∈
A
:
f
(
a
)
=
g
(
a
)
}, e
:
C
→
A, an embedding, and H
=
F
∘
e. From the assumption, we can easily know that (
H
,
C
) is aSFun-object, f
∘
e
=
g
∘
e, and H
(
c
)
=
(
F
∘
e
)
(
c
) for each c
∈
C. Thus e is aSFun-morphism. We next show that (
(
H
,
C
)
,
e
) is the equalizer of f and g. Assume that (
H
′
,
C
′
) is aSFun-object and e
′ is aSFun-morphism from (
H
′
,
C
′
) to (
F
,
A
) satisfying f
∘
e
′
=
g
∘
e
′. Define a mapping e
-
:
C
′
→
C and e
-
=
e
′. In what follows we focus on showing that e
- is aSFun-morphism from (
H
′
,
C
′
) to (
H
,
C
) and e
′
=
e
∘
e
-. Firstly, by f
∘
e
′
=
g
∘
e
′, we can infer that f
(
e
′
(
c
′
)
)
=
g
(
e
′
(
c
′
)
) for each c
′
∈
C
′, which means that e
′
(
c
′
)
∈
C. Hence e
-
=
e
′ is well defined. Secondly, according to H
=
F
∘
e
,
e
-
=
e
′, and e
′ being aSFun-morphism, we have
(5)
H
′
(
c
′
)
⊆
F
(
e
′
(
c
′
)
)
=
F
(
e
-
(
c
′
)
)
=
F
(
e
(
e
-
(
c
′
)
)
)
=
(
F
∘
e
)
(
e
-
(
c
′
)
)
=
H
(
e
-
(
c
′
)
)
,
where c
′
∈
C
′. Therefore, e
- is aSFun-morphism. At last, from the assumption, we know that e
′
=
e
∘
e
- and e
- is unique. In conclusion, (
(
H
,
C
)
,
e
) is the equalizer of f and g.Lemma 16.
S
F
u
n has finite products
(6)Proof.
Firstly, let(
F
,
A
) and (
G
,
B
) be twoSFun-objects. Define three mappings
(7)
H
:
A
×
B
⟶
P
(
U
)
(
a
,
b
)
⟶
F
(
a
)
∩
G
(
b
)
,
p
1
:
A
×
B
⟶
A
(
a
,
b
)
⟶
a
,
p
2
:
A
×
B
⟶
B
(
a
,
b
)
⟶
b
,
whence, for each (
a
,
b
)
∈
A
×
B,
(8)
H
(
a
,
b
)
=
F
(
a
)
∩
G
(
b
)
⊆
F
(
a
)
=
F
(
P
1
(
a
,
b
)
)
.
It follows that p
1 is aSFun-morphism. By the same argument, p
2 is also aSFun-morphism. Secondly, for eachSFun-object (
I
,
D
), suppose that f and g areSFun-morphisms from (
I
,
D
) to (
F
,
A
) and (
G
,
B
), respectively. Then I
(
d
)
⊆
F
(
f
(
d
)
) and I
(
d
)
⊆
G
(
g
(
d
)
) for every d
∈
D. Further, define a mapping
(9)
h
:
D
⟶
A
×
B
d
⟶
(
f
(
d
)
,
g
(
d
)
)
.
Then we can infer that, for each d
∈
D,
(10)
I
(
d
)
⊆
F
(
f
(
d
)
)
∩
G
(
g
(
d
)
)
=
H
(
f
(
d
)
,
g
(
d
)
)
=
H
(
h
(
d
)
)
=
(
H
∘
h
)
(
d
)
,
which yields that h is aSFun-morphism. At last, for every d
∈
D, one obtains
(11)
(
p
1
∘
h
)
(
d
)
=
p
1
(
h
(
d
)
)
=
p
1
(
f
(
d
)
,
g
(
d
)
)
=
f
(
d
)
.
Therefore, p
1
∘
h
=
f. Analogously, p
2
∘
h
=
g. Apparently, h is unique. In conclusion, {
(
H
,
C
)
,
p
1
,
p
2
} is a finite product of (
F
,
A
) and (
G
,
B
).Theorem 17.
SFun has pullbacks.Proof.
By Proposition2, it is a direct consequence of Lemmas 15 and 16.Lemma 18.
S
F
u
n has terminal objects.Proof.
Define a mapping(12)
T
{
∅
}
:
{
∅
}
⟶
P
(
U
)
∅
⟶
U
.
Trivially, (
T
{
∅
}
,
{
∅
}
) is aSFun-object. For everySFun-object (
T
M
,
M
), define a mapping
(13)
f
:
M
⟶
{
∅
}
by
m
⟶
∅
.
Then for each m
∈
M, it holds that
(14)
T
M
(
m
)
⊆
T
{
∅
}
(
f
(
m
)
)
=
T
{
∅
}
(
∅
)
=
U
,
which implies that f is aSFun-morphism from (
T
M
,
M
) to (
T
{
∅
}
,
{
∅
}
). It is easy to know that f is unique. By Definition 3, (
T
{
∅
}
,
{
∅
}
) is a terminal object ofSFun.Proposition 19.
S
F
u
n has initial objects.Proof.
The proof runs parallel to that of Lemma18.According to Definition3, we can easily obtain the following proposition.Proposition 20.
S
F
u
n has zero objects.Lemma 21.
S
F
u
n has exponential properties.Proof.
Assume that(
F
,
A
) and (
G
,
B
) are twoSFun-objects over U; B
A
=
{
f
∣
f
:
A
→
B
is
a
mapping
}. For all f
∈
B
A, define
(15)
α
f
=
{
t
∈
P
(
U
)
∣
F
(
a
)
∩
t
⊆
G
(
f
(
a
)
)
,
∀
a
∈
A
}
,
H
1
(
f
)
=
∪
{
t
∣
t
∈
α
f
}
,
C
=
supp
⁡
H
1
=
{
f
∣
H
1
(
f
)
≠
∅
}
,
H
(
f
)
=
H
1
(
f
)
.
Then C
≠
∅. In fact, choose b
∈
B and define a mapping f
′
:
A
→
B by a
→
b such that t
=
G
(
b
)
≠
∅. whence t
∈
α
f
′, which meas that f
′
∈
C. That is, C
≠
∅.
From the definitions, we can easily know that(
H
,
C
) is aSFun-object. Define the evaluation mapping as follows:
(16)
e
v
:
(
H
,
C
)
×
(
F
,
A
)
⟶
(
G
,
B
)
(17)
(
f
,
a
)
⟶
f
(
a
)
.
Then t
∩
F
(
a
)
⊆
G
(
f
(
a
)
) for all t
∈
α
f. It is immediate that
(18)
G
(
f
(
a
)
)
⊇
(
∪
{
t
∣
t
∈
α
f
}
)
∩
F
(
a
)
=
H
(
f
)
∩
F
(
a
)
,
which implies that e
v is aSFun-morphism. Furthermore, we show that e
v has the couniversal property. Assume that (
Z
,
J
) is aSFun-object such that Z
(
j
)
≠
∅ for every j
∈
J and g
:
(
Z
,
J
)
×
(
F
,
A
)
→
(
G
,
B
) is aSFun-morphism. It remains to prove that there exists a uniqueSFun-morphism g
-
:
(
Z
,
J
)
→
(
H
,
C
) such that e
v
∘
(
g
-
×
i
d
A
)
=
g. Firstly, for every j
∈
J, define
(19)
g
-
(
j
)
:
A
⟶
B
a
⟶
g
-
(
j
)
(
a
)
=
g
(
j
,
a
)
.
Since g is aSFun-morphism, one has
(20)
Z
(
j
)
∩
F
(
a
)
⊆
G
(
g
(
j
,
a
)
)
for
each
j
∈
J
,
a
∈
A
.
Consequently,
(21)
Z
(
j
)
∩
F
(
a
)
⊆
G
(
g
-
(
j
)
(
a
)
)
for
each
j
∈
J
,
a
∈
A
,
which implies that Z
(
j
)
∈
α
g
-
(
j
). Further, according to the assumption, H
(
g
-
(
j
)
)
⊇
Z
(
j
)
≠
∅. Hence g
-
(
j
)
∈
C and g
- is aSFun-morphism from (
Z
,
J
) to (
H
,
C
). Secondly, for each (
j
,
a
)
∈
J
×
A, it holds that
(22)
(
e
v
∘
(
g
-
×
i
d
A
)
)
(
j
,
a
)
=
e
v
(
(
g
-
×
i
d
A
)
(
j
,
a
)
)
=
e
v
(
g
-
(
j
)
,
a
)
=
g
-
(
j
)
(
a
)
=
g
(
j
,
a
)
,
whence e
v
∘
(
g
-
×
i
d
A
)
=
g. Namely, the diagram
(23)
is commutative. Furthermore, suppose thatg
′
:
(
Z
,
J
)
→
(
H
,
C
) is aSFun-morphism satisfying e
v
∘
(
g
′
×
i
d
A
)
=
g. Then for every j
∈
J and a
∈
A,
(24)
g
(
j
,
a
)
=
e
v
∘
(
g
′
×
i
d
A
)
(
j
,
a
)
=
e
v
(
g
′
(
j
)
,
a
)
=
g
′
(
j
)
(
a
)
.
On the other hand, we have
(25)
g
(
j
,
a
)
=
e
v
∘
(
g
-
×
i
d
A
)
(
j
,
a
)
=
e
v
(
g
-
(
j
)
,
a
)
=
g
-
(
j
)
(
a
)
.
Thus g
-
(
j
)
(
a
)
=
g
′
(
j
)
(
a
). Since j and a are arbitrary, g
-
=
g
′. This completes the proof.Now we are ready to present two of our main results as follows.Theorem 22.
S
F
u
n is Cartesian closed.Proof.
Lemmas15, 16, 18, and 21 prove the claim.Theorem 23.
S
F
u
n is a topological construct.Proof.
Let{
(
F
i
,
A
i
)
}
i
∈
I be a family ofSFun-objects indexed by a class I and {
f
i
∣
A
→
A
i
}
i
∈
I a family of mappings. Define a soft set over U as follows:
(26)
F
:
A
⟶
P
(
U
)
a
⟶
⋂
i
∈
I
(
F
i
(
f
i
(
a
)
)
)
.
Then (
F
,
A
)
∈
Ob(SFun). It suffices to show that {
f
i
:
(
F
,
A
)
→
(
F
i
,
A
i
)
}
i
∈
I is the uniqueSFun initial lift of {
f
i
:
A
→
A
i
}
i
∈
I. Next, we complete the proof by the following two steps.
Step
1. We show that {
f
i
:
(
F
,
A
)
→
(
F
i
,
A
i
)
}
i
∈
I is aSFun initial lift of {
f
i
:
A
→
A
i
}
i
∈
I. Firstly, we claim that f
i
:
(
F
,
A
)
→
(
F
i
,
A
i
) is a family ofSFun-morphisms for every i
∈
I. By the assumption, for each a
∈
A and i
∈
I, one yields
(27)
F
(
a
)
=
⋂
i
∈
I
(
F
i
(
f
i
(
a
)
)
)
⊆
F
i
(
f
i
(
a
)
)
,
whence {
f
i
}
i
∈
I is a family ofSFun-morphisms. Furthermore, suppose that (
G
,
B
)
∈
Ob(SFun), g
:
B
→
A is a mapping such that g
i
=
f
i
∘
g for every i
∈
I, and g
i
:
(
G
,
B
)
→
(
F
i
,
A
i
) is a family ofSFun-morphisms. Then, we can infer that G
(
b
)
⊆
F
i
(
g
i
(
b
)
) for all i
∈
I and b
∈
B. It follows that
(28)
G
(
b
)
⊆
⋂
i
∈
I
F
i
(
g
i
(
b
)
)
=
⋂
i
∈
I
(
F
i
(
f
i
∘
g
)
(
b
)
)
=
⋂
i
∈
I
(
F
i
(
f
i
(
g
(
b
)
)
)
)
=
F
(
g
(
b
)
)
.
Therefore, g is aSFun-morphism from (
G
,
B
) to (
F
,
A
). By definition, we can know that {
f
i
:
(
F
,
A
)
→
(
F
i
,
A
i
)
}
i
∈
I is aSFun initial lift of {
f
i
:
A
→
A
i
}
i
∈
I.
Step
2. We show the uniqueness of the initial lift. If {
f
i
:
(
F
-
,
A
)
→
(
F
i
,
A
i
)
}
i
∈
I is also aSFun initial lift of {
f
i
:
A
→
A
i
}
i
∈
I which is different from {
f
i
:
(
F
,
A
)
→
(
F
i
,
A
i
)
}
i
∈
I, then {
f
i
:
(
F
-
,
A
)
→
(
F
i
,
A
i
)
}
i
∈
I is a family ofSFun-morphisms. It is immediate that F
-
(
a
)
⊆
F
i
(
f
i
(
a
)
) for each i
∈
I and a
∈
A. Consequently, F
-
(
a
)
⊆
⋂
i
∈
I
F
i
(
f
i
(
a
)
)
=
F
(
a
). That is, F
-
⊆
F. On the other hand, for theSFun-object (
F
,
A
) and identity mapping I
d
A
:
A
→
A, since {
f
i
:
(
F
-
,
A
)
→
(
F
i
,
A
i
)
}
i
∈
I is aSFun initial lift of {
f
i
:
A
→
A
i
}
i
∈
I, we have f
i
∘
i
d
A
=
f
i, f
i is a family ofSFun-morphisms for all i
∈
I, and i
d
A
:
(
F
,
A
)
→
(
F
-
,
A
) is also aSFun-morphism. Therefore, F
(
a
)
⊆
F
-
(
i
d
A
(
a
)
)
=
F
-
(
a
) for each a
∈
A, which means that F
⊆
F
-. To sum up, F
=
F
-. Based on Steps 1 and 2,SFun is a topological construct.


## 4. The Category SRel of Soft Sets andZ-Soft Set Relations

The main aim of this section is to investigate the properties of the categorySRel. We will begin with the analysis of the existence of the zero object, biproduct, and additive identity ofSRel. Then the injective object, projective object, injective hull, and projective cover ofSRel will be studied.Definition 24 (see [37]).
Let(
F
,
A
) and (
G
,
B
) be two soft sets over U. Then the Cartesian product of (
F
,
A
) and (
G
,
B
) is defined as (
F
,
A
)
×
(
G
,
B
)
=
(
H
,
A
×
B
), where H
:
A
×
B
→
P
(
U
×
U
) and H
(
a
,
b
)
=
F
(
a
)
×
G
(
b
) for all (
a
,
b
)
∈
A
×
B; that is, H
(
a
,
b
)
=
{
(
h
i
,
h
j
)
∣
h
i
∈
F
(
a
)
and
h
j
∈
G
(
b
)
}.Definition 25 (see [37]).
Let(
F
,
A
) and (
G
,
B
) be two soft sets over U. Then a relation from (
F
,
A
) to (
G
,
B
) is a soft subset of (
F
,
A
)
×
(
G
,
B
).
In other words, a relation from(
F
,
A
) to (
G
,
B
) is of the form (
H
1
,
S
), where S
⊂
A
×
B and H
1
(
a
,
b
)
=
H
(
a
,
b
), for every (
a
,
b
)
∈
S; here (
H
,
A
×
B
)
=
(
F
,
A
)
×
(
G
,
B
) has been defined in Definition 24. Any subset of (
F
,
A
)
×
(
F
,
A
) is called a relation on (
F
,
A
).From Definition25, we can see that the condition for soft set relation between two soft sets is very weak but just the weak conditions of the soft set relation make those many elements satisfying the above definition in fact unrelated in actual problems. It can be illustrated clearly by the following example.Example 26.
Consider the soft set(
F
,
A
) which describes “the cost of the mobile phones” and the soft set (
G
,
B
) which describes the “attractiveness of mobile phones.” Assume that U
=
{
m
1
,
m
2
,
m
3
,
m
4
,
m
5
,
m
6
} is the universe consisting of six mobile phones, and the parameter sets is given by A
=
{
e
1
,
e
2
,
e
3
} and B
=
{
e
1
,
e
4
,
e
5
}, respectively, where e
i
(
i
=
1,2
,
3,4
,
5
) stands for “very cheap,” “costly,” “very costly,” “beautiful,” and “accessible,” respectively. Let F
(
e
1
)
=
{
m
1
,
m
3
}, F
(
e
2
)
=
{
m
1
,
m
4
}, F
(
e
3
)
=
{
m
1
,
m
5
}, G
(
e
1
)
=
{
m
1
,
m
3
,
m
5
}, G
(
e
4
)
=
{
m
1
,
m
2
,
m
3
,
m
4
,
m
6
}, and G
(
e
5
)
=
{
m
5
}. Let (
F
,
A
)
×
(
G
,
B
)
=
(
H
,
A
×
B
). The relation R from (
F
,
A
) to (
G
,
B
) is given by (
H
1
,
S
), where S
=
{
(
e
1
,
e
1
)
,
(
e
1
,
e
5
)
}
⊆
A
×
B
,
H
1
(
a
,
b
)
=
H
(
a
,
b
) for every (
a
,
b
)
∈
S. By Definition 25, R
=
{
F
(
e
1
)
×
G
(
e
1
)
,
F
(
e
1
)
×
G
(
e
5
)
}.In the above example,F
(
e
1
)
=
{
m
2
,
m
3
}, G
(
e
5
)
=
{
m
5
}. It is obvious that there is no relation between them. However, F
(
e
1
)
×
G
(
e
5
)
∈
R, whence Definition 25 cannot describe precisely the relation between soft sets. To overcome this limitation, we strengthen the concept of soft set relations by defining a new soft set relation.Definition 27.
Let(
F
,
A
) and (
G
,
B
) be two soft sets over U. Then a Z-soft set relation R from (
F
,
A
) to (
G
,
B
) is a subset of A
×
B defined as
(29)
(
a
,
b
)
∈
R
⟺
F
(
a
)
⊆
G
(
b
)
,
where
a
∈
A
,
b
∈
B
.The definition can be illustrated by diagrams of the form(30)Example 28.
Let(
F
,
A
) and (
G
,
B
) be the soft sets defined in Example 26. By Definition 27, we have R
=
{
(
e
1
,
e
1
)
,
(
e
1
,
e
4
)
,
(
e
2
,
e
4
)
,
(
e
3
,
e
1
)
}.Definition 29.
LetR be a Z-soft set relation from (
F
,
A
) to (
G
,
B
) and S a Z-soft set relation from (
G
,
B
) to (
H
,
C
). Then the composition of R and S, denoted by S
∘
R, is defined as follows:
(31)
S
∘
R
=
{
(
a
,
c
)
∣
∀
a
∈
A
,
∀
c
∈
C
,
there
is
a
b
in
B
with
a
R
b
and
b
S
c
}
.Definition 30.
Let(
F
,
A
) be a soft set over U. The identity Z-soft set relation I
A on (
F
,
A
) is defined as I
A
=
{
(
a
,
a
)
∣
a
∈
A
}.Proposition 31.
LetR be a Z-soft set relation from (
F
,
A
) to (
G
,
B
), S a Z-soft set relation from (
G
,
B
) to (
F
,
A
), and I
A an identity Z-soft set relation on (
F
,
A
). Then R
∘
I
A
=
R and I
A
∘
S
=
S.Remark 32.
From the aforementioned definitions and propositions, we can construct a category, denoted bySRel, whose objects are all soft sets and morphisms are all Z-soft set relations.Proposition 33.
The categoryS
F
u
n of soft sets and soft functions is the subcategory of S
R
e
l.Proposition 34.
The empty set (with the empty function intoP
(
U
)) is a zero object in S
R
e
l.Proof.
For eachSRel-object (
F
,
A
), there exist unique morphisms
(32)
The inequalities are satisfied by default, whence the setsS
R
e
l
(
(
F
,
A
)
,
(
∅
,
∅
)
) and S
R
e
l
(
(
∅
,
∅
)
,
(
F
,
A
)
) each contain exactly one morphism.Proposition 35.
S
R
e
l has biproducts.Proof.
Let{
(
F
i
,
A
i
)
}
i
∈
I be a family ofSRel-objects and A
=
⨆

I
A
i
=
{
(
a
i
,
i
)
∣
a
i
∈
A
i
for
some
i
∈
I
} the disjoint union of A
i. Define a mapping F
:
A
→
P
(
U
) as F
(
a
i
,
i
)
=
F
i
(
a
i
). Further, define relations q
i from A
i to A and p
i from A to A
i as follows:
(33)
q
i
=
{
(
a
i
,
(
a
i
,
i
)
)
∣
a
i
∈
A
i
}
,
p
i
=
{
(
(
a
i
,
i
)
,
a
i
)
∣
a
i
∈
A
i
}
.
We next show that (
F
,
A
) with morphisms p
i and q
i is a biproduct of the family {
(
F
i
,
A
i
)
}
i
∈
I by the following four steps.
Step
1. We first prove that p
i and q
i areSRel-morphisms. In fact, take an element (
a
i
,
(
a
i
,
i
)
) in q
i; since F
i
(
a
i
)
=
F
(
a
i
,
i
) for each i
∈
I and a
i
∈
A
i, we have F
i
(
a
i
)
⊆
F
(
a
i
,
i
), which means that q
i is a Z-soft set relation from (
F
i
,
A
i
) to (
F
,
A
). That is, q
i is aSRel-morphism from (
F
i
,
A
i
) to (
F
,
A
) for each i
∈
I. Analogously, we can prove that p
i is aSRel-morphism from (
F
,
A
) to (
F
i
,
A
i
) for every i
∈
I.
Step
2. We show that q
i are the morphisms for a coproduct. Suppose that (
G
,
B
) is aSRel-object and R
i
:
(
F
i
,
A
i
)
→
(
G
,
B
) is a family ofSRel-morphisms. Define a relation R from A to B by (
a
i
,
i
)
R
b if and only if a
i
R
i
b for each i
∈
I. Firstly, we claim that R is aSRel-morphism from (
F
,
A
) to (
G
,
B
). If a
i
R
i
b for each a
i
∈
A
i and b
∈
B, since R
i
:
(
F
i
,
A
i
)
→
(
G
,
B
) is a family ofSRel-morphisms for each i
∈
I, we have F
i
(
a
i
)
⊆
G
(
b
) for every a
i
∈
A
i and b
∈
B. On the other hand, F
i
(
a
i
)
=
F
(
a
i
,
i
), which implies that F
(
a
i
,
i
)
⊆
G
(
b
). By Definition 27, we have (
a
i
,
i
)
R
b, whence R is aSRel-morphism from (
F
,
A
) to (
G
,
B
). Secondly, we prove that R
∘
q
i
=
R
i for all i
∈
I. Let a
i
∈
A
i and b
∈
B; then by Definition 29, a
i
(
R
∘
q
i
)
b is equivalent to a
i
q
i
(
a
i
,
i
) and (
a
i
,
i
)
R
b for some (
a
i
,
i
)
∈
A. According to assumption, (
a
i
,
i
)
R
b if and only if a
i
R
i
b, whence R
∘
q
i
=
R
i. At last, the uniqueness is obvious. In conclusion, q
i are the morphisms for a coproduct.
Step
3. We further show that p
i are morphisms for a product. Assume that (
G
,
B
) isSRel-object and S
i
:
(
G
,
B
)
→
(
F
i
,
A
i
) is a family ofSRel-morphisms. Define a relation S from B to A by setting b
S
(
a
i
,
i
) if and only if b
S
i
a
i. Similar to Step 2, we can infer that S is a unique morphism from (
G
,
B
) to (
F
,
A
) inSRel with p
i
∘
S
=
S
i. Thus p
i are morphisms for a product.
Step
4. Finally, a calculation shows that p
i
∘
q
i is the identical relation on A
i if i
=
j and the empty relation from A
j to A
i if i
≠
j. Therefore, p
i
∘
q
j
=
δ
i
j.
From the above discussion, we know thatSRel has biproducts by Definition 4.Any category with biproducts carries a unique semiadditive structure that can be defined via biproducts [26]. Next we briefly describe some properties ofSRel.Proposition 36.
LetR and S be two S
R
e
l-morphisms from (
F
,
A
) to (
G
,
B
). Then the semiadditive structure on homesets in S
R
e
l is given by taking R
+
S to be the union of Z-soft set relations R
∪
S. In this case, the empty Z-soft set relation serves as the additive identity.Proof.
LetR and S be twoSRel-morphisms from (
F
,
A
) to (
G
,
B
). Firstly, we show that R
∪
S is aSRel-morphism from (
F
,
A
) to (
G
,
B
). In fact, let a
∈
A
,
b
∈
B, and a
(
R
∪
S
)
b; then a
R
b or a
S
b. In the first case, R is aSRel-morphism given by F
(
a
)
⊆
G
(
b
). And in the second case, S is aSRel-morphism given by F
(
a
)
⊆
G
(
b
), whence R
∪
S is a morphism inSRel. Secondly, we can easily verify that ∪ gives a commutative monoid structure on S
R
e
l
(
(
F
,
A
)
,
(
G
,
B
)
) with the empty Z-soft set relation as identity, and composition distributes over union.Proposition 37.
For eachS
R
e
l-object (
F
,
A
) and S
R
e
l-morphism R
:
(
F
,
A
)
→
(
G
,
B
), there is an involution ′ on S
R
e
l defined as follows:(i)
(
F
,
A
)
′
=
(
F
r
,
A
), where F
r
(
a
)
=
U
-
F
(
a
) for all a
∈
A;
(ii)
R
′
:
(
G
,
B
)
′
→
(
F
,
A
)
′ is the converse M-soft set relation R
-
1, where R
-
1
=
{
(
b
,
a
)
∣
a
R
b
,
∀
a
∈
A
,
∀
b
∈
B
}.Proof.
Leta
∈
A
,
b
∈
B, and b
R
′
a. Since R
′ is the converse Z-soft set relation of R, we have a
R
b. In addition, R is aSRel-morphism, so F
(
a
)
⊆
G
(
b
) for every a
∈
A and b
∈
B, which means that U
-
G
(
b
)
⊆
U
-
F
(
a
). It is immediate that R
′ is aSRel-morphism from (
G
,
B
)
′ to (
F
,
A
)
′. Furthermore, assume that S is a Z-soft set relation from (
G
,
B
) to (
H
,
C
); then by Definition 29, we can easily obtain that (
R
∘
S
)
-
1
=
S
-
1
∘
R
-
1, whence ′ is compatible with composition. At last, obviously, ′ takes the identity map on (
F
,
A
) to the identity map on (
F
,
A
)
′. Hence, ′ is a contravariant functor that is obviously period two. By Definition 7, ′ is an involution onSRel.Remark 38.
It should be noted that the notion of involution′ gives a bijective mapping from homset S
R
e
l
(
(
F
,
A
)
,
(
G
,
B
)
) to S
R
e
l
(
(
G
r
,
B
)
,
(
F
r
,
A
)
).Proposition 39.
LetR be a S
R
e
l-morphism from (
F
,
A
) to (
G
,
B
). Then the following statements are equivalent:(i)
R is monic;
(ii)
ifC
⊆
A, then the map R
[
·
]
:
P
(
A
)
→
P
(
B
), defined by R
[
C
]
=
{
b
∈
B
∣
c
R
b
f
o
r
s
o
m
e
c
∈
C
}, is one-one;
(iii)
for everya
∈
A, there exists b
∈
B such that a is the only element related to b.Proof.
(i)⇒(ii) Suppose that C
,
D
⊆
A and R
[
C
]
=
R
[
D
]. Take a singleton {
*
} and assume that the map ∅
:
{
*
}
→
P
(
U
) sends * to ∅. Define two relations S
,
T from {
*
} to A by setting S
=
{
(
*
,
c
)
∣
c
∈
C
} and T
=
{
(
*
,
d
)
∣
d
∈
D
}. As ∅ is the subset of any sets, we have S
,
T
:
(
∅
,
{
*
}
)
→
(
F
,
A
) beingSRel-morphisms and *
S
a
,
*
T
a for each a
∈
A. Since R
[
C
]
=
R
[
D
], by the definition, for each b
∈
B, there exist c
∈
C and d
∈
D such that c
R
b if and only if d
R
b. It is immediate that there exist c
∈
C
⊆
A
,
d
∈
D
⊆
A such that *
S
c and c
R
b if and only if *
T
d and d
R
b. By Definition 29, R
∘
S
=
R
∘
T. Since R is monic, we have S
=
T. Consequently, C
=
D, which means that R
[
·
] is one-one.
(ii)⇒(iii) Assume that R
[
·
]
:
P
(
A
)
→
P
(
B
) is one-one; then R
[
A
-
{
a
}
]
≠
R
[
A
]. It follows from the definition that for each a
∈
A there exists b
∈
B such that a is the only element related to b.
(iii)⇒(i) Let S
,
T
:
(
H
,
C
)
→
(
F
,
A
) and S
≠
T; then we claim that there exist c
∈
C and a
∈
A such that (
c
,
a
)
∈
S, but (
c
,
a
)
∉
T. By (iii), take b
∈
B with a
′
R
b
⇔
a
′
=
a, and then it follows from Definition 29 that c
(
R
∘
S
)
b, but c
(
R
∘
T
)
b does not hold, which means that R
∘
S
≠
R
∘
T. Hence R is monic.Proposition 40.
LetR be a S
R
e
l-morphism from (
F
,
A
) to (
G
,
B
). Then the following statements are equivalent:(i)
R is epic;
(ii)
the mappingR
-
1
:
P
(
B
)
→
P
(
A
), defined by R
-
1
[
D
]
=
{
a
∈
A
∣
a
R
d
f
o
r
s
o
m
e
d
∈
D
}, is one-one;
(iii)
for everyb
∈
B, there exists a
∈
A with b being the only element related to a.Proof.
The proof is similar to that of Proposition39.Lemma 41.
LetU
:
C
→
P
(
U
) be a map defined by U
(
c
)
=
U for each c
∈
C. Then (
U
,
C
) is injective in S
R
e
l.Proof.
For eachSRel-objects (
F
,
A
), (
G
,
B
), let R
:
(
F
,
A
)
→
(
G
,
B
) be monic and S
:
(
F
,
A
)
→
(
U
,
C
). Assume that B
1
=
{
b
∈
B
∣
there
exists
exactly
one
a
such
that
a
R
b
}. Since R is monic, it follows from Proposition 39 that for every a
∈
A there exists b
∈
B such that a is the only element related to b. Define T
:
(
G
,
B
)
→
(
U
,
C
) by T
=
{
(
b
,
c
)
∣
b
∈
B
1
and
a
S
c
for
some
a
R
b
}. Apparently, T is aSRel-morphism. According to the definition of T, we can infer that T
∘
R
=
S. That is, the following diagram
(34)
is commutative. By Definition8, (
U
,
C
) is injective.Theorem 42.
Let(
F
,
A
) be a S
R
e
l-object. Then the identity embedding I
:
(
F
,
A
)
→
(
U
,
A
) is an injective hull.Proof.
By Proposition39, I is monic. In addition, according to Lemma 41, (
U
,
A
) is injective. Assume that R
:
(
U
,
A
)
→
(
G
,
B
) such that R
∘
I is monic. Because of a relation rather than a morphism, R
∘
I
=
R, whence Proposition 39 gives that R is monic. It follows from Definition 8 that I is an injective hull.Remark 43.
It is well known that projective objects of a category are dual to that of injective objects and projective covers are dual to that of injective hulls (see [26]). So we can easily obtain the following proposition.Theorem 44.
Let∅
:
C
→
P
(
U
) be a mapping defined by ∅
(
c
)
=
∅ for every c
∈
C. Then (
∅
,
C
) is the projective object of S
R
e
l. Further, for each S
R
e
l-object (
F
,
A
), the mapping I
:
(
∅
,
A
)
→
(
F
,
A
) is a projective cover of (
F
,
A
).


## 5. Adjoint Situations

We in this section mostly consider the relations among the categoriesSFun,Set,SRel, andRel. In particular, we investigate the essential connections ofSFun andSRel by means of adjoint situations.Definition 45.
LetF
1
:
S
F
u
n
→
S
e
t be a forgetful functor which sends an object (
F
,
A
) to A and sends a morphism R
:
(
F
,
A
)
→
(
G
,
B
) to R
:
A
→
B.Analogously, we can define another forgetful functorG
1
:
S
R
e
l
→
R
e
l.Definition 46.
DefineF
2
,
G
2
:
S
e
t
→
S
F
u
n and F
3
,
G
3
:
R
e
l
→
S
R
e
l for an object A and morphism R
:
A
→
B by setting(i)
F
2
(
A
) and F
3
(
A
) to be the object (
∅
,
A
), where ∅
:
A
→
P
(
U
) defined by ∅
(
a
)
=
∅ for all a
∈
A;
(ii)
G
2
(
A
) and G
3
(
A
) to be the object (
U
,
A
), where U
:
A
→
P
(
U
) defined by U
(
a
)
=
U for all a
∈
A;
(iii)
F
2
(
R
)
,
F
3
(
R
)
,
G
2
(
R
), and G
3
(
R
) to be R, where R is considered with the appropriate domain and codomain.Theorem 47.
(i) The pair(
F
3
,
G
1
) is an adjoint situation.
(ii) The pair(
G
1
,
G
3
) is an adjoint situation.
(iii) The pair(
F
2
,
F
1
) is an adjoint situation.
(iv) The pair(
F
1
,
G
2
) is an adjoint situation.Proof.
We just prove (i) and (ii) because the proofs of (iii) and (iv) are similar.
(i) LetA
,
B beRel-objects and (
G
,
B
)
SRel-object. By Definition 46(i), ∅
(
a
)
=
∅
⊆
G
(
b
) for all a
∈
A and b
∈
B; we can infer that a morphism R
:
A
→
B inRel will lift to a morphism R
:
(
∅
,
A
)
→
(
G
,
B
) inSRel, whence S
R
e
l
(
(
∅
,
A
)
,
(
G
,
B
)
)
≈
R
e
l
(
A
,
B
). According to Definitions 45 and 46(i), S
R
e
l
(
F
3
(
A
)
,
(
G
,
B
)
)
≈
R
e
l
(
A
,
G
1
(
G
,
B
)
). It follows from Definition 9 that (
F
3
,
G
1
) is an adjoint situation.
(ii) Assume thatA
,
B areRel-objects and (
G
,
B
) is aSRel-object. By Definition 46 (ii), F
(
a
)
⊆
U
=
U
(
b
) for every a
∈
A and b
∈
B, which means that aRel-morphism R
:
A
→
B can lift to aSRel-morphism from (
F
,
A
) to (
U
,
B
). Thus R
e
l
(
(
A
,
B
)
)
≈
S
R
e
l
(
(
F
,
A
)
,
(
U
,
B
)
). By Definitions 45 and 46 (ii), R
e
l
(
G
1
(
F
,
A
)
,
B
)
≈
S
R
e
l
(
(
F
,
A
)
,
G
3
(
B
)
). Therefore, (
G
1
,
G
3
) is an adjoint situation according to Definition 9.Theorem 48.
Assume thatF
4
:
S
F
u
n
→
S
R
e
l is the inclusion functor and define a functor
(35)
G
4
:
S
R
e
l
⟶
S
F
u
n
(
F
,
A
)
⟼
(
⊓
F
,
P
(
A
)
)
,
R
:
(
F
,
A
)
⟶
(
G
,
B
)
⟼
R
[
·
]
:
(
⊓
F
,
P
(
A
)
)
⟶
(
⊓
G
,
P
(
B
)
)
,
where ⊓
F
(
C
)
=
∩
{
F
(
c
)
∣
c
∈
C
}. Then (
F
4
,
G
4
) is an adjoint situation.Proof.
Firstly, we show thatG
4 is well defined. Let R
:
(
F
,
A
)
→
(
G
,
B
) be aSRel-morphism. For C
⊆
A
,
b
∈
R
[
C
], where R
[
C
] is defined like Proposition 39, there exists c
∈
C such that c
R
b. Since F
(
c
)
⊆
G
(
b
) for every c
∈
A
,
b
∈
B, we have ⊓
F
(
C
)
⊆
⊓
G
(
R
[
C
]
), which implies that R
[
·
]
:
(
⊓
F
,
P
(
A
)
)
→
(
⊓
G
,
P
(
B
)
) is aSFun-morphism. That is, the definition of G
4 is reasonable. Secondly, we claim that (
F
4
,
G
4
) is an adjoint situation. It remains to show that S
R
e
l
(
(
F
,
A
)
,
(
G
,
B
)
)
≈
S
F
u
n
(
(
F
,
A
)
,
(
⊓
G
,
P
(
B
)
)
). In fact, if R
:
(
F
,
A
)
→
(
G
,
B
) is aSRel-morphism, then F
(
a
)
⊆
G
(
b
) for all a
∈
A and b
∈
B, which implies that F
(
a
)
⊆
⊓
G
(
R
[
{
a
}
]
). That is, R
[
{
·
}
]
:
(
F
,
A
)
→
(
⊓
G
,
P
(
B
)
) is aSFun-morphism. Consequently, assume that f
:
(
F
,
A
)
→
(
⊓
G
,
P
(
B
)
) is aSFun-morphism. Define a relation R
:
A
→
B by a
R
b if b
∈
f
(
a
). Then a
R
b implies F
(
a
)
⊆
⊓
G
(
f
(
a
)
), whence F
(
a
)
⊆
G
(
b
) and R
:
(
F
,
A
)
→
(
G
,
B
) is aSRel-morphism.Definition 49.
Assume thatP
,
I
:
S
R
e
l
→
S
R
e
l are defined by P
=
F
3
∘
G
1 and I
=
G
3
∘
G
1. Then P and I are called the projective cover and injective hull functor, respectively.Proposition 50.
Consider(36)
′
∘
P
=
I
∘
′
.Proof.
It is straightforward from Theorems42 and 44.


## 6. Conclusions

Soft set theory, a new powerful mathematical tool for dealing with uncertain problems, has recently received wide attention in both the real-life applications and the theory studies. In recent years, the combination of soft set theory and category theory has resulted in many interesting research topics. In this paper, we mostly focus on offering theoretical results by combining soft set theory and category theory. In other words, we have provided a categorical viewpoint for soft set theory and the results given in this paper can further enrich soft set theories. Particularly, we have proved that the categorySFun is Cartesian closed, which will provide an important theoretical background for theoretical computer sciences. Naturally, applying our results to other fields such as information sciences and logic is also a valuable work and we will present it in the future work.



---

*Source: 783056-2014-08-18.xml*