1. Introduction and Preliminaries
Classical mathematical theories fail to tackle complex problems with uncertain data in a variety of fields, including engineering, the environment, economics, medical science, social science, and others. Probability theories, fuzzy sets [
1], rough sets [
2], intuitionistic fuzzy sets [
3], and vague sets [
4] are all considered mathematical tools for dealing with uncertainty. According to Molodtsov [
5], each of these structures has its own set of difficulties. These difficulties are mostly due to shortcomings in the parameterization tool for theories. Molodtsov [
5] defined soft sets to deal with uncertainty away from these difficulties. Several researchers have presented and investigated the theory of soft sets (see [
6,
7]). Soft sets were used in a range of applications by the authors [
5,
8], including operation research, game theory, Riemann integration, Perron integration, smoothness of function, probability, and measurement theory. In addition, the authors [
9] used soft sets to solve decision-making difficulties.
Several researchers have used soft set theory to study various mathematical structures. Soft topology is one of the structures presented as a novel expansion of classical topology by Shabir and Naz [
10]. Many classical topological notions have been developed and expanded in soft set contexts (see, [
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
23,
24,
25]), but significant additions remain potential. Thus, the study of soft topology is a current trend among topological researchers.
We expect that by defining a reasonable new class of soft sets in soft topological spaces, we will pave the way for a lot of future research articles on the subject. Soft
-open sets, for example, were presented in [
26] as a generalization of soft open sets in soft topological spaces, and other related research articles, such as [
14,
24,
25], have appeared. In this paper, we will combine the classes of soft regular open sets and soft
-closed sets to define soft regular generalized
-closed sets as a new class of sets that contains the classes of soft regular closed sets and soft regular generalized
-closed sets. We will also introduce several results for some weaker forms of soft
spaces.
In
Section 2, we introduce the notion of soft regular generalized
-closed sets and illustrate its relationships with each of the soft regular closed sets and soft regular generalized
-closed sets as two well-known classes of soft sets. Additionally, we investigate the main properties of this new class of soft sets.
In
Section 3, we introduce and investigate soft
-
spaces, soft regular generalized
, and soft regular generalized
-
as three new classes of STSs. We focus on their characterizations.
In this paper, STS and TS will be used in this study to signify soft topological space and topological space, respectively. We shall use the concepts and terminologies from [
14,
26,
27] throughout this paper.
Now, we shall recollect several notions that will be employed in the sequel.
Definition 1 ([28]). Let be a TS, , and . Then y is a condensation point of D if for each with , the set is uncountable. D is called an ω-closed set in if it contains all its condensation points. D is called an ω-open set in if is an ω-closed set in . The collection of all ω-open sets in is denoted by .
Definition 2. Let be a TS and let . Then V is called
- (a)
Ref. [29] a generalized closed (briefly: g-closed) set in if whenever and . The collection of all g-closed sets in is denoted by . - (b)
Ref. [29] a generalized open (briefly: g-open) set in if . The collection of all g-open sets in is denoted by . - (c)
Ref. [30] a generalized ω-closed (briefly: -closed) set in if whenever and . The collection of all -closed sets in is denoted by . - (d)
Ref. [30] a generalized ω-open (briefly: -open) set in if . The collection of all -open sets in is denoted by . - (e)
Ref. [31] a regular open set in if . The collection of all regular open sets in is denoted by . Complements of regular open sets are called regular closed sets. The collection of all regular closed sets in is denoted by . - (f)
Ref. [32] a regular generalized closed (briefly: -closed) set in if whenever and . The collection of all -closed sets in is denoted by . Complements of -closed sets are called -open sets. The collection of all -open sets in is denoted by . - (g)
Ref. [33] a regular generalized ω-closed (briefly: -closed) set in if whenever and . The collection of all -closed sets in is denoted by . Complements of -closed sets are called -open sets. The collection of all -open sets in is denoted by .
Definition 3. Let Y be a universal set and E be a set of parameters. Then defined by
- (a)
Ref. [27] is denoted by . - (b)
Ref. [27] for every is denoted by . - (c)
Ref. [34] is denoted by and is called a soft point.
The set of all soft points in is denoted .
Definition 4 ([34]). Let and . Then is said to belong to H (notation: ) if or equivalently: if and only if .
Theorem 1 ([5]). Let be a STS. Then for each , the collection defines a topology on Y. This topology is called an induced topology on Y and is denoted by .
Theorem 2 ([35]). For any TS and any set of parameters E. The collectionforms a soft topology on Y relative to E. This soft topology is denoted by . Theorem 3 ([27]). For any collection of TSs , the familyforms a soft topology on Y relative to E. This soft topology is denoted by . Definition 5 ([27]). Let be a STS and let . Then K is called a soft ω-open set in if for each , there exist and such that . The family of all soft ω-open set in is denoted by .
Definition 6. Let be a STS and let . Then K is called
- (a)
Ref. [36] a soft generalized closed (briefly: soft g-closed) set in if whenever and . The collection of all soft g-closed sets in is denoted by . - (b)
Ref. [36] a soft generalized open (briefly: soft g-open) set in if . The collection of all soft g-open sets in is denoted by . - (c)
Ref. [14] a soft generalized ω-closed (briefly: soft -closed) set in if whenever and . The collection of all soft -closed sets in is denoted by . - (d)
Ref. [37] a soft regular open set in if . The collection of all soft regular open sets in is denoted by . Soft complements of soft regular open sets are called soft regular closed sets. The collection of all soft regular closed sets in is denoted by . - (e)
Ref. [37] a soft regular generalized closed (briefly: soft -closed) set in if whenever and . The collection of all soft -closed sets in is denoted by . Complements of -closed sets are called -open sets. The collection of all -open sets in is denoted by .
2. Soft Regular Generalized -Closed Sets
Definition 7. A soft subset H of a STS is called a soft regular generalized ω-closed set (simply: soft -closed) in if whenever and . The collection of all soft -closed sets in will be denoted by .
Theorem 4. For any STS, .
Proof. Let and let such that . Then and thus, . Hence, . □
The following example shows that , in general:
Example 1. Let , , and Then . Let with . Then and . Since and while , then . To show that , let such that . Then either or . In both cases we must have . Hence, .
Theorem 5. For anysoft anti-locally countable STS , .
Proof. Let
be soft anti-locally countable. Then according to Theorem 4 we have
. To show that
, let
and let
such that
. Then
. On the other hand, according to Theorem 14 of [
26],
. Therefore,
. Hence,
. □
Theorem 6. For any STS, .
Proof. Let and let such that . Since , then and so . Therefore, . □
The following example shows that , in general:
Example 2. Let , , such that , and . Since , then . To show that , let such that , then and so . On the other hand, since and but , then .
Theorem 7. For any STS, .
Proof. Let and let such that . Since , then . Hence, . □
The following example will show that , in general:
Example 3. Let , , μ be the usual topology on , and . Then .
Theorem 8. Let be soft locally countable. Then .
Proof. Follows from Theorem 6 and Theorem 4 of [
14]. □
The following question is natural:
Question 1. Letbe a STS. Is it true that?
The following example provides a negative response to Question 1:
Example 4. Let , , μ be the usual topology on , and . Let . Since , then by Theorem 2 (d) of [26], , and so . Thus, for every such that , we have . Hence, . Now, since but , then . Theorem 9. Let be a STS. If , then the only soft regular closed set in which is soft contained in is .
Proof. Let and be a soft regular closed set in such that . Then and . Since and , then , and thus . On the other hand, since , then . It follows that . □
Question 2. Letbe a STS and letsuch that the only soft regular closed set inwhich is soft contained inis. Is it true that?
Theorem 10. Let be a STS. If and such that , then .
Proof. Let and such that . Let such that . Since , then . Since , then . Since , then and thus . Therefore, . Hence, . □
Theorem 11. Let be a STS and let . Then .
Proof. Let . Let such that . Then and . So, and . Thus, . Hence, . □
For a STS , is not closed under arbitrary soft union:
Example 5. Let , , μ be the usual topology on , and . For each , let . Then and . Since such that while , then .
Theorem 12. Let be a STSand let be soft locally finite in such that . .
Proof. Let
with
. Then for each
,
, and so
. Since
is soft locally finite in
, then by Lemma 3.5 of [
24],
. Hence,
. □
For a given STS , the following example shows that is not closed under finite soft intersection:
Example 6. Let , , , , , , and . Then . Let such that and . If such that , then and . Thus, . Similarly, we can see that . Since , then and . Since but , then .
Theorem 13. Let be a STS and let Z be a non-empty subset of Y. Let . If , then .
Proof. Let
and let
such that
. Choose
such that
. Since
and
, then
, and so
. On the other hand, by Theorem 15 of [
26],
and thus,
. Hence,
. □
Theorem 14. Let be a STS and let Z be a non-empty subset of Y such that . Let . If , then .
Proof. Let
and let
such that
. Then
. Since
, then
. Since by Theorem 15 of [
26] we have
, then
. Also,
□
Therefore, .
The following are natural questions:
Question 3. Letbe a STS and let. Is it true thatfor each?
Question 4. Letbe a STS and let. Is it true thatfor each?
The next four results give partial answers of these two questions:
Theorem 15. Let be an indexed family of TSs. Let . Then if and only if for all .
Proof. Necessity. Let
and let
. Let
such that
. Let
defined by
and
if
. Since
for every
, then by Proposition 3.28 of [
38],
. Since
and
, then
and so
. On the other hand, by Lemma 4.9 of [
25],
. This ends the proof.
Sufficiency. Let
for all
. Let
such that
. Then for every
,
. Also, by Proposition 3.28 of [
38],
for all
. So,
for all
. Thus, by Lemma 4.9 of [
25],
for all
. Hence,
. Therefore,
. □
Corollary 1. Let be a TS and E be any set of parameters. Let . Then if and only if for all .
Proof. For each , put . Then . Thus, by Theorem 15, we get the result. □
Theorem 16. Let be an indexed family of TSs. Let . Then if and only if for all .
Proof. Necessity. Let
and let
. Let
such that
. Let
defined by
and
if
. Since
for every
, then by Proposition 3.28 of [
38],
. Since
and
, then
and so
. On the other hand, by Lemma 4.7 of [
25],
. This shows that
.
Sufficiency. Let
for all
. Let
such that
. Then for every
,
. Also, by Proposition 3.28 of [
38],
for all
. So,
for all
. Thus, by Lemma 4.7 of [
25],
for all
. Hence,
. Therefore,
. □
Corollary 2. Let be a TS and A be any set of parameters. Let . Then if and only if for all .
Proof. For each , put . Then . Thus, by Theorem 16, we get the result. □
Definition 8. Let be a STS and let . Then K is called a soft regular generalized ω-open (simply: soft -open) set in if . The family of all soft -open sets in will be denoted by .
Theorem 17. Let be a STS and let . Then if and only if whenever such that .
Proof. Necessity. Suppose that and let such that . Then , , and . So, . But . Thus, and hence .
Sufficiency. Suppose that whenever such that . We will show that . Let such that . Then we have such that . Thus, and hence . But . It follows that . □
Theorem 18. Let be a STS and let . Then .
Proof. Let . Then . So by Theorem 11, . Hence, . □
For a STS , is not closed under arbitrary soft intersection:
Example 7. Let , , μ be the usual topology on , and . For each , let . Then and . Since by Example 5, , then .
Theorem 19. Let be a STSand let such that is soft locally finite in , then .
Proof. Since , then . Then by Theorem 12, . But . It follows that . □
For a given STS , the following example shows that is not closed under finite soft union:
Example 8. Let , , , , , , and . Let such that and . Since by Example 6, but , then but .
Theorem 20. Let be a STS. If such that the pair is soft separation relative to , then .
Proof. Let
such that
. Then
and
□
So, by Theorem 17, we have
and
. Now,
Thus, by Theorem 17, .
Theorem 21. Let be a STS and let and . If , then .
Proof. Suppose that and such that . Then . Since , then by Theorem 9, . Hence, . □
3. Separation Axioms
Definition 9. A TS is called ω- if .
Example 9. Let and . Since , then is not ω-.
Theorem 22. A TS is ω- if and only if for each , .
Proof. Necessity. Let be - and let . Suppose that . Then . We are going to show that . Let such that . Then either or . Since , then and thus . Therefore, . Since is -, then . Hence, .
Sufficiency. Let for every . Suppose to the contrary that there exists . Then and there exists . By assumption, . If , then and thus . But V. Thus, we must have and hence . Since V, then . Since , then . But , a contradiction. □
Theorem 23. Every locally countable TS is ω-.
Proof. Let
be locally countable. Then by Corollary 2.4 of [
39],
is a discrete TS and thus
for every
. Thus, by Theorem 22,
is
-
. □
The following example demonstrates that the contrary of Theorem 23 does not have to be true in general:
Example 10. Let and μ be the topology on having as a base. It is clear that is not locally countable. To see that is ω-. Let . If , then we have with and is a countable set, and hence . If , then with and , and so , hence, . Thus, by Theorem 22, is ω-.
Theorem 24. Every TS is ω-.
Proof. Suppose that
is
and let
, then by Theorem 2.5 of [
39],
. Therefore, by Theorem 22,
is
-
. □
Example 11. Let be as in Example 10. We proved that is ω-. It is clear that . If , then there exists such that . Thus, which is impossible. Hence, . It follows that and so is not .
Theorem 25. For a locally countable TS , the following are equivalent:
- (a)
is .
- (b)
is .
- (c)
is ω-.
Proof. (a) ⟹ (b): Obvious.
(b) ⟹ (c): Follows from Theorem 24.
(c) ⟹ (a): Follows from Definition 3.1 and Corollary 2.4 of [
39]. □
Theorem 26. Let be a TS and let Z be a non-empty subset of Y. If is ω-, then is ω-.
Proof. Suppose that
is
-
. Let
. Since
is
-
, then
. Thus,
. But by Theorem 15 of [
26],
. It follows that
is
-
. □
Definition 10. A STS is called soft ω- if .
Theorem 27. A STS is soft ω- if and only if for each , .
Proof. Necessity. Let be soft -. Let . Suppose that . Then . Now we will show that . Let such that . Since , then and thus . Hence, . Since is soft -, then . Therefore, .
Sufficiency. Let for every . Suppose to the contrary that there exists . Then and there exists . By assumption, . If , then and thus . But . Thus, we must have and hence . Since , then . Since , then . But , a contradiction. □
Theorem 28. If is a soft ω- STS, then is ω- for every .
Proof. Let
be soft
-
and let
. Let
. Since
is soft
-
, then by Theorem 27,
, and so
. But by Theorem 7 of [
26],
. Hence, by Theorem 22,
is
-
. □
Theorem 29. Let be an indexed family of TSs. Then is soft ω- if and only if is ω- for every .
Proof. Necessity. Let
be soft
-
and let
. Then by Theorem 28,
is
-
. Also, by Theorem 3.7 of [
27],
. Therefore,
is
-
.
Sufficiency. Let
be
-
for every
. Let
. Since
is
-
, then by Theorem 22,
. Thus,
. But by Theorem 8 of [
26],
. Hence, by Theorem 27,
is soft
-
. □
Theorem 30. Let be a TS and A be any set of parameters. Then is soft ω- if and only if is ω-.
Proof. For every , let . Then . This, by Theorem 29 we get the result. □
Theorem 31. Every soft STS is soft ω-.
Proof. Follows from Definition 3.10 and Theorem 28 of [
14]. □
Example 11 of [
14] shows that Theorem 31 is not reversible, in general.
Theorem 32. For a soft anti-locally countable STS , the following are equivalent:
- (a)
is soft .
- (b)
is soft .
- (c)
is soft ω-.
Proof. (a) ⟹ (b): Obvious.
(b) ⟹ (c): Follows from Theorem 31.
(c) ⟹ (a): Follows from Definition 10 of this paper and Theorem 29 of [
14]. □
Theorem 33. Let be a STS and let Z be a non-empty subset of Y. If is soft ω-, then is soft ω-.
Proof. Suppose that
is soft
-
. Let
. Then
. Since
is soft
-
, then by Theorem 3.11,
. Thus,
. But by Theorem 15 of [
26],
. Hence, by Theorem 27,
is soft
-
. □
Theorem 34. Every soft locally countable STS is soft ω-.
Proof. Let
be soft locally countable. Then by Corollary 5 of [
26],
is a discrete STS and so
for every
. Thus, by Theorem 27,
is soft
-
. □
The converse of Theorem 34 need not be true, in general:
Example 12. Let be as in Example 10. Consider the STS . Then clearly that is not soft locally countable. On the other hand, since is ω-, then by Theorem 30, is soft ω-.
Definition 11. A STS is called soft regular generalized (simply -) if .
Theorem 35. A STS is soft - if and only if for each , .
Proof. Necessity. Let be soft -. Let . Suppose that . Then . Now we will show that . Let such that . Since , then and thus . Hence, . Since is soft -, then . Therefore, .
Sufficiency. Let for every . Suppose to the contrary that there exists . Then and there exists . By assumption, . If , then and thus . But . Thus, we must have and hence . Since , then . Since , then . But , a contradiction. □
Theorem 36. For a STS, the following are equivalent:
- (a)
is soft -.
- (b)
is a soft discrete STS.
Proof. (a) ⟹ (b): We will show that . Suppose to the contrary that there exists . Then by Theorem 36, and so . Thus, and hence , a contradiction.
(b) ⟹ (a): Obvious. □
Definition 12. A STS is called soft regular generalized ω- (simply -) if .
Theorem 37. A STS is soft - if and only if for each , .
Proof. Necessity. Let be soft -. Let . Suppose that . Then . Now we will show that . Let such that . Since , then and thus . Hence, . Since is soft -, then . Therefore, .
Sufficiency. Let for every . Suppose to the contrary that there exists . Then and there exists . By assumption, . If , then and thus . But . Thus, we must have and hence . Since , then . Since , then . But , a contradiction. □
Lemma 1. A STS is soft locally countable if and only if is a soft discrete STS.
Proof. Straightforward. □
Theorem 38. For a STS, the following are equivalent:
- (a)
is soft -.
- (b)
is a soft discrete STS.
- (c)
is soft locally countable.
Proof. (a) ⟹ (b): We will show that . Suppose to the contrary that there exists . Then by Theorem 37, and so . Thus, and hence , a contradiction.
(b) ⟹ (c) and (c)⟹ (b) follow from Lemma 1.
(b) ⟹ (a): Obvious. □