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 of is said to be a soft primal on Y if it satisfies the following postulates:
- (i)
.
- (ii)
If and , then . That is, is closed under soft subset relation.
- (iii)
If , then or .
The next result is easy to prove.
Proposition 2. A subfamily of is a soft primal on Y if and only if the following conditions are satisfied.
- (i)
.
- (ii)
If and , then .
- (iii)
If and , then .
Theorem 1. If and are two soft primals on Y, then is a soft primal on Y.
Proof. First, let and be two soft primals on Y. Then and . So that . Second, suppose that and let . Then, or . This automatically leads to that or . So . Third, let be soft subsets such that . Then, or . This implies that or , 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 and . Then and are two soft primals on a set Y with . Now, is not a soft primal because . But neither nor .
Theorem 2. If is a soft grill on Y, then the family is a soft primal on Y.
Proof. First, it is obvious that , so . Second, let , and take any soft subset of . By the way of building , we have . Since , it follows from the definition of the soft grill that . This automatically means that . Third, let be soft subsets such that . Then, . Therefore, or . Thus, or . Hence, we get the desired result. □
Corollary 1. If is a soft primal on Y, then the family 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 , inspired by a soft primal , does not institute a (crisp) primal for any fixed parameter .
Example 2. Let and . Consider the following soft sets:
;
;
;
;
;
;
;
;
; and
.
Then, is a soft primal on a set Y with . We obtain . Obviously, and are not (crisp) primal because Y belongs to both of them.
Theorem 3. Let be a soft primal on a set Y with a set of parameters . Then,is a (crisp) primal on Y for any fixed parameter . Proof. It is clear that . Let and take any subset B of A. Then, there exists a soft subset in such that . Now, a soft set , given by and for each , is a soft subset of , so . This means that . Thus, is closed under a subset relation. Finally, let . Then, there exists a soft subset in such that . Note that there exist soft subsets and such that , and for each . That is, , so or . This automatically leads to or . Hence, the proof is complete. □
We close this section by showing how the soft primal behaves under soft mappings.
Remark 1. Let be a soft mapping and be a soft primal on Z with a set of parameters . The class need not be a soft primal on Y with a set of parameters in general. The next example confirms this fact.
Example 3. Let with a set of parameters , and with a set of parameters . Now consider the mappings and are defined as follows
Let be a soft primal on Z with . Now, be a soft set in , so is not a soft primal on Y with because , which is not a member of any soft primal on Y with .
Theorem 4. Let be an injective soft mapping. If is a soft primal on Z with a set of parameters , then the class is a soft primal on Y with a set of parameters .
Proof. According to the way of building , , let be a non-null soft set in . Then, there exits a soft subset in such that . Take any soft subset of , we obtain . This means that , and by the injectiveness of , we get , i.e., is a proper soft subset of . Thus, , which means that is closed under subset relation. Finally, let be an element of . This implies that there exists such that . By the injectiveness of , we get , which automatically means that . By the third condition of the soft primal, or . Again, by the injectiveness of we get or . Thus, or , which ends the proof. □
Corollary 2. Let be a bijective soft mapping. If is a soft primal on Z with a set of parameters , then the class is a soft primal on Y with a set of parameters .
Proof. Since is surjective, iff . This means that , so . 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 be a bijective soft mapping. If is a soft primal on Y with a set of parameters , then the class 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 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 is said to be a primal soft topological space (briefly, PSTS), where is a soft topological space and is a soft primal on Y.
Definition 17. Let be a PSTS. Then, a soft mapping is defined as follows, for each for each soft subset . In brief, we write or instead of .
The next example elucidates that the properties and are false in general.
Example 4. Take a soft primal displayed in Example 2 and let be a soft topology on a set Y with . One can check that . On the other hand, .
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 and be soft subsets of a PSTS . Then, the next statements hold true.
- (i)
.
- (ii)
.
- (iii)
If , then .
- (iv)
If , then .
- (v)
If , then .
- (vi)
.
- (vii)
.
- (viii)
.
Proof. - (i)
Since for any soft set and , so shall be null.
- (ii)
If and any , then . One find such that . Therefore, for all . This means that and so . Hence, . The reverse of the inclusion is always true. Thus, .
- (iii)
Suppose otherwise that there exists such that . Then, for each . However, since , by Proposition 2, for some —a contradiction. Thus, .
- (iv)
Suppose that . Let . Assume . Then . Since , so for each . This concludes that , a contradiction. Thus, .
- (v)
Assume that . If , then for all . Since , so . Hence, and thus, .
- (vi)
By (ii), , so . Therefore, .
- (vii)
Since and , then, by (iv), and . It follows that . For the converse of the inclusion, if , then and . This implies that there exist such that and . Set . Then for which and (from Proposition 2). Since is soft primal, we get that . Thus, . Consequently, .
- (viii)
Since and , then, by (iv), and . Therefore,
.
□
As illustrated below, it may not always be possible to achieve the equality of (viii) in Theorem 5.
Example 5. Consider the , and given in Example 2. Let . Obviously, . On the other hand, .
Theorem 6. Let and be soft subsets of a PSTS such that is soft open. Then, .
Proof. Given such that . If , then and , and so for all . Since , then . However, , so it implies that . Hence, . □
Theorem 7. Let be a PSTS. If , then for each .
Proof. Since , clearly . Next, we need to find . Since , then we must have . Indeed, if for some , . Therefore, there exists such that , a contradiction. If , by Theorem 6, . This leads to the result. □
Theorem 8. Let and be soft subsets of a PSTS . Then, .
Proof. Consider the decomposition
Then applying Theorem 5 (v) and (vii) to it, we obtain
Therefore, .
On the other hand, since , by Theorem 5 (v), and so, . Summing up the obtained inclusions, we get . □
Theorem 9. Let and be soft subsets of a PSTS such that . Then, .
Proof. This follows from Theorems 5 and 8. □
Definition 18. Let be a PSTS. Then, a soft mapping is defined as follows for any soft subset .
Theorem 10. Let and be soft subsets of a PSTS . Then, the next statements hold true.
- (i)
.
- (ii)
.
- (iii)
.
- (iv)
If , then .
- (v)
.
- (vi)
.
Proof. - (i)
Since , so .
- (ii)
This is clear as .
- (iii)
This is also easy as .
- (iv)
Suppose with . By Theorem 5 (v), and so . Thus, .
- (v)
By the same technique used in (iv) and applying Theorem 5 (vii), one can easily conclude that .
- (vi)
To show that
, we implicitly use multiple statements of Theorem 5. Now,
The converse is always true by using (iii). Therefore, . □
Theorem 11. Let be a soft subset of a PSTS . If , then .
Proof. We first prove that . Since by Theorem 14, , then . Let . Then, we can find and containing such that . Then, and so, . By Theorem 9, , and hence by Theorem 6, . Since , then implies . This proves that . Then, Theorem 5 (ii) shows that . Now, if , then one can find such that . This means that and thus, . Hence, and so, . On the other hand, since , then . Therefore, . □
Theorem 12. Let be a PSTS. Then, a soft mapping given by for any soft subset is a Kuratowski’s soft closure operator.
Proof. Theorem 10 guarantees that satisfies all the postulates in Definition 12. Thus, is a Kuratowski’s soft closure operator. □
Theorem 13. Let be a PSTS. Then, the family 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 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 be the indiscrete soft topological space, where Y is any set containing more than one point and is any set of parameters, and let . Suppose . Then, meets all the axioms mentioned in Definition 15, so it is a soft primal. Given any . If , then . If , then . Therefore, each soft set excluding is a soft -closed set together with . Therefore, , where (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 generated by , let be the family of countable soft subsets of . Obviously, is a soft primal. For any soft set over Y, if is in or not, then one can easily check that . Therefore, all soft subsets of are soft -closed sets. Hence, is the discrete soft topology.
Theorem 14. Let be a PSTS. Then, a primal soft topology is finer than a soft topology .
Proof. If , then . By Theorem 5 (iv), . Therefore, . On the other hand, is always correct. Consequently, and so, . Hence, . □
Theorem 15. For any PSTS , the next results hold.
- (i)
If , then .
- (ii)
If , then .
Proof. - (i)
Let . It suffices to show that . Indeed, the converse is correct. Let . By assumption, for all . Hence, . By Theorem 13, . This proves that .
- (ii)
We only need to show that . The reverse of the inclusion follows from Theorem 14. Let . Then . Therefore, . Let such that . Clearly, and so, there is a such that . Since , so must equal and hence, . This implies that . Therefore, we obtain that . This proves that . Thus, and so .
□
Theorem 16. Let be a soft subset of a PSTS . Then, the next results hold.
- (i)
iff for any , there exists such that .
- (ii)
If , then .
Proof. - (i)
If , then , and so . Therefore, . This means that for any , , and so there exists such that . The claim follows.
The converse can be concluded by reversing the above steps.
- (ii)
Let and let . Then, there exists always the soft open set containing such that . By (i), we obtain that .
□
Theorem 17. Let be a PSTS. Then, the familyis a soft base for the primal soft topology on Y. Proof. We first need to check that . If , then for some and . Since, by Theorem 14, , so . By Theorem 16 (ii), and therefore, . We now show that is a soft base. Let and . By Theorem 16 (i), there exists such that . Set . Indeed, . Thus, is a soft base for . □
Theorem 18. Let and be two PSTSs such that . Then .
Proof. If , then implies . Assume that such that . Then and hence, there exists such that . Since , so and hence, . Therefore, . This implies that and thus, . This proves that . □
Now, we look at a new operator and explore its major properties.
Definition 20. Let be a PSTS. Then, a soft mapping is defined as follows for some for each soft subset over Y. In brief, we write or instead of .
We shall remark that neither nor 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 be a soft subset of a PSTS . Then Proof. If , then there exists such that . But implies . Therefore, .
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 of a PSTS , we have
- (i)
- (ii)
- (iii)
- (iv)
Lemma 1. For a soft subset of a PSTS , .
Proof. Let be a soft subset of a PSTS . By Theorems 5 (ii) and 19, . Since is soft -closed, therefore . □
Theorem 20. Let be soft subset of a PSTS . Then,
- (i)
.
- (ii)
.
- (iii)
If , then .
- (iv)
.
- (v)
.
Proof. - (i)
Applying Theorem 19 to , we have .
- (ii)
Let . By Theorem 19, and then, by Theorem 5 (vi), . From (iv) in Corollary 3, we obtain that implies . Thus, .
- (iii)
Let . Then for some . Since , then and so . By Proposition 2, . This means that . Thus, .
- (iv)
Since and , then by (iii), and . Therefore, . To prove the converse, we let . Then and for some . Set . Then and, by Proposition 2, we have and . This implies that . Thus, and hence, . This completes the proof.
- (v)
This matches the first part of the proof of (iv).
□
Theorem 21. Let be soft subsets of a PSTS such that . The following conclusions hold true:
- (i)
.
- (ii)
.
- (iii)
.
Proof. - (i)
Since , by Theorem 9, . Therefore, .
- (ii)
Now, by the use of Theorem 9, we can get .
- (iii)
Similar to (ii).
□
Definition 21. Let be a soft subset of a PSTS and let be the primal soft topology on Y. A soft point is called a soft -interior point of if there exists such that . The set of all soft -interior points of is symbolized by .
Theorem 22. Let be a soft subset of a PSTS . Then .
Proof. Let . Then and for some . By Theorem 17, such that . Thus, .
On the other hand, suppose . Then, there exists a basic soft -open set containing , where and , such that . This implies that . By Proposition 2, . Therefore, . □
Theorem 23. Let be a PSTS. The familyis a soft topology on Y. Furthermore, . Proof. Suppose . We need first to prove that is a soft topology. Clearly, as and . Let . By Theorem 20, . Hence, . Let . Again by Theorem 20, for each i. Therefore, and so .
We now show that . If , then and so, by Theorem 19, implies . This means that is soft -closed, and thus . Now, let and . By Theorem 17, there exists and such that . Evidently, and then . Therefore, and so . The conclusion follows. □
This concludes that
Corollary 4. For a soft subset of a PSTS , whenever .