4. A Novel Approach to Rough Categorization Using the -Open Set
Remark 5. A subbase for a topology τ on and a class of of all -0pen sets by are indicated, along with the relationship that was utilized to obtain them. Furthermore, we designate the approximation space by .
Example 1. Assume a universe and a relation defined as thus as well . Consequently, the topology related to this relationship is as well .is a - approximation space.
Definition 8. Assume that () is - lower approximation as well - upper approximation for every nonempty subset S of , the definition is:
,
.
Definition 9. Assume that() is - accuracy measure of S specified as follows
Theorem 1. Given any binary relation on , which generates a topological space , we obtain .
Proof.
, that is, .
Furthermore, , that is, .
Consequently, . □
Definition 10. Assume that the - approximation space is (. With consider to any , the universe can be divided into 24 areas as follows.
, which is the internal edg of S.
, which is the -internal edg of S.
, which is the - internal edg of S .
, which is the external edg of S.
, which is the - external edg of S.
, which is the - external edg of S.
b(S) = , which is the boundary of S.
= , which is the - boundary of S.
, which is the - boundary of S.
, which is the exterior of S.
, which is the - exterior of S.
, which is the - exterior of S.
.
.
.
.
.
.
.
.
.
.
.
.
Remark 6. An extension of the study of approximation space is the study of - approximation space (Figure 1). Due to the components of the areas [], [], and[] will be defined well in S, In Pawlak’s approximation, however, this point was undefinable. Additionally, the component of the areas [],[],additionally [] don’t belong in S, even though Pawlak’s approximation space doesn’t provide these components a clear definition.
Proposition 2. If S is any subset of , then the following holds for any - approximation space:
Proof. (2) It the follows from
. □
Definition 11. Assume that and that ( is a - approximation space. Then there are the memberships ,, which are defined as, - strong and - weak membership respectively
Remark 7. As stated by definition 10 , - lower and - upper approximations of a set is possible to write as:
Remark 8. Assume that ( is a - approximation space, . Then
The converse of Remark 8 It might not always be the case, as demonstrated by the example below.
Example 2. In example 1. Let N=, we have N but N. Let N =, N but N. Let N = then we have N but N. Let N =, N but N.
Example 3. We can deduce from example 1 with the following table, which displays the degree of accuracy measure , -accuracy measure additionally - accuracy measure for some subset of .
The set has a degree of precision of 50% according to the accuracy measure, and 100% according to the - accuracy measure. Furthermore, the set according to - accuracy measure equal to 75% and according to - accuracy measure equal to 100%. Thus, -accuracy measures are superior to accuracy and -accuracy metrics.
We study
- rough inclusion, using the rough inclusion method that Novotny and Pawlak developed in [
19,
20].
Definition 12. Assume that ( is a approximation space where S,. Then we state:
S is - roughly bottom included in N if ,
S is - roughly top included in N if ,
S is - roughly included in N if (1) and (2).
Example 4. As shown in Example 1, is - roughly bottom included in .
Furthermore is - roughly top included in . Additionally is - roughly included in
Definition 13. Assume that ( is - approximation space, a subset S of is referred to as
- definable when ,
- rough when
Example 5. For any - approximation space as in Example 1. We have the set is - exact.
Definition 14. The subset of any - approximation space is referred to as;
If and , then roughly - definable, and indicated by ,
If and , then internally - undefinable, and indicated by ,
if and , then externally - undefinable, and indicated by ,
If and , then totally - undefinable, and indicated by .
Remark 9. Assume that is a - approximation space. These are on hold :
,
,
,
.
Example 6. As shown in Example 1, the set but .The set but . The set and . the set but .
Proposition 3. Assume that the - approximation space is . After that
Proof. Evident.
As demonstrated by the example that follows, the converse of every part of proposition 3, might not always hold. □
Example 7. Consider as an - approximation space for in example 1. Consequently the subset is - exact but not -exact, while is P-rough but not -rough.
Proposition 4. Assuming that and any - approximation space .Next
,
,
If then and
Proof.
Assume , meaning that . And after that, there in such a manner that . So , therefore , furthermore, assume additionally, by definition of , then for everyone . Therefore .
Adheres directly.
Assume , meaning that however , so and , then . Additionally let this implies that afterward, there are and meaning that, there is and which suggest , so . Consequently .
□
Proposition 5. Assuming that and any - approximation space .Next:
,
,
,
,
,
.
Proof.
Assume meaning that . Consequently, there in such a manner that . And after that, there such that . So . So . Consequently .
Comparable to (1).
By definition , That suggests that .
. From (1), (2) and (3), we get .
Since and by (3) we have , then .
Since and by (4), we have , then .
□
Proposition 6. Assume that is a - approximation apace and . Then
,
,
,
.
Proof.
Given that we have and . And after that and by (3) in the Proposition 4, then .
(2), (3) and (4) the same as (1).
□
Theorem 2. Assuming that and any - approximation space If S is -definable. The next items are then held.
- (1)
.
- (2)
.
Proof.
-
Evidently . To include the opposite, assume , that implies is . And after that, there in such a manner that . We present three instances:
- (a)
If and is a -open the set, then .
- (b)
If , then and , thus .
- (c)
If . Since and is an -open the set, then , each in the previously mentioned condition, therefore , then , since S is - definable. Thus, in three instances .
Evidently . We demonstrate the opposite inclusion, assume , then denotes and , in which V is an -open the set and suggests for every . Consequently . Therefore .
□
Theorem 3. Assuming that and any - approximation space . Afterwards, the following are held.
,
.
Proof.
In accordance with propositions 4 (1) and 6 (2), we . Then . However, since and the union of an -open set and a closed set is -closed, and after that . Consequently .
Given that an open set’s intersection with and an -open set is -open, . However, by applying proposition 6 (3), . Consequently .
□
Lemma 2. For any -approximation space furthermore, for everyone , the state of and infers .
Proof. According to the definition of -upper approximation a set is a -closure of this set, furthermore is a -closed set containing c (according to the condition) but is the tiniest -closed set containing c, thus . Therefore By symmetry, the opposite inclusion occurs . therefore we obtain . □
Lemma 3. Assume that be a -approximation space, where each -open subset S of is -closed, Then therefore for every .
Proof. If , then there is a -open set V include c such that which suggests that but is a -closed set additionally is a -open set does not include c, thus . Therefore . □
Proposition 7. Assume that be a - approximation space, and all of them -open subset S of is -closed. After that, the family of sets is a division of the set .
Proof. If furthermore , then furthermore . Consequently, by Lemma 3, and furthermore by Lemma 2, as we have and . Consequently . Therefore either or □