Preprint
Article

Advanced Information on Multiple-Granulation Approximation Spaces

Altmetrics

Downloads

81

Views

81

Comments

0

Submitted:

24 June 2024

Posted:

26 June 2024

You are already at the latest version

Alerts
Abstract
To define the optimistic multiple-granulation (OMG) supra interior operator and the OMG-supra closure operator associated with a set A in a multiple-granulation approximation space, we used the concepts of the OMG-lower set OL (A) and the OMG-upper set OU (A). These operators create an approximate topological space known as optimistic multiple-granulation supratopological spaces. OMG-supra-open and OMG-supra-closed approximation sets are also defined, followed by OMG-supra-continuous approximation and OMG-irresolute approximation.
Keywords: 
Subject: Computer Science and Mathematics  -   Applied Mathematics

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 U = { x 1 , x 2 , . . . x n } be a nonempty and finite set of objects, called a universe of discourse. R U × U is an equivalence relation on U. x U , [ x ] R = { y U : ( x , y ) R } is the equivalence class that contains x. Then U / R = { [ x ] R : x U } creates a partition of U. Let R be a family of equivalence relations on U. The pair ( U , R ) is described as a multiple-granulation approximation space.
Definition 1.1. 
[13,14] Let ( U , R ) be a multiple-granulation approximation space with R 1 , R 2 , R 3 , . . . , R m R , where m is a natural number. For any X U , the OMG-lower and upper approximations of X on the family of equivalence relations { R i : 1 i m } are defined
O L Σ m i = 1 R i ( X ) = { x U : [ x ] R 1 X or [ x ] R 2 X or . . . . or [ x ] R m X } ,
O U Σ m i = 1 R i ( X ) = ( O L Σ m i = 1 R i ( X ) ) = { x U : [ x ] R 1 X and [ x ] R 2 X . . . and [ x ] R m X } .
( O L Σ m i = 1 R i ( X ) , O U Σ m i = 1 R i ( X ) ) is referred to as the optimistic multiple-granulation rough set of X . The term "optimistic" refers to x O L Σ m i = 1 R i ( X ) if and only if there exists at least one equivalence relation R i such that [ x ] R i X for all x U and 1 i m . The optimistic multiple-granulation boundary region of X is defined by O B N D Σ m i = 1 R i ( X ) as:
O B N D Σ m i = 1 R i ( X ) = O U Σ m i = 1 R i ( X ) O L Σ m i = 1 R i ( X ) .
Proposition 1.3. 
[14] Let ( U , R ) be a multiple-granulation approximation space. For any X , Y U , the following properties are true:
(1)
O L Σ m i = 1 R i ( X ) X O U Σ m i = 1 R i ( X ) .
(2)
O L Σ m i = 1 R i ( ) = O U Σ m i = 1 R i ( ) = and O L Σ m i = 1 R i ( U ) = O U Σ m i = 1 R i ( U ) = U .
(3)
O L Σ m i = 1 R i ( X ) = ( O U Σ m i = 1 R i ( X ) ) and O U Σ m i = 1 R i ( X ) = ( O L Σ m i = 1 R i ( X ) ) .
(4)
O L Σ m i = 1 R i ( O L Σ m i = 1 R i ( X ) ) = O U Σ m i = 1 R i ( O L Σ m i = 1 R i ( X ) ) = O L Σ m i = 1 R i ( X ) .
(5)
O U Σ m i = 1 R i ( O U Σ m i = 1 R i ( X ) ) = O L Σ m i = 1 R i ( O U Σ m i = 1 R i ( X ) ) = O U Σ m i = 1 R i ( X ) .
(6)
X Y O L Σ m i = 1 R i ( X ) O L Σ m i = 1 R i ( Y ) .
(7)
X Y O U Σ m i = 1 R i ( X ) O U Σ m i = 1 R i ( Y ) .
(8)
O L Σ m i = 1 R i ( X Y ) O L Σ m i = 1 R i ( X ) O L Σ m i = 1 R i ( Y ) and
O U Σ m i = 1 R i ( X Y ) O U Σ m i = 1 R i ( X ) O U Σ m i = 1 R i ( Y ) .
(9)
O L Σ m i = 1 R i ( X Y ) O L Σ m i = 1 R i ( X ) O L Σ m i = 1 R i ( Y ) and
O U Σ m i = 1 R i ( X Y ) O U Σ m i = 1 R i ( X ) O U Σ m i = 1 R i ( Y ) .
(10)
O L Σ m i = 1 R i ( X ) = i L R i ( X ) and O U Σ m i = 1 R i ( X ) = i U R i ( X ) for 1 i m .

2. Pre-Connectedness in Multiple-Granulation Approximation Spaces

Theorem 2.1. 
Suppose A U is a multiple-granulation approximation space in ( U , R ) . For each B P ( U ) , we define the mapping M G S i n t R A from P ( U ) to P ( U ) as:
M G S i n t R A ( B ) = O L Σ m i = 1 R i ( A ) O L Σ m i = 1 R i ( B ) for all B U , U , if B = U .
For B , C P ( U ) , the operator M G S i n t R A fulfils the following conditions:
(1) M G S i n t R A ( ) = , M G S i n t R A ( U ) = U .
(2) M G S i n t R A ( B ) B .
(3) If B C then M G S i n t R A ( B ) M G S i n t R A ( C ) .
(4) M G S i n t R A ( B C ) M G S i n t R A ( B ) M G S i n t R A ( C ) .
(5) M G S i n t R A ( M G S i n t R A ( B ) ) = M G S i n t R A ( B ) .
Proof. 
(1)
According to Proposition 1.3 (2),
M G S i n t R A ( ) = O L Σ m i = 1 R i ( A ) O L Σ m i = 1 R i ( ) = .
The second part comes directly from the definition.
(2)
M G S i n t R A ( B ) = O L Σ m i = 1 R i ( A ) O L Σ m i = 1 R i ( B ) O L Σ m i = 1 R i ( A ) B B .
(3)
If B C then O L Σ m i = 1 R i ( B ) O L Σ m i = 1 R i ( C ) , implies that
M G S i n t R A ( B ) M G S i n t R A ( C ) .
(4)
For B , C P ( U ) we have
M G S i n t R A ( B C ) = O L Σ m i = 1 R i ( A ) O L Σ m i = 1 R i ( B C ) O L Σ m i = 1 R i ( A ) O L Σ m i = 1 R i ( B ) O L Σ m i = 1 R i ( C ) = O L Σ m i = 1 R i ( A ) O L Σ m i = 1 R i ( B ) O L Σ m i = 1 R i ( A ) O L Σ m i = 1 R i ( C ) = M G S i n t R A ( B ) M G S i n t R A ( C ) .
(5)
Obvious.
We observe that in a multipe-granulation approximation space ( U , R ) , a mapping M G S i n t R A 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 i n t R A ( B ) instead of M G S i n t R A ( B ) .
Theorem 2.2. 
If i n t R A is the OMG-supra interior operator associated with A in a multiple-granulation approximation space ( U , R ) , there exists a multiple-granulation supratopology T R A P ( U ) defined as:
T R A = { B P ( U ) : B = i n t R A ( B ) } .
( U , T R A ) is called the OMG-approximation supratopological space.
Proof. 
(1)
Using (1) in Theorem 2.1, we have
, U T R A .
(2)
Assume B i T R A , then
B i = i n t R A ( B i ) for any i Δ .
According to Theorem 2.1(2), i n t R A ( i Δ B i ) i Δ B i . In contrast, i n t R A ( B i ) i Δ i n t R A ( B i ) . Theorem 2.1 (3) and (5) states that for any i Δ ,
i n t R A ( B i ) = i n t R A ( i n t R A ( B i ) ) i n t R A ( i Δ i n t R A ( B i ) ) .
Thus,
i Δ i n t R A ( B i ) i n t R A ( i Δ i n t R A ( B i ) ) .
Since B i = i n t R A ( B i ) we have
i Δ B i i n t R A ( i Δ B i ) .
So i Δ B i = i n t R A ( i Δ B i ) . This suggests that i Δ B i T R A . Hence, T R A is a multiple-granulation supratopology.
Each element of T R A 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 A U is associated with a multiple-granulation approximation space ( U , R ) , then the mapping M G S c l R A from P ( U ) to P ( U ) is defined by:
M G S c l R A ( B ) = ( O L Σ m i = 1 R i ( A ) ) c O U Σ m i = 1 R i ( B ) for all B , , if B = .
For B , C P ( U ) , the operator M G S c l R A has the following conditions:
(1) M G S c l R A ( ) = , M G S c l R A ( U ) = U .
(2) B M G S c l R A ( B ) .
(3) If B C then M G S c l R A ( B ) M G S c l R A ( C ) .
(4) M G S c l R A ( B ) M G S c l R A ( C ) M G S c l R A ( B C ) .
(5) M G S c l R A ( M G S c l R A ( B ) ) = M G S c l R A ( B ) .
Proof. 
Analogous to Theorem 2.1.
A mapping M G S c l R A defined in Theorem 2.3 is called the OMG-supra closure operator associated with A in a multiple-granulation approximation space ( U , R ) .
To avoid confusion, we can write c l R A ( B ) instead of M G S c l R A ( B ) .
Lemma 2.4. 
Let ( U , R ) be a multiple-granulation approximation space. For each B P ( U ) , we have
(1)
i n t R A ( B c ) = ( c l R A ( B ) ) c .
(2)
c l R A ( B c ) = ( i n t R A ( B ) ) c .
(3)
c l R A ( O U Σ m i = 1 R i ( B ) ) = c l R A ( B ) .
(4)
i n t R A ( O L Σ m i = 1 R i ( B ) ) = i n t R A ( B ) .
(5)
B is the OMG-supra open approximation set if and only if B = i n t R A ( B ) .
Proof. 
Obvious.
c l R A ( B c ) = ( i n t R A ( B ) ) c implies that the OMG-supra closure operator generates the same OMG-supratopology T R A as the following theorem.
Theorem 2.5. 
Let c l R A be the OMG-supra closure operator associated with A in a multiple-granulation approximation space ( U , R ) . Then there exists the OMG-supratopology T R A P ( U ) defined as:
T R A = { B P ( U ) : B c = c l R A ( B c ) } .
Proof. 
In the same way as Theorem 2.2.
Definition 2.6. 
Assume ( U , R ) is a multiple-granulation approximation space and A P ( U ) . Then,
(1)
B is the OMG-supra-preopen approximation set with A if and only if B i n t R A ( c l R A ( B ) ) .
(2)
B is the OMG-supra-preclosed approximation set with A if and only if B c l R A ( i n t R A ( B ) ) .
(3)
The OMG-supra-pre interior of B with A, denoted by s p i n t R A ( B ) , is defined as:
s p i n t R A ( B ) = { C : C B , C is the OMG - supra - preopen set } .
(4)
The OMG-supra-pre closure of B with respect to A, denoted by s p c l R A ( B ) , is defined as:
s p c l R A ( B ) = { C : B C , C is the OMG - supra - pre closed set } .
Theorem 2.7. 
Let ( U , R ) be a multiple-granulation approximation space, with A , B P ( U ) . Then the following statements are valid:
(1)
B is the OMG-supra-preopen approximation set if and only if B = s p i n t R A ( B ) .
(2)
B is the OMG-supra-preclosed approximation set if and only if B = s p c l R A ( B ) .
(3)
s p i n t R A ( U ) = U and s p c l R A ( ) = .
(4)
i n t R A ( B ) s p i n t R A ( B ) B s p c l R A ( B ) c l R A ( B ) .
(5)
s p c l R A ( B ) s p c l R A ( C ) s p c l R A ( B C ) .
(6)
s p c l R A ( s p c l R A ( B ) ) = s p c l R A ( B ) .
(7)
c l R A ( s p c l R A ( B ) ) = s p c l R A ( c l R A ( B ) ) = c l R A ( B ) .
(8)
s p i n t R A ( B c ) = ( s p c l R A ( B ) ) c .
Proof. 
We demonstrate (7): Based on (4), B s p c l R A ( B ) c l R A ( B ) ; thus,
c l R A ( B ) c l R A ( s p c l R A ( B ) ) c l R A ( c l R A ( B ) ) = c l R A ( B ) .
Hence, we get
c l R A ( s p c l R A ( B ) ) = c l R A ( B ) .
Furthermore, since c l R A ( B ) is the OMG-supra-preclosed approximation set, then s p c l R A ( c l R A ( B ) ) = c l R A ( B ) .
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 P = U / R 1 = { { a } , { b , c , d } } , Q = U / R 2 = { { b , d } , { a , c } } and L = U / R 3 = { { a , b , c } , { d } } are three partitions on the universe U = { a , b , c , d } . Then we compute the OMG-lower, OMG-upper, OMG-interior and OMG-closure with respect to A = { a , b , c } of each subset B U in the Table 1.
The set B = { a , b } is the OMG-supra-preopen approximation set with A = { a , b , c } , but not the OMG-supra-open approximation set.
i n t R { a , b , c } ( B ) = { a } { a , b } = B .
The sets { a , c } and { b , c } are OMG-supra-preopen approximation sets with A = { a , b , c } , but their intersection is not OMG-supra-preopen approximation set with respect to A = { a , b , c } .
{ c } = { a , c } { b , c } i n t R { a , b , c } ( c l R { a , b , c } ( { c } ) ) = .
Furthermore, since i n t R { a , b , c } ( { a , c , d } ) = { a , c } , i n t R { a , b , c } ( { b , c , d } ) = { b , c } , then
= i n t R { a , b , c } ( { c , d } ) = i n t R { a , b , c } ( { a , c , d } { b , c , d } ) i n t R { a , b , c } ( { a , c , d } ) i n t R { a , b , c } ( { b , c , d } ) = { a , c } { b , c } = { c } .
Definition 2.9. 
Let ( U , R ) be a multiple-granulation approximation space with A P ( U ) . If B i n t R A ( c l R A ( B ) ) c l R A ( i n t R A ( B ) ) , 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 ( U , R ) with i n t R A ( B ) = . Then B and B c are the OMG-supra-preopen approximation sets.
Proof. 
Given that B is the OMG-supra-b-open approximation set. Then
B i n t R A ( c l R A ( B ) ) c l R A ( i n t R A ( B ) ) .
If i n t R A ( B ) = , then c l R A ( i n t R A ( B ) ) = . Thus,
B i n t R A ( c l R A ( B ) ) .
Thus, B represents the OMG-supra-preopen approximation set. Moreover, ( i n t R A ( B ) ) c = U . This indicates that c l R A ( B c ) = U . Therefore, B c is the OMG-supra-preopen approximation set.

3. Pre-Continuity in Multiple-Granulation Approximation Spaces

Definition 3.1. 
Let ( U , R ) ( V , R * ) be two multiple-granulation approximation spaces, with A P ( U ) and B P ( V ) . Thet mapping f : ( U , R ) ( V , R * ) is called
(1)
An OMG-supra-continuous approximation if f 1 ( C ) is the OMG-supra-open approximation set in U for each OMG-supra-open approximation set in V .
(2)
An OMG-irresolute approximation (resp. the OMG-supra-pre-continuous approximation) if f 1 ( C ) is an OMG-supra-preopen approximation set in U for each the OMG-supra-preopen approximation set in V (resp. i n t R * B ( C ) = C ).
(3)
An OMG-irresolute open approximation (resp. the OMG-supra-preopen approximation) if f ( C ) is the OMG-supra-preopen approximation set in V for each the OMG-supra-preopen approximation set in U (resp. i n t R A ( C ) = C ).
(4)
The OMG-irresolute closed approximation (resp. the OMG-supra-preclosed appromation) if f ( C ) is the OMG-supra-preclosed approximation set in V for each the OMG-supra-preclosed approximation set in U (resp. c l R A ( C ) = C ).
Theorem 3.2. 
Let ( U , R ) and ( V , R * ) be two multiple-granulation approximation spaces, A P ( U ) , B P ( V ) and f : X Y be a function. Then the following statements are equivalent:
(1)
f is the OMG-supra continuous approximation.
(2)
The OMG-supra-closed approximation set C Y is f 1 ( C ) .
(3)
f ( c l R A ( K ) ) c l R * B ( f ( K ) ) for all K U .
(4)
c l R A ( f 1 ( C ) ) f 1 ( c l R * B ( C ) ) for all C V .
(5)
f 1 ( i n t R * B ( C ) ) i n t R A ( f 1 ( C ) ) for all C V .
Proof. 
( 1 ) ( 2 ) Obvious.
( 2 ) ( 3 ) For every K U , c l R * B ( f ( K ) ) is a multiple-granulation approximation closed set in V . Hence, f 1 ( c l R * B ( f ( K ) ) ) is a multiple-granulation approximation closed set in U . However, K f 1 ( f ( K ) ) f 1 ( c l R * B ( f ( K ) ) ) , and then
c l R A ( K ) c l R A ( f 1 ( f ( K ) ) ) c l R A ( f 1 ( c l R * B ( f ( K ) ) ) ) = f 1 ( c l R * B ( f ( K ) ) ) .
Thus, we get f ( c l R A ( K ) ) c l R * B ( f ( K ) ) .
( 3 ) ( 4 ) For any C V , set f 1 ( C ) = K . From (3) we get
f ( c l R A ( f 1 ( C ) ) ) c l R * B ( f ( f 1 ( C ) ) ) c l R * B ( C ) .
This means that c l R A ( f 1 ( C ) ) f 1 ( c l R * B ( C ) ) .
( 4 ) ( 5 ) Straightforward.
( 5 ) ( 1 ) Let C be a multiple-granulation approximation open set in V . Then, C = i n t R * B ( C ) . By (5) f 1 ( C ) = f 1 ( i n t R * B ( C ) ) i n t R A ( f 1 ( C ) ) . Since i n t R A ( f 1 ( C ) ) f 1 ( C ) and i n t R A ( f 1 ( C ) ) = f 1 ( C ) . Thus, f 1 ( C ) is a multiple-granulation approximation open set in U . Hence, a multiple-granulation approximation f is continuous.
The following two theorems are proved analogously to theorem 3.2.
Theorem 3.3. 
Let ( U , R ) and ( V , R * ) be two multiple-granulation approximation spaces with A P ( U ) , B P ( V ) and f : X Y a function. Then, the following statements are equivalent:
(1)
f is an OMG-irresolute approximation map.
(2)
The OMG-supra pre-closed approximation set C Y is f 1 ( C ) .
(3)
f ( s p c l R A ( K ) ) s p c l R * B ( f ( K ) ) for all K U .
(4)
s p c l R A ( f 1 ( C ) ) f 1 ( s p c l R * B ( C ) ) for all C V .
(5)
f 1 ( s p i n t R * B ( C ) ) s p i n t R A ( f 1 ( C ) ) for all C V .
Theorem 3.4. 
Let ( U , R ) and ( V , R * ) be two multiple-granulation approximation spaces with A P ( U ) , B P ( V ) and f : X Y a function. Then the following statements are equivalent:
(1)
f is the OMG-supra-precontinuous approximation.
(2)
f ( s p c l R A ( K ) ) c l R * B ( f ( K ) ) for all K U .
(3)
s p c l R A ( f 1 ( C ) ) f 1 ( c l R * B ( C ) ) for all C V .
(4)
f 1 ( i n t R * B ( C ) ) s p i n t R A ( f 1 ( C ) ) for all C V .
Theorem 3.5. 
Let ( U , R ) , ( V , R * ) be two a multiple-granulation approximation spaces with A P ( U ) , B P ( V ) and f : X Y a function. Then, the following statements are equivalent:
(1)
f is the OMG-irresolute open approximation map.
(2)
f ( s p i n t R A ( K ) ) s p i n t R * B ( f ( K ) ) for all K U .
(3)
s p i n t R A ( f 1 ( C ) ) f 1 ( s p i n t R * B ( C ) ) for all C V .
(4)
For any set C Y and any OMG-supra-preclosed approximation set K X such that f 1 ( C ) = K , there exists an OMG-supra-preclosed approximation set E Y with C E such that f 1 ( E ) K .
Proof. 
( 1 ) ( 2 ) Given that s p i n t R A ( K ) K for any K U , then
f ( s p i n t R A ( K ) ) f ( K ) .
According to (1), f ( s p i n t R A ( K ) ) is the OMG-supra-pre-open approximation set in V . Therefore,
f ( s p i n t R A ( K ) ) s p i n t R * B ( f ( K ) ) .
( 2 ) ( 3 ) For any C V , set f 1 ( C ) = K . Then,
f ( s p i n t R A ( f 1 ( C ) ) ) s p i n t R * B ( f ( f 1 ( C ) ) ) s p i n t R * B ( C ) .
It implies that s p i n t R A ( f 1 ( C ) ) f 1 ( s p i n t R * B ( C ) ) . ( 3 ) ( 4 ) Let K X be the OMG-supra-preclosed approximation set with f 1 ( C ) K , C Y . Thus, c l R A ( i n t R A ( K ) ) K and s p i n t R A ( K c ) s p i n t R A ( f 1 ( C c ) ) . By (3)
K c s p i n t R A ( f 1 ( C c ) ) f 1 ( s p i n t R * B ( C c ) ) .
This means that f 1 ( s p c l R * B ( C ) ) = f 1 ( ( s p c l R * B ( C c ) ) c ) C . Thus, there exists the OMG-supra-preclosed approximation set s p c l R * B ( C ) in V with C s p c l R * B ( C ) so that f 1 ( s p c l R * B ( C ) ) K . ( 4 ) ( 1 ) Clear.
The following theorems can be proven in the same way that Theorem 3.9 was.
Theorem 3.6. 
Let f : X Y be a function and ( U , R ) , ( V , R * ) be two multiple-granulation approximation spaces with A P ( U ) , B P ( V ) . Then, the following claims are interchangeable:
(1)
f is the OMG-supra-open approximation map.
(2)
f ( i n t R A ( K ) ) i n t R * B ( f ( K ) ) for all K U .
(3)
i n t R A ( f 1 ( C ) ) f 1 ( i n t R * B ( C ) ) for all C V .
(4)
For any set C Y , the OMG-supra-closed approximation set K X so that f 1 ( C ) = K , there exists the OMG-supra-closed approximation set E Y with C E so that f 1 ( E ) K .
Theorem 3.7. 
Let ( U , R ) , ( V , R * ) be two multiple-granulation approximation spaces with A P ( U ) , B P ( V ) and f : X Y a function. Then, the following statements are equivalent:
(1)
f is the OMG-supra-preopen approximation map.
(2)
f ( i n t R A ( K ) ) s p i n t R * B ( f ( K ) ) for all K U .
(3)
i n t R A ( f 1 ( C ) ) f 1 ( s p i n t R * B ( C ) ) for all C V .
(4)
For any set C Y and any OMG-supra-preclosed approximation set K X so that f 1 ( C ) = K , there exists an OMG-supra-closed approximation set E Y with C E such that f 1 ( E ) K .
Theorem 3.8. 
Let ( U , R ) , ( V , R * ) be two multiple-granulation approximation spaces with A P ( U ) , B P ( V ) and f : X Y a function. Then, the following claims are interchangeable:
(1)
f is the OMG-irresolute closed approximation map.
(2)
f ( s p c l R A ( K ) ) s p c l R * B ( f ( K ) ) for all K U .
Theorem 3.9. 
Let ( U , R ) , ( V , R * ) be two multiple-granulation approximation spaces with A P ( U ) , B P ( V ) and f : X Y a function. Then, the following claims are interchangeable:
(1)
f is the OMG-supra-preclosed approximation map.
(2)
f ( c l R A ( K ) ) i n t R * B ( c l R * B ( f ( K ) ) ) for all K U .
(3)
s p c l R * B ( f ( K ) ) f ( c l R A ( K ) ) for all K U .
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 U = V , consider P = U / R 1 = { { a } , { b , c , d } } , Q = U / R 2 = { { b , d } , { a , c } } , and L = U / R 3 = { { a , b , c } , { d } } are three partitions on the universe U = { a , b , c , d } . We then compute the OMG-lower, OMG-upper, OMG-interior, and OMG-closure with respect to A = { a , b , c } of each subset B U in Table 1.
A mapping f : ( U , R ) ( V , R * ) is defined as f ( a ) = f ( d ) = b , f ( b ) = a , and f ( c ) = c . If { a , c } is the OMG-supra-open approximation set and f 1 ( { a , c } ) = { b , c } 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

  1. 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.
  2. I. Ibedou, S. E. Abbas and SJafari, More on Approximation spaces in the sense of Pawlak, March 2020, ResearchGate.
  3. J. Kortelainen, On the relationship between modified sets, topological spaces and rough sets, Fuzzy Sets and Systems 61 (1994), 91-95. [CrossRef]
  4. 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]
  5. 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]
  6. 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.
  7. 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]
  8. 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]
  9. Z. Pawlak, Rough sets, International Journal of Computer and Information Sciences, 11 (1982), 341-356.
  10. Z. Pawlak, Rough Sets, Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Dordrecht, Boston, 1991.
  11. L. Polkowski, Mathematical morphology of rough sets, Bulletin of the Polish Acadamy Science Mathematics, 41 (3) (1993) 241–273.
  12. 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.
  13. 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.
  14. 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.
  15. K. Qin, J. Yang and Z. Pei, Generalized rough sets based on reflexive and transitive, Information Science, 178 (2008), 4138-4141. [CrossRef]
  16. 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]
  17. 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]
  18. 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.
  19. Y. Y. Yao, Two views of the theory of rough sets in finite universes, International Journal of Approximate Reasoning, 15 (1996), 291-317. [CrossRef]
  20. Y. Y. Yao and T Y Lin, Generalization of rough sets using modal logics, Intelligent Automation and Soft Computing, 2 (1996), 103-120. [CrossRef]
  21. 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
O L P + Q + L ( B ) i n t R { a , b , c } ( B ) O U P + Q + L ( B ) c l R { a , b , c } ( B )
{ a } { a } { a } { a } { a , d }
{ b } { b } { b , d }
{ c } { c } { c , d }
{ d } { d } { d } { d }
{ a , b } { a } { a } { a , b , c } { a , b , c , d }
{ a , c } { a , c } { a , c } { a , c } { a , c , d }
{ a , d } { a , d } { a } { a , b , c , d } { a , b , c , d }
{ b , c } { b , c } { b , c , d }
{ b , d } { b , d } { b } { b , d } { b , d }
{ c , d } { d } { b , c , d } { b , c , d }
{ a , b , c } { a , b , c } { a , b , c } { a , b , c } { a , b , c , d }
{ a , b , d } { a , b , d } { a , b } { a , b , c , d } { a , b , c , d }
{ a , c , d } { a , c , d } { a , c } { a , b , c , d } { a , b , c , d }
{ b , c , d } { b , c , d } { b , c } { b , c , d } { b , c , d }
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated