We use soft ωs-open sets to define soft ωs-irresoluteness, soft ωs-openness, and soft pre-ωs-openness as three new classes of soft mappings. We give several characterizations for each of them, specially via soft ωs-closure and soft ωs-interior soft operators. With the help of examples, we study several relationships regarding these three notions and their related known notions. In particular, we show that soft ωs-irresoluteness is strictly weaker than soft ωs-continuity, soft ωs-openness lies strictly between soft openness and soft semi-openness, pre-ωs-openness is strictly weaker than ωs-openness, soft ωs-irresoluteness is independent of each of soft continuity and soft irresoluteness, soft pre-ωs-openness is independent of each of soft openness and soft pre-semi-openness, soft ωs-irresoluteness and soft continuity (resp. soft irresoluteness) are equivalent for soft mappings between soft locally countable (resp. soft anti-locally countable) soft topological spaces, and soft pre-ωs-openness and soft pre-semi-continuity are equivalent for soft mappings between soft locally countable soft topological spaces. Moreover, we study the relationship between our new concepts in soft topological spaces and their topological analog.
We confront numerous situations in our daily lives that include uncertainty that we cannot solve with standard mathematical techniques. Some scenarios, such as fuzzy sets and soft sets, have been presented to cope with these sorts of challenges. In 1999, Molodtsov [1] developed the notion of “soft sets” as a novel mathematical technique for dealing with imprecise data and ambiguous circumstances. We confront numerous situations in our daily lives that include uncertainty that we cannot solve with standard mathematical techniques. Some scenarios, such as fuzzy sets and soft sets, have been presented to cope with these sorts of challenges. In 1999, Molodtsov [1] developed the notion of “soft sets” as a novel mathematical technique for dealing with imprecise data and ambiguous circumstances. Molodtsov discussed in detail how soft sets may be utilized in numerous areas and their benefits over fuzzy setsathematical techniques. Some scenarios, such as fuzzy sets and soft sets, have been presented to cope with these sorts of challenges. In 1999, Molodtsov [1] developed the notion of “soft sets” as a novel mathematical technique for dealing with imprecise data and ambiguous circumstances. Molodtsov discussed in detail how soft sets may be utilized in numerous areas and their benefits over fuzzy sets. This technique has sparked the curiosity of many academics and scholars who are interested in uncertainty in both theoretical and applied settings. Maji et al. [2] used soft sets to solve decision-making issues in 2002, and they [3] gave the initial conception for a set of operations between soft sets in 2003. Some of these operations had flaws, prompting some writers to revise their definitions and create new types for diverse purposes, as indicated in the published literature [4, 5]. Other mathematical structures, such as soft group theory [6], soft ring theory [7], and soft category theory [8], have been studied since Maji’s contribution.
Shabir and Naz [9] and Cagman et al. [10] presented two strategies for defining a topology over a family of soft sets in 2011. The distinction was in the form of a set of parameters: Shabir and Naz defined a soft topology over a constant set of parameters, whereas Cagman et al. defined a soft topology over changing subsets of parameters. According to Shabir and Naz’s definition, soft topological notions may be described similarly to their equivalents in classical topology, which encourages and stimulates scholars to pursue this area of research.
Since the introduction of soft topology, many researchers have focused on the generalization of topological concepts in soft topologies, such as “soft compact and soft Lindelof” [11–15], “soft connected” [16], “soft paracompact” [16], “soft extremely disconnected” [17], “soft separable spaces” [18], “soft separation axioms” [19–21], “soft metric spaces” [22–24], and “soft homogeneous spaces” [25, 26]. Soft topology research is still ongoing (for example, [27–38]), and substantial contributions are yet possible.
Soft continuity of mappings was defined by Nazmul and Samanta [39] in 2013. Then many modifications of “soft continuity” and “soft openness” appeared. For instance, “soft α-continuous mappings” [40], “soft semicontinuous mappings” [41], “soft β-continuous mappings” [42], soft ω-continuous mappings [43], soft ωs-continuous functions [43], soft somewhat ω-continuous functions [44], soft semi ω-continuous [45], “soft ω-irresolute mappings” [45], “soft semi ω-irresolute mappings” [45], “soft α-open mappings” [40], “soft semi-open mappings” [41], “soft β-open mappings” [42], “soft somewhat ω-open mappings”, and so on.
The author in [46] defined soft ωs-open sets as a class of soft sets that lies strictly between soft ωs-open sets and soft semiopen sets, then he introduced in [43] soft ωs-continuous mappings as a class of soft mappings that lies strictly between soft continuous mappings and soft semicontinuous mappings.
In this paper, We use soft ωs-open sets to define soft ωs-irresoluteness, soft ωs-openness, and soft pre-ωs-openness as three new classes of soft mappings. We give several characterizations for each of them, specially via soft ωs-closure and soft ωs-interior soft operators. With the help of examples, we study several relationships regarding these three notions and their related known notions. In particular, we show that soft ωs-irresoluteness is strictly weaker than soft ωs-continuity, soft ωs-openness lies strictly between soft openness and soft semi-openness, pre-ωs-openness is strictly weaker than ωs-openness, soft ωs-irresoluteness is independent of each of soft continuity and soft irresoluteness, soft pre-ωs-openness is independent of each of soft openness and soft pre-semi-openness, soft ωs-irresoluteness and soft continuity (resp. soft irresoluteness) are equivalent for soft mappings between soft locally countable (resp. soft anti-locally countable) soft topological spaces, and soft pre-ωs-openness and soft pre-semi-continuity are equivalent for soft mappings between soft locally countable soft topological spaces. Moreover, we study the relationship between our new concepts in soft topological spaces and their topological analog.
Now, we shall recollect several notions that will be employed in the sequel of this paper.
From now on, TS will denote topological space. Let (Y, μ) be a TS A ⊆ Y, throughout this paper, Cl
μ (A) and Int
μ (A) will denote the closure of A in (Y, μ) and the interior of A in (Y, μ), respectively.
Definition 1.1. Let (Y, μ) be a TS, Z ⊆ Y, and y ∈ Y. Then
(1) [47] y is a condensation point of Z if for each O ∈ μ with y ∈ O, the set O ∩ Z is uncountable.
(2) [48] Z is called an ω-closed set in (Y, μ) if it contains all its condensation points.
(3) [48] Z is called an ω-open set in (Y, μ) if Y - Z is an ω-closed set in (Y, μ); the family of all ω-open sets in (Y, μ) will be denoted by μω.
(4) [49] Z is called a semi-open set in (Y, μ) if there is O ∈ μ such that O ⊆ Z ⊆ Cl
μ (Z); the family of all semi-open sets in (Y, μ) will be denoted by SO (Y, μ).
(5) [50] Z is called an ωs-open set in (Y, μ) if there is O ∈ μ such that O ⊆ Z ⊆ Cl
μω (Z); the family of all ωs-open sets in (Y, μ) will be denoted by ωs (Y, μ).
(6) [50] Z is called an ωs-closed set in (Y, μ) if Y - Z ∈ ωs (Y, μ).
Definition 1.2. A mapping p : (V, μ) ⟶ (U, α) between the TSs (V, μ) and (U, α) is said to be
(1) [51] semi-open if p (U) ∈ SO (U, α) for every U ∈ μ.
(2) [52] pre-semi-open if p (U) ∈ SO (U, α) for every U ∈ SO (V, μ).
(3) [53] ωs-irresolute if p-1 (O) ∈ ωs (V, μ) for every O ∈ ωs (U, α).
(4) [53] ωs-open if p (U) ∈ ωs (U, α) for every U ∈ μ.
(5) [53] pre-ωs-open if p (U) ∈ ωs (U, α) for every U ∈ ωs (V, μ).
Definition 1.3. [1] Let V be an initial universe and T be a set of parameters. A soft set over V relative to T is a function , where is the powerset of V. The family of all soft sets over V relative to T will be denoted by SS (V, T).
(1) H is a soft subset of G, denoted by , if H (t) ⊆ G (t) for each t ∈ T.
(2) The soft union of H and G is denoted by and defined to be the soft set where for each t ∈ T.
(3) The soft intersection of H and G is denoted by and defined to be the soft set where for each t ∈ T.
(4) The soft difference of H and G is denoted by H - G and defined to be the soft set H - G ∈ SS (V, T) where (H - G) (t) = H (t) - G (t) for each t ∈ T.
Definition 1.6. [54] Let Γ be an arbitrary index set and {Hr : r ∈ Γ } ⊆ SS (V, T).
(a) The soft union of these soft sets is the soft set denoted by and defined by for each t ∈ T.
(b) The soft intersection of these soft sets is the soft set denoted by and defined by for each t ∈ T.
Definition 1.7. [11] Let fp1u1 : SS (V, T) ⟶ SS (U, S) and fp2u2 : SS (U, S) ⟶ SS (W, R) be mappings, then the composition of fp1u1 and fp2u2 is soft mapping from SS (V, T) onto SS (W, R) denoted by fp1u1 ∘ fp2u2and defined by fp1u1 ∘ fp2u2 = f(p2∘p1)(u2∘u1).
Definition 1.8. [22] Let H ∈ SS (V, T). Then H is called a countable soft set if for every t ∈ T, the set H (t) is countable. The collection of all countable soft sets from SS (V, T) will be denoted by CSS (V, T).
Definition 1.9. A soft set K ∈ SS (V, T) defined by
(2) [25] K (t) = T for all t ∈ T is denoted by CZ.
(3) [22] is denoted by by and is called a soft point. The set of all soft points in SS (V, T) is denoted by SP (V, T).
Definition 1.10. [22] Let K ∈ SS (V, T) and by ∈ SP (V, T). Then by is said to belong to K (notation: ) if y ∈ K (b).
Definition 1.11. [55] Let SS (V, T) and SS (U, S) be families of soft sets. Let p : V ⟶ U and u : T ⟶ S be functions. Then a soft mapping fpu : SS (V, T) ⟶ SS (U, S) is defined as:
(a) Let H ∈ SS (V, T). The image of H under fpu, written as fpu (H) ∈ SS (U, S) is defined by
(b) Let G ∈ SS (U, S). The inverse of G under fpu, written as is defined by
Definition 1.12. [9] Let ψ ⊆ SS (V, T). Then ψ is called a soft topology on V relative to T if
(1) 0T, 1T ∈ ψ,
(2) the soft union of any number of soft sets in ψ belongs to ψ,
(3) the soft intersection of any two soft sets in ψ belongs to ψ.
The triplet (V, ψ, T) is called a soft topological space (STS) over V relative to T. The members of ψ are called soft open sets in (V, ψ, T) and their soft complements are called soft closed sets in (V, ψ, T).
Definition 1.13. [9] Let (V, ψ, T) be a STS and let N ∈ SS (V, T). Then
(1) the soft closure of N in (V, ψ, T) is denoted by Clψ (N) and defined by Clψ (H) =
.
(2) the soft interior of N in (V, ψ, T) is denoted by Intψ (N) and defined by Intψ (N) =
Definition 1.15. [56] Let (V, ψ, T) be a STS and let N ∈ SS (V, T). Then N is called a soft ω-open set in (V, ψ, T) if for each , there are G ∈ ψ and K ∈ CSS (V, T) such that . The family of all soft ω-open set in (V, ψ, T) is denoted by ψω.
It is proved in [56] that (V, ψω, T) is a STS, ψ ⊆ ψω, and ψ ≠ ψω in general.
Theorem 1.16. [39]For any TS (V, μ), the family {K∈ SS (V, T) : K (t) ∈ μ foreveryt ∈ T } is a soft topology on V relative to T. This soft topology will be denoted by τ (μ).
Theorem 1.17. [25] For any collection of TSs { (V, ψt) : t∈ T }, the family
forms a soft topology on V relative to T. This soft topology is denoted by ⊕t∈Tψt.
Definition 1.18. Let (V, ψ, T) be a STS and let N ∈ SS (V, T). Then
(1) [57] N is called a soft semi-open set in (V, ψ, T) if there is G ∈ ψ such that ; the family of all semi-open sets in (V, ψ, T) will be denoted by SO (V, ψ, T).
(2) [38] N is called a soft ωs-open set in (V, ψ, T) if there is G ∈ ψ such that ; the family of all soft ωs-open sets in (V, ψ, T) will be denoted by ωs (V, ψ, T).
(3) [38] N is called a soft ωs-closed set in (V, ψ, T) if 1T - N ∈ ωs (V, ψ, T).
(4) [38] the soft ωs-closure of N in (V, ψ, T) is denoted by ωs-Clψ (N) and defined by ωs-Clψ (H) =
.
(5) [38] the soft ωs-interior of N in (V, ψ, T) is denoted by ωs-intψ (N) and defined by ωs-intψ (N) =
.
Definition 1.19. A soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S) is called
(1) [41] soft irresolute if for every H ∈ SO (U, φ, S).
(2) [41] soft semi-open if fpu (K) ∈ SO (U, φ, S) for every K ∈ ψ.
(3) soft pre-semi-open if fpu (K) ∈ SO (U, φ, S) for every K ∈ SO (V, ψ, T).
(1) [56] soft locally countable if for each tv ∈ SP (V, T), there is H ∈ ψ ∩ CSS (V, T) such that .
(2) [56] soft anti-locally countable if for every K∈ ψ - { 0T }, K ∉ CSS (V, T).
(3) [58] soft ω-regular if for each tv ∈ SP (V, T) and each G ∈ ψ such that , there is M ∈ ψ such that .
Soft ωs-irresoluteness
Definition 2.1. A soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S) is called soft ωs-irresolute if for every M ∈ ωs (U, φ, S), .
Soft irresoluteness and soft ωs-irresoluteness are independent of each other as it can be seen from the following two examples:
Example 2.2. Let , U ={ 1, 2 }, , , and φ ={ CZ : Z ∈ { ∅ , U, { 1 } , { 2 }} }. Define p : V ⟶ U and u : T ⟶ T by
and u (t) = t for every t ∈ T.
Consider the soft mapping fpu : (V, ψ, T) ⟶ (U, φ, T). Since and , then fpu is soft irresolute but not soft ωs-irresolute.
Example 2.3. Let
, T = [0, 1], and ψ ={ CZ : Z ∈ { ∅ , V, { 1 } , { 2 } , { 1, 2 }} }. Define p : V ⟶ V and u : T ⟶ T by p (v) =1 when v∈ { 1, 2 }, p (v) = v when , and u (t) = t for every t ∈ T. Consider the soft mapping fpu : (V, ψ, T) ⟶ (V, ψ, T). Since (V, ψ, T) is soft locally countable, then by Theorem 2.8 of [38], ωs (V, ψ, T) = ψ. Since and , then fpu is soft ωs-irresolute. On the other hand, fpu is not soft irresolute because there is such that .
Theorem 2.4.Let fpu : (V, ψ, T) ⟶ (U, φ, S) be a soft mapping such that (V, ψ, T) and (U, φ, S) are soft anti-locally countable STSs. Then fpu is soft irresolute if and only if fpu is soft ωs-irresolute.
Proof. Follows from the definitions and Theorem 2.6 of [38].
Soft continuity and soft ωs-irresoluteness are independent notions as the following examples show:
Example 2.5. Let , , and . Define p : V ⟶ V and u : T ⟶ T by
and u (t) = t for every t ∈ T.
Consider the soft mapping fpu : (V, ψ, T) ⟶ (V, ψ, T). Since and , then fpu is soft continuous. Since , then . Since , then fpu is not soft ωs-irresolute.
Example 2.6. Let , U ={ 0, 1 }, , ψ ={ CZ : Z belongstotheusualtopologyon V }, and φ = SS (U, T). Define p : V ⟶ V and u : T ⟶ T by
and u (t) = t for every t ∈ T.
Consider the soft mapping fpu : (V, ψ, T) ⟶ (U, φ, T). Note that ωs (U, φ, T) = SS (U, T). Since and , then fpu is soft ωs-irresolute. However, fpu is not soft continuous because there is C{2} ∈ φ such that .
Theorem 2.7.Letfpu : (V, ψ, T) ⟶ (U, φ, S) be a soft mapping such that (V, ψ, T) and (U, φ, S) are soft locally countable STSs. Then fpu is soft continuous if and only if fpu is soft ωs-irresolute.
Proof. Follows from the definitions and Theorem 2.8 of [38].
Theorem 2.8.Let fpu : SS (V, T) ⟶ SS (U, S) be a soft mapping between two families of soft sets. If fpu : (V, ψ, T) ⟶ (U, φ, S) is soft continuous and fpu : (V, ψω, D) ⟶ (W, φω, E) is soft open, then fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-irresolute.
Proof. Let M ∈ ωs (U, φ, S). Then there is K ∈ φ such that and thus
. Since fpu : (V, ψ, T) ⟶ (U, φ, S) is soft continuous, then . Since fpu : (V, ψω, D) ⟶ (W, φω, E) is soft open, then
. Therefore, . It follows that fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-irresolute.
Theorem 2.9. Soft ωs-irresolute soft mappings are soft ωs-continuous.
Proof. Let fpu : (V, ψ, T) ⟶ (U, φ, S) be soft ωs-irresolute. Let M ∈ φ. Then by Theorem 2.2 of [38], M ∈ ωs (U, φ, S). Since fpu is soft ωs-irresolute, then . Therefore, fpu is soft ωs-continuous.
The soft mapping in Example 2.5 is soft continuous and by Theorem 3.2 of [43], it is soft ωs-continuous. Thus, the converse of Theorem 2.9 need not be true in general.
Theorem 2.10.A soft mappingfpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-irresolute if and only if for every soft ωs-closed set N of (U, φ, S), is soft ωs-closed in (V, ψ, T).
Proof.Necessity. Suppose that fpu is soft ωs-irresolute. Let N be a soft ωs-closed set in (U, φ, S). Then 1S - N ∈ ωs (U, φ, S). Since fpu is soft ωs-irresolute, then
. Therefore, is soft ωs-closed in (V, ψ, T).
Sufficiency. Suppose that for every soft ωs-closed subset N of (U, φ, S), is soft ωs-closed in (V, ψ, T). Let M ∈ ωs (U, φ, S). Then 1S - M is soft ωs-closed in (V, ψ, T). By assumption, is soft ωs-closed in (V, ψ, T), and thus . Hence, fpu is soft ωs-irresolute.
Theorem 2.11. A soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-irresolute if and only if for every K ∈ SS (V, T), -Clφ (fpu (K)).
Proof.Necessity. Suppose that fpu is soft ωs-irresolute and let K ∈ SS (V, T). Then ωs-Clφ (fpu (K)) is soft ωs-closed in (U, φ, S). Thus, by Theorem 2.10, is soft ωs-closed in (V, ψ, T). Since , then ωs-. Thus,
-Clφ (fpu (K)).
Sufficiency. Suppose that for every K ∈ SS (V, T), -Clφ (fpu (K)). We will use Theorem 2.10 to show that fpu is soft ωs-irresolute. Let N be a soft ωs-closed subset of (U, φ, S). Then by assumption we have
ωs--Clφ (N) = N, and thus
Therefore, ωs-, and hence is soft ωs-closed in (V, ψ, T). It follows that fpu is soft ωs-irresolute.
Theorem 2.12. A soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-irresolute if and only if for every H ∈ SS (U, S), ωs-.
Proof.Necessity. Suppose that fpu is soft ωs-irresolute and let H ∈ SS (U, S). Then by Theorem 2.10, is soft ωs-closed in (V, ψ, T). Since , then ωs-.
Sufficiency. Suppose that for every H ∈ SS (U, S), ωs-. We will use Theorem 2.10 to show that fpu is soft ωs-irresolute. Let N be a soft ωs-closed subset of (U, φ, S). Then ωs-Clφ (N) = N. So by assumption, ωs-
, and thus ωs-. Therefore, is soft ωs-closed in (V, ψ, T).
Theorem 2.13. For a soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S), the following are equivalent:
(a) fpu is soft ωs-irresolute.
(b) For each tv ∈ SP (V, T) and each M ∈ ωs (U, φ, S) such that , there is K ∈ ωs (V, ψ, T) such that and .
Proof. (a) ⇒ (b): Suppose that fpu is soft ωs-irresolute. Let M ∈ ωs (U, φ, S) such that
. Since fpu is soft ωs-irresolute, then . Take . Then K ∈ ωs (V, ψ, T) such that and .
(b) ⇒ (a): Let M ∈ ωs (U, φ, S). For every we have , and by (b), there is Ktv ∈ ωs (V, ψ, T) such that and . Therefore, . Hence, by Theorem 2.11 of [38], . It follows that fpu is soft ωs-irresolute.
Theorem 2.14. For a soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S), the following are equivalent:
(a) fpu is soft ωs-irresolute.
(b) For each K ∈ SS (V, T),
ωs-Clφ (fpu (K)).
(c) For each H ∈ SS (U, S),
.
Proof. (a) ⇒ (b): Suppose that fpu is soft ωs-irresolute. Let K ∈ SS (V, T). Then by Theorem 2.11, -Clφ (fpu (K)). Thus, by Lemma 3.9 of [43], it follows that
(b) ⇒ (a): We will apply Theorem 2.11. Let K ∈ SS (V, T). Then by (b),
Theorem 2.15. Iffp1u1 : (V, ψ, T) ⟶ (U, φ, S) and fp2u2 : (U, φ, S) ⟶ (W, ρ, R) are soft ωs-irresolute mappings, then f(p2∘p1)(u2∘u1) : (V, ψ, T) ⟶ (W, ρ, R) is soft ωs-irresolute.
Proof. Let M ∈ ωs (W, ρ, R). Since fp2u2 : (U, φ, S) ⟶ (W, ρ, R) is soft ωs-irresolute, then . Since fp1u1 : (V, ψ, T) ⟶ (U, φ, S) is soft ω-irresolute, then . It follows that f(p2∘p1)(u2∘u1) : (V, ψ, T) ⟶ (W, ρ, R) is soft ωs-irresolute.
Theorem 2.16. Let { (V, ψt) : t∈ T } and
{ (U, φs) : s∈ S } be two families of TSs. Let p : V ⟶ U and u : T ⟶ S be functions. Then fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft ωs-irresolute if and only if p : (V, ψt) ⟶ (U, φu(t)) is ωs-irresolute for all t ∈ T.
Proof. Necessity. Suppose that fpu : (V, ⊕ t∈Tψt, T)
⟶ (U, ⊕ s∈Sφs, S) is soft ωs-irresolute. Let t ∈ T. Let Z ∈ ωs (U, φu(t)). Then by Theorem 4.8 of [38], (u (t)) Z ∈ ωs (U, ⊕ s∈Sφs, S) and so . Thus, by Theorem 4.8 of [38], . It follows that p : (V, ψt) ⟶ (U, φu(t)) is ωs-irresolute.
Sufficiency. Suppose that p : (V, ψt) ⟶ (U, φu(t)) is ωs-irresolute for all t ∈ T. We will apply Theorem 2.13. Let tv ∈ SP (V, T) and let M ∈ ωs (U, φ, S) such that . Then we have and so p (v) ∈ M (u (t)). Also, by Theorem 4.8 of [38], M (u (t)) ∈ ωs (U, φu(t)). Since p : (V, ψt) ⟶ (U, φu(t)) is ωs-irresolute, then there is X ∈ ωs (V, ψt) such that v ∈ X and . Also, by Theorem 4.8 of [38], we have tX ∈ ωs (V, ⊕ t∈Tψt, T). Therefore, we have and . It follows that fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft ωs-irresolute.
Corollary 2.17. Let p : (V, μ) ⟶ (U, α) be a mapping between two TSs and let u : T ⟶ S be a function. Then p : (V, μ) ⟶ (U, α) is ωs-irresolute if and only if fpu : (V, τ (μ) , T) ⟶ (U, τ (α) , S) is soft ωs-irresolute.
Proof. For each t ∈ T and s ∈ S, put μt = μ and αs = α. Then τ (μ) = ⊕ t∈T
μt and τ (α) = ⊕ s∈S
αs. Thus, by Theorem 2.16, we get the result.
Soft ωs-open
soft mappings
Definition 3.1. A soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S) is called soft ωs-open if for each K ∈ ψ, fpu (K) ∈ ωs (U, φ, S).
Theorem 3.2. Let fpu : (V, ψ, T) ⟶ (U, φ, S) be a soft mapping. If for a soft base of (V, ψ, T), fpu (A) ∈ ωs (U, φ, S) for each , then fpu is soft ωs-open.
Proof. Suppose that for a soft base of (V, ψ, T), fpu (A) ∈ ωs (U, φ, S) for each . Let K∈ ψ - { 0T }. Choose such that . Then
. Since by assumption fpu (A) ∈ ωs (U, φ, S) for all , then by Theorem 2.11 of [38], . Therefore, fpu is soft ωs-open.
Theorem 3.3.Let { (V, ψt) : t∈ T } and
{ (U, φs) : s∈ S } be two families of TSs. Let p : V ⟶ U and u : T ⟶ S be functions. Then fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft open if and only if p : (V, ψt) ⟶ (U, φu(t)) is open for all t ∈ T.
Proof. Necessity. Suppose that fpu : (V, ⊕ t∈Tψt, T)
⟶ (U, ⊕ s∈Sφs, S) is soft open. Let t ∈ T. Let X ∈ ψt. Then tX ∈ ⊕ t∈Tψt and so fpu (tX) = (u (t)) p(X) ∈ ⊕ s∈Sφs. Thus, ((u (t)) p(X)) (u (t)) = p (X) ∈ φu(t). It follows that p : (V, ψt) ⟶ (U, φu(t)) is open.
Sufficiency. Suppose that p : (V, ψt) ⟶ (U, φu(t)) is open for all t ∈ T. Let . By Theorem 3.5 of [25], is a soft base for (V, ⊕ t∈Tψt, T). We will show that fpu (A) ∈ ⊕ s∈Sφs for all . Let where t ∈ T and X ∈ ψt. Since p : (V, ψt) ⟶ (U, φu(t)) is open, then p (X) ∈ φu(t). Thus, fpu (tX) = (u (t)) p(X) ∈ ⊕ s∈Sφs. It follows that fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft open.
Corollary 3.4. Let p : (V, μ) ⟶ (U, α) be a mapping between two TSs and let u : T ⟶ S be a function. Then p : (V, μ) ⟶ (U, α) is open if and only if fpu : (V, τ (μ) , T) ⟶ (U, τ (α) , S) is soft open.
Proof. For each t ∈ T and s ∈ S, put μt = μ and αs = α. Then τ (μ) = ⊕ t∈Tμt and τ (α) = ⊕ s∈S
αs. Thus, by Theorem 3.3, we get the result.
Theorem 3.5.Let { (V, ψt) : t∈ T } and
{ (U, φs) : s∈ S } be two families of TSs. Let p : V ⟶ U and u : T ⟶ S be functions. Then fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft ωs-open if and only if p : (V, ψt) ⟶ (U, φu(t)) is ωs-open for all t ∈ T.
Proof. Necessity. Suppose that fpu : (V, ⊕ t∈Tψt, T)
⟶ (U, ⊕ s∈Sφs, S) is soft ωs-open. Let t ∈ T. Let X ∈ ψt. Then tX ∈ ⊕ t∈Tψt, and so fpu (tX) = (u (t)) p(X) ∈ ωs (U, ⊕ s∈Sφs, S). Thus, by Theorem 4.8 of [38], ((u (t)) p(X)) (u (t)) = p (X) ∈ ωs (W, φu(t)). It follows that p : (V, ψt) ⟶ (U, φu(t)) is ωs-open.
Sufficiency. Suppose that p : (V, ψt) ⟶ (U, φu(t)) is ωs-open for all t ∈ T. Let . By Theorem 3.5 of [25], is a soft base for (V, ⊕ t∈Tψt, T). We will apply Theorem 3.2. Let where t ∈ T and X ∈ ψt. Since p : (V, ψt) ⟶ (U, φu(t)) is ωs-open, then p (X) ∈ ωs (U, φu(t)). Thus, by Theorem 4.8 of [38], fpu (tX) = (u (t)) p(X) ∈ ωs (U, ⊕ s∈Sφs, S). It follows that fpu : (V, ⊕ t∈Tψt, T)
⟶ (U, ⊕ s∈Sφs, S) is soft ωs-open.
Corollary 3.6.Let p : (V, μ) ⟶ (U, α) be a mapping between two TSs and let u : T ⟶ S be a function. Then p : (V, μ) ⟶ (U, α) is ωs-open if and only if fpu : (V, τ (μ) , T) ⟶ (U, τ (α) , S) is soft ωs-open.
Proof. For each t ∈ T and s ∈ S, put μt = μ and αs = α. Then τ (μ) = ⊕ t∈T
μt and τ (α) = ⊕ s∈S
αs. Thus, by Theorem 3.5, we get the result.
Theorem 3.7.Let { (V, ψt) : t∈ T } and
{ (U, φs) : s∈ S } be two families of TSs. Let p : V ⟶ U and u : T ⟶ S be functions. Then fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft semi-open if and only if p : (V, ψt) ⟶ (U, φu(t)) is semi-open for all t ∈ T.
Proof. Necessity. Suppose that fpu : (V, ⊕ t∈Tψt, T)
⟶ (U, ⊕ s∈Sφs, S) is soft semi-open. Let t ∈ T. Let X ∈ ψt. Then tX ∈ ⊕ t∈Tψt and so fpu (tX) = (u (t)) p(X) ∈ SO (U, ⊕ s∈Sφs, S). Thus, by Theorem 4.10 of [38], ((u (t)) p(X)) (u (t)) = p (X) ∈ SO (U, φu(t)). It follows that p : (V, ψt) ⟶ (U, φu(t)) is semi-open.
Sufficiency. Suppose that p : (V, ψt) ⟶ (U, φu(t)) is semi-open for all t ∈ T. Let . By Theorem 3.5 of [25], is a soft base for (V, ⊕ t∈Tψt, T). We will show that fpu (A) ∈ SO (U, ⊕ s∈Sφs, S) for all . Let where t ∈ T and X ∈ ψt. Since p : (V, ψt) ⟶ (U, φu(t)) is semi-open, then p (X) ∈ SO (U, φu(t)). Thus, by Theorem 4.10 of [38], fpu (tX) = (u (t)) p(X) ∈ SO (U, ⊕ s∈Sφs, S). It follows that fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft semi-open.
Corollary 3.8. Let p : (V, μ) ⟶ (U, α) be a mapping between two TSs and let u : T ⟶ S be a function. Then p : (V, μ) ⟶ (U, α) is semi-open if and only if fpu : (V, τ (μ) , T) ⟶ (U, τ (α) , S) is soft semi-open.
Proof. For each t ∈ T and s ∈ S, put μt = μ and αs = α. Then τ (μ) = ⊕ t∈T
μt and τ (α) = ⊕ s∈S
αs. Thus, by Theorem 3.7, we get the result.
Theorem 3.9. Every soft open soft mapping is soft ωs-open.
Proof. Let fpu : (V, ψ, T) ⟶ (U, φ, S) be a soft open soft mapping and let K ∈ ψ. Since fpu is soft open, then fpu (K) ∈ φ. Thus, by Theorem 2.2 of [38], fpu (K) ∈ ωs (U, φ, S). Hence, fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-open.
As the following example proves, the implication in Theorem 3.9 is not reversible in general:
Example 3.10. Let , , and μ be the usual topology on V. Define p : V ⟶ V and u : T ⟶ T by p (v) = v2 and u (t) = t for every t ∈ T. Then by Example 3.4 of [53], p : (V, μ) ⟶ (V, μ) is ωs-open but not open. Therefore, by Corollaries 3.4 and 3.6, fpu : (V, τ (μ) , D) ⟶ (V, τ (μ) , D) is soft ωs-open but not soft open.
Theorem 3.11. If fpu : (V, ψ, T) ⟶ (U, φ, S) is a soft ωs-open mapping such that (U, φ, S) is soft locally countable, then fpu is soft open.
Proof. Let K ∈ ψ. Since fpu is soft ωs-open, then fpu (K) ∈ ωs (U, φ, S). Since (U, φ, S) is soft locally countable, then by Theorem 2.8 of [38], fpu (K) ∈ φ. Hence, fpu : (V, ψ, T) ⟶ (U, φ, S) is soft open.
Theorem 3.12. Every soft ωs-open soft mapping is soft semi-open.
Proof. Let fpu : (V, ψ, T) ⟶ (U, φ, S) be a soft ωs-open mapping and let K ∈ ψ. Since fpu is soft ωs-open, then fpu (K) ∈ ωs (U, φ, S). Thus, by Theorem 2.2 of [38], fpu (K) ∈ SO (U, φ, S). Hence, fpu : (V, ψ, T) ⟶ (U, φ, S) is soft semi-open.
The converse of Theorem 3.12 need not be true in general:
Example 3.13. Let , , and . Define p : V ⟶ V and u : T ⟶ T by p (v) = v - 1 and u (t) = t for every t ∈ T. Then by Example 3.7 of [53], p : (V, μ) ⟶ (V, μ) is semi-open but not ωs-open. Therefore, by Corollaries 3.6 and 3.8, fpu : (V, τ (μ) , T) ⟶ (V, τ (μ) , T) is soft semi-open but not soft ωs-open.
Theorem 3.14. If fpu : (V, ψ, T) ⟶ (U, φ, S) is a soft semi-open mapping such that (U, φ, S) is soft anti-locally countable, then fpu is soft ωs-open.
Proof. Let K ∈ ψ. Since fpu is soft semi-open, then fpu (K) ∈ SO (U, φ, S). Since (U, φ, S) is soft anti-locally countable, then by Theorem 2.6 of [38], fpu (K) ∈ ωs (U, φ, S). Hence, fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-open.
Theorem 3.15. For a soft mapping fpu : (V, ψ, T)
⟶ (U, φ, S), the following conditions are equivalent:
(a) fpu is soft ωs-open.
(b) for every N ∈ SS (U, S).
(c) for every N ∈ SS (U, S).
Proof. (a) ⇒ (b): Suppose that fpu is soft ωs-open and let N ∈ SS (U, S). Let
. Then -Clφ (N). To show that , let S ∈ ψ such that . Since fpu is soft ωs-open, then fpu (S) ∈ ωs (U, φ, S). Since -Clφ (N), then . Pick such that . Then . Therefore, .
(b) ⇒ (a): Suppose that
for every N ∈ SS (U, S), and suppose to the contrary that fpu is not soft ωs-open. Then there is K ∈ ψ such that fpu (K) ∉ ωs (U, φ, S) and so, 1S - fpu (K) is not soft ωs-closed. So, we find -Clφ (1S - fpu (K)). Choose such that ew = fpu (by). Then . By assumption, we have
Therefore, . But , a contradiction.
(b) ⇒ (c): Suppose that
for every N ∈ SS (U, S). Let N ∈ SS (U, S). Then by (b),
(c) ⇒ (b): Suppose that
for every N ∈ SS (U, S). Let N ∈ SS (U, S). Then by (c),
Soft Pre-ωs-open
Definition 4.1. A soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S) is called soft pre-ωs-open if for each K ∈ ωs (V, ψ, T), fpu (K) ∈ ωs (U, φ, S).
Theorem 4.2.Let { (V, ψt) : t∈ T } and
{ (U, φs) : s∈ S } be two families of TSs. Let p : V ⟶ U be a function between two sets and let u : T ⟶ S be an injective function between two sets of parameters. Then fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft pre-ωs-open if and only if p : (V, ψt) ⟶ (U, φu(t)) is pre-ωs-open for all t ∈ T.
Proof. Necessity. Suppose that fpu : (V, ⊕ t∈Tψt, T)
⟶ (U, ⊕ s∈Sφs, S) is soft pre-ωs-open. Let t ∈ T. Let X ∈ ωs (V, ψt). Then Theorem 4.8 of [38], tX ∈ ωs (V, ⊕ t∈Tψt, T) and so fpu (tX) = (u (t)) p(X) ∈ ωs (U, ⊕ s∈Sφs, S). Thus, by Theorem 4.8 of [38], ((u (t)) p(X)) (u (t)) = p (X) ∈ ωs (W, φu(t)). It follows that p : (V, ψt) ⟶ (U, φu(t)) is pre-ωs-open.
Sufficiency. Suppose that p : (V, ψt) ⟶ (U, φu(t)) is pre-ωs-open for all t ∈ T. Let K ∈ ωs (V, ⊕ t∈Tψt, T). Then by Theorem 4.8 of [38], K (t) ∈ ωs (V, ψt) for all t ∈ T. Therefore, p (K (t)) ∈ ωs (U, φu(t)) for all t ∈ T. Thus, we have (fpu (K)) (e) = ∅ ∈ ωs (U, φs) if u-1 ({ e }) = ∅ or (fpu (K)) (e) = p (K (t)) ∈ ωs (U, φs) if u (t) = e. Hence, by Theorem 4.8 of [38], fpu (K) ∈ ωs (U, ⊕ s∈Sφs, S). It follows that fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft pre-ωs-open.
Corollary 4.3. Let p : (V, μ) ⟶ (U, α) be a mapping between two TSs and let u : T ⟶ S be an injective function between two sets of parameters. Then p : (V, μ) ⟶ (U, α) is pre-ωs-open if and only if fpu : (V, τ (μ) , T) ⟶ (U, τ (α) , S) is soft pre-ωs-open.
Proof. For each t ∈ T and s ∈ S, put μt = μ and αs = α. Then τ (μ) = ⊕ t∈T
μt and τ (α) = ⊕ s∈S
αs. Thus, by Theorem 4.2, we get the result.
Theorem 4.4.Let { (V, ψt) : t∈ T } and
{ (U, φs) : s∈ S } be two families of TSs. Let p : V ⟶ U be a function between two sets and let u : T ⟶ S be an injective function between two sets of parameters. Then fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft pre-semi-open if and only if p : (V, ψt) ⟶ (U, φu(t)) is pre-semi-open for all t ∈ T.
Proof. Necessity. Suppose that fpu : (V, ⊕ t∈Tψt, T)
⟶ (U, ⊕ s∈Sφs, S) is soft pre-semi-open. Let t ∈ T. Let X ∈ ωs (V, ψt). Then by Theorem 4.10 of [38], tX ∈ SO (V, ⊕ t∈Tψt, T) and so fpu (tX) = (u (t)) p(X) ∈ SO (U, ⊕ s∈Sφs, S). Thus, by Theorem 4.10 of [38], ((u (t)) p(X)) (u (t)) = p (X) ∈ SO (U, φu(t)). It follows that p : (V, ψt) ⟶ (U, φu(t)) is pre-semi-open.
Sufficiency. Suppose that p : (V, ψt) ⟶ (U, φu(t)) is pre-semi-open for all t ∈ T. Let K ∈ SO (V, ⊕ t∈Tψt, T). Then by Theorem 4.10 of [38], K (t) ∈ SO (V, ψt) for all t ∈ T. Therefore, p (K (t)) ∈ SO (U, φu(t)) for all t ∈ T. Thus, we have (fpu (K)) (e) = ∅ ∈ SO (U, φs) if u-1 ({ e }) = ∅ or (fpu (K)) (e) = p (K (t)) ∈ SO (U, φs) if u (t) = e. Hence, by Theorem 4.10 of [38], fpu (K) ∈ SO (U, ⊕ s∈Sφs, S). It follows that fpu : (V, ⊕ t∈Tψt, T) ⟶ (U, ⊕ s∈Sφs, S) is soft pre-semi-open.
Corollary 4.5. Let p : (V, μ) ⟶ (U, α) be a mapping between two TSs and let u : T ⟶ S be an injective function between two sets of parameters. Then p : (V, μ) ⟶ (U, α) is pre-semi-open if and only if fpu : (V, τ (μ) , T) ⟶ (U, τ (α) , S) is soft pre-semi-open.
Proof. For each t ∈ T and s ∈ S, put μt = μ and αs = α. Then τ (μ) = ⊕ t∈T
μt and τ (α) = ⊕ s∈S
αs. Thus, by Theorem 4.4, we get the result.
By the next two examples we will show that the notions of soft openness and soft pre-ωs-openness are independent:
Example 4.6. Let , U ={ a, b, c }, μ ={ ∅ , (– ∞ , 1) , V }, α ={ ∅ , { a } , U }, and . Define p : V ⟶ U and u : T ⟶ T by
and u (t) = t for every t ∈ T.
Then by Example 3.10 of [53], p : (V, μ) ⟶ (U, α) is open but not pre-ωs-open. Therefore, by Corollaries 3.4 and 4.3, fpu : (V, τ (μ) , T) ⟶ (V, τ (α) , T) is soft open but not soft pre-ωs-open.
Example 4.7. Let , and . Define p : V ⟶ V and u : T ⟶ T by
p (v) = v - 1 and u (t) = t for every t ∈ T.
Then by Example 3.11 of [53], p : (V, μ) ⟶ (V, μ) is pre-ωs-open but not open. Therefore, by Corollaries 3.4 and 4.3, fpu : (V, τ (μ) , T) ⟶ (V, τ (μ) , T) is soft pre-ωs-open but soft open.
Theorem 4.8. Let (V, ψ, T) and (U, φ, S) be two soft locally countable STSs, and let fpu : (V, ψ, T) ⟶ (U, φ, S) be a soft mapping. Then fpu is soft open if and only if fpu is soft pre-ωs-open.
Proof. Follows from the definitions and Theorem 2.8 of [38].
By the next two examples we will show that the notions of soft pre-semi-openness and soft pre-ωs-openness are independent:
Example 4.9. Let , , and . Define p : V ⟶ V and u : T ⟶ T by p (v) = v - 1 and u (t) = t for every t ∈ T. Then by Example 3.13 of [53], p : (V, μ) ⟶ (V, μ) is pre-semi-open but not pre-ωs-open. Therefore, by Corollaries 4.3 and 4.5, fpu : (V, τ (μ) , T) ⟶ (V, τ (μ) , T) is soft pre-semi-open but not soft pre-ωs-open
Example 4.10. Let V = {1, 2, 3, 4},
μ = {∅ , V, {1, 2} , {1} , {2}},
α = {∅ , V, {2, 3, 4} , {1, 2} , {1} , {2}},
and . Let p : V ⟶ V and u : T ⟶ T be the identities functions. By Example 3.14 of [53], p : (V, μ) ⟶ (V, α) is pre-ωs-open but not pre-semi-open. Therefore, by Corollaries 4.3 and 4.5, fpu : (V, τ (μ) , T) ⟶ (V, τ (α) , T) is soft pre-ωs-open but not soft pre-semi-open.
Theorem 4.11.Let (V, ψ, T) and (U, φ, S) be soft locally countable, and let fpu : (V, ψ, T) ⟶ (U, φ, S) be a soft mapping. Then fpu is soft pre-semi-open if and only if fpu is soft pre-ωs-open.
Proof. Follows from definitions and Theorem 2.6 of [38].
Theorem 4.12. Every soft pre-ωs-open mapping is soft ωs-open.
Proof. Let fpu : (V, ψ, T) ⟶ (U, φ, S) be a soft pre-ωs-open soft mapping and let K ∈ ψ. Then by Theorem 2.2 of [38], K ∈ ωs (V, ψ, T). Since fpu is soft pre-ωs-open, then fpu (K) ∈ ωs (U, φ, S). Therefore, fpu is soft ωs-open.
The soft mapping fpu in Example 4.6 is soft open but not soft pre-ωs-open, and by Theorem 3.9, fpu is soft ωs-open. Therefore, the converse of the implication in Theorem 4.12 need not be true in general.
Theorem 4.13.For a soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S), the following conditions are equivalent:
(a) fpu is soft pre-ωs-open.
(b) - for every N ∈ SS (U, S).
(c) ωs- for every N ∈ SS (U, S).
Proof. (a) ⇒ (b): Suppose that fpu is soft pre-ωs-open and let N ∈ SS (U, S). Let
. To show that -, let H ∈ ωs (V, ψ, T) such that . Then . Since fpu is soft pre-ωs-open, then fpu (H) ∈ ωs (U, φ, S). Since -Clφ (N), then . Choose such that . Then
and thus .
Therefore, -.
(b) ⇒ (a): Suppose that
- for every N ∈ SS (U, S), and suppose to the contrary that fpu is not soft pre-ωs-open. Then there is K ∈ ωs (V, ψ, T) such that fpu (K) ∉ ωs (U, φ, S). Thus, we have 1S - fpu (K) is not soft ωs-closed, and so there is -Clφ (1S - fpu (K)). Choose such that by = fpu (ax). Then . By (b), we have
Therefore, but , a contradiction.
(b) ⇒ (c): Suppose that
- for every N ∈ SS (U, S) and let N ∈ SS (U, S). Then
(c) ⇒ (b): Suppose that ωs-
for every N ∈ SS (U, S) and let N ∈ SS (U, S). Then
Theorem 4.14.Let fpu : SS (V, T) ⟶ SS (U, S) be a soft mappings between two families of soft sets. If fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-continuous and fpu : (V, ψω, T) ⟶ (U, φω, S) is soft open, then fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-irresolute.
Proof. Let K ∈ ωs (U, φ, S). Choose H ∈ φ such that . Then
. Since fpu : (V, ψ, T) ⟶ (U, φ, S) is soft ωs-continuous, then . Since fpu : (V, ψω, T) ⟶ (U, φω, S) is soft open, then
. Therefore, we have with and thus, . This ends the proof.
Theorem 4.15.Let fpu : SS (V, T) ⟶ SS (U, S) be a soft mappings between two families of soft sets. If fpu : (V, ψ, T) ⟶ (U, φ, S) is soft open and fpu : (V, ψω, T) ⟶ (W, φω, S) is soft continuous, then fpu : (V, ψ, T) ⟶ (U, φ, S) is soft pre-ωs-open.
Proof. Let M ∈ ωs (V, ψ, T). Then there is K ∈ ψ such that , and so
. Since fpu : (V, ψ, T) ⟶ (U, φ, S) is soft open, then fpu (K) ∈ φ. Since fpu : (V, ψω, T) ⟶ (U, φω, S) is soft continuous, . Therefore, we have with fpu (K) ∈ φ, and hence, fpu (M) ∈ ωs (U, φ, S). This ends the proof.
Definition 4.16. A soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S) is called soft ω-open if for each K ∈ ψ (V, ψ, T), fpu (K) ∈ φω.
Definition 4.17. A soft mapping fpu : (V, ψ, T) ⟶ (U, φ, S) is called soft pre-ωs-closed if for each soft ωs-closed of (V, ψ, T), fpu (M) is soft ωs-closed set in (U, φ, S).
Theorem 4.18. If fpu : (V, ψ, T) ⟶ (U, φ, S) is soft pre-ωs-closed, soft pre-ωs-open, and soft ωs-irresolute such that (V, ψ, T) is soft ω-regular, then fpu is soft ω-open.
Proof. Suppose to the contrary that there is K ∈ ψ such that fpu (K) ∉ φω. Then we find such that . By soft ω-regularity of (V, ψ, T), there is M ∈ ψ such that . Since Clψω (M) is soft ωs-closed and fpu is soft ωs-closed, then 1S - fpu (Clψω (M)) ∈ ωs (U, φ, S) with . Since , then . Thus,
Put . Since fpu is soft ωs-irresolute, then H ∈ ωs (V, ψ, T) and by Theorem 2.13 of [38], . Since fpu is soft pre-ωs-open, then . Since
then fpu (tv) ∈ ωs (U, φ, S). Thus, there is N ∈ φ such that . Hence, fpu (tv) ∈ φ. Since , then
, a contradiction.
Conclusion
Because of its enormous practical utility, soft set theory has been widely applied in numerous real-world applications. Topologists have used soft sets to construct soft topological spaces and soft frames to study traditional topological notions. Abstract topological notions in soft settings, such as soft separation axioms [21], and generalized soft open sets [31], have been effectively utilized to solve real difficulties in information systems, economics, and medicine, as highlighted in the published literature.
In this paper, we have benefited from one of the generalizations of soft open sets called “soft ωs-open sets” to introduce some modifications of continuity and openness between TSs via the frame of soft topologies. We have presented novel types of soft continuity and soft openness namely, soft ωs-irresoluteness, soft ωs-openness, and soft pre-ωs-openness. We have established the main properties of these concepts and provided some interesting examples to show the relationships between them and other related concepts. Some characterizations of each of these concepts have been obtained. Also, some exciting results behaviors of these concepts and their topologically corresponding notions have been obtained.
The following topics could be considered for future studies: 1) Defining soft ωs-homeomorphisms; 2) Defining soft define several soft covering properties via soft ωs-open sets 3) To examine which of the soft topological properties can be preserved under these new types of soft mappings.
References
1.
MolodtsovD., Soft set theory-first results, Comput Math Appl37 (1999), 19–31.
2.
MajiP.K., BiswasR. and RoyR., An application of soft sets in a decision making problem, Comput Math Appl44 (2002), 1077–1083.
3.
MajiP.K., BiswasR. and RoyA.R., Soft set theory, Comput Math Appl45 (2003), 555–562.
4.
AliM.I., FengF., LiuX.Y., MinW.K. and ShabirM., On some new operations in soft set theory, Comput Math Appl57 (2009), 1547–1553.
5.
QinK. and HongZ., On soft equality, J Comput Appl Math234 (2010), 1347–1355.
6.
AktasH. and CagmanN., Soft sets and soft groups, Inf Sci177 (2007), 2726–2735.
7.
AcarU., KoyuncuF. and TanayB., Soft sets and soft rings, Comput Math Appl59 (2010), 3458–3463.
8.
DavvazB., SardarS. and GuptaS., Fundamentals of soft category theory, Bull Comput Appl Math6 (2018), 59–82.
9.
ShabirM. and NazM., On soft topological spaces, Comput Math Appl61 (2011), 1786–1799.
10.
CagmanN., KaratasS. and EnginogluS., Soft topology, Comput Math Appl62 (2011), 351–358.
11.
AygunogluA. and AygunH., Some notes on soft topological spaces, Neural Comput Appl21 (2012), 113–119.
12.
Al-shamiT.M. and KocinacL.D., Almost soft Menger and weakly soft Menger spaces, Appl Comput Math21 (2022), 35–51.
13.
Al-shamiT.M., MhemdiA., RawshdehA.A. and Al-JarrahH.H., Soft version of compact and Lindelöf spaces using soft somewhere dense sets, AIMS Math6 (2021), 8064–8077.
Al-shamiT.M., El-ShafeiM.E. and Abo-ElhamayelM., Almost soft compact and approximately soft Lindelöf spaces, J Taibah Univ Sci12 (2018), 620–630.
16.
LinF., Soft connected spaces and soft paracompact spaces, Int J Math Comput Sci7 (2013), 277–283.
17.
AsaadB.A., Results on soft extremely disconnectedness of soft topological spaces, J Math Comput Sci17 (2017), 448–464.
18.
BayramovS. and GunduzC., A new approach to separability and compactness in soft topological spaces, TWMS J Pure Appl Math9 (2018), 82–93.
19.
Al-shamiT.M. and El-ShafeiM.E., Partial belong relation on soft separation axioms and decision-making problem, two birds with one stone, Soft Comput24 (2020), 5377–5387.
20.
El-ShafeiM.E. and Al-shamiT.M., Applications of partial belong and total non-belong relations on soft separation axioms and decision-making problem, Comput Appl Math39 (2020), 138.
21.
Al-shamiT.M., On soft separation axioms and their applications on decision-making problem, Math Probl Eng2021 (2021), 8876978.
22.
DasS. and SamantaS.K., Soft metric, Ann Fuzzy Math Inform6 (2013), 77–94.
23.
CetkinV., GunerE. and AygunH., On 2S-metric spaces, Soft Comput24 (2020), 12731–12742.
24.
BadyakarU. and NazmulS., Some fixed soft point results on soft S-metric spaces, Math Sci15 (2021), 283–291.
25.
Al GhourS. and Bin-SaadonA., On some generated soft topological spaces and soft homogeneity, Heliyon5 (2019), e02061.
Al-shamiT.M., MhemdiA., Abu-GdairiR. and El-ShafeiM.E., Compactness and connectedness via the class of soft somewhat open sets, AIMS Mathematics8 (2023), 815–840.
28.
Al GhourS., Soft connectivity and soft θ-connectivity relative to a soft topological space, Journal of Intelligent and Fuzzy Systems43 (2022), 6371–6381.
29.
Al GhourS. and AmeenZ.A., Maximal soft compact and maximal soft connected topologies, Applied Computational Intelligence and Soft Comput2022 (2022), 9860015.
30.
Al GhourS., On soft generalized ω-closed sets and soft T1/2 spaces in soft topological spaces, Axioms11 (2022), 194.
31.
Al-shamiT.M., Soft somewhat open sets: soft separation axioms and medical application to nutrition, Computational and Applied Mathematics41 (2022), 216.
32.
AzzamA.A., AmeenZ.A., Al-shamiT.M. and El-ShafeiM.E., Generating soft topologies via soft set operators, Symmetry14 (2022), 914.
33.
Al-shamiT.M., AmeenZ.A., AzzamA.A. and El-ShafeiM.E., Soft separation axioms via soft topological operators, AIMS Mathematics7 (2022), 15107–15119.
34.
Al-shamiT.M. and MhemdiA., Two families of separation axioms on infra soft topological spaces, Filomat36 (2022), 1143–1157.
35.
Al-shamiT.M., Defining and investigating new soft ordered maps by using soft semi open sets, Acta Universitatis Sapientiae, Mathematica13 (2021), 145–163.
36.
Al-shamiT.M., On soft separation axioms and their applications on decision-making problem, Math Probl Eng2021 (2021), 8876978.
37.
Al-shamiT.M., Compactness on soft topological ordered spaces and its application on the information system, Journal of Mathematics2021 (2021), 6699092.
38.
Al GhourS., Strong form of soft semiopen sets in soft topological spaces, Int J Fuzzy Log Intelligent Syst21 (2021), 159–168.
39.
NazmulS.K. and SamantaS.K., Neighbourhood properties of soft topological spaces, Ann Fuzzy Math Inform6 (2013), 1–15.
40.
AkdagM. and OzkanA., Soft α-open sets and soft α-continuous functions, Abstr Appl Anal2014 (2014), 1–7.
41.
MahantaJ. and DasP.K., On soft topological space via semiopen and semiclosed soft sets, Kyungpook Math J4 (2014), 221–223.
42.
YumakY. and KaymakciA.K., Soft β-open sets and their applications, J New Theory4 (2015), 80–89.
43.
Al GhourS., Soft ω-continuity and soft ωs-continuity in soft topological spaces, International Journal of Fuzzy Logic and Intelligent Systems22 (2022), 183–192.
44.
Al GhourS., Somewhat omega continuity and somewhat omega openness in soft topological spaces, Systems44 (2023), 1385–1396.
45.
Al GhourS., Soft mappings via soft semi ω-open sets, Journal of Mathematics and Computer Science30 (2023), 133–146.
46.
Al GhourS., Strong form of soft semiopen sets in soft topological spaces, Int J Fuzzy Log Intelligent Syst21 (2021), 159–168.
47.
EngelkingR., General Topology, 2nd ed. (Heldermann Verlag, Berlin, 1989).