International Journal of Fuzzy Logic and Intelligent Systems 2024; 24(2): 160-170
Published online June 25, 2024
https://doi.org/10.5391/IJFIS.2024.24.2.160
© The Korean Institute of Intelligent Systems
Samer Al Ghour
Department of Mathematics and Statistics, Jordan University of Science and Technology, Irbid, Jordan
Correspondence to :
Samer Al Ghour (algore@just.edu.jo)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0/) which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
We define soft ω-weak continuity as a new soft continuity notion, which is strictly weaker than the soft ω-continuity and soft weak continuity. We present two characterizations and two composition theorems for the soft ω-weak continuity. Moreover, via soft ω-weak continuity, we give several preservation theorems related to soft connectedness and soft separation axioms. Additionally, we introduce w*-ω-continuous functions as a new class of soft functions strictly containing a class of soft ω-continuous functions. We show that soft ω-weak continuity and soft w*-ω-continuities are independent notions, and use them to obtain a decomposition theorem for the soft ω-continuity. Finally, we study the relationships between our new soft notions and their analogs in general topology.
Keywords: ω-weak continuity, Soft ω-continuity, Soft connectedness, Soft Urysohn, Generated soft topology
The soft sets concept was first proposed by the Russian mathematician Molodtsov [1] in 1999. Techniques for simulating mathematical issues, including uncertainty soft sets, are a more effective approach when there are no incomplete data because owing to nonrestrictive criteria for classifying objects in the present theory, thereby allowing researchers to select the type of characteristics required. Other theories, such as the fuzzy set theory [2], rough set theory [3], intuitionistic fuzzy sets [4], and vague set theory [5] can be as considered mathematical techniques for addressing uncertainty. However, each has its own set of challenges. Soft set theory, according to Molodtsov [1], can be applied in various areas. Maji et al. [6] investigated the (detailed) theoretical framework of soft set theory. They created various operators, specifically soft set theory. Since Maji’s contribution [6], other mathematical models, such as the soft group theory and soft ring theory have been examined in soft contexts. Shabir and Naz [7] began researching soft topological spaces as a generalization of topological space in 2011. Several soft topological notions, including soft separation axioms, soft-covering axioms, soft connectedness, and weak and strong soft continuities have been introduced and investigated in recent years [8–21]. Soft topologies and applications are currently an established field of study [22–24]. A major goal of this study is to demonstrate how the definition of
This study adheres to the notions and terminology provided in [11, 25, 26]. Soft topological space (STS) and topological space (TS) are utilized in this study.
Let
Let (
The following definitions are used:
Let (
(a) weak-continuous (w-c) at
(b)
Let (
(a) soft weak continuous (soft w-c) at
(b) soft
An STS (
(a) soft connected if
(b) soft disconnected if not soft-connected [30].
(c) soft Hausdorff space if, for every
(d) soft regular if for each
(e) soft Urysohn space if, for every
Let
(a)
(b)
For a soft function
(a)
(b) for each
(c) for every
(b) ⇒(c). Let
We have
Since
(c) ⇒ (a). Let
This completes the proof.
Let {(
(
If
Let
Each soft
Theorem 2.5’s converse is not always true, as demonstrated by the following illustration:
Let
and
Thus, from Corollaries 2.5 and 2.6 in [15],
If
It follows that
Each soft w-c function is soft
The following example shows that the converse of Theorem 2.8 need not be true in general:
Let
For any function
The soft function
is soft w-c.
This indicates that
is soft w-c. Let
Since
The soft function
is soft
This indicates that
is soft
Since
Let (
(a) (
(b) (
If (
Each soft
Therefore,
In general, soft connectedness does not imply soft
Consider (ℕ,Ω,ℤ) where Ω = {0ℤ, 1ℤ}. Then
Every soft anti-locally countable soft-connected STS is soft
Let {(
If {(
If (
If {(
If (
If (
Thus,
Thus,
If (
Since
Thus, we have
It follows that (
The following result shows that the two soft w-c functions from an STS into a soft Urysohn TS agreed upon in a soft closed set:
If
We demonstrate that 1
Thus, we have
Then
Let
If (
Since
Thus, we have
It follows that (
The following result shows that the two soft
If
Since
Thus, we have
Let
If
Since
Therefore, according to Theorem 2.2 (c),
Let
Thus,
Therefore, from Theorem 2.2 (c),
The soft function
Let {(
Let {(
Thus,
From Lemma 3.2, we can conclude that
Additionally, because
Therefore,
This implies that
Thus, for each
Therefore,
This shows that
is soft
Let
The following two examples demonstrate the independence of the soft
Let
Let
and
Therefore, from Corollaries 2.4 and 3.4,
Each soft
The opposite of Theorem 3.7 need not be true, as demonstrated in Example 3.5 and Theorem 2.5.
The following main result represents the decomposition of soft
The soft function
Therefore, we have
However, since
We define soft
In future work, we plan to (1) define and study weaker forms of
No potential conflict of interest relevant to this article was reported.
International Journal of Fuzzy Logic and Intelligent Systems 2024; 24(2): 160-170
Published online June 25, 2024 https://doi.org/10.5391/IJFIS.2024.24.2.160
Copyright © The Korean Institute of Intelligent Systems.
Samer Al Ghour
Department of Mathematics and Statistics, Jordan University of Science and Technology, Irbid, Jordan
Correspondence to:Samer Al Ghour (algore@just.edu.jo)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/3.0/) which permits unrestricted noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
We define soft ω-weak continuity as a new soft continuity notion, which is strictly weaker than the soft ω-continuity and soft weak continuity. We present two characterizations and two composition theorems for the soft ω-weak continuity. Moreover, via soft ω-weak continuity, we give several preservation theorems related to soft connectedness and soft separation axioms. Additionally, we introduce w*-ω-continuous functions as a new class of soft functions strictly containing a class of soft ω-continuous functions. We show that soft ω-weak continuity and soft w*-ω-continuities are independent notions, and use them to obtain a decomposition theorem for the soft ω-continuity. Finally, we study the relationships between our new soft notions and their analogs in general topology.
Keywords: &omega,-weak continuity, Soft &omega,-continuity, Soft connectedness, Soft Urysohn, Generated soft topology
The soft sets concept was first proposed by the Russian mathematician Molodtsov [1] in 1999. Techniques for simulating mathematical issues, including uncertainty soft sets, are a more effective approach when there are no incomplete data because owing to nonrestrictive criteria for classifying objects in the present theory, thereby allowing researchers to select the type of characteristics required. Other theories, such as the fuzzy set theory [2], rough set theory [3], intuitionistic fuzzy sets [4], and vague set theory [5] can be as considered mathematical techniques for addressing uncertainty. However, each has its own set of challenges. Soft set theory, according to Molodtsov [1], can be applied in various areas. Maji et al. [6] investigated the (detailed) theoretical framework of soft set theory. They created various operators, specifically soft set theory. Since Maji’s contribution [6], other mathematical models, such as the soft group theory and soft ring theory have been examined in soft contexts. Shabir and Naz [7] began researching soft topological spaces as a generalization of topological space in 2011. Several soft topological notions, including soft separation axioms, soft-covering axioms, soft connectedness, and weak and strong soft continuities have been introduced and investigated in recent years [8–21]. Soft topologies and applications are currently an established field of study [22–24]. A major goal of this study is to demonstrate how the definition of
This study adheres to the notions and terminology provided in [11, 25, 26]. Soft topological space (STS) and topological space (TS) are utilized in this study.
Let
Let (
The following definitions are used:
Let (
(a) weak-continuous (w-c) at
(b)
Let (
(a) soft weak continuous (soft w-c) at
(b) soft
An STS (
(a) soft connected if
(b) soft disconnected if not soft-connected [30].
(c) soft Hausdorff space if, for every
(d) soft regular if for each
(e) soft Urysohn space if, for every
Let
(a)
(b)
For a soft function
(a)
(b) for each
(c) for every
(b) ⇒(c). Let
We have
Since
(c) ⇒ (a). Let
This completes the proof.
Let {(
(
If
Let
Each soft
Theorem 2.5’s converse is not always true, as demonstrated by the following illustration:
Let
and
Thus, from Corollaries 2.5 and 2.6 in [15],
If
It follows that
Each soft w-c function is soft
The following example shows that the converse of Theorem 2.8 need not be true in general:
Let
For any function
The soft function
is soft w-c.
This indicates that
is soft w-c. Let
Since
The soft function
is soft
This indicates that
is soft
Since
Let (
(a) (
(b) (
If (
Each soft
Therefore,
In general, soft connectedness does not imply soft
Consider (ℕ,Ω,ℤ) where Ω = {0ℤ, 1ℤ}. Then
Every soft anti-locally countable soft-connected STS is soft
Let {(
If {(
If (
If {(
If (
If (
Thus,
Thus,
If (
Since
Thus, we have
It follows that (
The following result shows that the two soft w-c functions from an STS into a soft Urysohn TS agreed upon in a soft closed set:
If
We demonstrate that 1
Thus, we have
Then
Let
If (
Since
Thus, we have
It follows that (
The following result shows that the two soft
If
Since
Thus, we have
Let
If
Since
Therefore, according to Theorem 2.2 (c),
Let
Thus,
Therefore, from Theorem 2.2 (c),
The soft function
Let {(
Let {(
Thus,
From Lemma 3.2, we can conclude that
Additionally, because
Therefore,
This implies that
Thus, for each
Therefore,
This shows that
is soft
Let
The following two examples demonstrate the independence of the soft
Let
Let
and
Therefore, from Corollaries 2.4 and 3.4,
Each soft
The opposite of Theorem 3.7 need not be true, as demonstrated in Example 3.5 and Theorem 2.5.
The following main result represents the decomposition of soft
The soft function
Therefore, we have
However, since
We define soft
In future work, we plan to (1) define and study weaker forms of
Samer Al Ghour
International Journal of Fuzzy Logic and Intelligent Systems 2021; 21(3): 269-279 https://doi.org/10.5391/IJFIS.2021.21.3.269Samer Al Ghour
International Journal of Fuzzy Logic and Intelligent Systems 2021; 21(2): 159-168 https://doi.org/10.5391/IJFIS.2021.21.2.159Samer Al Ghour
International Journal of Fuzzy Logic and Intelligent Systems 2021; 21(1): 57-65 https://doi.org/10.5391/IJFIS.2021.21.1.57