Next Article in Journal
The Fuzzy Width Theory in the Finite-Dimensional Space and Sobolev Space
Next Article in Special Issue
A Bidirectional Arabic Sign Language Framework Using Deep Learning and Fuzzy Matching Score
Previous Article in Journal
A Mathematical Study for the Transmission of Coronavirus Disease
Previous Article in Special Issue
Assessment of Structural Systems to Design Earthquake Resistance Buildings by Employing Multi-Attribute Decision-Making Method Based on the Bipolar Complex Fuzzy Dombi Prioritized Aggregation Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Primal Soft Topology

by
Tareq M. Al-shami
1,
Zanyar A. Ameen
2,
Radwan Abu-Gdairi
3 and
Abdelwaheb Mhemdi
4,*
1
Department of Mathematics, Sana’a University, Sana’a P.O. Box 1247, Yemen
2
Department of Mathematics, College of Science, University of Duhok, Duhok 42001, Iraq
3
Department of Mathematics, Faculty of Science, Zarqa University, Zarqa P.O. Box 13110, Jordan
4
Department of Mathematics, College of Sciences and Humanities in Aflaj, Prince Sattam Bin Abdulaziz University, Riyadh 16273, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(10), 2329; https://doi.org/10.3390/math11102329
Submission received: 27 April 2023 / Revised: 11 May 2023 / Accepted: 15 May 2023 / Published: 16 May 2023
(This article belongs to the Special Issue Recent Advances in Fuzzy Deep Learning for Uncertain Medicine Data)

Abstract

:
In a soft environment, we investigated several (classical) structures such as ideals, filters, grills, etc. It is well known that these structures are applied to expand abstract concepts; in addition, some of them offer a vital tool to address some practical issues, especially those related to improving rough approximation operators and accuracy measures. Herein, we contribute to this line of research by presenting a novel type of soft structure, namely “soft primal”. We investigate its basic properties and describe its behaviors under soft mappings with the aid of some counterexamples. Then, we introduce three soft operators ( · ) , C l and ( · ) inspired by soft primals and explore their main characterizations. We show that C l satisfies the soft Kuratowski closure operator, which means that C l generates a unique soft topology we call a primal soft topology. Among other obtained results, we elaborate that the set of primal topologies forms a natural class in the lattice of topologies over a universal set and set forth some descriptions for primal soft topology under specific types of soft primals.

1. Introduction

The initial phase of the soft sets was diagnosed by Molodtsov [1]. The hypothesis of Molodtsov’s soft set theory has attracted broad consideration from many distinguished researchers and intellectuals since it overcomes the drawbacks of traditional mathematical tools and has great application superiority in coping with uncertainties [2,3]. After successfully introducing the notion of soft sets, the soft sets were modified and hybridized to fuzzy soft sets, soft rough sets, and recently ( a , b ) -fuzzy soft sets.
Soft set theory has been applied to a variety of mathematical structures, including soft group theory [4], soft ring theory [5], soft category theory [6], soft algebra [7,8], and so on. In 2011, two methodologies to define soft topology were displayed by Shabir and Naz [9] and Çaǧman et al. [10]. They differ in the manners of choosing the sets of parameters. Herein, we follow Shabir and Naz’s approach, which imposed that a set of parameters must be constant for all soft open sets that produce a soft topology. Following Shabir and Naz’s work, many researchers and intellectuals constructed a soft version for the classical topological concepts and notions. For instance, soft separation axioms [11], soft separable spaces [11], soft connected spaces [12], soft compact spaces [13], soft paracompact spaces [12], soft extremally disconnected spaces [14], generalizations of soft open subsets [15,16], Vietoris topology [17], metric spaces [18], and soft Menger spaces [19].
By dropping a certain (part of an) axiom of soft topology, a new (weak) structure can be established. For example, El-Sheikh and Abd El-Latif [20] came up with the idea of supra soft topological spaces by dismissing the finite intersection axiom of a soft topology. Thomas and John [21] weakened supra soft topological spaces by establishing the concept of soft generalized topological spaces, which is the family of soft sets that satisfy an arbitrary union condition of a soft topology. Al-shami [22] introduced the idea of infra soft topological spaces by ignoring the union axiom of a soft topology. Therefore, this route attracted a large number of researchers who investigated important principles in the latter soft structures; for more details, see [23,24,25,26].
Another fruitful area of study is how to construct soft topologies over a common universal set. Terepeta [27] provided two exceptional techniques to generate soft topologies from crisp topologies. The soft topology constructed using one of the methods is therefore equal to the enriched soft topology, as demonstrated by Al-shami in [28]. The formulas provided by Terepeta were refined by Alcantud [29] such that it is now possible to generate a soft topology from a system of crisp topologies. Ameen and Al Ghour [30] introduced the so-called soft simple extension of a soft topology. The simple extended soft topology with respect to a soft topology and a soft set is generated by their (soft) union. Kandil et al. [31] introduced the concept of *-soft topological spaces, which are a mix of soft topological and soft algebraic structures. The *-soft topology is generated by an old soft topology with the help of a soft ideal. The *-soft topologies can be called ideal soft topologies. Likewise, the concept of soft topology via soft grills appeared in [32]. In this direction, we define the concept of primal soft topology. This soft topology is constructed via the soft Kuratowski closure operator with respect to a primal soft topological space. Primal soft topologies are a natural generalization of the primal crisp topologies established in [33]. Some operators of primal topological spaces were introduced by Al-Omari et al. [34].
The first reason that we wrote this article is to present a new type of soft structure that enriches studies on soft settings by creating novel frameworks that allow us to establish new soft concepts and properties. Second, we generate a new way to produce soft topology inspired by some soft operators. Finally, we confirm the importance of the soft environments to provide several sorts of analogs for every classical concept. That is, one can exploit the different types of belonging relationships between ordinary points and soft sets to define various kinds of soft operators and then generate some types of soft topologies.
This work is displayed as follows. Following this introduction, we review the definitions and conclusions required to comprehend the information in Section 2. Then, in Section 3, we define the concept of the soft primal and show that soft primals and soft grills are complementary notions. The basic operations on soft primals are studied. In Section 4, we give the definition of a primal soft topological space followed by a soft topological operator . Then, we study the main properties of . In addition, we define another soft operator called C l with the help of and show that C l is the soft Kuratowski closure operator. This means that C l generates a unique soft topology, which we call a primal soft topology. The fundamental properties of primal soft topologies are investigated. We close Section 4 by defining a soft operator ( · ) and elucidate its essential features. Finally, in Section 5, we summarize the main contributions and offer some suggestions for the future.

2. Preliminaries

Definition 1
([1]). A soft set over a nonempty set Y is a set-valued function F from a nonempty set of parameters Δ to the power set 2 Y of Y; it is denoted by the ordered pair ( F , Δ ) . That is, a soft set ( F , Δ ) over Y provides a parameterized collection of subsets of Y, so it may represented as follows:
( F , Δ ) = { ( λ , F ) : λ Δ   and   F ( λ ) 2 Y } ;
where each F ( λ ) is termed a λ-component of ( F , Δ ) . We denote the family of all soft sets over Y with a set of parameters Δ by S ( Y Δ ) .
Throughout this manuscript, ( F , Δ ) , ( G , Δ ) denote soft sets over Y.
Definition 2
([35,36,37]). A soft set ( F , Δ ) is as follows:
 (i) 
Absolute, symbolized by Y ~ , if F ( λ ) = Y for all λ Δ .
 (ii) 
Null, symbolized by ϕ ~ , if F ( λ ) = for all λ Δ .
 (iii) 
A soft point if there are λ Δ and y Y with F ( λ ) = { y } and F ( μ ) = for all μ Δ { λ } . A soft point is briefly denoted by y λ . We write y λ ( F , Δ ) if y F ( λ ) .
Definition 3
([9,35]). We call ( F , Δ ) a soft subset of ( G , Δ ) (or ( G , Δ ) a soft superset of ( G , Δ ) ), symbolized by ( F , Δ ) ~ ( G , Δ ) if F ( λ ) G ( λ ) for each λ Δ .
Definition 4
([35]). If G ( λ ) = Y F ( λ ) for all λ Δ , then we call ( G , Δ ) a complement of ( F , Δ ) . The complement of ( F , Δ ) is symbolized by ( F , Δ ) c = ( F c , Δ ) .
Definition 5
([13,35]). Let ( F , Δ ) and ( G , Δ ) be soft sets. Then, the concepts of soft union, soft intersection, soft difference, and soft product are given respectively by
 (i) 
( F , Δ ) ~ ( G , Δ ) = ( H , Δ ) , where H ( λ ) = F ( λ ) G ( λ ) for all λ Δ .
 (ii) 
( F , Δ ) ~ ( G , Δ ) = ( H , Δ ) , where H ( λ ) = F ( λ ) G ( λ ) for all λ Δ .
 (iii) 
( F , Δ ) \ ( G , Δ ) = ( H , Δ ) , where H ( λ ) = F ( λ ) \ G ( λ ) for all λ Δ .
 (iv) 
( F , Δ ) × ( G , Δ ) = ( H , Δ ) , where H ( λ 1 , λ 2 ) = F ( λ 1 ) × G ( λ 2 ) for all ( λ 1 , λ 2 ) Δ × Δ .
Definition 6
([38]). A soft set ( F , Δ ) is called finite (or countable) if F ( λ ) is finite (or countable) for each λ Δ . Otherwise, it is called infinite (or uncountable).
The adjusted version of the definition of soft functions is given in the following.
Definition 7
([39]). Let h : Y Z and π : Δ P be crisp functions. A soft function h π of S ( Y Δ ) into S ( Z P ) is a relation such that each y λ S ( Y Δ ) is related to one and only one z p S ( Z P ) such that
h π ( y λ ) = h ( y ) π ( λ )   for   all   y λ S ( Y Δ )
.
In addition, h π 1 ( z p ) = ~ y h 1 ( z ) λ π 1 ( p ) y λ for each z p S ( Z P ) .
We describe a soft function as injective (or surjective, bijective) if both of its crisp functions obey this property.
Proposition 1
([40]). Let h π : S ( Y Δ ) S ( Z P ) be a soft function and let ( F , Δ ) S ( Y Δ ) and ( G , Δ ) S ( Z P ) . Then
 (i) 
( F , Δ ) ~ h π 1 ( h π ( F , Δ ) ) .
 (ii) 
If h π is injective, then ( F , Δ ) = h π 1 ( h π ( F , Δ ) ) .
 (iii) 
h π ( h π 1 ( G , P ) ) ~ ( G , P ) .
 (iv) 
If h π is surjective, then h π ( h π 1 ( G , P ) ) = ( G , P ) .
Definition 8
([9,10]). A subfamily Θ of S ( Y Δ ) is named a soft topology on Y if it obeys the next stipulations:
 (i) 
Y ~ and ϕ ~ are elements of Θ .
 (ii) 
Θ is closed under finite soft intersections.
 (iii) 
Θ is closed under arbitrary soft unions.
The notation ( Y , Θ , Δ ) is named a soft topological space (briefly, STS). A soft set belonging to Θ is named soft open, and it is named soft closed if its complement is soft open. The family of all soft closed sets in Y is denoted by Θ c . For y λ Y ~ , the family of all members of Θ containing y λ is denoted by Θ ( y λ ) .
Definition 9
([41]). A soft subset ( N , Δ ) of an STS ( Y , Θ , Δ ) is called a soft neighborhood of a soft point y λ provided that there exists ( G , Δ ) Θ such that y λ ( G , Δ ) ~ ( N , Δ ) .
Definition 10
([42]). Let F ~ S ( Y Δ ) and let { ( Y , Θ i , Δ ) : i I } be an indexed family of STSs on Y with an arbitrary index I such that F ~ Θ i . Then, ~ i I Θ i is called the soft topology on Y generated by F .
Definition 11
([9]). The soft closure of a soft set ( B , Δ ) in a STS ( Y , Θ , Δ ) is defined by
C l ( B , Δ ) = ~ ( F , Δ ) : ( B , Δ ) ~ ( F , Δ ) , ( F , Δ ) Θ c .
Definition 12
([43]). A mapping c : S ( Y Δ ) S ( Y Δ ) is called a soft (Kuratowski) closure operator on X if it meets the following conditions for any ( F , Δ ) , ( G , Δ ) S ( Y Δ ) :
 (C1) 
c ( ϕ ~ ) = ϕ ~ .
 (C2) 
( F , Δ ) ~ c ( F , Δ ) .
 (C3) 
c ( c ( F , Δ ) ) = c ( F , Δ ) .
 (C4) 
c ( F , Δ ) ~ ( G , Δ ) = c ( F , Δ ) ~ c ( G , Δ ) .
Definition 13
([44]). A subfamily I of S ( Y Δ ) is said to be a soft ideal on Y if it obeys the following postulates:
 (i) 
If ( F , Δ ) , ( G , Δ ) I , then ( F , Δ ) ~ ( G , Δ ) I .
 (ii) 
If ( G , Δ ) I and ( F , Δ ) ~ ( G , Δ ) , then ( F , Δ ) I .
Definition 14
([32]). A subfamily F of S ( Y Δ ) is said to be a soft grill on Y if it satisfies the following postulates:
 (i) 
ϕ ~ F .
 (ii) 
If ( G , Δ ) F and ( G , Δ ) ~ ( H , Δ ) , then ( H , Δ ) F . That is, F is closed under soft superset relation.
 (iii) 
If ( G , Δ ) ~ ( H , Δ ) F , then ( G , Δ ) F or ( H , Δ ) F .

3. Soft Primal

This segment is allocated to display a novel structure in soft settings, namely soft primal. The basic characteristics of this structure are demonstrated, and its behavior under soft functions is described with an elucidative instance.
Definition 15.
A subfamily F of S ( Y Δ ) is said to be a soft primal on Y if it satisfies the following postulates:
 (i) 
Y ~ F .
 (ii) 
If ( G , Δ ) F and ( H , Δ ) ~ ( G , Δ ) , then ( H , Δ ) F . That is, F is closed under soft subset relation.
 (iii) 
If ( G , Δ ) ~ ( H , Δ ) F , then ( G , Δ ) F or ( H , Δ ) F .
The next result is easy to prove.
Proposition 2.
A subfamily F of S ( Y Δ ) is a soft primal on Y if and only if the following conditions are satisfied.
 (i) 
Y ~ F .
 (ii) 
If ( G , Δ ) F and ( G , Δ ) ~ ( H , Δ ) , then ( H , Δ ) F .
 (iii) 
If ( G , Δ ) F and ( H , Δ ) F , then ( G , Δ ) ~ ( H , Δ ) F .
Theorem 1.
If F 1 and F 2 are two soft primals on Y, then F 1 F 2 is a soft primal on Y.
Proof. 
First, let F 1 and F 2 be two soft primals on Y. Then Y ~ F 1 and Y ~ F 2 . So that Y ~ F 1 F 2 . Second, suppose that ( V , Δ ) F 1 F 2 and let ( U , Δ ) ~ ( V , Δ ) . Then, ( V , Δ ) F 1 or ( V , Δ ) F 2 . This automatically leads to that ( U , Δ ) F 1 or ( U , Δ ) F 2 . So ( U , Δ ) F 1 F 2 . Third, let ( U , Δ ) , ( V , Δ ) be soft subsets such that ( U , Δ ) ~ ( V , Δ ) F 1 F 2 . Then, ( U , Δ ) ~ ( V , Δ ) F 1 or ( U , Δ ) ~ ( V , Δ ) F 2 . This implies that ( U , Δ ) F 1 F 2 or ( V , Δ ) F 1 F 2 , as required. □
The next example elaborates that the class of soft primals on a set Y is not closed under the intersection operator in general.
Example 1.
Let Y = { y } and Δ = { δ 1 , δ 2 } . Then F 1 = { ϕ ~ , { ( δ 1 , ) , ( δ 2 , { y } ) } } and F 2 = { ϕ ~ , { ( δ 1 , { y } ) , ( δ 2 , ) } } are two soft primals on a set Y with Δ . Now, F 1 F 2 = { ϕ ~ } is not a soft primal because { ( δ 1 , ) , ( δ 2 , { y } ) } ~ { ( δ 1 , { y } ) , ( δ 2 , ) } = ϕ ~ F 1 F 2 . But neither { ( δ 1 , ) , ( δ 2 , { y } ) } F 1 F 2 nor { ( δ 1 , { y } ) , ( δ 2 , ) } F 1 F 2 .
Theorem 2.
If G is a soft grill on Y, then the family F = { ( H , Δ ) : ( H c , Δ ) G } is a soft primal on Y.
Proof. 
First, it is obvious that ϕ ~ G , so Y ~ F . Second, let ( V , Δ ) F , and take any soft subset ( U , Δ ) of ( V , Δ ) . By the way of building F , we have ( V c , Δ ) G . Since ( V c , Δ ) ~ ( U c , Δ ) , it follows from the definition of the soft grill that ( U c , Δ ) G . This automatically means that ( U , Δ ) F . Third, let ( U , Δ ) , ( V , Δ ) be soft subsets such that ( U , Δ ) ~ ( V , Δ ) F . Then, ( U c , Δ ) ~ ( V c , Δ ) G . Therefore, ( U c , Δ ) G or ( V c , Δ ) G . Thus, ( U , Δ ) F or ( V , Δ ) F . Hence, we get the desired result. □
Corollary 1.
If G is a soft primal on Y, then the family F = { ( H , Δ ) : ( H c , Δ ) G } is a soft grill on Y.
Now, we discuss the condition under which primal structures navigate between soft and classical settings.
First, we provide the next example to elucidate that F δ = { F ( δ ) : ( F , Δ ) F } , inspired by a soft primal F , does not institute a (crisp) primal for any fixed parameter δ Δ .
Example 2.
Let Y = { y , z } and Δ = { δ 1 , δ 2 } . Consider the following soft sets:
( F 1 , Δ ) = { ( δ 1 , ) , ( δ 2 , { y } ) } ;
( F 2 , Δ ) = { ( δ 1 , ) , ( δ 2 , { z } ) } ;
( F 3 , Δ ) = { ( δ 1 , { y } ) , ( δ 2 , ) } ;
( F 4 , Δ ) = { ( δ 1 , { z } ) , ( δ 2 , ) } ;
( F 5 , Δ ) = { ( δ 1 , { z } ) , ( δ 2 , { z } ) } ;
( F 6 , Δ ) = { ( δ 1 , { y } ) , ( δ 2 , { z } ) } ;
( F 7 , Δ ) = { ( δ 1 , Y ) , ( δ 2 , ) } ;
( F 8 , Δ ) = { ( δ 1 , ) , ( δ 2 , Y ) } ;
( F 9 , Δ ) = { ( δ 1 , Y ) , ( δ 2 , { z } ) } ; and
( F 10 , Δ ) = { ( δ 1 , { z } ) , ( δ 2 , { y } ) } .
Then, F = { ϕ ~ , ( F i , Δ ) : i = 1 , 2 , , 9 } is a soft primal on a set Y with Δ . We obtain F δ 1 = F δ 2 = 2 Y . Obviously, F δ 1 and F δ 2 are not (crisp) primal because Y belongs to both of them.
Theorem 3.
Let F be a soft primal on a set Y with a set of parameters Ω . Then,
F δ = { F ( δ ) : ( F , Δ ) F } \ { Y }
is a (crisp) primal on Y for any fixed parameter δ Δ .
Proof. 
It is clear that Y F δ . Let A F δ and take any subset B of A. Then, there exists a soft subset ( G , Δ ) in F such that G ( δ ) = A . Now, a soft set ( H , Δ ) , given by H ( δ ) = B and H ( δ ) = for each δ δ , is a soft subset of ( G , Δ ) , so ( H , Δ ) F . This means that H ( δ ) = B F δ . Thus, F δ is closed under a subset relation. Finally, let A B F δ . Then, there exists a soft subset ( W , Δ ) in F such that W ( δ ) = A B . Note that there exist soft subsets ( U , Δ ) and ( V , Δ ) such that U ( δ ) = A , U ( δ ) = B and U ( δ ) = V ( δ ) = W ( δ ) for each δ δ . That is, ( W , Δ ) = ( U , Δ ) ~ ( V , Δ ) , so ( U , Δ ) F or ( V , Δ ) F . This automatically leads to A F δ or B F δ . Hence, the proof is complete. □
We close this section by showing how the soft primal behaves under soft mappings.
Remark 1.
Let h π : S ( Y Δ ) S ( Z Ω ) be a soft mapping and G be a soft primal on Z with a set of parameters Ω . The class { h π 1 ( G , Ω ) : ( G , Ω ) G } need not be a soft primal on Y with a set of parameters Δ in general. The next example confirms this fact.
Example 3.
Let Y = { y 1 , y 2 } with a set of parameters Δ = { δ 1 , δ 2 } , and Z = { z 1 , z 2 } with a set of parameters Ω = { ω 1 , ω 2 } . Now consider the mappings h : Y Z and π : Δ Ω are defined as follows
h ( y ) = z 1   for   each   y Y ;   and   π ( δ i ) = ω i   for   each   δ i Δ
Let G = S ( Z Ω ) \ { Z ~ } be a soft primal on Z with Ω . Now, ( F , Ω ) = { ( ω 1 , { z 1 } ) , ( ω 2 , { z 1 } ) } be a soft set in G , so { h π 1 ( G , Ω ) : ( G , Ω ) G } is not a soft primal on Y with Δ because h π 1 ( F , Ω ) = Y ~ , which is not a member of any soft primal on Y with Δ .
Theorem 4.
Let h π : S ( Y Δ ) S ( Z Ω ) be an injective soft mapping. If G is a soft primal on Z with a set of parameters Ω , then the class Ψ = { h π 1 ( G , Ω ) : ( G , Ω ) G } \ { Y ~ } is a soft primal on Y with a set of parameters Δ .
Proof. 
According to the way of building Ψ , Y ~ Ψ , let ( W , Δ ) be a non-null soft set in Ψ . Then, there exits a soft subset ( G , Ω ) in G such that ( W , Δ ) = h π 1 ( G , Ω ) Y ~ . Take any soft subset ( U , Δ ) of h π 1 ( G , Ω ) , we obtain h π ( U , Δ ) ~ h π ( h π 1 ( G , Ω ) ) ~ ( G , Ω ) . This means that h π ( U , Δ ) G , and by the injectiveness of h π , we get h π 1 ( h π ( U , Δ ) ) = ( U , Δ ) , i.e., ( U , Δ ) is a proper soft subset of Y ~ . Thus, ( U , Δ ) Ψ , which means that Ψ is closed under subset relation. Finally, let ( U , Δ ) ~ ( V , Δ ) be an element of Ψ . This implies that there exists ( H , Ω ) G such that ( U , Δ ) ~ ( V , Δ ) = h π 1 ( H , Ω ) Y ~ . By the injectiveness of h π , we get h π ( U , Δ ) ~ h π ( V , Δ ) = h π ( h π 1 ( H 1 , Ω ) ) ~ ( H , Ω ) , which automatically means that h π ( U , Δ ) ~ h π ( V , Δ ) G . By the third condition of the soft primal, h π ( U , Δ ) G or h π ( V , Δ ) G . Again, by the injectiveness of h π we get h π 1 ( h π ( U , Δ ) ) = ( U , Δ ) Y ~ or h π 1 ( h π ( V , Δ ) ) = ( V , Δ ) Y ~ . Thus, h π 1 ( h π ( U , Δ ) ) Ψ or h π 1 ( h π ( V , Δ ) ) Ψ , which ends the proof. □
Corollary 2.
Let h π : S ( Y Δ ) S ( Z Ω ) be a bijective soft mapping. If G is a soft primal on Z with a set of parameters Ω , then the class Ψ = { h π 1 ( G , Ω ) : ( G , Ω ) G } is a soft primal on Y with a set of parameters Δ .
Proof. 
Since h π is surjective, h π 1 ( H , Ω ) = Y ~ iff ( H , Ω ) = Z ~ . This means that Z ~ G , so Y ~ Ψ . The second and third stipulations of the soft primal are derived following a similar argument to the above proof. □
It is easy to prove the proposition below.
Proposition 3.
Let h π : S ( Y Δ ) S ( Z Ω ) be a bijective soft mapping. If G is a soft primal on Y with a set of parameters Δ , then the class Ψ = { h π ( G , Ω ) : ( G , Ω ) G } is a soft primal on Z with a set of parameters Ω .

4. Primal Soft Topology

Herein, we first initiate the concept of primal soft topological spaces. Then, we define a soft operator ( · ) using the elements of the soft topology and soft primal. We scrutinize its essential characterizations and infer some of its relationships associated with soft topological closure operators. Afterwards, we introduce a soft operator C l inspired by the previous soft operator ( · ) and apply this to produce a new soft topology (called primal soft topology) finer than the original soft topology. Finally, we display a soft operator ( · ) and elucidate its essential features.
Definition 16.
The quadruple ( Y , Θ , Δ , F ) is said to be a primal soft topological space (briefly, PSTS), where ( Y , Θ , Δ ) is a soft topological space and F is a soft primal on Y.
Definition 17.
Let ( Y , Θ , Δ , F ) be a PSTS. Then, a soft mapping ( · ) : S ( Y Δ ) S ( Y Δ ) is defined as follows, ( G , Δ ) ( Y , Θ , Δ , F ) = { y λ Y ~ : ( G c , Δ ) ~ ( U c , Δ ) F for each ( U , Δ ) Θ ( y λ ) } for each soft subset ( G , Δ ) . In brief, we write ( G , Δ ) or ( G , Δ ) F instead of ( G , Δ ) ( Y , Θ , Δ , F ) .
The next example elucidates that the properties ( G , Δ ) ~ ( G , Δ ) and ( G , Δ ) ~ ( G , Δ ) are false in general.
Example 4.
Take a soft primal F displayed in Example 2 and let Θ = { ϕ ~ , Y ~ , ( F 6 , Δ ) , ( F 10 , Δ ) } be a soft topology on a set Y with Δ . One can check that ( F 6 , Δ ) ~ ( F 6 , Δ ) = ϕ ~ . On the other hand, ( F 1 , Δ ) = ( F 10 , Δ ) ~ ( F 1 , Δ ) .
In the following theorem, we provide the main properties of a soft mapping ( · ) , which will be helpful to prove some results given later.
Theorem 5.
Let ( F , Δ ) and ( G , Δ ) be soft subsets of a PSTS ( Y , Θ , Δ , F ) . Then, the next statements hold true.
 (i) 
ϕ ~ = ϕ ~ .
 (ii) 
C l ( ( F , Δ ) ) = ( F , Δ ) .
 (iii) 
If ( F c Δ ) F , then ( F , Δ ) = ϕ ~ .
 (iv) 
If ( F , Δ ) Θ c , then ( F , Δ ) ~ ( F , Δ ) .
 (v) 
If ( F , Δ ) ~ ( G , Δ ) , then ( F , Δ ) ~ ( G , Δ ) .
 (vi) 
( ( F , Δ ) ) ~ ( F , Δ ) .
 (vii) 
[ ( F , Δ ) ~ ( G , Δ ) ] = ( F , Δ ) ~ ( G , Δ ) .
 (viii) 
[ ( F , Δ ) ~ ( G , Δ ) ] ~ ( F , Δ ) ~ ( G , Δ ) .
Proof. 
 (i) 
Since ϕ ~ c ~ ( F , Δ ) = Y ~ for any soft set ( F , Δ ) and Y ~ F , so ϕ ~ shall be null.
 (ii) 
If y λ C l ( ( F , Δ ) ) and any ( H , Δ ) Θ ( y λ ) , then ( F , Δ ) ~ ( H , Δ ) ϕ ~ . One find z μ Y ~ such that z μ ( F , Δ ) ~ ( H , Δ ) . Therefore, ( F c , Δ ) ~ ( W c , Δ ) F for all ( W , Δ ) Θ ( z μ ) . This means that ( F c , Δ ) ~ ( H c , Δ ) F and so y λ ( F , Δ ) . Hence, C l ( ( F , Δ ) ) ~ ( F , Δ ) . The reverse of the inclusion is always true. Thus, C l ( ( F , Δ ) ) = ( F , Δ ) .
 (iii) 
Suppose otherwise that there exists y λ Y ~ such that y λ ( F , Δ ) . Then, ( F c , Δ ) ~ ( H c , Δ ) F for each ( H , Δ ) Θ . However, since ( F c Δ ) F , by Proposition 2, ( F c , Δ ) ~ ( H c , Δ ) F for some ( H , Δ ) Θ —a contradiction. Thus, ( F , Δ ) = ϕ ~ .
 (iv) 
Suppose that ( F , Δ ) Θ c . Let y λ ( F , Δ ) . Assume y λ ( F , Δ ) . Then ( F c , Δ ) Θ ( y λ ) . Since y λ ( F , Δ ) , so ( F c , Δ ) ~ ( H c , Δ ) F for each ( H , Δ ) Θ ( y λ ) . This concludes that Y ~ = ( F , Δ ) ~ ( F c , Δ ) = ( ( F c ) c , Δ ) ~ ( F c , Δ ) F , a contradiction. Thus, ( F , Δ ) ~ ( F , Δ ) .
 (v) 
Assume that ( F , Δ ) ~ ( G , Δ ) . If y λ ( F , Δ ) , then ( F c , Δ ) ~ ( H c , Δ ) F for all ( H , Δ ) Θ ( y λ ) . Since ( F , Δ ) ~ ( G , Δ ) , so ( G c , Δ ) ~ ( H c , Δ ) F . Hence, y λ ( G , Δ ) and thus, ( F , Δ ) ~ ( G , Δ ) .
 (vi) 
By (ii), ( F , Δ ) Θ c , so ( ( F , Δ ) ) c Θ . Therefore, ( ( F , Δ ) ) ~ ( F , Δ ) .
 (vii) 
Since ( F , Δ ) ~ ( F , Δ ) ~ ( G , Δ ) and ( G , Δ ) ~ ( F , Δ ) ~ ( G , Δ ) , then, by (iv), ( F , Δ ) ~ [ ( F , Δ ) ~ ( G , Δ ) ] and ( G , Δ ) ~ [ ( F , Δ ) ~ ( G , Δ ) ] . It follows that ( F , Δ ) ~ ( G , Δ ) ~ [ ( F , Δ ) ~ ( G , Δ ) ] . For the converse of the inclusion, if y λ ( F , Δ ) ~ ( G , Δ ) , then y λ ( F , Δ ) and y λ ( G , Δ ) . This implies that there exist ( H , Δ ) , ( W , Δ ) Θ ( y λ ) such that ( F c , Δ ) ~ ( H c , Δ ) F and ( G c , Δ ) ~ ( W c , Δ ) F . Set ( R , Δ ) = ( H , Δ ) ~ ( W , Δ ) . Then ( R , Δ ) Θ ( y λ ) for which ( F c , Δ ) ~ ( R c , Δ ) F and ( G c , Δ ) ~ ( R c , Δ ) F (from Proposition 2). Since F is soft primal, we get that [ ( F , Δ ) ~ ( G , Δ ) ] c ~ ( R c , Δ ) = ( F c , Δ ) ~ ( G c , Δ ) ~ ( R c , Δ ) = ( F c , Δ ) ~ ( R c , Δ ) ~ ( G c , Δ ) ~ ( R c , Δ ) F . Thus, y λ [ ( F , Δ ) ~ ( G , Δ ) ] . Consequently, [ ( F , Δ ) ~ ( G , Δ ) ] = ( F , Δ ) ~ ( G , Δ ) .
 (viii) 
Since ( F , Δ ) ~ ( G , Δ ) ~ ( F , Δ ) and ( F , Δ ) ~ ( G , Δ ) ~ ( G , Δ ) , then, by (iv), [ ( F , Δ ) ~ ( G , Δ ) ] ~ ( F , Δ ) and [ ( F , Δ ) ~ ( G , Δ ) ] ~ ( G , Δ ) . Therefore, [ ( F , Δ ) ~ ( G , Δ ) ] ~ ( F , Δ ) ~
( G , Δ ) .
As illustrated below, it may not always be possible to achieve the equality of (viii) in Theorem 5.
Example 5.
Consider the Y , Δ , F , ( F 1 , Δ ) , and ( F 9 , Δ ) given in Example 2. Let Θ = { ϕ ~ , Y ~ } . Obviously, [ ( F 1 , Δ ) ~ ( F 9 , Δ ) ] = ϕ ~ . On the other hand, ( F 1 , Δ ) ~ ( F 9 , Δ ) = Y ~ .
Theorem 6.
Let ( F , Δ ) and ( G , Δ ) be soft subsets of a PSTS ( Y , Θ , Δ , F ) such that ( F , Δ ) is soft open. Then, ( F , Δ ) ~ ( G , Δ ) ~ [ ( F , Δ ) ~ ( G , Δ ) ] .
Proof. 
Given ( F , Δ ) , ( G , Δ ) S ( Y Δ ) such that ( F , Δ ) Θ . If y λ ( F , Δ ) ~ ( G , Δ ) , then y λ ( F , Δ ) and y λ ( G , Δ ) , and so ( G c , Δ ) ~ ( H c , Δ ) F for all ( H , Δ ) Θ ( y λ ) . Since ( F , Δ ) Θ ( y λ ) , then ( G c , Δ ) ~ [ ( H , Δ ) ~ ( F , Δ ) ] c F . However, ( G c , Δ ) ~ [ ( H , Δ ) ~ ( F , Δ ) ] c = [ ( F , Δ ) ~ ( G , Δ ) ] c ~ ( H c , Δ ) , so it implies that y λ [ ( F , Δ ) ~ ( G , Δ ) ] . Hence, ( F , Δ ) ~ ( G , Δ ) ~ [ ( F , Δ ) ~ ( G , Δ ) ] . □
Theorem 7.
Let ( Y , Θ , Δ , F ) be a PSTS. If Θ c ~ F , then ( G , Δ ) ~ ( G , Δ ) for each ( G , Δ ) Θ .
Proof. 
Since ϕ ~ = ϕ ~ , clearly ϕ ~ ~ ϕ ~ . Next, we need to find Y ~ . Since Θ c ~ F , then we must have Y ~ = Y ~ . Indeed, if for some y λ Y ~ , y λ Y ~ . Therefore, there exists ( H , Δ ) Θ ( x λ ) such that ( H c , Δ ) = ( H c , Δ ) ~ Y ~ c F , a contradiction. If ( G , Δ ) Θ , by Theorem 6, ( G , Δ ) = ( G , Δ ) ~ Y ~ ~ [ ( G , Δ ) ~ Y ~ ] = ( G , Δ ) . This leads to the result. □
Theorem 8.
Let ( F , Δ ) and ( G , Δ ) be soft subsets of a PSTS ( Y , Θ , Δ , F ) . Then, ( F , Δ ) \ ( G , Δ ) = [ ( F , Δ ) \ ( G , Δ ) ] \ ( G , Δ ) .
Proof. 
Consider the decomposition
( F , Δ ) = [ ( F , Δ ) \ ( G , Δ ) ] ~ [ ( F , Δ ) ~ ( G , Δ ) ] .
Then applying Theorem 5 (v) and (vii) to it, we obtain
( F , Δ ) = [ ( F , Δ ) \ ( G , Δ ) ] ~ [ ( F , Δ ) ~ ( G , Δ ) ] ~ [ ( F , Δ ) \ ( G , Δ ) ] ~ ( G , Δ ) .
Therefore, ( F , Δ ) \ ( G , Δ ) ~ [ ( F , Δ ) \ ( G , Δ ) ] \ ( G , Δ ) .
On the other hand, since ( F , Δ ) \ ( G , Δ ) ~ ( F , Δ ) , by Theorem 5 (v), [ ( F , Δ ) \ ( G , Δ ) ] ~ ( F , Δ ) and so, [ ( F , Δ ) \ ( G , Δ ) ] \ ( G , Δ ) ~ ( F , Δ ) \ ( G , Δ ) . Summing up the obtained inclusions, we get ( F , Δ ) \ ( G , Δ ) = [ ( F , Δ ) \ ( G , Δ ) ] \ ( G , Δ ) . □
Theorem 9.
Let ( F , Δ ) and ( G , Δ ) be soft subsets of a PSTS ( Y , Θ , Δ , F ) such that ( G c Δ ) F . Then, [ ( F , Δ ) ~ ( G , Δ ) ] = ( F , Δ ) = [ ( F , Δ ) \ ( G , Δ ) ] .
Proof. 
This follows from Theorems 5 and 8. □
Definition 18.
Let ( Y , Θ , Δ , F ) be a PSTS. Then, a soft mapping C l : S ( Y Δ ) S ( Y Δ ) is defined as follows C l ( G , Δ ) = ( G , Δ ) ~ ( G , Δ ) for any soft subset ( G , Δ ) .
Theorem 10.
Let ( F , Δ ) and ( G , Δ ) be soft subsets of a PSTS ( Y , Θ , Δ , F ) . Then, the next statements hold true.
 (i) 
C l ( ϕ ~ ) = ϕ ~ .
 (ii) 
C l ( Y ~ ) = Y ~ .
 (iii) 
( F , Δ ) ~ C l ( F , Δ ) .
 (iv) 
If ( F , Δ ) ~ ( G , Δ ) , then C l ( F , Δ ) ~ C l ( G , Δ ) .
 (v) 
C l [ ( F , Δ ) ~ ( G , Δ ) ] = C l ( F , Δ ) ~ C l ( G , Δ ) .
 (vi) 
C l ( C l ( F , Δ ) = C l ( F , Δ ) .
Proof. 
 (i) 
Since ϕ ~ = ϕ ~ , so C l ( ϕ ~ ) = ϕ ~ ~ ϕ ~ = ϕ ~ .
 (ii) 
This is clear as C l ( Y ~ ) = Y ~ ~ Y ~ = Y ~ .
 (iii) 
This is also easy as ( F , Δ ) ~ ( F , Δ ) ~ ( F , Δ ) = C l ( F , Δ ) .
 (iv) 
Suppose ( F , Δ ) , ( G , Δ ) S ( Y Δ ) with ( F , Δ ) ~ ( G , Δ ) . By Theorem 5 (v), ( F , Δ ) ~ ( G , Δ ) and so ( F , Δ ) ~ ( F , Δ ) ~ ( G , Δ ) ~ ( G , Δ ) . Thus, C l ( F , Δ ) ~ C l ( G , Δ ) .
 (v) 
By the same technique used in (iv) and applying Theorem 5 (vii), one can easily conclude that C l [ ( F , Δ ) ~ ( G , Δ ) ] = C l ( F , Δ ) ~ C l ( G , Δ ) .
 (vi) 
To show that C l ( C l ( F , Δ ) ~ C l ( F , Δ ) , we implicitly use multiple statements of Theorem 5. Now,
C l ( C l ( F , Δ ) = C l ( F , Δ ) ~ ( C l ( F , Δ ) ) = C l ( F , Δ ) ~ [ ( F , Δ ) ~ ( F , Δ ) ] = C l ( F , Δ ) ~ ( F , Δ ) ~ ( ( F , Δ ) ) ~ C l ( F , Δ ) ~ ( F , Δ ) ~ ( F , Δ ) = C l ( F , Δ ) .
The converse is always true by using (iii). Therefore, C l ( C l ( F , Δ ) = C l ( F , Δ ) . □
Theorem 11.
Let ( F , Δ ) be a soft subset of a PSTS ( Y , Θ , Δ , F ) . If ( F , Δ ) ~ ( F , Δ ) , then C l ( F , Δ ) = C l ( F , Δ ) = C l ( ( F , Δ ) ) = ( F , Δ ) .
Proof. 
We first prove that C l ( F , Δ ) = C l ( F , Δ ) . Since by Theorem 14, Θ ~ Θ , then C l ( F , Δ ) ~ C l ( F , Δ ) . Let y λ C l ( F , Δ ) . Then, we can find ( H , Δ ) Θ ( y λ ) and ( R , Δ ) F containing y λ such that [ ( H , Δ ) ~ ( R , Δ ) ] ~ ( F , Δ ) = ϕ ~ . Then, [ [ ( H , Δ ) ~ ( R , Δ ) ] ~ ( F , Δ ) ] = ϕ ~ and so, [ [ ( H , Δ ) ~ ( F , Δ ) ] \ ( R c , Δ ) ] = ϕ ~ . By Theorem 9, [ ( H , Δ ) ~ ( F , Δ ) ] = ϕ ~ , and hence by Theorem 6, ( H , Δ ) ~ ( F , Δ ) = ϕ ~ . Since ( F , Δ ) ~ ( F , Δ ) , then ( H , Δ ) ~ ( F , Δ ) = ϕ ~ implies y λ C l ( F , Δ ) . This proves that C l ( F , Δ ) = C l ( F , Δ ) . Then, Theorem 5 (ii) shows that C l ( ( F , Δ ) ) = ( F , Δ ) . Now, if y λ C l ( F , Δ ) , then one can find ( W , Δ ) Θ ( y λ ) such that ( F , Δ ) ~ ( W , Δ ) = ϕ ~ . This means that [ ( F , Δ ) ~ ( W , Δ ) ] c = Y ~ F and thus, y λ ( F , Δ ) . Hence, ( F , Δ ) ~ C l ( F , Δ ) and so, C l ( ( F , Δ ) ) ~ C l ( C l ( F , Δ ) ) = C l ( F , Δ ) . On the other hand, since ( F , Δ ) ~ ( F , Δ ) , then C l ( F , Δ ) ~ C l ( ( F , Δ ) ) . Therefore, C l ( F , Δ ) = C l ( ( F , Δ ) ) = ( F , Δ ) . □
Theorem 12.
Let ( Y , Θ , Δ , F ) be a PSTS. Then, a soft mapping C l : S ( Y Δ ) S ( Y Δ ) given by C l ( G , Δ ) = ( G , Δ ) ~ ( G , Δ ) for any soft subset ( G , Δ ) is a Kuratowski’s soft closure operator.
Proof. 
Theorem 10 guarantees that C l satisfies all the postulates in Definition 12. Thus, C l is a Kuratowski’s soft closure operator. □
Theorem 13.
Let ( Y , Θ , Δ , F ) be a PSTS. Then, the family Θ = { ( G , Δ ) ~ Y ~ : C l ( G c , Δ ) = ( G c , Δ ) } forms a soft topology on Y.
Proof. 
It follows from Theorem 1 in [43]. □
Definition 19.
We call a soft topology Θ produced by the above theorem a primal soft topology. If it is necessary, we write Θ F instead of Θ .
The following examples demonstrate that the set of primal topologies forms a natural class in the lattice of topologies over a universal set.
Example 6.
Let ( Y , Θ i n d , Δ ) be the indiscrete soft topological space, where Y is any set containing more than one point and Δ is any set of parameters, and let y λ 0 Y ~ . Suppose F = { ( F , Δ ) : ( F , Δ ) S ( Y Δ ) , y λ 0 ( F , Δ ) } . Then, F meets all the axioms mentioned in Definition 15, so it is a soft primal. Given any ( R , Δ ) S ( Y Δ ) . If ( R , Δ ) F , then ( R , Δ ) = ϕ ~ . If ( R , Δ ) F , then ( R , Δ ) = Y ~ . Therefore, each soft set excluding y λ 0 is a soft Θ -closed set together with Y ~ . Therefore, Θ = Θ i n c , where Θ i n c = { ( G , Δ ) : ( G , Δ ) S ( Y Δ ) , y λ 0 ( G , Δ ) } ~ { ϕ ~ } (it is called included soft point topology in Example 2 in [42]).
Example 7.
Let Δ be a set of parameters. If Θ is the soft topology on the set of real numbers R generated by
( ( p , q ) , Δ ) ; p , q R ; p < q
, let F be the family of countable soft subsets of R ~ . Obviously, F is a soft primal. For any soft set ( R , Δ ) over Y, if ( R , Δ ) is in F or not, then one can easily check that ( R , Δ ) = ϕ ~ . Therefore, all soft subsets of Y ~ are soft Θ -closed sets. Hence, Θ = S ( Y Δ ) is the discrete soft topology.
Theorem 14.
Let ( Y , Θ , Δ , F ) be a PSTS. Then, a primal soft topology Θ is finer than a soft topology Θ .
Proof. 
If ( G , Δ ) Θ , then ( G c , Δ ) Θ c . By Theorem 5 (iv), ( G c , Δ ) ~ ( G c , Δ ) . Therefore, C l ( G c , Δ ) = ( G c , Δ ) ~ ( G c , Δ ) ~ ( G c , Δ ) . On the other hand, ( G c , Δ ) ~ C l ( G c , Δ ) is always correct. Consequently, C l ( G c , Δ ) = ( G c , Δ ) and so, ( G , Δ ) Θ . Hence, Θ ~ Θ . □
Theorem 15.
For any PSTS ( Y , Θ , Δ , F ) , the next results hold.
 (i) 
If F = ϕ ~ , then Θ = S ( Y Δ ) .
 (ii) 
If F = S ( Y Δ ) \ { Y ~ } , then Θ = Θ .
Proof. 
 (i) 
Let F = ϕ ~ . It suffices to show that S ( Y Δ ) ~ Θ . Indeed, the converse is correct. Let ( G , Δ ) S ( Y Δ ) . By assumption, ( G , Δ ) = ϕ ~ for all ( G , Δ ) S ( Y Δ ) . Hence, C l ( G c Δ ) = ( G c Δ ) . By Theorem 13, ( G c , Δ ) Θ . This proves that Θ = S ( Y Δ ) .
 (ii) 
We only need to show that Θ ~ Θ . The reverse of the inclusion follows from Theorem 14. Let ( G , Δ ) Θ . Then ( G c , Δ ) = C l ( G c , Δ ) = ( G c , Δ ) ~ ( G c , Δ ) . Therefore, ( G c , Δ ) ~ ( G c , Δ ) . Let y λ Y ~ such that y λ ( G c , Δ ) . Clearly, y λ ( G c , Δ ) and so, there is a ( H , Δ ) Θ ( y λ ) such that ( H c , Δ ) ~ ( ( G c ) c , Δ ) = ( H c , Δ ) ~ ( G , Δ ) F . Since F = S ( Y Δ ) \ { Y ~ } , so ( H c , Δ ) ~ ( G , Δ ) must equal Y ~ and hence, ( H , Δ ) ~ ( G c , Δ ) = ϕ ~ . This implies that y λ C l ( G c , Δ ) . Therefore, we obtain that C l ( G c , Δ ) ~ ( G c , Δ ) . This proves that ( G c , Δ ) Θ c . Thus, ( G , Δ ) Θ and so Θ = Θ .
Theorem 16.
Let ( G , Δ ) be a soft subset of a PSTS ( Y , Θ , Δ , F ) . Then, the next results hold.
 (i) 
( G , Δ ) Θ iff for any y λ ( G , Δ ) , there exists ( H , Δ ) Θ ( y λ ) such that ( H c , Δ ) ~ ( G , Δ ) F .
 (ii) 
If ( G , Δ ) F , then ( G , Δ ) Θ .
Proof. 
 (i) 
If ( G , Δ ) Θ , then ( G c , Δ ) = C l ( G c , Δ ) = ( G c , Δ ) ~ ( G c , Δ ) , and so ( G c , Δ ) ~ ( G c , Δ ) . Therefore, ( G , Δ ) ~ ( ( G c , Δ ) ) c . This means that for any y λ ( G , Δ ) , y λ ( G c , Δ ) , and so there exists ( H , Δ ) Θ ( y λ ) such that ( H c , Δ ) ~ ( ( G c ) c , Δ ) = ( H c , Δ ) ~ ( G , Δ ) F . The claim follows.
The converse can be concluded by reversing the above steps.
 (ii) 
Let ( G , Δ ) F and let y λ ( G , Δ ) . Then, there exists always the soft open set Y ~ containing y λ such that ( G , Δ ) ~ Y ~ c = ( G , Δ ) F . By (i), we obtain that ( G , Δ ) Θ .
Theorem 17.
Let ( Y , Θ , Δ , F ) be a PSTS. Then, the family
B F = { ( G , Δ ) ~ ( F , Δ ) : ( G , Δ ) Θ and ( F , Δ ) F }
is a soft base for the primal soft topology Θ on Y.
Proof. 
We first need to check that B F ~ Θ . If ( B , Δ ) B F , then ( B , Δ ) = ( G , Δ ) ~ ( F , Δ ) for some ( G , Δ ) Θ and ( F , Δ ) F . Since, by Theorem 14, Θ ~ Θ , so ( G , Δ ) Θ . By Theorem 16 (ii), ( F , Δ ) Θ and therefore, ( B , Δ ) Θ . We now show that B F is a soft base. Let y λ Y ~ and ( G , Δ ) Θ ( y λ ) . By Theorem 16 (i), there exists ( H , Δ ) Θ ( y λ ) such that ( H c , Δ ) ~ ( G , Δ ) F . Set ( B , Δ ) = ( H , Δ ) ~ [ ( H c , Δ ) ~ ( G , Δ ) ] . Indeed, y λ ( B , Δ ) ~ ( G , Δ ) . Thus, B F is a soft base for Θ . □
Theorem 18.
Let ( Y , Θ , Δ , F ) and ( Y , Θ , Δ , G ) be two PSTSs such that F ~ G . Then Θ G Θ F .
Proof. 
If ( F , Δ ) Θ G , then ( F c , Δ ) = ( F c , Δ ) ~ ( F c , Δ ) G implies ( F c , Δ ) G ~ ( F c , Δ ) . Assume that y λ Y ~ such that y λ ( F c , Δ ) . Then y λ ( F c , Δ ) G and hence, there exists ( H , Δ ) Θ ( y λ ) such that ( H c , Δ ) ~ ( F , Δ ) G . Since F ~ G , so ( H c , Δ ) ~ ( F , Δ ) F and hence, y λ ( F c , Δ ) F . Therefore, ( F c , Δ ) F ~ ( F c , Δ ) . This implies that C l ( F c , Δ ) = ( F c , Δ ) ~ ( F c , Δ ) F = ( F c , Δ ) and thus, ( F , Δ ) Θ F . This proves that Θ G Θ F . □
Now, we look at a new operator and explore its major properties.
Definition 20.
Let ( Y , Θ , Δ , F ) be a PSTS. Then, a soft mapping ( · ) : S ( Y Δ ) S ( Y Δ ) is defined as follows ( F , Δ ) ( Y , Θ , Δ , F ) = { y λ Y ~ : [ ( G , Δ ) \ ( F , Δ ) ] c F for some ( G , Δ ) Θ ( y λ ) } for each soft subset ( F , Δ ) over Y. In brief, we write ( F , Δ ) or ( F , Δ ) F instead of ( F , Δ ) ( Y , Θ , Δ , F ) .
We shall remark that neither ( G , Δ ) ~ ( G , Δ ) nor ( G , Δ ) ~ ( G , Δ ) are generally correct, and counterexamples are not difficult to obtain.
The following conclusions cover a number of fundamental characteristics of how the operator behaves.
Theorem 19.
Let ( F , Δ ) be a soft subset of a PSTS ( Y , Θ , Δ , F ) . Then
( F , Δ ) = Y ~ \ ( F c , Δ ) .
Proof. 
If y λ ( F , Δ ) , then there exists ( H , Δ ) Θ such that [ ( H , Δ ) \ ( F , Δ ) ] c F . But [ ( H , Δ ) \ ( F , Δ ) ] c = [ ( H , Δ ) ~ ( F c , Δ ) ] c = ( H c , Δ ) ~ ( F , Δ ) implies y λ ( F c , Δ ) . Therefore, y λ Y ~ \ ( F c , Δ ) .
The converse can be followed by reversing the earlier steps. □
The next consequence is a direct outcome of the preceding conclusion.
Corollary 3.
For any soft subset ( F , Δ ) of a PSTS ( Y , Θ , Δ , F ) , we have
 (i) 
( F c , Δ ) = [ ( F , Δ ) ] c .
 (ii) 
[ ( F , Δ ) ] c = ( F c , Δ ) .
 (iii) 
( F c , Δ ) = [ ( F , Δ ) ] c .
 (iv) 
[ ( F , Δ ) ] c = ( F c , Δ ) .
Lemma 1.
For a soft subset ( F , Δ ) of a PSTS ( Y , Θ , Δ , F ) , ( F , Δ ) Θ .
Proof. 
Let ( F , Δ ) be a soft subset of a PSTS ( Y , Θ , Δ , F ) . By Theorems 5 (ii) and 19, ( F , Δ ) = Y ~ \ ( F c , Δ ) = Y ~ \ C l ( ( F c , Δ ) ) . Since C l ( ( F c , Δ ) ) is soft Θ -closed, therefore ( F , Δ ) Θ . □
Theorem 20.
Let ( F , Δ ) , ( G , Δ ) be soft subset of a PSTS ( Y , Θ , Δ , F ) . Then,
 (i) 
Y ~ = Y ~ .
 (ii) 
( F , Δ ) ~ ( F , Δ ) .
 (iii) 
If ( F , Δ ) ~ ( G , Δ ) , then ( F , Δ ) ~ ( G , Δ ) .
 (iv) 
[ ( F , Δ ) ~ ( G , Δ ) ] = ( F , Δ ) ~ ( G , Δ ) .
 (v) 
( F , Δ ) ~ ( G , Δ ) ~ [ ( F , Δ ) ~ ( G , Δ ) ] .
Proof. 
 (i) 
Applying Theorem 19 to Y ~ , we have Y ~ = Y ~ \ [ Y ~ c ] = Y ~ \ [ ϕ ~ ] = Y ~ \ ϕ ~ = Y ~ .
 (ii) 
Let y λ ( F , Δ ) . By Theorem 19, y λ ( F c , Δ ) and then, by Theorem 5 (vi), y λ ( F c , Δ ) . From (iv) in Corollary 3, we obtain that y λ [ ( F , Δ ) ] c implies y λ ( F , Δ ) . Thus, ( F , Δ ) ~ ( F , Δ ) .
 (iii) 
Let y λ ( F , Δ ) . Then [ ( H , Δ ) \ ( F , Δ ) ] c F for some ( H , Δ ) Θ . Since ( F , Δ ) ~ ( G , Δ ) , then [ ( H , Δ ) \ ( F , Δ ) ] ~ [ ( H , Δ ) \ ( G , Δ ) ] and so [ ( H , Δ ) \ ( F , Δ ) ] c ~ [ ( H , Δ ) \ ( G , Δ ) ] c . By Proposition 2, [ ( H , Δ ) \ ( G , Δ ) ] c F . This means that y λ ( G , Δ ) . Thus, ( F , Δ ) ~ ( G , Δ ) .
 (iv) 
Since ( F , Δ ) ~ ( G , Δ ) ~ ( F , Δ ) and ( F , Δ ) ~ ( G , Δ ) ~ ( G , Δ ) , then by (iii), [ ( F , Δ ) ~ ( G , Δ ) ] ~ ( F , Δ ) and [ ( F , Δ ) ~ ( G , Δ ) ] ~ ( G , Δ ) . Therefore, [ ( F , Δ ) ~ ( G , Δ ) ] ~ ( F , Δ ) ~ ( G , Δ ) . To prove the converse, we let y λ ( F , Δ ) ~ ( G , Δ ) . Then [ ( H , Δ ) \ ( F , Δ ) ] c F and [ ( W , Δ ) \ ( G , Δ ) ] c F for some ( H , Δ ) , ( W , Δ ) Θ ( y λ ) . Set ( R , Δ ) = ( H , Δ ) ~ ( W , Δ ) . Then ( R , Δ ) Θ ( y λ ) and, by Proposition 2, we have [ ( R , Δ ) \ ( F , Δ ) ] c F and [ ( R , Δ ) \ ( G , Δ ) ] c F . This implies that ( R , Δ ) \ [ ( F , Δ ) ~ ( G , Δ ) ] c = [ ( R , Δ ) \ ( F , Δ ) ] c ~ [ ( R , Δ ) \ ( G , Δ ) ] c F . Thus, y λ [ ( F , Δ ) ~ ( G , Δ ) ] and hence, ( G , Δ ) ~ ( G , Δ ) ~ [ ( F , Δ ) ~ ( G , Δ ) ] . This completes the proof.
 (v) 
This matches the first part of the proof of (iv).
Theorem 21.
Let ( F , Δ ) , ( G , Δ ) be soft subsets of a PSTS ( Y , Θ , Δ , F ) such that ( F c , Δ ) F . The following conclusions hold true:
 (i) 
( F , Δ ) = Y ~ \ Y ~ .
 (ii) 
[ ( G , Δ ) \ ( F , Δ ) ] = ( G , Δ ) .
 (iii) 
[ ( G , Δ ) ~ ( F , Δ ) ] = ( G , Δ ) .
Proof. 
 (i) 
Since ( F c , Δ ) F , by Theorem 9, ( F c , Δ ) = Y ~ . Therefore, ( F , Δ ) = Y ~ \ ( F c , Δ ) = Y ~ \ Y ~ .
 (ii) 
Now, by the use of Theorem 9, we can get [ ( G , Δ ) \ ( F , Δ ) ] = Y ~ \ ( [ ( G , Δ ) \ ( F , Δ ) ] c ) = Y ~ \ [ ( G c , Δ ) ~ ( F , Δ ) ] = Y ~ \ ( G c , Δ ) = ( G , Δ ) .
 (iii) 
Similar to (ii).
Definition 21.
Let ( G , Δ ) be a soft subset of a PSTS ( Y , Θ , Δ , F ) and let Θ be the primal soft topology on Y. A soft point y λ is called a soft Θ -interior point of ( G , Δ ) if there exists ( H , Δ ) Θ such that y λ ( H , Δ ) ~ ( G , Δ ) . The set of all soft Θ -interior points of ( G , Δ ) is symbolized by I n t ( G , Δ ) .
Theorem 22.
Let ( F , Δ ) be a soft subset of a PSTS ( Y , Θ , Δ , F ) . Then ( F , Δ ) ~ ( F , Δ ) = I n t ( F , Δ ) .
Proof. 
Let y λ ( F , Δ ) ~ ( F , Δ ) . Then y λ ( F , Δ ) and [ ( H , Δ ) \ ( F , Δ ) ] c F for some ( H , Δ ) Θ ( y λ ) . By Theorem 17, ( D , Δ ) = ( H , Δ ) ~ [ ( H , Δ ) \ ( F , Δ ) ] c Θ such that y λ ( D , Δ ) ~ ( F , Δ ) . Thus, y λ I n t ( F , Δ ) .
On the other hand, suppose y λ I n t ( F , Δ ) . Then, there exists a basic soft Θ -open set ( W , Δ ) ~ ( R , Δ ) containing y λ , where ( W , Δ ) Θ ( y λ ) and ( R , Δ ) F , such that y λ ( W , Δ ) ~ ( R , Δ ) ~ ( F , Δ ) . This implies that ( R , Δ ) ~ [ ( W , Δ ) \ ( F , Δ ) ] c . By Proposition 2, [ ( W , Δ ) \ ( F , Δ ) ] c F . Therefore, y λ ( F , Δ ) ~ ( F , Δ ) . □
Theorem 23.
Let ( Y , Θ , Δ , F ) be a PSTS. The family
Ω = { ( F , Δ ) : ( F , Δ ) S ( Y Δ ) , ( F , Δ ) ~ ( F , Δ ) }
is a soft topology on Y. Furthermore, Ω = Θ .
Proof. 
Suppose Ω = { ( F , Δ ) : ( F , Δ ) S ( Y Δ ) , ( F , Δ ) ~ ( F , Δ ) } . We need first to prove that Ω is a soft topology. Clearly, ϕ ~ , Y ~ Ω as ϕ ~ ~ ϕ ~ and Y ~ ~ Y ~ = Y ~ . Let ( F , Δ ) , ( G , Δ ) Ω . By Theorem 20, ( F , Δ ) ~ ( G , Δ ) ~ ( F , Δ ) ~ ( G , Δ ) = [ ( F , Δ ) ~ ( G , Δ ) ] . Hence, ( F , Δ ) ~ ( G , Δ ) Ω . Let { ( F i , Δ ) : i I } ~ Ω . Again by Theorem 20, ( F i , Δ ) ~ ( F i , Δ ) ~ ( ~ i I ( F i , Δ ) ) for each i. Therefore, ~ i I ( F i , Δ ) ~ [ ~ i I ( F i , Δ ) ] and so ~ i I ( F i , Δ ) Ω .
We now show that Ω = Θ . If ( H , Δ ) Ω , then ( H , Δ ) ~ ( H , Δ ) and so, by Theorem 19, ( H , Δ ) ~ Y ~ \ ( H c , Δ ) implies ( H c , Δ ) ~ ( H c , Δ ) . This means that ( H c , Δ ) is soft Θ -closed, and thus ( H , Δ ) Θ . Now, let ( H , Δ ) Θ and y λ ( H , Δ ) . By Theorem 17, there exists ( W , Δ ) Θ ( y λ ) and ( F , Δ ) F such that y λ ( W , Δ ) ~ ( F , Δ ) ~ ( H , Δ ) . Evidently, ( F , Δ ) ~ [ ( W , Δ ) \ ( H , Δ ) ] c and then [ ( W , Δ ) \ ( H , Δ ) ] c F . Therefore, y λ ( H , Δ ) and so Θ ~ Ω . The conclusion follows. □
This concludes that
Corollary 4.
For a soft subset ( F , Δ ) of a PSTS ( Y , Θ , Δ , F ) , ( F , Δ ) ~ ( F , Δ ) whenever ( F , Δ ) Θ .

5. Conclusions and Future Work

Shabir and Naz [9] and Çağman et al. [10] demonstrated, separately, the concept of a soft topology on a universal set, which is an extension of the classical (crisp) topology. This topological generalization has grown to be an interesting area of study. Various methods of constructing soft topologies have appeared in the literature. We have made a new contribution to the field of soft topology by studying the concept of primal soft topology. This research is based on the soft primal, which is a complementary notion of a soft grill. Soft primals can be considered a generalization of soft ideals. We have discussed some basic operations on soft primals. A primal soft topological space is defined as a soft topological space along with a soft primal. Then, we have defined and investigated a soft operator, symbolized by , with respect to a soft topological space. The operator is used to define another soft topological operator called C l . Various properties of C l have been discussed. Among the properties, we have seen that C l conforms to all the axioms of the soft Kuratowski’s closure operator, so it naturally generates a soft topology called a primal soft topology. The uniqueness of the primal soft topology is guaranteed by Theorem 1 in [43]. Some examples have been offered to illustrate that primal soft topologies are natural (non-trivial) soft topologies. The primal soft topology is finer than the original soft topology. In addition, we have established the fundamental properties of primal soft topologies.
The results obtained in this paper are preliminary, and future research could give more insights by exploring further properties of the primal soft topology, such as primal soft interior, primal soft closure, primal soft limit points, etc. Additionally, the separation axioms, compactness, and connectedness of primal soft topologies are also possible lines of research on this topic. On the other hand, we applied ideal structures to set up some generalized rough approximation spaces for the purpose of improving approximation operators (lower and upper) and increasing the value of accuracy of the decision made; see [45]. This work opens up the door for possible contributions to this trend by combining primal structures with generalized rough approximation spaces in classical and soft settings.

Author Contributions

Conceptualization, T.M.A.-s.; methodology, T.M.A.-s. and Z.A.A.; formal analysis, T.M.A.-s., Z.A.A., R.A.-G. and A.M.; investigation, T.M.A.-s., Z.A.A., R.A.-G. and A.M.; writing—original draft preparation, T.M.A.-s. and Z.A.A.; writing—review and editing, T.M.A.-s. and Z.A.A.; funding acquisition, R.A.-G. and A.M. All authors have read and agreed to the published version of the manuscript.

Funding

This study is supported via funding from Prince Sattam bin Abdulaziz University project number (PSAU/2023/R/1444).

Data Availability Statement

No data were used to support this study.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Molodtsov, D. Soft set theory first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  2. Dalkılıç, O.; Demirtaş, N. Algorithms for COVID-19 outbreak using soft set theory: Estimation and application. Soft Comput. 2023, 27, 3203–3211. [Google Scholar] [CrossRef]
  3. Santos-García, G.; Alcantud, J.C.R. Ranked soft sets. Expert Syst. 2023, e13231. [Google Scholar] [CrossRef]
  4. Aktaş, H.; Çağman, N. Soft sets and soft groups. Inf. Sci. 2007, 177, 2726–2735. [Google Scholar] [CrossRef]
  5. Acar, U.; Koyuncu, F.; Tanay, B. Soft sets and soft rings. Comput. Math. Appl. 2010, 59, 3458–3463. [Google Scholar] [CrossRef]
  6. Sardar, S.K.; Gupta, S. Soft category theory—An introduction. J. Hyperstruct. 2013, 2, 118–135. [Google Scholar]
  7. Al-shami, T.M.; Ameen, Z.A.; Mhemdi, A. The connection between ordinary and soft σ-algebras with applications to information structures. AIMS Math. 2023, 8, 14850–14866. [Google Scholar] [CrossRef]
  8. Ameen, Z.A.; Al-shami, T.M.; Abu-Gdairi, R.; Mhemdi, A. The Relationship between Ordinary and Soft Algebras with an Application. Mathematics 2023, 11, 2035. [Google Scholar] [CrossRef]
  9. Shabir, M.; Naz, M. On soft topological spaces. Comput. Math. Appl. 2011, 61, 1786–1799. [Google Scholar] [CrossRef]
  10. Çağman, N.; Karataş, S.; Enginoglu, S. Soft topology. Comput. Math. Appl. 2011, 62, 351–358. [Google Scholar] [CrossRef]
  11. Bayramov, S.; Gunduz, C. A new approach to separability and compactness in soft topological spaces. TWMS J. Pure Appl. Math. 2018, 9, 82–93. [Google Scholar]
  12. Lin, F. Soft connected spaces and soft paracompact spaces. Int. J. Math. Comput. Sci. 2013, 7, 277–283. [Google Scholar]
  13. Aygünoğlu, A.; Aygün, H. Some notes on soft topological spaces. Neural Comput. Appl. 2012, 21, 113–119. [Google Scholar] [CrossRef]
  14. Asaad, B.A. Results on soft extremally disconnectedness of soft topological spaces. J. Math. Comput. Sci. 2017, 17, 448–464. [Google Scholar] [CrossRef]
  15. Al-Ghour, S. Between the classes of soft open sets and soft omega open sets. Mathematics 2022, 10, 719. [Google Scholar] [CrossRef]
  16. Al-shami, T.M.; Mhemdi, A.; Abu-Gdairid, R. A Novel framework for generalizations of soft open sets and its applications via soft topologies. Mathematics 2023, 11, 840. [Google Scholar] [CrossRef]
  17. Demir, İ. An approach to the concepts of soft vietoris topology. Int. J. Anal. Appl. 2016, 12, 198–206. [Google Scholar]
  18. Bayramov, S.; Aras, C.G.; Posul, H. A study on bipolar metric spaces. Filomat 2023, 37, 3217–3224. [Google Scholar]
  19. Al-shami, T.M.; Kočinac, L.D.R. Almost soft Menger and weakly soft Menger spaces. Appl. Comput. Math. 2022, 21, 35–51. [Google Scholar]
  20. El-Sheikh, S.; El-Latif, A.A. Decompositions of some types of supra soft sets and soft continuity. Int. J. Math. Trends Technol. 2014, 9, 37–56. [Google Scholar] [CrossRef]
  21. Thomas, J.; Johna, S.J. On soft generalized topological spaces. J. New Results Sci. 2014, 3, 1–15. [Google Scholar]
  22. Al-shami, T.M. New soft structure: Infra soft topological spaces. Math. Probl. Eng. 2021, 2021, 3361604. [Google Scholar] [CrossRef]
  23. Al-shami, T.M.; Abo-Tabl, E.-S.A. Connectedness and local connectedness on infra soft topological spaces. Mathematics 2021, 9, 1759. [Google Scholar] [CrossRef]
  24. Al-shami, T.M.; Alcantud, J.C.R.; Azzam, A.A. Two new families of supra-soft topological spaces defined by separation axioms. Mathematics 2022, 10, 4488. [Google Scholar] [CrossRef]
  25. Al-shami, T.M.; El-Shafei, M.E. Two types of separation axioms on supra soft topological spaces. Demonstr. Math. 2019, 52, 147–165. [Google Scholar] [CrossRef]
  26. Al-shami, T.M.; Liu, J.-B. Two classes of infrasoft separation axioms. J. Math. 2021, 2021, 4816893. [Google Scholar] [CrossRef]
  27. Terepeta, M. On separating axioms and similarity of soft topological spaces. Soft Comput. 2019, 23, 1049–1057. [Google Scholar] [CrossRef]
  28. Al-shami, T.M.; Kocinac, L.D. The equivalence between the enriched and extended soft topologies. Appl. Comput. Math. 2019, 18, 149–162. [Google Scholar]
  29. Alcantud, J.C.R. Soft open bases and a novel construction of soft topologies from bases for topologies. Mathematics 2020, 8, 672. [Google Scholar] [CrossRef]
  30. Ameen, Z.A.; Al-Ghour, S. Extensions of soft topologies. Filomat 2023, 36, 5279–5287. [Google Scholar] [CrossRef]
  31. Kandil, A.; Tantawy, O.A.E.; El-Sheikh, S.A.; El-latif, A.M.A. Soft ideal theory soft local function and generated soft topological spaces. Appl. Math. Inf. Sci. 2014, 8, 1595–1603. [Google Scholar] [CrossRef]
  32. Mahmoud, R.A. Remarks on soft topological spaces with soft grill. Far East J. Math. Sci. 2014, 86, 111–128. [Google Scholar]
  33. Acharjee, S.; Özkoç, M.; Issaka, F.Y. Primal topological spaces. arXiv 2022, arXiv:2209.12676. [Google Scholar]
  34. Al-Omari, A.; Acharjee, S.; Özkoç, M. A New operator of primal topological spaces. arXiv 2022, arXiv:2210.17278. [Google Scholar]
  35. Ali, M.I.; Feng, F.; Liu, X.; Min, W.K.; Shabir, M. On some new operations in soft set theory. Comput. Math. Appl. 2009, 57, 1547–1553. [Google Scholar] [CrossRef]
  36. Allam, A.; Ismail, T.H.; Muhammed, R. A new approach to soft belonging. J. Ann. Fuzzy Math. Inform. 2017, 13, 145–152. [Google Scholar] [CrossRef]
  37. Xie, N. Soft points and the structure of soft topological spaces. Ann. Fuzzy Math. Inform. 2015, 10, 309–322. [Google Scholar]
  38. Das, S.; Samanta, S. Soft metric. Ann. Fuzzy Math. Inform. 2013, 6, 77–94. [Google Scholar]
  39. Al-shami, T.M. Homeomorphism and quotient mappings in infra soft topological spaces. J. Math. 2021, 2021, 3388288. [Google Scholar] [CrossRef]
  40. Kharal, A.; Ahmad, B. Mappings on soft classes. New Math. Nat. Comput. 2011, 7, 471–481. [Google Scholar] [CrossRef]
  41. Nazmul, S.; Samanta, S. Neighbourhood properties of soft topological spaces. Ann. Fuzzy Math. Inform. 2013, 6, 1–15. [Google Scholar]
  42. Al-Ghour, S.; Ameen, Z.A. Maximal soft compact and maximal soft connected topologies. Appl. Comput. Intell. Soft Comput. 2022, 2022, 9860015. [Google Scholar] [CrossRef]
  43. Azzam, A.; Ameen, Z.A.; Al-shami, T.M.; El-Shafei, M.E. Generating soft topologies via soft set operators. Symmetry 2022, 14, 914. [Google Scholar] [CrossRef]
  44. Sahin, R.; Kuçuk, A. Soft filters and their convergence properties. Ann. Fuzzy Math. Inform. 2013, 6, 529–543. [Google Scholar]
  45. Hosny, M.; Al-shami, T.M.; Mhemdi, A. Novel approaches of generalized rough approximation spaces inspired by maximal neighbourhoods and ideals. Alex. Eng. J. 2023, 69, 497–520. [Google Scholar] [CrossRef]
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.

Share and Cite

MDPI and ACS Style

Al-shami, T.M.; Ameen, Z.A.; Abu-Gdairi, R.; Mhemdi, A. On Primal Soft Topology. Mathematics 2023, 11, 2329. https://doi.org/10.3390/math11102329

AMA Style

Al-shami TM, Ameen ZA, Abu-Gdairi R, Mhemdi A. On Primal Soft Topology. Mathematics. 2023; 11(10):2329. https://doi.org/10.3390/math11102329

Chicago/Turabian Style

Al-shami, Tareq M., Zanyar A. Ameen, Radwan Abu-Gdairi, and Abdelwaheb Mhemdi. 2023. "On Primal Soft Topology" Mathematics 11, no. 10: 2329. https://doi.org/10.3390/math11102329

APA Style

Al-shami, T. M., Ameen, Z. A., Abu-Gdairi, R., & Mhemdi, A. (2023). On Primal Soft Topology. Mathematics, 11(10), 2329. https://doi.org/10.3390/math11102329

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop