3. Soft Somewhat-r-Continuous Functions
In this section, we define soft somewhat-r-continuous functions. We show the soft somewhat-r-continuity between the soft complete continuity and soft somewhat-continuity and independent of the class of soft -continuity. Moreover, regarding soft somewhat-r-continuity, we introduce several characterizations, soft subspaces, soft composition, and soft preservation theorems. In addition, we investigated the links between this class of soft functions and its analogs in general topology.
The basic concept of this section is defined as follows:
Definition 10. A soft function is called soft somewhat-r-continuous (soft s-r-c) if, for each such that , there exists such that .
In Theorems 1 and 2 and Corollaries 1 and 2, we investigate the correspondence between the concepts soft somewhat-r-continuity and soft somewhat-continuity with their analogous topological concepts:
Theorem 1. Let
and be two collections of TSs. Let and be functions where v is bijective. Then, is soft s-r-c if and only if is s-r-c for all .
Proof. Necessity: Assume that
is soft s-
r-c. Let
. Let
such that
. Then,
and
. Then, we find
such that
. Thus,
. Since for all
,
, then
. Also, by Theorem 14 of [
30],
. This shows that
is s-
r-c.
Sufficiency: Assume that
is s-
r-c for all
. Let
such that
. Choose
such that
. Since
, then
. Since
is s-
r-c, then there exists
such that
. Then, we have
and
. Also, by Theorem 14 of [
30],
. This shows that
is soft s-
r-c. □
Corollary 1. Let and be two functions where v is a bijection. Then, is s-r-c if and only if is soft s-r-c.
Proof. For each and , put and . Then, and . We obtain the result by using Theorem 1. □
Theorem 2. Let
and be two collections of TSs. Let and be functions where v is bijective. Then, is soft s-c if and only if is s-c for all .
Proof. Necessity: Assume that is soft s-c. Let . Let such that . Then, and . So, we find such that . Then, and . Since, for all , , then . This shows that is s-c.
Sufficiency: Assume that is s-c for all . Let such that . Choose such that . Since , then . Since is s-c, then there exists such that . Then, we have , , and . This is shown to be soft s-c. □
Corollary 2. Let and be two functions where v is a bijection. Then, is s-c if and only if is soft s-c.
Proof. For each and , put and . Then, and . We obtain the result by using Theorem 2. □
In Theorem 3 and Example 1, we discuss the relationships between the classes of soft completely continuous functions and soft somewhat-r-continuous functions:
Theorem 3. Every soft completely continuous
function is
soft s-r-c.
Proof. Let be soft complete continuous. Let and . Since is soft complete continuous, then . Put . Then, and . As a result, is soft s-r-c. □
In general, Theorem 3’s inverse does not have to be true.
Example 1. Let , , α be the standard topology on L, and ϕ be the discrete topology on M. Define and as follows: To see that q is s-r-c, let such that . If , then and . If , then and . If , then and .
Since while , then q is not completely continuous.
Therefore, by Corollary 1 and Corollary 1 of [27], is soft s-r-c, but not soft completely continuous. In Theorems 4 and 5 and Example 2, we discuss the relationships between the classes of somewhat-r-continuous functions and soft somewhat-continuous functions:
Theorem 4. Soft s-r-c
functions
are
soft s-c.
Proof. Let be soft s-r-c. Let and . Then, there exists such that . Since , then . This ends the proof. □
The opposite of Theorem 4 does not have to be true.
Example 2. Let
, , , and . Define and by , , and for all .
To see that is s-c, let such that . Then, and , and thus, we can choose such that .
Since such that while there is no such that , then q is not s-r-c.
Therefore, by Corollaries 1 and 2, is soft s-c, but not soft s-r-c.
Theorem 5. If
is soft s-c and is soft locally indiscrete, then is soft s-r-c.
Proof. Let such that . Then, we find such that . Since is soft locally indiscrete, then , and so, . This shows that is soft s-r-c. □
From the above theorems, we have the following implications. However, Examples 1 and 2 show that the converses of these implications are not true.
Soft complete continuity ⟶ soft somewhat-r-continuity ⟶ soft somewhat-continuity.
In Theorem 6 and Corollary 3, we investigate the correspondence between the concept of soft -continuity with its analogous topological concept:
Theorem 6. Let
and be two collections of TSs. Let and be functions. Then, is soft δ-continuous if and only if is δ-continuous for all .
Proof. Necessity: Assume that
is soft
-continuous. Let
. Let
, and let
such that
. Then, we have
, and by Theorem 14 of [
30],
. So, we find
such that
and, thus,
. Moreover, by Theorem 14 of [
30],
. This shows that
is
-continuous.
Sufficiency: Assume that
is
-continuous for all
. Let
, and let
such that
. Then, we have
, and by Theorem 14 of [
30],
. Since
is
-continuous, then we find
such that
and
. Now, we have
, and by Theorem 14 of [
30],
. Also, it is not difficult to check that
. Therefore,
is soft
-continuous. □
Corollary 3. Let and be two functions. Then, is δ-continuous if and only if is soft δ-continuous.
Proof. For each and , put and . Then, and . We obtain the result by using Theorem 6. □
The following two examples demonstrate the independence of the concepts of soft s-r-c and soft -continuous:
Example 3. Let
be as in Example 1. Then, is soft s-r-c. Since while , then q is not δ-continuous. Thus, by Corollary 3, is not soft δ-continuous.
Example 4. Let
, , and . Define and by , , , and for all .
If , then . Hence, q is δ-continuous. Since such that while there is no such that , then q is not s-r-c.
As a result of Corollaries 1 and 3, is soft δ-continuous, yet not soft s-r-c.
In the following result, we give a sufficient condition for soft -continuous functions to be soft somewhat-r-continuous:
Theorem 7. If
is soft δ-continuous and is soft locally indiscrete, then is soft s-r-c.
Proof. Let such that . Since is soft locally indiscrete, then . Choose . Then, . Since is soft -continuous, we find such that and . Thus, we have such that . This shows that is soft s-r-c. □
Definition 11. Let be an STS, and let . Then, H is called soft r-dense in if there is no such that .
In Theorem 8 and Example 5, we discuss the relationships between the soft dense sets and soft r-dense sets:
Theorem 8. In any STS , soft dense sets are soft r-dense sets.
Proof. Assume, on the other hand, that a soft dense set H exists in that is not soft r-dense in . Then, we find such that . Since , then . Hence, H is not soft dense in , which is a contradiction. □
The following example demonstrates that the inverse of Theorem 8 is not true:
Example 5. Let
, , and , where for every . Let . Since , then H is soft r-dense in . On the other hand, since , then H is not soft dense in .
The following result characterizes soft r-dense sets in terms of soft regular open sets:
Theorem 9. Let be an STS, and let . Then, H is soft r-dense in if and only if, for any , .
Proof. Necessity: Assume that H is soft r-dense in and, on the contrary, that there exists such that . Then, we have and . Hence, H is not soft r-dense in , which is a contradiction.
Sufficiency: Assume that for each . Assume, on the other hand, there exists such that . Then, we have and , which is a contradiction. □
In Theorems 10 and 11, we give sufficient conditions for the soft composition of two soft somewhat-r-continuous functions to be soft somewhat-r-continuous:
Theorem 10. If
and are soft s-r-c functions and is soft r-dense in , then is soft s-r-c.
Proof. Let such that . Then, , and thus, . Since is soft s-r-c, we find such that . Since is soft r-dense in , then by Theorem 9, , and thus, . Since is soft s-r-c, we find such that . This shows that is soft s-r-c. □
Theorem 11. If is soft s-r-c and is soft continuous, then is soft s-r-c.
Proof. Let such that . Since is soft continuous, then . Since is soft s-r-c and , then we find such that . □
The soft composite of two soft s-r-c functions is not necessarily soft s-r-c:
Example 6. Let
, , , and . Define , , and by , , , for all and for all . Then, clearly, is continuous and is s-r-c while is not s-r-c. So, by Theorem 5.31 of [18], is soft continuous, and by Corollary 1, is soft s-r-c, but is not soft s-r-c. The following result gives two characterizations of soft somewhat-r-continuous surjective functions:
Theorem 12. Let be surjective. Then, the following are equivalent:
- (a)
is soft s-r-c.
- (b)
For each such that , we find such that .
- (c)
For each soft r-dense set H in , is a soft dense set in .
Proof. (a) ⟶ (b): Let such that . Then, and . Based on (a), we find such that . Let . Then, such that .
(b) ⟶ (c): On the contrary, assume a soft r-dense set H exists in such that is not soft dense in . Then, there exists such that . If , then , and hence, . Therefore, . So, by (b), we find such that , and so, . This conflicts with the statement that H is a soft r-dense set in .
(c) ⟶ (a): On the contrary, assume that is not soft s-r-c. Then, we find such that , but there is no such that . □
Claim 1. is softr-dense in.
Proof of Claim 1. Assume, however, that is not soft r-dense in . Then, by Theorem 9, there exists such that , and hence, , a contradiction. □
Thus, by the above Claim 1 and (c), is soft dense in . Since , then is soft dense in , and thus, . Therefore, , and hence, . This is a contradiction.
Theorems 13 and 14 discuss the behavior of soft somewhat-r-continuous functions under soft subspaces:
Theorem 13. Let and be any two STSs. Let such that . If is soft s-r-c such that is soft dense in , then for each extension , is soft s-r-c.
Proof. Let such that . Since is soft dense in , . Then, , and so, . Since is soft s-r-c, then there exists such that . Since and , then . This shows that is soft s-r-c. □
Theorem 14. Let and be any two STSs, and let , where . If is a soft function such that the soft restrictions and are soft s-r-c, then is soft s-r-c.
Proof. Let such that , then or . We can assume, without loss of generality, that . Then, we find such that . Since and , then . This completes the proof. □
Definition 12. An STS is soft r-separable if there exists a countable soft set such that H is soft r-dense in .
By Theorem 8, soft separable STSs are soft r-separable. The following is an example to show that soft r-separability does not imply soft separability in general:
Example 7. Let
, , and . Then, . So, any is soft r-dense. In particular, is a countable soft set and soft r-dense in , and hence, is soft r-separable. On the other hand, it is not difficult to show that is not soft separable.
The following result shows that the soft somewhat-r-continuous image of a soft r-separable space is soft separable:
Theorem 15. If is soft s-r-c and is soft r-separable, then is soft separable.
Proof. Let be soft s-r-c such that is soft r-separable. Choose a countable soft set such that H is soft r-dense in . Then, is a countable soft set, and by Theorem 12 (c), is soft dense in . Therefore, is soft separable. □
Definition 13. Let
and be two STSs. Then, Γ is called soft r-weakly equivalent to Y if, for each , we find such that and, for each , we find such that .
Theorem 16. Let
and be two STSs. Let and denote the identities. Then, the following are equivalent:
- (a)
Γ is soft r-weakly equivalent to Y.
- (b)
The soft functions and are both soft s-r-c.
Theorem 17. Let
be soft s-r-c. If is an STS such that Γ is soft r-weakly equivalent to Y, then
is soft s-r-c.
Proof. Let such that . Since is soft s-r-c, then we find such that . Since is soft r-weakly equivalent to , then we find such that . This shows that is soft s-r-c. □
Theorem 18. Let
be soft s-r-c and surjective. If and are STSs such that Γ is soft r-weakly equivalent to Y and 𝟊 is soft weakly equivalent to Ψ, then is soft s-r-c.
Proof. Let such that . Since is soft weakly equivalent to , then we find such that . Since is surjective, then . Since is soft s-r-c, then we find such that . Since is soft r-weakly equivalent to , then we find such that . This completes the proof. □
Definition 14. An STS is called a soft r-D-space if, for every , .
Soft D-spaces are soft r-D-spaces. However, we raise the following question about the converse:
Question 1. Is it true that every soft r-D-space is a soft D-space?
The following result shows that the soft somewhat-r-continuous image of a soft r-D-space is a soft D-space:
Theorem 19. Let
be soft s-r-c and surjective. If is a soft r-D-space, then is a soft D-space.
Proof. Let be soft s-r-c and surjective such that is a soft r-D-space. To the contrary, assume that is not a soft D-space. Then, we find such that . Since is surjective, then and . Since is soft s-r-c, then we find such that and . Therefore, . This shows that is not a soft r-D-space, a contradiction. □
4. Soft Somewhat-r-Open Functions
In this section, we define soft somewhat-r-open functions. We show that this class of soft functions is a subclass of soft somewhat open functions. With the help of examples, we introduce various properties of this new class of soft functions.
Definition 15. A soft function is called soft somewhat-r-open (soft s-r-o) if, for each , there exists such that .
In Theorems 20 and 21 and Corollaries 4 and 5, we investigate the correspondence between the concepts of soft somewhat-r-openness and soft somewhat-openness with their analogous topological concepts:
Theorem 20. Let
and be two collections of TSs. Let and be functions where v is bijective. Then is soft s-r-o if and only if is s-r-o for all .
Proof. Necessity: Assume that
is soft s-
r-o. Let
. Let
. Then,
. So, we find
such that
. Thus, we have
, and by Theorem 14 of [
30],
. This shows that
is s-
r-o.
Sufficiency: Assume that
is s-
r-o for all
. Let
. Choose
such that
. Since
is s-
r-o, then we find
such that
. Then,
, and by Theorem 14 of [
30],
. Moreover, it is not difficult to check that
. This shows that
is soft s-
r-o. □
Corollary 4. Let and be two functions where v is a bijection. Then, is s-r-o if and only if is soft s-r-o.
Proof. For each and , put and . Then, and . We obtain the result by using Theorem 20. □
Example 8. Let , , and . Define and by , , , and for every . Then, is s-r-o, and by Corollary 4, is soft s-r-o.
Theorem 21. Let
and be two collections of TSs. Let and be functions where v is bijective. Then, is soft s-o if and only if is s-o for all .
Proof. Necessity: Assume that is soft s-o. Let . Let . Then, . So, we find such that . Thus, we have and . This shows that is s-o.
Sufficiency: Assume that is s-o for all . Let . Choose such that . Since is s-o, then we find such that . Then, . Moreover, it is not difficult to check that . This shows that is soft s-o. □
Corollary 5. Let and be two functions where v is a bijection. Then, is s-o if and only if is soft s-o.
Proof. For each and , put and . Then, and . We obtain the result by using Theorem 21. □
In Theorems 22 and 23 and Example 9, we discuss the relationships between the classes of somewhat-r-open functions and soft somewhat-open functions:
Theorem 22. Every soft s-r-o function is
soft s-o.
Proof. Let be soft s-r-o. Let . Since is soft s-r-o, then we find such that . Since , then . Therefore, is soft s-o. □
The converse of Theorem 22 does not have to be true in all cases.
Example 9. Let α be the cofinite topology on . Consider the identities and . Consider . Then, is soft s-o. Since while there is no such that , then is not soft s-r-o.
Theorem 23. If
is soft s-o and is soft locally indiscrete, then is soft s-r-o.
Proof. Let . Since is soft s-o, we find such that . Since is soft locally indiscrete, then . This shows that is soft s-r-o. □
In Theorem 24, we give a sufficient condition for the soft composition of two soft somewhat-r-open functions to be soft somewhat-r-open:
Theorem 24. If is soft open and is soft s-r-o, then is soft s-r-o.
Proof. Let . Since is soft open, then . Since is soft s-r-o, then we find such that . This shows that is soft s-r-o. □
In Theorems 25 and 26, we give characterizations of soft somewhat-r-open functions:
Theorem 25. Let be a soft function. Then, the following are equivalent:
- (a)
is soft s-r-o.
- (b)
If H is soft r-dense in , then is soft dense in .
Proof. (a) ⟹ (b): Assume, on the other hand, that we find a soft r-dense set H in such that is not soft dense in . Then, . So, by (a), we find such that
Thus, . Therefore, by Theorem 9, H is not soft r-dense in , which is a contradiction.
(b) ⟹ (a): Assume, on the other hand, that there exists such that, if such that , then . □
Claim 2. is softr-dense in.
Proof of Claim 2. Suppose to the contrary that is not soft r-dense in . Then, by Theorem 5, there exists such that , and hence, , a contradiction.
Thus, by the above Claim 2 and (b), is soft dense in . Since , then , which implies that is not soft dense in , which is a contradiction. □
Theorem 26. Let be bijective. Then, the following are equivalent:
- (a)
is soft s-r-o.
- (b)
If such that , then there exists such that .
Proof. Since is bijective, then is soft s-r-o if and only if is soft s-r-c. So, we obtain the result by using Theorem 12. □
Theorems 27 and 28 discuss the behavior of soft somewhat-r-open functions under soft subspaces:
Theorem 27. If is soft s-r-o and such that , then the soft restriction is soft s-r-o.
Proof. Assume that is soft s-r-o, and let such that . Let . Since , then , and thus, . Since is soft s-r-o, then we find such that . □
Theorem 28. Let and be any two STSs. Let such that is soft dense in . If is soft s-r-o, then for any extension , is soft s-r-o.
Proof. Let . Since is soft dense in , then . Since is soft s-r-o and , then we find such that . This completes the proof. □
Theorem 29. Let
be soft s-r-o. If and are STSs such that Γ is soft weakly equivalent to Y and 𝟊 is soft r-weakly equivalent to Ψ, then is soft s-r-o.
Proof. Let . Since is soft weakly equivalent to , then we find such that . Since is soft s-r-o, then we find such that . Since is soft r-weakly equivalent to , then we find such that . This shows that is soft s-r-o. □