On Neutrosophic Crisp Soft Separation Axioms via Neutrosophic Crisp Soft Set in Neutrosophic Crisp Soft Topological Space
Abstract
In this pioneering study, we introduce the concept of Neutrosophic Crisp Soft Sets (NCSSs) for the first time globally. Using this new class of sets, we examine “Neutrosophic Crisp Soft Topological Space” (NCSTS) and identify many key properties. Additionally, we extend the concept of neutrosophic crisp points to Neutrosophic Crisp Soft Points (NCSPs), which then form the basis for discovering a novel type of “neutrosophic crisp soft separation axioms” within “NCSTSs”. We further explore the relationships between these separation axioms and provide insightful remarks and theorems related to these concepts. Moreover, this research presents fundamental definitions of NCSSs, including operations such as union and intersection. We also demonstrate their applicability through theorems, remarks, and examples. These new sets prove valuable in decision-making processes across diverse fields such as economics, agriculture, medicine, engineering, and others.
Keywords:Neutrosophic crisp soft setsNeutrosophic crisp soft pointsNeutrosophic crisp soft separation
axioms, Neutrosophic crisp soft topological space.
1. Introduction
Soft set theory, as defined by Molodtsov [1], is recognized as a highly versatile, efficient, and practical mathematical tool. This theory stands out because it avoids the limitations of parameterization inadequacy associated with other uncertainty-based theories. Molodtsov [1] successfully demonstrated several applications of soft set theory, including its integration into “game theory”, “Riemann integration”, “Perron integration”, “function smoothness”, “operation research”, and “probability”.
The applications of soft set theory have seen rapid advancement across diverse fields. For instance, Shabir and Naz [2] explored the concept of “Soft Topological Spaces” (STSs), focusing on soft sets within these spaces and their related separation axioms. Additionally, other concepts such as “fuzzy topological spaces”, “fuzzy STSs”, “intuitionistic fuzzy topological spaces”, and “intuitionistic fuzzy STSs” were introduced by Chang [3], Li and Cui [4], Coker [5], and Tokat [6]. Detailed discussions on these concepts can be found in [7–11].
Many researchers have expanded this field significantly, contributing to various studies on soft set theory [12, 13, 22–26, 14–21]. The domain of soft algebraic structures has also witnessed substantial progress, with notable contributions from [27–32]. As a generalization of classical theories such as classical sets, fuzzy sets, and intuitionistic fuzzy sets, Smarandache [33], [34] defined the innovative “concept of Neutrosophic Set” (NS).
To unify “soft set theory” with “neutrosophic set theory”, Maji [13] suggesed the concept of “Neutrosophic Soft Sets” (NSS). Following this, A. Salama et al. [35] defined Neutrosophic Crisp Sets (NCS), which further expanded the theoretical framework. Researchers have extensively explored NCSs, contributing valuable insights through numerous publications [36–38].
This paper presents a novel integration of “soft set theory” and “NCS theory” by introducing “the concept of Neutrosophic Crisp Soft Sets” (NCSSs). Utilizing these set, the study defines related concepts such as Neutrosophic Crisp Soft Topological Spaces (NCSTS), Neutrosophic Crisp Soft Points (NCSPs), and neutrosophic crisp soft separation axioms. Furthermore, it examines the practical applications of “NCSSs” in “decision-making”, supported by illustrative examples. These sets have broad applications across various domains, including economics, medicine, agriculture, engineering, and more.
2. Preliminaries and Some Properties
Now, we will recall some new concepts about “STS”.
Definition 1 ([1]). Let Υ be an “initial universe set” and Ę be a “set of parameters”. Let ℘(Υ) is the power set of Υ and БĘ.
(ℱ, Б) is identified as a “soft set” on Υ; ℱ: Б → ℘(Υ) is a mapping. In other words, a “soft set” on Υ is a “parametrized family of sub-sets” of Υ.
Definition 2 ([2]). Let χ ≠ ∅ be a set and Let be the collection of soft sets over χ, then (χ , ξ) is identified as a STS if
I. ̌, ∅ ̌ .
II. Å1, Å2 Å1 Å2 .
III. (Åi) ξ (Åi) ξ.
iI iI
Definition 3 ([35]).Let χ ≠ ∅ be any set. A “NCS” Б is a set having the form Б =< Б1, Б2, Б3 > where Б1, Б2 and Б3 are sub-sets of χ.
Definition 4 ([36]). Types of ∅N and χN in χ:
I. ∅N defined as follows (in many ways):
− ∅ = > ∅, ∅, < (Type 1) − ∅ = > ∅, , ∅ < (Type 2) − ∅ = > ∅, , < (Type 3) − ∅ = > ∅, ∅, ∅ < (Type 4)
II. N defined as the follows:
− = > , ∅, ∅ < (Type 1) − = > , , ∅ < (Type 2) − = > , ∅, < (Type 3) − = > , , < (Type 4)
Definition 5 ([35]).Let χ ≠ ∅ be a set and Let ξ be the collection of NCSs over χ, then (χ , ξ) called a NCTS if I. χN, ∅Nξ.
II. Å1, Å2 ξ Å1 Å2 ξ.
III. (Åi) ξ (Åi) ξ.
iI iI
3. Neutrosophic Crisp Soft Set
In this part we introducing the concept of NCSSs for the first time globally. Using this new class of sets, we present fundamental definitions of NCSSs, including operations such as union and intersection. Moreover, we examine identify several key properties. These new sets prove valuable in decision-making processes across diverse fields such as economics, agriculture, medicine, engineering, and others.
Definition 6. If U is nonempty sets, and A be a subset of E (where E be a set of parameters) and Բ: A→( ℘(U), ℘(U), ℘(U)) is a “mapping”.
Then a pair (Բ, A) is called a NCSS over U, where (Բ, A) = {< բ (e), բ (e), բ (e) >: e ∈ A}{<
℘(U), ℘(U), ℘(U) >}.
Definition 7. (Բ, A) is complement of a NCSS (Բ, A) where
c c 1 2 3
Բ : A→(℘(U),℘(U),℘(U)) and Բ (e) = {< U − բ (e), U − բ (e), U − բ (e) >: e ∈
A}( ℘(U), ℘(U), ℘(U)): for all e ∈ A.
Example 1. Let A = {e1, e3, e5}E.
Let (Բ, A) be NCSSs on U = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6} and Բ(e1) = {< {ჩ1, ჩ2, ჩ3}, {ჩ1, ჩ3}, {ჩ1, ჩ2} >}, Բ(e3) = {< {ჩ4, ჩ5, ჩ6}, {ჩ5, ჩ6}, {ჩ1, ჩ2, ჩ3} >}, Բ(e5) = {< {ჩ1, ჩ3}, {ჩ2, ჩ3}, {ჩ1, ჩ2, ჩ3} >}.
The complement of (Բ, A) is denoted by (Բ, A) Բ : A→(℘(U), ℘(U), ℘(U)) where Բ (e1) = {< {ჩ4, ჩ5, ჩ6}, {ჩ2, ჩ4, ჩ5, ჩ6}, {ჩ3, ჩ4, ჩ5, ჩ6} >}, Բ (e3) = {< {ჩ1, ჩ2, ჩ3}, {ჩ1, ჩ2, ჩ3, ჩ4}, {ჩ4, ჩ5, ჩ6} >}, Բ (e5) = {< {ჩ2, ჩ4, ჩ5, ჩ6}, {ჩ1, ჩ4, ჩ5, ჩ6}, {ჩ4, ჩ5, ჩ6} >}.
Definition 8. For two NCSSs (Բ, ) and (G, ) on U, then (Բ, ) is a “neutrosophic crisp soft sub-set” of (G, ) ((բ, ) ̃ ( , )) if
I. .
1 1 2 2 3 3 1 1 2 2 3 3
II. f ( ) g ( ), f ( )g ( ), f ( ) g ( ) or f ( ) g ( ), f ( )g ( ), f ( ) g ( ), for all ∈ . Example 2. Let = { 1, 3, 5}E, and = { 1, 2, 3, 5}E.
Let (Բ, ) and (G, ) be two NCSSs over U = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6}; բ(e1) = {< {ჩ1, ჩ2, ჩ3}, {ჩ1, ჩ3}, {ჩ1, ჩ2} >, բ(e3) = {< {ჩ4, ჩ5, ჩ6}, {ჩ5, ჩ6}, {ჩ1, ჩ2, ჩ3} >, բ(e5) = {< {ჩ1, ჩ3}, {ჩ2, ჩ3}, {ჩ1, ჩ2, ჩ3} >, G(e1) = {< {ჩ1, ჩ2, ჩ3, ჩ4}, {ჩ1, ჩ3, ჩ5}, {ჩ2} >, G(e3) = {< {ჩ4, ჩ5, ჩ6}, {ჩ4, ჩ5, ჩ6}, {ჩ1, ჩ3} >, G(e5) = {< {ჩ1, ჩ2, ჩ3}, {ჩ1, ჩ2, ჩ3}, {ჩ1, ჩ2, ჩ3} >, G(e2) = {< {ჩ1, ჩ3}, {ჩ1, ჩ2}, { ჩ2, ჩ3} >.
It is clear that (բ, ) ̃ (G, ).
Definition 9. Let (Բ,A) and (G, ) be two NCSS, then(G, ) = (բ, A) if (բ, A) ̃ (G, ) and (G, ) ̃(բ, A). Definition 10.
I. A NCSS (Բ, A) is identified as a neutrosophic crisp null soft set over χ, denoted by a ∅ ̌, if Բ(e) =
∅N: for all e ∈ A.
II. A NCSS (Բ, A) is identified as a neutrosophic crisp absolute s soft set over χ, denoted by a χ ̌ N, if Բ(e) =
χN: for all e ∈ A.
Definition 11. Union of two NCSS (Բ, A) and (G, ) ((բ, A) ∪ ̃ (G, ) ) on the common universe χ is the NCSS (H,C), where C = AU , and H: A →(℘ (χ), ℘ (χ), ℘ (χ)) and for all ∈ C H( ) = {< f ( ), f ( ), f ( ) >}: ∈ A = {< g ( ), g ( ), g ( ) >}: ∈ B
1 1 2 2 3 3
= {< f ( ) ∪ g ( ), f ( ) ∪ g ( ), f ( ) ∩ g ( ) >} ∈ A ∩ or
1 1 2 2 3 3
= {< f ( ) ∪ g ( ), f ( ) ∩ g ( ), f ( ) ∩ g ( ) >} ∈ A ∩ Example 3. In Example 2, (բ, ) ∪ ̃ (G, ) = (H, C), where C = AU , and H: A →( ℘(χ), ℘ (χ), ℘ (χ)) and for all e ∈ C, H(e1) = {< {ჩ1, ჩ2, ჩ3, ჩ4}, {ჩ1, ჩ3, ჩ5}, {ჩ2} >, H(e3) = {< {ჩ4, ჩ5, ჩ6}, {ჩ4, ჩ5, ჩ6}, {ჩ1, ჩ3} >>, H(e5) = {< {ჩ1, ჩ2, ჩ3}, {ჩ1, ჩ2, ჩ3}, {ჩ1, ჩ2, ჩ3} >, H(e2) = {< {ჩ1, ჩ3}, {ჩ1, ჩ2}, { ჩ2, ჩ3} >.
Definition 12. The intersection of two “soft sets” of (Բ, A) and (G, ) on χ is the “soft sets” (H, C); C = A , and H: A →(℘ (χ), ℘ (χ), ℘ (χ)) and for all ∈ C
1 1 2 2 3 3
H( ) = {< f ( ) ∩ g ( ), f ( ) ∩ g ( ), f ( ) ∪ g ( ) >}: ∈ A ∩ B or
1 1 2 2 3 3
= {< f ( ) ∩ g ( ), f ( ) ∪ g ( ), f ( ) ∪ g ( ) >}: ∈ A ∩ B.
Example 4. In Example 2, (բ, A) ∩ ̃ (G, ) = (H, C); C = AB; H: AB→(℘ (χ), ℘ (χ), ℘ (χ)) and for all e ∈ C H(e1) = {< {ჩ1, ჩ2, ჩ3}, {ჩ1, ჩ3}, {ჩ1, ჩ2} >, H(e3) = {< {ჩ4, ჩ5, ჩ6}, {ჩ5, ჩ6}, {ჩ1, ჩ2, ჩ3} >, H(e5) = {< {ჩ1, ჩ3}, {ჩ2, ჩ3}, {ჩ1, ჩ2, ჩ3} >.
Definition 13. Let (Բ, A) and (G, B) are two NCSS then “(բ, ) and (G, B)” denoted by (բ, A) (G, B) is defined by (բ, A) (G, B) = (H, A × B); H(ϋ, ς) = բ(ϋ) ∩ G(ς); for all (ϋ, ς) ∈ A × B, which mean:
H(ϋ, ς) = բ(ϋ) ∩ G(ς)
1 1 2 2 3 3
= {< f (ϋ) ∩ g (ς), f (ϋ) ∩ g (ς), f (ϋ) ∪ g (ς) >} or
1 1 2 2 3 3
= {< f (ϋ) ∩ g (ς), f (ϋ) ∪ g (ς), f (ϋ) ∪ g (ς) >} .
Definition 14. Let (Բ, A) and (G, B) are two NCSS then “(բ, A) or (G, )” ((բ, A) (G, )); (բ, A)(G, ) = (Q, A × B); Q(ϋ, ς) = բ(ϋ) ∪ G(ς); for all (ϋ, ς) ∈ A × B, which mean:
Q(ϋ, ς) = բ(ϋ) ∪ G(ς)
1 1 2 2 3 3
= {< f (ϋ) ∪ g (ς), f (ϋ) ∪ g (ς), f (ϋ) ∩ g (ς) >} or
1 1 2 2 3 3
= {< f (ϋ) ∪ g (ς), f (ϋ) ∩ g (ς), f (ϋ) ∩ g (ς) >}.
Proposition 1.
I. ((բ, A) (G, )) = (բ, A) (G, ).
II. ((բ, A) (G, )) = (բ, A) (G, ).
Proof:
I. (բ, A) (G, ) = (H, A × ) where H(ϋ, ς) = բ(ϋ) ∩ G(ς)
1 1 2 2 3 3
= {< f (ϋ) ∩ g (ς), f (ϋ) ∩ g (ς), f (ϋ) ∪ g (ς) >} or
1 1 2 2 3 3
= {< f (ϋ) ∩ g (ς), f (ϋ) ∪ g (ς), f (ϋ) ∪ g (ς) >} .
therefore ((բ, A) (G, )) =
1 1 2 2 3 3 c
= {< f (ϋ) ∩ g (ς), f (ϋ) ∩ g (ς), f (ϋ) ∪ g (ς) >} or
1 1 2 2 3 3 c
= {< f (ϋ) ∩ g (ς), f (ϋ) ∪ g (ς), f (ϋ) ∪ g (ς) >}
1 1 2 2 3 3
= {< f (ϋ) ∪ g (ς), f (ϋ) ∪ g (ς), f (ϋ) ∩ g (ς) >} or
1 1 2 2 3 3
= {< f (ϋ) ∪ g (ς), f (ϋ) ∩ g (ς), f (ϋ) ∩ g (ς) >} = (բ, ) (G, ). Therefore ((բ, A) (G, )) = (բ, A) (G, ).
II. (բ, A) (G, ) = (H, A × )
where H(ϋ, ς) = բ(ϋ) ∪ G(ς)
1 1 2 2 3 3
= {< f (ϋ) ∪ g (ς), f (ϋ) ∪ g (ς), f (ϋ) ∩ g (ς) >} or
1 1 2 2 3 3
={< f (ϋ) ∪ g (ς), f (ϋ) ∩ g (ς), f (ϋ) ∩ g (ς) >}.
therefore ((բ, ) (G, )) =
1 1 2 2 3 3 c
= {< f (ϋ) ∪ g (ς), f (ϋ) ∪ g (ς), f (ϋ) ∩ g (ς) >} or 1 1 2 2 3 3 c
= {< f (ϋ) ∪ g (ς), f (ϋ) ∩ g (ς), f (ϋ) ∩ g (ς) >} .
1 1 2 2 3 3
= {< f (ϋ) ∩ g (ς), f (ϋ) ∩ g (ς), f (ϋ) ∪ g (ς) >} or
1 1 2 2 3 3
= {< f (ϋ) ∩ g (ς), f (ϋ) ∪ g (ς), f (ϋ) ∪ g (ς) >}.
= (բ, A) (G, ). Therefore ((բ, A) (G, )) = (բ, A) (G, ).
3.1 Application of Neutrosophic Crisp Soft Sets in Decisions-Making
The following examples highlight the practical role of “NCSSs” in decision-making processes. A notable application is in the field of “home marketing”, where these sets assist in evaluating and selecting optimal marketing strategies based on uncertain or multi-parameter data.
Example 5. Let U = {և1, և2, և3, և4, և5, և6} be set consists of several houses, let the set Ё = {ⴚ , ⴚ , ⴚ , ⴚ , ⴚ , ⴚ , ⴚ } give specifications to this houses (Ё is the set of parameters);
1 2 3 4 5 6 7
ⴚ means the “expensive”.
ⴚ means “beautiful”.
ⴚ means “wooden”.
ⴚ means “cheap”.
ⴚ means in “the green surroundings”.
ⴚ means “modern”.
ⴚ means “in good repair”.
The “soft set” (F, Ё) describes the represents the appeal of various houses that Mr. X is considering for purchase. Where:
H: A →( ℘(U), ℘(U), ℘(U)) H(ⴚ ) = {< ∅, ∅, ∅ >}, H(ⴚ ) = H(ⴚ ) = {< U, ∅, ∅ >}, H(ⴚ ) = {< {և1, և2, և6}, ∅, ∅ >}, H(ⴚ ) = {< {և1, և2, և3, և4, և6}, ∅, ∅ >}, H(ⴚ ) = {< {և1, և2, և6}, ∅, ∅ >}, H(ⴚ ) = {< {և1, և3, և6}, ∅, ∅ >}.
Let A = {ⴚ , ⴚ , ⴚ , ⴚ , ⴚ } be the set of descending home by Mr.X.
2 3 4 5 7
We put ևij = 1 when ևi ∈ H(ⴚ ). Otherwise, ևij = 0.
In the following diagram of the NCSS (the first part of this set), which contributes to the introduction of data to the computer, which allows the development of an algorithm to solve the issue and its programming.
ⴚ ⴚ ⴚ ⴚ ⴚ
և1 1 1 1 1 1 5 և2 1 1 1 1 0 4 և3 1 1 0 1 1 4 և4 1 0 1 1 0 3 և5 1 0 1 0 0 2 և6 1 1 1 1 1 5 For every house ևi , we give vi = ∑j ևij, then vk = mak (vi ) indicates the optimal option (choice) for the issue raised. In the previous example, Mr. X can choose և1 or և6. in this example, there is no need for diagram of the second and third part of this set, because it is empty. Remark 1. The previous “Example 5” can be regarded as representing a soft set in the classical sense because, in this case, it aligns with the classical definition; ჩ (ⴚ ) = ჩ (ⴚ ) = ∅; for all j = 1, 2, 3, 4, 5, 6, 7.
However, “Example 5” also highlights that a “NCSS” serves as a generalization of the classical soft set. In other words, the classical soft set can be viewed as a specific case of the NCSS. In “Example 5”, the focus was narrowed to a single aspect of interest for a merchant seeking to purchase a house. This explains why only one parameter was considered. where ჩ (ⴚ ) = ჩ (ⴚ ) = ∅; for all j = 1, 2, 3, 4, 5, 6, 7.
However, we could expand the analysis to incorporate all aspects relevant to the merchant’s decision-making process, such as the property’s description, location within the city, area, price, and other factors. From these, we could prioritize the three most significant aspects, as will be elaborated in the next example.
Example 6. Let U = {և1, և2, և3, և4, և5, և6} be the set consists of several houses, and let the set Ё = {ⴚ , ⴚ , ⴚ , ⴚ , ⴚ , ⴚ , ⴚ } give specifications to this houses (Ё is the set of parameters);
1 2 3 4 5 6 7
ⴚ means the “expensive”.
ⴚ means “beautiful”.
ⴚ means “wooden”.
ⴚ means “cheap”.
ⴚ means in “the green surroundings”.
ⴚ means “modern”.
ⴚ means “in good repair”.
(F, Ё) describes the represents the appeal of various houses, which Mr. X (say) is going to buy. Where: H: A →( ℘(U), ℘(U), ℘(U)); H(ⴚ ) = {< U, {և1, և2, և6}, ∅ >}
H(ⴚ ) = H(ⴚ ) = {< {և2, և4, և6}, { և2, և6}, {և1, և6} >},
H(ⴚ ) = {< {և3, և4, և6}, {և1, և2}, {և1, և4} >}, H(ⴚ ) = {< {և3, և4, և5}, {և1, և2, և6}, {և1, և2, և6} >} H(ⴚ ) = {< {և1, և2, և3, և4, և5}, ∅, {և4} >} H(ⴚ ) = {< {և2, և3, և4}, {և1, և6}, { և5, և6} >} Let A = {ⴚ , ⴚ , ⴚ , ⴚ , ⴚ } be the set of descending home by Mr.X.
2 3 4 5 7
We put ևij = 1 or 2 or 3 if ևi belong to one or two or three subset of {ჩ (ⴚ ) , ჩ (ⴚ ) , ჩ (ⴚ )}. Otherwise,
j j j
ևij = 0.
In the following diagram of the NCSS (the first, second, third part of this set), which contributes to the introduction of data to the computer, which allows the development of an algorithm to solve the issue and its programming.
ⴚ ⴚ ⴚ ⴚ ⴚ և 1 2 1 2 1 7 և 2 1 2 2 1 8 և 0 1 0 1 1 3 և 1 2 1 1 1 7 և 0 0 0 1 1 2 և 3 1 3 2 2 11
For every house ևi , we give vi = ∑j ևij, then vk = mak (vi) indicates the optimal option (choice) for the issue raised. In the previous example, Mr. X can choose և6.
4. Neutrosophic Crisp Soft Point
In this part we introduced the concept of NCSPs.
Definition 15. Let x belong to χ, A special type of NCSS, such as (F, A={x}) is called a “NCSP” related to x type i (NCSP(i)) over χ, where F: {x}→(℘(χ), ℘(χ), ℘(χ)) is a mapping, where (F, {x}) =
1 2 3 i j
{ < f (e), f (e), f (e) >: e ∈ A} < ℘(χ), ℘(χ), ℘(χ) > ; f (x) ≠ ∅ and f (e) = ∅, if i ≠ j; i, j =1, 2, 3.
Example 7. Let A = {ⴚ }E, and B = {ⴚ }E.
(F, A) and (G, B) is two “NCSPs” over U = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6} type 1; բ(ⴚ ) = {< {ჩ1}, ∅, ∅ >}, G(ⴚ ) = {< {ჩ2}, ∅, ∅ >}, (H, A) is “NCSPs” over U = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6} type 2; H(ⴚ ) = {< ∅, {ჩ1}, ∅ >}, (T, A) is “NCSPs” over U = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6} type 3; t (ⴚ ) = ∅, t (ⴚ ) = ∅, t (ⴚ ) = {ჩ1} .
Definition 16. Let (F, A) be a NCSS over U and (G, {ϋ}) be a NCSP type i over U. We say that (G, {ϋ}) ∈
i i i i i
(F, A) whenever ϋ ∈ A and g (ϋ)f (ϋ). Note that (G, {ϋ}) (F, A) if ϋA or g (ϋ)f (ϋ); i =1, 2, 3.
Example 8. Let A = {ⴚ , ⴚ , ⴚ , ⴚ }E, and B = {ⴚ , ⴚ , ⴚ , ⴚ }E.
1 3 4 5 1 2 3 5
If (բ, A) and (G, ) be two “NCSSs” over U = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6};
բ(ⴚ ) = {< {ჩ2, ჩ3, ჩ6}, {ჩ3, ჩ4}, {ჩ1, ჩ3} >,
G(ⴚ ) = {< { ჩ2, ჩ3, ჩ4}, {ჩ2, ჩ3, ჩ5}, {ჩ2} >, G(ⴚ ) = {< {ჩ4, ჩ6}, { ჩ5, ჩ6}, {ჩ3} >, G(ⴚ ) = {< { ჩ2, ჩ3}, { ჩ2, ჩ3}, { ჩ2, ჩ3} >, G(ⴚ ) = {< {ჩ1, ჩ3}, {ჩ1, ჩ2}, { ჩ2, ჩ3} >.
Let A1 = {ⴚ }E, and A2 = {ⴚ }E.
(բ1, A1) and (բ2, A2) is two NCSPs over the same universe U type 1; բ(ⴚ ) = {< {ჩ1}, ∅, ∅ >}, G(ⴚ ) = {< {ჩ2}, ∅, ∅ >},
1 1 1 1
(բ1, A1) ∈ (բ, A), (բ1, A1) (G, ), (բ2, A2) (բ, A), (բ2, A2) (G, ) (բ3, A1) is NCSP over the same universe U type 2; բ3(ⴚ ) = {< ∅, {ჩ1}, ∅ >}, (բ3, A1) ∈ (F, A), (բ3, A1) (G, B) (T, A1) is NCSP over the same universe U type 3; t (ⴚ ) = ∅, t (ⴚ ) = ∅, t (ⴚ ) = {ჩ1} .
(T, A1) (բ, A), (T, A1) (G, )
5. Separation Axioms in a “Neutrosophic. Crisp Soft Topological Space”
Here, we will define the concept “neutrosophic crisp STS” and studied some concepts connected to this new space, and finally, we studied separation axioms in this space.
Definition 17. A Neutrosophic Crisp Soft Topology (NCST) on a set χ∅ is a family of “neutrosophic crisp soft subsets” in χ satisfying the following conditions:
I. ∅ ̌ , ̌ ∈ II. If ,B belong to then AB .
III. The union of any number of sets in belongs to .
Then (χ, )is said to be a “NCSTS”.
Definition 18. If (χ, ) is a (NCSTS) in χ, The elements in are said to be “Neutrosophic Crisp Soft Open Sets” (NCSOS), a “NCSS” F is closed NCSCS if F (its complement ) is an NCSOS.
Example 9. Let A = {ⴚ , ⴚ }E, and B = {ⴚ , ⴚ }E.
1 3 1 2
Let (բ, A) and (G, ) be two NCSS over χ = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6};
բ(ⴚ ) = {< {ჩ2, ჩ3, ჩ6}, {ჩ3, ჩ4}, {ჩ1, ჩ3} >, G(ⴚ ) = {< { ჩ2, ჩ3, ჩ4}, {ჩ2, ჩ3, ჩ5}, {ჩ2} >, G(ⴚ ) = {< {ჩ1, ჩ3}, {ჩ1, ჩ2}, { ჩ2, ჩ3} >.
(բ, A) ∪ (G, ) = (H, C), where C = AU , and H: A → (℘(χ), ℘(χ), ℘(χ)) and for all ⴚ ∈ C, H(ⴚ ) = բ(ⴚ ) ∪ G(ⴚ ) = {< {ჩ1, ჩ2, ჩ3, ჩ4}, {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5}, { ჩ2} >, H(ⴚ ) = բ(ⴚ ) = {< {ჩ2, ჩ3, ჩ6}, {ჩ3, ჩ4}, {ჩ1, ჩ3} >, H(ⴚ ) = G(ⴚ ) = {< {ჩ1, ჩ3}, {ჩ1, ჩ2}, { ჩ2, ჩ3} >.
(բ, A) ∩ (G, ) = (H, C) where C = A , and K: AB→ (℘(χ), ℘(χ), ℘(χ)) and for all ⴚ ∈ C, K(ⴚ ) = {< {ჩ3}, ∅, { ჩ2, ჩ4} >, = {∅N , χN, (A, բ), ( , G), (A ∩ , K), (A ∪ , H)} Then (χ, ) is a NCSTS.
Example 10. Let A = {ⴚ , ⴚ , ⴚ , ⴚ }E, and = {ⴚ , ⴚ , ⴚ , ⴚ }E.
1 3 4 5 1 2 3 5
Let (F, A) and (G, ) be two NCSS over χ = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6} such that
բ(ⴚ ) = {< {ჩ2, ჩ3, ჩ6}, {ჩ3, ჩ4}, {ჩ1, ჩ3} >,
G(ⴚ ) = {< { ჩ2, ჩ3, ჩ4}, {ჩ2, ჩ3, ჩ5}, {ჩ2} >, G(ⴚ ) = {< {ჩ4, ჩ6}, { ჩ5, ჩ6}, {ჩ3} >, G(ⴚ ) = {< { ჩ2, ჩ3}, { ჩ2, ჩ3}, { ჩ2, ჩ3} >,
G(ⴚ ) = {< {ჩ1, ჩ3}, {ჩ1, ჩ2}, { ჩ2, ჩ3} >.
(բ, A) ∪ (G, ) = (H, C) where C = AU , and H: A → (℘(χ), ℘(χ), ℘(χ)) and for all ⴚ ∈ C, H(ⴚ ) = {< {ჩ1, ჩ2, ჩ3, ჩ4}, {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5}, { ჩ2} >, H(ⴚ ) = {< {ჩ6}, ∅, { ჩ5, ჩ6} >, H(ⴚ ) = բ(ⴚ ) = {< {ჩ1, ჩ3}, {ჩ1, ჩ4}, {ჩ2, ჩ3} >, բ(ⴚ ) = {< {ჩ2, ჩ3}, {ჩ2, ჩ3, ჩ4}, {ჩ3} >, (բ, A) ∩ (G, ) = (H, C) where C = A , and K: A → (℘(χ), ℘(χ), ℘(χ)) and for all ⴚ ∈ C, K(ⴚ ) = {< {ჩ3}, ∅, { ჩ2, ჩ4} >, K(ⴚ ) = {< { ჩ6}, ∅, {ჩ1, ჩ3} >, K(ⴚ ) = {< {ჩ2, ჩ3}, {ჩ2}, {ჩ3} >.
= {∅N , χN, (A, բ), ( , G), (A ∩ , K), (A ∪ , H)} Then (χ, ) is a “NCSTS”.
Definition 19. If (χ, ) be an NCSTS. (G, {x}) is a NCSP(i), and (H, B) ∈ is a NCSOS, (H, B) is defined to be neutrosophic crisp soft open nhd of (G, {x}) in (χ, ) if (G, {x}) ∈ (H, B) Definition 20. Let (χ, ) be an NCSTS. (G, {x}) is NCSP(i), and (H, B) is a NCSS, (H, B) is defined to be neutrosophic crisp soft nhd of (G, {x}) in (χ, ) if there is a NCSOS (F, A) containing (G, {x}) such that (F, A) ⊆ (H, B).
Remark 2. Every neutrosophic crisp soft open nhd of (G, {x}) is be neutrosophic crisp soft nhd of (G, {x}) , but the opposite is not true (in general).
Now, we study “Separation axioms” in a NCSTS.
Definition 21. A NCSTS (χ, ) is called I. N1S- o-space if for all (G, {x}) (H, {y}) χ ∃ a NCSOS (F, Ŋ) in χ such that (G, {x}) ∈ (F, Ŋ) , (H, {y}) (F, Ŋ) or (G, {x}) (F, Ŋ) , (H, {y}) ∈ (F, Ŋ).
II. N2S- o-space if for all (G, {x}) (H, {y}) χ ∃ a NCSOS (F, Ŋ) in χ such that (G, {x}) ∈ (F, Ŋ) , (H, {y}) (F, Ŋ) or (G, {x}) (F, Ŋ) , (H, {y}) ∈ (F, Ŋ).
III. N3S- o-space if for all (G, {x}) (H, {y}) χ ∃ a NCSOS (F, Ŋ) in χ such that (G, {x}) ∈ (F, Ŋ) , (H, {y}) (F, Ŋ) or (G, {x}) (F, Ŋ) , (H, {y}) ∈ (F, Ŋ).
IV. N1S- 1-space if for all (G, {x}) (H, {y}) χ ∃ a two NCSOS (F1, Ŋ1), (F1, Ŋ1) in χ such that (G, {x}) ∈ (F1, Ŋ1) , (H, {y}) (F2, Ŋ2) and (G, {x}) (F1, Ŋ1) , (H, {y}) ∈ (F2, Ŋ2).
V. N2S- 1-space if for all (G, {x}) (H, {y}) χ ∃ a two NCSOS (F1, Ŋ1), (F1, Ŋ1) in χ such that (G, {x}) ∈ (F1, Ŋ1) , (H, {y}) (F2, Ŋ2) and (G, {x}) (F1, Ŋ1) , (H, {y}) ∈ (F2, Ŋ2).
VI. N3S- 1-space if for all (G, {x}) (H, {y}) χ ∃ a two NCSOS (F1, Ŋ1), (F1, Ŋ1) in χ such that (G, {x}) ∈ (F1, Ŋ1) , (H, {y}) (F2, Ŋ2) and (G, {x}) (F1, Ŋ1) , (H, {y}) ∈ (F2, Ŋ2).
VII. N1S- 2-space if for all (G, {x}) (H, {y}) χ ∃ a two NCSOS (F1, Ŋ1), (F1, Ŋ1) in χ such that (G, {x}) ∈ (F1, Ŋ1) and (H, {y}) ∈ (F2, Ŋ2) with (F1, Ŋ1) ∩ (F1, Ŋ1) = ∅N.
VIII. N2S- 2-space if for all (G, {x}) (H, {y}) χ ∃ a two NCSOS (F1, Ŋ1), (F1, Ŋ1) in χ such that (G, {x}) ∈ (F1, Ŋ1) and (H, {y}) ∈ (F2, Ŋ2) with (F1, Ŋ1) ∩ (F1, Ŋ1) = ∅N.
IX. N3S- 2-space if for all (G, {x}) (H, {y}) χ ∃ a two NCSOS (F1, Ŋ1), (F1, Ŋ1) in χ such that (G, {x}) ∈ (F1, Ŋ1) and (H, {y}) ∈ (F2, Ŋ2) with (F1, Ŋ1) ∩ (F1, Ŋ1) = ∅N.
Example 11. Let Ŋ = {ⴚ , ⴚ }E, and B = {ⴚ , ⴚ }E.
1 3 1 2
Let (F, Ŋ) and (G, B) be two NCSS over the same universe χ = {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5, ჩ6} such that
բ(ⴚ ) = {< {ჩ2, ჩ3, ჩ6}, {ჩ3, ჩ4}, {ჩ1, ჩ3} >, G(ⴚ ) = {< { ჩ2, ჩ3, ჩ4}, {ჩ2, ჩ3, ჩ5}, {ჩ2} >, G(ⴚ ) = {< {ჩ1, ჩ3}, {ჩ1, ჩ2}, { ჩ2, ჩ3} >.
(բ, Ŋ) ∪ (G, B) = (H, C) where C = ŊU B, and H: ŊB→ (℘(χ), ℘(χ), ℘(χ)) and for all ⴚ ∈ C, H(ⴚ ) = բ(ⴚ ) ∪ G(ⴚ ) = {< {ჩ1, ჩ2, ჩ3, ჩ4}, {ჩ1, ჩ2, ჩ3, ჩ4, ჩ5}, { ჩ2} >, H(ⴚ ) = բ(ⴚ ) = {< {ჩ2, ჩ3, ჩ6}, {ჩ3, ჩ4}, {ჩ1, ჩ3} >, H(ⴚ ) = G(ⴚ ) = {< {ჩ1, ჩ3}, {ჩ1, ჩ2}, { ჩ2, ჩ3} >.
(բ, Ŋ) ∩ (G, B) = (H, C) where C = Ŋ B, and K: ŊB→ (℘(χ), ℘(χ), ℘(χ)) and for all ⴚ ∈ C, K(ⴚ ) = {< {ჩ3}, ∅, { ჩ2, ჩ4} >, = {∅N , χN, (Ŋ, բ), ( , G), (Ŋ ∩ , K), (Ŋ ∪ , H)} Then (χ, ) is a NCSTS.
Then (χ, ) is not N1S- o-space, because for (K, {ⴚ }) (H, {ⴚ }) χ Where K(ⴚ ) = {< {ჩ5}, ∅, ∅ >, H(ⴚ ) = {< {ჩ5}, ∅, ∅ >, there are no a NCSOS (K, O) in χ containing one of them but not the other. So, (χ, ) is not N1S- i-space, i=1, 2.
Then (χ, ) is not N2S- o-space, because for (K, {ⴚ }) (H, {ⴚ }) χ Where K(ⴚ ) = {< ∅, {ჩ6}, ∅ >, H(ⴚ ) = {< ∅, {ჩ6}, ∅ >, there are no a NCSOS (K, O) in χ containing one of them but not the other. So, (χ, ) is not N2S- i-space, i=1, 2.
Then (χ, ) is not N3S- o-space, because for (K, {ⴚ }) (H, {ⴚ }) χ Where K(ⴚ ) = {< ∅, ∅, {ჩ5} >, H(ⴚ ) = {< ∅, ∅, {ჩ5} >, there are no a NCSOS (K, O) in χ containing one of them but not the other. So, (χ, ) is not N3S- i-space, i=1, 2.
Example 12. Let A = {ⴚ , ⴚ }E = {ⴚ , ⴚ }.
1 2 1 2
Let (F, Ŋ) be a NCSS on universe χ = {ჩ1, ჩ2, ჩ3} such that բ(ⴚ ) = {< {ჩ1, ჩ2}, {ჩ2, ჩ3}, {ჩ3} >, J = {∅N , χN, (Ŋ, բ)} Then (χ, ) is a NCSTS I. Then (χ, ) is N1- o-space, but (χ, ) is not N1- i-space, i=1, 2.
II. Then (χ, ) is N2- o-space, but (χ, ) is not N2- i-space, i=1, 2.
III. Then (χ, ) is N3- o-space, but (χ, ) is not N3- i-space, i=1, 2.
Remark 3. For a NCSTS (χ, ) I. Every NiS- 1-space is NiS- o-space, i =1, 2, 3.
II. Every NiS- 2-space is NiS- 1-space, i=1, 2, 3.
Proof: the proof follows directly from defintions.
The converse. of Remark 3 does not hold, as demonstrated. in the Example 13.:
Example 13. In Example 12.
I. Then (χ, ) is N1S- o-space, (χ, ) is not N1S- i-space, i=1, 2.
II. Also, (χ, ) is N2S- o-space, (χ, ) is not N2S- i-space, i=1, 2.
III. Also, (χ, ) is N3S- o-space, (χ, ) is not N3S- i-space, i=1, 2.
6. Conclusion
This study has successfully established a ground-breaking connection between “NCSs” and “soft sets”, introducing innovative mathematical tools and concepts that enhance our understanding of these theories. Through the definition of “NCSTSs”, “NCSSs”, “NCSPs”, and “neutrosophic crisp soft separation axioms”, we have developed a cohesive framework that bridges these areas of neutrosophic crisp soft theory. This framework paves the way for novel interdisciplinary research opportunities across various scientific domains.
Consent for Publication
Consent for publication has been obtained from the author.
Ethics Approval and Consent to Participate
This article does not include experiments involving humans or animals.
Funding
This research was conducted without any financial support.
Data Availability
The data are available from the corresponding author upon reasonable request.
Conflict of Interest
The authors declare no conflicts of interest concerning the research, authorship, or publication of this article.
References
- [1] Molodtsov, D. (1999). Soft set theory—First results. Computers & mathematics with applications, 37(4), 19–31. https://doi.org/10.1016/S0898-1221(99)00056-5
- [2] Shabir, M., & Naz, M. (2011). On soft topological spaces. Computers & mathematics with applications, 61(7), 1786–1799. https://doi.org/10.1016/j.camwa.2011.02.006
- [3] Chang, C. L. (1968). Fuzzy topological spaces. Journal of mathematical analysis and applications, 24(1), 182–
- [190] https://doi.org/10.1016/0022-247X(68)90057-7
- [4] Li, Z., & Cui, R. (2013). On the topological structure of intuitionistic fuzzy soft sets. Annals of fuzzy mathematics and informatics, 5(1), 229–239.
- [5] Çoker, D. (1997). An introduction to intuitionistic fuzzy topological spaces. Fuzzy sets and systems, 88(1), 81–89. https://doi.org/10.1016/S0165-0114(96)00076-0
- [6] Osmanoglu, I., & Tokat, D. (2013). On intuitionistic fuzzy soft topology. General mathematics notes, 19(2), 59–70. https://scispace.com/pdf/on-intuitionistic-fuzzy-soft-topology-2lx3w3vnvj.pdf
- [7] Tanay, B., & Kandemir, M. B. (2011). Topological structure of fuzzy soft sets. Computers & mathematics with applications, 61(10), 2952–2957. https://doi.org/10.1016/j.camwa.2011.03.056
- [8] Neog, T., & Sut, D. K. (2012). Hazarika, Fuzzy soft topological spaces. International journal of latest trends in mathematics, 2(1), 87–96. https://www.researchgate.net/publication/267800160
- [9] Varol, B. P., & Aygün, H. (2012). Fuzzy soft topology. Hacettepe journal of mathematics and statistics, 41(3), 407–419. https://dergipark.org.tr/en/pub/hujms/article/101354
- [10] Gunduz, C., & Bayramov, S. (2013). Some results on fuzzy soft topological spaces. Mathematical problems in engineering, 2013(1), 835308. https://doi.org/10.1155/2013/835308
- [11] Bayramov, S., & Gunduz, C. (2014). On intuitionistic fuzzy soft topological spaces. TWMS journal of pure and applied mathematics, 5(1), 66–79. https://www.twmsj.az/Files/Contents V.5, N.1, 2014/pp.66-79.pdf
- [12] Turanlı, N., & Es, A. H. (2012). A note on compactness in intuitionistic fuzzy soft topological spaces. World applied sciences journals, 9(9), 1355–1359. https://doi.org/10.5829/idosi.wasj.2012.19.09.11112
- [13] Maji, P. K. (2013). Neutrosophic soft set. Annals of fuzzy mathematics and informatics, 5(1), 157-168. chrome-extension://efaidnbmnnnibpcajpcglclefindmkaj/https://fs.unm.edu/Maji-NeutrosophicSoftSet.pdf
- [14] Arockiarani, I., & Jency, J. M. (2014). More on fuzzy neutrosophic sets and fuzzy neutrosophic topological spaces. International journal of innovative research and studies, 3(5), 643–652. https://fs.unm.edu/SN/Neutro-MoreFuzzyNeutroSets.pdf
- [15] Arockiarani, I., Sumathi, I. R., & Jency, J. M. (2013). Fuzzy neutrosophic soft topological spaces. International journal of mathematical archive, 4(10), 225–238. https://www.academia.edu/64305651/Fuzzy_Neutrosophic_Soft_Topological_Spaces
- [16] Bera, T., & Mahapatra, N. K. (2016). On neutrosophic soft function. Annals of fuzzy mathematics and informatics, 12(1), 101–119. https://fs.unm.edu/OnNeutrosophicSoftFunction.pdf
- [17] Deli, I. (2015). npn-Soft sets theory and their applications. Ann fuzzy math inform, 10(6), 847–862. https://doi.org/10.5281/zenodo.23080
- [18] Deli, I. (2017). Interval-valued neutrosophic soft sets and its decision making. International journal of machine learning and cybernetics, 8(2), 665–676. https://doi.org/10.1007/s13042-015-0461-3
- [19] Deli, I., & Broumi, S. (2015). Neutrosophic soft relations and some properties. Annals of fuzzy mathematics and informatics, 9(1), 169–182. https://www.researchgate.net/profile/Irfan-Deli/publication/308790060
- [20] Maji, P. K. (2015). An application of weighted neutrosophic soft sets in a decision-making problem. In Facets of uncertainties and applications: Icfua, Kolkata, India, December 2013 (pp. 215–223). Springer. https://doi.org/10.1007/978-81-322-2301-6#page=217
- [21] Broumi, S., & Smarandache, F. (2013). Intuitionistic neutrosophic soft set. Journal of information and computing science, 8(2), 130–140. https://www.researchgate.net/publication/333559318
- [22] Salama, A. A., & Alblowi, S. A. (2012). Neutrosophic set and neutrosophic topological spaces. IOSR Journal of mathematics, 3(4), 31-35. https://doi.org/10.9790/5728-0343135
- [23] Saroja, R., & Kalaichelvi, A. (2015). Intuitionistic fuzzy neutrosophic soft topological spaces. International journal of innovative research in science, engineering and technology, 4(5), 3338–3345.
- [24] Said, B. (2013). Generalized neutrosophic soft set. International journal of computer science, engineering and information technology, 3(2), 17-30. https://doi.org/10.5121/ijcseit.2013.3202
- [25] Sahin, M., Alkhazaleh, S., & Ulucay, V. (2015). Neutrosophic soft expert sets. Applied mathematics, 6(1), 116-127. http://dx.doi.org/10.4236/am.2015.61012
- [26] Deli, I., & Said, B. (2014). Neutrosophic soft matrices and NSM-decision making. Journal of intelligent & fuzzy systems, 28(5), 2233–2241. https://doi.org/10.3233/IFS-141505
- [27] Bera, T., & Mahapatra, N. K. (2016). (α, β, γ)-cut of neutrosophic soft set and it’s application to neutrosophic soft groups. Asian journal of mathematics and computer research, 12(3), 160–178. https://www.researchgate.net/publication/326423283
- [28] Bera, T., & Mahapatra, N. K. (2017). On neutrosophic normal soft groups. International journal of applied and computational mathematics, 3(4), 3047–3066. https://doi.org/10.1007/s40819-016-0284-2
- [29] Bera, T., & Mahapatra, N. K. (2017). Introduction to neutrosophic soft topological space. Opsearch, 54(4), 841–867. https://doi.org/10.1007/s12597-017-0308-7
- [30] Bera, T., & Mahapatra, N. K. (2017). On neutrosophic soft rings. Opsearch, 54(1), 143–167. https://doi.org/10.1007/s12597-016-0273-6
- [31] Bera, T., & Mahapatra, N. K. (2017). On neutrosophic soft linear spaces. Fuzzy information and engineering, 9(3), 299–324. https://doi.org/10.1016/j.fiae.2017.09.004
- [32] Bera, T., & Mahapatra, N. K. (2018). On neutrosophic soft metric space. International journal of advances in mathematics, 2018(1), 180-200. https://scispace.com/pdf/on-neutrosophic-soft-metric-space-54j59yo781.pdf
- [33] Smarandache, F. (1998). Neutrosophy: Neutrosophic probability, set, and logic: Analytic synthesis & synthetic analysis. American Research Press. https://philpapers.org/rec/SMANNP
- [34] Smarandache, F. (2006). Neutrosophic set - A generalization of the intuitionistic fuzzy set. 2006 IEEE international conference on granular computing (pp. 38–42). IEEE. https://doi.org/10.1109/GRC.2006.1635754
- [35] Salama, A. A., Smarandache, F., & Kroumov, V. (2014). Neutrosophic crisp sets & neutrosophic crisp topological spaces. Neutrosophic sets and systems, 5, 49-58. https://doi.org/10.5281/zenodo.30216
- [36] Salama, A. A. (2015). Basic structure of some classes of neutrosophic crisp nearly open sets and possible application to GIS topology. Neutrosophic sets and systems, 7, 18–22. https://digitalrepository.unm.edu/nss_journal/vol7/iss1/4/
- [37] Salama, A. (2013). Neutrosophic crisp points and neutrosophic crisp ideals. Neutrosophic sets and systems, 1(1), 49–53. https://digitalrepository.unm.edu/nss_journal/vol1/iss1/9/
- [38] Salama, A. A., & Smarandache, F. (2013). Filters via neutrosophic crisp sets