Next Article in Journal
Designing a Custom CPU Architecture Based on Hardware RTOS and Dynamic Preemptive Scheduler
Previous Article in Journal
Probabilistic Interpretation of Number Operator Acting on Bernoulli Functionals
Previous Article in Special Issue
Application to Lipschitzian and Integral Systems via a Quadruple Coincidence Point in Fuzzy Metric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Contribution to the Theory of Soft Sets via Generalized Relaxed Operations

1
Department of Mathematics, School of Science, University of Management and Technology, C-II, Johar Town, Lahore 54770, Pakistan
2
Abdus Salam School of Mathematical Sciences, Government College University, Lahore 54600, Pakistan
3
Department of Mathematics, College of Science and Humanities in Al-Kharj, Prince Sattam Bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(15), 2636; https://doi.org/10.3390/math10152636
Submission received: 10 June 2022 / Revised: 24 June 2022 / Accepted: 13 July 2022 / Published: 27 July 2022

Abstract

:
Soft set theory has evolved to provide a set of valuable tools for dealing with ambiguity and uncertainty in a variety of data structures related to real-world challenges. A soft set is characterized via a multivalued function of a set of parameters with certain conditions. In this study, we relax some conditions on the set of parameters and generalize some basic concepts in soft set theory. Specifically, we introduce generalized finite relaxed soft equality and generalized finite relaxed soft unions and intersections. The new operations offer a great improvement in the theory of soft sets in the sense of proper generalization and applicability.
MSC:
47H04; 03E47; 03E72; 47H07

1. Introduction and Preliminaries

Along with various mathematical models, an essential tool for the handling of imprecise and vague data was introduced by Zadeh [1], known as “fuzzy set theory”. It was observed that fuzzy set theory does not provide enough parameters to tackle the uncertainty in various data structures, so Molodtsov [2] in 1999 initiated the study of “soft sets” to overcome the deficiencies and shortcomings affiliated with the parameters in connection with fuzzy set theory. Since that time, soft set theory has been used to solve problems in various fields, for example, in decision making [3], game theory [4], and medical diagnosis [5].
Soft set theory has further been developed in many directions, for instance, soft algebraic structures and extensions, hybrid models such as fuzzy soft sets, rough soft sets, soft topology and the semantics of soft sets and decision making (compare [2,6,7,8,9,10,11,12,13,14,15,16,17,18,19]). Maji et al. [15] presented an elaborated study related to some algebraic operations on soft sets. Furthermore, Maji et al. [3] used soft set theory to solve problems in decision making. Yang [20], Ali et al. [21], and Li [22] pointed out some shortcomings in the existing literature related to basic operations in soft set theory and introduced new and improved operations.
In 2010, Qin and Hong [23] discussed the generalized soft equality relations known as upper soft equality s and lower soft equality s . In 2014, Abbas et al. [24] presented definitions which preserve assertions from the classical theory of crisp sets (that an empty set is a subset of every set). Furthermore, they presented a version of generalized soft equality named g-soft equality by generalizing the upper and lower soft equality. In 2017, by relaxing the conditions on the parameter set, another definition of generalized finite soft equality, known as g f -soft equality, was introduced by Abbas et al. [25]. Moreover, they introduced generalized finite soft unions and intersections as well. Very recently, Al-shami [7] pointed out and corrected some shortcomings in [25].
The reduction of parameters is an important operation which is used to improve the performance of decision-making processes linked with various uncertainty theories; for details, see [26,27]. As in soft set theory, enough parameters can be used to handle fuzziness in the data. In this paper, by further relaxing the conditions on parameters, we introduce new notions, which we refer to as the generalized finite relaxed soft subset ( g f r -soft subset), generalized finite relaxed soft equality ( g f r -soft equality), and generalized finite relaxed soft unions and intersections ( g f r -soft union and g f r -soft intersection) of two soft sets and via these notions, we extend various results given in [7,23,24,25]. Although they have obtained new results, we have noted the shortcomings pointed out in [7] regarding the previous notions of soft equality.
Some required elementary definitions, results, and concepts associated with soft sets will be presented in this section before we prove the main results.
Let U be an initial universe and E a set of parameters. Throughout this paper, P U represents the family of all subsets of U and P * U represents the collection of nonempty subsets of U. For M , N E , M N denotes the set difference of M and N .
Molodtsov [2] defined a soft set as follows.
Definition 1
([2]). If M E , then F M is called a soft set over U if
F M = { c , f M c : c M ) }
where f M : M P ( U ) is a set-valued mapping. A soft set F M can be viewed as a parametrized family of subsets of U . That is, for every c M , the set f M c U is a c-approximate element of the soft set F M . We use the notation S E ( U ) to denote the collection of all soft sets over a common universe U .
Maji et al. [15] defined some operations on soft sets as follows.
Definition 2
([15]). A soft set F M S E ( U ) is a null soft set if for all c M , f M c = (empty set).
Definition 3
([15]). If F M , G N S E ( U ) , then F M is a soft subset of G N denoted as F M ˜ G N if
M N and for all c M , f M c = g N c .
Definition 4
([15]). For F M , G N S E ( U ) , F M is soft-equal to G N if and only if F M ˜ G N and G N ˜ F M .
In the following, Zhu and Wen [28] modified Definition 1 by replacing P ( U ) with P * U . Furthermore, they defined the null soft set as well.
Definition 5
([28]). A soft set F M S E ( U ) is a null soft set if M = .
Qin and Hong [23] defined soft equalities s and s named as lower soft equality and upper soft equality relations, respectively.
Definition 6
([23]). Let F M and G N be soft sets over U . Then F M is a lower soft equal to G N denoted as F M s G N if and only if
f M c = g N c , if c M N , f M c = , if c M N , and g N c = , if c N M .
Definition 7
([23]). Let F M and G N be soft sets over U . Then F M is an upper soft equal to G N , denoted as F M s G N if and only if
f M c = g N c , if c M N , f M c = U , if c M N , and g N c = U , if c N M .
It has been observed that some basic properties discussed in [15,28] do not hold true in general. These were pointed out and improved by Ali et al. [21], Li [22], Yang [20], and Zhu et al. [28] and Abbas et al. [24]. Some new operations on soft sets were considered as follows to remove the existing deficiencies in soft set theory and to develop the theory further.
Definition 8
([24]). A soft set F M S E ( U ) is a generalized null soft set (g-null soft set) if
either M = or f M c = for every c M
and it is denoted as M .
Definition 9
([24]). A soft set F M S E U is said to be a generalized universal soft set (g-universal soft set) if
(i) 
M = E and
(ii) 
f M c = U for each c E .
A g-universal soft set is represented by U E .
Definition 10
([24]). If F M , G N S E ( U ) , then F M is a generalized soft subset (g-soft subset) of G N , denoted as F M g G N if
M = or for every c M , there is some c ´ N such as f M c g N c ´
Definition 11
([24]). Let F M , G N S E ( U ) . Then the soft sets F M and G N are g-soft-equal, that is, F M g G N if and only if F M g G N and G N g F M .
Proposition 1
([24]). If F M , G N S E ( U ) , then F M s G N implies F M g G N .
Abbas et al. [25] further generalized the concept of soft subsets, given as follows.
Definition 12
([25]). If F M , G N S E ( U ) , then F M is a generalized finite soft subset of G N ( g f -soft subset of G N ) denoted as F M g f G N if and only if for every c M , there exists a finite subset N N such as
f M c c ´ N g N c .
If N is a singleton set then F M g f G N reduces to F M g G N .
Using the above definition, they introduced the g f -soft equality of two soft sets.
Definition 13
([25]). If F M , G N S E ( U ) , then F M and G N are called generalized finite soft equal ( g f -soft equal), denoted as F M g f G N if and only if F M g f G N and G N g f F M .
Furthermore, they obtained the following proposition.
Proposition 2
([25]). If F M , G N S E U , then
(1) 
F M g G N implies F M g f G N .
(2) 
F M g G N implies F M g f G N .
Definition 14
([15]). If F M , G N S E ( U ) , then for C = M N , the union of F M and G N , denoted as H C = F M G N , is defined as
h C c = f M c , if c M N , g N c , if c N M , f M c g N c , if c M N .
Definition 15
([15]). If F M , G N S E ( U ) , then for C = M N , the intersection of F M and G N , denoted as H C = F M G N , is defined as
h C c = f M c or g N c ( as both sets are same )
for all c C .
Ali et al. (see Example 2.2 in [21]) pointed out that some results in Proposition 2.4 in [15] are incorrect. They further introduced the following versions of the union and intersection of soft sets.
Definition 16
([21]). If F M , G N S E ( U ) , then the restricted union of F M and G N , denoted as F M R G N , is a soft set H C defined as
h C c = f M c g N c ,
for all c C = M N .
Definition 17
([21]). If F M , G N S E ( U ) , then the extended intersection denoted as F M ε G N is a soft set H C , where C = M N and H C is defined as
h C c = f M c , if c M N , g N c , if c N M , f M c g N c , if c M N .
Definition 18
([21]). If F M , G N S E ( U ) , then the restricted intersection of F M and G N denoted as F M G N is a soft set H C , defined as
h C c = f M c g N c
for all c C = M N .
Definition 19
([21]). If F M S E ( U ) then the relative complement of F M is a soft set denoted as F M r , defined as F M r = F M , where
f M r c = U f M c
for all c M .
Al-Shami [7] introduced the following classes of soft sets.
Definition 20
([7]). A soft set F M S E U is called:
(1) 
A huge soft set if there exists c M such as f M c = U .
(2) 
A large soft set if there exists a finite set M ´ M such as c M ´ f M c = U .

2. Generalized Finite Relaxed Soft Equality gf r

In this section, we present the generalized notion of the equality of two soft subsets. We start with the following definitions.
Definition 21.
Let F M and G N be two soft sets over a common universe U . We say that F M is the generalized finite relaxed soft subset of G N if either M = or, for some c M , there exists a finite subset N ´ of N such as
f M c c ´ N ´ g N c
and we denote this as F M g f r G N .
Definition 22.
Let F M and G N belong to S E U . Soft sets F M and G N are referred to as generalized finite relaxed soft-equal if
F M g f r G N and G N g f r F M
and we denote this as F M g f r G N .
Now we present the following proposition that shows that the generalized finite relaxed soft equality of soft sets is more general than the existing concepts of soft equalities.
Proposition 3.
If F M , G N S E U , then
(1) 
F M g G N implies F M g f G N implies F M g f r G N ,
(2) 
F M g G N implies F M g f G N implies F M g f r G N .
Proof. 
This proof follows from Definitions 12, 13, 21, 22 and Proposition 2. □
The following example shows that Definitions 21 and 22 are proper generalizations of Definitions 12 and 13.
Example 1.
Let U = u 1 , u 2 , u 3 , u 4 , u 5 be the given universal set and the sets of parameters E = c 1 , c 2 , c 3 , M = c 1 , c 2 and N = c 1 , c 2 , c 3 . Define
F M = c 1 , u 3 ) , ( c 2 , u 1 , u 2 , u 5 , G N = c 1 , u 3 , u 5 , c 2 , u 4 , c 3 , u 5 .
Note that
f M c 2 = u 1 , u 2 , u 5 c ´ N ´ g N c ´
for any subset N ´ N , That is F M g f G N . On the other hand, there exists c 1 M , such as
f M c 1 = u 3 g N c 1 = u 3 , u 5 c ´ N ´ g N c ´
where N ´ N is any finite subset containing c 1 . Hence F M g f r G N . Similarly, G N g f r F M . This implies that F M g f r G N . Note that F M g f G N .
Consider another example to show that there exists soft subsets F M , G N S L ( U ) , such as F M g f r G N .
Example 2.
Let U = u 1 , u 2 , u 3 be the given universal set and the sets of parameters E = c 1 , c 2 , c 3 , M = c 1 , c 2 and N = c 1 . Define
F M = c 1 , u 1 , c 2 , { u 3 } G N = c 1 , u 2 .
As observed, F M g f r G N and also G N g f r F N for any parameter c. Hence, F M g f r G N .
In [7] the author presented the following proposition.
Proposition 4
([7]).
(1) 
Every huge soft set is a large soft set.
(2) 
Any two huge soft sets are g-soft-equal, which implies that they are g f -soft-equal.
(3) 
The large and huge soft sets are g f -soft-equal.
The following example shows that the converse of statement (1) in the above proposition does not hold true.
Example 3.
Consider U = u 1 , u 2 , u 3 and the sets of parameters M = E = { c 1 , c 2 , c 3 } . If we define
F M = c 1 , u 2 , c 2 , u 1 , u 3 , c 3 ,
then F M is large but it is not a huge soft set.
We present the following proposition regarding huge and large soft sets.
Proposition 5.
(1) 
Any two huge soft sets are g f r -soft-equal.
(2) 
The large and huge soft sets are g f r -soft-equal.
Proof. 
This proof follows from Propositions 3 and 4. □
Abbas et al. [25] obtained the following result that shows that the operations and ε are idempotent, commutative, and associative with respect to the generalized finite soft equality relation g f .
Theorem 1
([25]). If F M , G N , H C S E ( U ) , then
(a) 
F M F M g f F M ,
(b) 
F M G N g f G N F M ,
(c) 
F M G N H C g f F M G N H C ,
(d) 
F M ε F M g f F M ,
(e) 
F M ε G N g f G N ε F M ,
(f) 
F M ε G N ε H C g f F M ε G N ε H C .
The above theorem holds true for the soft equality relation g f r .
Theorem 2.
If F M , G N , H C S E ( U ) , then
(a)
F M F M g f r F M ,
(b)
F M G N g f r G N F M ,
(c)
F M G N H C g f r F M G N H C ,
(d)
F M ε F M g f r F M ,
(e)
F M ε G N g f r G N ε F M ,
(f)
F M ε G N ε H C g f r F M ε G N ε H C .
Proof. 
This proof follows from Proposition 3 and Theorem 1. □
In [24], the authors proved that for F M , G N S E ( U ) , F M s G N (the lower soft equality of F M and G N ) and F M s G N (the upper soft equality of F M and G N ) imply that F M g G N (the g-soft equality of F M and G N ). Recently Al-shami [7] presented a counter-example (Example 3.1 in [7]) to show that F M s G N does not imply F M g G N . In the following, we present results that show that the lower and upper soft equalities of F M and G N do imply the generalized finite relaxed soft equality of F M and G N .
Proposition 6.
If F M s G N , then F M g f r G N .
Proof. 
Suppose that F M s G N . We will first show that F M g f r G N . Since for M = , the result holds trivially. Therefore, we assume that M . For any c M , if c M N then f M c = g N c ; so f M c g N c ´ for all c ´ = c M N N . If c M N , then f M c = and so f M c g N c * for all c * N . As for some parameter c M , there exists a finite subset N ´ of N, such as
f M c c ´ N ´ g N c ´
implies F M g f r G N . On similar lines, it can be shown that G N g f r F M . Consequently, we deduce F M g f r G N .
Proposition 7.
If F M s G N then F M g f r G N .
Proof. 
For F M , G N S E U , consider the following cases:
(c-1)
If M N = and M and N are nonempty, this implies f M c = U and g N c ´ = U where c M and c ´ N . This implies that F M g f r G N .
(c-2)
If M N , then f M c = g N c for each c M N . This is enough to conclude that F M g f r G N .
(c-3)
If M N = and either M or N is empty, then trivially the assertion holds true as well.
Remark 1.
Consider the soft sets F M , and G N as given in Example 1; then, neither F M s G N nor F M s G N , but, on the other hand, F M g f r G N .
In the following result, lower soft equality holds between the extended and restricted unions and intersections of two soft sets.
Theorem 3
([23]). If F M , G N , H C S E ( U ) , and F M s G N then
(a) 
F M G N s F M G N .
(b) 
F M G N s F M ε G N .
(c) 
F M R G N s F M G N .
(d) 
F M R G N s F M ε G N .
The following example shows that the above result can not be extended for the g f r -soft equality g f r .
Example 4.
If U = u 1 , u 2 , u 3 , u 4 , u 5 , M = c 1 , c 2 , the soft sets are given as
F M = c 1 , u 1 , u 2 , u 3 , c 2 , u 4 , u 5 , G M = c 1 , u 4 , u 5 , c 2 , u 1 , u 2 , u 3 ,
then F M g f r G M and
F M G M = c 1 , U , c 2 , U , F M G M = c 1 , , c 2 , , F M R G M = c 1 , U , c 2 , U , F M ε G M = c 1 , , c 2 , .
On the other hand,
F M G M g f r F M G M , F M G M g f r F M ε G M , F M R G M g f r F M G M , F M R G M g f r F M ε G M ,
as
F M G M g f r F M G M , F M G M g f r F M ε G M , F M R G M g f r F M G M , F M R G M g f r F M ε G M .
Theorem 4.
If F M , G N , H C S E ( U ) , then the following is true.
(1) 
F M G N F M g f r F M .
(2) 
F M G N F M g f r F M .
Proof. 
This proof follows from Proposition 3 and Theorem 4.4 in [24]. □
Remark 2.
Let F M , G N S E U . If F M g f r G N then F M G N g f r F M and F M G N g f r G N do not necessarily hold true, as shown in the examples (see Remark 4.6 and Example 4.7 in [24]).
The following result is related to De Morgan’s laws for soft sets, involving generalized finite relaxed soft equality.
Theorem 5.
If F M , G N S E U , such as M N , then
(a) 
F M R G N r g f r F M r G N r .
(b) 
F M G N r g f r F M r R G N r .
(c) 
F M G N r g f r F M r ε G N r .
(d) 
F M ε G N r g f r F M r G N r .
Proof. 
This proof follows from Proposition 3 and Theorem 4.14 and Theorem 4.15 in [24]. □
Remark 3.
The lower soft equality s is a congruence relation [23], that is, F M s G M and H M s I M imply that
F M H M s G M I M and F M H M s G M I M .
whereas g f r is not a congruence relation as shown in the following example.
Example 5.
Consider U = u 1 , u 2 , u 3 , u 4 , M = c 1 , c 2 and the soft sets F M , G M , H M , I M S E U defined as
F M = c 1 , u 1 , u 2 , c 2 , , G M = c 1 , u 3 , c 2 , u 1 , u 2 , H M = c 1 , u 3 , c 2 , u 4 , I M = c 1 , u 3 , c 2 , u 2 , u 4 .
Then
F M H M = c 1 , , c 2 , , G M I M = c 1 , u 3 , c 2 , u 2 , F M H M = c 1 , u 1 , u 2 , u 3 , c 2 , u 4 , G M I M = c 1 , u 3 , c 2 , u 1 , u 2 , u 4 .
Note that F M g f r G M and H M g f r I M but
F M H M g f r G M I M and F M H M g f r G M I M .

3. Generalized Finite Relaxed Soft Union and Intersection

In this section, we present the notions of generalized finite relaxed soft unions and intersections of soft sets.
Recently, Abbas et al. [25] introduced generalized finite unions of soft sets as follows.
Definition 23
([25]). The generalized finite soft union of F M , G N S E U , denoted by F M g f G N , is the set consisting of all H C S E U satisfying:
(c-i) 
F M g f H C and G N g f H C , where C E .
(c-ii) 
If there exists J D S E U , such as F M g f J D and G N g f J D , then H C g f J D .
That is, H C is a minimal g f -soft super set of F M and G N in the sense that if there exists another soft set J D satisfying (c-i), then H C is a g f -soft subset of J D .
Furthermore, they introduced the following version of the generalized finite intersection of soft sets.
Definition 24
([25]). The generalized finite intersection of F M , G N S E ( U ) , denoted as F M g f G N , is the set of all H C S E ( U ) satisfying:
(c-iii) 
H C g f F M and H C g f G N , where C E ,
(c-iv) 
If there exists J D S E U such as J D g f F M and J D g f G N then J D g f H C .
Here H C is a maximal g f -soft subset of F M and G N in the sense that if there exists another soft set J D satisfying (c-iii), then J D is the g f -soft subset of H C .
We present the definition of generalized finite relaxed unions of soft sets as follows.
Definition 25.
Consider F M , G N S E U . Then the generalized finite relaxed soft union denoted by F M g f r G N is defined as the collection of all soft sets H C S E U , which satisfies the following two conditions:
(a) 
F M g f r H C and G N g f r H C , where C E ;
(b) 
If there exists J D S E U , such as F M g f r J D and G N g f r J D , then H C g f r J D .
That is, H C is a minimal g f r -soft super set of F M and G N in the sense that if there exists another soft set J D satisfying (a), then H C is a g f r -soft subset of J D .
Consider the following example where F M g f r G N is nonempty.
Example 6
(compare Exmple 2.15 in [25]). Suppose that U = u 1 , u 2 , u 3 is the universe and M = c 1 , c 2 and N = c 1 are subsets of the set of parameters E = c 1 , c 2 . Let
F M = c 1 , u 1 , c 2 , u 2 , G N = c 1 , u 3 .
Let H C S E U , such as F M g f r H C and G N g f r H C , where C E .
If C = 1 , i.e.,  C = c i , for i = 1 or i = 2 , we deduce that if H C = c i , u 1 , u 3 or H C = c i , u 2 , u 3 , then H C will satisfy the condition N for some J D = c i , U .
We deduce that both conditions M and N for g f r -union hold true and so the set F M g f r G N is nonempty.
Definition 26.
Let F M and G N belong to S E U . Then the generalized finite relaxed soft intersection denoted by F M g f r G N , is defined as the collection of all soft sets H C S E U which satisfies the following two conditions:
(c) 
H C g f r F M and H C g f r G N , where C E ;
(d) 
If there exists J D S E U such as J D g f r F M and J D g f r G N , then J D g f r H C .
Here, H C is a maximal g f r -soft subset of F M and G N in the sense that if there exists another soft set J D satisfying (c), then J D is the g f r -soft subset of H C .
Abbas et al. [25] presented the following result.
Theorem 6
([25]). If F M , G N S E U , then
F M G N F M g f G N .
Remark 4.
If F M , G N S E U , then
F M G N F M g f r G N
does not hold true, as shown in the following example.
Example 7.
If U = u 1 , u 2 , u 3 , u 4 and M = N = E = c 1 , c 2 , c 3 and the soft sets defined as
F M = c 1 , u 1 , u 4 , c 2 , u 3 , u 4 , c 3 , u 1 , u 2 , G N = c 1 , u 1 , u 2 , c 2 , u 3 , u 4 , c 3 , u 3 ,
then
F M G N = c 1 , u 1 , u 2 , u 4 , c 2 , u 3 , u 4 , c 3 , u 1 , u 2 , u 3 .
For J D = c 1 , u 1 , u 2 , clearly,
F M g f r F M G N , G N g f r F M G N and F M g f r J D , G N g f r J D .
On the other hand,
F M G N g f r J D implies F M G N F M g f r G N .
Remark 5.
Note that the above Example 7 also shows that
F M ε G N F M g f r G N
particularly when M = N = E . As observed,
H C = F M ε G N = c 1 , u 1 , c 2 , u 3 , u 4 , c 3 , .
For J D = c 1 , u 1 , u 2 , clearly,
J D g f r F M and J D g f r G N
but
J D g f r F M ε G N .
Hence,
H C F M g f r G N .
Abbas et al. [25] presented the following result.
Proposition 8.
Let F M and G N be two soft sets over a common universe U , such as M N = . Then F M ε G N F M g f G N .
Al-Shami [7] presented the following example to show that Proposition 8 does not hold true.
Example 8
(compare Example 3.11 in [7]). Let U = u 1 , u 2 , u 3 , u 4 be a universal set and E = c 1 , c 2 , c 3 , M = { c 1 , c 2 } , N = { c 3 } are the sets of parameters. Define soft sets as follows: M N = and
F M = c 1 , u 1 , u 4 , c 2 , { u 2 , u 3 } and G N = c 3 , u 1 , u 4 .
Note that
F M ε G N = c 1 , u 1 , u 4 , c 2 , { u 2 , u 3 } , c 3 , u 1 , u 4 F M g f G N .
Abbas et al. [25] presented the following lemma.
Lemma 1
([25]). If F M , G N , H C S E U , then
F M g f G N and G N g f H C implies that F M g f H C .
Note that Lemma 1 does not hold true if we replace g f with g f r . In this context we present the following example.
Example 9.
Let U = u 1 , u 2 , u 3 , u 4 be a universal set; E = c 1 , c 2 , c 3 the set of parameters; and M = { c 1 } , N = { c 2 , c 3 } and C = { c 1 } . Consider the following soft sets
F M = c 1 , u 1 , u 2 , G N = c 2 , u 1 , u 2 , c 3 , { u 3 } and H C = c 1 , u 3 .
As can be observed, although F M g f r G N and G N g f r H C but F M g f r H C .
Using Lemma 1, they [25] obtained the following results.
Theorem 7
([25]). Let F M and G N be two soft sets over a common universe U, such as M N = . Then
F M g f G N = H C S E ( U ) : H C g f F M G N .
Theorem 8
([25]). Let F M and G N be two soft sets over a common universe U, such as M N = . Then
F M g f G N = H C S E ( U ) : H C g f F M ε G N .
Now we present the following result.
Proposition 9.
Let F M and G N be two soft sets over a common universe U , such as M N = . Then
F M ε G N F M g f r G N .
Proof. 
Let F M ε G N = H C , where C = M N . Then h C c = f M c for all c M N . Since M N = ; therefore, c M = M N . We know
h C c = f M c M M f M M
where M M M . Thus, F M ε G N g f r F M , and similarly F M ε G N g f r G N . Next consider D E and J D S E ( U ) , such as J D g f r F M and J D g f r G N . Then
j D d M M f M and j D d N N g N
for some d D , where M M , N N are finite. As M N = , so
j D d M M f M N N g N = c C h C ( c )
for some d D , where C = M N . Therefore, J D g f r F M ε G N . This shows that
F M ε G N F M g f r G N .
Example 10.
Let U = u 1 , u 2 , u 3 , u 4 be a universal set, E = c 1 , c 2 , c 3 the set of parameters and M = { c 1 , c 2 } , N = { c 3 } . Define,
F M = c 1 , u 1 , u 4 , c 2 , u 3 G N = c 3 , u 1 .
Then
F M ε G N = c 1 , u 1 , u 4 , c 2 , u 3 , c 3 , u 1 .
If
J D = c 1 , u 1 , c 2 , u 3
then J D g f r F M and J D g f r G N , and, as observed, J D g f r F M ε G N .
Now we present a characterization of the soft sets in F M g f r G N via generalized finite relaxed soft equality as follows.
Theorem 9.
Let F M and G N be two soft sets over a common universe U, such as M N = . If H C F M g f r G N , then
H C g f r F M ε G N .
Proof. 
Let
H C F M g f r G N .
Then, according to the definition of F M g f r G N , H C g f r F M and H C g f r G N , where C E . Since M N = . Furthermore, from Proposition 9 we have
F M ε G N F M g f r G N .
The inclusions (1) and (2) imply that
H C g f r F M ε G N and F M ε G N g f r H C .
Consequently, we can obtain
H C g f r F M ε G N .
The converse of Theorem 9 does not hold true, as shown in the following example.
Example 11.
Let U = u 1 , u 2 , u 3 be a universal set, E = c 1 , c 2 , c 3 the set of parameters and M = { c 1 , c 2 }   a n d   N = { c 3 } . Consider the soft sets
F M = c 1 , u 1 , c 2 , { u 2 } and G N = c 3 , U .
Note that M N = and
F M ε G N = c 1 , u 1 , c 2 , { u 2 } , c 3 , U .
Consider
H C = c 3 , U ,
and, as observed, H C g f r F M ε G N but H C g f r F M . Hence,
H C F M g f r G N .

4. Conclusions

In an attempt to develop further the soft set theory, we generalized the notions of g f -soft subsets and the g f -soft equality of two soft subsets by introducing the notions of g f r -soft subsets and the g f r -soft equality of two soft sets via a further relaxation of constraints on the parameter sets. Example 8, developed by Al-Shami [7], shows that Proposition 8 about g f -soft intersection does not hold true. However, with the generalized notions, we were able to prove Proposition 8 in regard to g f r -soft intersection. Furthermore, Al-Shami [7] pointed out that the upper soft equality s of two soft sets does not imply the g f -soft equality but the upper soft equality implies the g f r -soft equality of two soft sets. Regarding g f r -soft unions, Example 7 shows that Theorem 4 cannot be extended for g f r -soft unions. Moreover, with g f r -soft intersections, the converse of Theorem 9 does not hold true, as shown in Example 11. We can see that generalized finite relaxed ( g f r ) operations are better when it comes to the g f r -soft intersection of soft sets as compared to the g f r -soft union of soft sets.
As a future direction, one can investigate g f r -soft operations to develop further refinements so that the above-mentioned shortcomings can be removed. Moreover, based on these new operations, one can consider the extension of existing soft topologies and various hybrid structures involving soft sets (compare [8,17,29]).

Author Contributions

B.A., N.S. (Nozara Sundus), and S.K. dealt with the conceptualization, formal analysis, supervision, methodology, investigation, and writing original draft preparation. N.S. (Naeem Saleem) and R.G. contributed in the formal analysis; writing, review and editing; project administration; and funding acquisition. M.S. review the article and improved the presentation. All authors read and approved the final manuscript.

Funding

This research is supported by Deanship of Scientific Research, Prince Sattam bin Abdulaziz University, Alkharj, Saudi Arabia.

Data Availability Statement

Data sharing is not applicable to this paper as no data sets were generated or analyzed during the current study.

Acknowledgments

The authors are very grateful to the anonymous reviewers for their useful suggestions which have helped us to improve further the presentation of the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inform. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Molodtsov, D. Soft set theory—First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Green Version]
  3. Maji, P.K.; Roy, A.R.; Biswas, R. An application of soft sets in a decision making problem. Comput. Math. Appl. 2002, 44, 1077–1083. [Google Scholar] [CrossRef] [Green Version]
  4. Irfan, D.; Çağman, N. Fuzzy soft games. Filomat 2015, 29, 1901–1917. [Google Scholar]
  5. Yuksel, S.; Dizman, T.; Yildizdan, G.; Sert, U. Applications of soft sets to diagnose the prostate cancer risk. J. Inequal. Appl. 2013, 2013, 229. [Google Scholar] [CrossRef] [Green Version]
  6. Aktas, H.; Cagman, N. Soft sets and soft groups. Inform. Sci. 2007, 177, 2726–2735. [Google Scholar] [CrossRef]
  7. Al-shami, T.M. Investigation and corrigendum to some results related to g-soft equality and gf-soft equality relations. Filomat 2019, 33, 3375–3383. [Google Scholar] [CrossRef]
  8. Cagman, N.; Karatas, S.; Enginoglu, S. Soft topology. Comput. Math. Appl. 2011, 62, 351–358. [Google Scholar] [CrossRef] [Green Version]
  9. Ge, X.; Yang, S. Investigations on some operations of soft sets. World Acad. Sci. Eng. Technol. 2011, 51, 1112–1115. [Google Scholar]
  10. Jiang, Y.; Tang, Y.; Chen, Q.; Wang, J.; Tang, S. Extending soft sets with description logics. Comput. Math. Appl. 2010, 59, 2087–2096. [Google Scholar] [CrossRef] [Green Version]
  11. Jun, Y.B. Soft BCK/BCI-algebras. Comput. Math. Appl. 2008, 56, 1408–1413. [Google Scholar] [CrossRef] [Green Version]
  12. Jun, Y.B.; Park, C.H. Applications of soft sets in ideal theory of BCK/BCI-algebras. Inform. Sci. 2008, 178, 2466–2475. [Google Scholar] [CrossRef]
  13. Jun, Y.B.; Lee, K.J.; Park, C.H. Soft set theory applied to ideals in d-algebras. Comput. Math. Appl. 2009, 57, 367–378. [Google Scholar] [CrossRef] [Green Version]
  14. Jun, Y.B.; Lee, K.J.; Khan, A. Soft ordered semigroups. Math. Logic Quart. 2010, 56, 42–50. [Google Scholar] [CrossRef]
  15. Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Green Version]
  16. Majumdar, P.; Samanta, S.K. Generalized fuzzy soft sets. Comput. Math. Appl. 2010, 59, 1425–1432. [Google Scholar] [CrossRef] [Green Version]
  17. Meng, D.; Zhang, X.; Qin, K. Soft rough fuzzy sets and soft fuzzy rough sets. Comput. Math. Appl. 2011, 62, 4635–4645. [Google Scholar] [CrossRef] [Green Version]
  18. Singh, D.; Onyeozili, I.A. Some conceptual misunderstandings of the fundamentals of soft set theory. ARPN J. Syst. Softw. 2012, 2, 251–254. [Google Scholar]
  19. Yang, J.L.; Yao, Y.Y. Semantics of soft sets and three-way decision with soft sets. Knowl.-Based Syst. 2020, 194, 105538. [Google Scholar] [CrossRef]
  20. Yang, C.F. A note on “soft set theory” [Comput. Math. Appl. 2003, 45, 555–562]. Comput. Math. Appl 2008, 56, 1899–1900. [Google Scholar] [CrossRef] [Green Version]
  21. Ali, M.I.; Feng, F.; Liu, X.; Min, W.K.; Shabir, M. On some new operations in soft set theory. Comput. Math. Appl. 2009, 57, 1547–1553. [Google Scholar] [CrossRef] [Green Version]
  22. Li, F. Notes on the soft operations. ARPN J. Syst. Softw. 2011, 1, 205–208. [Google Scholar]
  23. Qin, K.; Hong, Z. On soft equality. J. Comput. Appl. Math. 2010, 234, 1347–1355. [Google Scholar] [CrossRef] [Green Version]
  24. Abbas, M.; Ali, B.; Romaguera, S. On generalized soft equality and soft lattice structure. Filomat 2014, 28, 1191–1203. [Google Scholar] [CrossRef]
  25. Abbas, M.; Ali, M.I.; Romaguera, S. Generalized operations in soft set theory via relaxed conditions on parameters. Filomat 2017, 31, 5955–5964. [Google Scholar] [CrossRef]
  26. Akram, M.; Ali, G.; Alcantud, J.C.R.; Fatimah, F. Parameter reductions in N-soft sets and their applications in decision-making. Expert Syst. 2021, 38, e12601. [Google Scholar] [CrossRef]
  27. Akram, M.; Ali, G.; Alcantud, J.C.R. Parameter reduction analysis under interval-valued m-polar fuzzy soft information. Art. Intel. Rev. 2021, 54, 5541–5582. [Google Scholar] [CrossRef]
  28. Zhu, P.; Wen, Q. Operations on soft sets revisited. J. Appl. Math. 2013, 2013, 105752. [Google Scholar] [CrossRef]
  29. Alcantud, J.C.R. Soft open bases and a novel construction of soft topologies from bases for topologies. Mathematics 2020, 8, 672. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ali, B.; Saleem, N.; Sundus, N.; Khaleeq, S.; Saeed, M.; George, R. A Contribution to the Theory of Soft Sets via Generalized Relaxed Operations. Mathematics 2022, 10, 2636. https://doi.org/10.3390/math10152636

AMA Style

Ali B, Saleem N, Sundus N, Khaleeq S, Saeed M, George R. A Contribution to the Theory of Soft Sets via Generalized Relaxed Operations. Mathematics. 2022; 10(15):2636. https://doi.org/10.3390/math10152636

Chicago/Turabian Style

Ali, Basit, Naeem Saleem, Nozara Sundus, Sana Khaleeq, Muhammad Saeed, and Reny George. 2022. "A Contribution to the Theory of Soft Sets via Generalized Relaxed Operations" Mathematics 10, no. 15: 2636. https://doi.org/10.3390/math10152636

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop