Abstract
In this paper, a new type of soft group called the soft symmetric difference group (SSD-group) is introduced and systematically developed. This structure is constructed by integrating soft set theory with group theory through the symmetric difference operation and set inclusion. Fundamental concepts such as characteristic soft symmetric difference groups, soft symmetric difference subgroups, normal soft symmetric difference subgroups, soft normalizers, and soft cosets are defined, and their essential algebraic properties are investigated. Several characterizations of soft normality are also established through these concepts. Various axiomatic results are obtained, providing necessary and sufficient conditions for a soft set to form an SSD-group. Furthermore, soft quotient (factor) groups of SSD-groups are introduced and their structural properties are examined in detail. The relationship between SSD-group theory and classical group theory is also established through several corresponding concepts. Illustrative examples are provided to demonstrate the applicability and internal consistency of the proposed framework. Overall, the results obtained in this study extend existing soft group structures and contribute to the development of algebraic theory within the context of soft sets, while also providing a foundation for further generalizations to other algebraic frameworks such as semigroups, rings, and fields.
Keywords:
soft sets; soft symmetric difference groups; soft symmetric difference subgroups; normal soft symmetric difference subgroups; e-set; cosets; soft quotient groups MSC:
47H04; 03E47; 03E72
1. Introduction
A wide range of mathematically rigorous frameworks has been developed to model and analyze systems affected by uncertainty, vagueness, and indeterminacy—features that are intrinsic to diverse domains such as engineering, economics, social sciences, and medical diagnostics. Nevertheless, classical approaches—most notably fuzzy set theory introduced by Zadeh [1] and traditional probabilistic models—possess inherent epistemological and algebraic limitations. Specifically, fuzzy sets depend on subjectively defined membership functions, while probabilistic systems presuppose well-defined distributions and reproducible conditions, both of which are often unattainable in real-world contexts.
To address these shortcomings, Molodtsov [2] introduced soft set theory as a parameter-based framework that circumvents the constraints of probabilistic and fuzzy methodologies, providing an algebraically neutral means for handling uncertainty. The foundational operations were first proposed by Maji et al. [3] and later refined by Pei and Miao [4] from an information-theoretic perspective. Ali et al. [5] further broadened the operational framework by introducing restricted and extended versions of classical operations. Vital contributions by Yang [6], Feng et al. [7], Jiang et al. [8], Ali et al. [9], Sezgin and Atagün [10], Neog and Sut [11], Fu [12], Ge and Yang [13], Park et al. [14], Singh and Onyeozili [15,16,17,18], Zhu and Wen [19], Jayanta [20], Onyeozili and Gwary [21], and Husain and Shivani [22] have collectively deepened the algebraic foundations of soft set theory by clarifying definitional ambiguities, formulating new operations, and generalizing soft equality. Fundamental operations in soft set theory—namely, restricted and extended intersection, union, and difference—were systematically redefined and thoroughly investigated in [23,24,25]. In these works, earlier results were unified, previously omitted cases were addressed, and several incorrect theorems were rigorously corrected. Collectively, studies [23,24,25] represent a major advancement in the development of soft set theory by filling a crucial theoretical gap, providing a comprehensive reference for researchers new to the area, and opening promising directions for further investigation. Consequently, research on various extensions of soft sets has grown significantly in recent years [26,27,28,29,30,31,32,33,34,35,36,37,38,39] and has been successfully applied to a wide range of decision-making problems [40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55].
Parallel progress in generalized soft subsethood and equality has further consolidated this theoretical framework. Building upon early contributions by Pei and Miao [4] and Qin and Hong [56], subsequent efforts by Jun and Yang [57] and Liu et al. [58] introduced J-soft and L-soft equalities. Feng and Li [59] extended this line of work by classifying soft subsets under L-equality and revealing semigroup structures within the corresponding quotient classes. Broader generalizations—such as g-soft, gf-soft, and T-soft equalities—proposed by Abbas et al. [60,61], Al-shami [62], and Al-shami and El-Shafei [63], incorporated congruence and lattice-theoretic structures into the algebraic study of soft sets. In particular, Ali et al. [64] developed generalized finite relaxed soft equality together with the corresponding union and intersection operations, thereby forming a robust generalization framework. From a different perspective, Sezgin et al. [65] and Orbay et al. [66] conducted rigorous theoretical investigations of the AND-product and OR-product, respectively, and thoroughly analyzed their algebraic properties in connection with soft F-subsets and soft M-equality.
A major milestone in the formal development of soft set theory was achieved through the axiomatic reformulation proposed by Çağman and Enginoğlu [67], which resolved internal inconsistencies and established a mathematically rigorous foundation for algebraic analysis. This advancement facilitated the introduction of various soft products on classical algebraic structures. For instance, the soft intersection–union product has been generalized to ring [68], semigroup [69], and group [70] contexts, resulting in the notions of soft intersection rings, soft intersection semigroups, and soft intersection groups, respectively. Its dual—the soft union–intersection product—has been examined within group-theoretic [71], semigroup-theoretic [72], and ring-theoretic [73] frameworks, leading to the corresponding concepts of soft union groups, soft union semigroups, and soft union rings.
Aktaş and Çağman [74,75] introduced the notion of a soft group as a parametrized family of subgroups of a given group, which initiated the study of the algebraic structure of soft sets. Within this framework, Sezgin and Atagün [76] examined normalistic soft groups and corrected several properties of soft groups originally defined in [74]. Aslam et al. [77] further developed the theory by introducing normal and abelian soft groups together with their fundamental properties. Their study also addressed cyclic soft groups and soft subgroups, soft cosets, the order and index of a soft group, partitions of soft sets over groups, as well as simple and factor soft groups. Aktaş and Özlü [78] extended these investigations by defining the order and power of soft groups and soft sets, and by analyzing cyclic soft groups in relation to classical group theory. Nazmal [79] studied homomorphic images and preimages of soft groups under soft mappings. In 2023, Barazegar et al. [80] introduced the notion of the commutator of soft groups and investigated nilpotent soft groups. They also defined second-type nilpotent soft subgroups and studied their fundamental properties. Alajlan and Alghamdi [81] examined the center of soft groups, kernels of soft homomorphisms, and characteristic soft subgroups. In 2025, Atagün et al. [82] explored applications of Sylow’s theorems within the framework of soft groups. It should be noted that all these contributions rely on the original soft group structure proposed by Aktaş and Çağman [74].
A significant advancement in the field was made by Çağman et al. [83], who introduced soft intersection groups (soft int-groups). This framework integrates inclusion relations and set intersections with group-theoretic operations, thus providing a unifying structure that connects set theory, group theory, and soft set theory. In Ref. [83], the authors defined soft int-subgroups and normal soft int-subgroups and introduced related concepts. Subsequent studies expanded this theory by establishing additional properties of soft int-groups and investigating relationships among the soft union–intersection product, soft inclusions, and group-theoretic structures [71]. Normal soft int-groups were analyzed in detail in [84], including results on α-inclusion, normalizers, quotient groups, and related constructions. Homomorphism and isomorphism theorems for soft int-groups, as well as the notions of soft quotient subgroups and quotient dual soft subgroups, were studied in [85,86,87], together with soft analogues of the fundamental isomorphism theorems. In 2024, Sezgin et al. [88] studied soft cosets for soft intersection groups in detail. For related concepts concerning soft union groups, the reader is referred to [70].
Cosets, normal subgroups, and quotient groups are central concepts in abstract algebra and group theory. Lagrange’s theorem, derived from counting cosets and their cardinalities, plays a fundamental role in understanding group structure. Normal subgroups are essential for constructing quotient groups, which often exhibit simpler structures than the original group. Consequently, the study of quotient groups provides an effective approach for gaining deeper insight into the structural properties of groups. The relationship between set theory and group theory is particularly strong, and group theory possesses a rich structure with numerous applications across diverse scientific fields. This richness provides strong motivation for its incorporation into soft set theory. In the current literature, two types of soft groups based on inclusion structures have been introduced: the soft intersection group (soft int-group) defined in [83] and the soft union group (soft uni-group) defined in [89].
Motivated by ongoing developments in soft algebraic structures and the limitations of existing soft group frameworks, this paper introduces a new type of soft group called the soft symmetric difference group (SSD-group). It is important to emphasize that, despite the terminology, SSD-groups are not groups in the classical algebraic sense. The SSD-condition establishes a structural compatibility between a group and a set-valued mapping, but the collection of SSD-functions does not, in general, satisfy the group axioms under the induced operation. Thus, SSD-groups should be understood as generalized algebraic structures derived from group-theoretic principles rather than as groups themselves. By employing the symmetric difference operation together with set inclusion, the proposed structure extends classical soft group concepts in a systematic manner and offers a fresh perspective on the interaction between soft set operations and traditional algebraic properties. The study establishes fundamental notions such as characteristic soft symmetric difference groups, soft symmetric difference subgroups, normal soft symmetric difference subgroups, soft normalizers, and soft cosets of soft symmetric difference groups, and investigates their essential algebraic properties. Several characterization results are obtained, providing necessary and sufficient conditions for the existence of an SSD-group structure. In addition, soft quotient (factor) groups of SSD-groups are introduced and their algebraic properties are examined in detail. Key relationships between SSD-group theory and classical group theory are also established through concepts such as lower alpha inclusion and the soft characteristic function. Illustrative examples are presented throughout the paper to demonstrate the applicability and internal consistency of the proposed framework. The findings establish a link between group-based mathematical structures and soft algebraic processes, opening the door to further algebraic investigation.
The structure of the manuscript is as follows. Essential definitions and algebraic preliminaries are presented in Section 2. The soft symmetric difference group is introduced, and its theoretical foundations and basic concepts are thoroughly developed in Section 3. In addition, key relationships between SSD-group theory and classical group theory are established through corresponding concepts. The notions of e-sets, soft cosets of soft symmetric difference complement groups, soft quotient groups, p-SSD-groups, and the order of soft cosets are further examined in Section 4. The main conclusions are summarized in Section 5, together with future directions for research in soft algebra and its applicability to uncertainty-driven analysis.
2. Preliminaries
This section presents a rigorous and methodical re-evaluation of the foundational definitions of soft sets.
Definition 1
([67]). Let be a parameter set, be a universal set, be the power set of , and . The soft set over is a function such that , where for all , .
Throughout this paper, a soft set over is abbreviated by , and universal set by .
Definition 2
([67]). Let be an . If for all , then is called the null and denoted by , and if , for all , then is called the absolute denoted by .
Definition 3
([67]). Let and be two s. If , for all , then is said to be a soft subset of and indicated by . If , for all , then is called soft equal to , and denoted by .
Definition 4
([67]). Let be an . The complement of denoted by , is defined by the soft set such that , for all , where is the complement of .
From now on, stands for the symmetric difference operation on sets, is a group with identity element , denotes the collection of all s over parameterized by .
Definition 5
([90]). Let and be s. The soft symmetric difference of and is the , where , for all .
Definition 6
([91]). Let and be s. The soft symmetric difference complement of and is the , defined by , for all , where is the complement of .
Definition 7
([83]). Let . The -set of , denoted by , is defined as .
Definition 8
([92]). Let . Then, is called a soft symmetric difference complement group (SSDC-group) if and , for all .
3. Soft Symmetric Difference Groups with Their Basic Concepts
In this section, we first introduce the concept of soft symmetric difference groups. We then define the related notions of soft symmetric difference subgroups, normal soft symmetric difference subgroups, characteristic soft symmetric difference groups, and the normalizer of a soft symmetric difference group, and examine their fundamental properties. Some relationships between soft symmetric difference group theory and classical group theory are also established through corresponding concepts.
Definition 9.
Let be a group and . Then, is called a soft symmetric difference group over , if
for all .
For the sake of brevity, the soft symmetric difference group over is abbreviated by SSD-group and all the s are the elements of unless otherwise stated throughout this paper,
Example 1.
Let = = be the and be the set of parameters, which forms a group isomorphic to , that is, the Klein four group. In particular, is a non-cyclic abelian group in which every non-identity element has order two. The group operation on is given by the Table 1.
Table 1.
Cayley table of the group in Example 1.
Let and be s as follows:
One can easily show that is an SSD-group. For example, for a few elements of , we have
It can be shown that the conditions are satisfied for the remaining elements of as well. Therefore, is an SSD-group. However, since
is not an SSD-group.
Example 2.
Let
be the infinite cyclic group of integers under addition and let . Define an by
Then, is an SSD-group. To verify that , for any , we examine the possible parity cases:
Case 1: If both and are even, then is even. Thus, .
Case 2: If both and are odd, then is even. Hence, .
Case 3: If exactly one of is odd, then is odd. Thereby, .
Moreover, since the integers and have the same parity, where , holds, for all . Therefore, is an SSD-group.
This example shows that the SSD-framework naturally extends beyond finite groups and applies equally to infinite groups.
Proposition 1.
If
is an SSD-group, then .
Proof.
Let be an SSD-group. Then, for all , we have
Note that the condition alone does not guarantee that is an SSD-group. This is consistent with Example 1, which illustrates the structural distinction. In Example 1, although , it has been shown that is not an SSD-group. □
Theorem 1.
An
is an SSD-group if and only if for all .
Proof.
Suppose that is an SSD-group. Then, by Definition 9, for all , we have . Thus,
for all . Hence, .
Conversely, suppose that , for all . Firstly, choosing yields
Moreover,
holds. From these two results, we have
is obtained. Secondly,
Thus, the is an SSD-group. □
We would also like to emphasize that Theorem 1 provides a characterization equivalent to Definition 9. Since the result is stated as an “if and only if” condition, it establishes an alternative but logically equivalent formulation of the SSD-group concept. For this reason, the use of the defining property in the proof is essential to demonstrate this equivalence.
Definition 10
([93]). Let and be s. Then, the soft intersection-symmetric difference product is defined by
for all .
The inverse of is defined as , for all .
Example 3.
Let
= be the and be the set of parameters, which forms a cyclic group of order three (isomorphic to ). The group operation on is given by Table 2:
Table 2.
Cayley table of the group in Example 3.
Let and be s as follows:
Since
Hence, we have
Moreover, since , and , we have
Theorem 2.
is an SSD-group over if and only if and .
Proof.
Let be an SSD-group. Then, for all , we have
Thus, . The second part follows directly from the definition of the soft SSD-group, since for all , we have
implying that .
Conversely, assume that and . Then, for all , we have
where . Thus, , for all .
Moreover, since , then for all , we have . Besides, by Definition 10, , implying that , for all . □
Proposition 2.
If
is an SSD-group, then is also an SSD-group.
Proof.
Let be an SSD-group. Then, for all , we have
Thus, . Moreover, for all , we have
Hence, . So, we are done. □
Proposition 3.
If
and are two SSD-groups, then
Proof.
Let and be two SSD-groups. Then, for all , we have
Note here that, since is an SSD-group, is an SSD-group, by Proposition 2. Thus, , for all . Hence, . □
Definition 11
([84]). Let be a subset of . We denote by the soft characteristic function of , and define as
The soft characteristic function of is an over .
Proposition 4.
If
and are two subsets of , then .
Proof.
Let . Suppose . Then, or . Firstly, let . Then, we have
Secondly, let . Then,
implying that .
Now, let . Then, or . Firstly, let . Then, we have
Secondly, let . Then,
Hence, . □
Proposition 5.
Let
be a subset of . If is an SSD-group, then is a subgroup of .
Proof.
Let and be an SSD-group. We need to show that . Then, we have
Hence,, implying that . □
Note 1.
The converse of Proposition 5 need not be true. That is, if
is a subgroup of , then need not be an SSD-group.
Example 4.
Let
and be the subgroup of . Then, we have
Since , is not an SSD-group.
Definition 12
([83]). Let be an and . Then, lower -inclusion of , denoted by , is defined as .
Proposition 6.
Let
be an and be a subset of such that , where . If is an SSD-group, then is a subgroup of .
Proof.
Since for some , then . Let , then and . Now, we need to show that , for all . Since is an SSD-group, it follows that implying that . So, we are done. □
Note 2.
If each of the are a subgroup of , then need not be an SSD-group.
Example 5.
Let
and the over be defined as follows:
By considering , we have the following:
Here, and are both subgroups of ; however, since
is not an SSD-group.
Theorem 3.
is an SSD-group if and only if is an SSDC-group.
Proof.
Let be an SSD-group. Then, for all , we have
Hence, , for all . That is to say, is an SSDC-group.
Conversely, let be an SSDC-group. Then, for all ,
Thus, , for all . Hence, is an SSD-group. Note here that, in classical set theory, , where and are fixed sets and are the complements of and , respectively. □
Definition 13.
Let
be a subgroup of , be an SSD-group and be a nonempty soft subset of . If itself is an SSD-group, then is called an SSD-subgroup of .
Example 6.
Consider the group
and the SSD-group over in Example 1. Let be the subgroup of , and be an over It is obvious that is a nonempty soft subset of and
Moreover, , , is an SSD-subgroup of .
Definition 14.
Let
be an SSD-group. Then, is called an abelian SSD-group if , for all .
It is obvious that if is abelian, then is abelian.
Definition 15.
Let
be an SSD-group. Then, is called soft normal in (or normal SSD-group), if is an abelian SSD-group.
We present the equivalent conditions of the normality of an SSD-group with Theorem 4 in a similar manner as soft-int groups in [83]:
Theorem 4.
Let
be an SSD-group. Then, the following conditions are equivalent:
- (1)
- is a normal SSD-group, that is, , for all , ,
- (2)
- is constant in the conjugate class of , that is, , for all , ,
- (3)
- , for all , ,
- (4)
- , for all , .
Proof.
Let , and be an SSD-group.
(1 Suppose that is a normal SSD-group, that is, , for all ,. Then, , for all ,.
(2 Let , for all ,. Then, it is clear that .
(3 Let , for all ,. Then, .
(4 Let , for all ,. Then, . Hence, is obtained. □
Definition 16.
Let
be an SSD-group and be an SSD-subgroup of . Then, is called a normal SSD-subgroup, if it is an abelian SSD-subgroup of .
Note that normal SSD-group defined in Definition 15 and normal SSD-subgroup defined in Definition 16 are two distinct notions. The first concept concerns structural properties of the SSD-group defined on , whereas the second refers to a subgroup of satisfying an additional compatibility condition, which is a soft substructure of an SSD-group.
Example 7.
Table 3.
Cayley table of the Dihedral group .
We define the over by
Let the over be as follows:
where is the subgroup of . One can show that is a normal SSD-subgroup of .
Note 3.
The soft intersection-symmetric difference product of groups is not commutative in general; however, we can state Proposition 7:
Proposition 7.
If
is an SSD-group and is a normal SSD-subgroup of , then .
Proof.
Let be an SSD-group and be a normal SSD-subgroup of . Then, for all ,
where . Since is a normal SSD-subgroup of and , we have and
Hence, . □
Definition 17.
Let
be an SSD-group, be a map from into itself. We define a map
by , for all . Then, is called a characteristic SSD-group, if for every automorphism of .
Proposition 8.
If
is an SSD-group and is a homomorphism of , then is an SSD-group.
Proof.
Suppose that is an SSD-group and be a homomorphism of . Then, for all ,
Moreover, we have
Thus, is an SSD-group. □
Proposition 9.
Let
be an SSD-group, where is an injective mapping and be an epimorphism of . Then, is a normal SSD-group if and only if is an abelian group.
Proof.
Let be an SSD-group, where is an injective mapping and is an epimorphism of . Let be an abelian group. By Proposition 8, is an SSD-group. Thus, we only need to show the normality of . Since is an abelian group, then for all , , which shows the normality of .
Conversely, let be a normal SSD-group, where be an epimorphism of . Let . Then,
Since is an epimorphism of , it follows that is an abelian group, □
Proposition 10.
Let
be an SSD-group. If is a characteristic SSD-group, then is a normal SSD-group.
Proof:
Let be a characteristic SSD-group. We need to show that , for all . Let be a homomorphism from to defined by
for all . One can easily show that is an automorphism of induced by . Since is a characteristic SSD-group, then for every automorphism of . Thus, we have
for all . Hence, is a normal SSD-group. □
Definition 18.
Let
be an SSD-group, and be SSD-subgroups of . We say that is soft conjugate to , if there exists such that
for all .
Notation 1.
Let
be an SSD-group, . We denote by
the map defined by , for all .
Example 8.
Consider the group
and the SSD-group
over in Example 7. Let . Then,
Proposition 11.
If is an SSD-group, then is an SSD-group, for all .
Proof.
Suppose that is an SSD-group, . Then, for all ,
Moreover, we have
Thus, is an SSD-group. □
Definition 19.
The SSD-group
in Proposition 11 is called the conjugate SSD-group determined by and .
Definition 20.
Let
be an SSD-group. Then, the normalizer of is the set given by
Proposition 12.
If is an SSD-group and , then .
Proof.
Let be an SSD-group, . Then, , for all . Thus, , for all . Thus, , implying that . Similarly, let . Then, , for all . Thus, , for all . Since , . Hence, , for all . Thus, , implying that . Then, . □
Proposition 13.
If is an SSD-group, then is a subgroup of .
Proof.
Suppose that is an SSD-group. Since , for all , we have . Thus, and is obvious. Let . Then, we have , . We, firstly, need to show that . Then, for all ,
Thus, we have .
Let . We need to show that . Since for all . Thus, , for all . Hence, , for all . Since is arbitrary, . Thus, is a subgroup of . □
Proposition 14.
Let
be an SSD-group. Then, is a normal SSD-group if and only if .
Proof.
Let be a normal SSD-group. is obvious. Let . For any ,
Thus, . Hence, and , so .
Conversely, let and . We need to show that , for all . We have
Thus, is a normal SSD-group. □
We now give an alternative formulation of SSD-group in terms of “commutators” of a group. First, we recall the following definition:
Definition 21.
Let
be any group and . The element is usually denoted and called the commutator of and .
It is well known that is abelian if and only if , for all . This motivates the following proposition:
Proposition 15.
Let
be an SSD-group. Then, we have the following:
- i.
- If is a normal SSD-group, then ), for all ,
- ii.
- for all if and only is is a normal SSD-group, where is bijective.
Proof.
Let be an SSD-group and .
- i.
- Suppose that is a normal SSD-group. Then, ), for all .
- ii.
- Let . Then,
4. On E-Set, Soft Cosets, and Soft Quotient Groups of Soft Symmetric Difference Groups
In this section, we introduce the concept of e-sets and construct and study soft cosets and soft quotient groups of soft symmetric difference groups. Moreover, we characterize these notions in detail in terms of the normality of soft symmetric difference groups.
Proposition 16.
If
is an SSD-group, then is a subgroup of , where
Proof.
It is clear that , thus, and . Let . Then, . Moreover, for all , we have
Since , for all , it follows that . Thus, , for all . Thus, is a subgroup of . □
Proposition 17.
If
is a normal SSD-group, then is a normal subgroup of .
Proof.
Let be a normal SSD-group. By Proposition 16, it is clear that is a subgroup of . Let and . Then, we have
Hence, , therefore is a normal subgroup of . □
Proposition 18.
Let
be an SSD-group. Then, for all , if and only if .
Proof.
Let be an SSD-group and , for all . By setting ,
Thus, Conversely, assume that Then, . Thus, for all , we have
Therefore, for all , holds. Moreover, for all ,
Thus, , for all . From these results, it follows that , for all . □
Proposition 19.
Let
be an SSD-group. If , then , for all .
Proof.
Let be an SSD-group. Suppose that . Then, . By Proposition 18, , for all . Then, for all ,
Thus, . Moreover, we have
Hence, , for all . From these results, it follows that , for all . Hence, , for all . □
Proposition 20.
Let
be an SSD-group and . We have the following statements:
- (i)
- If then ,
- (ii)
- If then ,
- (iii)
- If then ,
- (iv)
- If then .
Proof:
Let be an SSD-group and .
- (i)
- If then . Thus,
Therefore, Similarly,
Hence, . Thus, .
- (ii)
- If then . Thus,
Therefore, Similarly,
Hence, . Thus, .
- (iii)
- If then . Thus,
Therefore, Similarly,
Hence, . Thus, .
- (iv)
- If then . Thus,
Therefore, Similarly,
Hence, . Thus, . □
In Refs. [71,83,84,85,88], soft cosets within the framework of soft int-groups were investigated. In parallel, our study extends this notion to SSD-groups as follows:
Definition 22.
Let
be an SSD-group and . The soft left coset of by , denoted by , is defined by
and the soft right coset of by , denoted by , is defined by
for all .
Note 4.
If
is an abelian group, then , for all , since , for all .
The converse of Note 4 holds when the SSD-group is injective, as shown in Proposition 21:
Proposition 21.
If
is an injective SSD-group and for all , then is an abelian group.
Proof.
Let be an injective SSD-group and , for all . Then, for all ,, we have
Since is injective, for all ,. Thus, is abelian. □
Theorem 5.
Let
be an SSD-group. Then, is a normal SSD-group if and only if , for all .
Proof.
Let and be a normal SSD-group. Then, , for all . Thus, , for all .
Conversely, let , for all . Then, , for all . Thus, , for all . Since is arbitrary, is a normal SSD-group. □
Example 9.
Consider the group
and the SSD-group over in Example 1. Then, the soft left cosets of are as follows:
Since is an abelian group, the soft right cosets of are as follows:
Note 5.
If is an abelian group, then is a normal SSD-group. Thus, , for all . However, may be also a normal SSD-group, that is, it is possible that for all , even when is not abelian. Now, we give the following example:
Example 10.
Consider the group and the SSD-group
over in Example 7. Then, the soft left cosets of are as follows:
The soft right cosets of are as follows:
Hence, , , , , .
We see that, although is not abelian, , for all ; that is, is a normal SSD-group by Theorem 5.
Proposition 22.
If
is an SSD-group, then = .
Proof.
Let be an SSD-group. Then, for all , we have
Thus, itself is a left as well as right coset. □
Note 6.
Soft left (right) cosets are not necessarily SSD-groups.
Example 11.
Consider the left coset
given in Example 10. Since
is not an SSD-group.
Theorem 6.
Let
be an SSD-group and . Then, if and only if , where = .
Proof.
Let be an SSD-group and . Then, . Thus, we have
Thus, . Besides, for all ,
Hence, . Then, for all . Similarly, for all , we have
Thus, . Besides, for all ,
Thereby, . Then, , for all . In conclusion, , for all .
Conversely, let us assume that . Then, for all , we have
Moreover, if we choose , then
This completes the proof. □
Note 7.
Theorem 6 plays a central role because it determines which of these cosets coincide even when
is non-abelian and is not a normal SSD-group. Moreover, Theorem 6 allows us to conclude that certain soft left (or right) cosets coincide whenever the order of exceeds 1.
Proposition 23.
Let
be an SSD-group and . Then,
is an equivalence relation on .
Proof.
Let be an SSD-group and . Since for all , is reflexive.
Suppose that . Then, Thus, , implying that . Thus, is symmetric.
Let and . Then, and . Hence,
This implies that . Thus, is transitive.
Since is an equivalence relation on , we can mention the equivalence classes for all :
That is . Note here that if the relation is defined as follows, , then □
Theorem 7.
Let
be an SSD-group. Then,
for all G.
Proof.
Let be an SSD-group. Suppose that = , for all . Thus, = , for all , which means that , for all . Choosing yields . Thus, , so = .
Conversely, suppose that Since is a subgroup of , then . It follows that
Thus, , for all . Similarly,
Hence, for all , implying that . □
Theorem 8.
Let
be an SSD-group. Then,
for all .
Proof.
The proof is similar to the proof of Theorem 7. □
Note 8.
Theorems 7 and 8 are highly significant, as they identify which soft left (resp., right) cosets are equal to one another.
Example 12.
Consider the group
and the SSD-group
over in Example 7, where .
Then, , , .
Similarly, , , .
It is seen that and . In Example 10, it is also shown that and .
Proposition 24.
Let
be an SSD-group and . If then .
Proof.
Let be an SSD-group, and . Then, □
Proposition 25.
Let be an SSD-group and . If then .
Proof.
The proof is similar to the proof of Proposition 24. □
Proposition 26.
Let be an SSD-group and . Then, if and only if .
Proof.
Let be an SSD-group, and . Then,
Conversely, let . Then, for all , we have
Thus, . □
Proposition 27.
Let
be an SSD-group and . Then, if and only if .
Proof.
Let be an SSD-group and . Then, □
Example 13.
In Example 7 and Example 10, , and .
Proposition 28.
Let be an SSD-group and . If , for all , then is a normal SSD-group.
Proof.
Let be an SSD-group and for all . Thus, . Let Then, . Thus,
We obtain that . By Proposition 20 (i), . Therefore, we have
for all By Theorem 4, is a normal SSD-group. □
Theorem 9.
Let
be an SSD-group and . If , for all then is a normal SSD-group.
Proof.
It follows by Proposition 27 and Proposition 28. □
Theorem 10.
The number of different (not identical/not equal) soft left cosets is equal to the number of different (not identical/not equal) soft right cosets of an SSD-group.
Proof.
Let an SSD-group and : ∈ and : ∈ be the set of soft right and soft left cosets of , respectively. Define a map from to as follows:
First, let us show is a well-defined function. Let and = . We need to show that .
Hence, is a well-defined function. Now, we show that is an injective function. Let and = . We need to show that = .
Hence, is an injective function. Since, for all , there exists such that ) = , is a surjective function. Therefore, is bijective. So, we are done. □
Definition 23.
The number of different (not identical/not equal) soft right cosets of
is equal to the number of different soft left cosets, and is known as the soft index of in , denoted by : .
Example 14.
In Example 1, different soft left cosets of
are and , and so : . In Example 10, different soft left cosets of are , and so : .
Corollary 1.
By the proof of Theorem 10, we can conclude that
) for all , , where is an SSD-group. In fact, in Example 10, , and .
Theorem 11.
Let
, and be a normal SSD-group. Then, if and only if , for all , .
Proof.
Let , ∈ and = . We need to show that . Since is a normal SSD-group, then
Here note that since is a normal SSD-group, then = , thus .
Now, let for all , ∈. We need to show that = .
Here again note that since is a normal SSD-group, then = , thus In fact, in Example 10, , and . □
Theorem 12.
Let
, and be a normal SSD-group. Then, if and only if for all , .
Proof.
The proof is similar to the proof of Theorem 11. □
In Refs. [84,85,88], soft quotient (or factor) group within the framework of soft int-group was investigated. In parallel, our study extends this notion to SSD-groups via normal SSD-groups.
Definition 24.
Let
be a normal SSD-group. Consider the set , where is the set of all the soft left (right) cosets of . Define an operation of composition on as follows:
for all . Then, is called the soft quotient (or factor) group of relative to the normal SSD-group .
Theorem 13.
If
is a normal SSD-group, then forms a group under the composition on , where , for all .
Proof.
Let be a normal SSD-group and consider the set . Define the composition on as . To show that the above composition is well-defined, let and . We need to show that
Since , we have and . Let . Then, we have
Thus, and so . So, we are done.
We can easily show that is a group with the identity . It is obvious that the order of is the soft index of in . □
Example 15.
Consider the normal SSD-group
in Example 1. By Example 9, and the Cayley table of the soft quotient group is as Table 4:
Table 4.
Cayley table of the soft quotient group in Example 15.
One can easily show that is a group, even isomorphic to
Theorem 14.
If
is a normal SSD-group, then
Proof.
Since is a normal SSD-group, by Proposition 17, is a normal subgroup of G. Hence, is a quotient group. Let the operation defined on be and be ”. By Theorem 13, is a group. Now, define a map by
Firstly, is a homomorphism, since
for all , . On the other hand, if then . Thus, ψ is injective. Moreover, for all there exists at least one such that . Hence, is bijective and so, □
Example 16.
In Example 9,}. Thus, and
Note 9.
By Theorems 8 and 14,
: : .
This equality indicates that once the set is known, we can determine the number of distinct soft left or right cosets of in ; that is, we can compute the index of in , and consequently the soft index of in .
Example 17.
In Example 9, [
: and in Example 10, [: . Thus, in Example 9, [: and in Example 10, [: .
Proposition 29.
Let
be an SSD-group and . Then, if and only if , where .
Proof.
Let and , where . Then, , and so . Since [: [: ], the number of different soft left (right) cosets is the order of . Thus, . The converse is obvious. □
Example 18.
In Example 9,
and there do not exist any soft left (right) coset such that and , where
In fact in Example 9, and That is, there are four different soft (left) right cosets, which equals the order of .
Theorem 15.
Let
be an SSD-group. Then, is a normal SSD-group if and only if is abelian.
Proof.
Let be a normal SSD-group and the operation defined on be . Since is a normal SSD-group, we can construct the quotient group . Let for all . Thus, we have
Thus, is abelian.
Conversely, let be an abelian group. Then, we have
for all . Thus, is a normal SSD-group. □
Corollary 2.
If [ : , or , where is a prime number, then is a normal SSD-group.
In [88], the order of an element induced by the SSD-group and the order of soft cosets within the framework of soft int-groups were investigated. In parallel, our study extends this notion to SSD-groups for constructing -SSD-group as follows:
Definition 25.
Let
be an SSD-group. If there exists a positive integer such that , then is said to have finite order and the smallest such positive integer such that is called the order of with respect to , and is denoted by . If there does not exist such a positive integer, then is said to have infinite order.
Definition 26.
If
is a power of a prime number for all , is called -SSD-group.
Example 19.
In Example 1,
=1, = . Thus, is a -SSD-group.
Definition 27.
Let
be a quotient group and . If there exists a positive integer such that then is said to have finite order and the smallest such positive integer such that is called the order of is denoted by .
Definition 28.
Let
be a quotient group. If there exist nonnegative integers and a prime such that , for any , then is called a -group.
Theorem 16.
Let
be a normal SSD-group. Then, is a -SSD-group if and only if is a -group.
Proof.
Let be a normal -SSD-group. Then, for any , there exist nonnegative integers and a prime such that . Then, we have
Thus, is a -group. Conversely, let be a -group. Then, for any , there exist nonnegative integers and prime such that . Thus,
Hence, is a -SSD-group. □
Proposition 30.
Let
be an SSD-group and . If for all then is an abelian -group.
Proof.
Let be an SSD-group, for all , and the operation defined on be . By Proposition 28, is a normal SSD-group. Then, by Theorem 15, is an abelian group. Thus, we need to demonstrate that is a -group. Let for all . Then, , for all . Thus, we have
Thus, for all , , where is the order of . Therefore, for all , 1 or 2. So, we are done. □
5. Conclusions
In this study, the notion of a soft symmetric difference group (SSD-group) is introduced as a new type of soft group that integrates soft set theory with group theory through the symmetric difference operation and set inclusion. Fundamental concepts, including soft symmetric difference subgroups, normal and characteristic soft symmetric difference groups, soft normalizers, and soft cosets of soft symmetric difference groups, are rigorously defined, and their essential algebraic properties are systematically investigated. Several characterization results are established, providing necessary and sufficient conditions for a soft set to admit an SSD-group structure. Furthermore, soft quotient (factor) groups of SSD-groups are introduced, and their structural properties are examined within the proposed framework. Important connections between SSD-group theory and classical group theory are also established through related concepts. The inclusion of illustrative examples demonstrates the internal consistency of the theory and clarifies the behavior of the newly defined notions. The results presented in this paper extend existing soft group constructions and enrich the algebraic foundations of soft set theory. The proposed framework provides a solid basis for further investigations into homomorphisms, isomorphism theorems, and additional algebraic properties of soft symmetric difference groups. We note that no finiteness assumption is imposed on the group in the main results. Although the examples presented in this paper involve generally finite groups for computational transparency, the theory developed here applies equally to infinite groups. A systematic investigation of SSD-structures over infinite groups may lead to further structural classification results and will be considered in future. In particular, SSD-structures over infinite cyclic groups or infinite abelian groups provide natural testing grounds for further theoretical refinement. Moreover, it supports future research on uncertainty-based algebraic systems and the extension of soft operations to broader algebraic structures such as semigroups and rings. These developments may ultimately contribute to a deeper unification of soft algebra and classical algebraic theory, and enhance our understanding of how soft set operations interact with conventional algebraic structures.
Author Contributions
Conceptualization, A.S. and İ.D.; methodology, A.S. and E.K.; software, E.K.; validation, A.S., İ.D. and E.K.; formal analysis, İ.D.; investigation, A.S., İ.D. and E.K.; resources, A.S. and İ.D.; data curation, A.S., İ.D. and E.K.; writing—original draft preparation, A.S.; writing—review and editing, A.S., İ.D. and E.K.; visualization, E.K.; supervision, A.S. and E.K.; project administration, E.K. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by Research Fund of the Ataturk University, Project Number: 16781.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Acknowledgments
The authors have reviewed and edited the output and take full responsibility for the content of this publication. This paper is derived from the second author’s Master’s thesis supervised by the first author at Amasya University, Türkiye.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Zadeh, L.A. Fuzzy sets. Inform. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
- Molodtsov, D. Soft set theory-First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Scilit]
- Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Scilit]
- Pei, D.; Miao, D. From sets to information systems. In Proceedings of the Granular Computing (GrC 2005), Beijing, China, 25–27 July 2005; Hu, X., Liu, Q., Skowron, A., Lin, T.Y., Yager, R.R., Zhang, B., Eds.; IEEE: Piscataway, NJ, USA, 2005; Volume 2, pp. 617–621. [Google Scholar] [CrossRef] [Scilit]
- 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] [Scilit]
- Yang, C.F. A note on “soft set theory” [Comput. Math. Appl. 2003, 45, 555–562]. Comput. Math. Appl. 2008, 56, 1899–1900. [Google Scholar] [CrossRef] [Scilit]
- Feng, F.; Li, Y.M.; Davvaz, B.; Ali, M.I. Soft sets combined with fuzzy sets and rough sets: A tentative approach. Soft Comput. 2010, 14, 899–911. [Google Scholar] [CrossRef] [Scilit]
- Jiang, Y.; Tang, Y.; Chen, Q.; Wang, J.; Tang, S. Extending soft sets with description logics. Comput. Math. Appl. 2010, 59, 2087–2096. [Google Scholar] [CrossRef] [Scilit]
- Ali, M.I.; Shabir, M.; Naz, M. Algebraic structures of soft sets associated with new operations. Comput. Math. Appl. 2011, 61, 2647–2654. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Atagün, A.O. On operations of soft sets. Comput. Math. Appl. 2011, 61, 1457–1467. [Google Scholar] [CrossRef] [Scilit]
- Neog, T.J.; Sut, D.K. A new approach to the theory of soft sets. Int. J. Comput. Appl. 2011, 32, 1–6. Available online: https://ijcaonline.net/archives/volume32/issue2/3874-5415/ (accessed on 20 January 2026).
- Fu, L. Notes on soft set operations. ARPN J. Syst. Softw. 2011, 1, 205–208. [Google Scholar]
- Ge, X.; Yang, S. Investigations on some operations of soft sets. World Acad. Sci. Eng. Technol. 2011, 5, 370–373. [Google Scholar]
- Park, J.H.; Kim, O.H.; Kwun, Y.C. Some properties of equivalence soft set relations. Comput. Math. Appl. 2012, 63, 1079–1088. [Google Scholar] [CrossRef] [Scilit]
- Singh, D.; Onyeozili, I.A. Some conceptual misunderstanding of the fundamentals of soft set theory. ARPN J. Syst. Softw. 2012, 2, 251–254. [Google Scholar]
- Singh, D.; Onyeozili, I.A. Some results on distributive and absorption properties on soft operations. IOSR J. Math. 2012, 4, 18–30. [Google Scholar] [CrossRef] [Scilit]
- Singh, D.; Onyeozili, I.A. On some new properties on soft sets operations. Int. J. Comput. Appl. 2012, 59, 39–44. [Google Scholar] [CrossRef] [Scilit]
- Singh, D.; Onyeozili, I.A. Notes on soft matrices operations. ARPN J. Sci. Technol. 2012, 2, 861–869. [Google Scholar]
- Zhu, P.; Wen, Q. Operations on Soft Sets Revisited. J. Appl. Math. 2013, 2013, 105752. [Google Scholar] [CrossRef] [Scilit]
- Jayanta, S. On algebraic structure of soft sets. Ann. Fuzzy Math. Inform. 2014, 7, 1013–1020. [Google Scholar]
- Onyeozili, I.A.; Gwary, T.M. A study of the fundamentals of soft set theory. Int. J. Sci. Technol. 2014, 3, 132–143. [Google Scholar]
- Husain, S.; Shivani, K. A study of properties of soft set and its applications. Int. Res. J. Eng. Technol. 2018, 5, 363–372. [Google Scholar]
- Sezgin, A.; Kökçü, H.; Atagün, A.O. A comprehensive study on restricted and extended intersection operations of soft sets. Nat. Appl. Sci. J. 2025, 8, 44–111. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Kökçü, H.; Stojanović, N.; Luzum, M. An extensive investigation of restricted and extended union operations of soft sets. Int. J. Eng. Sci. Technol. 2025, 17, 1–43. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Kökçü, H.; Riaz, M. A detailed analysis of restricted and extended difference operations of soft sets. Int. J. Eng. Sci. Technol. 2025, 17, 1–38. [Google Scholar] [CrossRef] [Scilit]
- Güzel Ergül, Z. A new type of soft multi rough sets. Demonstr. Math. 2025, 58, 20250199. [Google Scholar] [CrossRef] [Scilit]
- Xiao, Z.; Gong, K.; Xia, S.; Zou, Y. Exclusive disjunctive soft sets. Comput. Math. Appl. 2010, 59, 2128–2137. [Google Scholar] [CrossRef] [Scilit]
- Zhang, H.; Luo, M. The “generator” of int-soft filters on residuated lattices. Mathematics 2019, 7, 236. [Google Scholar] [CrossRef] [Scilit]
- Jana, C.; Pal, M. On (α,β)-US sets in BCK/BCI-Algebras. Mathematics 2019, 7, 252. [Google Scholar] [CrossRef] [Scilit]
- Min, W.K. Consistent sets of soft contexts defined by soft sets. Mathematics 2019, 7, 71. [Google Scholar] [CrossRef] [Scilit]
- Al Ghour, S. Some modifications of pairwise soft sets and some of their related concepts. Mathematics 2021, 9, 1781. [Google Scholar] [CrossRef] [Scilit]
- Alexandru, A.; Ciobanu, G. Soft sets with atoms. Mathematics 2022, 10, 1956. [Google Scholar] [CrossRef] [Scilit]
- Ameen, Z.A.; Al-shami, T.M.; Abu-Gdairi, R.; Mhemdi, A. The relationship between ordinary and soft algebras with an application. Mathematics 2023, 11, 2035. [Google Scholar] [CrossRef] [Scilit]
- Ameen, Z.A.; Alqahtani, M.H. Baire category soft sets and their symmetric local properties. Symmetry 2023, 15, 1810. [Google Scholar] [CrossRef] [Scilit]
- Ameen, Z.A.; Alqahtani, M.H. Some classes of soft functions defined by soft open sets modulo soft sets of the first category. Mathematics 2023, 11, 4368. [Google Scholar] [CrossRef] [Scilit]
- Shabir, M.; Mushtaq, R.; Jawad, M.; Naz, M.; Jarad, F.; Abdeljawad, T. Int N-soft substructures of semigroups. Mathematics 2023, 11, 267. [Google Scholar] [CrossRef] [Scilit]
- Chen, X.; Yadav, P.; Singh, R.; Islam, S.M.N. ES structure based on soft J-subset. Mathematics 2023, 11, 853. [Google Scholar] [CrossRef] [Scilit]
- Musa, S.Y.; Mohammed, R.A.; Asaad, B.A. N-Hypersoft Sets: An innovative extension of hypersoft sets and their applications. Symmetry 2023, 15, 1795. [Google Scholar] [CrossRef] [Scilit]
- Onar, S.A. Note on neutrosophic soft set over hyperalgebras. Symmetry 2024, 16, 1288. [Google Scholar] [CrossRef] [Scilit]
- Atagün, A.O.; Kamacı, H.; Oktay, O. Reduced soft matrices and generalized products with applications in decision making. Neural Comput. Appl. 2018, 29, 445–456. [Google Scholar] [CrossRef] [Scilit]
- Kamacı, H.; Saltık, K.; Akız, H.F.; Atagün, A.O. Cardinality inverse soft matrix theory and its applications in multicriteria group decision making. J. Intell. Fuzzy Syst. 2018, 34, 2031–2049. [Google Scholar] [CrossRef] [Scilit]
- Shah, N.; Rehman, N.; Shabir, M.; Irfan Ali, M. Another approach to roughness of soft graphs with applications in decision making. Symmetry 2018, 10, 145. [Google Scholar] [CrossRef] [Scilit]
- Petchimuthu, S.; Garg, H.; Kamacı, H.; Atagün, A.O. The mean operators and generalized products of fuzzy soft matrices and their applications in MCGDM. Comput. Appl. Math. 2020, 39, 68. [Google Scholar] [CrossRef] [Scilit]
- Güzel; Ergül, Z. Comparison of various types of inverse soft covering upper approximations with an application to decision making. Dolomites Res. Notes Approx. 2026, 19, 1–11. [Google Scholar] [CrossRef]
- 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] [Scilit]
- Sangodapo, T.O.; Onasanya, B.O.; Mayerova-Hoskova, S. Decision-making with fuzzy soft matrix using a revised method: A case of medical diagnosis of diseases. Mathematics 2021, 9, 2327. [Google Scholar] [CrossRef] [Scilit]
- Mahmood, T.; Ahmmad, J.; Ali, Z.; Pamucar, D.; Marinkovic, D. Interval valued T-spherical fuzzy soft average aggregation operators and their applications in multiple-criteria decision making. Symmetry 2021, 13, 829. [Google Scholar] [CrossRef] [Scilit]
- Ali, Z.; Mahmood, T.; Ullah, K.; Pamucar, D.; Cirovic, G. Power aggregation operators based on t-norm and t-conorm under the complex intuitionistic fuzzy soft settings and their application in multi-attribute decision making. Symmetry 2021, 13, 1986. [Google Scholar] [CrossRef] [Scilit]
- Khan, A.; Yang, M.-S.; Haq, M.; Shah, A.A.; Arif, M. A new approach for normal parameter reduction using σ-algebraic soft sets and ıts application in multi-attribute decision making. Mathematics 2022, 10, 1297. [Google Scholar] [CrossRef] [Scilit]
- Kalaiselvan, S.; Vijayabalaji, S. Soft expert symmetric group and ıts application in MCDM problem. Symmetry 2022, 14, 2685. [Google Scholar] [CrossRef] [Scilit]
- Ahmmad, J.; Mahmood, T. Picture fuzzy soft prioritized aggregation operators and their applications in medical diagnosis. Symmetry 2023, 15, 861. [Google Scholar] [CrossRef] [Scilit]
- Chen, H.; Liu, Y. Group decision-making method with incomplete intuitionistic fuzzy soft information for medical diagnosis model. Mathematics 2024, 12, 1823. [Google Scholar] [CrossRef] [Scilit]
- Liu, W.; Helil, N. Soft set decision and cluster percolation method-based policy clustering and encryption optimization for CP-ABE. Mathematics 2024, 12, 259. [Google Scholar] [CrossRef] [Scilit]
- Musa, S.Y.; Alajlan, A.I.; Asaad, B.A.; Ameen, Z.A. N-bipolar soft expert sets and their applications in robust multi-attribute group decision-making. Mathematics 2025, 13, 530. [Google Scholar] [CrossRef] [Scilit]
- Khan, A.; Abidin, M.Z.; Sarwar, M.A. Another view on soft expert set and its application in multi-criteria decision-making. Mathematics 2025, 13, 252. [Google Scholar] [CrossRef] [Scilit]
- Qin, K.Y.; Hong, Z.Y. On soft equality. J. Comput. Appl. Math. 2010, 234, 1347–1355. [Google Scholar] [CrossRef] [Scilit]
- Jun, Y.B.; Yang, X. A note on the paper “Combination of interval-valued fuzzy set and soft set” [Comput. Math. Appl. 2009, 58, 521–527]. Comput. Math. Appl. 2011, 61, 1468–1470. [Google Scholar] [CrossRef] [Scilit]
- Liu, X.Y.; Feng, F.; Jun, Y.B. A note on generalized soft equal relations. Comput. Math. Appl. 2012, 64, 572–578. [Google Scholar] [CrossRef] [Scilit]
- Feng, F.; Li, Y. Soft subsets and soft product operations. Inform. Sci. 2013, 232, 44–57. [Google Scholar] [CrossRef] [Scilit]
- Abbas, M.; Ali, B.; Romaguera, S. On generalized soft equality and soft lattice structure. Filomat 2014, 28, 1191–1203. [Google Scholar] [CrossRef] [Scilit]
- Abbas, M.; Ali, M.I.; Romaguera, S. Generalized operations in soft set theory via relaxed conditions on parameters. Filomat 2017, 31, 5955–5964. [Google Scholar] [CrossRef] [Scilit]
- Al-shami, T.M. Investigation and corrigendum to some results related to g-soft equality and gf-soft equality relations. Filomat 2019, 33, 3375–3383. [Google Scholar] [CrossRef] [Scilit]
- Al-shami, T.M.; El-Shafei, T. T-soft equality relation. Turk. J. Math. 2020, 44, 25. [Google Scholar] [CrossRef] [Scilit]
- Ali, B.; Saleem, N.; Sundus, N.; Khaleeq, S.; Saeed, M.; George, R.A. A contribution to the theory of soft sets via generalized relaxed operations. Mathematics 2022, 10, 2636. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Atagün, A.O.; Çağman, N. A complete study on and-product of soft sets. Sigma J. Eng. Nat. Sci. 2025, 43, 1–14. [Google Scholar] [CrossRef] [Scilit]
- Orbay, K.; Orbay, M.; Sezgin, A. An exhaustive analysis of the OR-product of soft sets: A symmetry perspective. Symmetry 2025, 17, 1661. [Google Scholar] [CrossRef] [Scilit]
- Çağman, N.; Enginoğlu, S. Soft set theory and uni-int decision making. Eur. J. Oper. Res. 2010, 207, 848–855. [Google Scholar] [CrossRef] [Scilit]
- Sezer, A.S. A new view to ring theory via soft union rings, ideals and bi-ideals. Knowl.-Based Syst. 2012, 36, 300–314. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A. A new approach to semigroup theory I: Soft union semigroups, ideals and bi-ideals. Algebra Lett. 2016, 2016, 3. [Google Scholar]
- Muştuoğlu, E.; Sezgin, A.; Türk, Z.K. Some characterizations on soft uni-groups and normal soft uni-groups. Int. J. Comput. Appl. 2016, 155, 1–8. [Google Scholar] [CrossRef] [Scilit]
- Kaygisiz, K. On soft int-groups. Ann. Fuzzy Math. Inform. 2012, 4, 365–375. [Google Scholar]
- Sezer, A.S.; Çağman, N.; Atagün, A.O.; Ali, M.I.; Türkmen, E. Soft intersection semigroups, ideals and bi-Ideals; A new application on semigroup theory I. Filomat 2015, 29, 917–946. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Çağman, N.; Atagün, A.O. A completely new view to soft intersection rings via soft uni-int product. Appl. Soft Comput. 2017, 54, 366–392. [Google Scholar] [CrossRef] [Scilit]
- Aktaş, H.; Çağman, N. Soft set and soft groups. Inf. Sci. 2007, 177, 2726–2735. [Google Scholar] [CrossRef] [Scilit]
- Aktaş, H.; Çağman, N. Erratum to “Soft sets and soft groups” [Information Sciences 177 (2007) 2726–2735]. Inf. Sci. 2007, 179, 338. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Atagün, A.O. Soft groups and normalistic soft groups. Comput. Math. Appl. 2011, 62, 685–698. [Google Scholar] [CrossRef] [Scilit]
- Aslam, M.; Qurashi, S.M. Some contributions to soft groups. Ann. Fuzzy Math. Inf. 2012, 4, 177–195. [Google Scholar]
- Aktaş, H.; Özlü, Ş. Cyclic soft groups and their applications on groups. Sci. World J. 2014, 2014, 5. [Google Scholar] [CrossRef] [Scilit]
- Nazmal, S. Some properties of soft groups and fuzzy soft groups under soft mappings. Palest. J. Math. 2019, 8, 189–199. [Google Scholar]
- Barzegar, R.; Hosseini, S.B.; Çağman, N. Second type nilpotent soft subgroups. Afr. Math. 2023, 34, 17. [Google Scholar] [CrossRef] [Scilit]
- Alajlan, A.I.; Alghamdi, A.M. Soft groups and characteristic soft subgroups. Symmetry 2023, 15, 1450. [Google Scholar] [CrossRef] [Scilit]
- Atagün, A.O.; Sezgin, A.; Argün, S.R. Soft prime groups, strong conjugation and applications of sylow theorems to soft groups. Bol. Soc. Parana. Mat. 2025, 43, 1–13. [Google Scholar] [CrossRef] [Scilit]
- Çağman, N.; Çitak, F.; Aktaş, H. Soft int-group and its applications to group theory. Neural Comput. Appl. 2012, 2, 151–158. [Google Scholar] [CrossRef] [Scilit]
- Kaygisiz, K. Normal soft int-groups. arXiv 2012, arXiv:1209.3157. [Google Scholar] [CrossRef] [Scilit]
- Kaygisiz, K. Homomorphism and isomorphism of soft int-groups. Afr. Mat. 2018, 29, 641–654. [Google Scholar] [CrossRef] [Scilit]
- Rasuli, R. Notes on the normal soft int-groups of a soft int-group. Ann. Math. Comput. Sci. 2022, 9, 41–51. [Google Scholar]
- Çağman, N.; Barzegar, R.; Hosseini, S.B. On fundamental isomorphism theorems in soft subgroups. Soft Comput. 2020, 24, 11841–11851. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; İlgin, A.; Kocakaya, F.Z.; Baş, Z.H.; Onur, B.; Çitak, F. A remarkable contribution to int-group theory via a comprehensive view of soft cosets. J. Sci. Arts 2024, 24, 905–934. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Çağman, N.; Türk, Z.K.; Muştuoğlu, E. Soft uni-group and its applications to group theory. Algebra Lett. 2018, 2018, 2. [Google Scholar] [CrossRef] [Scilit]
- Enginoğlu, S. Soft Sets and Soft Decision Making Methods. Master’s Thesis, Graduate School of Natural and Applied Science, Gaziosmanpaşa University, Tokat, Türkiye, 2008. [Google Scholar]
- Sezgin, A.; Durak, İ.; Ay, Z. Soft symmetric difference complement with soft intersection symmetric difference complement product of groups. Middle East J. Sci. 2025, 11, 195–213. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Ay, Z.; Karaduman, E. Soft symmetric difference complement groups with group applications: A new soft group type. Int. J. Anal. Appl. 2026; in press.
- Sezgin, A.; Durak, İ. Soft intersection-symmetric difference product of groups. Matrix Sci. Math. 2025, 9, 49–55. [Google Scholar] [CrossRef] [Scilit]
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. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.