Next Article in Journal
Positional Effects of a Fly’s Wing Vein in the Asymmetric Distribution of Hydraulic Resistances
Previous Article in Journal
Two-Step Simplified Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Three Weaker Forms of Soft Faint Continuity

1
Department of Mathematics and Statistics, Jordan University of Science and Technology, Irbid 22110, Jordan
2
Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(9), 1211; https://doi.org/10.3390/sym16091211
Submission received: 18 August 2024 / Revised: 9 September 2024 / Accepted: 11 September 2024 / Published: 14 September 2024
(This article belongs to the Section Mathematics)

Abstract

:
The authors of this paper introduce and discuss three weaker forms of soft faint continuity: soft faint semi-continuity, soft faint pre-continuity, and soft faint β -continuity. They characterize each of them in several ways. They also demonstrate how they are preserved under some restrictions. Moreover, they prove that a soft function is also soft faint semi-continuous (resp. soft faint pre-continuous, soft faint β -continuous) if its soft graph function is also soft faint semi-continuous (resp. soft faint pre-continuous, soft faint β -continuous). Moreover, they show that a soft function is soft faint semi-continuous (resp. soft faint pre-continuous, soft faint β -continuous) iff it is soft semi-continuous provided that it has a soft regular codomain. Finally, the symmetry between our new ideas and their analogous topological ones is investigated.

1. Introduction and Preliminaries

It is a common problem for scientists in many fields, such as economics, systems engineering, medicine, artificial intelligence, and others, to build complicated systems that involve uncertainty. Though widely used, “mathematical” approaches for handling such circumstances, conventional probability, fuzzy set [1], and rough set [2] theories, are unable to, due to parameter constraints, consistently generate satisfactory answers. Molodtsov [3] looked into soft set theory, a novel method for handling uncertainty in a way that surpasses the limitations of previous methods. The method uses soft sets, which lead to a universal set’s parameterized collection of subsets. Soft set theory, in contrast to earlier methods, does not impose any specific limitations on object lighting, and parameters can be selected in a number of ways, such as words, phrases, integers, and mappings. Because of this, the theory is highly flexible and simple to use in practical settings. Molodtsov demonstrated the versatility and wide applicability of soft set theory by extending it to a range of subjects, such as probability studies and game theory. Other scholars provide a variety of practical uses for soft sets and their expansions (see [4,5,6,7,8,9,10]).
General topology is a well-known and significant area of mathematics that deals with the application of set theory concepts and topological structures. Soft topology is a new topic of topology study established in 2011 [11], combining soft sets and topology concepts. The main concepts they introduced were soft open sets, soft neighborhoods, soft closure of a soft set, soft separation axioms, and soft regular and soft normal spaces. A few examples of classical topological ideas that have been extended and developed in soft set settings are presented in [12,13,14,15,16,17,18,19,20,21,22,23,24]. The notion of soft mapping with details was first presented in [25], and then, soft continuity for soft mappings was defined in [26]. Since then, researchers have focused on the study of soft continuity concepts (see [27,28,29,30,31,32]).
“Soft topology” is a useful extension of classical topology. There are several advantages of soft topology over standard topology, including the following: (i) Open set identification accuracy is increased by the soft topological structure. In contrast to soft topology, which permits the inclusion of intermediate degrees of openness, general topology works with binary ideas. This helps to provide more accurate information about the topological space’s characteristics. (ii) Classical topology is one instance of the broad area of soft topology. Since soft topology relaxes the rigid restrictions of classical topology, it broadens the range of topological structures and is therefore a valuable tool for comprehending a greater variety of complicated and varied settings. (iii) Since soft topology is the most efficient means of expressing uncertainty and imprecision, researchers have used it in computer science, image processing, fuzzy logic, and decision-making. (iv) When dealing with ambiguous or unclear data, soft topology is a useful mathematical modeling tool. It works especially well for encoding and assessing imprecise data, which is frequently encountered in real-world applications.
A lot of study has been done on soft continuity in soft topology and other math fields. Soft continuity is widely used in many fields, such as science, engineering, business, and economics. This encouraged us to write this work.
This work introduces and investigates three weak types of soft faint continuity: soft faint semi-continuity, soft faint pre-continuity, and soft faint β -continuity.
Let L be a set of parameters and let O be a non-empty set. A soft set over O relative to L is a function G : O P ( L ) . S S ( O , L ) represents the collection of all soft sets over O relative to L . If K S S ( O , L ) such that K ( b ) = X for any b L (resp. K d = X and K b = for each b L d ), then K is represented by C X (resp. d X ). 1 L and 0 L will denote C O and C , respectively. If K S S ( O , L ) , then K is a soft point over O relative to L and represented as d y if K ( d ) = { y } and K ( b ) = for any b L { d } . S P ( O , L ) represents the collection of all soft points over O with respect to L . If d y S P O , L and K S S ( O , L ) , then d y is said to belong to K (notation: d y ˜ K ) if y K d . Let K , H S S ( O , L ) . Then, K is a soft subset of H, denoted by K ˜ H , if K a H ( a ) for each a L . The soft union (resp. intersection, difference) of K and H is denoted by K ˜ H (resp. K ˜ H , K H ) and defined by K ˜ H a = K a H ( a ) (resp. K ˜ H a = K a H ( a ) , K H a = K a H a ) for each a L . For any sub-collection K S S ( O , L ) , the soft union (resp. intersection) of the members of K is denoted by ˜ K K K (resp. ˜ K K K ) and defined by ˜ K K K a = K K K a (resp. K K K a ) for each a L . Let S S O , L and S S T , S be two families of soft sets, and r : O T , w : L S be two functions. Then, a soft mapping f r w : S S O , L S S T , S is defined as follows: for each H S S O , L and K S S T , S , f r w H ( b ) = if w 1 b = , f r w H ( b ) = a w 1 b r H a if w 1 b , and f r w 1 K ( a ) = r 1 K w a . A sub-collection σ S S O , L is called a soft topology on O relative to L , and the triplet ( O , σ , L ) is called a soft topological space if 0 L , 1 L σ , K ˜ H σ for any K , H σ , and ˜ K K K for any K σ . Let ( O , σ , L ) be a soft topological space and let K S S ( O , L ) . Then, K is called a soft open set in ( O , σ , L ) if K σ and K is called a soft closed set in ( O , σ , L ) if 1 L K σ .
In this paper, we will follow the terminology and concepts from [15,33], and we will denote a topological space as TS and a soft topological space as STS.
Let O , be a TS, ( O , σ , L ) be an STS, X O , and H S ( O , L ) . Then, the closure of X in O , , the interior of X in O , , the soft closure of H in ( O , σ , L ) , and the soft interior of H in ( O , σ , L ) will be denoted by C l ( X ) , I n t ( X ) , C l σ ( H ) , and I n t σ ( H ) , respectively, and the family of all closed sets in O , (resp. soft closed sets in ( O , σ , L ) ) will be denoted by c (resp. σ c ).
We will use the following definitions and notations in the sequel.
Definition 1. 
Let O , be a TS and let A O . Then, A is called a semi-open [34] (resp. pre-open [35], β-open [36]) set in O , if A C l I n t A (resp. A I n t C l A , A C l I n t C l A ). The collection of all semi-open sets (resp. pre-open sets, β-open sets) in O , will be denoted by S O (resp. P O , β O ).
Definition 2. 
A function g : O , T , is called semi-continuous (S-C) [34] (resp. pre-continuous (P-C) [35], β-continuous (β-C) [36]) if g 1 V S O (resp. g 1 V P O , g 1 V β O ) for every V .
Definition 3. 
A function g : O , T , is called faintly continuous (F-C) [37] (resp. faintly semi-continuous (F-S-C) [38], faintly pre-continuous (F-P-C) [38], faintly β-continuous (F-β-C) [38]) if g 1 V (resp. g 1 V S O , g 1 V P O , g 1 V β O ) for every V θ .
Definition 4 
([38]). A function g : O , T , is called quasi-θ-continuous if g 1 V θ for every V θ .
Definition 5. 
Let O , φ , P be an STS and let H S S O , P . Then:
(a) 
H is called a soft semi-open [39] (resp. soft pre-open [40], soft β-open [40]) set in O , φ , P if H ˜ C l φ I n t φ H (resp. H ˜ I n t φ C l φ H , H ˜ C l φ I n t φ C l φ H ). The collection of all soft semi-open sets (resp. soft pre-open sets, soft β-open sets) in O , φ , P will be denoted by S O φ (resp. P O φ , β O φ ).
(b) 
H is called a soft semi-closed [39] (resp. soft pre-closed [40], soft β-closed [40]) set in O , φ , P if O H S O φ (resp. O H P O φ , O H β O φ ). The collection of all soft semi-open sets (resp. soft pre-open sets, soft β-open sets) in O , φ , P will be denoted by S C φ (resp. P C φ , β C φ ).
Definition 6. 
A soft function f r w : O , φ , P T , σ , S is said to be called soft semi-continuous (soft S-C) [41] (resp. soft pre-continuous (soft P-C) [42], soft β-continuous (soft β-C) [43]) if f r w 1 H S O φ (resp. f r w 1 H P O φ , f r w 1 H β O φ ) for every H σ .
Definition 7 
([44]). Let O , φ , P be an STS and let G S S ( O , P ) . Then, G is called a soft θ-open set in O , φ , P if for every a x ˜ G, there exists H∈φ such that a x ˜ H ˜ C l φ ( H ) ˜ G . The family of all soft θ-open sets in O , φ , P is denoted by φ θ .
It is well known that φ θ φ and φ θ φ in general.
Definition 8 
([15]). A soft function f r w : O , φ , P T , σ , S is said to be soft faintly continuous (soft F-C) if, for every a t SP(O, P ) and K σ θ with f r w a t ˜ K , we find H φ such that a t ˜ H and f r w H ˜ K .
Definition 9. 
Let O , φ , P be an STS and let H S S O , P . Then, we obtain the following:
(a) 
s I n t φ ( H ) = ˜ R : R S O φ and R ˜ H .
(b) 
p I n t φ ( H ) = ˜ R : R P O φ and R ˜ H .
(c) 
β I n t φ ( H ) = ˜ R : R β O φ and R ˜ H .
(d) 
s C l φ ( H ) = ˜ L : L S C φ and H ˜ L .
(e) 
p C l φ ( H ) = ˜ L : L P C φ and H ˜ L .
(f) 
β C l φ ( H ) = ˜ L : L β C φ and H ˜ L .

2. Soft Faint Semi-Continuity

Definition 10. 
A soft function f r w : O , φ , P T , σ , S is said to be soft faintly semi-continuous (soft F-S-C, for simplicity) if, for every a t SP(O, P ) and K σ θ with f r w a t ˜ K , we find H S O φ such that a t ˜ H and f r w H ˜ K .
Theorem 1. 
For a soft function f r w : O , φ , P T , σ , S , the following are equivalent:
(a) 
f r w is soft F-S-C.
(b) 
f r w : O , φ , P T , σ θ , S is soft S-C.
(c) 
f r w 1 ( K ) S O φ for every K σ θ .
(d) 
f r w 1 ( G ) S C φ for every G σ θ c .
(e) 
s C l φ ( f r w 1 ( H ) ) ˜ f r w 1 ( C l σ θ ( H ) ) for every H S S ( T , S ) .
(f) 
f r w 1 ( I n t σ θ K ) ˜ s I n t φ f r w 1 ( K ) for every K S S ( T , S ) .
Proof. 
(a)
⟶ (b): Let K σ θ and let m r ˜ f r w 1 ( K ) . Then, f r w a t ˜ K , and, by (a), we find H S O φ such that a t ˜ H and f r w H ˜ K . Hence, a t ˜ H ˜ f r w 1 f r w H ˜ f r w 1 K . Therefore, f r w 1 ( K ) S O φ .
(b)
⟶ (c): Clear.
(c)
⟶ (d): Let G σ θ c . Then, 1 S G σ θ , and, by (c), f r w 1 ( 1 S G ) = 1 P f r w 1 ( G ) S O φ . Hence, f r w 1 ( G ) S C φ .
(d)
⟶ (e): Let H S S ( T , S ) . Then, C l σ θ ( H ) σ θ c and, by (d), f r w 1 ( C l σ θ ( H ) ) S C φ . Thus, f r w 1 ( C l σ θ ( H ) ) = s C l φ f r w 1 ( C l σ θ ( H ) ) . Since f r w 1 ( H ) ˜ f r w 1 ( C l σ θ ( H ) ) , then s C l φ f r w 1 ( H ) ˜ s C l φ f r w 1 ( C l σ θ ( H ) ) = f r w 1 ( C l σ θ ( H ) ) .
(e)
⟶ (f): Let K S S ( T , S ) . Then, by (e), s C l φ ( f r w 1 ( 1 S K ) ) ˜ f r w 1 ( C l σ θ ( 1 S K ) ) . However,
s C l φ ( f r w 1 ( 1 S K ) ) = s C l φ ( 1 P f r w 1 ( K ) ) = 1 P s I n t φ ( f r w 1 ( K ) )
and
f r w 1 ( C l σ θ ( 1 S K ) ) = f r w 1 ( 1 S I n t σ θ G ) = 1 P f r w 1 I n t σ θ ( G ) .
Thus, 1 P s I n t φ ( f r w 1 ( G ) ) ˜ 1 P f r w 1 I n t σ θ ( G ) and hence, f r w 1 ( I n t σ θ G ) ˜ s I n t φ f r w 1 ( G ) .
(f)
⟶ (a): Let a t S P ( O , P ) and K σ θ such that f r w a t ˜ K . Then, I n t σ θ K = K . So, by (f), f r w 1 ( K ) = f r w 1 ( I n t σ θ K ) ˜ s I n t φ f r w 1 ( K ) and, thus, f r w 1 ( K ) ˜ s I n t φ f r w 1 ( K ) . Therefore, f r w 1 ( K ) = s I n t φ f r w 1 ( K ) , and, hence, f r w 1 ( K ) S O φ . We set H = f r w 1 ( K ) . Then, H S O φ such that a t ˜ H and f r w H = f r w f r w 1 ( K ) ˜ K . Therefore, f r w is soft F-S-C.
Theorem 2. 
Let X , φ a : a P and Y , σ b : b S be two collections of TSs. We consider the functions r : X Y and w : P S , where w is a bijection. Then, f r w : X , a P φ a , P Y , b S σ b , S is soft F-S-C iff r : X , φ a Y , σ w ( a ) is F-S-C for all a P .
Proof. 
Necessity. Let f r w : X , a P φ a , P Y , b S σ b , S be soft F-S-C. Let a P . Let U σ w ( a ) θ . Then, according to Theorem 2.21 of [45], w ( a ) U b S σ b θ . So, f r w 1 w ( a ) U S O a P φ a . Since w : P S is injective, f r w 1 w ( a ) U = a r 1 ( U ) . Therefore, by Theorem 4.10 of [46], a r 1 ( U ) ( a ) = r 1 ( U ) S O ( φ a ) . This shows that r : X , φ a Y , σ w ( a ) is F-S-C.
Sufficiency. Let r : X , φ a Y , σ w ( a ) be F-S-C for all a P . Let G b S σ b θ . Then, by Theorem 2.21 of [45], G ( b ) σ b θ for all b S . For every b S , r : X , φ w 1 ( b ) Y , σ b is F-S-C, and, so, r 1 G ( b ) S O φ r 1 ( b ) . Hence, for each a P , f r w 1 G ( a ) = r 1 ( G ( w ( a ) ) S O φ w 1 ( w ( a ) ) = S O φ a . Therefore, by Theorem 4.10 of [46], f r w 1 G S O a P φ a . This shows that f r w : X , a P φ a , P Y , b S σ b , S is soft F-S-C. □
Corollary 1. 
We consider the functions r : O , T , and w : P S , where w is a bijection. Then, r : O , T , is F-S-C iff f r w : ( O , τ , P ) ( T , τ , S ) is soft F-S-C.
Proof. 
For each a P and b S , we set φ a = and σ b = . Then, τ = a P φ a and τ = b S σ b . Theorem 2 ends the proof. □
Theorem 3. 
Let X , φ a : a P and Y , σ b : b S be two collections of TSs. We consider the functions r : X Y and w : P S , where w is a bijection. Then, f r w : X , a P φ a , P Y , b S σ b , S is soft S-C iff r : X , φ a Y , σ w ( a ) is S-C for all a P .
Proof. 
Necessity. Let f r w : X , a P φ a , P Y , b S σ b , S be soft S-C. Let a P . Let U σ w ( a ) θ . Then, w ( a ) U b S σ b θ . So, f r w 1 w ( a ) U S O a P φ a . Since w : P S is injective, f r w 1 w ( a ) U = a r 1 ( U ) . Therefore, by Theorem 4.10 of [46], a r 1 ( U ) ( a ) = r 1 ( U ) S O ( φ a ) . This shows that r : X , φ a Y , σ w ( a ) is S-C.
Sufficiency. Let r : X , φ a Y , σ w ( a ) is S-C for all a P . Let G b S σ b . Then, G ( b ) σ b for all b S . For every b S , r : X , φ w 1 ( b ) Y , σ b is S-C, and, so, r 1 G ( b ) S O φ r 1 ( b ) . Hence, for each a P , f r w 1 G ( a ) = r 1 ( G ( w ( a ) ) S O φ w 1 ( w ( a ) ) = S O φ a . Therefore, by Theorem 4.10 of [46], f r w 1 G S O a P φ a . This shows that f r w : X , a P φ a , P Y , b S σ b , S is soft S-C. □
Corollary 2. 
We consider the functions r : O , T , and w : P S , where w is a bijection. Then, r : O , T , is S-C iff f r w : ( O , τ , P ) ( T , τ , S ) is soft S-C.
Proof. 
For each a P and b S , we set φ a = and σ b = . Then, τ = a P φ a and τ = b S σ b . Theorem 3 ends the proof. □
Theorem 4. 
Every soft F-C function is soft F-S-C.
Proof. 
Let f r w : O , φ , P T , σ , S be soft F-C. Let G σ θ . Then, f r w 1 ( G ) φ S O φ . Consequently, f r w is soft F-S-C. □
Theorem 5. 
Every soft S-C function is soft F-S-C.
Proof. 
Let f r w : O , φ , P T , σ , S be soft S-C. Let G σ θ . Then, G σ . So, f r w 1 ( G ) S O φ . Consequently, f r w is soft F-S-C. □
The converse of Theorem 4 need not be true in general.
Example 1. 
Let X = a , b , c , P = R , = , X , a , b , a , b , and = , X , a , b , a , b , a , c . We consider the identities functions r : X , X , and w : P P . Since C l a = a , c , then r 1 a , c = a , c S O . Hence, r : X , X , is S-C, and, by Theorem 4.1 (a) of [38], it is F-S-C. On the other hand, since a , c θ while r 1 a , c = a , c , then r : X , X , is not F-C.
Therefore, by Corollary 1 and Corollary 1 of [15], f r w : ( X , τ , P ) ( X , τ , P ) is soft F-S-C but not soft F-C.
The converse of Theorem 5 need not be true in general.
Example 2. 
Let X = a , b , Y = 1 , 2 , 3 , = , X , b , = , Y , 1 , 2 , 1 , 2 , and P = N . We define r : X , Y , and w : P P by r a = 1 , r b = 2 , and w t = t for all t P . Since θ = , Y , then r : X , X , is F-C. On the other hand, since 1 while r 1 1 = a S O , then r : X , X , is not S-C.
Therefore, by Corollaries 1 and 2, f r w : ( X , τ , P ) ( Y , τ , P ) is soft F-C but not soft S-C. Finally, by Theorem 4, f r w is soft F-S-C.
Theorem 6. 
Let T , σ , S be soft regular. The following are equivalent for a soft function f r w : O , φ , P T , σ , S :
(a) 
f r w is soft S-C.
(b) 
f r w is soft F-S-C.
Proof. 
(a)
⟶ (b): Follows from Theorem 5.
(b)
⟶ (c): Let K σ . Since T , σ , S is soft regular, then σ = σ θ . So, K σ θ and, by (b), f r w 1 ( K ) S O φ . This shows that f r w is soft S-C.
Theorem 7. 
Let f r w : O , φ , P T , σ , S be a soft function. If f r # w # : O , φ , P O × T , p r φ × σ , P × S is soft F-S-C, then f r w : O , φ , P T , σ , S is soft F-S-C.
Proof. 
Let H σ θ . Since 1 P φ θ , by Theorem 10 of [15], 1 P × H p r φ × σ θ . Since f p # u # : O , φ , P R × L , p r φ × σ , M × N is soft F-S-C, by Theorem 1b, f r # w # 1 1 P × H S O φ . By Lemma 2 of [15], f r # w # 1 1 P × H = 1 P ˜ f r w 1 H = f r w 1 H , and, hence, f r w 1 H S O φ . Thus, again, by Theorem 1b, f r w : O , φ , P T , σ , S is soft F-S-C. □
Lemma 1. 
Let O , φ , P be an STS. If A φ and X is a non-empty subset of O such that C X P O φ , then C l φ A ˜ C X ˜ C l φ X A ˜ C X .
Proof. 
Let d z ˜ C l φ A ˜ C X . Let G φ X such that d z ˜ G . We choose L φ such that G = L ˜ C X . Since C X P O φ , then C X ˜ I n t φ C l φ C X . Since d z ˜ L ˜ I n t φ C l φ C X φ and d z ˜ C l φ A , then L ˜ I n t φ C l φ C X ˜ A 0 P . Hence, L ˜ C l φ C X ˜ A 0 P . We choose b y ˜ L ˜ C l φ C X ˜ A . Since b y ˜ L ˜ A φ and b y ˜ C l φ C X , then L ˜ A ˜ C X 0 P . Hence, G ˜ A ˜ C X = L ˜ C X ˜ A ˜ C X = L ˜ A ˜ C X 0 P . It follows that d z ˜ C l φ X A ˜ C X . □
Proposition 1. 
Let O , φ , P be an STS. If A S O φ and X is a non-empty subset of O such that C X P O φ , then A ˜ C X S O φ X .
Proof. 
Since A S O φ , there exists H φ such that H ˜ A ˜ C l φ H , and, so, H ˜ C X ˜ A ˜ C X ˜ C l φ H ˜ C X . On the other hand, by Lemma 1, C l φ H ˜ C X ˜ C l φ X H ˜ C X . Thus, we have H ˜ C X φ X and H ˜ C X ˜ A ˜ C X ˜ C l φ X H ˜ C X . Hence, A ˜ C X S O φ X . □
Theorem 8. 
If f r w : O , φ , P T , σ , S is a soft F-S-C function and X O such that C X P O φ 0 P , then f r w C X : X , φ X , P T , σ , S is soft F-S-C.
Proof. 
Let K σ θ . Since f r w : O , φ , P T , σ , S is soft F-S-C, by Theorem 1b, f r w 1 ( K ) S O φ . So, by Proposition 1, f r w C X 1 ( H ) = C X ˜ f r w 1 ( H ) S O φ X . Hence, again, by Theorem 1b, f r w C X : X , φ X , M T , σ , S is soft F-S-C. □
Definition 11. 
A soft function f r w : O , φ , P T , σ , S is called soft quasi-θ-continuous if f r w 1 ( K ) φ θ for every K σ θ .
Theorem 9. 
A soft function f r w : O , φ , P T , σ , S is soft quasi-θ-continuous iff f r w 1 ( K ) φ θ c for every K σ θ c .
Proof. 
Straightforward. □
Theorem 10. 
Let X , φ a : a P and Y , σ b : b S be two collections of TSs. Let r : X Y and w : P S be two functions, with r being a bijection. Then, f r w : X , a P φ a , P Y , b S σ b , S is soft quasi-θ-continuous iff r : X , φ a Y , σ w ( a ) is quasi-θ-continuous for all a P .
Proof. 
Necessity. Let f r w : X , a P φ a , P Y , b S σ b , S be soft quasi- θ -continuous. Let a P . Let U σ w ( a ) θ . Then, according to Theorem 2.21 of [45], w ( a ) U b S σ b θ . So, f r w 1 w ( a ) U a P φ a θ . Since w : P S is injective, f r w 1 w ( a ) U = a r 1 ( U ) . Therefore, by Theorem 2.21 of [45], a r 1 ( U ) ( a ) = r 1 ( U ) S O ( φ a ) . This shows that r : X , φ a Y , σ w ( a ) is quasi- θ -continuous.
Sufficiency.  r : X , φ a Y , σ w ( a ) is quasi- θ -continuous for all a P . Let G b S σ b θ . Then, by Theorem 2.21 of [45], G ( b ) σ b θ for all b S . For every b S , r : X , φ w 1 ( b ) Y , σ b is quasi- θ -continuous, and, so, r 1 G ( b ) S O φ r 1 ( b ) . Hence, for each a P , f r w 1 G ( a ) = r 1 ( G ( w ( a ) ) φ w 1 ( w ( a ) ) θ = φ a θ . Therefore, by Theorem 2.21 of [45], f r w 1 G a P φ a θ . This shows that f r w : X , a P φ a , P Y , b S σ b , S is soft quasi- θ -continuous. □
Corollary 3. 
Let r : X , Y , be a function between two TSs, and let w : P S be a bijective function. Then, r : X , Y , is quasi-θ-continuous iff f r w : ( X , τ , P ) ( Y , τ , S ) is soft quasi-θ-continuous.
Proof. 
For each a P and b S , we set φ a = and σ b = . Then, τ = a P φ a and τ = b S σ b . Theorem 10 ends the proof. □
Theorem 11. 
If f r w : O , φ , P T , σ , S is soft θ-continuous, then f r w is soft quasi-θ-continuous.
Proof. 
The proof follows from Theorem 9 and Corollary 5.30 of [44]. □
It is not difficult to check that the soft function defined in Example 2 is soft quasi- θ -continuous but not soft θ -continuous.
Theorem 12. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-S-C and f r 2 w 2 : T , σ , S N , λ , L is soft quasi-θ-continuous, then f r 2 r 1 w 2 w 1 is soft F-S-C.
Proof. 
Let K λ θ . Then, f r 2 w 2 1 K σ θ and, hence, f r 2 r 1 w 2 w 1 1 K = f r 1 w 1 1 f r 2 w 2 1 K S O φ . Therefore, f r 2 r 1 w 2 w 1 is soft F-S-C. □
The following result follows from Theorems 11 and 12:
Corollary 4. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-S-C and f r 2 w 2 : T , σ , S N , λ , L is soft θ-continuous, then f r 2 r 1 w 2 w 1 is soft F-S-C.
Corollary 5. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-S-C and f r 2 w 2 : T , σ , S N , λ , L is soft continuous, then f r 2 r 1 w 2 w 1 is soft F-S-C.
Proof. 
It follows from Corollary 4 and the fact that soft continuous functions are soft θ -continuous. □
The subsequent illustrations demonstrate that, according to Corollary 5, the composition in reverse order may not possess the same quality.
Example 3. 
Let X = a , b , c , = , X , a , b , a , b , b , c , = , X , a , b , a , b , = , X , a , b , a , b , c , c , and P = N . Let r 1 : X , X , , r 2 : X , X , , and w : P P be the identity functions. Then, f r 1 w : X , τ , P X , τ , P is soft continuous and f r 2 w : X , τ , P X , τ , P is soft S-C (and, hence, soft F-S-C), while f r 2 r 1 w w is not soft F-S-C.

3. Soft Faint Pre-Continuity

Definition 12. 
A soft function f r w : O , φ , P T , σ , S is called soft faintly pre-continuous (soft F-P-C, for short) if, for each a t SP(O, P ) and K σ θ such that f r w a t ˜ K , we find H P O φ such that a t ˜ H and f r w H ˜ K .
Theorem 13. 
For a soft function f r w : O , φ , P T , σ , S , the following are equivalent:
(a) 
f r w is soft F-P-C.
(b) 
f r w : O , φ , P T , σ θ , S is soft P-C.
(c) 
f r w 1 ( K ) P O φ for every K σ θ .
(d) 
f r w 1 ( G ) P C φ for every G σ θ c .
(e) 
p C l φ ( f p u 1 ( H ) ) ˜ f p u 1 ( C l σ θ ( H ) ) for every H S S ( T , S ) .
(f) 
f p u 1 ( I n t σ θ K ) ˜ p I n t φ f r w 1 ( K ) for every K S S ( T , S ) .
Proof. 
(a)
⟶ (b): Let K σ θ and let m r ˜ f r w 1 ( K ) . Then, f r w a t ˜ K , and, by (a), we find H P O φ such that a t ˜ H and f r w H ˜ K . Hence, a t ˜ H ˜ f r w 1 f r w H ˜ f r w 1 K . Therefore, f r w 1 ( K ) P O φ .
(b)
⟶ (c): Clear.
(c)
⟶ (d): Let G σ θ c . Then, 1 S G σ θ , and, by (c), f r w 1 ( 1 S G ) = 1 P f r w 1 ( G ) P O φ . Hence, f r w 1 ( G ) P C φ .
(d)
⟶ (e): Let H S S ( T , S ) . Then, C l σ θ ( H ) σ θ c and, by (d), f r w 1 ( C l σ θ ( H ) ) P C φ . Thus, f r w 1 ( C l σ θ ( H ) ) = p C l φ f r w 1 ( C l σ θ ( H ) ) . Since f r w 1 ( H ) ˜ f r w 1 ( C l σ θ ( H ) ) , then p C l φ f r w 1 ( H ) ˜ p C l φ f r w 1 ( C l σ θ ( H ) ) = f r w 1 ( C l σ θ ( H ) ) .
(e)
⟶ (f): Let K S S ( T , S ) . Then, by (e), p C l φ ( f r w 1 ( 1 S K ) ) ˜ f r w 1 ( C l σ θ ( 1 S K ) ) . However,
p C l φ ( f r w 1 ( 1 S K ) ) = p C l φ ( 1 P f r w 1 ( K ) ) = 1 P p I n t φ ( f r w 1 ( K ) )
and
f r w 1 ( C l σ θ ( 1 S K ) ) = f r w 1 ( 1 S I n t σ θ G ) = 1 P f r w 1 I n t σ θ ( G ) .
Thus, 1 P p I n t φ ( f r w 1 ( G ) ) ˜ 1 P f r w 1 I n t σ θ ( G ) and, hence, f r w 1 ( I n t σ θ G ) ˜ p I n t φ f r w 1 ( G ) .
(f)
⟶ (a): Let a t S P ( O , P ) and K σ θ such that f r w a t ˜ K . Then, I n t σ θ K = K . So, by (f), f r w 1 ( K ) = f r w 1 ( I n t σ θ K ) ˜ p I n t φ f r w 1 ( K ) and, thus, f r w 1 ( K ) ˜ p I n t φ f r w 1 ( K ) . Therefore, f r w 1 ( K ) = p I n t φ f r w 1 ( K ) , and, hence, f r w 1 ( K ) P O φ . We set H = f r w 1 ( K ) . Then, H P O φ such that a t ˜ H and f r w H = f r w f r w 1 ( K ) ˜ K . Therefore, f r w is soft F-P-C.
Theorem 14. 
Let X , φ a : a P and Y , σ b : b S be two collections of TSs. We consider the functions r : X Y and w : P S , where w is a bijection. Then, f r w : X , a P φ a , P Y , b S σ b , S is soft F-P-C iff r : X , φ a Y , σ w ( a ) is F-P-C for all a P .
Proof. 
Necessity. Let f r w : X , a P φ a , P Y , b S σ b , S be soft F-P-C. Let a P . Let U σ w ( a ) θ . Then, according to Theorem 2.21 of [45], w ( a ) U b S σ b θ . So, f r w 1 w ( a ) U P O a P φ a . Since w : P S is injective, f r w 1 w ( a ) U = a r 1 ( U ) . Therefore, by Theorem 5.8 of [47], a r 1 ( U ) ( a ) = r 1 ( U ) P O ( φ a ) . This shows that r : X , φ a Y , σ w ( a ) is F-P-C.
Sufficiency. Let r : X , φ a Y , σ w ( a ) is F-P-C for all a P . Let G b S σ b θ . Then, by Theorem 2.21 of [45], G ( b ) σ b θ for all b S . For every b S , r : X , φ w 1 ( b ) Y , σ b is F-P-C, and, so, r 1 G ( b ) P O φ . Hence, for each a P , f r w 1 G ( a ) = r 1 ( G ( w ( a ) ) P O φ . Therefore, by Theorem 5.8 of [47], f r w 1 G P O a P φ a . This shows that f r w : X , a P φ a , P Y , b S σ b , S is soft F-P-C. □
Corollary 6. 
We consider the functions r : O , T , and w : P S , where w a bijection. Then, r : O , T , is S-P-C iff f r w : ( O , τ , P ) ( T , τ , S ) is soft S-P-C.
Proof. 
For each a P and b S , we set φ a = and σ b = . Then, τ = a P φ a and τ = b S σ b . Theorem 14 ends the proof. □
Theorem 15. 
Let X , φ a : a P and Y , σ b : b S be two collections of TSs. We consider the functions r : X Y and w : P S , where w is a bijection. Then, f r w : X , a P φ a , P Y , b S σ b , S is soft P-C iff r : X , φ a Y , σ w ( a ) is P-C for all a P .
Proof. 
Necessity. Let f r w : X , a P φ a , P Y , b S σ b , S be soft P-C. Let a P . Let U σ w ( a ) θ . Then, w ( a ) U b S σ b . So, f r w 1 w ( a ) U P O a P φ a . Since w : P S is injective, f r w 1 w ( a ) U = a r 1 ( U ) . Therefore, by Theorem 5.8 of [47], a r 1 ( U ) ( a ) = r 1 ( U ) P O ( φ a ) . This shows that r : X , φ a Y , σ w ( a ) is P-C.
Sufficiency.  r : X , φ a Y , σ w ( a ) is P-C for all a P . Let G b S σ b . Then, G ( b ) σ b for all b S . For every b S , r : X , φ w 1 ( b ) Y , σ b is P-C, and, so, r 1 G ( b ) P O φ . Hence, for each a P , f r w 1 G ( a ) = r 1 ( G ( w ( a ) ) P O φ = P O φ . Therefore, by Theorem 5.8 of [47], f r w 1 G P O a P φ a . This shows that f r w : X , a P φ a , P Y , b S σ b , S is soft P-C. □
Corollary 7. 
We consider the functions r : O , T , and w : P S , where w is a bijection. Then, r : O , T , is P-C iff f r w : ( O , τ , P ) ( T , τ , S ) is soft P-C.
Proof. 
For each a P and b S , we set φ a = and σ b = . Then, τ = a P φ a and τ = b S σ b . Theorem 15 ends the proof. □
Theorem 16. 
Every soft F-C function is soft F-P-C.
Proof. 
Let f r w : O , φ , P T , σ , S be soft F-C. Let G σ θ . Then, f r w 1 ( G ) φ P O φ . Consequently, f r w is soft F-P-C. □
Theorem 17. 
Every soft P-C function is soft F-P-C.
Proof. 
Let f r w : O , φ , P T , σ , S be soft P-C. Let G σ θ . Then, G σ . So, f r w 1 ( G ) P O φ . Consequently, f r w is soft F-P-C. □
The converse of Theorem 16 need not be true in general.
Example 4. 
Let X = R , P = a , b , and ℑ the usual topology on X. We define the functions r : X , X , and w : P P by
r x = 1 if x Q 1 if x R Q , w a = a , and w b = b .
Then, f r w : ( X , τ , P ) ( X , τ , P ) is soft F-P-C but not soft F-C.
The converse of Theorem 17 need not be true in general.
Example 5. 
Let X = a , b , Y = 1 , 2 , 3 , = , X , b , = , Y , 1 , 2 , 1 , 2 , and P = N . We define r : X , Y , and w : P P by r a = 1 , r b = 2 , and w t = t for all t P . Since θ = , Y , then r : X , X , is F-P-C. On the other hand, since 1 while r 1 1 = a P O , then r : X , X , is not P-C.
Therefore, by Corollaries 6 and 7, f r w : ( X , τ , P ) ( Y , τ , P ) is soft F-P-C but not soft P-C.
Theorem 18. 
Let T , σ , S be soft regular. The following are equivalent for a soft function  f r w : O , φ , P T , σ , S :
(a) 
f r w is soft P-C.
(b) 
f r w is soft F-P-C.
Proof. 
(a)
⟶ (b): Follows from Theorem 17.
(b)
⟶ (c): Let K σ . Since T , σ , S is soft regular, then σ = σ θ . So, K σ θ and, by (b), f r w 1 ( K ) P O φ . This shows that f r w is soft P-C.
The following two examples show that “soft F-S-C” and “soft F-P-C” are independent concepts:
Example 6. 
Let X = R and P = N . Let ℑ and ℵ be the indiscrete and the discrete topologies on X, respectively. Let r : X , X , and w : P P be the identity functions. Then, f r w : X , τ , P X , τ , P is soft F-P-C but it is not soft F-S-C.
Example 7. 
Let X = R , Y = a , b , P = N , ℑ be the usual typology on X, and = , Y , a , b . We define r : X , X , and w : P P as follows:
r x = a if x 0 b if x < 0 and w t = t for all t P .
Then, f r w : X , τ , P X , τ , P is soft F-S-C but it is not soft F-P-C.
Theorem 19. 
Let f r w : O , φ , P T , σ , S be a soft function. If f r # w # : O , φ , P O × T , p r φ × σ , P × S is soft F-P-C, then f r w : O , φ , P T , σ , S is soft F-P-C.
Proof. 
Let H σ θ . Since 1 P φ θ , by Theorem 10 of [15], 1 P × H p r φ × σ θ . Since f p # u # : O , φ , P R × L , p r φ × σ , M × N is soft F-P-C, by Theorem 13b, f r # w # 1 1 P × H P O φ . By Lemma 2 of [15], f r # w # 1 1 P × H = 1 P ˜ f r w 1 H = f r w 1 H , and, hence, f r w 1 H P O φ . Thus, again, by Theorem 13b, f r w : O , φ , P T , σ , S is soft F-P-C. □
Proposition 2. 
Let O , φ , P be an STS. If A P O ( φ ) and X is a non-empty subset of O such that C X S O φ , then A ˜ C X P O φ X .
Proof. 
Since A P O ( φ ) and C X S O φ , there exist U , V φ such that A ˜ U ˜ C l φ A and V ˜ C X ˜ C l φ V . We have U ˜ C X φ X and A ˜ C X ˜ U ˜ C X . □
Claim 1. 
U ˜ C X ˜ C l φ X A ˜ C X  and, hence A ˜ C X P O φ X .
Proof of Claim 1. 
Let b y ˜ U ˜ C X . To see that b y ˜ C l φ X A ˜ C X , let G φ X such that b y ˜ G . We choose H φ such that G = H ˜ C X . Since b y ˜ C X ˜ C l φ V and b y ˜ U ˜ H φ , U ˜ H ˜ V 0 P . We choose d z ˜ U ˜ H ˜ V . Since d z ˜ U ˜ C l φ A and d z ˜ H ˜ V φ , A ˜ H ˜ V 0 P . Since A ˜ H ˜ V ˜ A ˜ H ˜ C X = H ˜ C X ˜ A ˜ C X = G ˜ A ˜ C X , then G ˜ A ˜ C X 0 P . Therefore, b y ˜ C l φ X A ˜ C X . □
Theorem 20. 
If f r w : O , φ , P T , σ , S is a soft F-P-C function and X O such that C X S O φ 0 P , then f r w C X : X , φ X , P T , σ , S is soft F-P-C.
Proof. 
Let K σ θ . Since f r w : O , φ , P T , σ , S is soft F-P-C, by Theorem 13b, f r w 1 ( K ) P O φ . So, by Proposition 2, f r w C X 1 ( H ) = C X ˜ f r w 1 ( H ) P O φ . Hence, again, by Theorem 13b, f r w C X : X , φ X , M T , σ , S is soft F-P-C. □
Theorem 21. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-P-C and f r 2 w 2 : T , σ , S N , λ , L is soft quasi-θ-continuous, then f r 2 r 1 w 2 w 1 is soft F-P-C.
Proof. 
Let K λ θ . Then, f r 2 w 2 1 K σ θ and, hence, f r 2 r 1 w 2 w 1 1 K = f r 1 w 1 1 f r 2 w 2 1 K P O φ . Therefore, f r 2 r 1 w 2 w 1 is soft F-P-C. □
The following result follows from Theorems 11 and 21.
Corollary 8. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-P-C and f r 2 w 2 : T , σ , S N , λ , L is soft θ-continuous, then f r 2 r 1 w 2 w 1 is soft F-P-C.
Corollary 9. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-P-C and f r 2 w 2 : T , σ , S N , λ , L is soft continuous, then f r 2 r 1 w 2 w 1 is soft F-P-C.
Proof. 
It follows from Corollary 8 and the fact that soft continuous functions are soft θ -continuous. □
The subsequent illustrations demonstrate that, according to Corollary 9, the composition in reverse order may not possess the same quality.
Example 8. 
Let X = R and P = N . Let ℑ, ℵ, and ℘ be the usual, indiscrete, and discrete topologies on X, respectively. Let r 1 : X , X , , r 2 : X , X , , and w : P P be the identity functions. Then, f r 1 w : X , τ , P X , τ , P is soft continuous and f r 2 w : X , τ , P X , τ , P is soft P-C (and, hence, soft F-P-C) while f r 2 r 1 w w is not soft F-P-C.

4. Soft Faint β -Continuity

Definition 13. 
A soft function f r w : O , φ , P T , σ , S is called soft faintly β-continuous (soft F-β-C, for short) if, for each a t SP(O, P ) and K σ θ such that f r w a t ˜ K , we find H β O φ such that a t ˜ H and f r w H ˜ K .
Theorem 22. 
For a soft function f r w : O , φ , P T , σ , S , the following are equivalent:
(a) 
f r w is soft F-β-C.
(b) 
f r w : O , φ , P T , σ θ , S is soft β-C.
(c) 
f r w 1 ( K ) β O φ for every K σ θ .
(d) 
f r w 1 ( G ) β C φ for every G σ θ c .
(e) 
β C l φ ( f p u 1 ( H ) ) ˜ f p u 1 ( C l σ θ ( H ) ) for every H S S ( T , S ) .
(f) 
f p u 1 ( I n t σ θ K ) ˜ β I n t φ f r w 1 ( K ) for every K S S ( T , S ) .
Proof. 
(a)
⟶ (b): Let K σ θ and let m r ˜ f r w 1 ( K ) . Then, f r w a t ˜ K , and, by (a), we find H β O φ such that a t ˜ H and f r w H ˜ K . Hence, a t ˜ H ˜ f r w 1 f r w H ˜ f r w 1 K . Therefore, f r w 1 ( K ) β O φ .
(b)
⟶ (c): Clear.
(c)
⟶ (d): Let G σ θ c . Then, 1 S G σ θ , and, by (c), f r w 1 ( 1 S G ) = 1 P f r w 1 ( G ) β O φ . Hence, f r w 1 ( G ) β C φ .
(d)
⟶ (e): Let H S S ( T , S ) . Then, C l σ θ ( H ) σ θ c and, by (d), f r w 1 ( C l σ θ ( H ) ) β C φ . Thus, f r w 1 ( C l σ θ ( H ) ) = β C l φ f r w 1 ( C l σ θ ( H ) ) . Since f r w 1 ( H ) ˜ f r w 1 ( C l σ θ ( H ) ) , then β C l φ f r w 1 ( H ) ˜ β C l φ f r w 1 ( C l σ θ ( H ) ) = f r w 1 ( C l σ θ ( H ) ) .
(e)
⟶ (f): Let K S S ( T , S ) . Then, by (e), β C l φ ( f r w 1 ( 1 S K ) ) ˜ f r w 1 ( C l σ θ ( 1 S K ) ) . However,
β C l φ ( f r w 1 ( 1 S K ) ) = β C l φ ( 1 P f r w 1 ( K ) ) = 1 P β I n t φ ( f r w 1 ( K ) )
and
f r w 1 ( C l σ θ ( 1 S K ) ) = f r w 1 ( 1 S I n t σ θ G ) = 1 P f r w 1 I n t σ θ ( G ) .
Thus, 1 P β I n t φ ( f r w 1 ( G ) ) ˜ 1 P f r w 1 I n t σ θ ( G ) and, hence, f r w 1 ( I n t σ θ G ) ˜ β I n t φ f r w 1 ( G ) .
(f)
⟶ (a): Let a t S P ( O , P ) and K σ θ such that f r w a t ˜ K . Then, I n t σ θ K = K . So, by (f), f r w 1 ( K ) = f r w 1 ( I n t σ θ K ) ˜ β I n t φ f r w 1 ( K ) and, thus, f r w 1 ( K ) ˜ β I n t φ f r w 1 ( K ) . Therefore, f r w 1 ( K ) = β I n t φ f r w 1 ( K ) , and, hence, f r w 1 ( K ) β O φ . We set H = f r w 1 ( K ) . Then, H β O φ such that a t ˜ H and f r w H = f r w f r w 1 ( K ) ˜ K . Therefore, f r w is soft F- β -C.
Theorem 23. 
Let X , φ a : a P and Y , σ b : b S be two collections of TSs. We consider the functions r : X Y and w : P S , where w is a bijection. Then, f r w : X , a P φ a , P Y , b S σ b , S is soft F-β-C iff r : X , φ a Y , σ w ( a ) is F-β-C for all a P .
Proof. 
Necessity. Let f r w : X , a P φ a , P Y , b S σ b , S be soft F- β -C. Let a P . Let U σ w ( a ) θ . Then, according to Theorem 2.21 of [45], w ( a ) U b S σ b θ . So, f r w 1 w ( a ) U β a P φ a . Since w : P S is injective, f r w 1 w ( a ) U = a r 1 ( U ) . Therefore, by Theorem 1 of [13], a r 1 ( U ) ( a ) = r 1 ( U ) β ( φ a ) . This shows that r : X , φ a Y , σ w ( a ) is F- β -C.
Sufficiency. Let r : X , φ a Y , σ w ( a ) is F- β -C for all a P . Let G b S σ b θ . Then, by Theorem 2.21 of [45], G ( b ) σ b θ for all b S . For every b S , r : X , φ w 1 ( b ) Y , σ b is F- β -C, and, so, r 1 G ( b ) β O φ . Hence, for each a P , f r w 1 G ( a ) = r 1 ( G ( w ( a ) ) β O φ . Therefore, by Theorem 1 of [13], f r w 1 G β a P φ a . This shows that f r w : X , a P φ a , P Y , b S σ b , S is soft F- β -C. □
Corollary 10. 
We consider the functions r : O , T , and w : P S , where w is a bijection. Then, r : O , T , is F-β-C iff f r w : ( O , τ , P ) ( T , τ , S ) is soft F-β-C.
Proof. 
For each a P and b S , we set φ a = and σ b = . Then, τ = a P φ a and τ = b S σ b . Theorem 23 ends the proof. □
Theorem 24. 
Let X , φ a : a P and Y , σ b : b S be two collections of TSs. We consider the functions r : X Y and w : P S , where w is a bijection. Then, f r w : X , a P φ a , P Y , b S σ b , S is soft β-C iff r : X , φ a Y , σ w ( a ) is β-C for all a P .
Proof. 
Necessity. Let f r w : X , a P φ a , P Y , b S σ b , S be soft β -C. Let a P . Let U σ w ( a ) θ . Then, w ( a ) U b S σ b . So, f r w 1 w ( a ) U β a P φ a . Since w : P S is injective, f r w 1 w ( a ) U = a r 1 ( U ) . Therefore, by Theorem 1 of [13], a r 1 ( U ) ( a ) = r 1 ( U ) β ( φ a ) . This shows that r : X , φ a Y , σ w ( a ) is β -C.
Sufficiency.  r : X , φ a Y , σ w ( a ) is β -C for all a P . Let G b S σ b . Then, G ( b ) σ b for all b S . For every b S , r : X , φ w 1 ( b ) Y , σ b is β -C, and, so, r 1 G ( b ) β O φ . Hence, for each a P , f r w 1 G ( a ) = r 1 ( G ( w ( a ) ) β O φ = β O φ . Therefore, by Theorem 1 of [13], f r w 1 G β a P φ a . This shows that f r w : X , a P φ a , P Y , b S σ b , S is soft β -C. □
Corollary 11. 
We consider the functions r : O , T , and w : P S , where w is a bijection. Then, r : O , T , is β-C iff f r w : ( O , τ , P ) ( T , τ , S ) is soft β-C.
Proof. 
For each a P and b S , we set φ a = and σ b = . Then, τ = a P φ a and τ = b S σ b . Theorem 24 ends the proof. □
Theorem 25. 
Every soft F-C function is soft F-β-C.
Proof. 
Let f r w : O , φ , P T , σ , S be soft F-C. Let G σ θ . Then, f r w 1 ( G ) φ β O φ . Consequently, f r w is soft F- β -C. □
Theorem 26. 
Every soft β-C function is soft F-β-C.
Proof. 
Let f r w : O , φ , P T , σ , S be soft β -C. Let G σ θ . Then, G σ . So, f r w 1 ( G ) β O φ . Consequently, f r w is soft F- β -C. □
Theorem 27. 
Every soft F-S-C function is soft F-β-C.
Proof. 
Let f r w : O , φ , P T , σ , S be soft F-S-C. Let G σ θ . Then, f r w 1 ( G ) S O φ β O φ . Consequently, f r w is soft F- β -C. □
Theorem 28. 
Every soft F-P-C function is soft F-β-C.
Proof. 
Let f r w : O , φ , P T , σ , S be soft F-P-C. Let G σ θ . Then, f r w 1 ( G ) P O φ β O φ . Consequently, f r w is soft F- β -C. □
The converse of Theorem 25 need not be true in general.
Example 9. 
Let X = R , P = a , b , and ℑ the usual topology on X. We define the functions r : X , X , and w : P P by
r x = 1 if x Q 1 if x R Q , w a = a , and w b = b .
Then, f r w : ( X , τ , P ) ( X , τ , P ) is soft F-β-C but not soft F-C.
The converse of Theorem 26 need not be true in general.
Example 10. 
Let X = 1 , 2 , 3 , 4 , = , X , 2 , 3 , 2 , 3 , 1 , 2 , 1 , 2 , 3 , 2 , 3 , 4 , and P = N . We define r : X , X , and w : P P by r 1 = 3 , r 2 = 4 , r 3 = 2 , r 4 = 1 , and w t = t for all t P . Then, f r w : ( X , τ , P ) ( Y , τ , P ) is soft F-β-C but not soft β-C.
The soft function in Example 6 is soft F- β -C but not soft F-S-C. Furthermore, the soft function in Example 7 is soft F- β -C but not soft F-P-C. Therefore, Theorems 27 and 28 are not reversible, in general.
Theorem 29. 
Let T , σ , S be soft regular. The following are equivalent for a soft function f r w : O , φ , P T , σ , S :
(a) 
f r w is soft β-C.
(b) 
f r w is soft F-β-C.
Proof. 
(a)
⟶ (b): Follows from Theorem 26.
(b)
⟶ (c): Let K σ . Since T , σ , S is soft regular, then σ = σ θ . So, K σ θ and, by (b), f r w 1 ( K ) β O φ . This shows that f r w is soft β -C.
Theorem 30. 
Let f r w : O , φ , P T , σ , S be a soft function. If f r # w # : O , φ , P O × T , p r φ × σ , P × S is soft F-β-C, then f r w : O , φ , P T , σ , S is soft F-β-C.
Proof. 
Let H σ θ . Since 1 P φ θ , by Theorem 10 of [15], 1 P × H p r φ × σ θ . Since f p # u # : O , φ , P R × L , p r φ × σ , M × N is soft F- β -C, by Theorem 22b, f r # w # 1 1 P × H β O φ . By Lemma 2 of [15], f r # w # 1 1 P × H = 1 P ˜ f r w 1 H = f r w 1 H , and, hence, f r w 1 H β O φ . Thus, again, by Theorem 22b, f r w : O , φ , P T , σ , S is soft F- β -C. □
Theorem 31. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-β-C and f r 2 w 2 : T , σ , S N , λ , L is soft quasi-θ-continuous, then f r 2 r 1 w 2 w 1 is soft F-β-C.
Proof. 
Let K λ θ . Then, f r 2 w 2 1 K σ θ and, hence, f r 2 r 1 w 2 w 1 1 K = f r 1 w 1 1 f r 2 w 2 1 K β O φ . Therefore, f r 2 r 1 w 2 w 1 is soft F- β -C. □
The following result follows from Theorems 11 and 31.
Corollary 12. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-β-C and f r 2 w 2 : T , σ , S N , λ , L is soft θ-continuous, then f r 2 r 1 w 2 w 1 is soft F-β-C.
Corollary 13. 
If f r 1 w 1 : O , φ , P T , σ , S is soft F-β-C and f r 2 w 2 : T , σ , S N , λ , L is soft continuous, then f r 2 r 1 w 2 w 1 is soft F-β-C.
Proof. 
It follows from Corollary 12 and the fact that soft continuous functions are soft θ -continuous. □
The subsequent illustrations demonstrate that, according to Corollary 13, the composition in reverse order may not possess the same quality.
Example 11. 
Let X = R and P = N . Let ℑ, ℵ, and ℘ be the usual, indiscrete, and discrete topologies on X, respectively. Let r 1 : X , X , , r 2 : X , X , , and w : P P be the identity functions. Then, f r 1 w : X , τ , P X , τ , P is soft continuous and f r 2 w : X , τ , P X , τ , P is soft β-C (and, hence, soft F-β-C), while f r 2 r 1 w w is not soft F-β-C.

5. Conclusions

Many of the things we deal with daily include ambiguity. Soft set theory and its associated notions are one of the most significant theories for addressing uncertainty. One of the most significant frameworks to come out of soft set theory is soft topology. One of the most crucial ideas in soft topology is that of soft continuity, which is the subject of this paper.
In this paper, three generalizations of soft continuity—soft faint semi-continuity, soft faint pre-continuity, and soft faint β -continuity—were defined and explored. We characterized each of them (Theorems 1, 13, and 22). We also investigated the correspondence between each of them and their analog concept in general topology (Theorems 2, 14, and 23, and Corollaries 1, 6, and 10). Moreover, we proved that soft faint semi-continuity is strictly weaker than both soft faint continuity (Theorem 4 and Example 1) and soft semi-continuity (Theorem 5 and Example 2), and we proved that soft faint pre-continuity is strictly weaker than both soft faint continuity (Theorem 16 and Example 4) and soft pre-continuity (Theorem 17 and Example 5). We also proved that the concepts soft faint semi-continuity and soft faint pre-continuity are independent (Examples 6 and 7). In addition, we proved that soft faint β -continuity is a strictly weaker form of each of soft β -continuity (Theorem 26 and Example 10), soft faint semi-continuity (Theorem 27 and Example 6), and soft faint pre-continuity (Theorem 28 and Example 7). Soft regularity, on the codomain of a soft function, is given as a sufficient condition for the equivalence between soft faint semi-continuity (resp. soft faint pre-continuity, soft faint β -continuity) and soft semi-continuity (resp. soft pre-continuity, soft β -continuity). In addition to these, we provided several results on soft restriction (Theorems 8 and 20), soft composition (Theorems 12, 21, and 31 and Corollaries 4, 5, 8, 9, 12, and 13), and soft graph (Theorems 7, 19, and 30).
Future research might look into the following topics: (1) defining soft weakly quasi-continuous functions; (2) defining soft almost weakly continuous functions; (3) finding a use for these new concepts in a “decision making problem”; and (4) extending the concept of θ -Menger spaces [48] to include STSs.

Author Contributions

Conceptualization, D.A. and S.A.-G.; Methodology, D.A. and S.A.-G.; Formal analysis, D.A. and S.A.-G.; Writing—original draft, D.A. and S.A.-G.; Writing—review and editing, D.A. and S.A.-G.; Funding acquisition, S.A.-G. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zadeh, L. Fuzzy sets. Inform. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Pawlak, Z. Rough sets. Int. J. Comput. Inform. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  3. Molodtsov, D. Soft set theory—First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  4. Alcantud, J.C.R. The semantics of N-soft sets, their applications, and a coda about three-way decision. Inform. Sci. 2022, 606, 837–852. [Google Scholar] [CrossRef]
  5. Alcantud, J.C.R.; Khameneh, A.Z.; Santos-García, G.; Akram, M. A systematic literature review of soft set theory. Neural Comput. Appl. 2024, 36, 8951–8975. [Google Scholar] [CrossRef]
  6. Dalkılıc, O.; Demirtas, N. Algorithms for COVID-19 outbreak using soft set theory: Estimation and application. Soft Comput. 2023, 27, 3203–3211. [Google Scholar] [CrossRef]
  7. Maji, P.; Roy, A.R.; Biswas, R. An application of soft sets in a decision making problem. Comput. Math. Appl. 2002, 44, 1077–1083. [Google Scholar] [CrossRef]
  8. Pei, D.; Miao, D. From soft sets to information systems. In Proceedings of the 2005 IEEE International Conference on Granular Computing, Beijing, China, 25–27 July 2005; Volume 2, pp. 617–621. [Google Scholar]
  9. Yang, J.; Yao, Y. Semantics of soft sets and three-way decision with soft sets. Knowl.-Based Syst. 2020, 194, 105538. [Google Scholar] [CrossRef]
  10. Yuksel, S.; Dizman, T.; Yildizdan, G.; Sert, U. Application of soft sets to diagnose the prostate cancer risk. J. Inequal. Appl. 2013, 2013, 229. [Google Scholar] [CrossRef]
  11. Shabir, M.; Naz, M. On soft topological spaces. Comput. Math. Appl. 2011, 61, 1786–1799. [Google Scholar] [CrossRef]
  12. Al-Jumaili, A.M.F. New generalizations of soft sets in soft topological spaces and their applications. J. Interdiscip. Math. 2024, 27, 705–713. [Google Scholar] [CrossRef]
  13. Al-Ghour, S. Soft ωβ-open sets and their generated soft topology. Comput. Appl. Math. 2024, 43, 209. [Google Scholar] [CrossRef]
  14. Ameen, Z.A.; Alqahtani, M.H.; Alghamdi, O.F. Lower density soft operators and density soft topologies. Heliyon 2024, 10, e35280. [Google Scholar] [CrossRef]
  15. Abuzaid, D.; Naghi, M.; Al Ghour, S. Soft faint continuity and soft faint theta omega continuity between soft topological spaces. Symmetry 2024, 16, 268. [Google Scholar] [CrossRef]
  16. Nazmul, S.; Biswas, G. Soft homotopy classes and their fundamental group. New Math. Nat. Comput. 2024, 20, 45–59. [Google Scholar] [CrossRef]
  17. Al-Omari, A.; Alqurashi, W. Connectedness of soft-ideal topological spaces. Symmetry 2024, 16, 143. [Google Scholar] [CrossRef]
  18. Alqahtani, M.H.; Ameen, Z.A. Soft nodec spaces. AIMS Math. 2024, 9, 3289–3302. [Google Scholar] [CrossRef]
  19. Al-shami, T.M.; Mhemdi, A. On soft parametric somewhat-open sets and applications via soft topologies. Heliyon 2023, 9, e21472. [Google Scholar] [CrossRef]
  20. Ameen, Z.A.; Alqahtani, M.H. Baire category soft sets and their symmetric local properties. Symmetry 2023, 15, 1810. [Google Scholar] [CrossRef]
  21. Al-shami, T.M.; Mhemdi, A.; Abu-Gdairi, R. A Novel framework for generalizations of soft open sets and its applications via soft topologies. Mathematics 2023, 11, 840. [Google Scholar] [CrossRef]
  22. Kaur, S.; Al-shami, T.M.; Ozkan, A.; Hosny, M. A New approach to soft continuity. Mathematics 2023, 11, 3164. [Google Scholar] [CrossRef]
  23. Mhemdi, A. Novel types of soft compact and connected spaces inspired by soft Q-sets. Filomat 2023, 37, 9617–9626. [Google Scholar] [CrossRef]
  24. Kocinac, L.D.R.; Al-shami, T.M.; Cetkin, V. Selection principles in the context of soft sets: Menger spaces. Soft Comput. 2021, 25, 12693–12702. [Google Scholar] [CrossRef]
  25. Kharal, A.; Ahmad, B. Mappings on soft classes. New Math. Nat. Comput. 2011, 7, 471–481. [Google Scholar] [CrossRef]
  26. Aygunoglu, A.; Aygun, H. Some notes on soft topological spaces. Neural Comput. Appl. 2012, 21, 113–119. [Google Scholar] [CrossRef]
  27. Ameen, Z.A.; Abu-Gdairi, R.; Al-Shami, T.M.; Asaad, B.A.; Arar, M. Further properties of soft somewhere dense continuous functions and soft Baire spaces. J. Math. Comput. Sci. 2024, 32, 54–63. [Google Scholar] [CrossRef]
  28. Al-shami, T.M.; Mhemdi, A. A weak form of soft α-open sets and its applications via soft topologies. AIMS Math. 2023, 8, 11373–11396. [Google Scholar] [CrossRef]
  29. Al-shami, T.M.; Ameen, Z.A.; Asaad, B.A.; Mhemdi, A. Soft bi-continuity and related soft functions. J. Math. Comput. Sci. 2023, 30, 19–29. [Google Scholar] [CrossRef]
  30. Al-shami, T.M.; Alshammari, I.; Asaad, B.A. Soft maps via soft somewhere dense sets. Filomat 2020, 34, 3429–3440. [Google Scholar] [CrossRef]
  31. Zorlutuna, I.; Cakir, H. On continuity of soft mappings. Appl. Math. Inform. Sci. 2015, 9, 403–409. [Google Scholar] [CrossRef]
  32. Akdag, M.; Ozkan, A. Soft β-open sets and soft β-continuous functions. Sci. World J. 2014, 2014, 843456. [Google Scholar] [CrossRef] [PubMed]
  33. Al Ghour, S.; Bin-Saadon, A. On some generated soft topological spaces and soft homogeneity. Heliyon 2019, 5, e02061. [Google Scholar] [CrossRef] [PubMed]
  34. Levine, N. Semi-open sets and semi-continuity in topological spaces. Am. Math. Mon. 1963, 70, 36–41. [Google Scholar] [CrossRef]
  35. Mashhour, A.S. On precontinuous and weak precontinuous mappings. Proc. Math. Phys. Soc. Egypt 1982, 53, 47–53. [Google Scholar]
  36. Abd El-Monsef, M.E.; El-Deeb, S.N.; Mahmoud, R.A. β-open sets and β-continuous mappings. Bull. Fac. Sci. Assiut Univ. 1983, 12, 77–90. [Google Scholar]
  37. Long, P.E.; Herrington, L.L. The Tθ-topology and faintly continuous functions. Kyungpook Math. J. 1982, 22, 7–14. [Google Scholar]
  38. Noiri, T.; Popa, V. Weak forms of faint continuity. Bull. Math. Soc. Sci. Math. Roum. 1990, 1, 263–270. [Google Scholar]
  39. Chen, B. Soft semi-open sets and related properties in soft topological spaces. Appl. Math. Inform. Sci. 2013, 7, 287–294. [Google Scholar] [CrossRef]
  40. Arockiarani, I.; Lancy, A. Generalized soft -closed sets and soft gsβ-closed sets in soft topological spaces. Int. J. Math. Arch. 2013, 4, 1–7. [Google Scholar]
  41. Mahanta, J.; Das, P.K. On soft topological space via semiopen and semiclosed soft sets. Kyungpook Math. J. 2014, 54, 221–236. [Google Scholar] [CrossRef]
  42. Akdag, M.; Ozkan, A. Soft α-open sets and soft α-continuous functions. Abstr. Appl. Anal. 2014, 2014, 891341. [Google Scholar] [CrossRef]
  43. Yumak, Y.; Kaymakci, A.K. Soft β-open sets and their applications. J. New Theory 2015, 4, 80–89. [Google Scholar]
  44. Georgiou, D.N.; Megaritis, A.C.; Petropoulos, V.I. On soft topological spaces. Appl. Math. Inform. Sci. 2013, 7, 1889–1901. [Google Scholar] [CrossRef]
  45. Al Ghour, S. Soft θω-open sets and soft θω-continuity. Int. J. Fuzzy Logic Intell. Syst. 2022, 22, 89–99. [Google Scholar] [CrossRef]
  46. Al Ghour, S. Strong form of soft semi-open sets in soft topological spaces. Int. J. Fuzzy Logic Intell. Syst. 2021, 21, 159–168. [Google Scholar] [CrossRef]
  47. Al Ghour, S. Soft minimal soft sets and soft prehomogeneity in soft topological spaces. Int. J. Fuzzy Logic Intell. Syst. 2021, 21, 269–279. [Google Scholar] [CrossRef]
  48. Kocinac, L.D.R. Generalized open sets and selection properties. Filomat 2019, 33, 1485–1493. [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-Ghour, S.; Abuzaid, D. Three Weaker Forms of Soft Faint Continuity. Symmetry 2024, 16, 1211. https://doi.org/10.3390/sym16091211

AMA Style

Al-Ghour S, Abuzaid D. Three Weaker Forms of Soft Faint Continuity. Symmetry. 2024; 16(9):1211. https://doi.org/10.3390/sym16091211

Chicago/Turabian Style

Al-Ghour, Samer, and Dina Abuzaid. 2024. "Three Weaker Forms of Soft Faint Continuity" Symmetry 16, no. 9: 1211. https://doi.org/10.3390/sym16091211

APA Style

Al-Ghour, S., & Abuzaid, D. (2024). Three Weaker Forms of Soft Faint Continuity. Symmetry, 16(9), 1211. https://doi.org/10.3390/sym16091211

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