1. Introduction
The concept of a fuzzy set (-set) of a nonempty set M is a mapping (where ), this concept was first defined in 1965 by Zadeh [1]. The theory of -sets provides a framework for mathematical modeling of those real world situations, which involve an element of uncertainty, imprecision, or vagueness in their description. After the introduction of the concept of -sets, several research studies were conducted on the generalizations of -sets. The integration between -sets and some uncertainty approaches such as soft sets (-sets) and rough sets (-sets) has been discussed in [2-4]. The concept of a fuzzy topology (-topology) was presented in 1968 by Chang [5]. Several authors have successfully generalized the theory of general topology to the fuzzy setting with crisp methods. According to Šostak [6], these notions, an -topology is a crisp subclass of the class of -sets and fuzziness in the notion of openness of an -set has not been considered, which seems to be a drawback in the process of fuzzification of the notion of a topological space. Therefore, Šostak [6] defined a novel definition of the notion of an -topology as the concept of openness of -sets. It is an extension of an -topology introduced by Chang [5]. Thereafter, many researchers (Ramadan [7], Chattopadhyay et. al. [8], El Gayyar et. al. [9], Höhle and Šostak [10], Ramadan et. al. [11], Kim et. al. [12], Abbas [13,14], Kim and Abbas [15], Aygun and Abbas [16,17], Li and Shi [18,19], Shi and Li [20], Fang and Guo [21], El-Dardery et. al. [22], Kalaivani and Roopkumar [23], Solovyov [24], Minana and Šostak [25]) have redefined the same notion and studied being unaware of Šostak work.
The generalizations of fuzzy open sets (-open sets) play an effective role in an -topology through their use to improve on many results, or to open the door to explore and discuss several of fuzzy topological notions such as -continuity [7,8], -connectedness [8], -compactness [8,9], -separation axioms [18], etc. Overall, the notions of r--semi-open, r--pre-open, r---open, and r---open sets were defined and studied by the authors of [12,14] on in the sense of Šostak [6]. Also, Kim et al. [12] defined and discussed some weaker forms of -continuity, called -semi-continuity (resp. -pre-continuity and --continuity) between in the sense of Šostak [6]. Furthermore, Abbas [14] explored and characterized the notions of --continuous (resp. --irresolute) functions between in the sense of Šostak [6]. Additionally, Kim and Abbas [15] introduced several types of r--compactness on in the sense of Šostak [6].
The notion of fuzzy soft sets (-sets) was first presented in 2001 by the author of [26], which combines -set [27] and -set [1]. Thereafter, the notion of an -topology was defined and many of its properties such as -continuity, -closure operators, -interior operators, and -subspaces were introduced in [28,29]. Also, a novel approach to discussing -separation and -regularity axioms using -sets was introduced by Taha [30,31] based on the approach developed by Aygünoǧlu et al. [28]. Moreover, the notions of r--regularly-open, r--pre-open, r--semi-open, r---open, and r---open sets were introduced by the authors of [32-35] based on the approach developed by Aygünoǧlu et al. [28]. Additionally, Alshammari et al. [36] defined and investigated the notions of r---open sets and --continuous functions. Overall, Taha [37] introduced and discussed the notions of -almost (resp. -weakly) r-minimal continuity, which are weaker forms of -r-minimal continuity [33] based on the approach developed by Aygünoǧlu et al. [28].
We lay out the remainder of this article as follows.
Section 2 contains some basic definitions and results that help in understanding the obtained results. In
Section 3, we display a novel class of
-open sets, called
r-
-
-open sets on
in the sense of Šostak [6]. The class of
r-
-
-open sets is contained in the class of
r-
-
-open sets and contains all
r-
-
-open,
r-
-pre-open, and
r-
-semi-open sets. Some properties of
r-
-
-open sets along with their mutual relationships have been specified with the help of some illustrative examples. After that, we define the concepts of
-
-closure and
-
-interior operators, and study some of their properties. In
Section 4, we explore and investigate the concepts of
-
-continuous (resp.
-
-irresolute) functions between
and
. Moreover, we define and study the concepts of
-almost (resp.
-weakly)
-continuous functions, which are weaker forms of
-
-continuous functions. We also showed that
-
-continuity ⟹
-almost
-continuity ⟹
-weakly
-continuity, but the converse may not be true. In
Section 5, we introduce and discuss some novel
-functions using
r-
-
-open and
r-
-
-closed sets, called
-
-open (resp.
-
-irresolute open,
-
-closed,
-
-irresolute closed, and
-
-irresolute homeomorphism) functions. Furthermore, we define some new types of
-separation axioms, called
r-
-
-regular (resp.
r-
-
-normal) spaces, and study some properties of them. Also, we explore and discuss some new types of
-compactness, called
r-
-almost (resp.
r-
-nearly)
-compact sets using
r-
-
-open sets. In the last section, we close this article with conclusions and proposed future papers.
2. Preliminaries
In this manuscript, nonempty sets will be denoted by M, N, W, etc. On M, is the class of all -sets. For , , for each . Also, for , for each .
An -point on M is an -set, defined as follows: if , and for any . Moreover, we say that belong to (), if . On M, is the class of all -points.
On M, an -set is a quasi-coincident with (), if there is , with . Otherwise, is not quasi-coincident with ().
Lemma 2.1.
Let . Thus,
(1) iff there is such that ,
(2) if , then ,
(3) iff ,
(4) iff implies iff implies iff implies ,
(5) iff there is such that .
Definition 2.1.
A mapping is said to be a fuzzy topology on M if it satisfies the following conditions:
(1)
(2) for each
(3) for each
Thus, is said to be a fuzzy topological space () in the sense of Šostak.
Definition 2.2.
In an
, for each
and
(where
), we define
-operators
and
as follows:
Definition 2.3.
Let be an , , and . An -set is said to be r--regularly-open (resp. r--pre-open, r---open, r--semi-open, r---open, and r--open) if (resp. , , , , and ).
Definition 2.4.
Let be an , , and . An -set is said to be r--compact (resp. r--nearly compact and r--almost compact) iff for every family , with , there is a finite sub-set of , with (resp. and ).
Definition 2.5.
Let and be . An -function is said to be
(1) -continuous if , for every ;
(2) -open if , for every ;
(3) -closed if , for every .
Definition 2.6.
Let and be and . An -function is said to be --continuous (resp. -pre-continuous, -semi-continuous, and --continuous) if is an r---open (resp. r--pre-open, r--semi-open, and r---open) set, for every with .
Some basic notations and results that we need in the sequel are found in [7-15].
3. On r-Fuzzy -Open Sets
Here, we define and study a new class of -open sets, called r---open sets on in the sense of Šostak [6]. The class of r---open sets is contained in the class of r---open sets and contains all r---open, r--pre-open, and r--semi-open sets. Also, we explore the concepts of --closure and --interior operators, and investigate some of their properties.
Definition 3.1. Let be an and . An -set is said to be
(1) r---open set if ;
(2) r---closed set if .
Remark 3.1. The complement of r---open set (resp., r---closed set) is r---closed set (resp., r---open set).
Proposition 3.1. In an , for each and ,
(1) every r--pre-open set is r---open;
(2) every r---open set is r---open;
(3) every r--semi-open set is r---open.
Proof. (1) If
is an
r-
-pre-open set,
Thus, is r---open set.
(2) If
is an
r-
-
-open set,
Thus, is r---open set.
(3) If
is an
r-
-semi-open set,
Thus, is r---open set.
□
Remark 3.2. From the previous discussions and definitions, we have the following diagram.
Remark 3.3. The converse of the above diagram fails as Examples 3.1, 3.2, and 3.3.
Example 3.1. Let
and define
as follows:
,
,
. Define
as follows:
Thus, is ---open set, but it is neither --pre-open nor ---open.
Example 3.2. Let
and define
as follows:
,
. Define
as follows:
Thus, is ---open set, but it is not --semi-open.
Example 3.3. Let
and define
as follows:
,
. Define
as follows:
Thus, is ---open set, but it is not ---open.
Corollary 3.1. In an and ,
(1) the union of r---open sets is r---open;
(2) the intersection of r---closed sets is r---closed.
Proof. Easily proved by Definition 3.1. □
Corollary 3.2. In an , for each r---closed set :
(1) If is an r--regularly-open set, then is r--pre-closed.
(2) If is an r--regularly-closed set, then is r--semi-closed.
(3) If , then is r--semi-closed.
(4) If , then is r--pre-closed.
Proof. The proof follows by Definitions 2.3 and 3.1. □
Corollary 3.3. In an , for each r---open set :
(1) If is an r--regularly-open set, then is r--semi-open.
(2) If is an r--regularly-closed set, then is r--pre-open.
(3) If , then is r--pre-open.
(4) If , then is r--semi-open.
Proof. The proof follows by Definitions 2.3 and 3.1. □
Definition 3.2. In an , for each and , we define an --closure operator as follows:
Proposition 3.2. In an , for each and . An -set is r---closed iff .
Proof. Easily proved from Definition 3.2. □
Theorem 3.1. In an , for each and . An -operator satisfies the following properties.
(1) .
(2) .
(3) if .
(4) .
(5) .
(6) .
Proof. (1), (2), and (3) are easily proved by Definition 3.2.
(4) From (2) and (3), . Now, we show . If does not contain , there is and with
Since , by Definition 3.2, there is as an r---closed set and with . Since , then . Again, by the definition of , .
Hence, , which is a contradiction for . Thus, . Therefore, .
(5) Since and , hence by (3), and . Thus, .
(6) From Proposition 3.2 and is an r---closed set, then .
□
Definition 3.3. In an , for each and , we define an --interior operator as follows:
Proposition 3.3. Let be an , , and . Then
(1) ;
(2) .
Proof. (1) For each and , we have = .
(2) Similar to that of (1).
□
Proposition 3.4. In an , for each and . An -set is r---open iff .
Proof. Easily proved from Definition 3.3. □
Theorem 3.2. In an , for each and . An -operator satisfies the following properties.
(1) .
(2) .
(3) if .
(4) .
(5) .
Proof. The proof is similar to that of Theorem 3.1.
□
4. On Fuzzy -Continuity
Here, we define and discuss the concepts of --continuous and --irresolute functions between and . We also define and study the concepts of -almost and -weakly -continuous functions, which are weaker forms of --continuous functions. We showed that --continuity ⟹-almost -continuity ⟹-weakly -continuity, but the converse may not be true.
Definition 4.1. An -function is called
(1) --continuous if is an r---open set, for every with ;
(2) --irresolute if is an r---open set, for every r---open set .
Remark 4.1. From the previous definitions, we have the following diagram.
Remark 4.2. The converse of the above diagram fails as Examples 4.1, 4.2, and 4.3.
Example 4.1. Let
and define
as follows:
,
,
. Define
-topologies
as follows:
Thus, the identity -function is --continuous, but it is neither -pre-continuous nor --continuous.
Example 4.2. Let
and define
as follows:
,
,
. Define
-topologies
as follows:
Thus, the identity -function is --continuous, but it is not -semi-continuous.
Example 4.3. Let
and define
as follows:
,
. Define
-topologies
as follows:
Thus, the identity -function is --continuous, but it is not --continuous.
Theorem 4.1. An -function is --continuous iff for any and any with containing , there is that is r---open containing with .
Proof. (⇒) Let and with containing , then . Since , then we obtain (say). Hence, is r---open containing with .
(⇐) Let and with and . According to the assumption there is that is r---open containing with . Hence, and . Thus, , so is an r---open set. Then, h is --continuous.
□
Theorem 4.2. Let be an -function and , the following statements are equivalent for every and :
(1) h is --continuous.
(2) is r---closed, for every with .
(3) .
(4) .
(5) .
Proof. (1) ⇔ (2) The proof follows by and Definition 4.1.
(2) ⇒ (3) Let
. By (2), we have
is
r-
-
-closed. Thus,
Therefore,
.
(3) ⇒ (4) Let . By (3), . Thus, .
(4) ⇔ (5) The proof follows by and Proposition 3.3.
(5) ⇒ (1) Let with . By (5), we obtain . Then, . Thus, is r---open, so h is --continuous. □
Lemma 4.1. Every --irresolute function is --continuous.
Proof. The proof follows by Definition 4.1. □
Remark 4.3. The converse of Lemma 4.1 fails as Example 4.4.
Example 4.4. Let
and define
as follows:
,
. Define
-topologies
as follows:
Thus, the identity -function is --continuous, but it is not --irresolute.
Theorem 4.3. Let be an -function and , the following statements are equivalent for every and :
(1) h is --irresolute.
(2) is r---closed, for every r---closed set .
(3) .
(4) .
(5) .
Proof. (1) ⇔ (2) The proof follows by and Definition 4.1.
(2) ⇒ (3) Let
. By (2), we have
is
r-
-
-closed. Thus,
Therefore,
.
(3) ⇒ (4) Let . By (3), . Thus, .
(4) ⇔ (5) The proof follows by and Proposition 3.3.
(5) ⇒ (1) Let
be an
r-
-
-open set. By (5),
Thus, . Therefore, is r---open, so h is --irresolute. □
Proposition 4.1. Let , and be , and , be two -functions. The composition is --irresolute (resp., --continuous) if, h is --irresolute and f is --irresolute (resp., --continuous).
Proof. The proof follows from Definition 4.1. □
Definition 4.2. An -function is called -almost -continuous if , for every with .
Lemma 4.2. Every --continuous function is -almost -continuous.
Proof. The proof follows by Definitions 4.1 and 4.2. □
Remark 4.4. The converse of Lemma 4.2 fails as Example 4.5.
Example 4.5. Let
and define
as follows:
,
. Define
-topologies
as follows:
Thus, the identity -function is -almost -continuous, but it is not --continuous.
Theorem 4.4. An -function is -almost -continuous iff for any and any with containing , there is that is r---open containing with .
Proof. (⇒) Let and with containing , then . Since , then (say). Therefore, is r---open containing with .
(⇐) Let and with such that . According to the assumption there is that is r---open containing with . Hence, and . Thus, . Therefore, h is -almost -continuous.
□
Theorem 4.5. Let be an -function, , and , the following statements are equivalent:
(1) h is -almost -continuous.
(2) is r---open, for every r--regularly open set .
(3) is r---closed, for every r--regularly closed set .
(4) , for every r---open set .
(5) , for every r--semi-open set .
Proof. (1) ⇒ (2) Let and be an r--regularly open set with . Hence, by (1), there is that is an r---open with and . Thus, and . Therefore, , so is r---open.
(2) ⇒ (3) If is r--regularly closed, then by (2), is r---open. Thus, is r---closed.
(3) ⇒ (4) If
is
r-
-
b-open and since
is
r-
-regularly closed, then by (3),
is
r-
-
-closed. Since
, hence
(4) ⇒ (5) The proof follows from the fact that any r--semi-open set is r---open set.
(5) ⇒ (3) If is r--regularly closed, then is r--semi-open. By (5), . Hence, is r--b-closed.
(3) ⇒ (1) If
and
with
such that
, then
. Since
is
r-
-regularly closed, then by (3), we have
is
r-
-
-closed. Hence,
is
r-
-
-open and
Thus, . Therefore, h is -almost -continuous.
□
Definition 4.3. An -function is called -weakly -continuous if , for every with .
Lemma 4.3. Every --continuous function is -weakly -continuous.
Proof. The proof follows by Definitions 4.1 and 4.3. □
Remark 4.5. The converse of Lemma 4.3 fails as Example 4.6.
Example 4.6. Let
and define
as follows:
,
. Define
-topologies
as follows:
Thus, the identity -function is -weakly -continuous, but it is not --continuous.
Theorem 4.6. An -function is -weakly -continuous iff for any and any with containing , there is that is r---open containing with .
Proof. (⇒) Let and with containing , then . Since , then (say). Hence, is r---open containing with .
(⇐) Let and with such that . According to the assumption there is that is r---open containing with . Hence, and . Thus, . Therefore, h is -weakly -continuous.
□
Theorem 4.7. Let be an -function, the following statements are equivalent:
(1) h is -weakly -continuous.
(2) , if with .
(3) .
(4) .
Proof. (1) ⇔ (2) The proof follows by Proposition 3.3 and Definition 4.3.
(2) ⇒ (3) Let
. Hence by (2),
Thus, .
(3) ⇔ (4) The proof follows from Proposition 3.3.
(4) ⇒ (1) Let with . Hence by (4), . Thus, , so h is -weakly -continuous. □
Lemma 4.4. Every -almost -continuous function is -weakly -continuous.
Proof. The proof follows by Definitions 4.2 and 4.3. □
Remark 4.6. The converse of Lemma 4.4 fails as Example 4.7.
Example 4.7. Let
and define
as follows:
,
. Define
-topologies
as follows:
Thus, the identity -function is -weakly -continuous, but it is not -almost -continuous.
Remark 4.7. From the previous discussions and definitions, we have the following diagram.
Proposition 4.2. Let , and be , and , be two -functions. The composition is -almost -continuous if, h is --irresolute (resp., --continuous) and g is -almost -continuous (resp., -continuous).
Proof. The proof follows by the previous definitions. □
5. Further Selected Topics
Here, we introduce and establish some new -functions using r---open and r---closed sets, called --open (resp. --irresolute open, --closed, --irresolute closed, and --irresolute homeomorphism) functions. Furthermore, we define some new types of -separation axioms, called r---regular and r---normal spaces, and study some properties of them. Also, we explore and discuss some new types of -compactness, called r--almost and r--nearly -compact sets using r---open sets.
Definition 5.1. An -function is called
(1) --open if is an r---open set, for every with ;
(2) --closed if is an r---closed set, for every with ;
(3) --irresolute open if is an r---open set, for every r---open set ;
(4) --irresolute closed if is an r---closed set, for every r---closed set .
Lemma 5.1. (1) Each --irresolute open function is --open.
(2) Each --irresolute closed function is --closed.
Proof. The proof follows from Definition 5.1. □
Remark 5.1. The converse of Lemma 5.1 fails as Example 5.1.
Example 5.1. Let
and define
as follows:
,
. Define
-topologies
as follows:
Thus, the identity -function is --open, but it is not --irresolute open.
Theorem 5.1. Let be an -function, the following statements are equivalent for every and :
(1) h is --open.
(2) .
(3) .
(4) For every and every with and , there is is r---closed with and .
Proof. (1) ⇒ (2) Since
, hence by (1),
is
r-
-
-open. Thus,
(2) ⇒ (3) Put , hence by (2), . Thus,
(3) ⇒ (4) Let and with such that . Since , . Hence by (3), . Then, we have Thus, there is is r---closed with and
(4) ⇒ (1) Let with . Put and , then . Hence by (4), there is is r---closed with and . Thus, . On the other hand, since , . Hence, , so is an r---open set. Therefore, h is --open.
□
Theorem 5.2. Let be an -function, the following statements are equivalent for every and :
(1) h is --closed.
(2) .
(3) .
(4) For every and every with and , there is is r---open with and .
Proof. The proof is similar to that of Theorem 5.1.
□
Theorem 5.3. Let be an -function, the following statements are equivalent for every and :
(1) h is --irresolute open.
(2) .
(3) .
(4) For every and every is an r---closed set with , there is is r---closed with and .
Proof. The proof is similar to that of Theorem 5.1.
□
Theorem 5.4. Let be an -function, the following statements are equivalent for every and :
(1) h is --irresolute closed.
(2) .
(3) .
(4) For every and every is an r---open set with , there is is r---open with and .
Proof. The proof is similar to that of Theorem 5.1.
□
Proposition 5.1. Let be a bijective -function, then h is --irresolute open iff h is --irresolute closed.
Definition 5.2. A bijective -function is called --irresolute homeomorphism if and h are --irresolute.
The proof of the following corollary is easy.
Corollary 5.1. Let be a bijective -function, the following statements are equivalent for every and :
(1) h is --irresolute homeomorphism.
(2) h is --irresolute closed and --irresolute.
(3) h is --irresolute open and --irresolute.
(4) .
(5) .
(6) .
(7) .
Definition 5.3. Let , , and . An is called
(1) r---regular space if for each r---closed set , there is with for , such that , , and .
(2) r---normal space if for each r---closed sets and , there is with for , such that , , and .
Theorem 5.5. Let be an , , , the following statements are equivalent:
(1) is r---regular space.
(2) If for each r---open set , there is with and
(3) If for each r---closed set , there is with for , such that , , and .
Proof. (1) ⇒ (2) Let for each r---open set , then . Since is r---regular, then there is with and , such that , , and . Thus, , so .
(2) ⇒ (3) Let for each r---closed set , then . By (2), there is with and . Since , then is an r---open set and . Again, by (2), there is with and . Hence, . Put , thus . Then, . Therefore, .
(3) ⇒ (1) Easily proved by Definition 5.3. □
Theorem 5.6. Let be an , , , the following statements are equivalent:
(1) is r---normal space.
(2) If for each r---closed set and r---open set , there is with and .
(3) If for each r---closed sets and , there is with for , such that , , and .
Proof. The proof is similar to that of Theorem 5.5.
□
Theorem 5.7. Let be a bijective --irresolute and -open function. If is an r---regular space (resp., r---normal space), then is an r---regular space (resp., r---normal space).
Proof. If for each r---closed set and --irresolute function h, then is an r---closed set. Put , then . Since is r---regular, there is with and such that , , and . Since h is a bijective -open, hence and Therefore, is an r---regular space. The other case also follows similar lines. □
Theorem 5.8. Let be an injective -continuous and --irresolute closed function. If is an r---regular space (resp., r---normal space), then is an r---regular space (resp., r---normal space).
Proof. If for each r---closed set and injective --irresolute closed function h, hence is an r---closed set and . Since is r---regular, there is with and such that , , and . Since h is -continuous, then , with , , and . Hence, is an r---regular space. The other case also follows similar lines.
□
Theorem 5.9. Let be a surjective --irresolute, -open, and -closed function. If is an r---regular space (resp., r---normal space), then is an r---regular space (resp., r---normal space).
Proof. The proof is similar to that of Theorem 5.7.
□
Definition 5.4. Let be an , , and . An -set is called r---compact if for each family with , there is a finite sub-set of with .
Lemma 5.2. In an , every r---compact set is r--compact.
Proof. The proof follows from Definitions 2.4 and 5.4.
□
Theorem 5.10. Let be an --continuous function, then is an r--compact set if is an r---compact set.
Proof. Let with , then is } (by h is --continuous) with . Since is r---compact, there is a finite sub-set of with . Hence, . Therefore, is r--compact. □
Definition 5.5. Let be an , , and . An -set is called r--almost -compact if for each family with , there is a finite sub-set of with .
Lemma 5.3. In an , every r--almost -compact set is r--almost compact.
Proof. The proof follows from Definitions 2.4 and 5.5.
□
Lemma 5.4. In an , every r---compact set is r--almost -compact.
Proof. The proof follows from Definitions 5.4 and 5.5.
□
Remark 5.2. The converse of Lemma 5.4 fails as Example 5.2.
Example 5.2. Let
,
, and
defined as follows:
Also,
ℑ defined on
W as follows:
Thus, W is --almost -compact, but it is not ---compact.
Theorem 5.11. Let be an -continuous function, then is an r--almost compact set if is an r--almost -compact set.
Proof. Let
with
, then
is
} (by
h is
-
-continuous), such that
. Since
is
r-
-almost
-compact, there is a finite sub-set
of
with
. Since
h is
-continuous function,
Hence, . Therefore, is r--almost compact. □
Definition 5.6. Let be an , , and . An -set is called r--nearly -compact if for each family with , there is a finite sub-set of with .
Lemma 5.5. In an , every r--nearly -compact set is r--nearly compact.
Proof. The proof follows from Definitions 2.4 and 5.6.
□
Lemma 5.6. In an , every r---compact set is r--nearly -compact.
Proof. The proof follows from Definitions 5.4 and 5.6.
□
Remark 5.3. The converse of Lemma 5.6 fails as Example 5.3.
Example 5.3. Let
,
, and
defined as follows:
Also,
ℑ defined on
W as follows:
Thus, W is --nearly -compact, but it is not ---compact.
Theorem 5.12. Let be an -continuous and -open, then is an r--nearly compact set if is an r--nearly -compact set.
Proof. Let
with
, then
is
} (by
h is
-
-continuous), such that
. Since
is
r-
-nearly
-compact, there is a finite sub-set
of
, such that
. Since
h is
-continuous and
-open,
Therefore, is r--nearly compact. □
Lemma 5.7. In an , every r--nearly -compact set is r--almost -compact.
Proof. The proof follows from Definitions 5.5 and 5.6.
□
Remark 5.4. From the previous discussions and definitions, we have the following diagram.