1. Historical Background
Pawlak [
9,
10] proposed a term for rough sets in approximation space to address the uncertainty arising from artificial systems with lacking and incomplete real-world information. Rough sets are conceptualised in terms of the equivalent relationship of a universal finite set, which serves as the foundation for lower and upper approximations for particular subsets. Numerous researchers have investigated the connection between topological spaces and rough sets, demonstrating that the lower and upper approximation operators formed from a reflexive and transitive relation correspond to the interior and closure operators in a topology, [
1,
3,
11,
12,
15,
19,
20,
21]. Ibedou et al. [
2] proposed semi-connectedness for nano topological and approximation spaces. Additionally, he utilized the concept of operators in approximation spaces to introduce semicontinuity and other forms of continuity more comprehensively.
Extending and generalising the rough set model is one of the most significant research avenues. Qian et al. [
13,
14] extended the Pawlak set model by introducing and defining multi-granulation rough sets with multiple equivalence relations in the universe set. Pawlak’s rough set has only one equivalence relation. Qian’s definition produces two different kinds of multi-granulation rough sets because it contains multiple equivalence relations. Initially, we consider the optimistic multi-granulation rough set. The term "optimistic" in the lower approximation refers to the requirement that at least one independent granular structure satisfy the implication relationship between the equivalency class and the indefinable set.
Second, the pessimistic multi-granulation rough set, in which the term "pessimistic" is used in the lower approximation in multiple independent granular structures, refers to the idea that every granular structure must satisfy the implication relation between the equivalence class and the undefinable set. Following that, a number of researchers looked into multi-granulation rough set models based on various types of relationships and came up with a number of interesting ideas (for example, [
4,
5,
6,
7,
8,
16,
17]).
This paper focuses on the OMG-supra interior and OMG-supra closure operators in a multiple-granulation approximation space, which generates an approximation topological space known as the optimistic multiple-granulation supratopological spaces. The OMG-supra-preopen and OMG-supra-preclosed sets in multiple-granulation approximation space are defined. There are also definitions for the OMG-supra-pre interior and OMG-supra pre closure operators. The OMG-supra-continuity approximation and the OMG-supra-pre continuity approximation are defined. Some new approximation continuities are defined in a generalised form by employing special multiple-granulation approximation operators defined on multiple-granulation approximation spaces.
In this paper, let be a nonempty and finite set of objects, called a universe of discourse. is an equivalence relation on U. is the equivalence class that contains x. Then creates a partition of U. Let be a family of equivalence relations on U. The pair is described as a multiple-granulation approximation space.
Definition 1.1.
[13,14] Let
be a multiple-granulation approximation space with
, where
m is a natural number. For any
the OMG-lower and upper approximations of
X on the family of equivalence relations
are defined
is referred to as the optimistic multiple-granulation rough set of
The term "optimistic" refers to
if and only if there exists at least one equivalence relation
such that
for all
and
. The optimistic multiple-granulation boundary region of
X is defined by
as:
Proposition 1.3.
[14] Let
be a multiple-granulation approximation space. For any
, the following properties are true:
- (1)
- (2)
and
- (3)
and .
- (4)
.
- (5)
.
- (6)
.
- (7)
.
- (8)
-
and
.
- (9)
-
and
.
- (10)
and for
2. Pre-Connectedness in Multiple-Granulation Approximation Spaces
Theorem 2.1. Suppose
is a multiple-granulation approximation space in
. For each
, we define the mapping
from
to
as:
For
, the operator
fulfils the following conditions:
(1)
(2)
(3) If then
(4)
(5)
Proof.
- (1)
-
According to Proposition 1.3 (2),
The second part comes directly from the definition.
- (2)
- (3)
-
If then , implies that
- (4)
For
we have
- (5)
Obvious.
We observe that in a multipe-granulation approximation space , a mapping obtained in Theorem 2.1 is called the OMG-supra interior operator associated with A.
In the event that there is no misunderstanding, we write instead of .
Theorem 2.2. If
is the OMG-supra interior operator associated with
A in a multiple-granulation approximation space
, there exists a multiple-granulation supratopology
defined as:
is called the OMG-approximation supratopological space.
Proof.
- (1)
Using (1) in Theorem 2.1, we have
- (2)
-
Assume
, then
According to Theorem 2.1(2),
. In contrast,
. Theorem 2.1 (3) and (5) states that for any
,
Since
we have
So . This suggests that . Hence, is a multiple-granulation supratopology.
Each element of is known as the OMG-supra open approximation set, while its complement is known as the OMG-supra closed approximation set.
Theorem 2.3. If
is associated with a multiple-granulation approximation space
, then the mapping
from
to
is defined by:
For
, the operator
has the following conditions:
(1)
(2)
(3) If then
(4)
(5)
Proof. Analogous to Theorem 2.1.
A mapping defined in Theorem 2.3 is called the OMG-supra closure operator associated with A in a multiple-granulation approximation space .
To avoid confusion, we can write instead of .
Lemma 2.4. Let be a multiple-granulation approximation space. For each , we have
- (1)
.
- (2)
.
- (3)
.
- (4)
.
- (5)
B is the OMG-supra open approximation set if and only if
Proof. Obvious.
implies that the OMG-supra closure operator generates the same OMG-supratopology as the following theorem.
Theorem 2.5. Let
be the OMG-supra closure operator associated with
A in a multiple-granulation approximation space
. Then there exists the OMG-supratopology
defined as:
Proof. In the same way as Theorem 2.2.
Definition 2.6. Assume is a multiple-granulation approximation space and . Then,
- (1)
B is the OMG-supra-preopen approximation set with A if and only if
- (2)
B is the OMG-supra-preclosed approximation set with A if and only if
- (3)
The OMG-supra-pre interior of
B with
A, denoted by
, is defined as:
- (4)
The OMG-supra-pre closure of
B with respect to
A, denoted by
, is defined as:
Theorem 2.7. Let be a multiple-granulation approximation space, with . Then the following statements are valid:
- (1)
B is the OMG-supra-preopen approximation set if and only if
- (2)
B is the OMG-supra-preclosed approximation set if and only if
- (3)
and
- (4)
.
- (5)
.
- (6)
.
- (7)
.
- (8)
.
Proof. We demonstrate (7): Based on (4),
; thus,
Hence, we get
Furthermore, since
is the OMG-supra-preclosed approximation set, then
Remark. (1) Every OMG-supra-open (supra-closed) approximation set is OMG-supra-preopen (supra-preclosed) approximation set.
(2) Any union of OMG-supra-open approximation sets is OMG-supra-open approximation.
(3) Any intersection of OMG-supra-closed approximation sets constitutes an OMG-supra-closed approximation set.
The following example demonstrates that the converse of the statement is not true.
Example 2.8. Consider
,
and
are three partitions on the universe
. Then we compute the OMG-lower, OMG-upper, OMG-interior and OMG-closure with respect to
of each subset
in the
Table 1.
The set
is the OMG-supra-preopen approximation set with
, but not the OMG-supra-open approximation set.
The sets
and
are OMG-supra-preopen approximation sets with
, but their intersection is not OMG-supra-preopen approximation set with respect to
.
Furthermore, since
, then
Definition 2.9. Let be a multiple-granulation approximation space with . If , then B is the OMG-supra-b-open approximation set with respect to A.
Proposition 2.10. Let B be the OMG-supra-b-open approximation set of with . Then B and are the OMG-supra-preopen approximation sets.
Proof. Given that
B is the OMG-supra-
b-open approximation set. Then
If
then
. Thus,
Thus,
B represents the OMG-supra-preopen approximation set. Moreover,
. This indicates that
. Therefore,
is the OMG-supra-preopen approximation set.
3. Pre-Continuity in Multiple-Granulation Approximation Spaces
Definition 3.1. Let be two multiple-granulation approximation spaces, with and . Thet mapping is called
- (1)
An OMG-supra-continuous approximation if is the OMG-supra-open approximation set in U for each OMG-supra-open approximation set in
- (2)
An OMG-irresolute approximation (resp. the OMG-supra-pre-continuous approximation) if is an OMG-supra-preopen approximation set in U for each the OMG-supra-preopen approximation set in V (resp. ).
- (3)
An OMG-irresolute open approximation (resp. the OMG-supra-preopen approximation) if is the OMG-supra-preopen approximation set in V for each the OMG-supra-preopen approximation set in U (resp. ).
- (4)
The OMG-irresolute closed approximation (resp. the OMG-supra-preclosed appromation) if is the OMG-supra-preclosed approximation set in V for each the OMG-supra-preclosed approximation set in U (resp. ).
Theorem 3.2. Let and be two multiple-granulation approximation spaces, and be a function. Then the following statements are equivalent:
- (1)
f is the OMG-supra continuous approximation.
- (2)
The OMG-supra-closed approximation set is .
- (3)
for all
- (4)
for all
- (5)
for all
Proof.
Obvious.
For every
is a multiple-granulation approximation closed set in
Hence,
is a multiple-granulation approximation closed set in
However,
and then
Thus, we get .
For any
set
From (3) we get
This means that .
Straightforward.
Let C be a multiple-granulation approximation open set in Then, By (5) . Since and . Thus, is a multiple-granulation approximation open set in Hence, a multiple-granulation approximation f is continuous.
The following two theorems are proved analogously to theorem 3.2.
Theorem 3.3. Let and be two multiple-granulation approximation spaces with and a function. Then, the following statements are equivalent:
- (1)
f is an OMG-irresolute approximation map.
- (2)
The OMG-supra pre-closed approximation set is .
- (3)
for all
- (4)
for all
- (5)
for all
Theorem 3.4. Let and be two multiple-granulation approximation spaces with and a function. Then the following statements are equivalent:
- (1)
f is the OMG-supra-precontinuous approximation.
- (2)
for all
- (3)
for all
- (4)
for all
Theorem 3.5. Let , be two a multiple-granulation approximation spaces with and a function. Then, the following statements are equivalent:
- (1)
f is the OMG-irresolute open approximation map.
- (2)
for all
- (3)
for all
- (4)
For any set and any OMG-supra-preclosed approximation set such that there exists an OMG-supra-preclosed approximation set with such that .
Proof.
Given that
for any
, then
According to (1),
is the OMG-supra-pre-open approximation set in
Therefore,
For any
, set
. Then,
It implies that
Let
be the OMG-supra-preclosed approximation set with
. Thus,
and
. By (3)
This means that
. Thus, there exists the OMG-supra-preclosed approximation set
in
V with
so that
Clear.
The following theorems can be proven in the same way that Theorem 3.9 was.
Theorem 3.6. Let be a function and , be two multiple-granulation approximation spaces with . Then, the following claims are interchangeable:
- (1)
f is the OMG-supra-open approximation map.
- (2)
for all
- (3)
for all
- (4)
For any set , the OMG-supra-closed approximation set so that , there exists the OMG-supra-closed approximation set with so that .
Theorem 3.7. Let , be two multiple-granulation approximation spaces with and a function. Then, the following statements are equivalent:
- (1)
f is the OMG-supra-preopen approximation map.
- (2)
for all
- (3)
for all
- (4)
For any set and any OMG-supra-preclosed approximation set so that there exists an OMG-supra-closed approximation set with such that .
Theorem 3.8. Let , be two multiple-granulation approximation spaces with and a function. Then, the following claims are interchangeable:
- (1)
f is the OMG-irresolute closed approximation map.
- (2)
for all
Theorem 3.9. Let , be two multiple-granulation approximation spaces with and a function. Then, the following claims are interchangeable:
- (1)
f is the OMG-supra-preclosed approximation map.
- (2)
for all
- (3)
for all
Remark 3.10.
- (1)
Every OMG-supra continuous approximation (respectively, the OMG-supra open approximation map or the OMG-supra closed approximation map) is the OMG-supra precontinuous approximation (respectively, the OMG-supra-preopen approximation or the OMG-supra-preclosed approximation) map.
- (2)
Every OMG-irresolute approximation map has an OMG-supra-precontinuous approximation.
Example 3.11. Given
, consider
,
, and
are three partitions on the universe
. We then compute the OMG-lower, OMG-upper, OMG-interior, and OMG-closure with respect to
of each subset
in
Table 1.
A mapping is defined as , and . If is the OMG-supra-open approximation set and is the OMG-supra-preopen approximation set, then f is the OMG-supra-precontinuous approximation, but not the OMG-supra continuous approximation.
Author Contributions
Methodology, O.R.Sayed.; Validation, E.El-Sanousy; Formal analysis,Salahuddin; Investigation, O.R.Sayed; Resources, E.El-Ssanousy; Writing–original draft, A.A.Abd-Allah; Writing – review and editing, Salahuddin; Visualization, Y.H. Ragheb Sayed. All authors have read and agreed to the published version of the manuscript.
References
- M. Chuchro, On rough sets in topological Boolean algebra.In: Ziarko,W.(ed.): Rough Sets, Fuzzy Sets and Knowledge Discovery, Springer-Verlage, New York, pp. 157-160, 1994.
- I. Ibedou, S. E. Abbas and SJafari, More on Approximation spaces in the sense of Pawlak, March 2020, ResearchGate.
- J. Kortelainen, On the relationship between modified sets, topological spaces and rough sets, Fuzzy Sets and Systems 61 (1994), 91-95. [CrossRef]
- J. Y. Liang, F. Wang, C. Y. Dang and Y. H. Qian, An efficient rough feature selection algorithm with a multi-granulation view, International Journal of Approximate Reasoning, 50 (2012), 912-926. [CrossRef]
- G. P. Lin, Y. H. Qian and J. J. Li, NMGRS: neighborhood-based multi-granulation rough sets, International Journal of Approximate Reasoning, 53 (7) (2012), 1080-1093. [CrossRef]
- C. H. Liu and M. Z. Wang, Covering fuzzy rough set based on multi-granulations, International Conference on Uncertainty Reasoning and Knowledge Engineering, pp. 146-149, 2011.
- C. H. Liu, D. Q. Miao and J. Qian, On multi-granulation covering rough sets, International Journal of Approximate Reasoning, 55(6) (2014), 1404-1418. [CrossRef]
- J. M. Ma, W. X. Zhang, Y. Leung and X. X. Song, Granular computing and dual Galois connection, Information Sciences, 177 (2007), 5365-5377. [CrossRef]
- Z. Pawlak, Rough sets, International Journal of Computer and Information Sciences, 11 (1982), 341-356.
- Z. Pawlak, Rough Sets, Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, Boston, 1991.
- L. Polkowski, Mathematical morphology of rough sets, Bulletin of the Polish Acadamy Science Mathematics, 41 (3) (1993) 241–273.
- L. Polkowski, Metric spaces of topological rough sets from countable knowledge bases, in: R. Slowinski, J. Stefanowski (Eds.), Foundations of Computing and Decision Sciences, 18 (3-4) (1993), special issue, 241–273.
- Y. H. Qian and J. Y. Liang, Rough Set Method Based on Multi-granulations. The 5th IEEE International Conference on Cognitive Informatics, Beijing, China, (2006), 297-304.
- Y. H. Qian, J. Y. Liang, Y. Y. Yao and C. Y. Dang, MGRS: A multi-granulation rough set, Information Sciences, 180 (6) (2010), 949-970.
- K. Qin, J. Yang and Z. Pei, Generalized rough sets based on reflexive and transitive, Information Science, 178 (2008), 4138-4141. [CrossRef]
- Y. H. She and X. L. He, On the structure of the multi-granulation rough set model, Knowledge-Based systems, 36 (2012), 81-92. [CrossRef]
- A. A. Abdallah, O. R.Sayed, E. El-Sanousy, Y. H. Ragheb Sayed, M. N. Abushugair, Salahuddin, Multi-Granulation double fuzzy rough sets, Symmetry, MDPI, 15 (2023), 129. [CrossRef]
- M. L. Thivagar and C. Richard, On Nano forms of weakly open sets, International Journal of Mathematics and Statistics Invention, 1/1 (2013), 31-37.
- Y. Y. Yao, Two views of the theory of rough sets in finite universes, International Journal of Approximate Reasoning, 15 (1996), 291-317. [CrossRef]
- Y. Y. Yao and T Y Lin, Generalization of rough sets using modal logics, Intelligent Automation and Soft Computing, 2 (1996), 103-120. [CrossRef]
- P. Zhi, D. Pei and L. Zheng, Topology vs generalized rough sets, International Journal of Approximate Reasoning, 52(2) (2011), 231-239. [CrossRef]
Table 1.
The optimistic multiple-granulation lower and upper
Table 1.
The optimistic multiple-granulation lower and upper
|
|
|
|
|
|
|
|
|
|
|
∅ |
∅ |
|
|
|
∅ |
∅ |
|
|
|
|
∅ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
∅ |
∅ |
|
|
|
|
|
|
|
|
|
∅ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 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 (http://creativecommons.org/licenses/by/4.0/).