Next Article in Journal
α H-ψH-Multivalued Contractive Mappings and Related Results in Complete Metric Spaces with an Application
Previous Article in Journal
On a Certain Subclass of Analytic Functions Involving Integral Operator Defined by Polylogarithm Function
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Soft Rough Topology with Multi-Attribute Group Decision Making

1
Faculty of Science, Department of Mathematics, University of the Punjab, Lahore Postcode 54590, Pakistan
2
Department of Mathematics & Sciences, University of New Mexico, 705 Gurley Ave, Gallup, NM 87301, USA
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(1), 67; https://doi.org/10.3390/math7010067
Submission received: 10 November 2018 / Revised: 14 December 2018 / Accepted: 16 December 2018 / Published: 9 January 2019

Abstract

:
Rough set approaches encounter uncertainty by means of boundary regions instead of membership values. In this paper, we develop the topological structure on soft rough set ( SR -set) by using pairwise SR -approximations. We define SR -open set, SR -closed sets, SR -closure, SR -interior, SR -neighborhood, SR -bases, product topology on SR -sets, continuous mapping, and compactness in soft rough topological space ( SRTS ). The developments of the theory on SR -set and SR -topology exhibit not only an important theoretical value but also represent significant applications of SR -sets. We applied an algorithm based on SR -set to multi-attribute group decision making (MAGDM) to deal with uncertainty.

1. Introduction

The problem of imperfect knowledge has been the center of attention for many years. In the field of mathematics, computer science, and artificial intelligence, researchers have used different methods to tackle the problem of uncertain and incomplete data, including probability theory, fuzzy set [1], and rough set [2,3] and soft set techniques [4,5,6]. Molodstov [6] introduced soft set as an effective tool to manage imprecision; it includes a set of parameters to describe the set properly. Maji et al. (2002–2003) [4,5] extended some operations of soft set and effectively used this technique in a decision-making problem. Soft set with decision making have studied by many researchers [7,8,9,10,11]. In 2011, Shabir and Naz [12] and Cagman et al. [13] independently worked on the topological structure of soft set. Chen [14] presented a new definition related to the reduction of soft parameterization. The study of hybrid structures, having emerged from the fusion of soft sets with other mathematical approaches, is becoming an active topic for research nowadays. Aktas and Cagman (2007) [15] efficiently related the three concepts of soft set, rough set, and fuzzy set. Riaz et al. [16,17,18] established some results of soft algebra, soft metric spaces, and measurable soft mappings. Riaz and Masooma [19,20,21,22,23] introduced fuzzy parameterized fuzzy soft set ( fpfs -set), fpfs -topology, and fpfs -compact spaces, with some important applications of fpfs -set to decision-making problems. They presented fns -mappings and fixed points of fns -mapping. Different researchers have tackled the problem of incomplete or uncertain information in the system in different ways. Shang worked on robust statistics, and he investigated the robustness of a system under different circumstances and analyzed the robustness properties of subgraphs under attack in complex networks [24,25]. The rough set concept presented by Pawlak presents a systematic approach for the classification of objects. It characterizes a set of objects by two exact concepts, known as its approximations. Here, vagueness is expressed in the form of a boundary region, where empty boundary region implies that the set is crisp, and a non-empty boundary region implies that our knowledge is insufficient to explain the set precisely. By using equivalence relations, Thivagar et al. [26] generated the topology on rough set which includes approximations and the boundary region. Equivalence relation plays an important role in Pawlak’s rough set model, and by replacing it with a soft set, soft rough set SR -sets were introduced by Feng [27]. Feng et al. [28] presented some properties related to SR -approximations. Xue et al. [29] presented some decision-making algorithms regarding hybrid soft models. Zou and Xiao [30] analyzed data in soft sets under incomplete information systems. There are mainly two streams of study connecting soft rough set theory and topology theory. At the same time, according to the topological properties on the topological SR -space, some applications for image processing and some topological diagrams are introduced. The remainder of the paper is composed as follows. In Section 2, we briefly define the notions of rough set R -set and soft rough set SR -set. In Section 3, we present a novel topological structure of SR -set. We present some new results of SR -set theory and SR -topology. A topological structure on soft rough set was defined by Bakier et al. [31]. Malik and Riaz [32,33] studied action of modular group on real quadratic fields. Soft sets, neutrosophic set and rough sets with decision making problems have studied by many researchers [34,35,36,37,38,39,40]. We define SR -topology on soft rough set in the form of the pair τ SR = ( τ SR , τ SR ) , where τ SR is the lower SR -topology and τ SR is the upper SR -topology on set Y . This SR -topology is more appropriate, as it looks like a natural soft rough topology on a soft rough set. In Section 4, continuity, homeomorphism, and projection mappings in SR -set are discussed. Section 5 describes the compactness in SR -set. In Section 6, SR approximations are employed to solve multi-attribute group decision-making problem.

2. Preliminaries

In this section, we illustrate some basic notions related to SR -theory. First we define rough set R -set and soft rough set SR -set and then explain a few related operations on SR -set.
Definition 1
([2]). Suppose we have an object set V known as universe, and an indiscernibility relation V × V which represents knowledge about elements of V . We take ℜ as an equivalence relation and denote it by ( y ) . The pair ( V , ) is called the approximation space. Let Y be any subset of V . We characterize the set Y with respect to ℜ.
(1) The union of all granules which are entirely included in the set Y is called the lower approximation of the set Y w.r.t ℜ, mathematically defined as
( Y ) = y V { ( y ) : ( y ) Y }
(2) The union of all the granules having a non-empty intersection with the set Y is called the upper approximation of the set Y w.r.t ℜ, mathematically defined as
( Y ) = y V { ( y ) : ( y ) Y }
(3) The difference between the upper and lower approximations is called the boundary region of the set Y w.r.t ℜ, mathematically defined as
B ( Y ) = ( Y ) - ( Y )
If ( Y ) = ( Y ) , the set Y is said to be defined. If ( Y ) ( Y ) , i.e., B R ( Y ) , the set Y is said to be a (imprecise) rough set w.r.t ℜ.
We denote a rough set Y by a pair comprising a lower approximation and upper approximation Y = ( ( Y ) , ( Y ) )
Definition 2
([28]). Consider a soft set S = ( T , A ) over the universe V , where A E and T is a mapping defined as T : A P ( V ) . Here, soft approximation space is the pair P = ( V , S ) . Following the soft approximation space P , we define two operations as follows:
P ( Y ) = { v V : a A , [ v T ( a ) Y ] } ,
P ( Y ) = { v V : a A , [ v T ( a ) Y ] }
regarding every subset Y V , two sets P ( Y ) and P ( Y ) , which are called the soft P-lower approximation and soft P-upper approximation of Y , respectively. In general, we refer to P ( Y ) and P ( Y ) as SR -approximations of Y w.r.t P . If P ( Y ) = P ( Y ) , then Y is said to be soft P-definable; otherwise, Y is a soft P-rough set. Then, B n d P = P ( Y ) - P ( Y ) is the SR -boundary region.
We denote SR -set ( SR -set) Y by a pair comprising SR -lower approximation and SR -upper approximation Y = ( P ( Y ) , P ( Y ) ) .
Example 1.
Let V = { s 1 , s 2 , s 3 , s 4 , s 5 } be the set of perfumes, and let A = { ζ 1 , ζ 2 , ζ 3 , ζ 4 } = E be the qualities which Miss Amal wants in her perfume. Let S = ( T , A ) be a soft set over V . T ( ζ 1 ) = { s 3 , s 5 } , T ( ζ 2 ) = { s 2 , s 4 , s 5 } , T ( ζ 3 ) = { s 1 , s 2 , s 5 } , T ( ζ 4 ) = { s 2 , s 3 } and the soft approximation space P = ( V , S ) . The tabular form of soft set ( T , A ) is given in Table 1.
For Y = { s 3 , s 4 , s 5 } V , we have P ( Y ) = { s 3 , s 5 } and P ( Y ) = { s 1 , s 2 , s 3 , s 4 , s 5 } . Since P ( Y ) P ( Y ) ; therefore, Y is a soft P-rough set and is denoted by Y = { s 3 , s 5 } , { s 1 , s 2 , s 3 , s 4 , s 5 }
Definition 3.
Let A = ( P ( A ) , P ( A ) ) and B = ( P ( B ) , P ( B ) ) be two arbitrary SR -sets and P = ( V , S ) be soft approximation space. Then, A is a SR -subset of B if P ( A ) P ( B ) and P ( A ) P ( B ) .
Example 2.
Suppose V = { α 1 , α 2 , α 3 , α 4 , α 5 , α 6 , α 7 , α 8 } and E = { ξ 1 , ξ 2 , ξ 3 , ξ 4 } . Let S = ( T , E ) be a soft set over V ,
  • T ( ξ 1 ) = { α 2 , α 8 }
  • T ( ξ 2 ) = { α 2 , α 3 , α 6 , α 8 }
  • T ( ξ 3 ) = { α 2 , α 5 , α 7 }
  • T ( ξ 4 ) = { α 3 , α 4 , α 6 }
and P = ( V , S ) be soft approximation space. Consider A = { α 2 , α 4 , α 5 , α 7 } V and B = { α 3 , α 4 } then P ( A ) = { α 2 , α 5 , α 7 } and P ( A ) = { α 2 , α 3 , α 4 , α 5 , α 6 , α 7 , α 8 } , while P ( B ) = and P ( B ) = { α 2 , α 3 , α 4 , α 6 , α 8 } .
So we have two SR -sets A = ( P ( A ) , P ( A ) ) = ( { α 2 , α 5 , α 7 } , { α 2 , α 3 , α 4 , α 5 , α 6 , α 7 , α 8 } ) and B = ( P ( B ) , P ( B ) ) = ( , { α 2 , α 3 , α 4 , α 6 , α 8 } ) . Since P ( B ) P ( A ) and P ( B ) P ( B ) . Thus, B is SR -subset of A .
Definition 4.
Let A = ( P ( A ) , P ( A ) ) , B = ( P ( B ) , P ( B ) ) be taken as two arbitrary SR sets and let ( V , S ) be soft approximation space. Then, the union of A and B is defined as A B = P ( A ) P ( B ) , P ( A ) P ( B ) .
Definition 5.
Let A = ( P ( A ) , P ( A ) ) , B = ( P ( B ) , P ( B ) ) be taken as two arbitrary SR sets and ( V , S ) be soft approximation space. Then, the intersection of A and B is defined as A B = P ( A ) P ( B ) , P ( A ) P ( B ) .
Example 3.
By using Example 2, we obtain A B = P ( A ) P ( B ) , P ( A ) P ( B ) = { α 2 , α 5 , α 7 } , { α 2 , α 3 , α 4 , α 5 , α 6 , α 7 , α 8 } and A B = P ( A ) P ( B ) , P ( A ) P ( B ) = , { α 2 , α 3 , α 4 , α 6 , α 8 } .
Definition 6
([31]). Let V be the universe of discourse and P = ( V , S ) is soft approximation space; then, SR -topology is defined as
τ SR ( Y ) = { V , , P ( Y ) , P ( Y ) , Bd ( Y ) }
where Y V . τ SR ( Y ) satisfies the following axioms:
(i) V and belong to τ SR ( X ) .
(ii) Union of elements of any subcollection of τ SR ( Y ) belongs to τ SR ( Y ) .
(iii) Intersection of elements of finite subcollection of τ SR ( Y ) belongs to τ SR ( Y ) .
The topology defined by τ SR ( Y ) on V is called SR -topology on V w.r.t Y and ( V , τ SR ( Y ) , E ) is said to be SR -topological space. Soft rough set with the topology τ SR is called a topological SR -set.
Example 4.
Let V = { ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 5 , ϑ 6 } be the set of cars under consideration, and let E = { ζ 1 , ζ 2 , ζ 3 , ζ 4 , ζ 5 } be the set of all parameters and A = { ζ 1 , ζ 2 , ζ 3 } E . Consider the soft approximation P = ( V , S ) , where S = ( T , A ) is a soft set over U given by: T ( ζ 1 ) = { ϑ 1 , ϑ 3 } , T ( ζ 2 ) = { ϑ 1 , ϑ 3 , ϑ 6 } a n d T ( ζ 3 ) = { ϑ 2 , ϑ 4 } .
For Y = { ϑ 2 , ϑ 3 , ϑ 4 , ϑ 6 } , we obtain P ( Y ) = { ϑ 2 , ϑ 4 } , P ( Y ) = { ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 6 } and B d ( Y ) = { ϑ 1 , ϑ 3 , ϑ 6 } . Then,
τ SR ( Y ) = { V , , { ϑ 2 , ϑ 4 } , { ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 6 } , { ϑ 1 , ϑ 3 , ϑ 6 } }
is a SR -topology.
Definition 7.
Let ( V , τ SR ( Y ) , E ) be a SR -topological space. Any subset A such that A τ SR A is said to be SR -open, and any subset A is SR -closed if and only if A c τ SR .
Example 5.
In Example 2, we can see that { ϑ 2 , ϑ 4 } , { ϑ 1 , ϑ 2 , ϑ 3 , ϑ 4 , ϑ 6 } , { ϑ 1 , ϑ 3 , ϑ 6 } are SR -open sets, and their relative complements { ϑ 1 , ϑ 3 , ϑ 5 , ϑ 6 } , { ϑ 5 } , { ϑ 2 , ϑ 4 , ϑ 5 } are SR -closed sets, while V and are both SR -open and SR -closed.

3. Topological Structure of SR -Sets

In this section, we define a new topological structure on SR -sets. We define SR -open set, SR -closed sets, SR -closure, SR -interior, SR -neighborhood, and SR -bases.
Definition 8.
Let Y = ( P ( Y ) , P ( Y ) ) be a SR -subset, where P = ( V , S ) . Let τ SR and τ SR be two topologies which contain only exact subsets of P ( Y ) and P ( Y ) , respectively. Then, the pair τ SR = ( τ SR , τ SR ) is called a SR -topology on the SR -set Y and the pair ( Y , τ SR ) is known as a soft rough topological space (SRTS). Soft rough set Y with the topology τ SR = ( τ SR , τ SR ) is known as topological SR -set. Also, in a SR -topology, τ SR = ( τ SR , τ SR ) , τ SR is the lower SR -topology and τ SR is the upper SR -topology on X.
Remark 1.
Since P ( Y ) and P ( Y ) are only exactly defined sets in SR -approximation space, we restrict the elements of τ and τ to the set of all exact or definable subsets of P ( Y ) and P ( Y ) , respectively. However, when they are grouped to form the SR -topology τ SR = ( τ SR , τ SR ) , indefinable sets can also be SR -open. The point to be noted is that a subset of Y , either exact or inexact, is SR -open iff its lower approximation is in the lower SR -topology and its upper approximation is in the upper SR -topology.
Definition 9.
Let ( Y , τ SR ) be an SRTS, where τ SR = ( τ SR , τ SR ) . Let A = ( P ( A ) , P ( A ) ) be any SR -subset of Y = ( P ( Y ) , P ( Y ) ) . Then, A is said to be lower SR -open if the lower approximation of A belongs to the lower SR -topology. That is, P ( A ) τ SR . Also, A is said to be upper SR -open if the upper approximation of A belongs to the upper SR -topology. That is, P ( A ) τ SR . A is said to be SR -open iff A is both lower SR -open and upper SR -open, i.e., P ( A ) τ SR and P ( A ) τ SR .
Theorem 1.
Consider an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . Let T be a collection of SR -open subsets of ( Y , τ SR ) . Then, T is a topology on Y .
Proof. 
Consider Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) .
(i) We have τ SR and τ SR . Therefore, ( , ) T . Also, P ( Y ) τ SR and P ( Y ) τ SR and, hence, Y = ( P ( Y ) , P ( Y ) ) T .
(ii) Let A = ( P ( A ) , P ( A ) ) and B = ( P ( B ) , P ( B ) ) be any two elements of T, implying that both A and B are SR -open subsets of Y . Therefore, P ( A ) τ SR , P ( A ) τ SR and P ( B ) τ SR , P ( B ) τ SR . Being topologies, τ SR and τ SR are closed under finite intersection; therefore, P ( A ) P ( B ) τ SR and P ( A ) P ( B ) τ SR . Hence, A B = ( P ( A ) P ( B ) , P ( A ) P ( B ) ) is an SR -open subset of Y , which shows that A B T . Since A and B are arbitrary, T is closed under finite intersections.
(iii) Let { A μ = ( P ( A μ ) , P ( A μ ) ) | μ Ω } be an arbitrary family of SR -open subsets of Y , and belongs to the subcollection T. A μ = ( P ( A μ ) , P ( A μ ) ) T implies P ( A μ ) τ SR and P ( A μ ) τ SR for all μ Ω . Since τ SR and τ SR are closed under arbitrary union, we have μ Ω P ( A μ ) τ SR and μ Ω P ( A μ ) τ SR , which shows that μ Ω A μ = μ Ω P ( A μ ) , μ Ω P ( A μ ) is an SR -open subset of Y . Thus, T is closed under arbitrary union.
From (i), (ii), and (iii), the family T of Y forms a topology on Y . □
Definition 10.
In any SR -set Y = ( P ( Y ) , P ( Y ) ) , define τ SR = { A P ( Y ) | A i s P - d e f i n a b l e } and τ SR = { B P ( Y ) / B i s P - d e f i n a b l e } . Then, τ SR and τ SR are topologies on P ( Y ) and P ( Y ) , respectively, and the SR -topology τ SR = ( τ SR , τ SR ) is known as the Discrete SR -topology on Y , and the topological space ( Y , τ SR ) is known as the Discrete SR -Topological Space on Y .
Definition 11.
In an SR -set Y = ( P ( Y ) , P ( Y ) ) , take τ SR = ( , P ( Y ) ) and τ SR = ( , P ( Y ) ) , then τ SR and τ SR are topologies on P ( Y ) and P ( Y ) , respectively, and the SR -topology τ SR = ( τ SR , τ SR ) on Y is known as the indiscrete SR -topology on Y , and ( Y , τ SR ) is known as the indiscrete SR -topological space on Y .
Definition 12.
In an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . Consider a subcollection β of subsets of P ( Y ) ; if every element of τ SR can be expressed as the union of some elements of β , then β is said to be a base for τ SR . If every member of τ SR can be expressed as the union of some members of β for another subcollection β of subsets of P ( Y ) , then β is said to be a base for τ SR . If the above conditions are satisfied, then the pair β SR = ( β , β ) is known as a SR -base for the SR -topology τ SR on Y .
Theorem 2.
Consider the SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . β SR = ( β , β ) is an SR -base for τ SR iff for any SR -open set A = ( P ( A ) , P ( A ) ) of ( Y , τ SR ) and ( x , y ) A such that x P ( A ) and y P ( A ) , then there exist B β and B β such that x B P ( A ) and y B P ( A ) .
Proof. 
Consider the SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . Let β and β be families of subsets of P ( Y ) and P ( Y ) , respectively, such that β SR = ( β , β ) is a SR -base for τ SR . Also, consider any SR -subset A = ( P ( A ) , P ( A ) ) and let ( x , y ) A be an arbitrary point such that x P ( A ) and y P ( A ) . Now, x P ( A ) , P ( A ) τ SR and β is a base for τ SR , which implies that P ( A ) can be written as the union of elements of β . Hence, B μ β such that x B μ and B μ P ( A ) . Choose such a B μ as B . Therefore, x B P ( A ) .
Similarly, by the same argument, there exists B β such that y B P ( A ) .
Conversely, suppose that β and β are families of subsets of P ( Y ) and P ( Y ) , respectively, such that for any SR -open set A = ( P ( A ) , P ( A ) ) of ( Y , τ SR ) , ( x , y ) A , where x P ( A ) and y P ( A ) ; then, there exist B β and B β such that x B P ( A ) and y B P ( A ) . Now, we have to prove that β SR = ( β , β ) is an SR -base for τ SR . Let C = ( P ( C ) , P ( C ) ) be any SR -open subset of the SRTS ( Y , τ SR ) . By our assumption, for each x P ( C ) , we have B x β such that x B x P ( C ) . Thus, P ( C ) = x P ( C ) B x . This implies that P ( C ) can be expressed as the union of some elements of β . Since C = ( P ( C ) , P ( C ) ) is taken arbitrarily, β is a lower base for SR -topology τ SR .
Similarly, by the same argument, P ( C ) can be expressed as the union of some members of β ; therefore, β is an upper base for the SR -topology τ SR . Hence, β SR = ( β , β ) is an SR -base for τ SR . □
Definition 13.
In an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . The collection S = ( S , S ) of subsets of Y , where S and S are a collection of subsets of P ( Y ) and P ( Y ) . S is said to be an SR -subbase for the topology τ SR iff the following conditions are satisfied:
(i) S τ SR and S τ SR .
(ii) Finite intersection of elements of S gives a base for τ SR and finite intersection of elements of S gives a base for τ SR .
Definition 14.
In an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . Let A = ( P ( A ) , P ( A ) ) be any SR -subset of Y . Then, the lower closure of A is the closure of P ( A ) in ( P ( Y ) , τ SR ) and is defined as the intersection of all closed supersets of P ( A ) , and it is denoted by C l SR ( P ( A ) ) . Also, the upper closure of P ( A ) in ( P ( Y ) , τ SR ) is the intersection of all closed supersets of P ( A ) and is denoted by C l SR P ( A ) . Then, the SR -closure of A = ( P ( A ) , P ( A ) ) is defined as C l SR ( A ) = ( C l SR ( P ( A ) ) , C l SR ( P ( A ) ) ) .
Definition 15.
In an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . Let A = ( P ( A ) , P ( A ) ) be any SR -subset of Y . Then, the lower interior of A is the interior of P ( A ) in ( P ( Y ) , τ SR ) and is defined as union of all SR -open subsets of ( P ( Y ) , τ SR ) contained in P ( A ) , and it is denoted by I n t SR ( P ( A ) ) . Also, the upper interior of P ( A ) in ( P ( Y ) , τ SR ) is the union of all SR -open subsets of ( P ( Y ) , τ SR ) contained in P ( A ) and is denoted by I n t SR ( P ( A ) ) . Then, the SR -interior of A = ( P ( A ) , P ( A ) ) and is defined as I n t SR ( A ) = ( I n t SR ( P ( A ) ) , I n t SR ( P ( A ) ) ) .
Definition 16.
An SR -subset A of ( Y , τ SR ) is said to be dense in Y if C l SR ( A ) = Y , i.e., an SR -subset A = ( P ( A ) , P ( A ) ) is dense in Y if C l SR ( P ( A ) ) = P ( Y ) and C l SR ( P ( A ) ) = P ( Y ) .
Theorem 3.
An SR -subset A = ( P ( A ) , P ( A ) ) of SRTS ( Y , τ SR ) is dense in Y iff for every non-empty SR -open set B = ( P ( B ) , P ( B ) ) of ( Y , τ SR ) , P ( A ) P ( B ) and P ( A ) P ( B ) .
Proof. 
Suppose A = ( P ( A ) , P ( A ) ) is dense in Y . Then, C l SR ( A ) = ( C l SR ( P ( A ) ) , C l SR ( P ( A ) ) ) = ( P ( Y ) , P ( Y ) ) = Y . Therefore, C l SR ( P ( A ) ) = P ( Y ) and C l SR ( P ( A ) ) = P ( Y ) . Now, B = ( P ( B ) , P ( B ) ) be any non-empty SR -open subset of ( Y , τ SR ) . Then, A B = P ( A ) P ( B ) , P ( A ) P ( B ) .
Suppose P ( A ) P ( B ) = . Then, P ( A ) P ( Y ) P ( B ) , which implies C l SR ( P ( A ) ) P ( Y ) P ( B ) , since P ( B ) τ SR and, therefore, P ( Y ) P ( B ) is closed. However, P ( Y ) P ( B ) is a proper subset of P ( Y ) , which contradicts C l SR P ( A ) = P ( Y ) . Hence, P ( A ) P ( B ) . Similarly, P ( A ) P ( B ) .
Conversely, suppose A = ( P ( A ) , P ( A ) ) is a SR -subset of Y such that for every non-empty SR -open set B = ( P ( B ) , P ( B ) ) of ( Y , τ SR ) , P ( A ) P ( B ) and P ( A ) P ( B ) . Let y P ( Y ) , since P ( A ) P ( B ) ; so, either y P ( A ) or it is a limit point of P ( A ) . That is, y C l SR ( P ( A ) ) . Therefore, P ( Y ) C l SR ( P ( A ) ) P ( Y ) , which implies C l SR ( P ( A ) ) = P ( Y ) . By a similar argument, we can prove that C l SR ( P ( A ) ) = P ( Y ) . Hence C l SR ( A ) = C l SR ( P ( A ) ) , C l SR ( P ( A ) ) = P ( Y ) , P ( Y ) = Y . So, A is dense in Y . □
Definition 17.
In an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . If for γ Y there exist an open set V 1 of P ( Y ) such that γ V 1 N , where N P ( Y ) , then the subset N is called τ SR - n e i g h b o r h o o d . Similarly, if for γ Y there exist an open set V 2 of P ( Y ) such that γ V 2 N , where N P ( Y ) , then the subset N is called τ SR - n e i g h b o r h o o d . If, at the same time, N P ( Y ) and N P ( Y ) , then N SR = ( N , N ) is said to be a τ SR - n e i g h b o r h o o d of γ Y .
Proposition 1.
Consider an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . Let A = ( P ( A ) , P ( A ) ) be an SR -subset of SR -set Y satisfying P ( A ) P ( Y ) P ( Y ) . Then, A is SR -open iff it is a neighborhood of each of its points.
Proof. 
Suppose that A = ( P ( A ) , P ( A ) ) as an open subset of SR -set Y = ( P ( Y ) , P ( Y ) ) . Then, for every μ P ( A ) , μ P ( A ) P ( A ) , and for every ν P ( A ) , ν P ( A ) P ( A ) . Hence, P ( A ) and P ( A ) satisfy the neighborhood definition and are neighborhoods of each point, and, hence, A = ( P ( A ) , P ( A ) ) is a neighborhood of each of its points.
Conversely, suppose A = ( P ( A ) , P ( A ) ) is a neighborhood of each of its points. Given the assumption P ( A ) P ( Y ) P ( Y ) , if A = , then it is SR -open. For μ A , then there exists an SR -open set V = ( V μ , V μ ) in Y such that μ V μ P ( A ) and μ V μ P ( A ) . This implies P ( A ) = { V μ / μ P ( A ) } and P ( A ) = { V μ / μ P ( A ) } . Hence, P ( A ) and P ( A ) are SR -open, which implies A is open. □

4. Continuity in SR -Sets

In this section, we discuss the continuity of functions in SR -topological spaces, the continuous image of an SR -closed set. The SR -homeomorphism is the part of the conversation.
Definition 18.
Let ( Y , τ SR ) and ( Z , ρ SR ) be topological SR -sets with topologies τ SR = ( τ SR , τ SR ) and ρ SR = ( ρ SR , ρ SR ) , respectively. A function φ 1 : P ( Y ) P ( Z ) is continuous at μ Y iff every ρ 1 -neighborhood H 1 of φ 1 ( μ ) in P ( Z ) there exists a τ 1 -neighborhood G 1 of μ in P ( Y ) such that φ 1 ( G 1 ) H 1 and φ 2 : P ( Y ) P ( Z ) is continuous at μ Z iff every ρ 2 -neighborhood H 2 of φ 2 ( μ ) in P ( Z ) there exists a τ 2 -neighborhood G 2 of μ in P ( Z ) such that φ 2 ( G 2 ) H 2 . Then, the function φ = ( φ 1 , φ 2 ) : Y Z is said to be a continuous function at μ if both φ 1 and φ 2 are continuous functions at μ.
Example 6.
Assume that V = { 1 , 2 , 3 , 4 } , E = { ζ 1 , ζ 2 , ζ 3 , ζ 4 } , A = { ζ 1 , ζ 3 , ζ 4 } E and G = { ( ζ 1 , ( 1 , 4 ) , ( ζ 3 , 2 ) , ( ζ 4 , 3 ) } is a soft set. Thus, we get P = ( V , G ) as a soft approximation space. If we take Y V , where Y = { 3 , 4 } , then we have P ( Y ) = { 3 } , P ( Y ) = { 1 , 3 , 4 } and B n d P = { 1 , 4 } . Thus, τ SR ( Y ) = { V , , { 3 } , { 1 , 3 , 4 } , { 1 , 4 } } is an SR -topology.
Let W = { ϖ 1 , ϖ 2 , ϖ 3 , ϖ 4 } and H = { ( ζ 1 , { ϖ 1 } ) , ( ζ 3 , { ϖ 2 , ϖ 3 } ) , ( ζ 4 , { ϖ 4 } ) } be a soft set; then, we have P = ( W , H ) as a soft approximation space. If we take Z W , where Z = { ϖ 3 , ϖ 4 } , then P ( Z ) = { ϖ 4 } , P ( Z ) = { ϖ 2 , ϖ 3 , ϖ 4 } and B n d P = { ϖ 2 , ϖ 3 } , and ρ SR = { W , , { ϖ 4 } , { ϖ 2 , ϖ 3 , ϖ 4 } , { ϖ 2 , ϖ 3 } } is another SR -topology.
Define a function φ = ( φ 1 , φ 2 ) : V W such that φ ( 1 ) = φ 2 ( 1 ) = ϖ 2 , φ ( 2 ) = φ 2 ( 2 ) = ϖ 1 , φ ( 3 ) = φ 1 ( 3 ) = φ 1 ( 1 ) = ϖ 4 and φ ( 4 ) = φ 2 ( 4 ) = ϖ 3 . Then, φ - 1 ( { ϖ 2 , ϖ 3 , ϖ 4 } ) = { 1 , 3 , 4 } , φ - 1 ( { ϖ 2 , ϖ 3 } ) = { 1 , 4 } and φ - 1 ( { ϖ 4 } ) = { 3 } . Thus, φ is SR -continuous, since the inverse image for each SR -open set in W is SR -open in V .
Theorem 4.
Consider ( Y , τ SR ) and ( Z , ρ SR ) are topological SR -sets and φ = ( φ 1 , φ 2 ) : Y Z . For every ρ- SR -open set V = ( V 1 , V 2 ) , φ 1 - 1 ( V 1 ) P ( Y ) φ 2 - 1 ( V 2 ) P ( Y ) . Then, φ is a continuous function if and only if the inverse image of every SR -open set in Z under φ is SR -open in Y .
Proof. 
Suppose φ = ( φ 1 , φ 2 ) : Y Z is a continuous function and V = ( V 1 , V 2 ) is an SR -open set in Z . We have to prove that φ 1 ( V ) = φ 1 1 ( V 1 ) , φ 2 1 ( V 2 ) is an SR -open set in Y . If φ 1 1 ( V 1 ) and φ 2 1 ( V 2 ) are empty, then the result is obvious.
Suppose μ φ 1 1 ( V 1 ) μ φ 2 1 ( V 2 ) , that is, φ 1 ( μ ) V 1 and φ 2 ( μ ) V 2 . By following the definition of continuity of φ 1 , there exists a neighborhood N 1 of μ such that φ 1 ( N 1 ) V 1 ; then, μ N 1 = φ 1 1 ( φ ( N 1 ) ) φ 1 1 ( V 1 ) , which implies φ 1 1 ( V 1 ) is SR -open. Similarly, φ 2 1 ( V 2 ) is also SR -open. Hence, φ 1 ( V ) is SR -open.
Conversely, let φ 1 ( V ) be SR -open in Y for every SR -open set V in Z . We have to prove that φ is a continuous function.
Consider μ Y as an arbitrary point, and φ 1 ( μ ) V 1 implies φ 2 ( μ ) V 2 (by hypothesis). Then, μ φ 1 1 ( V 1 ) and μ φ 2 1 ( V 2 ) , which means φ 1 ( φ 1 1 ( V 1 ) ) V 1 and φ 2 ( φ 2 1 ( V 2 ) ) V 2 implies that φ 1 and φ 2 are continuous at μ . Since we take μ as an arbitrary point, then φ 1 and φ 2 are continuous everywhere. Hence, φ is continuous. □
Corollary 1.
A function φ = ( φ 1 , φ 2 ) : Y Z is continuous if and only if for every SR -closed subset C in Z , φ 1 ( C ) is SR -closed in Y .
Proof. 
Consider φ = ( φ 1 , φ 2 ) : Y = ( P ( Y ) , P ( Y ) ) Z = ( P ( Z ) , P ( Z ) ) is a continuous function and C = ( C 1 , C 2 ) is an arbitrary SR -closed subset of Z . Then, P ( Z ) C 1 and P ( Z ) C 2 are SR -open in Y = ( P ( Y ) , P ( Y ) ) and φ 1 1 ( P ( Y ) C 1 ) = P ( Y ) φ 1 1 ( C 1 ) and φ 1 1 ( P ( Y ) C 2 ) = P ( Y ) φ 1 1 ( C 2 ) , which implies that φ 1 1 ( C 1 ) and φ 1 1 ( C 2 ) are closed in P ( Y ) and P ( Y ) , respectively. Hence, φ 1 ( C ) is SR -closed in Y .
Conversely, suppose that for any SR -closed subset C = ( C 1 , C 2 ) in Z , φ 1 ( C ) is SR -closed in Y . Let V = ( V 1 , V 2 ) be any SR -open subset of Z = ( P ( Z ) , P ( Z ) ) . Then, Z ( V ) = P ( Z ) ( V 1 ) , P ( Z ) ( V 2 ) is SR -closed and φ 1 ( Z V ) = φ 1 1 ( P ( Z ) V 1 ) , φ 2 1 ( P ( Z ) V 2 ) = φ 1 ( Z ) φ 1 ( V ) = Z φ 1 ( V ) is SR -closed in Y , which implies φ 1 ( V ) is SR -open in Y . Thus, φ is continuous. □
Remark 2.
1. Every restriction of a continuous mapping is also continuous.
Let ψ = ( ψ 1 , ψ 2 ) : Y = ( P ( Y ) , P ( Y ) ) Z = ( P ( Z ) , P ( Z ) ) be a continuous function and A = ( P ( A ) , P ( A ) ) be a SR -subset of Y . Then, the restriction ψ | A = ψ A : A Z of ψ to A is continuous. This is so because for each SR -open subset W in Z , ψ A 1 ( W ) = ψ 1 ( W ) A , which is SR -open in A .
2. Consider β SR = ( β , β ) as a base for a SR -topology on Z . Then, the function ψ : Y Z is continuous if and only if, for each SR -basic open set in Z , ψ 1 ( β ) is SR -open in Y .
3. A function ψ : Y Z is open if the image of every SR -open set in Y is SR -open.
4. A function ψ : Y Y is closed if the image of every SR -closed set in Y is SR -closed.
Definition 19.
Let ( Y , τ SR ) and ( Z , ρ SR ) be topological SR -sets. A function φ = ( φ 1 , φ 2 ) : Y Z is known as SR -homeomorphism if
(i) φ is SR -bijective.
(ii) φ is SR -continuous.
(iii) φ 1 is SR -continuous.
Two soft rough topological spaces (SRTS) are said to be SR -homeomorphic if there is a SR -homeomorphism between Y and Z .
Definition 20.
Consider Y = ( P ( Y ) , P ( Y ) ) and Z = ( P ( Z ) , P ( Z ) ) as two topological SR -sets with topologies τ SR = ( τ 1 , τ 2 ) and ρ SR = ( ρ 1 , ρ 2 ) , respectively, and Y × Z = ( P ( Y ) × P ( Z ) , P ( Y ) × P ( Z ) ) is the Cartesian product of Y and Z . The topology ξ 1 on P ( Y ) × P ( Y ) containing a gathering of open sets of the form L 1 × M 1 , where L 1 is a τ 1 SR -open and M 1 is a ρ 1 SR -open, as basis, is known as the product topology. Similarly, the topology ξ 2 on P ( Y ) × P ( Z ) is the topology containing a gathering of open sets of the form L 2 × M 2 , where L 2 is a τ 2 SR -open and M 2 is a ρ 2 SR -open, as basis, is known as the product topology. Hence, the topology ξ = ( ξ 1 , ξ 2 ) is called thte product topology on Y × Z .
Definition 21.
Consider Y = ( P ( Y ) , P ( Y ) ) and Z = ( P ( Z ) , P ( Z ) ) as two topological SR -sets with topologies τ SR = ( τ 1 , τ 2 ) and ρ SR = ( ρ 1 , ρ 2 ) , respectively. The mapping μ = P ( Y ) × P ( Z ) P ( Y ) and μ = P ( Y ) × P ( Z ) P ( Y ) , defined as μ ( μ , ν ) = μ , ( μ , ν ) P ( Y ) × P ( Z ) and μ ( μ , ν ) = μ , ( μ , ν ) P ( Y ) × P ( Z ) , respectively, are known as projection mappings. Then, μ = μ , μ is known as the projection mapping from Y × Z Y . Similarly, we can define the projection mapping ν = ν , ν from Y × Z Y .
Theorem 5.
Consider Y and Z as two topological SR -sets and Y × Z as the product space. Then, the projections μ and ν are continuous mappings.
Proof. 
Suppose Y = ( P ( Y ) , P ( Y ) ) and Z = ( P ( Z ) , P ( Z ) ) are two topological SR -sets with topologies τ SR = ( τ 1 , τ 2 ) and ρ SR = ( ρ 1 , ρ 2 ) , respectively. Let ξ be the product topology on Y × Y and L = ( P ( L ) , P ( L ) ) be an τ SR -open set. Then, μ 1 ( P ( L ) ) = P ( L ) × P ( Z ) , where P ( L ) τ 1 and P ( Z ) ρ 1 imply that P ( L ) × P ( Z ) belongs to the basis for τ 1 . Also, μ 1 ( P ( L ) ) = P ( L ) × P ( Z ) , where P ( L ) τ 2 and P ( Y ) ρ 2 imply P ( L ) × P ( Y ) belongs to the basis for τ 2 , which implies that P ( L ) × P ( Z ) , P ( L ) × P ( Z ) . Thus, α and α are continuous mappings. Therefore, α = μ , μ is a continuous mapping. Similarly, we can show that ν = ν , ν is also a continuous mapping. □

5. Compactness in SR -Set

In this section, we study the compactness of SR -topological spaces, discuss images of SR -compact spaces, and prove some basic results.
Definition 22.
Let Y = ( P ( Y ) , P ( Y ) ) be a SR -set. For any open covering V 1 = { V μ / i Ω } of P ( Y ) , if we get a finite subcovering V 1 F = { V μ / i = 1 , 2 , ߪ , m } , then P ( Y ) is said to be the compact lower approximation of Y . Similarly, for any open covering V 2 = { V j / j Ω } of P ( Y ) , if we get a finite subcovering V 2 F = { V j / j = 1 , 2 , ߪ , n } , then P ( Y ) is said to be the compact upper approximation of Y . Then, the SR -set Y = ( P ( Y ) , P ( Y ) ) is known as a compact SR -set.
Definition 23.
Suppose A = ( P ( A ) , P ( A ) ) is an SR subset of Y = ( P ( Y ) , P ( Y ) ) . If, for any open covering W = { W j / j Ω } of P ( A ) , we get a finite subcovering V F = { V j / j = 1 , 2 , ߪ , n } of P ( A ) , then P ( A ) as the subset of P ( Y ) is said to be compact. If, at the same time, P ( A ) is also compact, then we call A a compact SR -subset of Y .
Theorem 6.
The continuous image of a compact topological SR -set is compact.
Proof. 
Consider Y = ( P ( Y ) , P ( Y ) ) as a compact SR -set and suppose that ψ = ( ψ 1 , ψ 2 ) : ( P ( Y ) , P ( Y ) ) ( P ( Z ) , P ( Z ) ) is a continuous mapping. Then, ψ 1 : P ( Y ) P ( Z ) and ψ 2 : P ( Y ) P ( Z ) individually are continuous mappings. Let C 1 = { W ν / ν Ω } be an open covering of P ( Z ) . Then, ψ 1 1 ( C 1 ) = { ψ 1 1 ( W ν ) / ν Ω } is an open covering for P ( Y ) . Since P ( Y ) is compact, then, by definition of compactness, it has a finite subcovering, and there are indices ν 1 ν 2 , . . . , ν m such that P ( Y ) = i = 1 m ψ 1 1 ( C 1 ) . ψ 1 ( P ( Y ) ) i = 1 m ( C 1 ) ψ 1 ( P ( Y ) ) . Therefore, { W ν μ / i = 1 , 2 , 3 , . . . , m } is a finite subcovering of ψ ( P ( Y ) ) = P ( Z ) . So, P ( Z ) is also compact. Similarly, we can show that P ( Z ) is compact and, hence, Z = ( P ( Z ) , P ( Z ) ) is a compact SR -set. □
Corollary 2.
The homeomorphic image of a compact SR -space is compact.
Remark 3.
In topological SR -sets, compactness is a topological property.
Definition 24.
Consider an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) . Let Γ = { A μ = ( P ( A μ ) , P ( A μ ) ) : μ Λ } be a collection of SR -subsets of Y . If every finite subcollection of Γ has a non-empty intersection, which means that if we consider any finite subset Λ 1 of Λ, we get ν Λ 1 A ν , then the finite intersection property holds in collection Γ.
Theorem 7.
Consider an SRTS ( Y , τ SR ) , where Y = ( P ( Y ) , P ( Y ) ) and τ SR = ( τ SR , τ SR ) ; Y is SR -compact iff every collection of SR -closed subsets in Y following the finite intersection property itself has non-empty intersections.
Proof. 
First, we suppose Y is SR -compact and Γ = { D μ = ( P ( D μ ) , P ( D μ ) ) : μ Λ } is an arbitrary collection of SR -closed sets satisfying the finite intersection property. We have to prove that the collection { D μ = ( P ( D μ ) , P ( D μ ) ) : μ Λ } itself has non-empty intersection. Suppose, on the contrary, that μ Λ D μ = . By taking the complement ( μ Λ D μ ) = , we have Y = μ Λ D μ , which implies { D μ = ( P ( D μ ) , P ( D μ ) ) : μ Λ } is an open cover for Y = ( P ( Y ) , P ( Y ) ) . By our assumption, Y = ( P ( Y ) , P ( Y ) ) is SR -compact, and there are indices μ 1 , μ 2 , μ 3 , , μ k such that P ( Y ) = ι = 1 k P ( D μ ι ) and P ( Y ) = ι = 1 k P ( D μ ι ) . Again, by taking the complement, we get ι = 1 k P ( D μ ι ) = and ι = 1 k P ( D μ ι ) = , that is, ι = 1 k D μ ι = ι = 1 k P ( D μ ι ) , ι = 1 k P ( D μ ι ) = , which contradicts the finite intersection property. So, our assumption is wrong and μ Λ D μ .
Conversely, suppose that every collection of SR -closed sets satisfying the finite intersection property has a non-empty intersection itself. We now have to prove that Y = ( P ( Y ) , P ( Y ) ) is SR -compact. For this, let us consider { V ε = ( P ( V ε ) , P ( V ε ) ) : ε Υ } as an open cover of Y , i.e., Y = P ( Y ) , P ( Y ) = ε Υ P ( V ε ) , ε Υ P ( V ε ) . To prove that Y is SR -compact, we have to show that this open cover has a finite subcover. On the contrary, suppose that there does not exist any finite subcover for this open cover. Then, for any finite subcover Υ 1 of Υ , ϵ Υ 1 V ϵ Y , i.e., ϵ Υ 1 P ( V ϵ ) , ϵ Υ 1 P ( V ϵ ) P ( Y ) , P ( Y ) . This implies ϵ Υ 1 V ϵ . Now, { V ε = ( P ( V ε ) , P ( V ε ) ) : ε Υ } is a collection of SR -closed sets satisfying the finite intersection property, so ε Υ 1 V ε i.e., ε Υ P ( V ε ) , ε Υ P ( V ε ) . By taking the complement, we get ε Υ P ( V ε ) , ε Υ P ( V ε ) P ( Y ) , P ( Y ) , which contradicts our supposition that { V ε = ( P ( V ε ) , P ( V ε ) ) : ε Υ } is an open cover of Y . Hence, { V ε = ( P ( V ε ) , P ( V ε ) ) : ε Υ } has a finite subcover, so Y is SR -compact. □
Theorem 8.
Every SR -closed subset of SR -compact space is SR -compact.
Proof. 
Let Y be an SR -compact space and D = ( P ( D ) , P ( D ) ) be a SR -closed subset of Y . Let { V ε = ( P ( V ε ) , P ( V ε ) ) : ε Υ } be an open cover for D = ( P ( D ) , P ( D ) ) ; there exist an SR -open set W ε = ( P ( W ε ) , P ( W ε ) ) in Y = ( P ( Y ) , P ( Y ) ) such that V ε = W ε D , ε Υ , i.e., P ( V ε ) = P ( W ε ) P ( D ) and P ( V ε ) = P ( W ε ) P ( D ) . The collection { D , W ε : ε Υ } is an open cover for Y . Since Y is compact, there exists a finite subcover { D , W ε : ε Υ } of Y , that is, Y = D ι = 1 k W ε ι , which implies P ( Y ) = P ( D ) ι = 1 k P ( W ε ι ) and P ( Y ) = P ( D ) ι = 1 k P ( W ε ι ) . D = Y D = P ( D ) ι = 1 k P ( W ε ι , P ( D ) ι = 1 k P ( W ε ι = ι = 1 k P ( V ε ι ) , ι = 1 k P ( V ε ι ) , which indicates D = ( P ( D ) , P ( D ) ) is SR -compact. □

6. Application of SR -Set in Multi-Attribute Group Decision Making

Decision-making performs a vital role in our daily life, and this process yields the best alternative among different choices. In this section, we present an application of an SR -set in multi-attribute group decision making (MAGDM) for cosmetic brand selection. First, we present Algorithm 1 and its flowchart for multi-attribute group decision making.
Algorithm 1 The scheme of the algorithm is given as.
Step-1: Write the soft set G = ( T , A ) which describes the given data.
Step-2: Based on initial assessment results of the group of analysts S , define a soft set.
Step-3: Obtain an SR -approximations in the form of soft sets Λ = ( λ , S ) and Λ = ( λ , S ) .
Step-4: Define fuzzy sets ν Λ , ν Λ and ν Λ corresponding to the soft sets Λ = ( λ , S ) , Λ = ( λ , S ) and Λ = ( λ , S ) defined by the formulas:
ν Λ ( α k ) = 1 m ι = 1 m C λ D ι ( α k ) ,
ν Λ ( α k ) = 1 m ι = 1 m C λ D ι ( α k ) ,
ν Λ ( α k ) = 1 m ι = 1 m C λ D ι ( α k ) .
Step-6: Find the final decision set by adding Λ , Λ , and Λ , calculated as
Λ + Λ + Λ = ν Λ ( α k ) + ν Λ ( α k ) + ν Λ ( α k ) ( ν Λ ( α k ) * ν Λ ( α k ) * ν Λ ( α k ) )
Step-7: Finally, the alternative having the maximum decision value can be chosen as the optimal solution.
Now we present flow chart Algorithm 1 as given by Figure 1 and its flowchart for multi-attribute group decision making.
Example 7.
The trade of quality cosmetics is growing rapidly among the lower-middle class of developing countries like Pakistan and India. Assume that a popular departmental store of the city wants to make a contract with a multinational company for the production of cosmetics. The managing committee of the store consist of three managers, S = { M 1 , M 2 , M 3 } : the product manager, marketing manager, and accounts manager. The team of these three managers is elected to choose one brand which covers the major production of cosmetics. They consider seven brands: V = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 } , where
1 : Loreal,
2 : Maybelline,
3 : Remmil,
4 : Art Deco,
5 : Essence,
6 : Color Studio,
7 : Mac,
8 : Sephora.
They define a set of criteria for the selection of a suitable brand for their store as follows, E = { ρ 1 , ρ 2 , ρ 3 , ρ 4 , ρ 5 , ρ 6 , ρ 7 , ρ 8 } , where
ρ 1 : Product quality
ρ 2 : Relationship closeness (customer–brand relationship)
ρ 3 : Delivery performance
ρ 4 : Price stability
ρ 5 : Plans for major events
ρ 6 : Distribution plans (in-store furniture)
ρ 7 : Recovery services in case of damages
ρ 8 : Shopper marketing activities.
We construct a soft set G = ( T , A ) which explains the qualities of the brands under consideration. The tabular form of the soft set is given in Table 2.
Let X i be the initial assessment result of the manager team. We represent this evaluation by means of a soft set Λ = ( λ , S ) whose tabular representation is given by Table 3.
From this soft set Λ = ( λ , S ) , the primary evaluation result of experts is
X 1 = λ ( D 1 ) = { 1 , 2 , 6 , 7 } , X 2 = λ ( D 2 ) = { 3 , 4 , 7 , 8 } , X 3 = λ ( D 3 ) = { 1 , 2 , 5 , 6 }
Now, we find the SR -approximations as
λ ( D 1 ) = P ( X 1 ) = { 1 } , λ ( D 2 ) = P ( X 2 ) = { 3 , 7 , 8 } , λ ( D 3 ) = P ( X 3 ) = { 2 , 5 } ,
and
λ ( D 1 ) = P ( X 1 ) = V , λ ( D 2 ) = P ( X 2 ) = V , λ ( D 3 ) = P ( X 3 ) = V .
Following these SR -approximations, we get two soft sets, Λ = ( λ , S ) and Λ = ( λ , S ) , where λ ( D i ) = P ( Xi) and λ ( D i ) = P ( Xi). Tabular representation of these soft sets are given in Table 4 and Table 5.
Now, we define a fuzzy set ν Λ ( k ) , ν Λ ( k ) , and ν Λ ( k ) as follows:
ν Λ ( k ) = 1 3 i = 1 3 C λ D i ( k ) ,
ν Λ ( k ) = 1 3 i = 1 3 C λ D i ( k ) ,
ν Λ ( k ) = 1 3 i = 1 3 C λ D i ( k ) .
Thus, we have
ν Λ ( k ) = { ( 1 , 0 ) , ( 2 , 2 / 3 ) , ( 3 , 1 / 3 ) , ( 4 , 0 ) , ( 5 , 1 / 3 ) , ( 6 , 0 ) , ( 7 , 1 / 3 ) , ( 8 , 1 / 3 ) } , ν Λ ( k ) = { ( 1 , 2 / 3 ) , ( 2 , 2 / 3 ) , ( 3 , 1 / 3 ) , ( 4 , 1 / 3 ) , ( 5 , 1 / 3 ) , ( 6 , 2 / 3 ) , ( 7 , 2 / 3 ) , ( 8 , 1 / 3 ) } , ν Λ ( k ) = { ( 1 , 0 ) , ( 2 , 2 / 3 ) , ( 3 , 1 / 3 ) , ( 4 , 0 ) , ( 5 , 1 / 3 ) , ( 6 , 0 ) , ( 7 , 1 / 3 ) , ( 8 , 1 / 3 ) } ,
Now, we find the decision set by adding Λ , Λ, and Λ . Then, we have
ν Λ + Λ + Λ ( k ) = ν Λ ( k ) + ν Λ ( k ) + ν Λ ( k ) [ ν Λ ( k ) * ν Λ ( k ) * ν Λ ( k ) ] .
Since 2 is the brand having the maximum decision value in Table 6, then 2 is selected by the the manager team as the major production brand for cosmetics in the departmental store.
In the proposed algorithm, we observe that the use of SR -methodology filters the primary assessment results and permits the experts to choose the optimal alternative in a suitable manner. Particularly, the SR -upper approximation can be used to add optimal objects possibly neglected by the selectors in the primary assessment, while the SR -lower approximation can be used to remove the objects that are irregularly selected as optimal. Hence, SR reduces the error, to some extent, that is caused by the subjective nature of experts during group decision making.
Now we present bar chart as given by Figure 2 of the decision values.

7. Applications of the SR -Topological Spaces in Image Processing

We know that a geometrical figure can be obtained by its part information and its topological structure properties. Similarly, according to the SR -topological properties of the SR -space, we can also restore the SR -topological diagram for some incomplete diagram.
Example 8.
One of the best examples of an incomplete image is that of fingerprints. Figure 3 shows a portion of fingerprint information from a person; however, the fingerprint information is incomplete. We can obtain the real fingerprint image on the basis of this Figure 3 by using SR -approximations and SR -topological properties.
The development of these theories can form the theoretical basis for further applications of the SR -set and SR -topology in many science and engineering areas, such as image processing, protein structure prediction, target recognition, and gene structure prediction.

8. Conclusions

We established the topological structure on the SR -set in a new way. We define various topological terms, define SR -continuity, product topology in SR -set, and compactness in SR -sets by taking an SR -set as a pair of sets corresponding to the lower and upper approximations. Furthermore, we present an algorithm to cope with uncertainties in multi-attribute group decision-making problems by utilizing SR -sets. The effectiveness of the algorithm was verified by a case study for cosmetic brand selection. However, under topological transformation, some properties of the SR -set and topological theory, like connectedness and separation axioms on the SR -set, need to be further studied. If we combine the SR -set with other soft computing methods, such as bipolar fuzzy, neutrosophic set, and other hybrid structures, and use them in image processing, expert systems, and cognitive maps, a high machine IQ and hybrid intelligent system can be designed, which will be a productive attempt.

Author Contributions

The authors contributed to each part of this paper equally. The authors read and approved the final manuscript.

Acknowledgments

The authors are highly thankful to the editor and referees for the valuable comments and suggestions for improving the quality of the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L.A. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  2. Pawlak, Z. Rough sets. Int. J. Inf. Comput. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  3. Pawlak, Z.; Skowron, A. Rough sets: Some extensions. Inf. Sci. 2007, 177, 28–40. [Google Scholar] [CrossRef] [Green Version]
  4. Maji, P.K.; Roy, A.R.; Biswas, R. An application of soft sets in a decision making problem. Comp. Math. Appl. 2002, 44, 1077–1083. [Google Scholar] [CrossRef] [Green Version]
  5. Maji, P.K.; Roy, A.R.; Biswas, R. Soft set theory. Comp. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Green Version]
  6. Molodtsov, D. Soft set theoty-first results. Comp. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  7. Akram, M.; Ali, G.; Alshehri, N.O. A New Multi-Attribute Decision-Making Method Based on m-Polar Fuzzy Soft Rough Sets. Symmetry 2017, 9, 271. [Google Scholar] [CrossRef]
  8. Akram, M.; Malik, H.M.; Shahzadi, S.; Smarandache, F. Neutrosophic Soft Rough Graphs with Application. Axioms 2018, 7, 14. [Google Scholar] [CrossRef]
  9. Akram, M.; Gulzar, H.; Smarandache, F.; Broumi, S. Certain Notions of Neutrosophic Topological K-Algebras. Mathematics 2018, 6, 234. [Google Scholar] [CrossRef]
  10. Al-Quran, A.; Hassan, N. The Complex Neutrosophic Soft Expert Relation and Its Multiple Attribute Decision-Making Method. Entropy 2018, 20, 101. [Google Scholar] [CrossRef]
  11. Ali, M.I. A note on soft sets, rough soft sets and fuzzy soft sets. Appl. Soft Comput. 2011, 11, 3329–3332. [Google Scholar]
  12. Shabir, M.; Naz, M. On soft topological spaces. Comp. Math. Appl. 2011, 61, 1786–1799. [Google Scholar] [CrossRef] [Green Version]
  13. Çağman, N.; Karataş, S.; Enginoglu, S. Soft topology. Comp. Math. Appl. 2011, 62, 351–358. [Google Scholar] [CrossRef] [Green Version]
  14. Chen, D. The parametrization reduction of soft sets and its applications. Comp. Math. Appl. 2005, 49, 757–763. [Google Scholar] [CrossRef]
  15. Aktas, H.; Çağman, N. Soft sets and soft group. Inf. Sci. 2007, 1, 2726–2735. [Google Scholar] [CrossRef]
  16. Riaz, M.; Naeem, K.; Ahmad, M.O. Novel Concepts of Soft Sets with Applications. Ann. Fuzzy Math. Inf. 2017, 13, 239–251. [Google Scholar]
  17. Riaz, M.; Naeem, K. Measurable Soft Mappings. Punjab Univ. J. Math. 2016, 48, 19–34. [Google Scholar]
  18. Riaz, M.; Fatima, Z. Certain properties of soft metric spaces. J. Fuzzy Math. 2017, 25, 543–560. [Google Scholar]
  19. Riaz, M.; Hashmi, M.R. Certain applications of fuzzy parameterized fuzzy soft sets in decision-making problems. Int. J. Algebra Stat. 2016, 5, 135–146. [Google Scholar] [CrossRef]
  20. Riaz, M.; Hashmi, M.R. Fuzzy parameterized fuzzy soft topology with applications. Ann. Fuzzy Math. Inf. 2017, 13, 593–613. [Google Scholar]
  21. Riaz, M.; Hashmi, M.R. Fuzzy Parameterized Fuzzy Soft Compact Spaces with Decision-Making. Punjab Univ. J. Math. 2018, 50, 131–145. [Google Scholar]
  22. Riaz, M.; Hashmi, M.R. Fixed points of fuzzy neutrosophic soft mapping with decision-making. Punjab Univ. J. Math. 2018, 7, 1–10. [Google Scholar] [CrossRef]
  23. Riaz, M.; Hashmi, M.R.; Farooq, A. Fuzzy Parameterized Fuzzy Soft Metric spaces. J. Math. Anal. 2018, 9, 25–36. [Google Scholar]
  24. Shang, Y. Robustness of scale-free networks under attacks with tunable grey information. EPL 2011, 95, 9528005. [Google Scholar] [CrossRef]
  25. Shang, Y. Subgraph Robustness of Complex Networks Under Attacks. IEEE Trans. Syst. Man Cybern. Syst. 2017, 1–12. [Google Scholar] [CrossRef]
  26. Thivagar, M.L.; Richard, C.; Paul, N.R. Mathematical Innovations of a Modern Topology in Medical Events. Int. J. Inf. Sci. 2012, 2, 33–36. [Google Scholar]
  27. Feng, F.; Li, C.; Davvaz, B.; Ali, M.I. Soft sets combined with fuzzy sets and rough sets: A tentative approach. Soft Comp. 2010, 14, 899–911. [Google Scholar] [CrossRef]
  28. Feng, F.; Liu, X.; Fotea, V.L.; Jun, Y.B. Soft sets and Soft rough sets. Inf. Sci. 2011, 181, 1125–1137. [Google Scholar] [CrossRef]
  29. Ma, X.; Liu, Q.; Zhan, J. A survey of decision making methods based on certain hybrid soft set models. Artif. Intell. Rev. 2017, 47, 507–530. [Google Scholar] [CrossRef]
  30. Zou, X. Data analysis approaches of soft sets under incomplete information. Knowl. Based Syst. 2008, 21, 941–945. [Google Scholar] [CrossRef]
  31. Bakier, M.Y.; Allam, A.A.; Abd-Allah, S.H.S. Soft rough topology. Ann. Fuzzy Math. Inf. 2016, 11, 4–11. [Google Scholar]
  32. Malik, M.A.; Riaz, M. G-subsets and G-orbits of under action of the Modular Group. Punjab Univ. J. Math. 2011, 43, 75–84. [Google Scholar]
  33. Malik, M.A.; Riaz, M. Orbits of under the action of the Modular Group PSL(2,Z). UPB Sci. Bull. Ser. A Appl. Math. Phys. 2012, 74, 109–116. [Google Scholar]
  34. Kaur, G.; Garg, H. Multi-Attribute Decision-Making Based on Bonferroni Mean Operators under Cubic Intuitionistic Fuzzy Set Environment. Entropy 2018, 20, 65. [Google Scholar] [CrossRef]
  35. Liu, P.; Mahmood, T.; Khan, Q. Multi-Attribute Decision-Making Based on Prioritized Aggregation Operator under Hesitant Intuitionistic Fuzzy Linguistic Environment. Symmetry 2017, 9, 270. [Google Scholar] [CrossRef]
  36. Mathew, B.P.; Jacob, S. On rough topological spaces. Int. J. Math. ARC 2012, 3, 3413–3421. [Google Scholar] [CrossRef]
  37. Roy, R.; Maji, P.K. A fuzzy soft set theoretic approach to decision making problems. J. Comp. Appl. Math. 2007, 203, 412–418. [Google Scholar] [CrossRef] [Green Version]
  38. Salama, A.S. Some Topological Properies of Rough Sets with Tools for Data Mining. Int. J. Comp. Sci. 2011, 8, 588–595. [Google Scholar]
  39. Smarandache, F. Neutrosophy Neutrosophic Probability, Set and Logic; American Research Press: Rehoboth, DE, USA, 1998. [Google Scholar]
  40. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multisp. Multistruct. 2010, 4, 410–413. [Google Scholar]
Figure 1. Graphical representation of Algorithm 1.
Figure 1. Graphical representation of Algorithm 1.
Mathematics 07 00067 g001
Figure 2. Graphical representation of Decision Values.
Figure 2. Graphical representation of Decision Values.
Mathematics 07 00067 g002
Figure 3. (a) Incomplete information of a fingerprint. (b) Renewed fingerprint.
Figure 3. (a) Incomplete information of a fingerprint. (b) Renewed fingerprint.
Mathematics 07 00067 g003
Table 1. Soft set ( T , A ) .
Table 1. Soft set ( T , A ) .
( T , A ) s 1 s 2 s 3 s 4 s 5
ζ 1 01100
ζ 2 01011
ζ 3 11001
ζ 4 00101
Table 2. Soft set ( T , A ) .
Table 2. Soft set ( T , A ) .
( T , A ) ρ 1 ρ 2 ρ 3 ρ 4 ρ 5 ρ 6 ρ 7 ρ 8
1 10110100
2 10111101
3 01010010
4 01010000
5 10100101
6 01110000
7 10110110
8 01010010
Table 3. Soft set ( λ , S ) .
Table 3. Soft set ( λ , S ) .
D 1 D 2 D 3
1 101
2 101
3 010
4 010
5 001
6 101
7 101
8 010
Table 4. Soft set Λ .
Table 4. Soft set Λ .
D 1 D 2 D 3
1 000
2 101
3 010
4 000
5 001
6 000
7 010
8 010
Table 5. Soft set Λ .
Table 5. Soft set Λ .
D 1 D 2 D 3
1 111
2 111
3 111
4 111
5 111
6 111
7 111
8 111
Table 6. Decision value table.
Table 6. Decision value table.
Decision Value
1 1.000
2 1.889
3 1.556
4 1.000
5 1.556
6 1.778
7 1.778
8 1.556

Share and Cite

MDPI and ACS Style

Riaz, M.; Smarandache, F.; Firdous, A.; Fakhar, A. On Soft Rough Topology with Multi-Attribute Group Decision Making. Mathematics 2019, 7, 67. https://doi.org/10.3390/math7010067

AMA Style

Riaz M, Smarandache F, Firdous A, Fakhar A. On Soft Rough Topology with Multi-Attribute Group Decision Making. Mathematics. 2019; 7(1):67. https://doi.org/10.3390/math7010067

Chicago/Turabian Style

Riaz, Muhammad, Florentin Smarandache, Atiqa Firdous, and Atiqa Fakhar. 2019. "On Soft Rough Topology with Multi-Attribute Group Decision Making" Mathematics 7, no. 1: 67. https://doi.org/10.3390/math7010067

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