Next Article in Journal
Novel Parametric Families of with and without Memory Iterative Methods for Multiple Roots of Nonlinear Equations
Next Article in Special Issue
Analysis and Applications of Artificial Intelligence in Digital Education Based on Complex Fuzzy Clustering Algorithms
Previous Article in Journal
Streamline Diffusion Finite Element Method for Singularly Perturbed 1D-Parabolic Convection Diffusion Differential Equations with Line Discontinuous Source
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Relationship between Ordinary and Soft Algebras with an Application

by
Zanyar A. Ameen
1,
Tareq M. Al-shami
2,3,
Radwan Abu-Gdairi
4 and
Abdelwaheb Mhemdi
5,*
1
Department of Mathematics, College of Science, University of Duhok, Duhok 42001, Iraq
2
Department of Mathematics, Sana’a University, Sana’a P.O. Box 1247, Yemen
3
Department of Engineering Mathematics & Physics, Faculty of Engineering & Technology, Future University, Cairo 11835, Egypt
4
Department of Mathematics, Faculty of Science, Zarqa University, Zarqa P.O. Box 13110, Jordan
5
Department of Mathematics, College of Sciences and Humanities in Aflaj, Prince Sattam bin Abdulaziz University, Riyadh 16273, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(9), 2035; https://doi.org/10.3390/math11092035
Submission received: 28 March 2023 / Revised: 19 April 2023 / Accepted: 20 April 2023 / Published: 25 April 2023
(This article belongs to the Special Issue Data Driven Decision-Making Under Uncertainty (D3U), 2nd Edition)

Abstract

:
This work makes a contribution to the theory of soft sets. It studies the concepts of soft semi-algebras and soft algebras, along with some operations. Then, it examines the relations of soft algebras set to their ordinary (crisp) counterparts. Among other things, we show that every algebra of soft sets induces a collection of ordinary algebras of sets. By using the formulas (in Theorem 7 and Corollary 1), we present a novel construction, allowing us to construct a soft algebra from a system of ordinary algebras of sets. Two examples are presented to show how these formulas can be used in practice. This approach is general enough to be applied to many other (soft) algebraic properties and shows that ordinary algebras contain instruments enabling us to construct soft algebras and to study their properties. As an application, we demonstrate how elements of the generated soft algebra can be used to describe the weather conditions of a region.
MSC:
06D72; 08A65

1. Introduction

In today’s world, the mathematical modeling and manipulation of various kinds of uncertainties has turned into a growing concern in the solution of difficult problems in a variety of fields, such as engineering, environmental science, economics, social sciences, and medicine. Even though probability theory, fuzzy set theory [1], rough set theory [2], and interval mathematics [3], and so on, are well-known and effective tools for dealing with ambiguity and uncertainty, each has its own set of limitations; a common major weakness among these mathematical techniques is the limitation of parametrization tools.
In 1999, Molodtsov [4] originated the soft set theory as a mathematical tool for dealing with uncertainty, which is free of the challenges related to the earlier mentioned theories. Soft sets were presented as a collection of parameterized possibilities of a universe. The characteristics of parameter sets associated with soft sets provide a standardized foundation for modeling uncertainty. This led to the rapid growth of soft set theory and its relevant areas in a short amount of time and provided various applications of soft sets in real life, such as medical diagnosis [5,6], evaluation of nutrition systems [7], decision making [8], analysis of networks [9], and information systems [10,11]. To face more complicated problems, some extensions of soft sets were embraced, such as bipolar soft sets and double-framed soft sets, and their efficiency to address practical problems was demonstrated, as illustrated in [12,13].
Multiple researchers applied soft set theory to various mathematical structures such as soft group theory [14], soft ring theory [15], soft category theory [16], soft topology [17,18,19,20], infra-soft topology [21], N-soft topology [22], soft topological soft groups and soft rings [23,24], etc.
An algebra of subsets of a universal (ordinary) set is crucial for the growth of several disciplines, including mathematical analysis, probability theory, and economics and finance. The concept of algebras of soft settings was established by Riaz et al. [25]. Various properties and relations of soft algebras remain untouched. Therefore, we further study this concept and establish a general construction for producing soft algebras. This construction helps us to study the properties of soft algebras by means of the properties of ordinary algebras.
The content of the paper is arranged as follows: We provide a summary of the background on soft set theory and probability theory in Section 2. Section 3 concentrates on the study of soft semi-algebras and soft algebras, with their relationships. Then, it investigates some operations on soft algebras. Section 4 uses two remarkable formulas to demonstrate the relationships between ordinary and soft algebras. Section 5 discusses the application of representing weather conditions using elements of the generated soft algebra. We end with a brief conclusion and discussion (Section 6).

2. Preliminaries

Let X be an initial universe, Q be a set of parameters, and P ( X ) denote the set of all subsets of X.
Definition 1
([4]). Let F : Q P ( X ) be a set-valued mapping and let Q Q . The collection ( F , Q ) = { ( q , F ( q ) ) : q Q } is called a soft set over X.
A parameterized class of subsets of X represents what is intended by a soft set over X. The family of all soft subsets of X with the parametric set Q (resp. Q ) is denoted by S Q ( X ) (resp. S Q ( X ) ).
Remark 1.
The soft set ( F , Q ) can indeed be extended to the soft set ( F , Q ) by giving F ( q ) = for each q Q Q .
Definition 2
([11]). The soft complement ( F , Q ) c of a soft set ( F , Q ) is a soft set ( F c , Q ) , where F c : E P ( X ) is a mapping having the property that F c ( q ) = X F ( q ) for all q Q .
Notice that ( ( F , Q ) c ) c = ( F , Q ) .
Definition 3
([26]). A soft set ( F , Q ) over X is called null with respect to Q , Φ Q , if F ( q ) = for all q Q , and is called absolute with respect to Q , X Q , if F ( q ) = X for all q Q . The respective null and absolute soft sets are denoted by Φ Q and X Q .
Evidently, Φ Q c = X Q and X Q c = Φ Q .
Definition 4
([27]). A soft set ( F , Q ) is called finite (resp. countable) if F ( q ) is finite (resp. countable) for each q Q . Otherwise, it is called infinite (resp. uncountable).
Definition 5
([28]). An ordinary soft point ( { x } , Q ) (or shortly x ) is a soft set ( F , Q ) over X, such that F ( q ) = { x } for all q Q , where x X . It is said x ˜ ( F , Q ) if x F ( q ) for all q Q .
Definition 6
([11,29]). Let Q 1 , Q 2 Q . A soft set ( F 1 , Q 1 ) is a (soft) subset of ( F 2 , Q 2 ) (written by ( F 1 , Q 1 ) ˜ ( F 2 , Q 2 ) ) if Q 1 Q 2 and F 1 ( q ) F 2 ( q ) for all q Q 1 . ( F 1 , Q 1 ) is soft equal to ( F 2 , Q 1 ) if ( F 1 , Q 1 ) ˜ ( F 2 , Q 2 ) and ( F 2 , Q 2 ) ˜ ( F 1 , Q 1 ) .
Definition 7
([26,30]). Let { ( F i , Q ) : i I } be an indexed family of soft sets over X with an index set I. Then
1.
the soft intersection of ( F i , Q ) is a soft set ( F , Q ) = ˜ i I ( F i , Q ) , where F ( q ) = i I F i ( q ) for all q Q
2.
the soft union of ( F i , Q ) is a soft set ( F , Q ) = ˜ i I ( F i , Q ) , where F ( q ) = i I F i ( q ) for all q Q .
Definition 8
([31,32]). Let X , Y be two different universes parameterized by Q , Q , respectively, and let g : Z Y , h : Q Q be mappings. The image of a soft set ( F , Q ) ˜ ( X , Q ) under f g , h , or simply f : ( X , Q ) ( Y , Q ) , is a soft subset f ( F , Q ) = ( f ( F ) , h ( q ) ) of ( Y , Q ) which is given by
f ( F ) ( q ) = q h 1 ( q ) Q g F ( q ) , h 1 ( q ) Q , o t h e r w i s e ,
for each q Q .
The inverse image of a soft set ( G , Q ) ˜ ( Y , Q ) under f is a soft subset f 1 ( G , Q ) = ( f 1 ( G ) , h 1 ( q ) ) , such that
( f 1 ( G ) ( q ) = g 1 G ( h ( q ) ) , h ( q ) Q , o t h e r w i s e ,
for each q Q .
The soft mapping f is called bijective if the mappings g , h are bijective.
Definition 9.
A subfamily Σ of the power set P ( X ) of a nonempty set X is said to be an algebra on X if Σ meets the following properties:
1.
Σ ,
2.
if F Σ , then F c Σ , and
3.
if F n Σ , for all n = 1 , 2 , , k , then n = 1 k F n is in Σ.
Definition 10
([33]). Let P be a probability function defined on the collection of all possible events A from a sample space X. Then P is called a distribution if x X P ( x ) = 1 . The set of all elements with non-zero probability is called support of P.
In this work, if X happens to be a finite set, then A will be identical to P ( X ) , and P with the support { x 1 , x 2 , , x n } will be represented by
P = P ( x 1 ) x 1 + P ( x 2 ) x 2 + + P ( x n ) x n .

3. Soft Semi-Algebras and Soft Algebras

Definition 11.
A family H ˜ S Q ( X ) is called a soft semi-algebra on X if it satisfies the following properties:
1.
Φ Q , X Q are in H ,
2.
if ( F , Q ) , ( G , Q ) are in H , then ( F , Q ) ˜ ( G , Q ) is in H , and
3.
if ( F , Q ) c = ˜ i = 1 n ( F i , Q ) , where ( G 1 , Q ) , ( G 2 , Q ) , , ( G n , Q ) are in H and ( G i , Q ) ˜ ( G j , Q ) = Φ Q for i j , then ( F , Q ) is in H .
Let us recall the definition of a soft algebra.
Definition 12
([25]). A family Σ ˜ S Q ( X ) is said to be a soft algebra on X if Σ meets the following properties:
1.
Φ Q is in Σ,
2.
if ( F , Q ) is in Σ, then ( F , Q ) c is in Σ, and
3.
if ( F n , Q ) is in Σ, for all n = 1 , 2 , , k , then ˜ n = 1 k ( F n , Q ) is in Σ.
If (3) in the above definition holds true for countably infinite members of Σ , then Σ will be called a soft σ -algebra on X (see [34]).
Example 1.
The collections { Φ Q , X Q } and S Q ( X ) are trivially soft algebras. They are, respectively, the smallest and the largest soft algebras.
Example 2.
For any ( F , Q ) ˜ S Q ( X ) , { Φ Q , ( F , Q ) , ( F , Q ) c , X Q } is a soft algebra.
Readily, each soft σ -algebra is a soft algebra and each soft algebra is a soft semi-algebra, but not the converse.
Example 3.
Let X be an infinite universal set and Q be a set of parameters. The collection
Σ = { ( F , Q ) ˜ S Q ( X ) : either ( F , Q ) or ( F , Q ) c is finite }
will be a soft algebra. On the other hand, Σ is not a soft σ-algebra.
Example 4.
Let R be the set of real numbers and let Q = { q 1 , q 2 } . The collection
H = { ( q 1 , [ a , b ) ) , ( q 2 , ( c , d ] ) } : a , b , c , d R with a < b , c < d
is a soft semi-algebra but not a soft algebra.
Lemma 1.
Let { Σ i : i I } be an indexed family of soft algebras on X with an index set I. Then ˜ i I Σ i is a soft algebra.
Proof. 
Since each soft algebra Σ i contains Φ Q , so ˜ i I Σ i is not null and it contains Φ Q . Let ( F , Q ) ˜ ˜ i I Σ i . Then ( F , Q ) ˜ Σ i for each i I , and therefore, ( F , Q ) c ˜ Σ i for each i I . Hence, ( F , Q ) c ˜ ˜ i I Σ i . For the same reason, ˜ i I Σ i is closed under the finite soft unions. □
On the other hand, the union of two soft algebras need not be a soft algebra.
Example 5.
Let X = { 1 , 2 , 3 } and let Q = { q 1 , q 2 } . Given the following two soft algebras: Σ 1 = { Φ Q , ( F 1 , Q ) , ( F 2 , Q ) , X Q } and Σ 2 = { Φ Q , ( F 3 , Q ) , ( F 4 , Q ) , X Q } , where ( F 1 , Q ) = { ( q 1 , { 1 } ) , ( q 2 , ) } , ( F 1 , Q ) = { ( q 1 , { 2 , 3 } ) , ( q 2 , X ) } , ( F 3 , Q ) = { ( q 1 , ) , ( q 2 , { 2 , 3 } ) } , and ( F 4 , Q ) = { ( q 1 , X ) , ( q 2 , { 1 } ) } . Then Σ 1 ˜ Σ 2 is not a soft algebra.
However, the next result demonstrates that the union of soft algebras is a soft algebra under certain conditions.
Theorem 1.
Let { Σ n : n N } be a countable family of soft algebras on X. If Σ 1 ˜ Σ 2 ˜ , then ˜ n N Σ n is a soft algebra.
Proof. 
Since Σ n is a soft algebra for all n N , then Φ Q ˜ Σ n . Thus, Φ Q ˜ ˜ n N Σ n . Let ( F , Q ) ˜ ˜ n N Σ n . Then ( F , Q ) ˜ Σ n for some n and so ( F , Q ) c ˜ Σ n as Σ n is a soft algebra. Surely, ( F , Q ) c ˜ ˜ n N Σ n . Suppose ( F , Q ) , ( G , Q ) ˜ ˜ n N Σ n . Since Σ 1 ˜ Σ 2 ˜ , then there exists some n 0 N such that ( F , Q ) , ( G , Q ) ˜ Σ 0 . Thus, ( F , Q ) ˜ ( G , Q ) ˜ Σ 0 as Σ 0 is a soft algebra and hence, ( F , Q ) ˜ ( G , Q ) ˜ ˜ n N Σ n . □
It is worth noting that the above result does not hold true for soft σ -algebras. Let X = N and Q be a set of parameters. If Σ n is the collection of all soft subsets of ( F n , Q ) with their complements, where F n = { 1 , 2 , , n } , then { Σ n : n N } is an increasing collection of soft algebras. Then ˜ n N Σ n is a soft algebra mentioned in Example 3, which is not a soft σ -algebra.
Lemma 2.
Let H be a subcollection of S Q ( X ) . Then there exists a unique soft algebra Σ on X containing H , in the sense that if Σ * is any other soft algebra containing H , then Σ ˜ Σ * .
Proof. 
Since S Q ( X ) is a soft algebra containing H , so such a soft algebra always exists. Therefore, the soft algebra Σ obtained in Lemma 1 is the required soft algebra. □
We refer to the above soft algebra as the soft algebra on X generated by H and denote it by A ( H ) . If H is a countable collection, then A ( H ) is called the countably generated soft algebra. The soft algebra considered in Example 2 is the soft algebra generated by { ( F , Q ) } .
Theorem 2.
Let H , H i ˜ S Q ( X ) , for i = 0 , 1 , 2 , and let Σ be any soft algebra on X. The soft algebra A ( H ) generated by H possesses the below properties:
1.
H ˜ A ( H ) ˜ Σ .
2.
A ( A ( H ) ) = A ( H ) .
3.
H is a soft algebra if H = A ( H ) .
4.
H 1 ˜ H 2 implies A ( H 1 ) ˜ A ( H 2 ) .
5.
A ( H 1 ) , A ( H 2 ) ˜ A ( H 1 ) ˜ A ( H 2 ) ˜ A ( H 1 ˜ H 2 ) = A ( A ( H 1 ) ˜ A ( H 2 ) ) .
6.
H ˜ H 0 ˜ A ( H ) implies A ( H 0 ) = A ( H ) .
Proof. 
(1)
It follows from the definition of A ( H ) .
(2)
The first direction, A ( H ) ˜ A ( A ( H ) ) , follows from (1). Now, we always have A ( H ) ˜ A ( H ) , so A ( H ) is a soft algebra including A ( H ) . Since A ( A ( H ) ) is the smallest soft algebra including A ( H ) . Thus, A ( A ( H ) ) ˜ A ( H ) . Hence, A ( A ( H ) ) = A ( H ) .
(3)
Straightforward.
(4)
By (1), H 2 ˜ A ( H 2 ) . Since H 1 ˜ H 2 , then H 1 ˜ H 2 ˜ A ( H 2 ) and so ˜ A ( H 2 ) is a soft algebra containing H 1 , but A ( H 1 ) is the smallest soft algebra containing H 1 . Thus, A ( H 1 ) ˜ A ( H 2 ) .
(5)
We only prove the last equality, other inclusions can be concluded easily. Since H 1 ˜ H 1 ˜ H 2 , by (4), A ( H 1 ) ˜ A ( H 1 ˜ H 2 ) . Similarly, A ( H 2 ) ˜ A ( H 1 ˜ H 2 ) . Therefore, A ( H 1 ) ˜ A ( H 1 ) ˜ A ( H 1 ˜ H 2 ) . By (4), σ [ A ( H 1 ) ˜ A ( H 1 ) ] ˜ A ( H 1 ˜ H 2 ) .
On the other hand, since H 1 ˜ A ( H 1 ) and H 2 ˜ A ( H 2 ) , then H 1 ˜ H 2 ˜ A ( H 1 ) ˜ A ( H 2 ) . By (4), A ( H 1 ˜ H 2 ) ˜ A [ A ( H 1 ) ˜ A ( H 2 ) ] . Hence, A ( H 1 ˜ H 2 ) = A ( A ( H 1 ) ˜ A ( H 2 ) ) .
(6)
It follows from (2) and (4).
Proposition 1.
Let H be a soft semi-algebra on X. The family
Σ = { ( F , Q ) ˜ S Q ( X ) : ( F , Q ) = ˜ i = 1 n ( F i , Q ) , w h e r e , ( F i , Q ) ˜ H }
is a soft algebra on X and H ˜ Σ , where the symbol ˜ means disjoint soft union.
Proof. 
The second claim H ˜ Σ is obvious, because each ( F i , Q ) = ˜ i ( F i , Q ) ˜ Σ . It remains to show that Σ is a soft algebra. Clearly Φ Q ˜ Σ as Φ Q ˜ H ˜ Σ . Let ( R , Q ) , ( S , Q ) ˜ Σ . By definition,
( R , Q ) = ˜ i = 1 n ( F i , Q ) , where ( F i , Q ) ˜ H for i = 1 , 2 , , n , and ( S , Q ) = ˜ j = 1 m ( G j , Q ) , where ( G j , Q ) ˜ H for j = 1 , 2 , , m .
Now
( R , Q ) ˜ ( S , Q ) = ˜ i = 1 n ( F i , Q ) ˜ j = 1 m ( G j , Q ) = ˜ i = 1 n ˜ j = 1 m ( F i , Q ) ˜ ( G j , Q )
Since ( F i , Q ) , ( G j , Q ) ˜ H for all i and j, and H is closed under finite soft intersections, therefore, ( R , Q ) ˜ ( S , Q ) ˜ Σ .
Let ( R , Q ) ˜ Σ . There exist ( F 1 , Q ) , ( F 1 , Q ) , , ( F n , Q ) ˜ H such that ( R , Q ) = ˜ i = 1 n ( F i , Q ) . Now
( R , Q ) c = ˜ i = 1 n ( F i , Q ) c = ˜ i = 1 n ( F i , Q ) c = ( F 1 , Q ) c ˜ ( F 2 , Q ) c ˜ ˜ ( F n , Q ) c .
By definition of H , each ( F i , Q ) c = ˜ k = 1 k i ( F i , k , Q ) , for some ( F i , k , Q ) ˜ H . Therefore,
( R , Q ) c = ˜ i = 1 n ˜ k = 1 k i ( F i , k , Q ) = ˜ k = 1 k i ˜ i = 1 n ( F i , k , Q ) .
However, H is a soft semi-algebra, which implies that ˜ i = 1 n ( F i , k , Q ) ˜ H . This proves that ( R , Q ) c ˜ Σ . Hence, Σ is a soft algebra. □
Theorem 3.
Let H be a soft semi-algebra on X and let A ( H ) be the soft algebra generated by H . Then, ( F , Q ) ˜ A ( H ) if ( F , Q ) = ˜ i = 1 n ( F i , Q ) , for some ( F 1 , Q ) , ( F 2 , Q ) , , ( F n , Q ) ˜ H .
Proof. 
From Proposition 1, H ˜ Σ and, by Theorem 2, A ( H ) ˜ Σ , since A ( H ) is a soft algebra.
The converse is clear, since ( F i , Q ) ˜ H ˜ A ( H ) , for i = 1 , 2 , , n , and A ( H ) is a soft algebra, so ˜ i = 1 n ( F i , Q ) = ( F , Q ) ˜ A ( H ) . □
Proposition 2.
Let ( Y , Q ) ˜ S Q ( X ) Φ Q and let Σ be a soft algebra on X. Then
Σ ˜ ( Y , Q ) = { ( F , Q ) ˜ ( Y , Q ) : ( F , Q ) ˜ Σ }
is a soft algebra on ( Y , Q ) and is denoted by Σ | ( Y , Q ) or simply Σ | Y .
Proof. 
Since Φ Q ˜ ( Y , Q ) = Φ Q and Φ Q ˜ Σ , so Φ Q ˜ Σ | ( Y , Q ) . If ( G , Q ) ˜ Σ | ( Y , Q ) , then ( G , Q ) = ( F , Q ) ˜ ( Y , Q ) for some ( F , Q ) ˜ Σ . Since ( F , Q ) c ˜ Σ , we have ( G , Q ) c = ( F , Q ) c ˜ ( Y , Q ) . Thus, ( G , Q ) c ˜ Σ | ( Y , Q ) . Suppose that ( G 1 , Q ) , ( G 2 , Q ) , , ( G k , Q ) ˜ Σ | ( Y , Q ) . Then for each n = 1 , 2 , , k , there exists ( F n , Q ) ˜ Σ such that ( G n , Q ) = ( F n , Q ) ˜ ( Y , Q ) . Since ˜ n = 1 k ( F n , Q ) ˜ Σ , so
˜ n = 1 k ( G n , Q ) = ˜ n = 1 k [ ( F n , Q ) ˜ ( Y , Q ) ] = [ ˜ n = 1 k ( F n , Q ) ] ˜ ( Y , Q ) .
This implies that ˜ n = 1 k ( G n , Q ) ˜ Σ | ( Y , Q ) . □
Theorem 4.
Let H be a subcollection of S Q ( X ) and let ( Y , Q ) ˜ S Q ( X ) Φ Q . Then
A ( H ˜ ( Y , Q ) ) = A ( H ) ˜ ( Y , Q ) ,
where H ˜ ( Y , Q ) = { ( F , Q ) ˜ ( Y , Q ) : ( F , Q ) ˜ H } .
Proof. 
Let ( R , Q ) ˜ H ˜ ( Y , Q ) . Then ( R , Q ) = ( F , Q ) ˜ ( Y , Q ) for some ( F , Q ) ˜ H ˜ A ( H ) . Therefore, ( R , Q ) ˜ A ( H ) ˜ ( Y , Q ) and, hence, H ˜ ( Y , Q ) ˜ A ( H ) ˜ ( Y , Q ) . Since by Proposition 2, A ( H ) ˜ ( Y , Q ) is a soft algebra on Y. Thus, Lemma 2 guarantees that A ( H ˜ ( Y , Q ) ) ˜ A ( H ) ˜ ( Y , Q ) . To prove the other way of the inclusion, we first need to check that
Σ = { ( S , Q ) ˜ S Q ( X ) : ( S , Q ) ˜ ( Y , Q ) ˜ A ( H ˜ ( Y , Q ) ) }
is a soft algebra. Evidently, Φ Q ˜ Σ because Φ Q ˜ ( Y , Q ) = Φ Q ˜ A ( H ˜ ( Y , Q ) ) . Suppose that ( S , Q ) ˜ Σ . Then ( S , Q ) ˜ ( Y , Q ) ˜ A ( H ˜ ( Y , Q ) ) . Since ( S , Q ) c ˜ ( Y , Q ) = ( Y , Q ) [ ( S , Q ) ˜ ( Y , Q ) ] , this means that ( S , Q ) c ˜ Σ . Assume that ( H 1 , Q ) , ( H 2 , Q ) , , ( H k , Q ) ˜ Σ . Then ( H 1 , Q ) ˜ ( Y , Q ) , ( H 2 , Q ) ˜ ( Y , Q ) , , ( H k , Q ) ˜ ( Y , Q ) ˜ A ( H ˜ ( Y , Q ) ) . Therefore,
[ ˜ n = 1 k ( H n , Q ) ] ˜ ( Y , Q ) = ˜ n = 1 k [ ( H n , Q ) ˜ ( Y , Q ) ] ˜ A ( H ˜ ( Y , Q ) ) .
Hence, ˜ n = 1 k ( H n , Q ) ˜ Σ . This proves that Σ is a soft algebra on X. Suppose that ( F , Q ) ˜ H . Then ( F , Q ) ˜ ( Y , Q ) ˜ H ˜ ( Y , Q ) ˜ A ( H ˜ ( Y , Q ) ) , and so, ( F , Q ) ˜ Σ . Thus, H ˜ Σ and, by Lemma 2, A ( H ) ˜ Σ . Now, if ( R , Q ) ˜ A ( H ) ˜ ( Y , Q ) , then ( R , Q ) = ( F , Q ) ˜ ( Y , Q ) for some ( F , Q ) ˜ A ( H ) ˜ Σ and, hence, ( R , Q ) ˜ A ( H ˜ ( Y , Q ) ) . This concludes that A ( H ) ˜ ( Y , Q ) ˜ A ( H ˜ ( Y , Q ) ) . Thus, A ( H ˜ ( Y , Q ) ) = A ( H ) ˜ ( Y , Q ) . □
Lemma 3.
Let f : ( X , Q ) ( Y , Q ) be a soft mapping. Then
1.
if Σ is a soft algebra on X, then { ( G , Q ) ˜ ( Y , Q ) : f 1 ( G , Q ) ˜ Σ } is a soft algebra on Y.
2.
If Σ is a soft algebra on Y, the set f 1 ( Σ ) is a soft algebra on X.
Proof. 
Both (1) and (2) follow from the fact that f 1 ( Φ Q ) = Φ Q , f 1 ( Y Q ( G , Q ) ) = X Q f 1 ( G , Q ) for each soft set ( G , Q ) over Y, and f 1 ( n = 1 k ( G n , Q ) ) = n = 1 k f 1 ( G n , Q ) for each collection { ( G n , Q ) : n = 1 , 2 , , k } of soft sets over Y (see Theorem 14 in [31]). □
We shall remark that the direct image of a soft algebra under a soft mapping need not be a soft algebra.
Example 6.
Let X = { x 1 , x 2 , x 3 } , Y = { y 1 , y 2 } , and Q = Q = { q 1 , q 2 } . Define the mapping f g , h by
g ( x ) = y 1 , if x x 3 ; y 2 , if x = x 3 ,
and h ( q ) = q , for all q Q . Let Σ = { Φ Q , ( F 1 , Q ) , ( F 2 , Q ) , X Q } , where ( F 1 , Q ) = { ( q 1 , { x 1 } ) , ( q 2 , ) } and ( F 2 , Q ) = { ( q 1 , { x 2 , x 3 } ) , ( q 2 , X ) } . The image of the soft algebra Σ is f g , h ( Σ ) = { Φ Q , ( G 1 , Q ) , Y ˜ } , where ( G 1 , Q ) = { ( q 1 , { y 1 } ) , ( q 2 , ) } , which is not a soft algebra on Y.
Theorem 5.
Let f : ( X , Q ) ( Y , Q ) be a soft mapping. Then
f 1 ( A ( H ) ) = A ( f 1 ( H ) ) ,
for each collection H of soft sets over Y.
Proof. 
By Lemma 3 (2), f 1 ( A ( H ) ) is a soft algebra and f 1 ( H ) ˜ f 1 ( A ( H ) ) , and this implies that A ( f 1 ( H ) ) ˜ f 1 ( A ( H ) ) . However, by Lemma 3 (1), the set Σ = { ( G , Q ) ˜ ( Y , Q ) : f 1 ( G , Q ) ˜ A ( f 1 ( H ) ) } is a soft algebra, and it contains H , hence A ( H ) ˜ Σ . Therefore, f 1 ( A ( H ) ) ˜ f 1 ( Σ ) = { ( F , Q ) ˜ ( X , Q ) : ( F , Q ) = f 1 ( G , Q ) for some ( G , Q ) ˜ Σ } ˜ A ( f 1 ( H ) ) . This shows that f 1 ( A ( H ) ) = A ( f 1 ( H ) ) . □

4. Ordinary and Soft Algebras

Proposition 3.
Let Σ be a soft algebra on X, parameterized by Q . Then Σ q = { F ( q ) : ( F , Q ) ˜ Σ } is an ordinary algebra on X for each q Q .
Proof. 
Since Φ Q ˜ Σ , then Σ q for each q Q . Let F ( q ) Σ q . Then ( F , Q ) ˜ Σ and, since Σ is a soft algebra, so ( F , Q ) c ˜ Σ . However, ( F , Q ) c = { ( q , X F ( q ) ) : q Q } and so, F c ( q ) = X F ( q ) Σ q . Let { F n ( q ) : n = 1 , 2 , , k } be a family of sets in Σ q . Then, for each n, ( F n , Q ) ˜ Σ , and thus, ˜ n = 1 k ( F n , Q ) ˜ Σ . Hence, n = 1 k F n ( q ) Σ q . □
The converse of this lemma is not always true, particularly when | Q | > 1 , and the counterexample can be concluded from Example 5 in [34]. The scenario is different when | Q | = 1 .
Theorem 6.
Let Q = { q } and let F be a family of subsets of X. Then Σ = { ( q , F ( q ) ) : F ( q ) F } is a soft algebra if Σ q = { F ( q ) : ( q , F ( q ) ) ˜ Σ } is an ordinary algebra on X.
Proof. 
The first direction follows from Proposition 3.
Conversely, suppose Σ q is an algebra. Clearly, Σ q , and so, ( q , ) = Φ Q ˜ Σ . Let ( F , Q ) ˜ Σ . Then, ( F , Q ) = ( q , F ( q ) ) and F ( q ) Σ q . Since Σ q is an algebra, so F c ( q ) Σ q . Therefore, ( F , Q ) c = ( q , F c ( q ) ) ˜ Σ . Let { ( F n , Q ) : n = 1 , 2 , , k } be a collection of soft sets in Σ . This implies that ( F n , Q ) = ( q , F n ( q ) ) for each n = 1 , 2 , , k , and thus, n = 1 k F n ( q ) Σ q , as Σ q is an algebra on X. Therefore,
˜ n = 1 k ( F n , Q ) = ˜ n = 1 k ( q , F n ( q ) ) = ( q , n = 1 k F n ( q ) ) ˜ Σ .
This proves that Σ is a soft algebra on X. □
Theorem 7.
Let A be an (ordinary) algebra on X and Q be a set of parameters. Then
(1)
the family Σ ( A ) of soft sets ( F , Q ) forms a soft algebra on X, where ( F , Q ) = { ( q , F ( q ) ) : F ( q ) A for each q Q } .
(2)
The family Σ ^ ( A ) of soft sets ( F , Q ) forms a soft algebra on X, where ( F , Q ) = { ( q , F ( q ) ) : F ( q ) = F ( q ) A for each q , q Q } .
Proof. 
The proof is quite comparable to the second part of the proof for the preceding result. □
Remark 2.
The above formula holds true for any family of subsets of a given universe. Namely, we generate a collection of soft sets from an ordinary family of sets.
The soft algebra Σ ( A ) is called a soft algebra on X generated by A , and the soft algebra Σ ^ ( A ) is called an extended soft algebra on X via A .
Observe that Σ q = Σ ^ q = A for each q Q .
The following examples show how the process in Theorem 7 can be used:
Example 7.
Let X = { x 1 , x 2 , x 3 , x 4 } and Q = { q 1 , q 2 } . Consider the following ordinary algebra on X: A = { , { x 1 , x 2 } , { x 3 , x 4 } , X } . Applying the first formula, we conclude the following soft algebra on X:
Σ ( A ) = Φ Q , ( F 1 , Q ) , ( F 2 , Q ) , , ( F 14 , Q ) , X Q ,
where
( F 1 , Q ) = { ( q 1 , ) , ( q 2 , { x 1 , x 2 } ) } , ( F 2 , Q ) = { ( q 1 , ) , ( q 2 , { x 3 , x 4 } ) } , ( F 3 , Q ) = { ( q 1 , ) , ( q 2 , X ) } , ( F 4 , Q ) = { ( q 1 , { x 1 , x 2 } ) , ( q 2 , ) } , ( F 5 , Q ) = { ( q 1 , { x 1 , x 2 } ) , ( q 2 , { x 1 , x 2 } ) } , ( F 6 , Q ) = { ( q 1 , { x 1 , x 2 } ) , ( q 2 , { x 3 , x 4 } ) } , ( F 7 , Q ) = { ( q 1 , { x 1 , x 2 } ) , ( q 2 , X ) } , ( F 8 , Q ) = { ( q 1 , { x 3 , x 4 } ) , ( q 2 , ) } , ( F 9 , Q ) = { ( q 1 , { x 3 , x 4 } ) , ( q 2 , { x 1 , x 2 } ) } , ( F 10 , Q ) = { ( q 1 , { x 3 , x 4 } ) , ( q 2 , { x 3 , x 4 } ) } , ( F 11 , Q ) = { ( q 1 , { x 3 , x 4 } ) , ( q 2 , X ) } , ( F 12 , Q ) = { ( q 1 , X ) , ( q 2 , ) } , ( F 13 , Q ) = { ( q 1 , X ) , ( q 2 , { x 1 , x 2 } ) } , and ( F 14 , Q ) = { ( q 1 , X ) , ( q 2 , { x 3 , x 4 } ) } .
Applying the second formula, we conclude the following soft algebra on X:
Σ ^ ( A ) = Φ Q , ( G 1 , Q ) , ( G 2 , Q ) , X Q ,
where
( G 1 , Q ) = { ( q 1 , { x 1 , x 2 } ) , ( q 2 , { x 1 , x 2 } ) } a n d ( G 2 , Q ) = { ( q 1 , { x 3 , x 4 } ) , ( q 2 , { x 3 , x 4 } ) } .
A less trivial example is
Example 8.
Let A f be the finite–cofinite algebra on X. That is,
A f = F X : F is finite or F c is finite .
If X is finite, A f = P ( X ) . The soft algebra Σ ( A f ) on X generated by A f is given by the following family:
Σ ( A f ) = { ( q , F ( q ) ) : q Q } ˜ S Q ( X ) : F ( q ) or F ( q ) c is finite , for each q Q .
When we need to define the finite–cofinite algebra Σ f on X in soft settings, we normally do so as in Example 3, i.e.,
Σ f = ( F , Q ) ˜ S Q ( X ) : ( F , Q ) or ( F , Q ) c is finite .
However, both Σ f = Σ ( A f ) are equivalent. This example demonstrates how effectively our formulas produce soft algebras. We shall call Σ f the finite–cofinite soft algebra on X.
It is worth noting that the general formula for constructing soft algebras provided by Theorem 7 can be improved by the use of several ordinary algebras.
Corollary 1.
Let A = { A Q : q Q } be a collection of (ordinary) algebras on X indexed by a set of parameters Q . The family Σ ( A ) of all soft sets ( F , Q ) forms a soft algebra on X, where ( F , Q ) = { ( q , F ( q ) ) : F ( q ) A Q for each q Q } .
Notice that, if for each q , q Q , A Q = A Q = A , then Σ ( A ) = Σ ( A ) .
We have seen that each soft algebra produces a family of (ordinary) algebras of size | Q | , so we obtain the following observation:
Lemma 4.
Let A = { A q : q Q } be the family of all ordinary algebras on X from a soft algebra Σ. Then
Σ ˜ Σ ( A ) .
Proof. 
It can be concluded from the definition of soft sets and the soft algebra generated by A . □
Theorem 8.
Let { A q : q Q } be a family of ordinary algebras on X indexed by Q . Then
Σ ˜ A q = ˜ Σ A q .
Proof. 
Let ( F , Q ) ˜ Σ ˜ A q . Then
F ( q ) A q F ( q ) A q , for each q Q { ( q , F ( q ) ) : q Q } Σ ( A q ) , for each q Q ( F , Q ) ˜ ˜ Σ ( A q ) .
Hence, Σ ˜ A q ˜ ˜ Σ A q . The converse can be followed by reversing the above steps. □
Consequently, we have the following corollary:
Corollary 2.
Let E be a subcollection of S Q ( X ) , such that Φ Q , X Q ˜ E . Then
Σ A ( E ) = A Σ ( E ) ,
where Σ ( E ) is the family of all soft sets { ( q , F ( q ) ) : q Q } , such that F ( q ) E for each q Q .

5. Weather Forecasting Application

As an application, elements in a soft algebra can represent weather forecasting. Consider the weather conditions for a specific week of a region R. Let X = { x 1 , x 2 , x 3 , x 4 , x 5 , x 6 } be our universe, where x 1 = s u n n y , x 2 = r a i n y , x 3 = c l o u d y , x 4 = t h u n d e r s t o r m s , x 5 = w i n d y , and x 6 = s n o w y . Suppose the set of parameters A is the seven days of the week. The set of all possible events is S Q ( X ) , which is equivalent to the soft algebra generated by the ordinary algebra P ( X ) with respect to A. Assume that the probability distribution on weather predictions of this week is given in the following Table 1:
The weather predictions for working weekdays Q 0 can be described by the element ( F , Q 0 ) in the soft algebra S Q ( X ) as
F ( s u n d a y ) = 0.7 x 1 + 0.3 x 3 , F ( m o n d a y ) = 0.1 x 1 + 0.9 x 3 , F ( t u e s d a y ) = 0.8 x 2 + 0.2 x 3 , F ( w e d n e s d a y ) = 0.6 x 1 + 0.3 x 3 + 0.1 x 5 , F ( t h u r s d a y ) = 0.8 x 3 + 0.2 x 5 .
The soft set ( F , Q 0 ) indicates that the region R will be partly cloudy on Sunday and mostly cloudy on Monday. Tuesday is expected to be cloudy. Furthermore, R has remained cold, but warming is estimated on Wednesday, with mostly cloudy conditions on Thursday.
If Q 1 contains the weekend days, then the soft set ( G , Q 1 ) represents the weather as
F ( f r i d a y ) = 0.3 x 2 + 0.3 x 3 + 0.1 x 4 + 0.1 x 5 + 0.2 x 6 , F ( s a t u r d a y ) = 0.3 x 2 + 0.2 x 5 + 0.5 x 6 .
The soft set ( G , Q 1 ) forecasts a cold wave for the region R. The weather on Friday will be rainy, cloudy, and possibly windy. People may hear thunder in the distance. A snowfall is also expected on Friday, but the most snowfall will be expected on Saturday, with a noticeable wind chill.

6. Conclusions

This paper contributes to the field of soft set theory by investigating the concept of soft semi-algebras and soft algebras. We have discussed how soft algebras perform when used for specific operations such as restricting to a soft set, taking soft unions and soft intersections, generating by a collection of soft sets, and taking images or preimages under certain soft mappings. We have shown that each element of a soft algebra can be represented by a finite soft union of disjoint elements of a soft semi-algebra. We have seen that a soft algebra produces a family of ordinary algebras. Then, we have established two formulas by which one can construct a soft algebra from an ordinary algebra or a family of ordinary algebras. This construction provides a general framework for studying soft algebras and investigating their properties in relation to their counterparts in ordinary algebras. In particular, one can study probability theory, measure theory, etc., in the context of soft set theory without defining all the related terminologies. As an application to the generated soft algebras, we have shown that their elements can describe the weather conditions for some area over time.

Author Contributions

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

Funding

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

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Zadeh, L. Fuzzy sets. Inf. Control 1965, 8, 338–353. [Google Scholar] [CrossRef]
  2. Pawlak, Z. Rough sets. Int. J. Comput. Inf. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  3. Gorzałczany, M.B. A method of inference in approximate reasoning based on interval-valued fuzzy sets. Fuzzy Sets Syst. 1987, 21, 1–17. [Google Scholar] [CrossRef]
  4. Molodtsov, D. Soft set theory first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef]
  5. Dalkılıç, O.; Demirtaş, N. Algorithms for COVID-19 outbreak using soft set theory: Estimation and application. Soft Comput. 2022, 27, 3203–3211. [Google Scholar] [CrossRef]
  6. Yuksel, S.; Dizman, T.; Yildizdan, G.; Sert, U. Application of soft sets to diagnose the prostate cancer risk. J. Inequal. Appl. 2013, 2013, 1–11. [Google Scholar] [CrossRef]
  7. Al-shami, T.M. Soft somewhat open sets: Soft separation axioms and medical application to nutrition. Comput. Appl. Math. 2022, 41, 216. [Google Scholar] [CrossRef]
  8. 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]
  9. Jan, N.; Gwak, J.; Pamucar, D. Mathematical analysis of generative adversarial networks based on complex picture fuzzy soft information. Appl. Soft Comput. 2023, 137, 110088. [Google Scholar] [CrossRef]
  10. Al-shami, T.M. Compactness on soft topological ordered spaces and its application on the information system. J. Math. 2021, 2021, 6699092. [Google Scholar] [CrossRef]
  11. 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]
  12. Al-shami, T.M. Bipolar soft sets: Relations between them and ordinary points and their applications. Complexity 2021, 2021, 6621854. [Google Scholar] [CrossRef]
  13. Al-shami, T.M.; Mhemdi, A. Belong and nonbelong relations on double-Framed soft sets and their applications. J. Math. 2021, 2021, 9940301. [Google Scholar] [CrossRef]
  14. Aktaş, H.; Çağman, N. Soft sets and soft groups. Inf. Sci. 2007, 177, 2726–2735. [Google Scholar] [CrossRef]
  15. Acar, U.; Koyuncu, F.; Tanay, B. Soft sets and soft rings. Comput. Math. Appl. 2010, 59, 3458–3463. [Google Scholar] [CrossRef]
  16. Sardar, S.K.; Gupta, S. Soft category theory-an introduction. J. Hyperstruct. 2013, 2, 2013. [Google Scholar]
  17. Al-shami, T.M.; Mhemdi, A.; Abu-Gdairid, R. A Novel framework for generalizations of soft open sets and its applications via soft topologies. Mathematics 2023, 11, 840. [Google Scholar] [CrossRef]
  18. Alcantud, J.C.R.; Al-shami, T.M.; Azzam, A.A. Caliber and chain conditions in soft topologies. Mathematics 2021, 9, 2349. [Google Scholar] [CrossRef]
  19. Al-Ghour, S. Between the classes of soft open sets and soft omega open sets. Mathematics 2022, 10, 719. [Google Scholar] [CrossRef]
  20. Al-shami, T.M.; Alcantud, J.C.R.; Azzam, A.A. Two new families of supra-soft topological spaces defined by separation axioms. Mathematics 2022, 10, 4488. [Google Scholar] [CrossRef]
  21. Al-shami, T.M. New soft structure: Infra soft topological spaces. Math. Probl. Eng. 2021, 2021, 3361604. [Google Scholar] [CrossRef]
  22. Riaz, M.; Razzaq, A.; Aslam, M.; Pamucar, D. M-Parameterized N-Soft Topology-Based TOPSIS Approach for Multi-Attribute Decision Making. Symmetry 2021, 13, 748. [Google Scholar] [CrossRef]
  23. Tahat, M.K.; Sidky, F.; Abo-Elhamayel, M. Soft topological soft groups and soft rings. Soft Comput. 2018, 22, 7143–7156. [Google Scholar] [CrossRef]
  24. Tahat, M.K.; Sidky, F.; Abo-Elhamayel, M. Soft topological rings. J. King Saud Univ.-Sci. 2019, 31, 1127–1136. [Google Scholar] [CrossRef]
  25. Riaz, M.; Naeem, K.; Ahmad, M.O. Novel concepts of soft sets with applications. Ann. Fuzzy Math. Inform. 2017, 13, 239–251. [Google Scholar] [CrossRef]
  26. Ali, M.I.; Feng, F.; Liu, X.; Min, W.K.; Shabir, M. On some new operations in soft set theory. Comput. Math. Appl. 2009, 57, 1547–1553. [Google Scholar] [CrossRef]
  27. Das, S.; Samanta, S. Soft metric. Ann. Fuzzy Math. Inform. 2013, 6, 77–94. [Google Scholar]
  28. Shabir, M.; Naz, M. On soft topological spaces. Comput. Math. Appl. 2011, 61, 1786–1799. [Google Scholar] [CrossRef]
  29. Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef]
  30. Terepeta, M. On separating axioms and similarity of soft topological spaces. Soft Comput. 2019, 23, 1049–1057. [Google Scholar] [CrossRef]
  31. Kharal, A.; Ahmad, B. Mappings on soft classes. New Math. Nat. Comput. 2011, 7, 471–481. [Google Scholar] [CrossRef]
  32. Zorlutuna, İ.; Akdag, M.; Min, W.; Atmaca, S. Remarks on soft topological spaces. Ann. Fuzzy Math. Inform. 2012, 3, 171–185. [Google Scholar]
  33. Kytölä, K. Probability Theory; Aalto University: Espoo, Finland, 2020. [Google Scholar]
  34. Khameneh, A.Z.; Kilicman, A. On soft σ-algebras. Malays. J. Math. Sci. 2013, 7, 17–29. [Google Scholar]
Table 1. The probability distribution of weather predictions.
Table 1. The probability distribution of weather predictions.
X Q x 1 x 2 x 3 x 4 x 5 x 6
Sunday0.700.3000
Monday0.100.9000
Tuesday00.80.2000
Wednesday0.600.300.10
Thursday000.800.20
Friday00.30.30.10.10.2
Saturday00.3000.20.5
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

Ameen, Z.A.; Al-shami, T.M.; Abu-Gdairi, R.; Mhemdi, A. The Relationship between Ordinary and Soft Algebras with an Application. Mathematics 2023, 11, 2035. https://doi.org/10.3390/math11092035

AMA Style

Ameen ZA, Al-shami TM, Abu-Gdairi R, Mhemdi A. The Relationship between Ordinary and Soft Algebras with an Application. Mathematics. 2023; 11(9):2035. https://doi.org/10.3390/math11092035

Chicago/Turabian Style

Ameen, Zanyar A., Tareq M. Al-shami, Radwan Abu-Gdairi, and Abdelwaheb Mhemdi. 2023. "The Relationship between Ordinary and Soft Algebras with an Application" Mathematics 11, no. 9: 2035. https://doi.org/10.3390/math11092035

APA Style

Ameen, Z. A., Al-shami, T. M., Abu-Gdairi, R., & Mhemdi, A. (2023). The Relationship between Ordinary and Soft Algebras with an Application. Mathematics, 11(9), 2035. https://doi.org/10.3390/math11092035

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