Professional Documents
Culture Documents
An Introduction To Single-Valued Neutrosophic Primal Theory
An Introduction To Single-Valued Neutrosophic Primal Theory
An Introduction To Single-Valued Neutrosophic Primal Theory
Article
An Introduction to Single-Valued Neutrosophic Primal Theory
Fahad Alsharari 1,† , Hanan Alohali 2,† , Yaser Saber 3, *,† and Florentin Smarandache 4,†
1 Department of Mathematics, College of Science, Jouf University, Sakaka 72311, Saudi Arabia;
f.alsharari@ju.edu.sa
2 Department of Mathematics, College of Science, King Saud University, P.O. Box 2455,
Riyadh 11451, Saudi Arabia; halohali@ksu.edu.sa
3 Department of Mathematics, College of Science Al-Zulfi, Majmaah University, P.O. Box 66,
Al-Majmaah 11952, Saudi Arabia
4 Department of Mathematics, University of New Mexico, Gallup, NM 87301, USA; smarand@unm.edu
* Correspondence: y.sber@mu.edu.sa
† These authors contributed equally to this work.
Abstract: This article explores the interconnections among the single-valued neutrosophic grill, single-
valued neutrosophic primal and their stratification, uncovering their fundamental characteristics
and correlated findings. By introducing the notion of a single-valued neutrosophic primal, a broader
framework including the fuzzy primal and intuitionistic fuzzy primal is established. Additionally,
the concept of a single-valued neutrosophic open local function for a single-valued neutrosophic
topological space is presented. We introduce an operator based on a single-valued neutrosophic
primal, illustrating that the single-valued neutrosophic primal topology is finer than the single-valued
neutrosophic topology. Lastly, the concept of single-valued neutrosophic open compatibility between
the single-valued neutrosophic primal and single-valued neutrosophic topologies is introduced,
along with the establishment of several equivalent conditions related to this notion.
the first time, contained the NsN weight values, NsN input and output, and hidden layer
neutrosophic neuron functions; to approximate neutrosophic functions, NsN data have
been studied by Ye et al. [29]. Shao et al. [30] introduced the concept of the probabilis-
tic single-valued (interval) neutrosophic hesitant fuzzy set, extensively investigating the
operational relations of PINHFS and the comparison method of probabilistic interval neu-
trosophic hesitant fuzzy numbers (PINHFNs). Rıdvan et al. [31] examined the notion of the
neutrosophic subsethood measure for single-valued neutrosophic sets. The neutrosophic
fuzzy set and its application in decision-making was defined by Das et al. [32].
The objective of this paper is to explore the inter-relations between the single-valued
neutrosophic grill (svn-grill) and single-valued neutrosophic primal (svn-primal), along with
their stratification, while showcasing some of their inherent properties. Additionally, we
investigate the quantum behaviors within a novel structure denoted as Ξr⋆ (T τπσ , P τπσ ),
as defined in Definition 11. Furthermore, we introduce and analyze both the svn primal and
its associated topology. We also derive several preservation properties and characterizations
regarding svn-primal open compatibility.
2. Preliminaries
This section presents the fundamental definitions and results necessary for our study.
Initially, we define a neutrosophic set (for short, n-set) and a single-valued neutrosophic set
(for short, svn-set). For a more comprehensive understanding of n-set theory and svn-set the-
ory, readers are directed to [18,20,33]. Conventionally, ξ £ denotes the family encompassing
all svn-sets, defined on £. Here, ξ = [0, 1], ξ 0 = (0, 1] and for any α ∈ ξ and z ∈ £, α(z) = α.
representing the degree of membership where (τΞ (z)), the degree of indeterminacy (πΞ (z)) and degree
of nonmembership (σΞ (z)); ∀ z ∈ £ to the set Ξ.
We now discuss the concept of the svn-set, which is a more specific type of neutro-
sophic set.
Definition 2 ([20]). Let £ be a space of points (objects) with a generic element in £ denoted by z.
Then Ξ is called an svn-set in £ if Ξ has the form Ξ = {⟨z, τΞ (z), πΞ (z), σΞ (z)⟩ | x ∈ £} where
τ Ξ , πΞ , σΞ : £ → ξ = [0, 1]. In this case, σΞ , πΞ and τ Ξ are called the falsity membership function,
indeterminancy membership function and truth membership function, respectively.
An svn-set Ξ on £ is named as a null svn-set (for short, 0), if τΞ (z) = 0, πΞ (z) = 1 and
σΞ ( x ) = 1, for all z ∈ £.
An svn-set Ξ on £ is named as an absolute svn-set (for short, 1), if τΞ (z) = 1, πΞ (z) = 0
and σΞ (z) = 0, for all z ∈ £.
Θ is an svn-set of £ defined by
To better understand the properties of svn-sets, we will now discuss the complement
of an svn-set.
τΞc (z) = σΞ (z), πΞc (z) = [πΞ ]c (z), σΞc (z) = τΞ (z).
The following definition provides more insight into the relationships between svn-sets,
introducing the notions of subsets, equality and special sets.
In the context of svn-sets, we introduce definitions related to the intersection and union
of svn-sets. Further, we discuss the concept of a single-valued neutrosophic topological
space (svnts) and the properties it entails.
where (τΞ ∧ τΘ )(z) = τΞ (z) ∧ τΘ (z), (πΞ ∨ πΘ )(z) = πΞ (z) ∨ πΘ (z) and (σΞ ∨ σΘ )(z) =
σΞ (z) ∨ σΘ (z), ∀ z ∈ £,
(b) Ξ ∨ Θ is an (svn-set), if ∀ z ∈ £,
Now, we discuss the concept of svnts, which consists of a set £ and three mappings
T τ , T π , T σ : ζ £ → ζ that satisfy specific axioms.
(SVNT3) T τ ( j∈ J (Ξ j ) ≥ j∈ J T τ (Ξ j ), T π ( j ∈ J ( Ξ j ) ≤ j ∈ J T π ( Ξ j ),
W V W W
T σ ( j∈ J (Ξ j ) ≤ j∈ J T σ (Ξ j ), for every Ξ j ∈ ξ £ .
W W
For the sake of brevity and clarity, we sometimes denote (T τ , T π , T σ ) as T τπσ with-
out causing any ambiguity.
The following theorem establishes an operator that satisfies specific conditions, which
further clarifies the properties of svnts.
Theorem 1 ([27]). Let (£, T τπσ ) be an svnts. Then, for all r ∈ ξ 0 and Ξ ∈ ξ £ , we define the
operator CT τπσ : ξ £ × ξ 0 → ξ £ as follows:
For any Ξ, Θ ∈ ξ £ and r, s ∈ ξ 0 , the operator CT τπσ satisfies the following conditions:
(C1) CT τπσ (0, r ) = 0.
(C2) Ξ ≤ CT τπσ (Ξ, r ).
(C3) CT τπσ (Ξ, r ) ∨ CT τπσ (Θ, r ) = CT τπσ (Ξ ∨ Θ, r ).
(C4) CT τπσ (Ξ, r ) ≤ CT τπσ (Θ, s) if r ≤ s.
(C5) CT τπσ (CT τπσ (ξ, r ), r ) = CT τπσ (ξ, r ).
Gstπ (Ξ) = G π (Ξl ) ∨ αl ,
_ ^
{(Ξi ,αi )|i ∈ J }∈K(Ξ)(Ξ l
,αl )∈{(Ξ ,α )|i ∈ J }
i i
Gstσ (Ξ) = G σ (Ξl ) ∨ αl ,
_ ^
{(Ξi ,αi )|i ∈ J }∈K(Ξ)(Ξ l
,αl )∈{(Ξ ,α )|i ∈ J }
i i
where K(ξ ) = {(Ξi , αi ) | i ∈ J, J is f inite index set} and Ξ ≤ i∈ J (Ξi ∨ αi ) . Then, (Gstτ ,
V
Proof. First, we will prove that (Gstτ , Gstπ , Gstσ ) is a stratified svn-grill on £.
(G1 ) and (G2 ) are straightforward.
(G3 ) Assume that there exist Ξ, Θ ∈ ξ £ such that
G τ ( Ξ ∨ Θ ) ̸ ≤ G τ ( Ξ ) ∨ G τ ( Θ ), G π (Ξ ∨ Θ) ̸≥ G π (Ξ) ∧ G π (Θ)
Symmetry 2024, 16, 402 5 of 21
G σ ( Ξ ∨ Θ ) ̸ ≥ G σ ( Ξ ) ∧ G σ ( Θ ).
By the definition of (Gstτ , Gstπ , Gstσ ), there exist {(Ξt , αt ) | t ∈ J } ∈ K(Ξ) and {(Θι , ωι ) | ι ∈ Γ} ∈
K(Θ) such that
G τ (Ξ ∨ Θ) ̸≥ G τ (Ξt ) ∨ αt ∨ G τ ( Θ j ) ∨ ω j .
_ _
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J } (Θ j ,ω j )∈{(Θι ,ωι )|ι∈Γ}
G π (Ξ ∨ Θ) ̸≤ G π (Ξt ) ∨ αt ∧ G π ( Θ j ) ∨ ω j .
^ ^
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J } (Θ j ,ω j )∈{(Θι ,ωι )|ι∈Γ}
G σ (Ξ ∨ Θ) ̸≤ G σ (Ξt ) ∨ αt ∧ G σ ( Θ j ) ∨ ω j .
^ ^
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J } (Θ j ,ω j )∈{(Θι ,ωι )|ι∈Γ}
Ξk ∨ αk , if k ∈ J − ( J ∩ Γ),
Πk ∨ ϱk = Θ k ∨ ωk , if k ∈ Γ − ( J ∩ Γ),
(Ξk ∨ αk ) ∨ (Θk ∨ ωk ), if k ∈ ( J ∩ Γ).
Then, we have
Gstτ (Ξ ∨ Θ) ≤ G τ (Πν ) ∨ ϱν
_
G τ ( Ξi ) ∨ αi ∨ G τ ( Θ j ) ∨ ω j .
_ _
=
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J } (Θ j ,ω j )∈{(Θι ,ωι )|ι∈Γ}
Gstπ (Ξ ∨ Θ) ≥ G τ (Πν ) ∨ ϱν
^
G π ( Ξi ) ∨ αi ∧ G π ( Θ j ) ∨ ω j .
^ ^
=
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J } (Θ j ,ω j )∈{(Θι ,ωι )|ι∈Γ}
Gstσ (Ξ ∨ Θ) ≥ G τ (Πν ) ∨ ϱν
^
G σ ( Ξi ) ∨ αi ∧ G σ ( Θ j ) ∨ ω j .
^ ^
=
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J } (Θ j ,ω j )∈{(Θι ,ωι )|ι∈Γ}
Gstτ (Ξ ∨ α) ̸≤ G τ ( Ξi ) ∨ αi ∨ α
_
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
Gstπ (Ξ ∨ α) ̸≥ G π ( Ξi ) ∨ αi ∧ α
^
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
Gstσ (Ξ ∨ α) ̸≥ G σ ( Ξi ) ∨ αi ∧ α
^
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
Gstτ (Ξ ∨ α) ≤ G τ ( Ξi ) ∨ αi = G τ (Ξi ) ∨ αi ∨ α,
_ _
(Ξi ,ϱi )∈{(Ξt ,ϱt )|t∈ J } (Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
Gstπ (Ξ ∨ α) ≥ G π ( Ξi ) ∨ αi = G π (Ξi ) ∨ αi ∧ α,
^ ^
(Ξi ,ϱi )∈{(Ξt ,ϱt )|t∈ J } (Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
Gstσ (Ξ ∨ α) ≥ G σ ( Ξi ) ∨ αi = G σ (Ξi ) ∨ αi ∧ α.
^ ^
(Ξi ,ϱi )∈{(Ξt ,ϱt )|t∈ J } (Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
This is a contradiction. Thus, Gst holds. Hence, (Gstτ , Gstπ , Gstσ ) is stratified.
Second, for any Ξ ∈ ξ £ , there exists a collection {α} with Ξ ≤ Ξ ∨ α such that
Gst (Ξ) ≤ G τ (Ξ), Gstπ (Ξ) ≥ G π (Ξ) and Gstσ (Ξ) ≥ G σ (Ξ). Thus, (Gstτ , Gstπ , Gstσ ) is finer than
τ
(G τ , G π , G σ ).
Finally, consider (G ⋆τ , G ⋆π , G ⋆σ ), a stratified svn-grill on £ which is finer than
(G τ , G π , G σ ). And we will show that Gstτ (Ξ) ≥ G ⋆τ (Ξ), Gstπ (Ξ) ≤ G ⋆π (Ξ) and Gstσ (Ξ) ≤
G ⋆σ (Ξ). Assume that Ξ ∈ ξ £ such that Gstτ (Ξ) ̸≥ G ⋆τ (Ξ), Gstπ (Ξ) ̸≤ G ⋆π (Ξ) and Gstσ (Ξ) ̸≤
G ⋆σ (Ξ). . By the definition of (Gstτ , Gstπ , Gstσ ), there exist {(Ξt , αt ) | t ∈ J } ∈ K(Ξ) such that
G ⋆τ (Ξ ) ̸ ≤ G τ ( Ξi ) ∨ αi ,
_
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
G ⋆π (Ξ ) ̸ ≥ G π ( Ξi ) ∨ αi ,
^
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
G ⋆σ (Ξ ) ̸ ≥ G σ ( Ξi ) ∨ αi .
^
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
G ⋆τ (Ξ ) ≤ G ⋆τ (Ξt ∨ αt )
^
t∈ J
G ⋆τ (Ξt ∨ αt )
_
≤
t∈ J
(G ⋆τ (Ξt ) ∨ αt )
_
≤
t∈ J
G τ ( Ξi ) ∨ αi
_
≤
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
G ⋆π (Ξ ) ≥ G π ( Ξi ) ∨ αi G ⋆σ (Ξ ) ≥ G σ ( Ξi ) ∨ αi .
^ ^
(Ξi ,αi )∈{(Ξt ,αt )|t∈ J } (Ξi ,αi )∈{(Ξt ,αt )|t∈ J }
This is a contradiction. Hence, (Gstτ , Gstπ , Gstσ ) is the coarsest stratified svn-grill on £ which is
finer than (G τ , G π , G σ ).
In order to better understand the notion of svn-primal mappings, let us provide some
context for the following definition. Consider a non-empty set £ and a mapping P τ , P π , P σ :
ζ £ → ζ. We will now introduce certain conditions that, when satisfied, characterize the
mapping as an svn-primal on £.
The triable (£, T τπσ , P τπσ ) is called a single-valued neutrosophic primal topological space
(svnpts). For α ∈ ζ 0 , (£, Tατπσ , Pατπσ ) is primal topological space (pts) in [35].
Remark 1. The terms (P2 ) and (P3 ), in Definition 10, correspond to the next condition
P τ ( Ξ ∧ Θ ) = P τ ( Ξ ) ∨ P τ ( Θ ), P π ( Ξ ∧ Θ ) ̸ = P π ( Ξ ) ∧ P π ( Θ ), P σ (Ξ ∧ Θ) ̸= P σ (Ξ) ∧ P σ (Θ)
1, if Ξ = 0,
4 , if Ξ = Θ,
1
P τ (Ξ) =
2 , if 0 < Ξ < Θ,
1
0, otherwise,
Symmetry 2024, 16, 402 8 of 21
0, if Ξ = 0,
4 , if Ξ = Θ,
3
P π (Ξ) =
2 , if 0 < Ξ < Θ,
1
otherwise,
1,
0, if Ξ = 0,
2 , if Ξ = Θ,
1
P (Ξ) =
σ
1
, if 0 < Ξ < Θ,
4
1, otherwise,
r ≤ G τ ( Θ c ) ≤ G τ ( Ξ c ), 1 − r ≥ G π ( Θ c ) ≥ G π ( Ξ c ), 1 − r ≥ G σ ( Θ c ) ≥ G σ ( Ξ c ).
P τ ( Ξ ∧ Θ ) ̸ ≤ P τ ( Ξ ) ∨ P τ ( Θ ), P π ( Ξ ∧ Θ ) ̸ ≥ P π ( Ξ ) ∧ P π ( Θ ),
P σ ( Ξ ∧ Θ ) ̸ ≥ P σ ( Ξ ) ∧ P σ ( Θ ).
Then, there exists r ∈ ξ 0 such that
P τ ( Ξ ∧ Θ ) ≥ r ≥ P τ ( Ξ ) ∨ P τ ( Θ ), P π ( Ξ ∧ Θ ) ≤ 1 − r ≤ P π ( Ξ ) ∧ P π ( Θ ),
P σ ( Ξ ∧ Θ ) ≤ 1 − r ≤ P σ ( Ξ ) ∧ P σ ( Θ ).
Since P τ (Ξ ∧ Θ) ≥ r, P π (Ξ ∧ Θ) ≤ 1 − r and P σ (Ξ ∧ Θ) ≤ 1 − r, we have G τ ([Ξ ∧ Θ]c ) ≥ r,
P π ([Ξ ∧ Θ]c ) ≤ 1 − r and G σ ([Ξ ∧ Θ]c ) ≤ 1 − r implies that
P σ (Ξ) ∧ P σ (Θ) ≤ 1 − r.
This is a contradiction. Consequently, ( P3 ) holds.
An svn-point yn,m,v is said to belong to an svn-set Ξ = ⟨z, τΞ (z), πΞ (z), σΞ (z)⟩ ∈ ξ £ , denoted by
yn,m,v ∈ Ξ iff n ≤ τΞ (z), m ≥ πΞ (z) and v ≥ σΞ (z). We indicate the set of all svn-points in £ as
(svn-point (£)).
For each yn,m,v ∈ svn-point(£) and Θ ∈ ξ ω we shall write yn,m,v quasi-coincident with Ξ,
denoted by yn,m,v qΞ, if
For all Θ, Ξ ∈ ξ £ we shall write Ξ q θ to mean that Ξ is quasi-coincident with Θ if there exists
z ∈ £ such that
Definition 10. Let (£, T τπσ ) be an svnts, for all Ξ ∈ ξ £ , yn,m,v ∈svn-point (£) and r ∈ ξ 0 . Then,
Ξ is said to be an r-open QT τπσ -neighborhood (r-OQ N) of yn,m,v , defined as follows
Lemma 1. An svn-point yn.m.v ∈ CT τπσ (Θ, r ) iff every r-OQ N of yn,n,v is quasi-coincident with Ξ.
Definition 11. Let (£, T τπσ , P τπσ ) be an svnpts, for each r ∈ ξ 0 and Ξ ∈ ξ £ . Then, the single-
valued neutrosophic primal open local function Ξr⋆ (T τπσ , P τπσ ) of Ξ is the union of all svn-points
yn,m,v such that if Θ ∈ QT τπσ (yn,m,v , r ) and P τ (Π) ≥ r, P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r, then
there is at least one z ∈ £, for which τΞ (z) + τΘ (z) − 1 > τΠ (z), πΞ (z) + πΘ (z) − 1 ≤ πΠ (z),
σΞ (z) + σΘ (z) − 1 ≤ σΠ (z).
In this article, we will write Ξr⋆ for Ξr⋆ (T τπσ , P τπσ ) without any ambiguity.
Example 3. Let (£, T τπσ , P τπσ ) be an svnpts. The simplest svn-primal on £ is P0τ , P0π , P0σ :
ζ £ → ζ where
1, if Ξ = 0,
P0τ (Ξ) =
0, otherwise,
0, if Ξ = 0,
P0 ( Ξ ) =
π
1, otherwise,
Symmetry 2024, 16, 402 10 of 21
0, if Ξ = 0,
P0 ( Ξ ) =
σ
1, otherwise,
Theorem 4. Let (£, T τπσ ) be an svnts and P1τπσ , P2τπσ be two svn-primals on £. Then, ∀
Ξ, Θ ∈ ξ £ and r ∈ ξ 0 , we have
(1) If Ξ ≤ Θ, then Ξr⋆ ≤ Θr⋆ .
(2) If P1τ ≤ P2τ , P1π ≥ P2π and P1σ ≥ P2σ , then Ξr⋆ (P1τπσ , T τπσ ) ≥ Ξr⋆ (P2τπσ , T τπσ ).
(3) Ξr⋆ = CT τπσ (Ξr⋆ , r ) ≤ CT τπσ (Ξ, r ).
(4) If (Ξr⋆ )r⋆ ≤ Ξr⋆ .
(5) If P τ (Θ) ≥ r, P π (Θ) ≤ 1 − r and P σ (Θ) ≤ 1 − r, then (Ξ ∨ Θ)r⋆ = Ξr⋆ ∨ Θr⋆ = Ξr⋆ .
(6) (Ξr⋆ ∨ Θr⋆ ) = (Ξ ∨ Θ)r⋆ .
(7) T τ (Θ) ≥ r, T π (Θ) ≤ 1 − r and T σ (Θ) ≤ 1 − r, then , (Θ ∧ Ξr⋆ ) ≤ (Θ ∧ Ξ)r⋆ .
(8) (Ξr⋆ ∧ Θr⋆ ) ≥ (Ξ ∧ Θ)r⋆ .
Proof. (1) Let Ξ ∈ ξ £ and r ∈ ξ 0 such that Ξr⋆ ̸≤ Θr⋆ . Then, there exists z ∈ £ and n, m, v ∈ ξ 0
such that
τΞ⋆ (z) ≥ n > τΘ⋆ (z), π Ξ ⋆ ( z ) < m ≤ π Θ ⋆ ( z ), σΞ⋆ (z) < v ≤ σΘr⋆ (z). (1)
r r r r r
Since τΘ⋆ (z) < n, πΘ⋆ (z) ≥ m and σΘr⋆ (z) ≥ v, there exists A ∈ QT τπσ (yn,m,v , r ) with
r r
P τ (Π) ≥ r, P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r, such that for every x ∈ £, we have,
Since Ξ ≤ Θ, we have
So, τΞ⋆ (z) < n, πΞ⋆ (z) ≥ m and σΞr⋆ (z) ≥ v, and this is a contradiction for Equation (1).
r r
Hence, Ξr⋆ ≤ Θr⋆ .
(2) Suppose that Ξr⋆ (P1τπσ , T τπσ ) ̸≥ Ξr⋆ (P2τπσ , T τπσ ). Then, there exist z ∈ £ and
n, m, v ∈ ξ 0 such that
πΞ⋆ (P τπσ ,T τπσ ) (z) ≥ m > πΞ⋆ (P τπσ ,T τπσ ) (z), (2)
r 1 r 2
Since τΞ⋆ (P τπσ ,T τπσ ) (z) < n, πΞ⋆ (P τπσ ,T τπσ ) (z) ≥ m and σΞ⋆ (P τπσ ,T τπσ ) (z) ≥ v, there exists
r 1 r 1 r 1
A ∈ QT τπσ (yn,m,v , r ) with P1τ (Π) ≥ r, P1π (Π) ≤ 1 − r, P1σ (Π) ≤ 1 − r, such that for every
x ∈ £, we have
Since, P2τ (Π) ≥ P1τ (Π) ≥ r, P2π (Π) ≤ P1π (Π) ≤ 1 − r, P2σ (Π) ≤ P1σ (Π) ≤ 1 − r, we have
Hence, τΞ⋆ (P τπσ ,T τπσ ) (z) < s, πΞ⋆ (P τπσ ,T τπσ ) (z) ≥ m and σΞ⋆ (P τπσ ,T τπσ ) (z) ≥ v, and this is a
r 2 r 2 r 2
contradiction for Equation (2). Thus, Ξr⋆ (P1τπσ , T τπσ ) ≥ Ξr⋆ (P2τπσ , T τπσ ).
Symmetry 2024, 16, 402 11 of 21
(3) Assume that Ξr⋆ ̸≤ CT τπσ (Ξ, r ); then, there exist z ∈ £ and n, m, v ∈ ξ 0 such that
Since τΞ⋆ (z) ≥ n, πΞ⋆ (z) < m and πΞ⋆ (z) < v, we have yn,m,v ∈ Ξr⋆ . So, there is at least
r r r
one x ∈ £, for each A ∈ QT τπσ (yn,m,v , r ) with P τ (Π) ≥ r, P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r
such that
From Lemma 1, we have yn,m,v ∈ CT τπσ (Ξ, r ). This is a contradiction for Equation (3). Thus,
Ξr⋆ ≤ CT τπσ (Ξ, r ).
We will now prove this relationship Ξr⋆ ≥ CT τπσ (Ξr⋆ , r ). Assume that Ξr⋆ ̸≥ CT τπσ (Ξr⋆ , r );
then, there exist z ∈ £ and n, m, v ∈ ξ 0 such that
Since τC ⋆ ( z ) ≥ n, π C τπσ (Ξ⋆ ,r ) ( z ) < m and σC τπσ (Ξ⋆ ,r ) ( z ) < v, we have y n,m,v ∈
T τπσ (Ξr ,r ) T r T r
CT τπσ (Ξr⋆ , r ). So, there exists at least one x ∈ £ with A ∈ QT τπσ (yn,m,v , r ) such that
Thus, Ξr⋆ ( x ) ̸= 0. Suppose that n1 = τΞ⋆ ( x ), m1 = πΞ⋆ ( x ) and v1 = σΞ⋆ ( x ). Then, xn1 ,m1 ,v1 ∈
r r
Ξr∗ and n1 + τA ( x ) > 1, m1 + πA ≤ 1, v1 + σA ( x ) ≤ 1, so that A ∈ QT τπσ ( xn1 ,m1 ,v1 , r ). Now,
′ ′ ′ ′
xn1 ,m1 ,v1 ∈ Ξr∗ implies there is at least one z ∈ £ such that τB (z ) + τΞ (z ) − 1 > τΠ (z ),
′ ′ ′ ′ ′ ′
πB (z ) + πΞ (z ) − 1 ≤ πΠ (z ), σB (z ) + σΞ (z ) − 1 ≤ σΠ (z ) ∀, P τ (Π) ≥ r, P π (Π) ≤
1 − r, P σ (Π) ≤ 1 − r and B ∈ QT τπσ ( xn1 ,m2 ,v1 , r ). This is also true for A. So, there is at
′′ ′′ ′′ ′ ′′ ′ ′′
least one z ∈ £ such that τA (z ) + τΞ (z ) − 1 > τΠ (z ), πA (z ) + πΞ (z ) − 1 ≤ πΠ (z ),
′′ ′′ ′
σA (z ) + σΞ (z ) − 1 ≤ σΠ (z ; ). Since A is an arbitrary and A ∈ QT τπσ (yn,m,v , r ), then
τΞ⋆ (z) > n, πΞ⋆ (z) ≤ m, σΞ⋆ (z) ≤ v. This contradicts Equation (4). Thus, Ξr⋆ ≥ CT τπσ (Ξr⋆ , r ).
r r r
(4) Using (3) we obtain that (Ξr⋆ )r⋆ = CT τπσ ((Ξr⋆ )r⋆ , r ) ≤ CT τπσ ((Ξr⋆ , r ) ≤ Ξr⋆ .
(5) Straightforward.
(6) (⇒) Since Ξ, Θ ≤ Ξ ∨ Θ. By (1), we have Ξr⋆ ≤ (Ξ ∨ Θ)r⋆ and Θr⋆ ≤ (Ξ ∨ Θ)r⋆ . Thus,
Ξr ∨ Θr⋆ ≤ (Ξ ∨ Θ)r⋆ .
⋆
(⇐) Let Ξr⋆ ∨ Θr⋆ ̸≥ (Ξ ∨ Θ)r⋆ ; then, there exist z ∈ £ and n.m.v ∈ ξ 0 such that
π (Ξ ⋆ ∨Θ ⋆ ) ( z ) ≥ m > π (Ξ ∪Θ )⋆ ( z ), (5)
r r r
Since τ(Ξ⋆ ∨Θ⋆ ) (z) < n, π(Ξ⋆ ∨Θ⋆ ) (z) ≥ m, σ(Ξ⋆ ∨Θ⋆ ) (z) ≥ v, we obtain τΞr⋆ (z) < n, πΞr⋆ (z) ≥ m,
r r r r r r
σΞr⋆ (z) ≥ v or τΘr⋆ (z) < n, πΘr⋆ (z) ≥ m, σΘr⋆ ) (z) ≥ v. So, there exists A1 ∈ QT τπσ (yn,m,v , r )
such that for each x ∈ £ and for some P τ (Π1 ) ≥ r, P π (Π1 ) ≤ 1 − r, P σ (Π1 ) ≤ 1 − r
we have,
τA ( x ) + τΞ ( x ) − 1 ≤ τΠ ( x ),
1 1
π A ( x ) + π Ξ ( x ) − 1 > π Π ( x ),
1 1
Symmetry 2024, 16, 402 12 of 21
σA ( x ) + σΞ ( x ) − 1 > σΠ ( x ).
1 1
Similarly, there exists A2 ∈ QT τπσ (yn,m,v , r ) such that for each x ∈ £ and for some P τ (Π2 ) ≥
r, P π (Π2 ) ≤ 1 − r, P σ (Π2 ) ≤ 1 − r we have,
τA ( x ) + τΞ ( x ) − 1 ≤ τΠ ( x ),
2 2
π A ( x ) + π Ξ ( x ) − 1 > π Π ( x ),
2 2
σA ( x ) + σΞ ( x ) − 1 > σΠ ( x ).
2 2
τA ( x ) + τΞ∨Θ ( x ) − 1 ≤ τΠ ( x ),
1 ∧ Π2
π A ( x ) + π Ξ∨Θ ( x ) − 1 > π Π ( x ),
1 ∧ Π2
σA ( x ) + σΞ∨Θ ( x ) − 1 > σΠ ( x ).
1 ∧ Π2
Hence, τ(Ξ∪Θ)⋆ (z) < n, π(Ξ∪Θ)⋆ (z) ≥ m, σ(Ξ∪Θ)⋆ (z) ≥ v. This is a conflict with Equation (5).
r r r
Thus, Ξr⋆ ∨ Θr⋆ ≥ (Ξ ∨ Θ)r⋆ .
(7) and (8) are obvious.
1, if Ξ = 0, 1, if Ξ = 0,
1, if Ξ = 1, 4 , if Ξ = Θ,
1
T τ (Ξ) = P τ (Ξ) =
1
, if Ξ = A1 , 1
, if 0 < Ξ < Θ,
2 2
0, otherwise, 0, otherwise,
0, if Ξ = 0, 0, if Ξ = 0,
if Ξ = 1, 4 , if Ξ = Θ,
3
0,
T π (Ξ) = P π (Ξ) =
2 , if Ξ = A2 ,
1
12 , if 0 < Ξ < Θ,
1, otherwise, otherwise,
1,
0, if Ξ = 0, 0, if Ξ = 0,
0, if Ξ = 1, 3 , if Ξ = Θ,
2
T σ (Ξ) = P σ (Ξ) =
2 , if Ξ = A3 , 2 , if 0 < Ξ < Θ,
1 1
1, otherwise, otherwise,
1,
Let B = ⟨(0.4, 0.4, 0.4), (0.4, 0.4, 0.4), (0.4, 0.4, 0.4)⟩. Then, 0 = (B ⋆1 )⋆1 ̸= B ⋆1 = 0.2.
2 2 2
Symmetry 2024, 16, 402 13 of 21
Proof. (1) Since Ξi ≤ Ξi , for all i ∈ J, by Theorem 4(1), we obtain (Ξi )r⋆ ≤ ( Ξi )r⋆ , for
W W
every i ∈ J. Thus,
Now, if P τπσ = P0τπσ , ∀ Ξ ∈ ξ £ , then CT⋆ τπσ (Ξ, r ) = Ξ ∪ Ξr⋆ = Ξ ∨ CT τπσ (Ξ, r ) = CT τπσ (Ξ, r ).
So, T τ ⋆ (P0τ ) = T τ , T π ⋆ (P0π ) = T π and T σ⋆ (P0σ ) = T σ .
Theorem 6. Let (£, T τπσ , P τπσ ) be an svnpts and Ξ ∈ ξ £ and r ∈ ξ 0 and Ξ ∈ ξ £ . Then
(1) IT⋆ τπσ (Ξ ∨ Θ, r ) ≤ IT⋆ τπσ (Ξ, r ) ∨ I⋆ τπσ (Θ, r ).
T
(2) IT τπσ (Ξ, r ) ≤ IT⋆ τπσ (Ξ, r ) ≤ Ξ ≤ CT⋆ τπσ (Ξ, r ) ≤ CT τπσ (Ξ, r ).
(3) IT⋆ τπσ (Ξ ∧ Θ, r ) = IT⋆ τπσ (Ξ, r ) ∧ IT⋆ τπσ (Θ, r ).
(4) CT⋆ τπσ (Ξc , r ) = [IT⋆ τπσ (Ξ, r )]c and [CT⋆ τπσ (Ξ, r )]c = IT⋆ τπσ (Ξc , r ).
Theorem 7. Let (£, T1τπσ , P τπσ ) and (£, T2τπσ , P τπσ ) be svnptss and T1τ ≤ T2τ , T1π ≥ T2π ,
T1σ ≥ T2σ . Then,
(1) Ξr⋆ (T2τ , P τ ) ≤ Ξr⋆ (T1τ , P τ ), Ξr⋆ (T2π , P π ) ≥ Ξr⋆ (T1π , P π ) and Ξr⋆ (T2σ , P σ ) ≥ Ξr⋆ (T1σ , P σ ).
(2) T1⋆τ (P τ ) ≤ T2⋆τ (P τ ), T1⋆π (P π ) ≥ T2⋆π (P π ), T1⋆σ (P σ ) ≥ T2⋆σ (P σ ).
Since τΞ⋆ (T τ ,P τ ) (z) < n, πΞ⋆ (T π ,P π ) (z) ≥ m, σΞ⋆ (T σ ,P σ ) (z) ≥ v, there exists A ∈ QT τπσ (yn,m,v , r )
r 1 r 1 r 1 1
with P τ (Π) ≥ r, P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r, such that for each x ∈ £,
Since T1τ ≤ T2τ , T1π ≥ T2π , T1σ ≥ T2σ , we have A ∈ QT τπσ (yn,m,v , r ). Hence, τΞ⋆ (T τ ,P τ ) (z) <
2 r 2
n, πΞ⋆ (T π ,P π ) (z) ≥ m, σΞ⋆ (T σ ,P σ ) (z) ≥ v. This is a contradiction of Equation (6).
r 2 r 2
(2) Similar to part (1).
Theorem 8. Let (£, T τπσ , P1τπσ ) and (£, T τπσ , P2τπσ ) be svnptss and P1τ ≤ P2τ , P1π ≥ P2π ,
P1σ ≥ P2σ . Then,
(1) Ξr⋆ (P1τ , T τ ) ≥ Ξr⋆ (P2τ , T π ), Ξr⋆ (P1π , T π ) ≤ Ξr⋆ (P2π , T π ) and Ξr⋆ (P1τ , T τ ) ≤ Ξr⋆ (P2τ , T τ ).
(2) T ⋆τ (P1τ ) ≤ T ⋆τ (P2τ ), T ⋆π (P1π ) ≥ T ⋆π (P2π ), T ⋆σ (P1σ ) ≥ T ⋆σ (P2σ ).
Theorem 9. Let (£, T τπσ ) be an svnts and P1τπσ , P2τπσ be two svn-primals on £. Then, ∀ Ξ ∈ ξ £
and r ∈ ξ 0 ,
(1)
Ξr⋆ (P1τ ∧ P2τ , T τ ) = Ξr⋆ (P1τ , T τ ) ∨ Ξr⋆ (P2τ , T τ ),
Ξr⋆ (P1π ∧ P2π , T π ) = Ξr⋆ (P1π , T π ) ∧ Ξr⋆ (P2π , T π ),
Ξr⋆ (P1σ ∧ P2σ , T σ ) = Ξr⋆ (P1σ , T σ ) ∧ Ξr⋆ (P2σ , T σ ).
(2)
Ξr⋆ (P1τ ∨ P2τ , T τ ) = Ξr⋆ (P1τ , T ⋆τ (P2τ )) ∧ Ξr⋆ (P2τ , T ⋆τ (P1τ ))),
Ξr⋆ (P1π ∨ P2π , T π ) = Ξr⋆ (P1π , T ⋆π (P2π )) ∨ Ξr⋆ (P2π , T ⋆π (P1π )),
Ξr⋆ (P1σ ∨ P2σ , T σ ) = Ξr⋆ (P1σ , T ⋆σ (P2σ )) ∨ Ξr⋆ (P2σ , T ⋆σ (P1σ )).
Since [τΞ⋆ (P τ ,T τ ) (z) ∨ τΞ⋆ (P τ ,T τ ) (z)] < n, [πΞ⋆ (P π ,T π ) (z) ∧ πΞ⋆ (P π ,T π ) (z)] ≥ m, [σΞ⋆ (P σ ,T σ ) (z) ∧
r 1 r 2 r 1 r 2 r 1
σΞ⋆ (P σ ,T σ ) (z)] ≥ v, we obtain τΞ⋆ (P τ ,T τ ) (z) < n, πΞ⋆ (P π ,T π ) (z) ≥ m, σΞ⋆ (P σ ,T σ ) (z) ≥ v and
r 2 r 1 r 1 r 1
τΞ⋆ (P τ ,T τ ) (z) < n, πΞ⋆ (P π ,T π ) (z) ≥ m, σΞ⋆ (P σ ,T σ ) (z) ≥ v.
r 2 r 2 r 2
Symmetry 2024, 16, 402 15 of 21
First, by taking the first part, τΞ⋆ (P τ ,T τ ) (z) < n, πΞ⋆ (P π ,T π ) (z) ≥ m, σΞ⋆ (P σ ,T σ ) (z) ≥ v,
r 1 r 1 r 1
there will be A1 ∈ QT τπσ (yn,m,v , r ) with P1τ (Π1 ) ≥ r, P1π (Π1 ) ≤ 1 − r, P1σ (Π1 ) ≤ 1 − r,
such that ∀, x ∈ £,
τA ( x ) + τΞ ( x ) − 1 ≤ τΠ ( x ),
1 1
π A ( x ) + π Ξ ( x ) − 1 > π Π ( x ),
1 1
σA ( x ) + σΞ ( x ) − 1 > σΠ ( x ).
1 1
Secondly, by taking the second part, τΞ⋆ (P τ ,T τ ) (z) < n, πΞ⋆ (P π ,T π ) (z) ≥ m, σΞ⋆ (P σ ,T σ ) (z) ≥ v,
r 2 r 2 r 2
there will be A2 ∈ QT τπσ (yn,m,v , r ) with P2τ (Π2 ) ≥ r, P2π (Π2 ) ≤ 1 − r, P2σ (Π2 ) ≤ 1 − r,
such that ∀, x ∈ £,
τA ( x ) + τΞ ( x ) − 1 ≤ τΠ ( x ),
2 2
π A ( x ) + π Ξ ( x ) − 1 > π Π ( x ),
2 2
σA ( x ) + σΞ ( x ) − 1 > σΠ ( x ).
2 2
Thus, ∀ y ∈ £, we obtain
τ(A ∧A2 )
( x ) + τΞ ( x ) − 1 > τ(Π Π )
( x ),
1 1∧ 2
π(A ∨A2 )
( x ) + π Ξ ( x ) − 1 ≤ π (Π ∨ Π2 )
( x ),
1 1
σ(A ∨A2 )
( x ) + σΞ ( x ) − 1 ≤ σ(Π ∨ Π2 )
( x ).
1 1
On the other side P1τ ∧ P2τ ≤ P1τ , P1π ∨ P2π ≥ P1π , P1σ ∨ P2σ ≥ P1σ and P1τ ∧ P2τ ≤ P2τ ,
P1π ∨ P2π ≥ P2π , P1σ ∨ P2σ ≥ P2σ , so by Theorem 4(2),
Ξr⋆ (P1τ ∧ P2τ ) ≥ Ξr⋆ (P1τ ) ∨ Ξr⋆ (P2τ ), Ξr⋆ (P1π ∧ P2π ) ≤ Ξr⋆ (P1τ ) ∧ Ξr⋆ (P2π ),
Symmetry 2024, 16, 402 16 of 21
Hence, Ξr⋆ (P1τ ∧ P2τ , T τ ) = Ξr⋆ (P1τ , T τ ) ∨ Ξr⋆ (P2τ , T τ ), Ξr⋆ (P1π ∧ P2π , T π ) = Ξr⋆ (P1π , T π ) ∧
Ξr⋆ (P2π , T π ) and Ξr⋆ (P1σ ∧ P2σ , T σ ) = Ξr⋆ (P1σ , T σ ) ∧ Ξr⋆ (P2σ , T σ ).
(2) Similar to part (1).
From the previous theory, we can see the important result that
(T ⋆τ (P τ ), T ⋆π (P π ), T ⋆σ (P ⋆ )) (for short T ⋆ (P)) and ([T ⋆τ (P τ )]⋆ (P τ ), [T ⋆π (P π )]⋆ ((P π )),
[T ⋆σ (P ⋆ )]⋆ (P σ )) (for short T ⋆⋆ ) are equal for any svn-primals on £.
Theorem 10. Let (£, T τπσ , P τπσ ) be an svnpts. Then, for each Ξ ∈ ξ £ and r ∈ ξ 0 ,
(1) Ξr⋆ (P τ ) = Ξr⋆ (P τ , T ⋆τ ), Ξr⋆ (P π ) = Ξr⋆ (P π , T ⋆π ) and Ξr⋆ (P σ ) = Ξr⋆ (P σ , T ⋆σ )).
(2) (T ⋆τ (P τ ) = T ⋆⋆τ , T ⋆π (P π ) = T ⋆⋆π , T ⋆σ (P π )) = T ⋆⋆σ .
Proof. By putting P1τ = P2τ , P1π = P2π and P1σ = P2σ in the second part of the above
theorem, we obtain the required proof.
Theorem 11. Let (£, T τπσ ) be an svnts and P1τπσ , P2τπσ be two svn-primals on £. Then, ∀
r ∈ ξ 0 and Ξ ∈ ξ £ , T ⋆τ (P1τ ∧ P2τ ) = T ⋆τ (P1τ ) ∧ T ⋆τ (P2τ ), T ⋆π (P1π ∧ P2π ) = T ⋆π (P1π ) ∨
T ⋆π (P2π ) and T ⋆σ (P1σ ∧ P2σ ) = T ⋆σ (P1σ ) ∨ T ⋆σ (P2σ ).
Proof. (⇒): Since P1τ ≥ P1τ ∧ P2τ , P1π ≤ P1π ∨ P2π , P1σ ≤ P1σ ∨ P2σ and P2τ ≥ P1τ ∧
P2τ , P2π ≤ P1π ∨ P2π , P2σ ≤ P1σ ∨ P2σ , by Theorem 8(2) we obtain T ⋆τ (P1τ ) ≥ T ⋆τ (P1τ ∧ P2τ ),
T ⋆π (P1π ) ≤ T ⋆π (P1π ∨ P2π ), T ⋆σ (P1σ ) ≤ T ⋆σ (P1σ ∨ P2σ ) and T ⋆τ (P2τ ) ≥ T ⋆τ (P1τ ∧ P2τ ),
T ⋆π (P2π ) ≤ T ⋆π (P1π ∨ P2π ), T ⋆σ (P2σ ) ≤ T ⋆σ (P1σ ∨ P2σ ). Hence,
Definition 12. Let (£, T τπσ ) be an svnts with P τπσ an svn-primal on £. Then, T τπσ is called
single-valued neutrosophic primal open compatible with P τπσ , indicated by T τπσ |= P τπσ , if ∀
Ξ ∈ ξ £ , yn,m,v ∈ Ξ and Π ∈ ξ £ with P τ (Π) ≥ r, P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r, there exists
A ∈ QT τπσ (yn,m,v , r ) such that
Definition 13. Let {Θi : i ∈ Γ} ⊑ ξ £ such that Θi qΞ, ∀ i ∈ Γ and Ξ ∈ ξ £ . Then, {Θi : i ∈ Γ}
is called an r-single-valued neutrosophic quasi-cover (for short, r-svnq-cover) of Ξ iff, ∀ z ∈ £,
Further, let (£, T τπσ ) be an svnts, for any T τ (Θi ) ≥ r, T π (Θi ) ≤ 1 − r, T σ (Θi ) ≤ 1 − r.
Then, this r-svnq-cover will be called a single-valued neutrosophic quasi open-cover (for
short, svnqo-cover) of Ξ.
Symmetry 2024, 16, 402 17 of 21
Theorem 12. Let (£, T τπσ ) be an svnts with svn-primal P τπσ on £. Then, the following
conditions are equivalent
(1) T τπσ |= P τπσ .
(2) If for each Ξ ∈ ξ £ has a svnqo-cover of {Θi : i ∈ Γ} such that τA (z) + τΘ (z) − 1 ≤ τΠ (z)
i
πA (z) + πΘ (z) − 1 > πΠ (z), σA (z) + σΘ (z) − 1 > σΠ (z), for every z ∈ £ and for
i i
some T τ (Π) ≥ r, T π (Π) ≤ 1 − r, T σ (Π) ≤ 1 − r, then P τ (Ξ) ≥ r, P π (Ξ) ≤ 1 − r,
P σ (Ξ) ≤ 1 − r.
(3) For any Ξ ∈ ξ £ , Ξ ∧ Ξr⋆ = 0 implies P τ (Ξ) ≥ r, P π (Ξ) ≤ 1 − r, P σ (Ξ) ≤ 1 − r.
z}|{ z}|{ z}|{ z}|{
(4) For any Ξ ∈ ξ £ , P τ ( Ξ ) ≥ r, P π ( Ξ ) ≤ 1 − r, P σ ( Ξ ) ≤ 1 − r, where Ξ =
yn.m,v such that yn,m,v ∈ Ξ but yn,m,v ̸∈ Ξr⋆ .
W
z}|{
(5) For all T ⋆τ (Ξc ) ≥ r, T ⋆π (Ξc ) ≤ 1 − r, T ⋆σ (Ξc ) ≤ 1 − r, we have P τ ( Ξ ) ≥ r,
z}|{ z}|{
P π ( Ξ ) ≤ 1 − r, P σ ( Ξ ) ≤ 1 − r.
(6) For each Ξ ∈ ξ £ , if Ξ contains no Θ ̸= 0 with Θ ≤ Θr⋆ , then P τ (Ξ) ≥ r, P π (Ξ) ≤ 1 − r,
P σ (Ξ) ≤ 1 − r.
for some P τ (Π) ≥ r, P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r, implies yn,m,v ̸∈ Ξr⋆ . Firstly, there are
two cases: either Ξr⋆ = 0 or Ξr⋆ ̸= 0 but n > τΞ⋆ (z) ̸= 0, m ≤ πΞ⋆ (z) ̸= 0, v ≤ σΞ⋆ (z) ̸= 0.
r r r
Assume, if possible, yn.m.v ∈ Ξ such that n > τΞ⋆ (z) ̸= 0, m ≤ πΞ⋆ (z) ̸= 0, v ≤ σΞ⋆ (z) ̸= 0.
r r r
Let n1 = τΞ⋆ (z), m1 = πΞ⋆ (z), v1 = σΞ⋆ (z), . Then, yn ,m ,v ∈ Ξr⋆ (z). Secondly, yn ,m ,v ∈ Ξ.
r r r 1 1 1 1 1 1
Thus, for all B ∈ QT τπσ (yn,m,v , r ), P τ (Π) ≥ r, P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r, there is at
least one z ∈ £ such that
Since yn ,m ,v ∈ Ξ, this contradicts the assumption for each svn-point of Ξ. So, Ξr⋆ = 0. That
1 1 1
means yn,m,v ∈ Ξ implies yn,m,v ̸∈ Ξr⋆ . Now, this is true for each Ξ ∈ ξ £ . So, Ξ ∨ Ξr⋆ = 0. Thus,
by (3), we obtain P τ (Ξ) ≥ r, P π (Ξ) ≤ 1 − r, P σ (Ξ) ≤ 1 − r implies T τπσ |= P τπσ .
z}|{
3 ⇒ 4: Let yn,m,v ∈ Ξ . Then, yn,m,v ∈ Ξ but yn,m,v ̸∈ Ξr⋆ . So, there exists an A ∈
QT τπσ (yn,m,v , r ) such that ∀ z ∈ £,
τA (z) + τz}|{ (z) − 1 ≤ τΠ (z), πA (z) + πz}|{ (z) − 1 > πΠ (z), σA (z) + σz}|{ (z) − 1 > σΠ (z),
Ξ Ξ Ξ
z}|{
for some P τ (Π) ≥ r, P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r. Thus, yn,m,v ̸∈ Ξr⋆ implies that
z}|{ z}|{
Ξr⋆ = 0 or Ξr⋆ ̸= 0 but n > τz}|{ (z), m ≤ πz}|{ (z), v ≤ σz}|{ (z). Let ys ,m ,v ∈
1 1 1
Ξr⋆ Ξr⋆ Ξr⋆
svn-point(£) such that n1 ≤ τz}|{ (z) < n, m1 > πz}|{ (z) ≥ m, v1 > σz}|{ (z) ≥ v;
Ξr⋆ Ξr⋆ Ξr⋆
z}|{
this means yn ,m ,v ∈ Ξr⋆ . Then, ∀ B ∈ QT τπσ (yn ,m ,v , r ) and for every P τ (Π) ≥ r,
1 1 1 1 1 1
P π (Π) ≤ 1 − r, P σ (Π) ≤ 1 − r, there is at least one z ∈ £ such that
τB (z) + τz}|{ (z) − 1 > τΠ (z), πB (z) + πz}|{ (z) − 1 ≤ πΠ (z), σB (z) + σz}|{ (z) − 1 ≤ σΠ (z).
Ξ Ξ Ξ
z}|{
Since Ξ ≤ Ξ, then for any B ∈ QT τπσ (yn ,m ,v , r ) and P τ (Π) ≥ r, P π (Π) ≤ 1 − r,
1 1 1
P σ (Π) ≤ 1 − r, there is at least one z ∈ £ such that
holds for every z ∈ £ and for some P τ (Ξ) ≥ r, P π (Ξ) ≤ 1 − r, P σ (Ξ) ≤ 1 − r. This implies
yn,m,v ̸∈ Ξr⋆ . Let Θ = Ξ ∨ Ξr⋆ . Then, Θr∗ = (Ξ ∨ Ξr⋆ )r⋆ = Ξr⋆ ∨ (Ξr⋆ )r⋆ = Ξr⋆ by Theorem 4(4). So,
CT⋆ τπσ (Θ, r ) = Θ ∨ Θr⋆ = Θ. That means T ⋆τ (Θc ) ≥ r, T ⋆π (Θc ) ≤ 1 − r, T ⋆σ (Θc ) ≤ 1 − r.
Thus, by (5), we obtain that P τ (Θ) ≥ r, P π (Θ) ≤ 1 − r, P σ (Θ) ≤ 1 − r.
z}|{
Again, For any ys,m,v ∈ svn-point(£), ys,m,v ̸∈ Θr⋆ implies ys,m,v ∈ Θ but ys,m,v ̸∈ Θr⋆ = Ξr⋆ .
So, Θ = Ξ ∨ Ξr⋆ , ys,m,v ∈ Ξ. Now, by the hypothesis about Ξ, we have for every ys,m,v ∈ Ξr⋆ .
z}|{
So, Θ = Ξ. Hence, P τ (Θ) ≥ r, P π (Θ) ≤ 1 − r, P σ (Θ) ≤ 1 − r. Thus, T τπσ |= P τπσ .
Theorem 13. Let (£, T τπσ ) be an svnts with svn-primal P τπσ on £. Then, the following cases
are equivalent and implied T τπσ |= P τπσ .
Symmetry 2024, 16, 402 19 of 21
Proof. The proof follows a similar line of reasoning to that of Theorem 12.
5. Conclusions
In this paper, first, we investigated the complex area of stratification of svn grills
and determined some of their fundamental features. The links between svn grills and
svn-primals were investigated. We also introduced and explored the concept of svn-primal
open local functions in the context of Šostak’s sense. By extending the notions of svn sets
and related topological structures, we have presented a novel approach to understanding
the properties and relationships within this unique framework.
Our investigation began by defining svn-sets and their corresponding notions. Build-
ing upon these fundamental definitions, we introduced svnts and explored various oper-
ations and properties within these spaces, such as the neutrosophic closure and interior.
A central contribution of this work has been the introduction and exploration of svn-
primals and their associated operators. We have provided several equivalent conditions
characterizing the compatibility of svnts with neutrosophic primals. Additionally, we dis-
cussed the properties of primal open local functions, their relationship with svnts, and the
induced operators.
In conclusion, the results presented in this paper contribute to the growing field of
neutrosophic topology by offering a deeper understanding of svn structures in Šostak’s
sense. The properties and correlations investigated here establish the framework for further
studies in this field, opening options for future investigations and applications of these
innovative notions in various fields.
In terms of related and future research directions, it is of great interest to investigate
the connections between our findings and the advancements in the field of neural networks
(Gu and Sheng [36]; Gu et al. [37]; Deng et al. [38]; Gu et al. [39]). Furthermore, the possible
connections to multidimensional systems and signal processing need further investigation,
as illustrated by Wang et al. [40] and Xiong et al. [41].
By bridging the gap between svn structures and related domains, we might promote
collaboration across disciplines and discover new applications for our findings. This not
only enriches the discipline of neutrosophic topology, but also benefits the larger scientific
community by providing new insights and fresh approaches to difficult problems.
For forthcoming papers
The theory can be extended in the following normal methods.
1—Basic concepts of neutrosophic metric topological spaces can be studied using the
notion of svn-primal present in this article;
2—Examine the connected, separation axioms and soft closure spaces in the context of
svn-primals.
Author Contributions: F.A., Writing—review & editing, Writing—original draft; H.A., Writing—
review & editing, Writing—original draft, Funding acquisition; Y.S., Writing—review & editing,
Writing—original draft; F.S., Writing—review & editing. All authors have read and agreed to the
published version of the manuscript.
Funding: The work is supported by King Saud University (Supporting Project number RSPD2024R860),
Riyadh, Saudi Arabia).
Data Availability Statement: Data are contained within the article.
Acknowledgments: The authors would like to extend their sincere appreciation to Supporting Project
number (RSPD2024R860) King Saud University, Riyadh, Saudi Arabia.
Conflicts of Interest: The authors declare no conflicts of interest.
Symmetry 2024, 16, 402 20 of 21
Abbreviations
The following abbreviations are used in this manuscript:
References
1. Willard, S. General Topology; Courier Corporation: North Chelmsford, MA, USA, 2012.
2. Kuratowski, K. Topology: Volume I; Elsevier: Amsterdam, The Netherlands, 2014.
3. Abbas, S.E.; Hebeshi, M.A. Construction of stratified L-fuzzy topological structures. Appl. Math. Lett. 2011, 24, 1063–1066.
4. Chattopadhyay, K.C.; Thron, W.J. Extensions of closure spaces. Can. J. Math. 1977, 29, 1277–1286.
5. Thron, W.J. Proximity structures and grills. Math. Ann. 1973, 206, 35–62.
6. Roy, B.; Mukherjee M.N.; Ghosh, S.K. On a new operator based on a grill and its associated topology. Arab. J. Math. 2008, 14,
21–32.
7. Roy, B.; Mukherjee, M.N. On a typical topology induced by a grill. Soochow J. Math. 2007, 33, 771–786.
8. Roy, B.; Mukherjee, M.N. Concerning topologies induced by principal grills. Analele Stiint. Ale Univ. Mat. 2009, 55, 285–294.
9. Roy, B.; Mukherjee, M.N. On a type of compactness via grills. Mat. Vesn. 2007, 59, 113–120.
10. Thangamariappan, R.; Renukadevi, V. Topology generated by cluster systems. Math. Vesn. 2015, 67, 174–184.
11. Azzam, A.A.; Hussein S.S.; Osman, H.S. Compactness of topological spaces with grills. Ital. J. Pure Appl. Math. 2020, 44, 198–207.
12. Talabeigi, A. On the Tychonoff’s type theorem via grills. Bull. Iran. Math. Soc. 2016, 42, 37–41.
13. Boroojerdian, N.; Talabeigi, A. One-point λ-compactification via grills. Iran. J. Sci. Technol. Trans. Sci. 2017, 41, 909–912.
https://doi.org/10.1007/s40995-017-0314-x.
14. Sulimana, S.S.; Esmaeela, R.B. On some topological concepts via grill. Int. J. Nonlinear Anal. Appl. 2022, 13, 3765–3772.
http://dx.doi.org/10.22075/ijnaa.2022.6158.
15. Azzam, A.A. Grill Nano topological spaces with grill Nano generalized closed sets. J. Egypt. Math. Soc. 2017, 25, 164–166.
https://doi.org/10.1016/j.joems.2016.10.005.
16. Hosny, R.A. δ-sets with grill. Int. Math. Forum 2012, 7, 2107–2113.
17. Janković, D.; Hamlett, T.R. New topologies from old via ideals. Am. Math. Mon. 1990, 97, 295–310.
18. Smarandache, F. A Unifying Field in Logics: Neutrosophic Logic. Neutrosophy, Neutrosophic Set, Neutrosophic Probability and Statistics,
6th ed.; InfoLearnQuest: Ann Arbor, MI, USA, 2007. Available online: Http://fs.gallup.unm.edu/eBook-neutrosophics6.pdf
(accessed on 10 February 2019).
19. Salama, A.A.; Alblowi, S.A. Neutrosophic set and neutrosophic topological spaces. IOSR J. Math. 2012, 3, 31–35.
20. Wang, H.; Smarandache, F.; Zhang, Y.Q.; Sunderraman, R. Single valued neutrosophic sets. Multispace Multistruct. 2010, 4,
410–413.
21. Rodrigo, P.A.; Maheswari, S. Neutrosophic gsα*-Open and Closed Maps in Neutrosophic Topological Spaces. Neutrosophic Syst.
Appl. 2023, 8, 42–49.
22. Ye, J. Single valued neutrosophic cross-entropy for multicriteria decision making problems. Appl. Math. Modell. 2014, 38, 1–3.
https://doi.org/10.1016/j.apm.2013.07.020.
23. Dhar, R. Compactness and Neutrosophic Topological Space via Grills. Neutrosophic Syst. Appl. 2023, 2, 1–7.
24. Dey, S.; Ray, G.C. Separation Axioms in Neutrosophic Topological Spaces. Neutrosophic Syst. Appl. 2023,2, 38–54.
25. Alsharari, F.; Saber, Y.M.; Alohali, H.; Alqahtani, M.H.; Ebodey, M.; Elmasry, T.; Alsharif, J.; Soliman, A.F.; Smarandache, F.;
Sikander, F. On stratified single-valued soft topogenous structures. Heliyon 2024, 10, e27926.
26. Saber, Y.M.; Alohali, H.; Elmasry, T.; Smarandache, F. On single-valued neutrosophic soft uniform spaces. AIMS Math. 2024, 9,
412–439. https://doi.org/10.3934/math.2024023.
27. Saber, Y.M.; Alsharari, F.; Smarandache, F. On Single-valued neutrosophic ideals in Šostak sense. Symmetry 2020, 12, 194.
28. Saber, Y.M.; Alsharari, F.; Smarandache, F.; Abdel-Sattar, A. Connectedness and stratification of single-valued neutrosophic
topological spaces. Symmetry 2020, 12, 1464.
29. Ye, J.; Cui, W. Neutrosophic Compound Orthogonal Neural Network and Its Applications in Neutrosophic Function Approxima-
tion. Symmetry 2019, 11, 147. https://doi.org/10.3390/sym11020147.
30. Shao, S.; Zhang, X.; Li. Y.; Bo, C. Probabilistic Single-Valued (Interval) Neutrosophic Hesitant Fuzzy Set and Its Application in
Multi-Attribute Decision Making. Symmetry 2018, 10, 419. https://doi.org/10.3390/sym10090419.
Symmetry 2024, 16, 402 21 of 21
31. Rıdvan, S.; Ahmet, K. Subsethood measure for single valued neutrosophic sets. J. Intell. Fuzzy Syst. 2015, 29, 525–530.
32. Das, S.; Roy, B.K.; Kar, M.B.; Kar, S.; Pamučar, D. Neutrosophic fuzzy set and its application in decision making. J. Ambient. Intell.
Humaniz. Comput. 2020, 11, 5017–5029.
33. Yang, H.L.; Guo, Z.L.; Liao, X. On single valued neutrosophic relations. J. Intell. Fuzzy Syst. 2016, 30, 1045–1056.
34. Ye, J.A. multicriteria decision-making method using aggregation operators for simplified neutrosophic sets. J. Intell. Fuzzy Syst.
2014, 26, 2450–2466.
35. Acharjee, S.; Özkoç, M.; Issaka, F.Y. Primal topological spaces. arXiv 2022, arXiv:2209.12676.
36. Gu, B.; Sheng, V.S. A robust regularization path algorithm for v support vector classification. IEEE. Trans. Neural. Netw. Learn.
Syst. 2017, 28, 1241–1248.
37. Gu, B.; Sun, X.; Sheng, V.S. Structural minimax probability machine. IEEE. Trans. Neural. Netw. Learn. Syst. 2017, 28, 1646–1656.
38. Deng, W.; Zhao, H.M.; Yang, X.H.; Xiong, J.X.; Sun, M.; Li, B. Study on an improved adaptive PSO algorithm for solving
multi-objective gate assignment. Appl. Soft. Comput. 2017, 59, 288–302.
39. Gu, B.; Sheng, V.S.; Tay, K.Y.; Romano, W.; Li, S. Incremental support vector learning for ordinal regression. IEEE. Trans. Neural.
Netw. Learn. Syst. 2015, 26, 1403–1416.
40. Wang, B.; Gu, X.; Ma, L.; Yan, S. Temperature error correction based on BP neural network in meteorological WSN. Int. J. Sens.
Netw. 2017, 23, 265–278.
41. Xiong, L.; Xu, Z.; Shi, Y.Q. An integer wavelet transform-based scheme for reversible data hiding in encrypted images. Multidim.
Syst. Sign. Process. 2018, 29, 1191–1202.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual
author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to
people or property resulting from any ideas, methods, instructions or products referred to in the content.