2. Soft Generalized -Closed Sets
In this section, we introduce the notion of soft generalized -closed and illustrate its relationships with each of the soft generalized closed sets and soft -closed sets as two famous classes of soft sets. Additionally, we determine the behavior of soft generalized -closed sets relative to soft unions, soft intersections, soft subspaces, and generated soft topologies, and we explore soft images and soft inverse images of soft generalized closed sets and soft generalized -closed sets under soft continuous, soft closed soft transformations.
The following definition is the main concept of this section:
Definition 7 ([21]).Let be an STS, and let F∈. Then, F is said to be a soft generalized ω-closed (briefly: soft -closed) set in if whenever and . The collection of all soft -closed sets in will be denoted by . In Theorems 1 and 2 and Example 1, we discuss the relationships between the classes of soft -closed sets and soft g-closed sets:
Theorem 1. For any STS, .
Proof. Let , and let such that . Then, , and so . Thus, . □
The following example will show that the inclusion in Theorem 1 cannot be replaced by equality in general:
Example 1. Let , , and . Let . Then, , , and . To see that , let such that . Then, , and since and , while , which is not a soft subset of F, then .
Theorem 2. If is a soft anti-locally countable STS, then .
Proof. Suppose that
is soft anti-locally countable. Then, by Theorem 1,
. To see that
, let
, and let
such that
. Then,
. By Theorem 14 of [
2],
, and so
. Therefore,
. □
In Theorem 3 and Example 2, we discuss the relationships between the classes of the soft -closed sets and soft -closed sets:
Theorem 3. For any STS, .
Proof. Let , and let such that . Since , then . Hence, . □
The following example will show that the inclusion in Theorem 3 cannot be replaced by an equality in general:
Example 2. Let , , ℑ be the usual topology on , and . Then, .
In the next theorem, we classify the class of soft -closed sets in soft locally countable STSs:
Theorem 4. If is a soft locally countable STS, then is a discrete STS.
Proof. Let
, and let
such that
. Since
is soft locally countable, then by Corollary 5 of [
2],
. Therefore,
. Hence,
. □
In Theorem 5 and Corollary 1, we show that the classes of soft -closed sets, soft -closed sets, and soft -closed sets coincide in soft -topological spaces:
Theorem 5. For any STS, .
Proof. Let
. We are going to show that
. Suppose to the contrary that there exists
. Since
, and
, then
. On the other hand, by Theorem 5 of [
2],
. Thus,
, which is a contradiction. □
Corollary 1. For any STS, .
Proof. Clearly, . Additionally, by Theorems 1 and 5, . Therefore, . □
It is natural to inquire about the relationships between the classes and of a given STS . In Theorem 6 and Example 3, we provide answers to this inquiry:
Theorem 6. For any STS, .
Proof. Let , and let such that . Then, . Therefore, . □
The following example will show that the inclusion in Theorem 6 cannot be replaced by an equality in general:
Example 3. Let , and . Let . If such that , then , and so . Hence, .
Claim 1. .
Proof of Claim. Suppose to the contrary that
. Then, there exists
such that
and
. Since
, then
, and so
This is a contradiction.
By the above claim, we have . Since and , but is not a soft subset of F, then . □
The following question is natural:
Question 1. Let be an STS. Is it true that ?
The following example gives a negative answer for Question 1:
Example 4. Let , , ℑ be the usual topology on , and . Let . Since , then by Theorem 2 (d) of [2], , and so . Thus, for every such that , we have . Hence, . On the other hand, since while , which is not a soft subset of F, then . In the next theorem, we introduce an important property of -closed sets:
Theorem 7. Let be an STS. If , then the only soft closed set in which is soft contained in is .
Proof. Let and such that . Then, and . Since and , then , and so . On the other hand, since , then . Therefore, . □
We leave the question about the converse of Theorem 7 open:
Question 2. Let be an STS, and let such that the only soft closed set in which is soft contained in is . Is it true that ?
In the next theorem, we introduce a sufficient condition for a soft set to be soft -closed:
Theorem 8. Let be an STS, and let such that the only soft ω-closed set in which is soft contained in is . Then, .
Proof. Let such that the only soft -closed set in which is soft contained in is . Suppose to the contrary that . Then, there exists such that , but is not a soft subset of G. Therefore, we have with , which is a contradiction. □
We leave the question about the converse of Theorem 8 open:
Question 3. Let be an STS, and let . Is it true that the only soft -closed set which is soft contained in is ?
Now, we are going to discuss soft operations on -closed sets in Theorems 9–14, and Examples 5–7:
Theorem 9. Let be an STS. If and such that , then .
Proof. Let and such that . Let such that . Since , then . Since , then . Since , then , and so . Thus, , and hence, . □
Theorem 10. For any STS, the family is closed under a finite soft union.
Proof. It is sufficient to show that the soft union of two elements of is an element of . Let . Let such that . Then, and . Therefore, and . Thus, , and therefore, . □
The following example shows that the family need not be closed under a countable soft union:
Example 5. Let , , ℑ be the usual topology on and . For each , let . Then, and . Since with while is not a soft subset of , then .
Theorem 11. Let be an STS, and let . If is soft locally finite in , then .
Proof. Let
such that
. For each
,
with
,
. Since
is soft locally finite in
, then by Lemma 3.5 of [
10],
. Hence,
. □
The following example shows that the finite soft intersection of soft -closed sets of an STS need not be soft -closed in :
Example 6. Let , and . Let and . Then , while .
Theorem 12. Let be an STS. If and , then .
Proof. Suppose that
and
. Let
such that
. Put
. Then,
and
. Since
, then
, and thus
Therefore, . □
Theorem 13. Let be an STS, and let Y be a non-empty subset of X. Let . If , then .
Proof. Let
, and let
such that
. Choose
such that
. Since
and
, then
, and thus
. On the other hand, by Theorem 15 of [
2],
, and thus
. Therefore,
. □
Theorem 14. Let be an STS, and let Y be a non-empty subset of X such that . Let . If , then .
Proof. Let
, and let
such that
. Then,
. Since
, then
. Since by Theorem 15 of [
2] we have
, then
, and finally
Thus, . □
The condition “” cannot be dropped in Theorem 14, as demonstrated by the following example:
Example 7. Let be as in Example 6, and let . Then, .
At this stage, we believe that the following two questions are natural:
Question 4. Let be an STS, and let . Is it true that for all ?
Question 5. Let be an STS, and let . Is it true that for all ?
The following example provides negative responses to Questions 4 and 5:
Example 8. Let and . Let be defined by , , , and . Let . To see that , let such that . Then, , and so . Therefore, . Hence, (see Theorem 1). On the other hand, since while , then . Moreover, since is anti-locally countable, then by Proposition 2.2 of [26], . If the STS
is an extended STS, then we can easily apply Theorem 3 of [
3] to obtain positive answers to Questions 4 and 5.
In the next four theorems, we investigate the correspondence between g-closed sets (resp. -closed) and soft g-closed sets (resp. soft -closed) of a family of TSs and their generated STSs:
Theorem 15. Let be an indexed family of TSs. Let . Then, if and only if for all .
Proof. Necessity. Suppose that
, and let
. Let
such that
. Let
be defined by
and
if
. Then,
and
. Since
, then
, and so
. On the other hand, by Lemma 4.9 of [
5],
. This ends the proof.
Sufficiency. Suppose that
for all
, and let
such that
. Then, for each
,
, and so
. Thus, by Lemma 4.9 of [
5],
for all
Hence,
. It follows that
. □
Theorem 16. Let be a TS and A be any set of parameters. Let . Then, if and only if for all .
Proof. For each , put . Then, , and by Theorem 15, we obtain the result. □
Theorem 17. Let be an indexed family of TSs. Let . Then, if and only if for all .
Proof. Necessity. Suppose that
, and let
. Let
such that
. Let
be defined by
and
if
. Then,
and
. Since
, then
, and so
. On the other hand, according to Lemma 4.7 of [
5],
. This ends the proof.
Sufficiency. Suppose that
for all
, and let
such that
. Then, for each
,
, and so
. Thus, following Lemma 4.7 of [
5],
for all
Hence,
. It follows that
. □
Theorem 18. Let be a TS and A be any set of parameters. Let . Then, if and only if for all .
Proof. For each , put . Then, , and through Theorem 17, we obtain the result. □
In the rest of this section, we study the behavior of soft g-closed sets (soft -closed sets) under soft mappings:
Theorem 19. Let be soft continuous and soft closed. Then, for every ,.
Proof. Suppose that is soft continuous and soft closed. Let , and let such that . Since is soft continuous, then . Since and , then , and so . Since is soft closed, and , then . Since , then . Hence, . □
Theorem 20. Let be soft continuous and soft closed. Then, for every , .
Proof. Suppose that
is soft continuous and soft closed. Let
, and let
such that
. We are going to show that
. Since
is soft closed, and
, then
. Since
is soft continuous, then
. Since
, then
,
, and thus
This is true since
and
. Hence, by Theorem 3.6 of [
22],
. Therefore,
. □
Theorem 21. Let be a soft continuous function such that is soft closed. Then, for every ,.
Proof. Suppose that is a soft continuous soft function such that is soft closed. Let , and let such that . Since is soft continuous, then . Since and , then , and so . Since is soft closed, and , then . Since , then . Hence, . □
Theorem 22. Let be a soft function such that is soft continuous and is soft closed. Then, for every ,.
Proof. Suppose that
is soft continuous and
is soft closed. Let
, and let
such that
. We are going to show that
. Since
is soft closed, and
, then
. Since
is soft continuous, then
. Since
, then
,
, and therefore
Since and , then by Theorem 7, . Therefore, . □
3. Separation Axioms
In this section, we continue the study of soft spaces, in which we obtain two characterizations of these soft spaces and investigate their behavior with respect to soft subspaces, soft transformations, and generated soft topologies.
We start this section by characterizing soft spaces via soft points:
Theorem 23. An STS is soft if and only if for each , .
Proof. Necessity. Suppose that is soft . Let . Suppose that . Then, . We are going to show that . Let such that . Since , then , and so . Thus, . Since is soft , then . Therefore, .
Sufficiency. Suppose that for each
,
. Let
. We are going to show that
. Let
. By assumption,
. If
, then
, and so
. If
, then through Theorem 3.6 of [
22], we have
with
, and hence
.
The next result is a consequence of Theorem 23: □
Corollary 2. Every soft door space is soft .
The following example will show that the converse of Corollary 2 need not be true in general:
Example 9. Let , , and . Then, is a soft but not a soft door space.
Another characterization of soft spaces is stated in the next theorem:
Theorem 24. An STS is soft if and only if for every Proof. Necessity. Suppose that is soft . Suppose to the contrary that there exists such that . Since it is clear that , then there exists . Since is soft , then by Theorem 23, ∪, and so ∪. Since , then ∪, and so . Therefore, , a contradiction.
Sufficiency. Suppose that for every , . Let . By assumption, we have . To see that , it is sufficient to show that for all with . Let such that . If , then because . If , then . □
In the next three theorems, we discuss the behavior of soft spaces with respect to induced TSs and generated STSs:
Theorem 25. If is a soft STS, then is for all .
Proof. Suppose that
is soft
, and let
. Let
. Since
is soft
, then by Theorem 23,
, and thus
. Hence, by Theorem 2.5 of [
27],
is
. □
The following example will show that the converse of Theorem 25 is not true in general:
Example 10. Let , , and . Since , then and are both . On the other hand, since , then according to Theorem 23, is not soft .
Theorem 26. Let be an indexed family of TSs. Then, is soft if and only if is for all .
Proof. Necessity. Suppose that
is soft
, and let
. Then, under Theorem 25,
is
. On the other hand, according to Theorem 3.7 of [
1],
. Hence,
is
.
Sufficiency. Suppose that
is
for all
. Let
. Since
is
, then by Theorem 2.5 of [
27],
. Therefore,
. Hence, by Theorem 23,
is soft
. □
Theorem 27. Let be a TS and A be any set of parameters. Then, is soft if and only if is .
Proof. For each , put . Then, , and through Theorem 4, we obtain the result. □
Theorem 28. If is soft , then .
Proof. Suppose that is soft . Suppose to the contrary that there exists . Since , then there exists . Since , then by Theorem 7, . Since is soft , then by Theorem 23, . Since , and , then . Hence, , a contradiction. □
The following example will show that the converse of Theorem 28 need not be true in general:
Example 11. Let and . Consider . Then, , while is not soft .
We shall now establish an interesting characterization of soft STSs, which are soft anti-locally countable in terms of soft -closed sets:
Theorem 29. Let be a soft anti-locally countable STS. Then, is soft if and only if .
Proof. Necessity. Suppose that
is soft
. Then, by Theorem 5.3 of [
22],
is soft
. Thus, by Theorem 28,
.
Sufficiency. Suppose that . Suppose to the contrary that is not soft . Then, there exists , and so . If such that , then , and hence . Therefore, . Hence, . Thus, there exists and such that and . Therefore, . Hence, is not soft anti-locally countable, a contradiction. □
In the next theorem, we discuss the behavior of soft spaces with respect to soft subspaces:
Theorem 30. Let be an STS, and let Y be a non-empty subset of X. If is soft , then is soft .
Proof. Suppose that is soft . Let . Then, . Since is soft , then . Thus, . Hence, under Theorem 23, is soft . □
In Theorems 31 and 32, we study the behavior of the class of soft spaces under soft mappings:
Theorem 31. Let be soft continuous, soft closed, and onto. If is soft , then is soft .
Proof. Let . Then, under Theorem 20, . Since is soft , then . Since is soft closed, then . Since is onto, then . Thus, . Hence, is soft . □
In Theorem 31, the condition “soft closed” cannot be replaced by the condition “soft open”, as the following example shows:
Example 12. Let , , , , and . Let and , defined by Then, is soft continuous, soft open, and onto. However, according to Theorem 23, is soft, while is not.
Theorem 32. Let be soft open and onto such that for each , is a finite set. If is soft , then is soft .
Proof. We shall use Theorem 23. Let , and let . By assumption, is a non-empty finite set. If there exists , then , since is soft open. Otherwise, for all , and thus . It follows that is soft . □