In this paper, we use the soft set theory and the concept of semi-linear uniform spaces to introduce the notion of soft semi-linear uniform spaces with its generalization, briefly soft-GSLUS. We investigate some properties of soft topology that induced by soft-GSLUS. Also, we use the members of soft-GSLUS to define a soft proximity space and a soft filter then we establish the relationships between them. Finally, we give the perceptual application of soft semi-linear uniform structures by employing the natural transformation of a soft semi-linear uniform space to a soft proximity.
Soft set theory is a generalization of fuzzy set theory that was introduced in 1999 by Molodtsov [18] as a new mathematical technique to deal with uncertainties and solve numerous practical problems in fields including engineering, social science, economics, medical science that traditional methods had failed to handle. Maji et al. ([16, 17]) provided the first practical application of soft sets in decision-making problems and he offered theoretical knowledge of soft sets and studied subset, operation such as intersection and union, and equality of soft sets. Çağman and Enginoğlu [6] developed a soft matrix theory and a successful application of soft sets to decision-making problems in 2010. In soft topological spaces, Aygünoğlu and Aygün [3] established soft product topology, soft compactness and generalized Tychonoff theorem. Among the importance occupied by the soft set theory many authors used the notion of soft sets to present a number of important research in a various branches ([2, 34]).
Uniformity is an effective tool for investigation of topology and it can be considered as a link between metric and topology since it is striking parallels with metrics, but its application is much wider. Çaetkin and Aygün [7] introduced an extension of uniform structures by using soft sets. They defined the concept of a soft uniformity consisting of soft sets on Z × Z by depending on the axioms proposed by Bourbaki [5] where Z is an initial universe. zbakir and Demir [20] defined a soft uniformity as a family of soft sets on SP (Z) × SP (Z) with the parameters set Ψ that is different to Çetkin and Aygün’s definition where SP (Z) is the family of all soft points over Z. They looked at some of the fundamental properties of a soft uniformity and compared soft uniformities to soft metric and soft topology. In [9] Demir et al. established a new type of uniform space known as se-uniform spaces and offered some of their basic properties, then the concept of a soft E-distance in se-uniform spaces was presented. Also, they constructed some fixed soft element theorems for various mappings on se-uniform spaces using the soft E-distance. In [10] Demir et al. looked into soft proximity spaces and studied how proximity spaces and soft proximity spaces are related. Then, they developed the concept of a soft neighborhood in the context of soft proximity spaces, which provide a different perspective on the study of soft proximity spaces. Finally, they illustrated how to derive a soft proximity space from a soft uniform space.
This manuscript contributes to this direction by employing the concept of semi-linear uniform space that is defined by Tallafha and Khalil [30]. A semi-linear uniform space is defined by reformulating the terms of uniform spaces to present a new mixture spaces of analysis and topology, many authors ([24, 29]) have contributed to several semi-linear uniform spaces investigations, one of the most essential works in this field [26] is the negative answer to the question "Does f have a unique fixed point if it is a contraction from a complete semi-linear uniform space to itself?" In this work, we define the concept of a soft semi-linear uniform space by depending on the axioms proposed by Tallafha and Khalil [30] and we establish a link between the generalized soft semi-linear uniform spaces and the soft proximity spaces.
We recall some definitions and properties of soft sets then this work is organized as follows: In Section 2, we introduce the notion of soft semi-linear uniform spaces and we present some properties of this space. Also, through the axioms of this space we are able to introduce the two soft mapping and on SP (Z) × SP (Z) through which we present some of the properties of this space. In section 3, we employ the members of soft-GSLUS to introduce a soft proximity space. In section 4, we employ the natural transformation of a soft semi-linear uniform space to a soft proximity to give the perceptual application of soft semi-linear uniform structures.
Definition 1.1. [3, 18] Let P (Z) be the power set of Z. A soft set H on the universe Z with the parameters set Ψ is defined by H = {(e, H (e)) : e ∈ Ψ, H (e) ∈ P (Z)} where H is a mapping H : Ψ → P (Z).
The family of all soft sets over Z with the parameters set Ψ is denoted by S (Z, Ψ).
Definition 1.2. ([1, 21]) Let H, G ∈ S (Z, Ψ). Then:
A soft set H is called null soft set, denoted by Φ, if H (e) = φ for every e ∈ Ψ;
A soft set H is called absolute soft set, denoted by , if H (e) = Z for every e ∈ Ψ;
H is a soft subset of G, denoted by H ⊑ G, if H (e) ⊆ G (e) for every e ∈ Ψ;
H = G, if H ⊑ G and G ⊑ H, and H is a soft proper subset of G, denoted by H ⊏ G, if H ⊑ G and H ≠ G;
A complement of H, denoted by Hc, where Hc : Ψ → P (Z) is a mapping defined by Hc (e) = Z - H (e) for every e ∈ Ψ. Clearly, (Hc) c = H;
A soft set F is the union of H and G, denoted by F = H ⊔ G, if F (e) = H (e) ∪ G (e) for every e ∈ Ψ;
A soft set F is the intersection of H and G, denoted by F = H ⊓ G, if F (e) = H (e) ∩ G (e) for every e ∈ Ψ.
Definition 1.3. ([8, 19]) Let Ψ be a parameters set. Then:
A soft set P over Z is called a soft point, denoted by xe, if there is e ∈ Ψ with P (e) = {x} for some x ∈ Z and P (e∗) = φ for all e∗ ∈ Ψ - {e};
A soft point xe belongs to a soft set H, denoted by H, if x ∈ H (e).
The family of all soft points over Ψ is denoted by SP (Z) and the family of all soft sets over SP (Z) × SP (Z) with the parameters set Ψ is denoted by S (SP (Z) × SP (Z) , Ψ).
Definition 1.4. [4] Let S (Z, ΨZ) and S (W, ΨW) be the families of all soft sets over Z and W, respectively. Then the Cartesian product H × G for H ∈ S (Z, ΨZ) and G ∈ S (W, ΨW) is defined by:
(H × G) (e, k) = H (e) × G (k), for every (e, k) ∈ ΨZ × ΨW.
Definition 1.5. [13] Let S (Z, ΨZ) and S (W, ΨW) be the families of all soft sets over Z and W, respectively, and φ : Z → W and ψ : ΨZ → ΨW be two mappings. Then the soft mapping φ
ψ : S (Z, ΨZ) → S (W, ΨW) is defined by:
for H ∈ S (Z, ΨZ)
for every k ∈ ΨW. Where φ
ψ (H) is called a soft image of a soft set H;
Moreover, for G ∈ S (W, ΨW), for every e ∈ ΨZ. Where is called a soft inverse image of a soft set G.
The soft mapping φ
ψ is called injective, if φ and ψ are injective. The soft mapping φ
ψ is called surjective, if φ and ψ are surjective ([3, 36]).
Definition 1.6. [27] A family ϑ of soft sets of Z with a parameters set Ψ is called a soft topology on Z if:
The absolute soft set and the null soft set Φ are members of ϑ;
The union of an arbitrary number of soft sets in ϑ is a member of ϑ;
The intersection of a finite number of soft sets in ϑ is a member of ϑ.
Then (Z, ϑ, Ψ) is called a soft topological space where each member in ϑ is soft open and its complement is soft closed.
Definition 1.7. [19] Let (Z, ϑ, Ψ) be a soft topological space. A soft set H is a soft neighborhood of the soft point xe if there is a soft open set G with .
Definition 1.8. [11] Let (Z, ϑ, Ψ) be a soft topological space. If for every there are two soft open sets H and G with , and H ⊓ G = Φ, then (Z, ϑ, Ψ) is called a soft T2-space.
Definition 1.9. [20] Let (Z, ϑ1, ΨZ) and (W, ϑ2, ΨW) be two soft topological spaces and φ
ψ : (Z, ϑ1, ΨZ) → (W, ϑ2, ΨW) be a soft mapping. Then φ
ψ is soft continuous at if for every soft neighborhood G of φ
ψ (xe) in W, there is a soft neighborhood H of xe in Z with φ
ψ (H) ⊑ G. A soft mapping φ
ψ is called soft continuous on Z if it is soft continuous at each .
Definition 1.10. [20] The non-empty family is called a soft uniformity for Z if the following are satisfied:
For every , then Δ ⊑ M, where Δ (e) = {(x
α, x
α) : x
α ∈ SP (Z)} for every e ∈ Ψ;
For every , there is with N-1 ⊑ M, where N-1 (e) = {(x
α, y
β) : (y
β, x
α) ∈ N (e)} for every e ∈ Ψ;
For every , there is with N ∘ N ⊑ M;
If , then ;
If and M ⊑ N then .
Then is called soft uniform spaces on Z.
Soft semi-linear uniform spaces
In this section, we reframe the axioms of soft uniform spaces to introduce the notion of soft semi-linear uniform spaces. Then we present some properties of this space and we show that there is a soft topology induced by soft semi-linear uniform space.
Definition 2.1. Let DSP(Z) be the family which contains all members of S (SP (Z) × SP (Z) , Ψ) that satisfy the following:
For every M ∈ DSP(Z), Δ ⊑ M;
For every M ∈ DSP(Z), M = M-1.
If Δ ∉ DSP(Z), we will use .
Example 2.2. Let Z = {x1, x2, x3} with parameters set Ψ = {e1, e2}. Clearly, . Let and . Then Δ, M ∈ DSP(Z).
Definition 2.3. Let M, N ∈ DSP(Z). Then,
The composition of M and N, denoted by M ∘ N, is defined by for every e ∈ Ψ, (M ∘ N) (e) = {(x
α, y
β) : thereissome z
γ ∈ SP (Z) with (x
α, z
γ) ∈ N (e) and (z
γ, y
β) ∈ M (e)};
Define Mn inductively by the formulas M1 = M and Mn = Mn-1 ∘ M.
Note that the composition is associative, i . e, (M ∘ N) ∘ P = M ∘ (N ∘ P). However, the composition is not commutative.
Proposition 2.4. For any M, N ∈ DSP(Z), we have
M ⊓ N ∈ DSP(Z);
Mn ∈ DSP(Z) holds for every .
Definition 2.5. Let Γ be a subfamily of that satisfy the following:
Γ is a chain (i . e, for every M, N ∈ Γ either M ⊑ N or N ⊑ M);
For every M∈ Γ, there is N ∈ Γ with N∘ N ⊑ M ;
;
For every e ∈ Ψ,
Then (Z, Γ, Ψ) is called soft semi-linear uniform spaces on Z, briefly soft-SLUS.
Example 2.6. Let and Hx : Ψ → P (Z) be defined by . Then Hx (e) is a soft point, denoted by xx, and so (xx, yy) ∈ SP (Z) × SP (Z) for every x, y ∈ Z. Set Ge = {(xx, yy) : x2 + y2 < |e|} ⊔ Δ then for every e > 0, Ge ⊆ SP (Z) × SP (Z). Let Me : Ψ → P (SP (Z) × SP (Z)) be defined by . Then Me ∈ S (SP (Z) × SP (Z) , Ψ) for every e > 0. Therefore, (Z, Γ, Ψ) is soft-SLUS where Γ = {Me : e > 0}.
Definition 2.7. If (i) of Definition 2.5 is replaced by the following condition: M ⊓ N ∈ Γ for every M, N ∈ Γ, then (Z, Γ, Ψ) is called generalized soft semi-linear uniform space on Z, briefly soft-GSLUS.
Note that if Γ is a chain then for every M, N ∈ Γ, M ⊓ N either M or N and hence every soft-SLUS is soft-GSLUS.
Definition 2.8. Let (Z, Γ, Ψ) be a soft-GSLUS and M ∈ Γ. Then:
For define ;
For H ∈ S (Z, Ψ) define
Definition 2.9. Let (Z, Γ, Ψ) be a soft-GSLUS. A subfamily Θ of Γ is called a soft base of Γ if for every M ∈ Γ there is C ∈ Θ with C ⊑ M .
Remark 2.10. Any soft base Θ for a soft-GSLUS has the following properties:
For every C ∈ Θ, there is O ∈ Θ with O∘ O ⊑ U ;
Theorem 2.11. If (Z, Γ, Ψ) is a soft-GSLUS, then for every with
is a soft topology on Z.
Proof: It is obvious that . Let O1, O2 ∈ ϑ and . There are M1, M2 ∈ Γ with and . Note that since
iff (x
α, y
β) ∈ M1 (e) and (x
α, y
β) ∈ M2 (e), ∀e ∈ Ψ iff (x
α, y
β) ∈ M1 (e) ∩M2 (e), ∀e ∈ Ψ iff . Therefore, and hence O1 ⊓ O2 ∈ ϑ. Finally, let Oi ∈ ϑ and . Then there is M ∈ Γ with and so . □
Corollary 2.12. If (Z, Γ, Ψ) is a soft-SLUS, then for every with
is a soft topology on Z.
The soft topology in Theorem 2.11 and Corollary 2.12 which is induced by (Z, Γ, Ψ) will be denoted by (Z, ϑ
Γ, Ψ).
Proposition 2.13. Let (Z, Γ, Ψ) be a soft-GSLUS. For the soft topological space (Z, ϑ
Γ, Ψ), if H ∈ S (Z, Ψ) then with is equal to Int (H). Where Int (H) is defined as the union of all soft open sets contained in H.
Proof: Let . There are M, P ∈ Γ with and P ∘ P ⊑ M. Then for every , . Hence, and so is soft open. Now, since every soft open set O ⊑ H belongs to we completed the proof.□
Corollary 2.14. Let (Z, Γ, Ψ) be a soft-GSLUS. For the soft topological space (Z, ϑ
Γ, Ψ) we have the following:
For every and H ∈ S (Z, Ψ), iff ≠Φ for every M ∈ Γ;
For every M ∈ Γ and H ∈ S (Z, Ψ) with H × H ⊑ M, then .
Proof: (i) The proof is obvious.
(ii) Let . Then there are with and for every M ∈ Γ. Therefore (x
α, x1
α′), (y
β, y1
β′), (x1
α′, y1
β′) ∈ M (e) for every e ∈ Ψ and so (x
α, y
β) ∈ M3 (e) for every e ∈ Ψ. Hence, . □
Proposition 2.15. Let (Z, Γ, Ψ) be a soft-GSLUS. The soft topology (Z, ϑ
Γ, Ψ) is soft T2-space.
Proof: Let There are M, N ∈ Γ with N ∘ N ⊑ M and (x
α, y
β) ∉ M (e) for some e ∈ Ψ. If , then there is and so (x
α, z
γ), (y
β, z
γ) ∈ N (e) for every e ∈ Ψ. Hence (x
α, y
β) ∈ (N ∘ N) (e) ⊆ M (e) for every e ∈ Ψ, which is a contradiction. □
Proposition 2.16. Let (Z, Γ, Ψ) be a soft-GSLUS. For the soft topological space (Z, ϑ
Γ, Ψ), if H ∈ S (Z, Ψ) then M ∈ Γ} .
Proof: iff ∃ y
β with and H for every M ∈ Γ iff ∃ y
β with (x
α, y
β) ∈ M (e) for every e ∈ Ψ and M ∈ Γ iff x
α for every M ∈ Γ . □
Theorem 2.17. Let (Z, Γ, Ψ) be a soft-GSLUS and H, G ∈ S (Z, Ψ). Then, there is M ∈ Γ with iff there is M ∈ Γ with .
Proof: Let M ∈ Γ with . Then there is N ∈ Γ with N ∘ N ⊑ M. If , then there are (x
α, y
β), (x
α, z
γ) ∈ N (e) for every e ∈ Ψ with and . Thus, , which is a contradiction. Hence .
To prove the sufficiency, let G ∈ S (Z, Ψ), then for every M ∈ Γ and so . □
Corollary 2.18. Let (Z, Γ, Ψ) be a soft-GSLUS with a soft base Θ and H, G ∈ S (Z, Ψ). Then, there is M ∈ Θ with iff there is M ∈ Θ with .
Proposition 2.19. Let (Z, Γ, Ψ) be a soft-GSLUS. If H, G, F ∈ S (Z, Ψ), then for every M ∈ Γ
;
;
Proof: (i) Let . Then, there is with (x
α, y
β) ∈ M (e) for every e ∈ Ψ. If then . Hence . We can prove by similar technique. The prove of other part is obvious.
(ii) The prove follows from i. □
Definition 2.20. Let (Z, Γ, Ψ) be a soft-SLUS. For (x
α, y
β) ∈ SP (Z) × SP (Z), set and Then define and on SP (Z) × SP (Z) by and
Remark 2.21. If then for every M ∈ Γ(x
α,y
β). Also, if then for some M ∈ Γc(x
α,y
β).
Proposition 2.22. Let (Z, Γ, Ψ) be a soft-SLUS. If x
α, y
β ∈ SP (Z) then
and ;
for every M ∈ Γ(x
α,y
β) and for every M ∈ Γc(x
α,y
β);
;
If (s
γ, t
λ) ∈ SP (Z) × SP (Z) and , then ;
If (s
γ, t
λ) ∈ SP (Z) × SP (Z) and , then ;
If M ∈ Γ with , then or .
Theorem 2.23. Let (Z, Γ, Ψ) be a soft-SLUS. Then iff .
Proof: First, we show iff . Suppose then and hence . Now, if then since otherwise there is and . So , which is a contradiction. Thus, and hence . By similar technique, iff . Therefore, iff . □
Theorem 2.24. Let (Z, Γ, Ψ) be a soft-SLUS. For the soft topological space (Z, ϑ
Γ, Ψ) the following are equivalent:
H is soft neighborhood of the soft point x
α;
There is M ∈ Γ with B (x
α, M) ⊑ H;
There is M ∈ Γ with .
Proof: The proof is follows from Definition 1.7, Corollary 2.12 and definition of . □
Definition 2.25. Let φ
ψ : (Z, ΓZ, ΨZ) → (W, ΓW, ΨW). A soft mapping φ
ψ is soft semi-linear uniformly continuous iff for every N ∈ ΓW, there is M ∈ ΓZ with for every x
α, y
β ∈ SP (Z), if , then .
Theorem 2.26. Every soft semi-linear uniformly continuous mapping is soft continuous.
Proof: Let φ
ψ : (Z, ΓZ, ΨZ) → (W, ΓW, ΨW) be soft semi-linear uniformly continuous. Suppose and be a soft neighborhood of φ
ψ (x
α) with respect to ϑ
ΓW. By soft semi linear uniform continuity there is M ∈ ΓZ such that if , then . Therefore, . □
Proposition 2.27. Let φ
ψ : (Z, ΓZ, ΨZ) → (W, ΓW, ΨW). A soft mapping φ
ψ is soft semi-linear uniformly continuous iff for every N ∈ ΓW there is M ∈ ΓZ with for every x
α, y
β ∈ SP (Z), if , then .
Proof: Let N ∈ ΓW. There is P ∈ ΓZ such that if , then . Let M be a proper subset of P and x
α, y
β ∈ SP (Z). If , then and hence . Therefore, .
To prove the sufficiency, Let N ∈ ΓW. Take P a proper subset of N, by assumption, there is M ∈ ΓZ with for every x
α, y
β ∈ SP (Z), if , then . Therefore, .□
Soft proximity spaces
In this section, we employ the members of soft-GSLUS to introduce a soft proximity space and a soft filter then we give a relation between them.
Definition 3.1. [12] Let ξ be a binary relation on S (Z, Ψ). If for every H, G, F ∈ S (Z, Ψ) the following are satisfied:
;
If , then H ⊓ G = Φ;
If HξG, then GξH;
Hξ (G ⊔ F) iff HξG or HξF;
If , then there is F ∈ S (Z, Ψ) with and .
Then ξ is called a proximity of soft sets on Z and (Z, ξ, Ψ) is soft proximity space. If the soft sets H, G ∈ S (Z, Ψ) are ξ-related we will denoted by HξG, otherwise we will denoted by .
Theorem 3.2. [12] Let (Z, ξ, Ψ) be a soft proximity space and define the mapping by . Then, the family is a soft topology on Z.
Theorem 3.3. Let (Z, Γ, Ψ) be a soft-GSLUS and H, G ∈ S (Z, Ψ). Then, we define a proximity of soft sets on Z by: HξG iff for every M ∈ Γ.
Proof: We need to show that ξ satisfies axioms of Definition 3.1:
i . Clearly, .
ii . Let M ∈ Γ. If H ⊓ G ≠ Φ, then there is with . Since Δ ⊑ M, then .
iii . It follows from the fact M = M-1 for every M ∈ Γ.
iv . It is clear that if Hξ (G ⊔ F) then HξG or HξF. To prove the sufficiency, suppose that and . There are M1, M2 ∈ Γ with and for every and . Note that, whenever . Therefore, .
v . If , there are M, N ∈ Γ with N ∘ N ⊑ M and . Put . To show , let . Then, there is with , which is a contradiction. Now, to show , let . Then there is with . Since for some , then . Therefore, , which is a contradiction.
Corollary 3.4. Let (Z, Γ, Ψ) be a soft-GSLUS. Then, iff there is M ∈ Γ with
Proof: It follows directly from Theorems 2.17 and 3.3. □
Corollary 3.5. Let (Z, Γ, Ψ) be a soft-GSLUS with a soft base Θ and H, G ∈ S (Z, Ψ). Then:
HξG iff for every M ∈ Θ;
HξG iff M ⊓ (H × G) ≠ Φ for every M ∈ Θ;
iff there is M ∈ Θ with .
Theorem 3.6. Let (Z, Γ, Ψ) be a soft-GSLUS. Then ϑ (ξ) = ϑ
Γ.
Proof: By Corollary 2.14 and Theorem 3.2 we show that the soft closed set in two topologies are coincides. Let H ∈ S (Z, Ψ), then
iff for every M ∈ Γ
iff M ⊓ (x
α × H) ≠ Φ for every M ∈ Γ
iff x
αξH
iff . □
Proposition 3.7. Let (Z, Γ, Ψ) be a soft-GSLUS. If , then .
Proof: Let . Then and, by Proposition 2.16, there is M ∈ Γ with . Then so by Proposition 2.13, .□
Definition 3.8. [35] Let . If satisfy the following:
;
For every and G ⊑ H,
For every , .
Then is called a soft filter on Z.
Theorem 3.9. Let (Z, Γ, Ψ) be a a soft-GSLUS. If Φ ≠ G ∈ S (Z, Ψ), then for some M ∈ Γ } is a soft filter on Z.
Proof: We need to show that satisfies axioms of Definition 3.8:
i . If , then for some M ∈ Γ, hence H ≠ Φ.
ii . If with H ⊑ K, then for some M ∈ Γ, so and hence .
iii . If , then and for some M, N ∈ Γ, so and hence . □
The following proposition, which follows directly from Theorem 3.9, will give some properties of .
Proposition 3.10. Let (Z, Γ, Ψ) be a soft-GSLUS. Then:
If , then G ⊑ H;
If , then ;
If G ⊑ H, then ;
;
;
If , then there is with .
Proposition 3.11. Let (Z, Γ, Ψ) be a soft-GSLUS. Then iff G ∈ ϑ
Γ.
Proof: Let . Then, From Theorems 2.11 and 3.9, iff there is M ∈ Γ with iff G ∈ ϑ
Γ. □
Proposition 3.12. Let (Z, Γ, Ψ) be a soft-GSLUS with the soft base Θ. For Φ ≠ G ∈ S (Z, Ψ), then is a base of .
Proof: For every M ∈ Θ, is a member of . If then, by Corollary 3.5, there is M ∈ Θ with . Now, if , then for some and so . Therefore, . □
The proof of the following proposition follows directly from Theorems 3.9 and 3.3.
Proposition 3.13. Let (Z, Γ, Ψ) be a a soft-GSLUS. If Φ ≠ G ∈ S (Z, Ψ), then iff .
Application of soft semi-linear uniform spaces in the classification of digital images
In this section, we investigate the natural transformation of a soft semi-linear uniform space to a soft proximity to introduce the perceptual application of soft semi-linear uniform structures. Peters et al. ([22, 23]) introduced the notion of perceptual nearness via probe map and employed it in the classification of digital images. Let (the set of all real numbers) be the initial universe and Z be a set of pixels of a digital picture. A probe map is defined by
which gives different feature values φn (x) of a pixel x. Here, are mappings that describe a pixel x perceptually (see [23]). Two sets are perceptually near iff they are never empty and they contain pairs of perceived objects that have descriptions within some tolerance of each other.
Perceptual objects that have the same appearance are considered perceptually near each other, i . e ., objects with matching descriptions. A description is a set of values of mappings representing features of an object. To clarify that, assume the description of an object consists of one mapping value. For example, let b ∈ L, b′ ∈ L′ be books contained in two libraries L, L′ and φ (b) = number of pages in b, where φ is a sample map representing book length and book length is a feature of a book. If φ (b) = φ (b′), then book b is near book b′ (see [22]).
Let H ⊆ Z. Then H can be viewed as a soft set on the universe by
where φ (x) = {φ1 (x) , φ2 (x) , ⋯ , φn (x)} .
In the next example, we illustrate how we can construct visual soft sets of a digital image and investigate soft semi-linear uniform space to classify digital images. A similar approach to classify digital images via rough sets can be found in ([28, 31–33]).
Example 4.1. Consider the image of a butterfly in Fig. 1(A). An extracted part of it is shown in Fig. 1(B), which we will consider on the universe . Assume that the feature value-color for classification of images and the set of pixels in Fig. 1(B) is Z. The color strength of each pixel x can be described as φ (x) = {φr (x) , φg (x) , φb (x)} , where φr (x) , φg (x) , φb (x) represent the red, green and blue intensity values of the pixel x, respectively. Each intensity value is on a scale of 0 to 255. The probe mapping of each pixel represents its RGB value. Define a map as:
Define Θ
ɛ = {(x, y) ∈ SP (Z) × SP (Z) : Π (x, y) < ɛ} ,
Digital image of a butterfly.
for every and 0 < ɛ < 2 .
Then {Θ
ɛ : 0< ɛ < 2 } is a soft base for a soft semi-linear uniform Γ on Z. Two subsets H and G of SP (Z) are called perceptually near (Hξ
ΓG) if the following holds: Hξ
ΓG iff (H × G) ⊓ Θ
ɛ ≠ ∅ , for all Θ
ɛ ∈ Γ.
Here ξ
Γ is a soft proximity on Z.
Let A and B denote two sets of pixels, as shown in Fig. 1(B). Then A and B are two soft sets on the universe with:
and
where φ (x) = {φr (x) , φg (x) , φb (x)} is the probe mapping which gives color strength of x ∈ A, x ∈ B and φr (x) , φg (x) , φb (x) ∈ {0, 1, 2, 3, …, 255}. We have chosen RGB values as a feature values of elements (pixels). In Fig. 1(B), we may verify that the sets B and C are perceptually near. Also, the sets A and C are perceptually far from each other as the RGB values of every element in C have a difference more than 2 from RGB values of each element of B . In this way, we can classify digital images by using different feature values. We can distinguish different kinds of objects in the picture on a digital platform by using far (not near) relation .
Conclusion
In this manuscript, we learned about the concept of soft-SLUS and its generalization, as well as some of its most important properties. The definition of soft-SLUS allowed us to define the two soft maps and on SP (Z) × SP (Z) then we employed them to define when a soft mapping φ
ψ is soft semi-linear uniformly continuous. Following that, we investigated the members of soft-GSLUS to introduce a soft proximity space then we distinguished this work from previous research in soft uniformity by demonstrating the perceptual application of soft semi-linear uniform structures via the natural transformation of a soft-SLUS to a soft proximity.
Since the fixed point theory is important in many areas of mathematics and applied sciences including mathematical models, optimization and economic theories, we intend to investigate the soft maps and to define the soft contraction for studying the fixed point.
Declarations
Conflict of intersect. The authors declare that there is no conflict of interests regarding the publication of this article.
Footnotes
Acknowledgment
The publication of this paper was supported by Jordan University Research council.
References
1.
AliM.I., FengF., LiuX., MinW.K. and ShabirM., On some newoperations in soft set theory, Comput. Math. Appl.57(2009) (2009), 1547–1553.
2.
Al-shamiT.M., MhemdiA., RawshdehA.A. and Al-jarrahH.H., Softversion of compact and Lindelöf spaces using soft somewhere dense sets, AIMS Mathematics6(8) (2021), 8064–8077.
3.
AygünogluA. and AygünH., Some notes on softtopological spaces, Neural Comput. Appl.21 (2012), 113–119.
4.
BabithaK.V. and SunilJ.J., Soft set relations and functions, Comput. Math. Appl.60 (2010), 1840–1849.
5.
BourbakiN., Elements of Mathematics: General Topology, Part 1, Hermann, Paris (1966).
6.
ÇağmanN. and EnginoğluS., Soft matrix theory and itsdecision making, Comput. Math. Appl.59 (2010), 3308–3314.
7.
ÇetkinV. and AygünH., Uniformity structure in the contextof soft set, Ann. Fuzzy Math. Inform.6 (2013), 69–76.
8.
DasS. and SamantaS.K., Soft metric, Ann. Fuzzy Math.Inform.6 (2013), 77–94.
9.
DemirI., ÖzbakırO.B. and YıldızI., On fixed softelement theorems in se-uniform spaces, J. Nonlinear Sci.Appl.9 (2016), 1230–1242.
10.
DemirI., ÖzbakirO.B. and YıldızI., A contribution tothe study of soft proximity spaces, Filomat31(7) (2017), 2023–2034.
11.
HussainS. and AhmadB., Soft separation axioms in soft topologicalspace, Hacet. J. Math. Stat.44(3) (2015), 559–568.
12.
KandilA., TantawyO.A., El-SheikhS.A. and ZakariaA., Newstructures of proximity spaces, Inf. Sci. Lett.3(3) (2014), 85–89.
13.
KharalA. and AhmadB., Mappings on soft classes, New Math.Nat. Comput.7 (2011), 471–481.
14.
LiZ. and XieT., The relationship among soft sets, soft rough setsand topologies, Soft Comput.18 (2014), 717–728.
15.
LinF., Soft connected spaces and soft paracompact spaces, Int. J. Math. Comput. Sci. Eng.7 (2013), 754–760.
16.
MajiP.K., BiswasR. and RoyA.R., Soft set theory, Comput.Math. Appl.45 (2003), 555–562.
17.
MajiP.K. and RoyA.R., An application of soft sets in a decisionmaking problem, Comput. Math. Appl.44 (2002), 1077–1083.
18.
MolodtsovD., Soft set theory-first results, Comput. Math.Appl.37 (1999), 19–31.
19.
NazmulS. and SamantaS.K., Neighbourhood properties of softtopological spaces, Ann. Fuzzy Math. Inform.6 (2013), 1–15.
20.
ÖzbakirO.B. and DemirI., On the soft uniformity and its someproperties, J. Math. Comput. Sci.5 (2015), 762–779.
21.
PeiD. and MiaoD., From soft sets to information systems, In: X. Hu, Q. Liu, A. Skowron, T.Y. Lin, R.R. Yager and B. Zhang (Eds.), Proceedings of Granular Computing, IEEE2 (2005), 621–621.
22.
PetersJ.F., Near sets. General theory about nearness of objects, Appl. Math. Sci.1(53) (2007), 2609–2629.
23.
PetersJ.F., SkowronA. and StepaniukJ., Nearness of visualobjects. application of rough sets in proximity spaces, Fund. Inform.128 (2013), 159–176.
24.
RawshdehA., Precompact in a generalization of semi-linear uniformspaces, Afr. Mat.32 (2021), 1585–1593.
25.
RawshdehA., Al-jarrahH., Al-hihiS. and JafariS., Weak semi linear uniform spaces, Missouri J. Math. Sci.34(2) (2022), 132–145.
26.
RawshdehA. and TallafhaA., Fixed point in semi-linear uniformspaces and convex metric spaces, Iranian J. Math. Sci. Info.16(2) (2021), 11–23.
27.
ShabirM. and NazM., On soft topological spaces, Comput. Math. Appl.61 (2011), 1786–1799.
28.
SinghP.K. and TiwariS., Topological Structures in Rough SetTheory: A Survey, Hacet. J. Math. Stat.49(4) (2020), 1270–1294.
29.
SinghP.K. and TiwariS., A fixed point theorem in roughsemi-linear uniform spaces, Theoretical Computer Science851 (2021), 111–120.
30.
TallafhaA. and KhalilR., Best approximation in uniformity typespaces, Eur. J. Math. Sci.2 (2013), 334–340.
31.
TiwariS. and SinghP.K., An approach of proximity in rough settheory, Fund. Inform.166(3) (2019), 251–271.
32.
TiwariS. and SinghP.K., Čech rough proximity spaces, Mat.Vesnik72(1) (2019), 6–16.
33.
TiwariS. and SinghP.K., Rough semi-uniform spaces and its imageproximities, Elec. Res. Arch.28(2) (2020), 095–1106.
34.
Yasin ÖztürkT., A new approach to soft uniform spaces, Turk. J. Math.40 (2016), 1071–1084.
35.
YükselŞ., TozluN. and Güzel ErgülZ., Softfilter, Math. Sci. (Springer)8(1) (2014), Art. 119, 6.
36.
ZorlutunaI., AkdagM., MinW.K. and AtmacaS., Atmaca, Remarks on soft topological spaces, Ann. Fuzzy Math. Inform.3 (2012), 171–185.