**1. Introduction**

In our real world, many problems naturally involve uncertainty. This uncertainty can be observed in several fields, such as environmental science, medical science, economics and engineering. Researchers are active and interested to address uncertainty. In this respect, many theories have been presented, such as the probability theory, fuzzy set (FS) theory, rough set (RS) theory, intuitionistic fuzzy set (IFS) theory and soft set (SS) theory etc.

Fuzzy set (FS) proposed by Zadeh in [1] is a framework to address partial truth, uncertainty and impreciseness. Zadeh's FS is a very crucial, innovative and ingenious set because of its importance in multiple research dimensions. Often, we are encountered by ill-defined situations which are addressed through quantitative expressions. To evaluate better results from these critical situations, the FS is much useful by using qualitative expressions due to its degree of membership. The FS represents degree of membership for each element of the universe of a discourse to a subset of it, and later on, Attanassov presented intuitionistic fuzzy set (IFS) [2] which avails the opportunity to model the problem precisely based on the observations and treat more accurately to uncertainty quantification. Attanassov discussed the literature based on theory and fundamentals of IFSs in [3]. An IFS is a very useful concept with its applications in many different fields, such as electoral system, market prediction, machine learning, pattern recognition, career determination and medical diagnosis [4]. The description in terms of membership degree only in many cases is insufficient because the presence of non-membership degree is helpful to deal with uncertainty in good manner.

**Citation:** Anwar, M.Z.; Bashir, S.; Shabir, M.; Alharbi, M.G. Multigranulation Roughness of Intuitionistic Fuzzy Sets by Soft Relations and Their Applications in Decision Making. *Mathematics* **2021**, *9*,2587. https://doi.org/10.3390/ math9202587

Academic Editor: Sorin Nadaban

Received: 14 September 2021 Accepted: 8 October 2021 Published: 15 October 2021

**Publisher's Note:** MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

**Copyright:** © 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https:// creativecommons.org/licenses/by/ 4.0/).

Molodtsov [5] presented an untraditional approach known as soft set (SS) theory for handling the vagueness and uncertainty. A collection of approximate descriptions of an element in terms of parameters by a set-valued map is known as a soft set. This theory has become a successful approach to different problems in different fields due to its rich operations. In decision-making problems, this is an applicable tool using the RSs [6]. Many researchers hybridized the models of SSs with different applicable theories [7–9]. Maji et al. defined Fuzzy SS (FSS) and Intuitionistic fuzzy soft set (IFSS) [10,11]. After that, several extensions of SSs have been presented, such as the vague SS [12], the soft RS (SRS) [13,14], the generalized FSS [15], the trapezoidal FSS [16], interval-valued FSS [17]. Agarwal built a framework of the generalized IFSS [18]. Feng et al. [19] pointed out some errors in generalized IFSS [18] and rebuilt the generalized IFSS. Many authors combined the concepts of IFSs and fuzzy RSs (FRSs). Samanta and Mondal [20] presented the IF rough set (IFRS) model. In [21], the combination of RS and FS has been studied. To overcome the unnaturalness of FRSs, Sang et al. [22] proposed a newly defined IFRS model.

Pawlak presented rough sets (RSs) to deal with incomplete data, vagueness and uncertainty [6,23]. To solve different problems based on incomplete data, many researchers showed interest in RSs. The RS theory is an untraditional technique to discuss data investigation, representation of vague or inexact data and reasoning based reduction of vague data [24]. Recently, researchers have investigated RSs in the light of dataset features, varieties of remedy and procedure control. Many extensions of RSs have been presented for many requirements, such as the RS model based on reflexive relations, equivalence relations and tolerance relations, FRS model, SRS model and rough FS (RFS) model [25–27]. As it is commonly known, many problems have different universes of discourse [28], such as the objections of customers and their solutions in enterprise management, the characteristics of customers and the features of products in personalized marketing, the mechanical defects and their solutions in machine diagnosis, the symptoms of diseases and drugs in diseased diagnosis. To formalize these problems, the RS models have been generalized over two universes [29–31]. Pie et al. [32] built a framework of the RS model on algebraic characteristics over two universes. According to the inter-relationship between two universes, Liu et al. [33] connected the graded RS with appropriate parameters. Ma and Sun [34] proposed a framework of probability RS to deal with impreciseness [19,35].

Granular computing is very useful to describe the objectives of a problem solving through multiple binary relations [36]. Under a single granulation, a set is characterized by lower and upper approximations in the light of granular computing. By using multiple equivalence relations, multigranulation rough set (MGRS) approximations have been investigated. Rauszer [37] presented a framework of a multi-agent system based on an equivalence relation where each agen<sup>t</sup> has its own knowledge base. Khan and Banerjee [38,39] considered the agen<sup>t</sup> as a "source" in a more general setting but many other scholars considered "agent" as granulation [40–42]. Khan et al. [38,39] presented two approximation operators in terms of multiple source approximation system [35]. In the same sense, Qian et al. [43] presented the MGRS theory. There are two types of MGRS, named optimistic MGRS (OMGRS) and pessimistic MGRS (PMGRS) [41]. Later, many extensions of MGRS have been presented by different authors [44,45]. The real dataset involving multiple and overlapping knowledge has been dealt with by presenting MGRS and covering RSs. These two special models have been generalized as many hybrid models such as covering MGRS [43] and MGRS based on multiple equivalence relations [41] etc. Liu et al. [46] used a covering approximation space and presented four types of covering MGRS models. Later on, Xu et al. presented a covering MGRS based on order relations [47], fuzzy compatible relations [48] and generalized relations [49] by relaxing the conditions of equivalence relations. After that, many researchers proposed different MGRS models according to different dataset needs. Dou et al. [50] presented a useful MGRS model for variable-precision and discussed its properties. Ju et al. [51] proposed a heuristic algorithm using their newly defined variable-precision MGRS model for computing reduction. Feng et al. [52] presented a three-way decision-based type-1 variable-precision multigranulation decision-theoretic

fuzzy rough set [53]. In managemen<sup>t</sup> science and various professional fields, the MGRS showed its importance and extensions of MGRS have made their role with respect to the nature of problems [54–58]. Qian et al. discussed the risk attitudes by presenting OMGRS and PMGRS models using multiple binary relations. Huang et al. [59] combined MGRS and IFS and presented an IFMGRS model. Pang et al. [60] combined MGRS with three-way decision making and proposed a multi-criteria decision-making (MCGDM) model. Different experts have different experiences and expertises to solve different decision-making problems. Better decisions can be made by taking opinions of multiple experts compared with taking one expert's opinion only. In view of this logic, Zadeh [36] introduced granular computing knowledge through multiple relations. Sun and Ma [61] proposed the MGRS model over two universes. For selective dataset approximation, Tan et al. [35] presented the MGRS model with granularity selection algorithm [56]. Xu et al. [62] combined Pawlak RS model, FRS model and MGRS model in terms of granular computing and proposed multigranulation fuzzy rough set (MGFRS) model. Recently, Shabir et al. [63] proposed a useful model of MGRS with multi-soft binary relations. After that, Shabir et al. [64] extended that optimistic MGRS in terms of FS which is called optimistic multigranulation fuzzy rough set (OMGFRS). The existing MGRS models have obvious disadvantages regarding FSs.


To manage these above critical situations, we extended the model of MGFRS based on soft binary relations in [64] in terms of IFS. We used IFSs instead of FSs to present an optimistic multigranulation intuitionistic fuzzy rough set (OMGIFRS) model.

The organization of the remaining paper is as follows. In Section 2, some basic definitions and fundamental concepts of FS, IFS, RS, SS, FRS, IFSS, MGRS, and soft relation are given. Section 3 presents the optimistic granulation roughness of an IFS based on two soft relations over two universes with their basic properties and examples. OMGIFRS over two universes and their properties are discussed in Section 4. Section 5 presents the decision making algorithm with a practical example about decision making problems. In Section 6, we made a comparison of our proposed model with other existing theories. Finally, we conclude our research work in Section 7.

#### **2. Preliminaries and Basic Concepts**

In this section, some fundamental notions about IFS, RS, MGRS, SS, soft binary relation, and IFSS are given. Throughout this paper, *U*1 and *U*2 represent two non-empty finite sets unless stated otherwise.

**Definition 1** ([2])**.** *Let U be a non-empty universe. An IFS B in the universe U is an object having the form B* = {*<sup>x</sup>*, *μB*(*x*), *<sup>γ</sup>B*(*x*) : *x* ∈ *<sup>U</sup>*}*, where μB* : *U* → [0, 1] *and γB* : *U* → [0, 1] *satisfying* 0 ≤ *μB*(*x*) + *<sup>γ</sup>B*(*x*) ≤ 1 *for all x* ∈ *U. The values μB*(*x*) *and <sup>γ</sup>B*(*x*) *are called degree of membership and degree of non-membership of x* ∈ *U to B, respectively. The number <sup>π</sup>B*(*x*) = 1 − *μB*(*x*) − *<sup>γ</sup>B*(*x*) *is called the degree of hesitancy of x* ∈ *U to B. The collection of all IFSs in U is denoted by IF*(*U*)*. In the remaining paper, we shall write an IFS by B* = *μ<sup>B</sup>*, *<sup>γ</sup>B instead of B* = {*<sup>x</sup>*, *μB*(*x*), *<sup>γ</sup>B*(*x*) : *x* ∈ *<sup>U</sup>*}*. Let B* = *μ<sup>B</sup>*, *<sup>γ</sup>B and B*1 = 1 *μ<sup>B</sup>*1 , *γB*1 2 *be two IFSs in U. Then, B* ⊆ *B*1 *if and only if μB*(*x*) ≤ *μ<sup>B</sup>*1 (*x*) *and γB*1 (*x*) ≤ *<sup>γ</sup>B*(*x*) *for all x* ∈ *U. Two IFSs B and B*1 *are said to be equal if and only if B* ⊆ *B*1 *and B*1 ⊆ *B.*

**Definition 2** ([2])**.** *The union and intersection of two IFSs B and B*1 *in U are denoted and defined by B* ∪ *B*1 = 1 *μB* ∪ *μ<sup>B</sup>*1 , *γB* ∩ *γB*1 2 *and B* ∩ *B*1 = 1 *μB* ∩ *μ<sup>B</sup>*1 , *γB* ∪ *γB*1 2 *where μB* ∪ *μ<sup>B</sup>*1 (*x*) = sup{*μB*(*x*), *μ<sup>B</sup>*1 (*x*)}*, γB* ∩ *γB*1 (*x*) = inf{*<sup>γ</sup>B*(*x*), *γB*1 (*x*)}, *μB* ∩ *μ<sup>B</sup>*1 (*x*) = inf{*μB*(*x*), *μ<sup>B</sup>*1 (*x*)}*, γB* ∪ *γB*1 (*x*) = sup{*<sup>γ</sup>B*(*x*), *γB*1 (*x*)}*, for all x* ∈ *U.*

Next, we define two special types of IFSs as:

The IF universe set *U* = 1*U* =< 1, 0 > and IF empty set Φ = 0*U* =< 0, 1 >, where <sup>1</sup>(*x*) = 1 and <sup>0</sup>(*x*) = 0 for all *x* ∈ *U*. The complement of an IFS *B* =< *μ*, *γ* > is denoted and defined as *Bc* =< *γ*, *μ* >. See Table 1 for acronyms.

**Table 1.** List of acronyms.


For a fixed *x* ∈ *U*, the pair (*μB*(*x*), *<sup>γ</sup>B*(*x*)) is called intuitionistic fuzzy value (IFV) or intuitionistic fuzzy number (IFN). In order to define the order between two IFNs, Chen and Tan [65] introduced the score function as *<sup>S</sup>*(*x*) = *μB*(*x*) − *<sup>γ</sup>B*(*x*) and Hong and Choi [66] defined the accuracy function as *<sup>H</sup>*(*x*) = *μB*(*x*) + *<sup>γ</sup>B*(*x*), where *x* ∈ *U*. Xu [62,67] used both the score and accuracy functions to form the order relation between any pair of IFVs (*<sup>x</sup>*, *y*) as given below:

	- (1) if *<sup>H</sup>*(*x*) = *<sup>H</sup>*(*y*), then *x* = *y*;

(2) if *<sup>H</sup>*(*x*) < *<sup>H</sup>*(*y*), then *x* < *y*.

**Definition 3** ([6])**.** *Let σ be an equivalence relation on a universe U*. *For any M* ⊆ *U*, *the Pawlak lower and upper approximations of M with respect to σ are defined by*

$$\begin{array}{rcl} \underline{\sigma}(M) &=& \{\underline{\mu} \in \mathcal{U} : [\underline{\mu}]\_{\sigma} \subseteq M\}\_{\prime} \\ \overline{\sigma}(M) &=& \{\underline{\mu} \in \mathcal{U} : [\underline{\mu}]\_{\sigma} \cap M \neq \bigotimes\}\_{\prime} \end{array}$$

*where* [*u*]*σ is the equivalence class of u with respect to σ. The set BMσ* = *σ*(*M*) − *σ*(*M*) *is the boundary region of M* ⊆ *U*. *If BMσ*(*M*) = ∅*, then M is defineable (exact), otherwise, M is rough with respect to σ*.

Qian et al. [40] extended the Pawlak rough set model to the MGRS model, where the set approximations are defined by using multi-equivalence relations on a universe.

**Definition 4** ([40])**.** *Let σ*1, *σ*2, *σ*3, ... , *σn be n equivalence relations on a universe U*. *For any M* ⊆ *U*, *the Pawlak lower and upper approximations of M are defined by*

$$\begin{aligned} \underline{\mathbf{M}}\_{\Sigma\_{i=1}^{n}\sigma\_{i}}^{\boldsymbol{\sigma}} &= \{ \boldsymbol{u} \in \boldsymbol{\mathcal{U}} : [\boldsymbol{u}]\_{\sigma\_{i}} \subseteq \boldsymbol{\mathcal{M}} \text{ for some } i, \ 1 \le i \le n \}, \\ \underline{\mathbf{M}}\_{i=1}^{\Sigma\_{i=1}^{n}\sigma\_{i}} &= (\underline{\mathbf{M}}\_{\Sigma\_{i=1}^{n}\sigma\_{i}}^{\boldsymbol{\sigma}})^{c} \end{aligned}$$

*where* [*u*]*<sup>σ</sup>iis the equivalence class of u with respect to σi*.

**Definition 5** ([5])**.** *A pair* (*<sup>F</sup>*, *A*) *is called an SS over U if F is a mapping given by F* : *A* → *<sup>P</sup>*(*U*)*, where A is a subset of E (the set of parameters) and P*(*U*) *is the power set of U. Thus, <sup>F</sup>*(*e*) *is a subset of U for all e* ∈ *A. Hence, a SS over U is a parameterized collection of subsets of U.*

**Definition 6** ([68])**.** *Let* (*<sup>σ</sup>*, *A*) *be an SS over U*1 × *U*1*. Then,* (*<sup>σ</sup>*, *A*) *is called a soft binary relation on U*1*. In fact,* (*<sup>σ</sup>*, *A*) *is a parameterized collection of binary relations on U*1*, that is, we have a binary relation σ*(*e*) *on U*1 *for each parameter e* ∈ *A.*

Li et al. [69] presented the generalization of the soft binary relation over *U*1 to *U*2, as follows.

**Definition 7** ([69])**.** *A soft binary relation* (*<sup>σ</sup>*, *A*) *from U*1 *to U*2 *is an SS over U*1 × *U*2*, that is, σ* : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2)*, where A is a subset of the set of parameters E.*

*Of course,* (*<sup>σ</sup>*, *A*) *is a parameterized collection of binary relations from U*1 *to U*2*. That is, for each e* ∈ *A, we have a binary relation σ*(*e*) *from U*1 *to U*2*.*

**Definition 8** ([11])**.** *A pair* (*<sup>F</sup>*, *A*) *is called an IFSS over U if F is a mapping given by F* : *A* → *IF*(*U*) *and A is a subset of E (the set of parameters). Thus, <sup>F</sup>*(*e*) *is an IFS in U for all e* ∈ *A. Hence, an IFSS over U is a parameterized collection of IF sets in U.*

**Definition 9** ([11])**.** *For two IFSSs* (*<sup>F</sup>*, *A*) *and* (*<sup>G</sup>*, *B*) *over a common universe U, we say that* (*<sup>F</sup>*, *A*) *is an IF soft subset of* (*<sup>G</sup>*, *B*) *if* (1) *A* ⊆ *B and* (2) *<sup>F</sup>*(*e*) *is an IF subset of <sup>G</sup>*(*e*) *for all e* ∈ *A. Two IFSSs* (*<sup>F</sup>*, *A*) *and* (*<sup>G</sup>*, *B*) *over a common universe U are said to be IF soft equal if* (*<sup>F</sup>*, *A*) *is an IF soft subset of* (*<sup>G</sup>*, *B*) *and* (*<sup>G</sup>*, *B*) *is an IF soft subset of* (*<sup>F</sup>*, *<sup>A</sup>*)*. The union of two IFSSs* (*<sup>F</sup>*, *A*) *and* (*<sup>G</sup>*, *A*) *over the common universe U is the IFSS* (*<sup>H</sup>*, *<sup>A</sup>*)*, where <sup>H</sup>*(*e*) = *<sup>F</sup>*(*e*) ∪ *<sup>G</sup>*(*e*) *for all e* ∈ *A. The intersection of two IFSSs* (*<sup>F</sup>*, *A*) *and* (*<sup>G</sup>*, *A*) *over the common universe U is the IFSS* (*<sup>K</sup>*, *<sup>A</sup>*)*, where <sup>K</sup>*(*e*) = *<sup>F</sup>*(*e*) ∩ *<sup>G</sup>*(*e*) *for all e* ∈ *A.*

**Definition 10** ([70])**.** *Let* (*<sup>σ</sup>*, *A*) *be a soft binary relation from U*1 *to U*2 *and B* = *μ<sup>B</sup>*, *<sup>γ</sup>B be an IFS in U*2*. Then, lower approximation σ<sup>B</sup>* = (*σμ<sup>B</sup>* , *σγ<sup>B</sup>* ) *and upper approximation σ<sup>B</sup>* = (*σμ<sup>B</sup>* , *σγ<sup>B</sup>* ) *of B* = *μ<sup>B</sup>*, *<sup>γ</sup>B with respect to aftersets are defined as follows:*

$$\underline{\sigma}^{\mu\_{\mathcal{B}}}(\mathfrak{c})(\mathfrak{u}\_{1}) = \begin{cases} \ \wedge\_{\mathcal{A}\in\mathfrak{u}\_{1}\sigma(\mathfrak{c})} \mu\_{\mathcal{B}}(\mathfrak{a}) & \text{if } \mathfrak{u}\_{1}\sigma(\mathfrak{c}) \neq \mathcal{Q};\\ 1 & \text{if } \mathfrak{u}\_{1}\sigma(\mathfrak{c}) = \mathcal{Q};\\ \underline{\sigma}^{\gamma\_{\mathcal{B}}}(\mathfrak{c})(\mathfrak{u}\_{1}) = \begin{cases} \ \vee\_{\mathcal{A}\in\mathfrak{u}\_{1}\sigma(\mathfrak{c})} \gamma\_{\mathcal{B}}(\mathfrak{a}) & \text{if } \mathfrak{u}\_{1}\sigma(\mathfrak{c}) \neq \mathcal{Q};\\ 0 & \text{if } \mathfrak{u}\_{1}\sigma(\mathfrak{c}) = \mathcal{Q}; \end{cases}$$

*and*

$$\begin{aligned} \overline{\sigma}^{\mu\_{\mathcal{B}}}(\varepsilon)(\mu\_1) &= \begin{cases} \ ^{\vee}\boldsymbol{\iota}\_{\mathcal{A}\in\mathfrak{u}\_1\sigma(\varepsilon)}\mu\_{\mathcal{B}}(a) & \text{if } \boldsymbol{u}\_1\sigma(\varepsilon) \neq \mathcal{Q}; \\ 0 & \text{if } \boldsymbol{u}\_1\sigma(\varepsilon) = \mathcal{Q}; \end{cases} \\ \overline{\sigma}^{\gamma\_{\mathcal{B}}}(\varepsilon)(\mu\_1) &= \begin{cases} \ ^{\wedge}\boldsymbol{\iota}\_{\mathcal{A}\in\mathfrak{u}\_1\sigma(\varepsilon)}\gamma\_{\mathcal{B}}(a) & \text{if } \boldsymbol{u}\_1\sigma(\varepsilon) \neq \mathcal{Q}; \\ 1 & \text{if } \boldsymbol{u}\_1\sigma(\varepsilon) = \mathcal{Q}. \end{cases} \end{aligned}$$

*where <sup>u</sup>*1*<sup>σ</sup>*(*e*) = {*a* ∈ *U*2 : (*<sup>u</sup>*1, *a*) ∈ *σ*(*e*)} *and is called the afterset of u*1 *for u*1 ∈ *U*1 *and e* ∈ *A.*


**Definition 11** ([70])**.** *Let* (*<sup>σ</sup>*, *A*) *be a soft binary relation from U*1 *to U*2 *and B* = *μ<sup>B</sup>*, *<sup>γ</sup>B be an IFS in U*1*. Then, lower approximation <sup>B</sup>σ* = (*<sup>μ</sup>B <sup>σ</sup>*,*γ<sup>B</sup> σ*) *and upper approximation <sup>B</sup>σ* = (*<sup>μ</sup>B <sup>σ</sup>*,*γ<sup>B</sup> σ*) *of B* = *μ<sup>B</sup>*, *<sup>γ</sup>B with respect to foresets are defined as follows:*

$$\begin{aligned} \,^{\wedge\_B}\underline{\sigma}(\mathfrak{e})(\mathfrak{u}\_2) &= \begin{cases} \,^{\wedge\_{\mathfrak{a}\in\sigma(\mathfrak{e})\mathfrak{u}\_2}\mu\_B(a) & \text{if } \sigma(\mathfrak{e})\mathfrak{u}\_2 \neq \bigcirc; \\\, 1 & \text{if } \sigma(\mathfrak{e})\mathfrak{u}\_2 = \bigcirc; \end{cases} \\\\ \,^{\wedge\_B}\underline{\sigma}(\mathfrak{e})(\mathfrak{u}\_2) &= \begin{cases} \,^{\vee\_{\mathfrak{a}\in\sigma(\mathfrak{e})\mathfrak{u}\_2}\gamma\_B(a) & \text{if } \sigma(\mathfrak{e})\mathfrak{u}\_2 \neq \bigcirc; \\\, 0 & \text{if } \sigma(\mathfrak{e})\mathfrak{u}\_2 = \bigcirc; \end{cases} \end{aligned}$$

*and*

$$\begin{aligned} \, ^{\mu\_{\mathcal{B}}}\overline{\sigma}(\mathfrak{e})(\mathfrak{u}\_{2}) &= \begin{cases} \, ^{\vee}\boldsymbol{\iota}\_{\mathcal{A}\in\sigma(\mathfrak{e})\upharpoonright \mu\_{\mathcal{B}}}\mu\_{\mathcal{B}}(\mathfrak{a}) & \mbox{if  $\sigma(\mathfrak{e})\upharpoonright \mu\_{\mathcal{Q}}\vightharpoonup \mathcal{Q};} \\ 0 & \mbox{if $ \sigma(\mathfrak{e})\upharpoonright \mu\_{\mathcal{Q}}\vightharpoonup \mathcal{Q};} \end{cases} \\ \, ^{\gamma\_{\mathcal{B}}}\overline{\sigma}(\mathfrak{e})(\mathfrak{u}\_{2}) &= \begin{cases} \, ^{\wedge}\boldsymbol{\wedge}\_{\mathcal{A}\in\sigma(\mathfrak{e})\upharpoonright \mu\_{\mathcal{B}}}\gamma\_{\mathcal{B}}(\mathfrak{a}) & \mbox{if  $\sigma(\mathfrak{e})\upharpoonright \mu\_{\mathcal{Q}}\vightharpoonup \mathcal{Q};} \\ 1 & \mbox{if $ \sigma(\mathfrak{e})\upharpoonright \mu\_{\mathcal{Q}} = \mathcal{Q}. \end{cases} \end{aligned}$$

*where <sup>σ</sup>*(*e*)*<sup>u</sup>*2 = {*a* ∈ *U*1 : (*a*, *<sup>u</sup>*2) ∈ *σ*(*e*)} *and is called the foreset of u*2 *for u*2 ∈ *U*2 *and e* ∈ *A.*

Of course, *σ<sup>B</sup>* : *A* → *IF*(*<sup>U</sup>*1), *σ<sup>B</sup>* : *A* → *IF*(*<sup>U</sup>*1) and *<sup>B</sup>σ* : *A* → *IF*(*<sup>U</sup>*2), *<sup>B</sup>σ* : *A* → *IF*(*<sup>U</sup>*2).

**Theorem 1** ([70])**.** *Let* (*<sup>σ</sup>*, *A*) *be a soft binary relation from U*1 *to U*2*, that is σ* : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2)*. For any IFSs B* = *μ<sup>B</sup>*, *<sup>γ</sup><sup>B</sup> , B*1 = 1*<sup>μ</sup><sup>B</sup>*1, *γB*12 *and B*2 = 1*<sup>μ</sup><sup>B</sup>*2, *γB*22 *of U*2*, the following are true:*

;



*(11) σ*0*U*2 = <sup>0</sup>*U*1= *σ*0*U*2 *if <sup>u</sup>*1*<sup>σ</sup>*(*e*) = ∅*.*

**Theorem 2** ([70])**.** *Let* (*<sup>σ</sup>*, *A*) *be a soft binary relation from U*1 *to U*2*, that is σ* : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2)*. For any IFSs B* = *μ<sup>B</sup>*, *<sup>γ</sup><sup>B</sup> , B*1 = 1*<sup>μ</sup><sup>B</sup>*1 , *γB*1 2 *and B*2 = 1*<sup>μ</sup><sup>B</sup>*2 , *γB*2 2 *of U*1*, the following are true:*


*(9) <sup>B</sup>σ* = -*Bcσ<sup>c</sup> if <sup>u</sup>*2*<sup>σ</sup>*(*e*) = ∅*; (10) <sup>B</sup>σ* = -*Bcσ<sup>c</sup> if <sup>u</sup>*2*<sup>σ</sup>*(*e*) = ∅*; (11)* <sup>0</sup>*U*1 *σ* = <sup>0</sup>*U*2=0*U*<sup>1</sup> *σ.*

#### **3. Roughness of an Intuitionistic Fuzzy Set by Two Soft Relations**

In this section, we discuss the optimistic roughness of an IFS by two soft binary relations from *U*1 to *U*2. We approximate an IFS of universe *U*2 in universe *U*1 and an IFS of *U*1 in *U*2 by using aftersets and foresets of soft binary relations, respectively. In this way, we obtain two IFSSs corresponding to IFSs in *<sup>U</sup>*2(*<sup>U</sup>*1). We also study some properties of these approximations.

**Definition 12.** *Let U*1 *and U*2 *be two non-empty sets,* (*<sup>σ</sup>*1, *A*) *and* (*<sup>σ</sup>*2, *A*) *be two soft binary relations from U*1 *to U*2 *and B* = *μ<sup>B</sup>*, *<sup>γ</sup>B be an IFS in U*2*. Then, the optimistic lower approximation σ*1 + *<sup>σ</sup>*2*Bo* = *σ*1 + *<sup>σ</sup>*2*μ<sup>B</sup> o* , *σ*1 + *<sup>σ</sup>*2*γ<sup>B</sup> o and the upper approximation <sup>o</sup>σ*1 + *<sup>σ</sup>*2*<sup>B</sup>* = *<sup>o</sup>σ*1 + *<sup>σ</sup>*2*μ<sup>B</sup>* ,*o σ*1 + *<sup>σ</sup>*2*γ<sup>B</sup> of B* = *μ<sup>B</sup>*, *<sup>γ</sup>B are IF soft sets over U*1 *and are defined as:*

$$\begin{aligned} \underbrace{\sigma\_{1} + \sigma\_{2}}\_{\sigma}^{\mu\_{B}}(e)(u\_{1}) &= \left\{ \begin{array}{c} \wedge \{\mu\_{\mathbb{B}}(u\_{2}) : u\_{2} \in (\mu\_{1}\sigma\_{1}(e) \cup u\_{1}\sigma\_{2}(e))\}, & \text{if } u\_{1}\sigma\_{1}(e) \cup u\_{1}\sigma\_{2}(e) \neq \mathcal{Q}; \\ 1 & & \text{otherwise;} \end{array} \right. \\\\ \underbrace{\sigma\_{1} + \sigma\_{2}\gamma^{\eta}}\_{\sigma}(e)(u\_{1}) &= \left\{ \begin{array}{c} \vee \{\gamma\mathbb{B}(u\_{2}) : u\_{2} \in (u\_{1}\sigma\_{1}(e) \cap u\_{1}\sigma\_{2}(e))\}, & \text{if } u\_{1}\sigma\_{1}(e) \cap u\_{1}\sigma\_{2}(e) \neq \mathcal{Q}; \\ 0 & & \text{otherwise;} \end{array} \right. \end{aligned}$$

*and*

$$\begin{aligned}{}^{o}\overline{\sigma\_{1}+\sigma\_{2}}^{\mu\_{B}}(\mathfrak{e})(\mathfrak{u}\_{1}) &= \left\{ \begin{array}{c} \vee \{\mu\_{B}(\mathfrak{u}\_{2}):\mu\_{2}\in(\mathfrak{u}\_{1}\sigma\_{1}(\mathfrak{e})\cap\mathfrak{u}\_{1}\sigma\_{2}(\mathfrak{e}))\}, & \text{if } \mathfrak{u}\_{1}\sigma\_{1}(\mathfrak{e})\cap\mathfrak{u}\_{1}\sigma\_{2}(\mathfrak{e}) \neq \mathcal{O};\\ 0 & \text{otherwise;} \end{array} \right. \\\\ \left. \circ \overline{\sigma\_{1}+\sigma\_{2}}^{\gamma\_{B}}(\mathfrak{e})(\mathfrak{u}\_{1}) &= \left\{ \begin{array}{c} \wedge \{\gamma\sigma\_{B}(\mathfrak{u}\_{2}):\mu\_{2}\in(\mathfrak{u}\_{1}\sigma\_{1}(\mathfrak{e})\cup\mathfrak{u}\_{1}\sigma\_{2}(\mathfrak{e})\}, & \text{if } \mathfrak{u}\_{1}\sigma\_{1}(\mathfrak{e})\cup\mathfrak{u}\_{1}\sigma\_{2}(\mathfrak{e}) \neq \mathcal{O};\\ 1 & \text{otherwise;} \end{array} \right. \end{aligned} \right.$$

*for all u*1 ∈ *U*1*, where <sup>u</sup>*1*σ*1(*e*) = {*<sup>u</sup>*2 ∈ *U*2 : (*<sup>u</sup>*1, *<sup>u</sup>*2) ∈ *<sup>σ</sup>*1(*e*)} *and <sup>u</sup>*1*σ*2(*e*) = { *u*2 ∈ *U*2 : (*<sup>u</sup>*1, *<sup>u</sup>*2) ∈ *<sup>σ</sup>*2(*e*)} *are called the aftersets of u*1 *for u*1 ∈ *U*1 *and e* ∈ *A. Obviously,* (*<sup>σ</sup>*1 + *<sup>σ</sup>*2*Bo* (*e*)), *A*) *and* (*<sup>o</sup>σ*1 + *<sup>σ</sup>*2*<sup>B</sup>*(*e*)) *are two IFS soft sets over U*1.

**Definition 13.** *Let U*1 *and U*2 *be two non-empty sets,* (*<sup>σ</sup>*1, *A*) *and* (*<sup>σ</sup>*2, *A*) *be two soft binary relations from U*1 *to U*2 *and B* = *μ<sup>B</sup>*, *<sup>γ</sup>B be an IFS in U*1*. Then, the optimistic lower approximation <sup>B</sup>σ*1 + *<sup>σ</sup>*2*o* = *μB σ*1 + *<sup>σ</sup>*2*o*,*γ<sup>B</sup> σ*1 + *σ*2*o and the optimistic upper approximation <sup>B</sup>σ*1 + *σ*2 = *μB σ*1 + *<sup>σ</sup>*2*o*,*γ<sup>B</sup> σ*1 + *<sup>σ</sup>*2*<sup>o</sup> of B* = *μ<sup>B</sup>*, *<sup>γ</sup>B are IF soft sets over U*2 *and are defined as:*

$$\iota^{\mu\_B} \underbrace{\sigma\_1 + \sigma\_2}\_{} (e)(\iota \nu\_2) = \left\{ \begin{array}{c} \wedge \{ \mu\_B(\iota \nu\_1) : \iota\_1 \in (\sigma\_1 \iota\_2(\varepsilon) \cup \sigma\_2 \iota\_2(\varepsilon)) \}, & \text{if } \sigma\_1 \iota\_2(\varepsilon) \cup \sigma\_2 \iota\_2(\varepsilon) \neq \mathcal{Q};\\ 1 & & \text{otherwise}; \end{array} \right. $$

$$\underline{\sigma\_{\mathcal{B}}} \underbrace{\sigma\_{1} + \sigma\_{2}}\_{=} (\mathsf{e})(\mathsf{u}\boldsymbol{\omega}) = \begin{cases} \vee \{\gamma\_{B}(\boldsymbol{u}\_{1}) : \boldsymbol{u}\_{1} \in (\sigma\_{1}\boldsymbol{u}\_{2}(\boldsymbol{e}) \cap \sigma\_{2}\boldsymbol{u}\_{2}(\boldsymbol{e})) \}, & \text{if } \sigma\_{1}\boldsymbol{u}\_{2}(\boldsymbol{e}) \cap \sigma\_{2}\boldsymbol{u}\_{2}(\boldsymbol{e}) \neq \mathsf{Q};\\ 0 & \text{otherwise;} \end{cases}$$

*and*

$${}^{\mu\_{B}}\overline{\sigma\_{1} + \sigma\_{2}}^{\sigma}(\varepsilon)(\mu\_{2}) = \begin{cases} \vee \{ \mu\_{B}(\mu\_{1}) : \mu\_{1} \in (\sigma\_{1}\mu\_{2}(\varepsilon) \cap \sigma\_{2}\mu\_{2}(\varepsilon)) \}, & \text{if } \sigma\_{1}\mu\_{2}(\varepsilon) \cap \sigma\_{2}\mu\_{2}(\varepsilon) \neq \mathcal{O};\\ 0 & \text{otherwise;} \end{cases}$$

$$\tau^{\eta\_{1}}\overline{\sigma\_{1}+\sigma\_{2}}^{o}(\varepsilon)(\mu\_{2}) = \begin{cases} \ \wedge \{\gamma \boxtimes (\mu\_{1}) : \boldsymbol{u}\_{1} \in (\sigma\_{1}\boldsymbol{u}\_{2}(\varepsilon) \cup \sigma\_{2}\boldsymbol{u}\_{2}(\varepsilon))\}, & \text{if } \sigma\_{1}\boldsymbol{u}\_{2}(\varepsilon) \cup \sigma\_{2}\boldsymbol{u}\_{2}(\varepsilon) \neq \mathcal{Q}\boldsymbol{\rho}\_{1} \\\ 1 & \text{otherwise}; \end{cases}$$

*for all u*2 ∈ *U*2 *where <sup>σ</sup>*1(*e*)*<sup>u</sup>*2 = {*<sup>u</sup>*1 ∈ *U*1 : (*<sup>u</sup>*1, *<sup>u</sup>*2) ∈ *<sup>σ</sup>*1(*e*)} *and <sup>σ</sup>*2(*e*)*<sup>u</sup>*2 = { *u*1 ∈ *U*1 : (*a*, *<sup>u</sup>*2) ∈ *<sup>σ</sup>*2(*e*)} *are called the foresets of u*2 *for u*2 ∈ *U*2 *and e* ∈ *A. Obviously,* (*<sup>B</sup>σ*1 + *<sup>σ</sup>*2*o*(*e*)), *A*) *and* (*<sup>B</sup>σ*1 + *<sup>σ</sup>*2*<sup>o</sup>*(*e*)) *are two IFS soft sets over U*2.

Of course, *σ*1 + *<sup>σ</sup>*2*Bo* (*e*) : *A* → *IF*(*<sup>U</sup>*1), *<sup>o</sup>σ*1 + *<sup>σ</sup>*2*<sup>B</sup>*(*e*) : *A* → *IF*(*<sup>U</sup>*1) and *<sup>B</sup>σ*1 + *<sup>σ</sup>*2*o*(*e*) : *A* → *IF*(*<sup>U</sup>*2), *<sup>B</sup>σ*1 + *<sup>σ</sup>*2*<sup>o</sup>*(*e*) : *A* → *IF*(*<sup>U</sup>*2). The following example explains the above definitions.

**Example 1.** *Let U*1 = {1, 2, <sup>3</sup>}, *U*2 = {*<sup>a</sup>*, *b*, *c*} *and A* = {*<sup>e</sup>*1,*e*2}, *and* (*<sup>σ</sup>*1, *A*) *and* (*<sup>σ</sup>*2, *A*) *be soft binary relations from U*1 *to U*2 *defined by*

$$\begin{array}{rcl} \sigma\_1(\mathfrak{e}\_1) &=& \{ (1,a), (1,b), (2,a) \}, \sigma\_1(\mathfrak{e}\_2) = \{ (2,b), (3,a) \}, \\ \sigma\_2(\mathfrak{e}\_1) &=& \{ (2,b), (2,c), (3,a) \} \text{ and } \sigma\_2(\mathfrak{e}\_2) = \{ (1,c), (3,b), (3,c) \}. \end{array}$$

Then, their aftersets and foresets are

> <sup>1</sup>*σ*1(*<sup>e</sup>*1) = {*<sup>a</sup>*, *b*}, <sup>2</sup>*σ*1(*<sup>e</sup>*1) = {*a*}, <sup>3</sup>*σ*1(*<sup>e</sup>*1) = ∅, <sup>1</sup>*σ*1(*<sup>e</sup>*2) = ∅, <sup>2</sup>*σ*1(*<sup>e</sup>*2) = {*b*}, <sup>3</sup>*σ*1(*<sup>e</sup>*2) = {*a*} and <sup>1</sup>*σ*2(*<sup>e</sup>*1) = ∅, <sup>2</sup>*σ*2(*<sup>e</sup>*1) = {*b*, *<sup>c</sup>*}, <sup>3</sup>*σ*2(*<sup>e</sup>*1) = {*a*}, <sup>1</sup>*σ*2(*<sup>e</sup>*2) = {*c*}, <sup>2</sup>*σ*2(*<sup>e</sup>*2) = ∅, <sup>3</sup>*σ*2(*<sup>e</sup>*2) = {*b*, *<sup>c</sup>*}, *<sup>σ</sup>*1(*<sup>e</sup>*1)*<sup>a</sup>* = {1, <sup>2</sup>}, *<sup>σ</sup>*1(*<sup>e</sup>*1)*b* = {1}, *<sup>σ</sup>*1(*<sup>e</sup>*1)*<sup>c</sup>* = ∅, *<sup>σ</sup>*1(*<sup>e</sup>*2)*<sup>a</sup>* = {3}, *<sup>σ</sup>*1(*<sup>e</sup>*2)*b* = {2}, *<sup>σ</sup>*1(*<sup>e</sup>*2)*<sup>c</sup>* = ∅and *<sup>σ</sup>*2(*<sup>e</sup>*1)*<sup>a</sup>* = {3}, *<sup>σ</sup>*2(*<sup>e</sup>*1)*b* = {2}, *<sup>σ</sup>*2(*<sup>e</sup>*1)*<sup>c</sup>* = {2}, *<sup>σ</sup>*2(*<sup>e</sup>*2)*<sup>a</sup>* = ∅, *<sup>σ</sup>*2(*<sup>e</sup>*2)*b* = {3}, *<sup>σ</sup>*2(*<sup>e</sup>*2)*<sup>c</sup>* = {1, <sup>3</sup>}.

(1) Define *B*1 = 1*<sup>μ</sup><sup>B</sup>*1 , *γB*1 2 : *U*2 → [0, 1] (given in Table 2).

**Table 2.** Intuitionistic fuzzy set *B*1.


The optimistic multigranulation lower and upper approximations of *B*1 with respect to the aftersets are given in Tables 3 and 4.




**Table 4.** Optimistic multigranulation upper approximation of *B*1.

(2) Define *B* = *μ<sup>B</sup>*, *<sup>γ</sup>B* : *U*1 → [0, 1] as given in Table 5.

**Table 5.** Intuitionistic fuzzy set *B*.


The optimistic multigranulation lower and upper approximations of *B* with respect to the foresets are given in Tables 6 and 7.

**Table 6.** Optimistic multigranulation lower approximation of *B*.


**Table 7.** Optimistic multigranulation upper approximation of *B*.


**Proposition 1.** *Let* (*<sup>σ</sup>*1, *<sup>A</sup>*),(*<sup>σ</sup>*2, *A*) *be two soft relations from U*1 *to U*2*, that is σ*1 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and σ*2 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and B* ∈ *IF*(*<sup>U</sup>*2). *Then, the following hold with respect to the aftersets:*

$$\begin{array}{c} 1. \ \underline{\sigma\_1 + \sigma\_2}^B \lessapprox \underline{\sigma\_1}^B \times \underline{\sigma\_2}^B; \\ 2. \ ^\circ \overline{\sigma\_1 + \sigma\_2}^B \lessapprox \overline{\sigma\_1}^B \wedge \overline{\sigma\_2}^B. \end{array}$$

**Proof.** (1) Let *u*1 ∈ *U*1. Then, *σ*1 + *<sup>σ</sup>*2*μ<sup>B</sup> o* (*e*)(*<sup>u</sup>*1) = ∧{*μB*(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} (∧{*μB*(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*)}) ∨ (∧{*μB*(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*2(*e*)}) = *<sup>σ</sup>*1*μ<sup>B</sup>* (*e*)(*<sup>u</sup>*1) ∨ *<sup>σ</sup>*2*μ<sup>B</sup>* (*e*)(*<sup>u</sup>*1). Similarly, let *u*1 ∈ *U*1. Then *σ*1 + *<sup>σ</sup>*2*γ<sup>B</sup> o* (*e*)(*<sup>u</sup>*1) = ∨{*<sup>γ</sup>B*(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*)<sup>∩</sup>*u*1*σ*2(*e*))} (∨{*<sup>γ</sup>B*(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*)}) ∧ (∨{*<sup>γ</sup>B*(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*2(*e*)}) = *<sup>σ</sup>*1*γ<sup>B</sup>* (*e*)(*<sup>u</sup>*1) ∧ *<sup>σ</sup>*2*γ<sup>B</sup>* (*e*)(*<sup>u</sup>*1). Hence, *σ*1 + *<sup>σ</sup>*2*Bo <sup>σ</sup>*1*<sup>B</sup>* ∨ *<sup>σ</sup>*2*B*. (2) The properties can be proved similarly to (1).

**Proposition 2.** *Let* (*<sup>σ</sup>*1, *<sup>A</sup>*),(*<sup>σ</sup>*2, *A*) *be two soft relations from U*1 *to U*2*, that is σ*1 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and σ*2 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and B* ∈ *IF*(*<sup>U</sup>*1). *Then, the following hold with respect to the foresets:*

$$\underset{2.\;\,^B\overline{\sigma\_1 + \sigma\_2}\; ^\leqslant \; ^B\underline{\sigma\_1}\; ^\leqslant ^B\underline{\sigma\_1}\; ^\leqslant ^B\underline{\sigma\_2}\; ^\leqslant$$

**Proof.** The proof is similar to the proof of Proposition 1.

For the converse, we have the following example.

**Example 2** (Continued from Example 1)**.** *According to Example 1, we have the following:*

$$\begin{array}{llll} \underline{\sigma\_{1}}^{\mu\_{\mathcal{B}\_{1}}}(\mathfrak{e}\_{1})(\mathfrak{2}) &=& 0.5 \, and \, \underline{\sigma\_{1}}^{\gamma\_{\mathcal{B}\_{1}}}(\mathfrak{e}\_{1})(\mathfrak{2}) = 0.4;\\ \underline{\sigma\_{2}}^{\mu\_{\mathcal{B}\_{1}}}(\mathfrak{e}\_{1})(\mathfrak{2}) &=& 0.3 \, and \, \underline{\sigma\_{2}}^{\gamma\_{\mathcal{B}\_{1}}}(\mathfrak{e}\_{1})(\mathfrak{2}) = 0.7;\\ \overline{\sigma\_{1}}^{\mu\_{\mathcal{B}\_{1}}}(\mathfrak{e}\_{1})(\mathfrak{2}) &=& 0.5 \, and \, \overline{\sigma\_{1}}^{\mu\_{\mathcal{B}\_{1}}}(\mathfrak{e}\_{1})(\mathfrak{2}) = 0.4;\\ \overline{\sigma\_{2}}^{\mu\_{\mathcal{B}\_{1}}}(\mathfrak{e}\_{1})(\mathfrak{2}) &=& 0.4 \, and \, \overline{\sigma\_{2}}^{\gamma\_{\mathcal{B}\_{1}}}(\mathfrak{e}\_{1})(\mathfrak{2}) = 0.5. \end{array}$$

*Hence,*

$$\begin{array}{llll} \underline{\sigma\_{1}+\sigma\_{2}}^{\underline{\nu\_{B\_{1}}}}(\boldsymbol{e\_{1}})(2) &=& 0.3 \not\geqslant 0.5 = \underline{\sigma\_{1}}^{\mu\_{B\_{1}}}(\boldsymbol{e\_{1}})(2) \vee \underline{\sigma\_{2}}^{\mu\_{B\_{1}}}(\boldsymbol{e\_{1}})(2);\\ \underline{\sigma\_{1}+\sigma\_{2}}^{\underline{\gamma\_{B\_{1}}}}(\boldsymbol{e\_{1}})(2) &=& 0.7 \not\leqslant 0.4 = \underline{\sigma\_{1}}^{\gamma\_{B\_{1}}}(\boldsymbol{e\_{1}})(2) \wedge \underline{\sigma\_{2}}^{\gamma\_{B\_{1}}}(\boldsymbol{e\_{1}})(2);\\ \underline{\sigma\_{1}+\sigma\_{2}}^{\underline{\nu\_{B\_{1}}}}(\boldsymbol{e\_{1}})(2) &=& 0 \not\geqslant 0.4 = \overline{\sigma\_{1}}^{\mu\_{B\_{1}}}(\boldsymbol{e\_{1}})(2) \wedge \overline{\sigma\_{2}}^{\mu\_{B\_{1}}}(\boldsymbol{e\_{1}})(2);\\ \underline{\sigma\_{1}+\sigma\_{2}}^{\underline{\nu\_{B\_{1}}}}(\boldsymbol{e\_{1}})(2) &=& 1 \not\leqslant 0.5 = \overline{\sigma\_{1}}^{\gamma\_{B\_{1}}}(\boldsymbol{e\_{1}})(2) \vee \overline{\sigma\_{1}}^{\gamma\_{B\_{1}}}(\boldsymbol{e\_{1}})(2). \end{array}$$

*In addition,*

$$\begin{array}{rcl} \stackrel{\mu\_B}{\underline{\upsilon\_1}}(\underline{c\_1})(a) &=& 0.3 \, and \, ^{\gamma\_B}\underline{\sigma\_1}(\underline{c\_1})(a) = 0.6\\ \stackrel{\mu\_B}{\underline{\upsilon\_2}}(\underline{c\_1})(a) &=& 0.6 \, and \, ^{\gamma\_B}\underline{\sigma\_2}(\underline{c\_1})(a) = 0.2\\ \stackrel{\mu\_B}{\underline{\upsilon\_1}}(\underline{c\_1})(a) &=& 0.7 \, and \, ^{\gamma\_B}\overline{\sigma\_1}(\underline{c\_1})(a) = 0.3\\ \stackrel{\mu\_B}{\underline{\upsilon\_2}}(\underline{c\_1})(a) &=& 0.6 \, and \, ^{\gamma\_B}\overline{\sigma\_2}(\underline{c\_1})(a) = 0.2 \end{array}$$

*Hence,*

$$\begin{array}{rclcrcl}\underline{\sigma\_{1} + \underline{\sigma\_{2}}}(\mathfrak{e}\_{1})(a) &=& 0.3 \not\geqslant 0.7 = \underline{\sigma\_{1}}(\mathfrak{e}\_{1})(a) \lor^{\mu\_{B}} \underline{\sigma\_{2}}(\mathfrak{e}\_{1})(a);\\\underline{\sigma\_{3} + \underline{\sigma\_{2}}}(\mathfrak{e}\_{1})(a) &=& 0.3 \not\geqslant 0.2 = \underline{\sigma\_{1}}(\mathfrak{e}\_{1})(a) \land^{\gamma\_{B}} \underline{\sigma\_{2}}(\mathfrak{e}\_{1})(a);\\\underline{\sigma\_{3} + \underline{\sigma\_{2}}}(\mathfrak{e}\_{1})(a) &=& 0 \not\geqslant 0.6 = \underline{\mu\_{B}} \; \overline{\sigma\_{1}}(\mathfrak{e}\_{1})(a) \land^{\mu\_{B}} \overline{\sigma\_{2}}(\mathfrak{e}\_{1})(a);\\\underline{\sigma\_{3} \overline{\sigma\_{1} + \underline{\sigma\_{2}}}}(\mathfrak{e}\_{1})(a) &=& 1 \not\geqslant 0.3 = \overline{\sigma\_{1}}(\mathfrak{e}\_{1})(a) \lor^{\gamma\_{B}} \overline{\sigma\_{2}}(\mathfrak{e}\_{1})(a). \end{array}$$

**Proposition 3.** *Let* (*<sup>σ</sup>*1, *<sup>A</sup>*),(*<sup>σ</sup>*2, *A*) *be two soft relations from U*1 *to U*2*, that is σ*1 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and σ*2 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and B* ∈ *IF*(*<sup>U</sup>*2). *Then, the following hold:*

$$\begin{split} & \text{(1)} \ \underbrace{\sigma\_{1} + \sigma\_{2}}\_{\sigma\_{1} + \sigma\_{2}} ^{\text{l}\text{l}\!\_{2}} = 1\_{\text{l}\!\_{1}} \text{ for all } e \in A; \\ & \text{(2)} \ \underbrace{\sigma\_{1} + \sigma\_{2}}\_{\sigma\_{1} + \sigma\_{2}} ^{\text{l}\text{l}\!\_{2}} = 1\_{\text{l}\!\_{1}} \text{ if } u\_{1}\sigma\_{1}(e) \cap u\_{1}\sigma\_{2}(e) \neq \bigotimes \text{ and } u\_{1}\sigma\_{1}(e) \cup u\_{1}\sigma\_{2}(e) \neq \bigotimes; \\ & \text{(3)} \ \underbrace{\sigma\_{1} + \sigma\_{2}}\_{\sigma\_{1} + \sigma\_{2}} ^{\text{l}\text{l}\!\_{2}} = 0 \text{l}\!\_{1} \text{ if } u\_{1}\sigma\_{1}(e) \cup u\_{1}\sigma\_{2}(e) \neq \bigotimes \text{ and } u\_{1}\sigma\_{1}(e) \cap u\_{1}\sigma\_{2}(e) \neq \bigotimes; \\ & \text{(4)} \ \underbrace{\sigma\_{1} + \sigma\_{2}}\_{\sigma\_{1} + \sigma\_{2}} ^{\text{l}\text{l}\!\_{2}} = 0 \text{l}\!\_{l\!\_{1}} \text{ for all } e \in A. \end{split}$$

**Proof.** (1) Let *u*1 ∈ *U*1 and <sup>1</sup>*U*2 = 1, 0 be the universal set of *U*2. If *<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*) = ∅, then *σ*1 + *σ*21*o* (*e*)(*<sup>u</sup>*1) = 1 and *σ*1 + *σ*20*o* (*e*)(*<sup>u</sup>*1) = 0.

If *<sup>u</sup>*1*σ*1(*e*)<sup>∪</sup>*u*1*σ*2(*e*) = ∅, then *σ*1 + *σ*21*o* (*e*)(*<sup>u</sup>*1) = ∧{1(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*)<sup>∪</sup>*u*1*σ*2(*e*))} = ∧{1 : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = 1,

and *σ*1 + *σ*20*o* (*e*)(*<sup>u</sup>*1) = ∨{0(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))} = ∨{0 : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))} = 0.

(2) The properties can be proved similarly to (1).

(3) Let *u*1 ∈ *U*1 and <sup>0</sup>*U*2 = 0, 1 be the universal set of *U*2. If *<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*) = ∅, then *σ*1 + *σ*20*o* (*e*)(*<sup>u</sup>*1) = ∧{0(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = ∧{0 : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = 0,

and *σ*1 + *σ*21*o* (*e*)(*<sup>u</sup>*1) = ∨{1(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))} = ∨{1 : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))} = 1.

(4) The properties can be proved similarly to (3).

**Proposition 4.** *Let* (*<sup>σ</sup>*1, *<sup>A</sup>*),(*<sup>σ</sup>*2, *A*) *be two soft relations from U*1 *to U*2*, that is σ*1 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and σ*2 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and and B* ∈ *IF*(*<sup>U</sup>*1). *Then, the following hold:*

*(1)* <sup>1</sup>*U*1 *σ*1 + *<sup>σ</sup>*2*o* = <sup>1</sup>*U*2 *for all e* ∈ *A*; *(2)* <sup>1</sup>*U*1 *σ*1 + *σ*2 *o* = <sup>1</sup>*U*2 *for all e* ∈ *A*,*for all e* ∈ *A*, *if <sup>σ</sup>*1(*e*)*<sup>u</sup>*2 ∩ *<sup>σ</sup>*2(*e*)*<sup>u</sup>*2 = ∅ *and <sup>σ</sup>*1(*e*)*<sup>u</sup>*2 ∪ *<sup>σ</sup>*2(*e*)*<sup>u</sup>*2 = ∅; *(3)* <sup>0</sup>*U*1 *σ*1 + *<sup>σ</sup>*2*o* = <sup>0</sup>*U*2 *for all e* ∈ *A*,*for all e* ∈ *A*, *if <sup>σ</sup>*1(*e*)*<sup>u</sup>*2 ∪ *<sup>σ</sup>*2(*e*)*<sup>u</sup>*2 = ∅ *and <sup>σ</sup>*1(*e*)*<sup>u</sup>*2 ∩ *<sup>σ</sup>*2(*e*)*<sup>u</sup>*2 = ∅; *(4)* <sup>0</sup>*U*1 *σ*1 + *σ*2 *o for all e* ∈ *A*.

**Proof.** The proof is similar to the proof of Proposition 3.

**Proposition 5.** *Let* (*<sup>σ</sup>*1, *<sup>A</sup>*),(*<sup>σ</sup>*2, *A*) *be two soft relations from U*1 *to U*2*, that is σ*1 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and σ*2 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and B*, *B*1, *B*2 ∈ *IF*(*<sup>U</sup>*2). *Then, the following properties hold:*

*(1) If B*1 ⊆ *B*2 *then σ*1 + *σ*2 *B*1 *o* ⊆ *σ*1 + *σ*2 *B*2 *o* ; *(2) If B*1 ⊆ *B*2 *then <sup>o</sup>σ*1 + *σ*2 *B*1 ⊆*o σ*1 + *σ*2 *B*2 ; *(3) σ*1 + *σ*2 *B*1∩*B*2 *o* = *σ*1 + *σ*2 *B*1 *o* ∩ *σ*1 + *σ*2 *B*2 *o* ; *(4) σ*1 + *σ*2 *B*1∪*B*2 *o* ⊇ *σ*1 + *σ*2 *B*1 *o* ∪ *σ*1 + *σ*2 *B*2 *o* ; *(5) <sup>o</sup>σ*1 + *σ*2 *B*1∪*B*2 =*<sup>o</sup> σ*1 + *σ*2 *B*1 ∪*<sup>o</sup> σ*1 + *σ*2 *B*2 ; *(6) <sup>o</sup>σ*1 + *σ*2 *B*1∩*B*2 ⊆*o σ*1 + *σ*2 *B*1 ∩*<sup>o</sup> σ*1 + *σ*2 *B*2 .

**Proof.** (1) Since *B*1 ⊆ *B*2 so *μ<sup>B</sup>*1 *μ<sup>B</sup>*2 and *γB*1 *γB*2 . Thus *σ*1 + *σ*2 *μB*1 *o* (*e*)(*<sup>u</sup>*1) = ∧{*μ<sup>B</sup>*1 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} ∧{*μ<sup>B</sup>*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = *σ*1 + *σ*2 *μB*2 *o* (*e*)(*<sup>u</sup>*1), and *σ*1 + *σ*2 *γB*1 *o* (*e*)(*<sup>u</sup>*1) = ∨{ *γB*1 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))} ∨{ *γB*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))} = *σ*1 + *σ*2 *γB*2 *o* (*e*)(*<sup>u</sup>*1). (2) The properties can be proved similarly to (1). (3) Let *u*1 ∈ *U*1. If *<sup>u</sup>*1*σ*1(*e*)<sup>∪</sup>*u*1*σ*2(*e*) = ∅, then *σ*1 + *σ*2 *μB*1∩*B*2 *o* (*e*)(*<sup>u</sup>*1) = 1 = *σ*1 + *σ*2 *μB*1 *o* (*e*) (*<sup>u</sup>*1) ∩ *σ*1 + *σ*2 *μB*2 *o* (*e*)(*<sup>u</sup>*1) and *σ*1 + *σ*2 *γB*1∩*B*2 *o* (*e*)(*<sup>u</sup>*1) = 0 = *σ*1 + *σ*2 *γB*1 *o* (*e*)(*<sup>u</sup>*1) ∪ *σ*1 + *σ*2 *γB*2 *o* (*e*)(*<sup>u</sup>*1). If *<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*) = ∅, then *σ*1 + *σ*2 *μB*1∩*B*2 *o* (*e*)(*<sup>u</sup>*1) = ∧{(*μ<sup>B</sup>*1 ∧ *μ<sup>B</sup>*2 )(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = ∧{*μ<sup>B</sup>*1 (*<sup>u</sup>*2) ∧ *μ<sup>B</sup>*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = (∧{*μ<sup>B</sup>*1 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))}) ∧ (∧{*μ<sup>B</sup>*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))}) = *σ*1 + *σ*2 *μB*1 *o* (*e*)(*<sup>u</sup>*1) ∩ *σ*1 + *σ*2 *μB*2 *o* (*e*)(*<sup>u</sup>*1). In addition, *σ*1 + *σ*2 *γB*1∩*B*2 *o* (*e*)(*<sup>u</sup>*1) = ∨{(*μ<sup>B</sup>*1 ∨ *μ<sup>B</sup>*2 )(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = ∨{*μ<sup>B</sup>*1 (*<sup>u</sup>*2) ∨ *μ<sup>B</sup>*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = (∨{*μ<sup>B</sup>*1 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))}) ∨ (∨{*μ<sup>B</sup>*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))}) = *σ*1 + *σ*2 *μB*1 *o* (*e*)(*<sup>u</sup>*1) ∪ *σ*1 + *σ*2 *μB*2 *o* (*e*)(*<sup>u</sup>*1). This shows that *σ*1 + *σ*2 *B*1∩*B*2 *o* = *σ*1 + *σ*2 *B*1 *o* ∩ *σ*1 + *σ*2 *B*2 *o* . (4) The properties can be proved similarly to (3). (5) Let *u*1 ∈ *U*1. If *<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*) = ∅, then *<sup>o</sup>σ*1 + *σ*2 *μB*1∪*B*2 (*e*)(*<sup>u</sup>*1) = 0 =*<sup>o</sup> σ*1 + *σ*2 *μB*1 (*e*)(*<sup>u</sup>*1) ∪*<sup>o</sup> σ*1 + *σ*2 *μB*2 (*e*)(*<sup>u</sup>*1) and *<sup>o</sup>σ*1 + *σ*2 *γB*1∪*B*2 (*e*)(*<sup>u</sup>*1) = 1 =*<sup>o</sup> σ*1 + *σ*2 *μB*1 (*e*)(*<sup>u</sup>*1) ∩*<sup>o</sup> σ*1 + *σ*2 *μB*2 (*e*)(*<sup>u</sup>*1). If *<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*) = ∅, then *<sup>o</sup>σ*1 + *σ*2 *μB*1∪*B*2 (*e*)(*<sup>u</sup>*1) = ∨{(*μ<sup>B</sup>*1 ∨ *μ<sup>B</sup>*2 )(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))} = ∨{*μ<sup>B</sup>*1 (*<sup>u</sup>*2) ∨ *μ<sup>B</sup>*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))} = (∨{*μ<sup>B</sup>*1 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))}) ∨ (∨{*μ<sup>B</sup>*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∩ *<sup>u</sup>*1*σ*2(*e*))}) =*<sup>o</sup> σ*1 + *σ*2 *μB*1 (*e*)(*<sup>u</sup>*1) ∪*<sup>o</sup> σ*1 + *σ*2 *<sup>μ</sup>B*2 (*e*)(*<sup>u</sup>*1). In addition, *<sup>o</sup>σ*1 + *σ*2 *γB*1∪*B*2 (*e*)(*<sup>u</sup>*1) = ∧{(*<sup>γ</sup>B*1 ∧ *γB*2 )(*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))} = ∧{ *γB*1 (*<sup>u</sup>*2) ∧ *γB*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))}

= (∧{*<sup>γ</sup>B*1 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))}) ∧ (∧{*<sup>γ</sup>B*2 (*<sup>u</sup>*2) : *u*2 ∈ (*<sup>u</sup>*1*σ*1(*e*) ∪ *<sup>u</sup>*1*σ*2(*e*))}) =*<sup>o</sup> σ*1 + *<sup>σ</sup>*2*γB*<sup>1</sup> (*e*)(*<sup>u</sup>*1) ∩*<sup>o</sup> σ*1 + *<sup>σ</sup>*2*γB*<sup>2</sup> (*e*)(*<sup>u</sup>*1). This shows that *<sup>o</sup>σ*1 + *<sup>σ</sup>*2*B*1∪*B*<sup>2</sup> =*<sup>o</sup> σ*1 + *<sup>σ</sup>*2*B*<sup>1</sup> ∪*<sup>o</sup> σ*1 + *<sup>σ</sup>*2*B*<sup>2</sup> . (6) The properties can be proved similarly to (5).

**Proposition 6.** *Let* (*<sup>σ</sup>*1, *<sup>A</sup>*),(*<sup>σ</sup>*2, *A*) *be two soft relations from U*1 *to U*2*, that is σ*1 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and σ*2 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) *and B*, *B*1, *B*2 ∈ *IF*(*<sup>U</sup>*2). *Then, the following properties hold: (1) If B*1 ⊆ *B*2 *then <sup>B</sup>*1*σ*1 + *<sup>σ</sup>*2*o*⊆*<sup>B</sup>*2 *σ*1 + *<sup>σ</sup>*2*o*;

 *(2) If B*1 ⊆ *B*2 *then <sup>B</sup>*1*σ*1 + *<sup>σ</sup>*2*<sup>o</sup>* ⊆*<sup>B</sup>*2 *σ*1 + *<sup>σ</sup>*2*<sup>o</sup>*; *(3) <sup>B</sup>*1∩*B*2*σ*1 + *<sup>σ</sup>*2*o* =*B*<sup>1</sup> *σ*1 + *<sup>σ</sup>*2*o* ∩*B*2 *σ*1 + *<sup>σ</sup>*2*o*; *(4) <sup>B</sup>*1∪*B*2*σ*1 + *<sup>σ</sup>*2*o* ⊇*<sup>B</sup>*1 *σ*1 + *<sup>σ</sup>*2*o* ∪*B*2 *σ*1 + *<sup>σ</sup>*2*o*; *(5) <sup>B</sup>*1∪*B*2*σ*1 + *<sup>σ</sup>*2*<sup>o</sup>* =*B*<sup>1</sup> *σ*1 + *<sup>σ</sup>*2*<sup>o</sup>* ∪*B*2 *σ*1 + *<sup>σ</sup>*2*<sup>o</sup>*; *(6) <sup>B</sup>*1∩*B*2*σ*1+ *<sup>σ</sup>*2*<sup>o</sup>* ⊆*<sup>B</sup>*1 *σ*1+ *<sup>σ</sup>*2*<sup>o</sup>* ∩*B*2 *σ*1+ *<sup>σ</sup>*2*o*.

**Proof.** The proof is similar to the proof of Proposition 5.

#### **4. Roughness of an Intuitionistic Fuzzy Set over Two Universes by Multi-Soft Relations**

In this section, we discuss the optimistic roughness of an IFS by multi-soft binary relations from *U*1 to *U*2 and approximate an IFS of universe *U*2 in universe *U*1 and an IFS *U*1 in *U*2 by using aftersets and foresets of soft binary relations, respectively. In this way, we obtain two intuitionistic fuzzy soft sets corresponding to IFSs in *<sup>U</sup>*2(*<sup>U</sup>*1). We also study some properties of these approximations.

**Definition 14.** *Let U*1 *and U*2 *be two non-empty finite universes, π be a family of soft binary relations from U*1 *to U*2. *Then, we say* (*<sup>U</sup>*1, *U*2, *π*) *the multigranulation generalized soft approximation space over two universes.*

**Definition 15.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2*, where π* = *σ*1, *σ*2, *σ*3, .....*σ<sup>m</sup> and B* = *μ<sup>B</sup>*, *<sup>γ</sup>B be an IFS in U*2*. Then, the optimistic lower approximation* <sup>Σ</sup>*mi*=1*σiBo* = -<sup>Σ</sup>*mi*=1*σiμ<sup>B</sup> o* , <sup>Σ</sup>*mi*=1*σiγ<sup>B</sup> o and the optimistic upper approximation <sup>o</sup>*Σ*mi*=1*σi<sup>B</sup>* = *<sup>o</sup>*Σ*mi*=1*σiμ<sup>B</sup>* ,*o* <sup>Σ</sup>*mi*=1*σiγ<sup>B</sup> of B* = *μ<sup>B</sup>*, *<sup>γ</sup>B are IF soft sets over U*1 *with respect to the aftersets of soft relations* (*<sup>σ</sup>i*, *A*) ∈ *π and are defined as:*

$$\begin{aligned} \underline{\sum\_{i=1}^{m} \sigma\_{i}^{\mu\_{B}}(\boldsymbol{c})(\boldsymbol{u}\_{1})} &= \begin{cases} \ \wedge \{ \mu\_{B}(\boldsymbol{u}\_{2}) : \boldsymbol{u}\_{2} \in \cup\_{i=1}^{m} \mu\_{1} \sigma\_{i}(\boldsymbol{c}) \}, & \text{if } \cup\_{i=1}^{m} \mu\_{1} \sigma\_{i}(\boldsymbol{c}) \neq \mathcal{O};\\ 1 & \text{otherwise;} \end{cases} \\\\ \underline{\sum}\_{i=1}^{m} \underline{\sigma\_{i}^{\gamma\_{B}}}(\boldsymbol{c})(\boldsymbol{u}\_{1}) &= \begin{cases} \ \vee \{ \gamma\_{B}(\boldsymbol{u}\_{2}) : \boldsymbol{u}\_{2} \in \cap\_{i=1}^{m} \mu\_{1} \sigma\_{i}(\boldsymbol{c}) \}, & \text{if } \cap\_{i=1}^{m} \mu\_{1} \sigma\_{i}(\boldsymbol{c}) \neq \mathcal{O};\\ 0 & \text{otherwise;} \end{cases} \end{aligned}$$

*and*

$${}^{o}\overline{\Sigma\_{i=1}^{m}\sigma\_{i}^{\mu\_{B}}}(e)(u\_{1}) = \left\{ \begin{array}{c} \vee \{\mu\_{B}(u\_{2}) : u\_{2} \in \cap\_{i=1}^{m}u\_{1}\sigma\_{i}(e)\}, & \text{if } \cap\_{i=1}^{m}u\_{1}\sigma\_{i}(e) \neq \bigcirc; \\ 0 & \text{otherwise;} \end{array} \right. \\\\ {}^{o}\overline{\Sigma\_{i=1}^{m}\sigma\_{i}^{\mu\_{B}}}(e)(u\_{1}) = \left\{ \begin{array}{c} \wedge \{\gamma\_{B}(u\_{2}) : u\_{2} \in \cup\_{i=1}^{m}u\_{1}\sigma\_{i}(e)\}, & \text{if } \cup\_{i=1}^{m}u\_{1}\sigma\_{i}(e) \neq \bigcirc; \\ 1 & \text{otherwise;} \end{array} \right. \\\\ \left. \end{array} \right.$$

*where <sup>u</sup>*1*σi*(*e*) = {*<sup>u</sup>*2 ∈ *U*2 : (*<sup>u</sup>*1, *<sup>u</sup>*2) ∈ *<sup>σ</sup>i*(*e*)} *are called the aftersets of u*1 *for u*1 ∈ *U*1 *and e* ∈ *A. Obviously,* (Σ*mi*=1*σiBo* , *A*) *and* (*<sup>o</sup>*Σ*mi*=1*σiB*, *A*) *are two IFS soft sets over U*1.

**Definition 16.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2, *where π* = *σ*1, *σ*2, *σ*3, .....*σ<sup>m</sup> and B* = *μ<sup>B</sup>*, *<sup>γ</sup>B be an IFS in U*1*. Then, the optimistic lower approximation <sup>B</sup>*Σ*mi*=1*<sup>σ</sup>io* = *<sup>μ</sup>B*<sup>Σ</sup>*mi*=1*<sup>σ</sup>io*,*γ<sup>B</sup>* <sup>Σ</sup>*mi*=1*<sup>σ</sup>io and the optimistic upper*

*approximation <sup>B</sup>*Σ*mi*=1*σi<sup>o</sup>* = *<sup>μ</sup>B*<sup>Σ</sup>*mi*=1*σi<sup>o</sup>*,*γ<sup>B</sup>* <sup>Σ</sup>*mi*=1*σi<sup>o</sup> of B* = *μ<sup>B</sup>*, *<sup>γ</sup>B are IF soft sets over U*2 *with respect to the foresets of soft relations* (*<sup>σ</sup>i*, *A*) ∈ *π and are defined as:*

$$\begin{aligned} \upharpoonright \underline{\nu\_{i=1}} \underline{\sigma\_{i}}\_{o}(\mathfrak{e})(\mathfrak{u}\_{2}) &= \left\{ \begin{array}{c} \wedge \{\mu\_{\mathcal{B}}(\mathfrak{u}\_{1}) : \mathsf{u}\_{1} \in \cup\_{i=1}^{m} \mathsf{e}\_{i}(\mathfrak{e})\mathfrak{u}\_{2} \}, & \text{if } \cup\_{i=1}^{m} \mathsf{e}\_{i}(\mathfrak{e})\mathfrak{u}\_{2} \neq \mathcal{O};\\ 1 & \text{otherwise;} \end{array} \right. \\\\ \upharpoonright \underline{\nu\_{\mathcal{B}}} \underline{\sum}\_{i=1}^{m} \underline{\sigma\_{i}}\_{o}(\mathfrak{e})(\mathfrak{u}\_{2}) &= \left\{ \begin{array}{c} \vee \{\gamma\_{\mathcal{B}}(\mathfrak{u}\_{1}) : \mathsf{u}\_{1} \in \cap\_{i=1}^{m} \mathsf{e}\_{i}(\mathfrak{e})\mathfrak{u}\_{2} \}, & \text{if } \cap\_{i=1}^{m} \mathsf{e}\_{i}(\mathfrak{e})\mathfrak{u}\_{2} \neq \mathcal{O};\\ 0 & \text{otherwise;} \end{array} \right. \end{aligned}$$

*and*

$${}^{\mu\_{B}}\overline{\Sigma\_{i=1}^{m}\sigma\_{i}^{\upsilon}}(\mathfrak{e})(\mathfrak{u}\_{2}) = \left\{ \begin{array}{c} \vee \{\mu\_{B}(\mathfrak{u}\_{1}) : \mathsf{u}\_{1} \in \cap\_{i=1}^{m}\sigma\_{i}(\mathfrak{e})\mathfrak{u}\_{2} \}, & \mbox{if } \cap\_{i=1}^{m}\sigma\_{i}(\mathfrak{e})\mathfrak{u}\_{2} \neq \mathcal{O}; \\ 0 & \mbox{otherwise;} \end{array} \right. \\ \left. \begin{array}{c} \left.\right| \begin{array}{c} \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.\right| \left.$$

$$\gamma\_B \overline{\Sigma\_{i=1}^m \sigma\_i^o}(\mathfrak{e})(\mathfrak{u}\_2) = \left\{ \begin{array}{c} \wedge \{\gamma\_B(\mathfrak{u}\_1) : \mathfrak{u}\_1 \in \cup\_{i=1}^m \sigma\_i(\mathfrak{e})\mathfrak{u}\_2\}, & \text{if } \cup\_{i=1}^m \sigma\_i(\mathfrak{e})\mathfrak{u}\_2 \neq \mathcal{O};\\ 1 & \text{otherwise}, \end{array} \right.$$

*where <sup>σ</sup>*1(*e*)*<sup>u</sup>*2 = {*<sup>u</sup>*1 ∈ *U*1 : (*<sup>u</sup>*1, *<sup>u</sup>*2) ∈ *<sup>σ</sup>i*(*e*)} *are called the foresets of u*2 *for u*2 ∈ *U*2 *and e* ∈ *A. Obviously,* (*<sup>B</sup>*Σ*mi*=1*<sup>σ</sup>io*, *A*) *and* (*<sup>B</sup>*Σ*mi*=1*σi<sup>o</sup>*, *A*) *are two IFS soft sets over U*2.

Moreover, <sup>Σ</sup>*mi*=1*σiBo* : *A* → *IF*(*<sup>U</sup>*1),*<sup>o</sup>* <sup>Σ</sup>*mi*=1*σi<sup>B</sup>* : *A* → *IF*(*<sup>U</sup>*1) and *<sup>B</sup>*Σ*mi*=1*<sup>σ</sup>io* : *A* → *IF*(*<sup>U</sup>*2),*<sup>B</sup>* <sup>Σ</sup>*mi*=1*σi<sup>o</sup>* : *A* → *IF*(*<sup>U</sup>*2).

**Proposition 7.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2 *and B* = *μ<sup>B</sup>*, *<sup>γ</sup>B be an IFS in U*2*. Then, the following properties for* <sup>Σ</sup>*mi*=1*σiBo*,*o* <sup>Σ</sup>*mi*=1*σi<sup>B</sup> hold:*

$$\overset{\cdot}{\underset{\left(2\right)}{\rightleftharpoons}} \overset{\cdot}{\underset{\left(1\right)}{\rightleftharpoons}} \overset{\cdot}{\sigma\_{i-1}^{\underset{\left(1\right)}{\rightleftharpoons}}} \overset{\cdot}{\underset{\left(1\right)}{\rightleftharpoons}} \overset{\cdots}{\underset{\left(1\right)}{\rightleftharpoons}} \overset{\cdots}{\underset{\left(1\right)}{\rightleftharpoons}} \overset{\cdots}{\underset{\left(1\right)}{\rightleftharpoons}} \overset{\cdots}{\underset{\left(1\right)}{\rightleftharpoons}} \overset{\cdots}{\underset{\left(1\right)}{\rightleftharpoons}} \overset{\cdots}{\underset{\left(1\right)}{\rightleftharpoons}} \overset{\cdots}{\underset{\left(1\right)}{\rightleftharpoons}} \dots$$

**Proof.** The proof is similar to the proof of Proposition 1.

**Proposition 8.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2 *and B* = *μ<sup>B</sup>*, *<sup>γ</sup>B be an IFS in U*1*. Then, the following properties for <sup>B</sup>*Σ*mi*=1*<sup>σ</sup>io*,*<sup>B</sup>* <sup>Σ</sup>*mi*=1*σi<sup>o</sup> hold:*

$$\overset{\scriptstyle \mathbf{m} = 1 \cdots \mathbf{0}}{\mathbf{(1)}}\_{B} \overset{\scriptstyle \mathbf{\mathcal{T}}^{m}\_{i=1} \sigma\_{i}}{\overset{\scriptstyle \mathbf{\mathcal{T}}^{m}\_{i=1} \sigma\_{i}}} \overset{\scriptstyle \mathbf{\mathcal{T}}^{m}}{\overset{\scriptstyle \mathbf{\mathcal{T}}^{m}\_{i=1} \sigma\_{i}}{\mathbf{\mathcal{T}}^{m}\_{i=1} \sigma\_{i}} \overset{\scriptstyle \mathbf{\mathcal{T}}^{m}}{\subseteq} \overset{\scriptstyle \mathbf{\mathcal{T}}^{m}}{\wedge\_{i=1}^{m} \mathbf{B} \overline{\sigma\_{i}}}{\mathbf{\mathcal{T}}^{m}\_{i}}.$$

**Proof.** The proof is similar to the proof of Proposition 2.

**Proposition 9.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2*. Then, the following properties with respect to the aftersets hold:*

*(1)* <sup>Σ</sup>*mi*=1*σi*1*U*<sup>2</sup> *o* = <sup>1</sup>*U*1 *for all e* ∈ *A*; *(2) <sup>o</sup>*Σ*mi*=1*σi*1*U*<sup>2</sup> = <sup>1</sup>*U*1 *if* <sup>∩</sup>*mi*=1*u*1*σi*(*e*) = ∅ *and* <sup>∪</sup>*mi*=1*u*1*σi*(*e*) = ∅, *for some i* ≤ *m*; *(3)* <sup>Σ</sup>*mi*=1*σi*0*U*<sup>2</sup> *o* = <sup>0</sup>*U*1 *if* <sup>∪</sup>*mi*=1*u*1*σi*(*e*) = ∅ *and* <sup>∩</sup>*mi*=1*u*1*σi*(*e*) = ∅ *, for some i* ≤ *m*; *<sup>o</sup>*Σ*mi*=1*σi*0*U*<sup>2</sup> = <sup>0</sup>*U*1 *for all e* ∈ *A*.

**Proof.** The proof is similar to the proof of Proposition 3.

**Proposition 10.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2*. Then, the following properties with respect to the foresets hold:*

$$\begin{array}{ll}(1)\ ^{1\downarrow\_{l\_1}}\Sigma\_{\stackrel{i=1}{i=1}}^{m}\sigma\_{\stackrel{i}{i}} = 1\_{l\downarrow\_{2}}\text{ for all }e \in A;\\(2)\ ^{1\downarrow\_{l\_1}}\overline{\Sigma\_{\stackrel{i=1}{i=1}}^{m}\sigma\_{\stackrel{i}{i}}}^{0} = 1\_{l\downarrow\_{2}}\text{ if }\cap\_{i=1}^{m}\sigma\_{\stackrel{i}{i}}(e)u\_{2} \neq \oslash a \text{ and }\cup\_{i=1}^{m}\sigma\_{\stackrel{i}{i}}(e)u\_{2} \neq \oslash \Box\_{i}\text{ for some }i \le m;\end{array}$$

$$\begin{array}{l}(3)\ ^{0\_{\mathcal{U}\_{1}}}\Sigma\_{i=1}^{m}\sigma\_{i} = 0\_{\mathcal{U}\_{2}}\acute{\boldsymbol{\mu}}\cup\_{i=1}^{m}\sigma\_{i}(\boldsymbol{e})\boldsymbol{u}\_{2}\neq \bigotimes\mathop{\boldsymbol{and}}\cap\_{i=1}^{m}\sigma\_{i}(\boldsymbol{e})\boldsymbol{u}\_{2}\neq \bigotimes\mathop{\boldsymbol{.}}\boldsymbol{e}\_{i}\text{ for some i}\leq m;\\(4)\ ^{0\_{\mathcal{U}\_{1}}}\overline{\sum\_{i=1}^{m}\sigma\_{i}^{2}}\overset{\boldsymbol{\sigma}}{=} 0\_{\mathcal{U}\_{2}}\acute{\boldsymbol{\mu}}\text{ for all }\boldsymbol{e}\in A.\end{array}$$

**Proof.** The proof is similar to the proof of Proposition 4.

**Proposition 11.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2 *and B*, *B*1, *B*2 ∈ *IF*(*<sup>U</sup>*2). *Then, the following properties for* <sup>Σ</sup>*mi*=1*σiBo*,

*<sup>o</sup>*Σ*mi*=1*σi<sup>B</sup> with respect the aftersets hold: (1) If B*1 ⊆ *B*2 *then* <sup>Σ</sup>*mi*=1*σiB*<sup>1</sup> *o* ⊆ <sup>Σ</sup>*mi*=1*σiB*<sup>2</sup> *o* ; *(2) If B*1 ⊆ *B*2 *then <sup>o</sup>*Σ*mi*=1*σiB*<sup>1</sup> ⊆*o* <sup>Σ</sup>*mi*=1*σiB*<sup>2</sup> ; *(3)* <sup>Σ</sup>*mi*=1*σiB*1∩*B*<sup>2</sup> *o* = <sup>Σ</sup>*mi*=1*σiB*<sup>1</sup> *o* ∩ <sup>Σ</sup>*mi*=1*σiB*<sup>2</sup> *o* ; *(4)* <sup>Σ</sup>*mi*=1*σiB*1∪*B*<sup>2</sup> *o* ⊇ <sup>Σ</sup>*mi*=1*σiB*<sup>1</sup> *o* ∪ <sup>Σ</sup>*mi*=1*σiB*<sup>2</sup> *o* ; *(5) <sup>o</sup>*Σ*mi*=1*σiB*1∪*B*<sup>2</sup> =*<sup>o</sup>* <sup>Σ</sup>*mi*=1*σiB*<sup>1</sup> ∪*<sup>o</sup>* <sup>Σ</sup>*mi*=1*σiB*<sup>2</sup> ; *(6) <sup>o</sup>*Σ*mi*=1*σiB*1∩*B*<sup>2</sup> ⊆*o* <sup>Σ</sup>*mi*=1*σiB*<sup>1</sup> ∩*<sup>o</sup>* <sup>Σ</sup>*mi*=1*σiB*<sup>2</sup> .

**Proof.** The proof is similar to the proof of Proposition 5.

**Proposition 12.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2 *and B*, *B*1, *B*2 ∈ *IF*(*<sup>U</sup>*1). *Then, the following properties for <sup>B</sup>*Σ*mi*=1*<sup>σ</sup>io*,

*<sup>B</sup>*Σ*mi*=1*σi<sup>o</sup>with respect the foresets hold: (1) If B*1 ⊆ *B*2 *then <sup>B</sup>*1<sup>Σ</sup>*mi*=1*<sup>σ</sup>io* ⊆*<sup>B</sup>*2 <sup>Σ</sup>*mi*=1*<sup>σ</sup>io*; *(2) If B*1 ⊆ *B*2 *then <sup>B</sup>*1<sup>Σ</sup>*mi*=1*σi<sup>o</sup>* ⊆*<sup>B</sup>*2 <sup>Σ</sup>*mi*=1*σi<sup>o</sup>*; *(3) <sup>B</sup>*1∩*B*2<sup>Σ</sup>*mi*=1*<sup>σ</sup>io* =*B*<sup>1</sup> <sup>Σ</sup>*mi*=1*<sup>σ</sup>io* ∩*B*2 <sup>Σ</sup>*mi*=1*<sup>σ</sup>io*; *(4) <sup>B</sup>*1∪*B*2<sup>Σ</sup>*mi*=1*<sup>σ</sup>io* ⊇*<sup>B</sup>*1 <sup>Σ</sup>*mi*=1*<sup>σ</sup>io* ∪*B*2 <sup>Σ</sup>*mi*=1*<sup>σ</sup>io*; *(5) <sup>B</sup>*1∪*B*<sup>2</sup>Σ*mi*=1*σi<sup>o</sup>* =*B*<sup>1</sup> <sup>Σ</sup>*mi*=1*σi<sup>o</sup>* ∪*<sup>B</sup>*<sup>2</sup> <sup>Σ</sup>*mi*=1*σi<sup>o</sup>*; *(6) <sup>B</sup>*1∩*B*2<sup>Σ</sup>*mi*=1*σi<sup>o</sup>* ⊆*<sup>B</sup>*1 <sup>Σ</sup>*mi*=1*σi<sup>o</sup>* ∩*B*2 <sup>Σ</sup>*mi*=1*σi<sup>o</sup>*.

**Proof.** The proof is similar to the proof of Proposition 6.

**Proposition 13.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2 *and B*1, *B*2, *B*3, ...*Bn* ∈ *IF*(*<sup>U</sup>*2), *and B*1 ⊆ *B*2 ⊆ *B*3 ⊆ ... ⊆ *Bn*. *Then, the following properties with respect the aftersets hold:*

.

$$\begin{array}{c} \text{(1)} \ \underbrace{\Sigma^{m}\_{i=1}\sigma^{B\_{1}}\_{i}}\_{\mathcal{O}\left(\sum\_{i=1}^{m}\sigma^{B\_{1}}\_{i}\right)}\subseteq\limits\_{\iota=1}^{\operatorname{\bf{m}}}\sigma^{B\_{2}}\_{i}\subseteq\mathop{\Sigma^{m}\_{i=1}}\_{i=1}\sigma^{B\_{3}}\_{i}\subseteq\dots\dots\subseteq\mathop{\Sigma^{m}\_{i=1}}\_{i=1}\sigma^{B\_{n}}\_{i};\\ \text{(2)}\ \operatorname{\bf{\iota}^{\alpha}\sum}\_{i=1}^{m}\sigma^{\mathcal{O}\_{1}}\_{i}\subseteq\mathop{\mathcal{C}^{\alpha}}\_{i=1}\sigma^{B\_{1}}\_{i}\subseteq\dots\cdots\cdots\subseteq\mathop{\mathcal{C}^{\alpha}}\_{i=1}\sum\_{i=1}^{m}\sigma^{B\_{n}}\_{i}.\end{array}$$

**Proof.** The proof is similar to the proof of Proposition 5.

**Proposition 14.** *Let* (*<sup>U</sup>*1, *U*2, *π*) *be the multigranulation generalized soft approximation space over two universes U*1 *and U*2 *and B*1, *B*2, *B*3, ...*Bn* ∈ *IF*(*<sup>U</sup>*1), *and B*1 ⊆ *B*2 ⊆ *B*3 ⊆ ... ⊆ *Bn*. *Then, the following properties with respect the foresets hold:*

$$\begin{array}{c} (1) \ ^{B\_{1}}\underline{\sum\prime\_{i=1}^{m}\sigma\_{i}}\underline{\sigma}\_{i}\underline{\mathop{\subseteq}}\_{i}\underline{\mathop{\cdots}}\_{i=1}^{B\_{2}}\underline{\sum\prime\_{i=1}^{m}\sigma\_{i}}\underline{\mathop{\cdots}}\_{i=1}^{B\_{3}}\underline{\mathop{\cdots}}\_{i=1}^{m}\underline{\sigma}\_{i}\underline{\mathop{\cdots}}\_{i=1}^{\widetilde{\phantom{\cdots}}\_{i=1}^{m}\sigma\_{i}}\underline{\mathop{\cdots}}\_{i=1}^{\widetilde{\phantom{\cdots}}\_{i=1}^{m}\sigma\_{i}}\underline{\mathop{\cdots}}\_{i=1}^{\widetilde{\phantom{\cdots}}\_{i=1}^{m}\sigma\_{i}}\underline{\mathop{\cdots}}\_{i=1}^{\widetilde{\phantom{\cdots}}\_{i=1}^{m}\sigma\_{i}}\underline{\mathop{\cdots}}\_{i=1}^{\widetilde{\phantom{\cdots}}\_{i=1}^{m}\sigma\_{i}}. \end{array}$$

**Proof.** The proof is similar to the proof of Proposition 6.

#### **5. Application in Decision-Making Problem**

Decision making is a major area of study in almost all types of data analysis. To select effective alternatives from aspirants is the process of decision making. Since our environment is becoming changeable and complicated day by day and the decision-making process proposed by a single expert is no longer good, therefore, a decision-making algorithm

based on consensus by using collective wisdom is a better approach. From imprecise multi-observer data, Maji et al. [71] proposed a useful technique of object recognition. Feng et al. [72] pointed out errors in Maji et al. [71] and rebuilt a framework correctly. Shabir et al. [63] presented MGRS model based on soft relations by using crisp sets and proposed a decision-making algorithm. Jamal and Shabir [64] presented a decision-making algorithm by using the OMGRS model in terms of FS based on soft relations. This paper extends Jamal's OMGFRS model and presents the decision-making method based on multi-soft relations by use of OMGIFRS.

The lower and upper approximations are the closest to approximated subsets of a universe. We obtain two corresponding values Σ*m <sup>i</sup>*=1*σ<sup>i</sup> B o* (*ej*)(*xk*) and *o*Σ*m <sup>i</sup>*=1*σ<sup>i</sup> B* (*ej*)(*xk*) with respect to the afterset to the decision alternative *xk* ∈ *U*1 by the IF soft lower and upper approximations of an IF *B* ∈ *IF*(*<sup>U</sup>*2).

We present Algorithms 1 and 2 for our proposed model here.

#### **Algorithm 1:** Aftersets for decision-making problem

(1) Compute the optimistic multigranulation lower IF soft set approximation Σ*m <sup>i</sup>*=1*σ<sup>i</sup> B o* and optimistic multigranulation upper IF soft set approximation *o*Σ*m <sup>i</sup>*=1*σ<sup>i</sup> B* of an IF set

*B* = *μ<sup>B</sup>*, *<sup>γ</sup>B* with respect to the aftersets;

(2) Compute the score values for each of the entries of the Σ*m <sup>i</sup>*=1*σ<sup>i</sup> B o* and *o*Σ*m <sup>i</sup>*=1*σ<sup>i</sup> B* and denote them by *Sij*(*xi*,*ej*) and *Sij*(*xi*,*ej*) for all *i*, *j*;

(3) Compute the aggregated score *<sup>S</sup>*(*xi*) = *n* ∑ *j*=1 *Sij*(*xi*,*ej*) and *<sup>S</sup>*(*xi*) = *n* ∑ *j*=1 *Sij*(*xi*,*ej*);

(4) Compute *<sup>S</sup>*(*xi*) = *<sup>S</sup>*(*xi*) + *<sup>S</sup>*(*xi*);


$$\text{(7) Compute } H(\mathbf{x}\_k) = \sum\_{j=1}^{n} \underline{H}\_{kj}(\mathbf{x}\_{k'} \boldsymbol{\varepsilon}\_j) + \sum\_{j=1}^{n} \overline{H}\_{kj}(\mathbf{x}\_{k'} \boldsymbol{\varepsilon}\_j) \text{ for } k = k\_1, k\_2;$$

(8) If *<sup>H</sup>*(*xk*1 ) > *<sup>H</sup>*(*xk*2 ), then we select *xk*1;

(9) If *<sup>H</sup>*(*xk*1 ) = *<sup>H</sup>*(*xk*2 ), then select any one of *xk*1 and *xk*2 .

#### **Algorithm 2:** Foresets for decision-making problem

(1) Compute the optimistic multigranulation lower IF soft set approximation *<sup>B</sup>*Σ*m <sup>i</sup>*=1*σ<sup>i</sup> B o* and upper multigranulation IF soft set approximation *<sup>B</sup>*Σ*m <sup>i</sup>*=1*σ<sup>i</sup> o* of an IF set *B* = *μ<sup>B</sup>*, *<sup>γ</sup>B* with respect to the foresets;

(2) Compute the score values for each of the entries of the *<sup>B</sup>*Σ*m <sup>i</sup>*=1*σ<sup>i</sup> B o* and *<sup>B</sup>*Σ*m <sup>i</sup>*=1*σ<sup>i</sup> o* and denote them by *Sij*(*xi*,*ej*) and *Sij*(*xi*,*ej*) for all *i*, *j*;

(3) Compute the aggregated score *<sup>S</sup>*(*xi*) = *n* ∑ *j*=1 *Sij*(*xi*,*ej*) and *<sup>S</sup>*(*xi*) = *n* ∑ *j*=1 *Sij*(*xi*,*ej*);

$$\text{(4) Compute } S(\mathfrak{x}\_{i}) = \underline{S}(\mathfrak{x}\_{i}) + \underline{S}(\mathfrak{x}\_{i});$$

(5) The best decision is *xk* = max*i <sup>S</sup>*(*xi*);

(6) If *k* has more than one value, say *k*1, *k*2, then we calculate the accuracy values *Hij*(*xi*,*ej*) and *Hij*(*xi*,*ej*) for only those *xk* for which *<sup>S</sup>*(*xk*) are equal;

$$\begin{aligned} \text{(7) Compute } H(\mathbf{x}\_k) &= \sum\_{j=1}^n \underline{H}\_{kj}(\mathbf{x}\_k, \mathbf{c}\_j) + \sum\_{j=1}^n \overline{H}\_{kj}(\mathbf{x}\_k, \mathbf{c}\_j) \text{ for } k = k\_1, k\_2;\\ \text{(8) If } H(\mathbf{x}\_{k\_1}) &> H(\mathbf{x}\_{k\_2}) \text{ then we select } \mathbf{x}\_{k\_1}.\\ \text{(9) If } H(\mathbf{x}\_{k\_1}) &= H(\mathbf{x}\_{k\_2}) \text{ then select any one of } \mathbf{x}\_{k\_1} \text{ and } \mathbf{x}\_{k\_2}.\end{aligned}$$

Now, we show the proposed approach of decision making step by step by using following example. The following example discusses an algorithm to make a wise decision for the selection of a car.

**Example 3.** *Suppose a multi-national company wants to select a best officer and there are 10 short-listed applicants which are categorized in two groups, platinum and diamond. The set U*1 = {*<sup>m</sup>*1, *m*2, *m*3, *m*4, *m*5, *<sup>m</sup>*6} *represents the applicants of platinum group and U*2 = {*<sup>c</sup>*1, *c*2, *c*3, *<sup>c</sup>*4} *represents the applicants of diamond group. Let A* = {*<sup>e</sup>*1,*e*2,*e*3} =*{e1=education,e2=experience, e3=computer knowledge} be the set of parameters. Let two different teams of interviewers analyze and compare the competencies of these applicants.*

We have *σ*1 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) represent the comparison of the first-interviewer team defined by

*<sup>c</sup>*1)},

*<sup>σ</sup>*1(*<sup>e</sup>*1) = {(*<sup>m</sup>*1, *<sup>c</sup>*1),(*<sup>m</sup>*1, *<sup>c</sup>*2),(*<sup>m</sup>*2, *<sup>c</sup>*2),(*<sup>m</sup>*2, *<sup>c</sup>*4),(*<sup>m</sup>*4, *<sup>c</sup>*2),(*<sup>m</sup>*4, *<sup>c</sup>*3),(*<sup>m</sup>*5, *<sup>c</sup>*3),(*<sup>m</sup>*5, *<sup>c</sup>*4),(*<sup>m</sup>*6, *<sup>σ</sup>*1(*<sup>e</sup>*2) = {(*<sup>m</sup>*1, *<sup>c</sup>*1),(*<sup>m</sup>*2, *<sup>c</sup>*3),(*<sup>m</sup>*4, *<sup>c</sup>*1),(*<sup>m</sup>*5, *<sup>c</sup>*1),(*<sup>m</sup>*6, *<sup>c</sup>*2),(*<sup>m</sup>*6, *<sup>c</sup>*3)}, and *<sup>σ</sup>*1(*<sup>e</sup>*3) = {(*<sup>m</sup>*1, *<sup>c</sup>*1),(*<sup>m</sup>*2, *<sup>c</sup>*4),(*<sup>m</sup>*3, *<sup>c</sup>*1),(*<sup>m</sup>*3, *<sup>c</sup>*3),(*<sup>m</sup>*4, *<sup>c</sup>*1),(*<sup>m</sup>*5, *<sup>c</sup>*3),(*<sup>m</sup>*5, *<sup>c</sup>*4)},

> where *<sup>σ</sup>*1(*<sup>e</sup>*1) compares the education of applicants, *<sup>σ</sup>*1(*<sup>e</sup>*2) compares the experience of applicants, *<sup>σ</sup>*1(*<sup>e</sup>*3) compares the computer knowledge of applicants.

> Similarly, *σ*2 : *A* → *<sup>P</sup>*(*<sup>U</sup>*1 × *<sup>U</sup>*2) represent the comparison of the second-interviewer team defined by

$$\begin{array}{rclcrcl}\sigma\_{2}(\mathsf{c}\_{1})&=&\{\{(m\_{1},\mathsf{c}\_{1}),(m\_{1},\mathsf{c}\_{2}),(m\_{2},\mathsf{c}\_{3}),(m\_{3},\mathsf{c}\_{4}),(m\_{4},\mathsf{c}\_{2}),(m\_{5},\mathsf{c}\_{2}),(m\_{6},\mathsf{c}\_{3})\},\\\sigma\_{2}(\mathsf{c}\_{2})&=&\{\{(m\_{1},\mathsf{c}\_{1}),(m\_{3},\mathsf{c}\_{2}),(m\_{4},\mathsf{c}\_{1}),(m\_{6},\mathsf{c}\_{4})\},\\\text{and }\sigma\_{2}(\mathsf{c}\_{3})&=&\{(m\_{1},\mathsf{c}\_{1}),(m\_{1},\mathsf{c}\_{3}),(m\_{2},\mathsf{c}\_{2}),(m\_{2},\mathsf{c}\_{3}),(m\_{4},\mathsf{c}\_{1}),(m\_{5},\mathsf{c}\_{4}),(m\_{6},\mathsf{c}\_{4})\},\end{array}$$

where *<sup>σ</sup>*2(*<sup>e</sup>*1) compares the education of applicants, *<sup>σ</sup>*2(*<sup>e</sup>*2) compares the experience of applicants, *<sup>σ</sup>*2(*<sup>e</sup>*3) compares the computer knowledge of applicants.

From these comparisons, we obtain two soft relations from *U*1 to *U*2. Now, the aftersets

*<sup>m</sup>*1*σ*1(*<sup>e</sup>*1) = {*<sup>c</sup>*1, *<sup>c</sup>*2}, *<sup>m</sup>*2*σ*1(*<sup>e</sup>*1) = {*<sup>c</sup>*2, *<sup>c</sup>*4}, *<sup>m</sup>*3*σ*1(*<sup>e</sup>*1) = ∅, *<sup>m</sup>*4*σ*1(*<sup>e</sup>*1) = {*<sup>c</sup>*2, *<sup>c</sup>*3}, *<sup>m</sup>*5*σ*1(*<sup>e</sup>*1) = {*<sup>c</sup>*3, *<sup>c</sup>*4}, *<sup>m</sup>*6*σ*1(*<sup>e</sup>*1) = {*<sup>c</sup>*1} and *<sup>m</sup>*1*σ*1(*<sup>e</sup>*2) = {*<sup>c</sup>*1}, *<sup>m</sup>*2*σ*1(*<sup>e</sup>*2) = {*<sup>c</sup>*3}, *<sup>m</sup>*3*σ*1(*<sup>e</sup>*2) = ∅, *<sup>m</sup>*4*σ*1(*<sup>e</sup>*2) = {*<sup>c</sup>*1}, *<sup>m</sup>*5*σ*1(*<sup>e</sup>*2) = {*<sup>c</sup>*1}, *<sup>m</sup>*6*σ*1(*<sup>e</sup>*2) = {*<sup>c</sup>*2, *<sup>c</sup>*3}, and *<sup>m</sup>*1*σ*1(*<sup>e</sup>*3) = {*<sup>c</sup>*1}, *<sup>m</sup>*2*σ*1(*<sup>e</sup>*3) = {*<sup>c</sup>*4}, *<sup>m</sup>*3*σ*1(*<sup>e</sup>*3) = {*<sup>c</sup>*1, *<sup>c</sup>*3}, *<sup>m</sup>*4*σ*1(*<sup>e</sup>*3) = {*<sup>c</sup>*1}, *<sup>m</sup>*5*σ*1(*<sup>e</sup>*3) = {*<sup>c</sup>*3, *<sup>c</sup>*4}, *<sup>m</sup>*6*σ*1(*<sup>e</sup>*3) = ∅, and *<sup>m</sup>*1*σ*2(*<sup>e</sup>*1) = {*<sup>c</sup>*1, *<sup>c</sup>*2}, *<sup>m</sup>*2*σ*2(*<sup>e</sup>*1) = {*<sup>c</sup>*3}, *<sup>m</sup>*3*σ*2(*<sup>e</sup>*1) = {*<sup>c</sup>*4}, *<sup>m</sup>*4*σ*2(*<sup>e</sup>*1) = {*<sup>c</sup>*2}, *<sup>m</sup>*5*σ*2(*<sup>e</sup>*1) = {*<sup>c</sup>*2}, *<sup>m</sup>*6*σ*2(*<sup>e</sup>*1) = {*<sup>c</sup>*3} and *<sup>m</sup>*1*σ*2(*<sup>e</sup>*2) = {*<sup>c</sup>*1}, *<sup>m</sup>*2*σ*2(*<sup>e</sup>*2) = ∅, *<sup>m</sup>*3*σ*2(*<sup>e</sup>*2) = {*<sup>c</sup>*2}, *<sup>m</sup>*4*σ*2(*<sup>e</sup>*2) = {*<sup>c</sup>*1}, *<sup>m</sup>*5*σ*2(*<sup>e</sup>*2) = ∅, *<sup>m</sup>*6*σ*2(*<sup>e</sup>*2) = {*<sup>c</sup>*4}, and *<sup>m</sup>*1*σ*2(*<sup>e</sup>*3) = {*<sup>c</sup>*1, *<sup>c</sup>*3}, *<sup>m</sup>*2*σ*2(*<sup>e</sup>*3) = {*<sup>c</sup>*2, *<sup>c</sup>*3}, *<sup>m</sup>*3*σ*2(*<sup>e</sup>*3) = ∅, *<sup>m</sup>*4*σ*2(*<sup>e</sup>*3) = {*<sup>c</sup>*1}, *<sup>m</sup>*5*σ*2(*<sup>e</sup>*3) = {*<sup>c</sup>*4}, *<sup>m</sup>*6*σ*2(*<sup>e</sup>*3) = {*<sup>c</sup>*4},

where *mi<sup>σ</sup>j*(*<sup>e</sup>*1) represents all those applicants of the diamond group whose education is equal to *mi*, *mi<sup>σ</sup>j*(*<sup>e</sup>*2) represents all those applicants of the diamond group whose experience is equal to *mi* and *mi<sup>σ</sup>j*(*<sup>e</sup>*3) represents all those applicants of the diamond group whose computer knowledge is equal to *mi*. In addition, foresets

*<sup>σ</sup>*1(*<sup>e</sup>*1)*<sup>c</sup>*1 = {*<sup>m</sup>*1, *<sup>m</sup>*6}, *<sup>σ</sup>*1(*<sup>e</sup>*1)*<sup>c</sup>*2 = {*<sup>m</sup>*1, *m*2, *<sup>m</sup>*4}, *<sup>σ</sup>*1(*<sup>e</sup>*1)*<sup>c</sup>*3 = {*<sup>m</sup>*4, *<sup>m</sup>*5}, *<sup>σ</sup>*1(*<sup>e</sup>*1)*<sup>c</sup>*4 = {*<sup>m</sup>*2, *<sup>m</sup>*5}, and *<sup>σ</sup>*1(*<sup>e</sup>*2)*<sup>c</sup>*1 = {*<sup>m</sup>*1, *m*4, *<sup>m</sup>*5}, *<sup>σ</sup>*1(*<sup>e</sup>*2)*<sup>c</sup>*2 = {*<sup>m</sup>*6}, *<sup>σ</sup>*1(*<sup>e</sup>*2)*<sup>c</sup>*3 = {*<sup>m</sup>*2, *<sup>m</sup>*6}, *<sup>σ</sup>*1(*<sup>e</sup>*2)*<sup>c</sup>*4 = ∅, and *<sup>σ</sup>*1(*<sup>e</sup>*3)*<sup>c</sup>*1 = {*<sup>m</sup>*1, *m*3, *<sup>m</sup>*4}, *<sup>σ</sup>*1(*<sup>e</sup>*3)*<sup>c</sup>*2 = ∅, *<sup>σ</sup>*1(*<sup>e</sup>*3)*<sup>c</sup>*3 = {*<sup>m</sup>*3, *<sup>m</sup>*5}, *<sup>σ</sup>*1(*<sup>e</sup>*3)*<sup>c</sup>*4 = {*<sup>m</sup>*2, *<sup>m</sup>*5}. *<sup>σ</sup>*2(*<sup>e</sup>*1)*<sup>c</sup>*1 = {*<sup>m</sup>*1}, *<sup>σ</sup>*2(*<sup>e</sup>*1)*<sup>c</sup>*2 = {*<sup>m</sup>*1, *m*4, *<sup>m</sup>*5}, *<sup>σ</sup>*2(*<sup>e</sup>*1)*<sup>c</sup>*3 = {*<sup>m</sup>*2, *<sup>m</sup>*6}, *<sup>σ</sup>*2(*<sup>e</sup>*1)*<sup>c</sup>*4 = {*<sup>m</sup>*3}, and *<sup>σ</sup>*2(*<sup>e</sup>*2)*<sup>c</sup>*1 = {*<sup>m</sup>*1, *<sup>m</sup>*4}, *<sup>σ</sup>*2(*<sup>e</sup>*2)*<sup>c</sup>*2 = {*<sup>m</sup>*3}, *<sup>σ</sup>*2(*<sup>e</sup>*2)*<sup>c</sup>*3 = ∅, *<sup>σ</sup>*2(*<sup>e</sup>*2)*<sup>c</sup>*4 = {*<sup>m</sup>*6}, and *<sup>σ</sup>*2(*<sup>e</sup>*3)*<sup>c</sup>*1 = {*<sup>m</sup>*1, *<sup>m</sup>*4}, *<sup>σ</sup>*2(*<sup>e</sup>*3)*<sup>c</sup>*2 = {*<sup>m</sup>*2}, *<sup>σ</sup>*1(*<sup>e</sup>*3)*<sup>c</sup>*3 = {*<sup>m</sup>*1, *<sup>m</sup>*2}, *<sup>σ</sup>*2(*<sup>e</sup>*3)*<sup>c</sup>*4 = {*<sup>m</sup>*5, *<sup>m</sup>*6},

> where *<sup>σ</sup>j*(*<sup>e</sup>*1)*ci* represents all those applicants of the platinum group whose education is equal to *ci*, *<sup>σ</sup>j*(*<sup>e</sup>*2)*ci* represents all those applicants of the platinum group whose experience is equal to *ci* and *<sup>σ</sup>j*(*<sup>e</sup>*3)*ci* represents all those applicants of the platinum group whose computer knowledge is equal to *ci*.

Define *B* = *μ<sup>B</sup>*, *<sup>γ</sup>B* : *U*2 → [0, 1] which represents the preference of applicants given by a multi-national company such that *μB*(*<sup>c</sup>*1) = 0.9, *μB*(*<sup>c</sup>*2) = 0.8, *μB*(*<sup>c</sup>*3) = 0.4, *μB*(*<sup>c</sup>*4) = 0 and *<sup>γ</sup>B*(*<sup>c</sup>*1) = 0.0, *<sup>γ</sup>B*(*<sup>c</sup>*2) = 0.2, *<sup>γ</sup>B*(*<sup>c</sup>*3) = 0.5, *<sup>γ</sup>B*(*<sup>c</sup>*4) = 0.8. Define *B*1 = 1*<sup>μ</sup><sup>B</sup>*1 , *γB*1 2 : *U*1 → [0, 1] which represents the preference of applicants given by a multi-national company such that *μ<sup>B</sup>*1 (*<sup>m</sup>*1) = 1, *μ<sup>B</sup>*1 (*<sup>m</sup>*2) = 0.7, *μ<sup>B</sup>*1 (*<sup>m</sup>*3) = 0.5, *μ<sup>B</sup>*1 (*<sup>m</sup>*4) = 0.1, *μ<sup>B</sup>*1 (*<sup>m</sup>*5) = 0, *μ<sup>B</sup>*1 (*<sup>m</sup>*6) = 0.4 and *γB*1 (*<sup>m</sup>*1) = 0, *γB*1 (*<sup>m</sup>*2) = 0.2, *γB*1 (*<sup>m</sup>*3) = 0.5, *γB*1 (*<sup>m</sup>*4) = 0.7, *γB*1 (*<sup>m</sup>*5) = 1, *γB*1 (*<sup>m</sup>*6) = 0.5.

> Therefore, the optimistic multigranulation lower and upper approximations (with respect to the aftersets as well as with respect to the foresets) are given in Tables 8 and 9.

$$\begin{array}{rcl} \underbrace{\sigma\_1 + \sigma\_2}\_{\mathcal{O} \overline{\sigma\_1 + \sigma\_2}^B} & = & (\underbrace{\sigma\_1 + \sigma\_2}\_{\mathcal{O} \overline{\sigma\_1 + \sigma\_2}}, \underbrace{\sigma\_1 + \sigma\_2}\_{\mathcal{O}}^{\gamma\_B}), \\ \boldsymbol{\sigma}^{\boldsymbol{\sigma}} \overline{\sigma\_1 + \sigma\_2}^B & = & (\boldsymbol{\sigma}^{\boldsymbol{\sigma}} \overline{\sigma\_1 + \sigma\_2}^{\mu\_B}, \boldsymbol{\sigma}^{\boldsymbol{\sigma}} \overline{\sigma\_1 + \sigma\_2}^B). \end{array}$$

**Table 8.** Optimistic multigranulation lower approximations of *B*.


Table 8 shows the exact degree of competency of applicant *mi* to *B* in education, experience and computer knowledge.

Table 9 shows the possible degree of competency of applicant *mi* to *B* in education, experience and computer knowledge.

In Table 10, *<sup>S</sup>*(*<sup>m</sup>*1) = *<sup>S</sup>*(*<sup>m</sup>*4), so we calculate accuracy values for *m*1 and *m*4, as shown in Table 11.


**Table 9.** Optimistic multigranulation upper approximations of *B*.

**Table 10.** Values of score function of applicants.


**Table 11.** Values of accuracy function.


It is shown in Table 11 that *<sup>H</sup>*(*<sup>m</sup>*6) = 5.7 is maximum. Therefore, a multi-national company will select applicant *m*6.

Therefore, the optimistic multigranulation lower and upper approximations (with respect to the foresets) are given in Tables 12 and 13.

$$\begin{array}{rcl} \prescript{B}{}{\begin{array}{c} \underline{\sigma\_{1} + \sigma\_{2}} \\ \underline{\sigma\_{1} + \sigma\_{2}} \end{array}} & = & (\prescript{\mu\_{B}}{\underline{\sigma\_{1} + \sigma\_{2}} \prime \prime}\_{\underline{\sigma\_{1} + \sigma\_{2}} \prime \prime} \underline{\sigma\_{1} + \sigma\_{2}}) , \\ \prescript{B}{}{\begin{array}{c} \underline{\sigma\_{1} + \sigma\_{2}} \prime \prime \prime \prime \end{array}} & = & (\prescript{\mu\_{B}}{\underline{\sigma\_{1} + \sigma\_{2}} \prime \prime \prime}\_{\underline{\sigma\_{1} + \sigma\_{2}} \prime} \underline{\sigma\_{1} + \sigma\_{2}} ). \end{array}$$

**Table 12.** Optimistic multigranulation lower approximations of *B*.


Table 12 shows the exact degree of competency of applicant *ci* to *B* in education, experience and computer knowledge.

Table 13 shows the possible degree of competency of applicant *ci* to *B* in education, experience and computer knowledge.


**Table 13.** Optimistic multigranulation upper approximations of *B*.

It is shown in Table 14 that *<sup>S</sup>*(*<sup>c</sup>*1) = 1.3 is maximum. Therefore, a multi-national company will select applicant *c*1.

**Table 14.** Values of score function of colors of car.

