Skip to Content
MathematicsMathematics
  • Article
  • Open Access

16 March 2026

30 Pages

A New Type of Soft Group: Soft Symmetric Difference Group with Group Theory Applications

,
and
1
Department of Mathematics and Science Education, Faculty of Education, Amasya University, 05100 Amasya, Türkiye
2
Department of Mathematics, Graduate School of Natural and Applied Sciences, Amasya University, 05100 Amasya, Türkiye
3
Department of Mathematics, Faculty of Science, Atatürk University, 25100 Erzurum, Türkiye
*
Author to whom correspondence should be addressed.

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.

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  E  be a parameter set,  U  be a universal set,  P U  be the power set of  U , and  H ⊆ E . The soft set  f H  over  U  is a function such that  ƭ H : E → P U , where for all  w ∉ H ,  ƭ H w = ∅ .
Throughout this paper, a soft set over  U  is abbreviated by  S S , and universal set by  U S .
Definition 2
([67]). Let  ƭ H  be an  S S . If  ƭ H w = ∅  for all  w ∈ E , then  ƭ H  is called the null  S S  and denoted by  ∅ E , and if  ƭ H w = U , for all  w ∈ E , then  ƭ H  is called the absolute  S S  denoted by  U E .
Definition 3
([67]). Let  ƭ H  and  g ℵ  be two  S S s. If  ƭ H w ⊆ g ℵ w , for all  w ∈ E , then  ƭ H  is said to be a soft subset of  g ℵ  and indicated by  ƭ H ⊆ ~ g ℵ . If  ƭ H w = g ℵ w , for all  w ∈ E , then  ƭ H  is called soft equal to  g ℵ , and denoted by  ƭ H = g ℵ .
Definition 4
([67]). Let  ƭ H  be an  S S . The complement of  ƭ H  denoted by  ƭ H c , is defined by the soft set  ƭ H c :   E → P ( U )  such that  ƭ H c e = U \ ƭ H e = ƭ H e ′ , for all  e ∈ E , where  ƭ H e ′  is the complement of  ƭ H e .
From now on, ∆ stands for the symmetric difference operation on sets, G is a group with identity element e , S G U denotes the collection of all  S S s over U parameterized by G .
Definition 5
([90]). Let  Ɉ G  and  ℘ G  be  S S s. The soft symmetric difference of  Ɉ G  and  ℘ G  is the S S   Ɉ G ∆ ~ ℘ G , where  Ɉ G ∆ ~ ℘ G w = Ɉ G w ∆ ℘ G w , for all  w ∈ G .
Definition 6
([91]). Let  Ɉ G  and  ℘ G  be  S S s. The soft symmetric difference complement of  Ɉ G  and  ℘ G  is the S S   Ɉ G ∐ ~ ℘ G , defined by  Ɉ G ∐ ~ ℘ G w = Ɉ G ∆ ~ ℘ G c w = Ɉ G w ∆ ℘ G w ′ , for all  w ∈ G , where  Ɉ G w ∆ ℘ G w ′  is the complement of  Ɉ G w ∆ ℘ G w .
Definition 7
([83]). Let  ƭ G ∈ S G U . The  e -set of  ƭ G , denoted by  G ƭ G , is defined as  G ƭ G = ⱴ ∈ G :   ƭ G ⱴ = ƭ G e .
Definition 8
([92]). Let  ƭ G ∈ S G U . Then,  ƭ G  is called a soft symmetric difference complement group (SSDC-group) if  ƭ G ϰ y ⊇ ƭ G ϰ ∆ ƭ G y ′  and  ƭ G ϰ − 1 = ƭ G ϰ , for all  ϰ , y ∈ G .

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  G  be a group and  ƭ G ∈ S G U . Then,  ƭ G  is called a soft symmetric difference group over  U , if
ƭ G ϰ y ⊆ ƭ G ϰ ∆ ƭ G y   and   ƭ G ϰ − 1 = ƭ G ϰ
for all  ϰ , y ∈ G .
For the sake of brevity, the soft symmetric difference group over U is abbreviated by SSD-group and all the  S S s are the elements of S G U unless otherwise stated throughout this paper,
Example 1.
Let  U  =  D 2  =  < ϰ , y > :   ϰ 2 = y 2 = e , ϰ y = y ϰ = e , ϰ ,   y , y ϰ  be the  U S  and  G = e , o , Ҍ , ƶ  be the set of parameters, which forms a group isomorphic to  Z 2 × Z 2 , that is, the Klein four group. In particular,  G  is a non-cyclic abelian group in which every non-identity element has order two. The group operation on  G  is given by the Table 1.
Table 1. Cayley table of the group in Example 1.
Let  ƭ G  and  ʈ G  be  S S s as follows:
ƭ G = e , ∅ , o , e , ϰ , Ҍ , e , ϰ , y , ƶ , y , ʈ G = e , ∅ o , e , Ҍ , e , y ϰ , ƶ , U
One can easily show that  ƭ G  is an SSD-group. For example, for a few elements of  G , we have
ƭ G o Ҍ = ƭ G ƶ = y ⊆ ƭ G o ∆ ƭ G Ҍ = y ,
ƭ G Ҍ ƶ = ƭ G o = e , ϰ ⊆ ƭ G Ҍ ∆ ƭ G ƶ = e , ϰ ,
ƭ G ƶ o = ƭ G Ҍ = e , ϰ , y ⊆ ƭ G ƶ ∆ ƭ G o = e , ϰ , y .
It can be shown that the conditions are satisfied for the remaining elements of  G  as well. Therefore,  ƭ G  is an SSD-group. However, since
ʈ G Ҍ ƶ =   ʈ G o = e ⊈   ʈ G Ҍ ∆ ʈ G ƶ = ϰ , y ,
ʈ G  is not an SSD-group.
Example 2.
Let   G = ( Z , + )  be the infinite cyclic group of integers under addition and let  U = { a , b } . Define an S S ƭ G : Z ⟶ P ( U )  by
ƭ G k = ∅ ,               i f   k   e v e n ,   a ,             i f   k   o d d .
Then,  ƭ G  is an SSD-group. To verify that  ƭ G k + l ⊆ ƭ G k ) ∆ ƭ G ( l , for any  k , l ∈ Z , we examine the possible parity cases:
Case 1: If both  k  and    l  are even, then  k + l  is even. Thus,  ƭ G k + l = ∅ = ∅ ∆ ∅ = ƭ G k ∆ ƭ G l .
Case 2: If both  k  and    l  are odd, then  k + l  is even. Hence,  ƭ G k + l = ∅ ⊆ a ∆ a = ƭ G k ∆ ƭ G l .
Case 3: If exactly one of  k ,   l  is odd, then  k + l  is odd. Thereby,  ƭ G k + l = a ⊆ ∅ ∆ a = ƭ G k ∆ ƭ G l .
Moreover, since the integers  k  and  − k  have the same parity, where  k ∈ Z ,  ƭ G k = ƭ G ( − k )  holds, for all  k ∈ Z . Therefore,  ƭ G  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   ƭ G  is an SSD-group, then  ƭ G e = ∅ .
Proof. 
Let ƭ G be an SSD-group. Then, for all ⱴ ∈ G , we have
ƭ G e = ƭ G ⱴ ⱴ − 1 ⊆ ƭ G ⱴ ∆ ƭ G ⱴ − 1 = ƭ G ⱴ ∆ ƭ G ⱴ = ∅ .
Note that the condition ƭ G e = ∅ alone does not guarantee that ƭ G is an SSD-group. This is consistent with Example 1, which illustrates the structural distinction. In Example 1, although ʈ G e = ∅ , it has been shown that ʈ G is not an SSD-group. □
Theorem 1.
An  S S   ƭ G  is an SSD-group if and only if  ƭ G ⱴ y − 1 ⊆ ƭ G ⱴ ∆ ƭ G y ,  for all  ⱴ , y ∈ G .
Proof. 
Suppose that  S S   ƭ G is an SSD-group. Then, by Definition 9, for all y ∈ G , we have ƭ G y = ƭ G y − 1 . Thus,
ƭ G ⱴ y − 1 ⊆ ƭ G ⱴ ∆ ƭ G y − 1 = ƭ G ⱴ ∆ ƭ G y ,
for all ⱴ , y ∈ G . Hence, ƭ G ⱴ y − 1 ⊆ ƭ G ⱴ ∆ ƭ G y .
Conversely, suppose that ƭ G ⱴ y − 1 ⊆ ƭ G ⱴ ∆ ƭ G y , for all ⱴ , y ∈ G . Firstly, choosing ⱴ = e yields
ƭ G ⱴ y − 1 = ƭ G e y − 1 = ƭ G y − 1 ⊆ ƭ G e ∆ ƭ G y = ∅ ∆ ƭ G y = ƭ G y .
Moreover,
ƭ G y = ƭ G y − 1 − 1 ⊆ ƭ G y − 1
holds. From these two results, we have
ƭ G y = ƭ G y − 1
is obtained. Secondly,
ƭ G ⱴ y = ƭ G ⱴ y − 1 − 1 ⊆ ƭ G ⱴ ∆ ƭ G y − 1 = ƭ G ⱴ ∆ ƭ G y .
Thus, the  S S   ƭ G 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  ƭ G  and  ʈ G  be  S S s. Then, the soft intersection-symmetric difference product  ƭ G   ⨂ i / s ʈ G  is defined by
ƭ G ⨂ i / s ʈ G ⱴ = ⋂ ⱴ = y z ƭ G y ∆ ʈ G z ,       y , z ∈ G
for all  ⱴ ∈ G .
The inverse of  ƭ G  is defined as  ƭ G − 1 ⱴ = ƭ G ⱴ − 1 , for all  ⱴ ∈ G .
Example 3.
Let   U  =  D 2   = e , ϰ ,   y , y ϰ  be the  U S  and  G = o , Ҍ , ƶ  be the set of parameters, which forms a cyclic group of order three (isomorphic to  Z / 3 Z ). The group operation on  G  is given by Table 2:
Table 2. Cayley table of the group in Example 3.
Let  ƭ G  and  ʈ G  be  S S s as follows:
ƭ G = o , ϰ , y , y ϰ , Ҍ , e , y ϰ , ƶ , ϰ , y ϰ ,   ʈ G = o , e , y ϰ , Ҍ , ϰ , y ϰ , ƶ , e , y .
Since
o = o o = Ҍ ƶ = ƶ Ҍ , Ҍ = o Ҍ = Ҍ o = ƶ ƶ   and   ƶ = o ƶ = Ҍ Ҍ = ƶ o ƭ G ⊗ i / s ʈ G o = ƭ G o ∆ ʈ G o ∩ ƭ G Ҍ ∆ ʈ G ƶ ∩ ƭ G ƶ ∆ ʈ G Ҍ = ϰ , y ∩ y , y ϰ ∩ ∅ = ∅ , ƭ G ⊗ i / s ʈ G Ҍ = ƭ G o ∆ ʈ G Ҍ ∩ ƭ G Ҍ ∆ ʈ G o ∩ ƭ G ƶ ∆ ʈ G ƶ = y ∩ ∅ ∩ y = ∅ , ƭ G ⊗ i / s ʈ G ƶ = ƭ G o ∆ ʈ G ƶ ∩ ƭ G Ҍ ∆ ʈ G Ҍ ∩ ƭ G ƶ ∆ ʈ G o = e , ϰ , y ϰ ∩ e , ϰ ∩ e ,   ϰ = e , ϰ .
Hence, we have
ƭ G ⊗ i / s ʈ G = o , ∅ , Ҍ , ∅ , ƶ , e ,   ϰ .
Moreover, since  o − 1 = o ,    Ҍ − 1 = ƶ  and  ƶ − 1 = Ҍ , we have
ƭ G − 1 = o , ϰ , y , y ϰ , Ҍ , ϰ , y ϰ , ƶ , e , y ϰ .
Theorem 2.
ƭ G  is an SSD-group over  U  if and only if  ƭ G ⨂ i / s ƭ G ⊇ ~ ƭ G  and  ƭ G − 1 = ƭ G .
Proof. 
Let ƭ G be an SSD-group. Then, for all ⱴ ∈ G , we have
ƭ G ⨂ i / s ƭ G ⱴ = ⋂ ⱴ = y z ƭ G y ∆ ƭ G z ⊇ ⋂ ⱴ = y z ƭ G y z = ⋂ ⱴ = y z ƭ G ⱴ = ƭ G ⱴ .
Thus, ƭ G ⨂ i / s ƭ G ⊇ ~ ƭ G . The second part follows directly from the definition of the soft SSD-group, since for all ⱴ ∈ G , we have
ƭ G − 1 ⱴ = ƭ G ⱴ − 1 = ƭ G ⱴ ,
implying that ƭ G − 1 = ƭ G .
Conversely, assume that ƭ G ⨂ i / s ƭ G ⊇ ~ ƭ G and ƭ G − 1 = ƭ G . Then, for all ⱴ ∈ G , we have
ƭ G y z = ƭ G ⱴ ⊆ ƭ G ⨂ i / s ƭ G ⱴ = ⋂ ⱴ = y z ƭ G y ∆ ƭ G z ⊆ ƭ G y ∆ ƭ G z ,
where y , z ∈ G . Thus, ƭ G y z ⊆ ƭ G y ∆ ƭ G z , for all y , z ∈ G .
Moreover, since ƭ G − 1 = ƭ G , then for all ⱴ ∈ G , we have ƭ G − 1 ⱴ = ƭ G ⱴ . Besides, by Definition 10, ƭ G − 1 ⱴ = ƭ G ⱴ − 1 , implying that ƭ G ⱴ − 1 = ƭ G ⱴ , for all ⱴ ∈ G . □
Proposition 2.
If   ƭ G  is an SSD-group, then  ƭ G − 1  is also an SSD-group.
Proof. 
Let ƭ G be an SSD-group. Then, for all ⱴ , y ∈ G , we have
ƭ G − 1 ⱴ y = ƭ G ⱴ y − 1 = ƭ G y − 1 ⱴ − 1 ⊆ ƭ G y − 1 ∆ ƭ G ⱴ − 1 = ƭ G ⱴ − 1 ∆ ƭ G y − 1 = ƭ G − 1 ⱴ ∆ ƭ G − 1 y .
Thus, ƭ G − 1 ⱴ y ⊆ ƭ G − 1 ⱴ ∆ ƭ G − 1 y . Moreover, for all ⱴ ∈ G , we have
ƭ G − 1 ⱴ − 1 = ƭ G ⱴ = ƭ G ⱴ − 1 = ƭ G − 1 ⱴ .
Hence, ƭ G − 1 ⱴ − 1 = ƭ G − 1 ⱴ . So, we are done. □
Proposition 3.
If   ƭ G  and  ʈ G  are two SSD-groups, then  ƭ G ⨂ i / s ʈ G − 1 =   ʈ G − 1 ⨂ i / s ƭ G − 1 .
Proof. 
Let ƭ G and ʈ G be two SSD-groups. Then, for all ⱴ ∈ G , we have
ƭ G ⨂ i / s ʈ G − 1 ⱴ = ʈ G ⨂ i / s ƭ G ⱴ − 1   = ⋂ ⱴ − 1 = y z ƭ G y ∆ ʈ G z   = ⋂ ⱴ = z − 1 y − 1 ʈ G z − 1 ∆ ƭ G y − 1    = ⋂ ⱴ = z − 1 y − 1 ʈ G − 1 z − 1 ∆ ƭ G − 1 y − 1    = ʈ G − 1 ⨂ i / s ƭ G − 1 ⱴ .
Note here that, since ʈ G is an SSD-group, ʈ G − 1 is an SSD-group, by Proposition 2. Thus, ʈ G z − 1 = ʈ G − 1 z = ʈ G − 1 z − 1 , for all z ∈ G . Hence, ƭ G ⨂ i / s ʈ G − 1 = ʈ G − 1 ⨂ i / s ƭ G − 1 . □
Definition 11
([84]). Let  A  be a subset of  G . We denote by  δ A  the soft characteristic function of  A , and define as
δ A x = U ,           i f   x ∈ A ,                             ∅ ,           i f   x ∈ G \ A .                    
The soft characteristic function of  A  is an  S S  over  U .
Proposition 4.
If   X  and  Y  are two subsets of  G , then    δ X ∆ ~ δ Y = δ X ∆ Y .
Proof. 
Let ⱴ ∈ G . Suppose ⱴ ∈ X ∆ Y . Then, ⱴ ∈ X ∖ Y or ⱴ ∈ Y ∖ X . Firstly, let ⱴ ∈ X ∖ Y . Then, we have
δ X ∆ ~ δ Y ⱴ = δ X ⱴ ∆ δ Y ⱴ = U ∆ ∅ = U = δ X ∆ Y ⱴ .
Secondly, let ⱴ ∈ Y ∖ X . Then,
δ X ∆ ~ δ Y ⱴ = δ X ⱴ ∆ δ Y ⱴ = ∅ ∆ U = U = δ X ∆ Y ⱴ ,
implying that δ X ∆ ~ δ Y = δ X ∆ Y .
Now, let ⱴ ∉ X ∆ Y . Then, ⱴ ∈ X ∩ Y or ⱴ ∈ X ∪ Y ′ . Firstly, let ⱴ ∈ X ∩ Y . Then, we have
δ X ∆ ~ δ Y ⱴ = δ X ⱴ ∆ δ Y ⱴ = U ∆ U = ∅ = δ X ∆ Y ⱴ .
Secondly, let ⱴ ∈ X ∪ Y ′ . Then,
δ X ∆ ~ δ Y ⱴ = δ X ⱴ ∆ δ Y ⱴ = ∅ ∆ ∅ = ∅ = δ X ∆ Y ⱴ .
Hence, δ X ∆ ~ δ Y = δ X ∆ Y . □
Proposition 5.
Let   ∅ ≠ H  be a subset of  G . If  δ H c  is an SSD-group, then  H  is a subgroup of  G .
Proof. 
Let ⱴ , y ∈ H and δ H c be an SSD-group. We need to show that ⱴ y − 1 ∈ H . Then, we have
δ H c ⱴ y − 1 ⊆ δ H c ⱴ ∆ δ H c y = ∅ ∆ ∅ = ∅ .
Hence,   δ H c ⱴ y − 1 = ∅ , implying that ⱴ y − 1 ∈ H . □
Note 1.
The converse of Proposition 5 need not be true. That is, if   H  is a subgroup of  G , then  δ H c  need not be an SSD-group.
Example 4.
Let   G = Z 6  and  H = 0 ¯ , 3 ¯  be the subgroup of  Z 6 . Then, we have
δ H c = { 0 ¯ , ∅ ,   1 ¯ , U ,   2 ¯ , U ,   3 ¯ , ∅ ,   4 ¯ , U ,   5 ¯ , U } .
Since    δ H c 5 ¯ = U ⊈ δ H c 1 ¯ ∆ δ H c 4 ¯ = U ∆ U = ∅ ,    δ H c  is not an SSD-group.
Definition 12
([83]). Let  ƭ G  be an  S S  and  α ⊆ U . Then, lower  α -inclusion of  ƭ G , denoted by  L ƭ G ; α , is defined as  L ƭ G ; α = x ∈ G     ƭ G x ⊆ α .
Proposition 6.
Let   ƭ G  be an  S S  and  α  be a subset of  U  such that  α ∈ I m ƭ G , where  I m ƭ G = α ⊆ U :   ƭ G ⱴ = α ,   f o r   ⱴ ∈ G   . If  ƭ G  is an SSD-group, then  L ƭ G ; α  is a subgroup of  G .
Proof. 
Since ƭ G ⱴ = α for some ⱴ ∈ G , then ∅ ≠ L ƭ G ; α ⊆ G . Let ⱴ , y ∈ L ƭ G ; α , then ƭ G ⱴ ⊆ α and ƭ G y ⊆ α . Now, we need to show that ⱴ y − 1 ∈ L ƭ G ; α , for all ⱴ , y ∈ L ƭ G ; α . Since ƭ G is an SSD-group, it follows that ƭ G ⱴ y − 1 ⊆ ƭ G ⱴ ∆ ƭ G y ⊆ ƭ G ⱴ ∪ ƭ G y ⊆ α implying that ⱴ y − 1 ∈ L ƭ G ; α . So, we are done. □
Note 2.
If each of the L ƭ G ; α are a subgroup of G , then ƭ G need not be an SSD-group.
Example 5.
Let   G = Z 8  and the S S   ƭ G  over  U = Q  be defined as follows:
ƭ G = { 0 ¯ , ∅ , 1 ¯ , U , 2 ¯ , U , 3 ¯ , U , 4 ¯ , ∅ , 5 ¯ , U , 6 ¯ , U , 7 ¯ , U } .
By considering I m ƭ G = ∅ , U , we have the following:
L ƭ G ; α =   Z 8 ,   α = U ,   0 ¯ , 4 ¯ ,   α = ∅ .  
Here, 0 ¯ , 4 ¯ and Z 8 are both subgroups of Z 8 ; however, since
ƭ G 7 ¯ = U ⊈ ƭ G 2 ¯ ∆ ƭ G 5 ¯ = U ∆ U = ∅ ,
ƭ G is not an SSD-group.
Theorem 3.
ƭ G  is an SSD-group if and only if  ƭ G c  is an SSDC-group.
Proof. 
Let ƭ G be an SSD-group. Then, for all ⱴ , y ∈ G , we have
ƭ G c ⱴ y − 1 = U ∖ ƭ G ⱴ y − 1 ⊇ U ∖ ƭ G ⱴ ∆ ƭ G y = ƭ G ⱴ ∆ ƭ G y ′ = ƭ G c ⱴ ∆ ƭ G c y ′ .
Hence, ƭ G c ⱴ y − 1 ⊇ ƭ G c ⱴ ∆ ƭ G c y ′ , for all ⱴ , y ∈ G . That is to say, ƭ G c is an SSDC-group.
Conversely, let ƭ G c be an SSDC-group. Then, for all ⱴ , y ∈ G ,
ƭ G ⱴ y − 1 = U ∖ ƭ G c ⱴ y − 1 ⊆ U ∖ ƭ G c ⱴ ∆ ƭ G c y ′ = ƭ G c ⱴ ∆ ƭ G c y = ƭ G ⱴ ∆ ƭ G y .
Thus, ƭ G ⱴ y − 1 ⊆ ƭ G ⱴ ∆ ƭ G y , for all ⱴ , y ∈ G . Hence, ƭ G is an SSD-group. Note here that, in classical set theory, A ∆ B = A ′ ∆ B ′ , where A and B are fixed sets and A ′ ,   B ′ are the complements of A and B , respectively. □
Definition 13.
Let   H  be a subgroup of  G ,  ƭ G  be an SSD-group and  ƭ H  be a nonempty soft subset of  ƭ G . If  ƭ H  itself is an SSD-group, then  ƭ H  is called an SSD-subgroup of  ƭ G .
Example 6.
Consider the group   G = e , o , Ҍ , ƶ  and the SSD-group  ƭ G = e , ∅ , o , e , ϰ , Ҍ , e , ϰ , y , ƶ , y  over  U   = e , ϰ ,   y , y ϰ  in Example 1. Let  H = e , o  be the subgroup of  G , and  ƭ H = e , ∅ , o , ϰ  be an  S S  over  U .  It is obvious that  ƭ H  is a nonempty soft subset of  ƭ G  and
ƭ H o e = ƭ H o = ϰ ⊆ ƭ H o ∆ ƭ H e = ϰ ,   ƭ H o o = ƭ H e = ∅ ⊆ ƭ H o ∆ ƭ H o = ∅ ,   ƭ H e o = ƭ H o = ϰ ⊆ ƭ H e ∆ ƭ H o = ϰ ,   ƭ H e e = ƭ H e = ∅ ⊆ ƭ H e ∆ ƭ H e = ∅ .
Moreover,  ƭ H − 1 e = ƭ H e − 1 ,  ƭ H − 1 o = ƭ H o − 1 ,  ƭ H  is an SSD-subgroup of  ƭ G .
Definition 14.
Let   ƭ G  be an SSD-group. Then,  ƭ G  is called an abelian SSD-group if  ƭ G ⱴ y = ƭ G y ⱴ , for all  ⱴ , y ∈ G .
It is obvious that if G is abelian, then ƭ G is abelian.
Definition 15.
Let   ƭ G  be an SSD-group. Then,  ƭ G  is called soft normal in  G  (or normal SSD-group), if  ƭ G  is an abelian SSD-group.
We present the equivalent conditions of the normality of an SSD-group ƭ G with Theorem 4 in a similar manner as soft-int groups in [83]:
Theorem 4.
Let   ƭ G  be an SSD-group. Then, the following conditions are equivalent:
(1) 
ƭ G  is a normal SSD-group, that is,  ƭ G ⱴ y = ƭ G y ⱴ , for all  ⱴ ,  y ∈ G ,
(2) 
ƭ G  is constant in the conjugate class of  G , that is,  ƭ G ⱴ y ⱴ − 1 = ƭ G y , for all  ⱴ ,  y ∈ G ,
(3) 
ƭ G ⱴ y ⱴ − 1 ⊇ ƭ G y , for all  ⱴ ,  y ∈ G ,
(4) 
ƭ G ⱴ y ⱴ − 1 ⊆ ƭ G y , for all  ⱴ ,  y ∈ G .
Proof. 
Let ⱴ , y ∈ G and ƭ G be an SSD-group.
(1 ⇒ 2 ) Suppose that ƭ G is a normal SSD-group, that is, ƭ G ⱴ y = ƭ G y ⱴ , for all ⱴ , y ∈ G . Then, ƭ G ⱴ y ⱴ − 1 = ƭ G ⱴ − 1 ⱴ y = ƭ G y , for all ⱴ , y ∈ G .
(2 ⇒ 3 ) Let ƭ G ⱴ y ⱴ − 1 = ƭ G y , for all ⱴ , y ∈ G . Then, it is clear that ƭ G ⱴ y ⱴ − 1 ⊇ ƭ G y .
(3 ⇒ 4 ) Let ƭ G ⱴ y ⱴ − 1 ⊇ ƭ G y , for all ⱴ , y ∈ G . Then, ƭ G ⱴ y ⱴ − 1 ⊆ ƭ G ⱴ − 1 ⱴ y ⱴ − 1 ⱴ − 1 − 1 = ƭ G y .
(4 ⇒ 1 ) Let ƭ G ⱴ y ⱴ − 1 ⊆ ƭ G y , for all ⱴ , y ∈ G . Then, ƭ G ⱴ y = ƭ G ⱴ y ⱴ ⱴ − 1 = ƭ G ⱴ y ⱴ ⱴ − 1 ⊆ ƭ G y ⱴ = ƭ G y ⱴ y y − 1 = ƭ G y ⱴ y y − 1 ⊆ ƭ G ⱴ y . Hence, ƭ G ⱴ y = ƭ G y ⱴ is obtained. □
Definition 16.
Let   ƭ G  be an SSD-group and  ƭ N  be an SSD-subgroup of  ƭ G . Then,  ƭ N  is called a normal SSD-subgroup, if it is an abelian SSD-subgroup of  ƭ G .
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 G , whereas the second refers to a subgroup N of G satisfying an additional compatibility condition, which is a soft substructure of an SSD-group.
Example 7.
Let   U = 1,2 , 3,4  be the  U S  and consider the dihedral group  G = D 3 , whose Cayley table is as Table 3:
Table 3. Cayley table of the Dihedral group D 3 .
We define the S S   ƭ G  over  U    by
ƭ G = e , ∅ , ϰ , ∅ , ϰ 2 , ∅ , y , 1,4 , y ϰ , 1,4 , y ϰ 2 , 1,4 .
Let the S S   ƭ H  over  U  be as follows:
ƭ H = e , ∅ , ϰ , ∅ , ϰ 2 , ∅ ,
where  H = e , ϰ , ϰ 2  is the subgroup of  G . One can show that  ƭ H  is a normal SSD-subgroup of  ƭ G .
Note 3.
The soft intersection-symmetric difference product of groups is not commutative in general; however, we can state Proposition 7:
Proposition 7.
If   ƭ G  is an SSD-group and  ƭ N  is a normal SSD-subgroup of  ƭ G , then  ƭ N ⊗ i / s ƭ G = ƭ G ⊗ i / s ƭ N .
Proof. 
Let ƭ G be an SSD-group and ƭ N be a normal SSD-subgroup of ƭ G . Then, for all ⱴ ∈ G ,
ƭ H ⊗ i / s ƭ G ⱴ = ⋂ ⱴ = y z ƭ H y ∆ ƭ G z
where y ,   z ∈ G . Since ƭ N is a normal SSD-subgroup of ƭ G and y z = ⱴ , we have y = ⱴ z − 1 and
ƭ H ⊗ i / s ƭ G ⱴ = ⋂ ⱴ = ⱴ z − 1 z ƭ H ⱴ z − 1 ∆ ƭ G z = ⋂ ⱴ = z z − 1 ⱴ ƭ G z ∆ ƭ H z − 1 ⱴ = ƭ N ⊗ i / s ƭ H ⱴ .
Hence, ƭ N ⊗ i / s ƭ G = ƭ G ⊗ i / s ƭ N . □
Definition 17.
Let   ƭ G  be an SSD-group,  ψ  be a map from  G  into itself. We define a map
  ƭ G ψ : G ⟶ P ( U )
by    ƭ G ψ ⱴ = ƭ G ( ψ ⱴ ) , for all  ⱴ ∈ G . Then,  ƭ G  is called a characteristic SSD-group, if    ƭ G ψ =   ƭ G  for every automorphism  ψ  of  G .
Proposition 8.
If   ƭ G  is an SSD-group and  ψ  is a homomorphism of  G , then    ƭ G ψ  is an SSD-group.
Proof. 
Suppose that ƭ G is an SSD-group and ψ be a homomorphism of G . Then, for all ⱴ , y ∈ G ,
ƭ G ψ ⱴ y = ƭ G ψ ⱴ y = ƭ G ψ ⱴ ) ψ ( y ⊆ ƭ G ψ ⱴ ) ) ∆ ƭ G ( ψ ( y = ƭ G ψ ⱴ ∆ ƭ G ψ y .
Moreover, we have
ƭ G ψ ⱴ − 1 = ƭ G ψ ⱴ − 1 = ƭ G ( ψ ⱴ ) − 1 = ƭ G ( ψ ⱴ ) = ƭ G ψ ⱴ .
Thus,  ƭ G ψ is an SSD-group. □
Proposition 9.
Let   ƭ G  be an SSD-group, where  ƭ G  is an injective mapping and  ψ  be an epimorphism of  G . Then,    ƭ G ψ  is a normal SSD-group if and only if  G  is an abelian group.
Proof. 
Let ƭ G be an SSD-group, where ƭ G is an injective mapping and ψ is an epimorphism of G . Let G be an abelian group. By Proposition 8,  ƭ G ψ is an SSD-group. Thus, we only need to show the normality of ƭ G ψ . Since G is an abelian group, then for all ⱴ , y ∈ G , ƭ G ψ ⱴ y = ƭ G ψ y ⱴ , which shows the normality of ƭ G ψ .
Conversely, let ƭ G ψ be a normal SSD-group, where ψ be an epimorphism of G . Let ⱴ , y ∈ G . Then,
ƭ G ψ ⱴ y = ƭ G ψ y ⱴ ⟹ ƭ G ψ ( ⱴ ψ y = ƭ G ψ ( y ψ ( ⱴ ⟹ ψ ⱴ ψ y = ψ ( y ) ψ ( ⱴ ) .
Since ψ is an epimorphism of G , it follows that G is an abelian group, □
Proposition 10.
Let   ƭ G  be an SSD-group. If  ƭ G  is a characteristic SSD-group, then  ƭ G  is a normal SSD-group.
Proof: 
Let ƭ G be a characteristic SSD-group. We need to show that ƭ G ⱴ y = ƭ G y ⱴ , for all ⱴ , y ∈ G . Let ψ ⱴ be a homomorphism from G to G defined by
ψ ⱴ ( g ) = ⱴ − 1 g ⱴ
for all g ∈ G . One can easily show that ψ ⱴ is an automorphism of G induced by ⱴ . Since ƭ G is a characteristic SSD-group, then ƭ G ϕ = ƭ G for every automorphism ϕ of G . Thus, we have
ƭ G ⱴ y = ƭ G ψ ⱴ ⱴ y = ƭ G ψ ⱴ ⱴ y = ƭ G ⱴ − 1 ⱴ y ⱴ = ƭ G y ⱴ
for all ⱴ , y ∈ G . Hence, ƭ G is a normal SSD-group. □
Definition 18.
Let   ƭ G  be an SSD-group,  ƭ H  and  ƭ K  be SSD-subgroups of  ƭ G . We say that  ƭ H  is soft conjugate to  ƭ K , if there exists  y ∈ G  such that
ƭ H ( ⱴ ) = ƭ K ( y − 1 ⱴ y )
for all  ⱴ ∈ G .
Notation 1.
Let   ƭ G  be an SSD-group,  g ∈ G . We denote by
  ƭ G g : G ⟶ P ( U )
the map defined by    ƭ G g ⱴ = ƭ G ( g − 1 ⱴ g ) , for all  ⱴ ∈ G .
Example 8.
Consider the group   G = D 3  and the SSD-group
ƭ G = e , ∅ , ϰ , ∅ , ϰ 2 , ∅ , y , 1,4 , y ϰ , 1,4 , y ϰ 2 , 1,4
over  U = 1,2 , 3,4  in Example 7. Let  g = y ϰ ∈ D 3 . Then,
  ƭ G y ϰ = e , ƭ G ( e ) , ϰ , ƭ G ( ϰ 2 ) , ϰ 2 , ƭ G ( ϰ ) , y , ƭ G y ϰ 2 , y ϰ , ƭ G y ϰ , y ϰ 2 , ƭ G ( y ) =   e , ∅ , ϰ , ∅ , ϰ 2 , ∅ , y , 1,4 , y ϰ , 1,4 , y ϰ 2 , 1,4 .
Proposition 11.
If  ƭ G  is an SSD-group, then    ƭ G g  is an SSD-group, for all  g ∈ G .
Proof. 
Suppose that ƭ G is an SSD-group, g ∈ G . Then, for all ⱴ , y ∈ G ,
ƭ G g ⱴ y = ƭ G g − 1 ( ⱴ y ) g = ƭ G g − 1 ⱴ ( g g − 1 ) y g = ƭ G ( g − 1 ⱴ g ) ( g − 1 y g ) ⊆ ƭ G ( g − 1 ⱴ g ) ∆ ƭ G ( g − 1 y g ) = ƭ G g ⱴ ∆ ƭ G g y .
Moreover, we have
ƭ G g ⱴ − 1 = ƭ G g − 1 ⱴ − 1 g = ƭ G g − 1 ⱴ g − 1 = ƭ G g − 1 ⱴ g = ƭ G g ⱴ .
Thus, ƭ G g is an SSD-group. □
Definition 19.
The SSD-group     ƭ G g    in Proposition 11 is called the conjugate SSD-group determined by  ƭ G  and  g ∈ G .
Definition 20.
Let     ƭ G  be an SSD-group. Then, the normalizer of    ƭ G  is the set given by
  N ( ƭ G ) = g ∈ G ,     ƭ G g y =   ƭ G y g ,   f o r   a l l   y ∈ G .
Proposition 12.
If  ƭ G  is an SSD-group and  A = g ∈ G ,     ƭ G g   =   ƭ G , then  A =   N ( ƭ G ) .
Proof. 
Let ƭ G be an SSD-group, g ∈ N ( ƭ G ) . Then, ƭ G g y = ƭ G y g , for all y ∈ G . Thus, ƭ G g − 1 y g = ƭ G g − 1 g y = ƭ G y , for all y ∈ G . Thus, g ∈ A , implying that N ( ƭ G )   ⊆ A . Similarly, let g ∈ A . Then, ƭ G g ( ɍ ) = ƭ G ( ɍ ) , for all ɍ ∈ G . Thus, ƭ G g − 1 ɍ g = ƭ G ɍ , for all ɍ ∈ G . Since g y ∈ G , ƭ G g − 1 ( g y ) g = ƭ G g y . Hence, ƭ G y g = ƭ G g y , for all y ∈ G . Thus, g ∈ N ( ƭ G ) , implying that A ⊆ N ( ƭ G ) . Then, A = N ( ƭ G ) . □
Proposition 13.
If  ƭ G  is an SSD-group, then  N ( ƭ G )  is a subgroup of  G .
Proof. 
Suppose that ƭ G is an SSD-group. Since ƭ G ( e − 1 ⱴ e ) = ƭ G ( ⱴ ) , for all ⱴ ∈ G , we have ƭ G e = ƭ G . Thus, e ∈ N ( ƭ G ) and N ( ƭ G ) ≠ ∅ .   N ( ƭ G ) ⊆ G is obvious. Let ɍ , ɗ   ∈ N ( ƭ G ) . Then, we have ƭ G ɍ = ƭ G , ƭ G ɗ = ƭ G . We, firstly, need to show that ɍ ɗ   ∈ N ( ƭ G ) . Then, for all ⱴ ∈ G ,
ƭ G ɍ ɗ ⱴ = ƭ G ɍ ɗ − 1 ⱴ ɍ ɗ = ƭ G ɗ − 1 ɍ − 1 ⱴ ɍ ɗ = ƭ G ɗ − 1 ( ɍ − 1 ⱴ ɍ ) ɗ = ƭ G ɗ ɍ − 1 ⱴ ɍ = ƭ G ɍ − 1 ⱴ ɍ = ƭ G ɍ ⱴ = ƭ G ⱴ .
Thus, we have ɍ ɗ   ∈ N ( ƭ G ) .
Let ɍ ∈ N ( ƭ G ) . We need to show that ɍ − 1 ∈ N ( ƭ G ) . Since ɍ ∈ N ( ƭ G ) , ƭ G ɍ y = ƭ G y ɍ , for all y ∈ G . Thus, ƭ G ɍ y − 1 = ƭ G y ɍ − 1 , for all y ∈ G . Hence, ƭ G y − 1 ɍ − 1 = ƭ G ɍ − 1 y − 1 , for all y − 1 ∈ G . Since y − 1 is arbitrary, ɍ − 1 ∈ N ( ƭ G ) . Thus, N ( ƭ G ) is a subgroup of G . □
Proposition 14.
Let   ƭ G  be an SSD-group. Then,  ƭ G  is a normal SSD-group if and only if  N ( ƭ G ) = G .
Proof. 
Let ƭ G be a normal SSD-group. N ( ƭ G ) ⊆ G is obvious. Let g ∈ G . For any v ∈ G ,
ƭ G g v = ƭ G g − 1 v g = ƭ G g − 1 g v = ƭ G ( v ) .
Thus, ƭ G g = ƭ G . Hence, g ∈ N ( ƭ G ) and G ⊆ N ( ƭ G ) , so N ( ƭ G ) = G .
Conversely, let N ( ƭ G ) = G and ⱴ , y ∈ G . We need to show that ƭ G ⱴ y = ƭ G ( y ⱴ ) , for all ⱴ , y ∈ G . We have
ƭ G ⱴ y = ƭ G ⱴ y ( ⱴ ⱴ − 1 ) = ƭ G ⱴ ( y ⱴ ) ⱴ − 1 = ƭ G ⱴ − 1 ( y ⱴ ) = ƭ G ( y ⱴ ) .
Thus, ƭ G 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   G  be any group and  ⱴ , y ∈ G . The element    ⱴ − 1 y − 1   ⱴ y ∈ G  is usually denoted  ⱴ , y  and called the commutator of  ⱴ  and  y .
It is well known that G is abelian if and only if ⱴ , y = e , for all ⱴ , y ∈ G . This motivates the following proposition:
Proposition 15.
Let   ƭ G  be an SSD-group. Then, we have the following:
i. 
If  ƭ G  is a normal SSD-group, then  ƭ G ⱴ , y = ƭ G ( e ), for all  ⱴ , y ∈ G ,
ii. 
ƭ G ⱴ , y = ƭ G ( e )  for all  ⱴ , y ∈ G  if and only is  ƭ G  is a normal SSD-group, where  ƭ G  is bijective.
Proof. 
Let ƭ G be an SSD-group and ⱴ , y ∈ G .
i.
Suppose that ƭ G is a normal SSD-group. Then, ƭ G ⱴ , y = ƭ G ( ⱴ − 1 y − 1 ⱴ y ) = ƭ G ⱴ − 1 ⱴ y − 1 y = k G ( e ), for all ⱴ , y ∈ G .
ii.
Let ⱴ , y ∈ G . Then,
ƭ G ⱴ , y = ƭ G ( ⱴ − 1 y − 1 ⱴ y ) = ƭ G ( e ) ⟺ ⱴ − 1 y − 1 ⱴ y = e ⟺ y ⱴ = ⱴ y ⟺ ƭ G ( y ⱴ ) = ƭ G ( y ⱴ ) . □

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   ƭ G  is an SSD-group, then  G ƭ G  is a subgroup of  G , where
G ƭ G = ⱴ ∈ G : ƭ G ⱴ = ƭ G e .
Proof. 
It is clear that e ∈ G ƭ G , thus, G ƭ G ≠ ∅ and G ƭ G ⊆ G . Let ⱴ , y ∈ G ƭ G . Then, ƭ G ⱴ = ƭ G y = ƭ G e . Moreover, for all ⱴ , y ∈ G , we have
ƭ G ⱴ y − 1 ⊆ ƭ G ⱴ ∆ ƭ G y − 1 = ƭ G ⱴ ∆ ƭ G y = ƭ G e ∆ ƭ G e = ∅ = ƭ G e .
Since ƭ G e ⊆ ƭ G ⱴ y − 1 , for all ⱴ , y ∈ G , it follows that ƭ G ⱴ y − 1 = ƭ G e . Thus, ⱴ y − 1 ∈ G ƭ G , for all ⱴ , y ∈ G . Thus, G ƭ G is a subgroup of G . □
Proposition 17.
If   ƭ G  is a normal SSD-group, then  G ƭ G  is a normal subgroup of  G .
Proof. 
Let ƭ G be a normal SSD-group. By Proposition 16, it is clear that G ƭ G is a subgroup of G . Let m ∈ G and ⱴ ∈ G ƭ G . Then, we have
ƭ G m ⱴ m − 1 = ƭ G m m − 1 ⱴ = ƭ G ⱴ = ƭ G e .
Hence, m ⱴ m − 1 ∈ G ƭ G , therefore G ƭ G is a normal subgroup of G . □
Proposition 18.
Let   ƭ G  be an SSD-group. Then, for all  y ∈ G ,  ƭ G ⱴ y = ƭ G y  if and only if  ⱴ ∈ G ƭ G .
Proof. 
Let ƭ G be an SSD-group and ƭ G ⱴ y = ƭ G y , for all y ∈ G . By setting y = e ,
ƭ G ⱴ y = ƭ G ⱴ e = ƭ G ⱴ = ƭ G e .
Thus, ⱴ ∈ G ƭ G . Conversely, assume that ⱴ ∈ G ƭ G . Then, ƭ G ⱴ = ƭ G e . Thus, for all y ∈ G , we have
ƭ G ⱴ y ⊆ ƭ G ⱴ ∆ ƭ G y = ƭ G e ∆ ƭ G y = ∅ ∆ ƭ G y = ƭ G y .
Therefore, for all y ∈ G , ƭ G ⱴ y ⊆ ƭ G y holds. Moreover, for all y ∈ G ,
ƭ G y = ƭ G ⱴ − 1 ⱴ y ⊆ ƭ G ⱴ − 1 ∆ ƭ G ⱴ y = ƭ G ⱴ ∆ ƭ G ⱴ y = ∅ ∆ ƭ G ⱴ y = ƭ G ⱴ y .
Thus, ƭ G y ⊆ ƭ G ⱴ y , for all y ∈ G . From these results, it follows that ƭ G ⱴ y = ƭ G y , for all y ∈ G . □
Proposition 19.
Let   ƭ G  be an SSD-group. If  ⱴ ∈ G ƭ G , then  ƭ G ⱴ y = ƭ G y ⱴ , for all  y ∈ G .
Proof. 
Let ƭ G be an SSD-group. Suppose that ⱴ ∈ G ƭ G . Then, ƭ G ⱴ = ƭ G e . By Proposition 18, ƭ G ⱴ y = ƭ G y , for all y ∈ G . Then, for all y ∈ G ,
ƭ G y ⱴ ⊆ ƭ G y ∆ ƭ G ⱴ = ƭ G y ∆ ƭ G e = ƭ G y ∆ ∅ = ƭ G y .
Thus, ƭ G y ⱴ ⊆ ƭ G y . Moreover, we have
ƭ G y = ƭ G y ⱴ ⱴ − 1 ⊆ ƭ G y ⱴ ∆ ƭ G ⱴ − 1 = ƭ G y ⱴ ∆ ƭ G ⱴ = ƭ G y ⱴ ∆ ƭ G e = ƭ G y ⱴ ∆ = ƭ G ⱴ y .
Hence, ƭ G y ⊆ ƭ G ⱴ y , for all y ∈ G . From these results, it follows that ƭ G y = ƭ G y ⱴ , for all y ∈ G . Hence, ƭ G ⱴ y = ƭ G y ⱴ , for all y ∈ G . □
Proposition 20.
Let   ƭ G  be an SSD-group and  ɍ , ɗ   ∈   G . We have the following statements:
(i) 
If  ɍ ɗ   ∈ G ƭ G ,  then  ƭ G ɍ = ƭ G ɗ ,
(ii) 
If  ɍ ɗ − 1 ∈ G ƭ G ,  then  ƭ G ɍ = ƭ G ɗ ,
(iii) 
If  ɍ − 1 ɗ   ∈ G ƭ G ,  then  ƭ G ɍ = ƭ G ɗ ,
(iv) 
If  ɍ − 1 ɗ − 1   ∈ G ƭ G ,  then  ƭ G ɍ = ƭ G ɗ .
Proof: 
Let ƭ G be an SSD-group and ɍ , ɗ ∈ G .
(i)
If ɍ ɗ   ∈ G ƭ G , then ƭ G ( ɍ ɗ ) = ƭ G ( e ) . Thus,
ƭ G ( ɍ ) = ƭ G ( ɍ ɗ ɗ − 1 ) ⊆ ƭ G ( ɍ ɗ ) ∆ ƭ G ( ɗ ) = ƭ G ( e ) ∆ ƭ G ( ɗ ) = ƭ G ( ɗ ) .
Therefore, ƭ G ɍ ⊆ ƭ G ɗ . Similarly,
ƭ G ɗ = ƭ G ɍ − 1 ɍ ɗ ⊆ ƭ G ɍ − 1 ∆ ƭ G ɍ ɗ = ƭ G ɍ ∆ ƭ G e = ƭ G ɍ .
Hence, ƭ G ɗ ⊆ ƭ G ɍ . Thus, ƭ G ( ɍ ) = ƭ G ( ɗ ) .
(ii)
If ɍ ɗ − 1 ∈ G ƭ G , then ƭ G ( ɍ ɗ − 1 ) = ƭ G ( e ) . Thus,
ƭ G ( ɍ ) = ƭ G ( ɍ ɗ − 1 ɗ ) ⊆   ƭ G ( ɍ ɗ − 1 ) ∆ ƭ G ( ɗ ) = ƭ G ( e ) ∆ ƭ G ( ɗ ) = ƭ G ( ɗ ) .
Therefore, ƭ G ɍ ⊆ ƭ G ɗ . Similarly,
ƭ G ɗ = ƭ G ɗ − 1 = ƭ G ɍ − 1 ɍ ɗ − 1 ⊆ ƭ G ɍ − 1 ∆ ƭ G ( ɍ ɗ − 1 ) = ƭ G ɍ ∆ ƭ G e = ƭ G ɍ .
Hence, ƭ G ɗ ⊆ ƭ G ɍ . Thus, ƭ G ( ɍ ) = ƭ G ( ɗ ) .
(iii)
If ɍ − 1 ɗ ∈ G ƭ G , then ƭ G ( ɍ − 1 ɗ ) = ƭ G ( e ) . Thus,
ƭ G ( ɍ ) = ƭ G ( ɍ − 1 ) = ƭ G ( ɍ − 1 ɗ ɗ − 1 ) ⊆   ƭ G ( ɍ − 1 ɗ )   ∆ ƭ G ( ɗ ) = ƭ G ( e ) ∆ ƭ G ( ɗ ) = ƭ G ( ɗ ) .
Therefore, ƭ G ɍ ⊆ ƭ G ɗ . Similarly,
ƭ G ɗ = ƭ G ɍ ɍ − 1 ɗ ⊆ ƭ G ɍ ∆ ƭ G ( ɍ − 1 ɗ ) = ƭ G ɍ ∆ ƭ G e = ƭ G ɍ .
Hence, ƭ G ɗ ⊆ ƭ G ɍ . Thus, ƭ G ( ɍ ) = ƭ G ( ɗ ) .
(iv)
If ɍ − 1 ɗ − 1 ∈ G ƭ G , then ƭ G ( ɍ − 1 ɗ − 1 ) = ƭ G ( e ) . Thus,
ƭ G ( ɍ ) = ƭ G ( ɍ − 1 ) = ƭ G ( ɍ − 1 ɗ − 1 ɗ ) ⊆   ƭ G ( ɍ − 1 ɗ − 1 ) ∆ ƭ G ( ɗ ) = ƭ G ( e ) ∆ ƭ G ( ɗ ) = ƭ G ( ɗ ) .
Therefore, ƭ G ɍ ⊆ ƭ G ɗ . Similarly,
ƭ G ɗ = ƭ G ( ɗ − 1 ) = ƭ G ɍ ɍ − 1 ɗ − 1 ⊆ ƭ G ɍ ∆ ƭ G ( ɍ − 1 ɗ − 1 ) = ƭ G ɍ ∆ ƭ G e = ƭ G ɍ .
Hence, ƭ G ɗ ⊆ ƭ G ɍ . Thus, ƭ G ( ɍ ) = ƭ G ( ɗ ) . □
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   ƭ G  be an SSD-group and  o ∈ G . The soft left coset of  ƭ G  by  o , denoted by  o ƭ G , is defined by
o ƭ G = ⱴ , ƭ G o − 1 ⱴ , ⱴ ∈ G  
and the soft right coset of  ƭ G  by  o , denoted by  ƭ G o , is defined by
ƭ G o = ⱴ , ƭ G ⱴ o − 1 , ⱴ ∈ G  
for all  ⱴ ∈ G .
Note 4.
If   G  is an abelian group, then  ɍ ƭ G = ƭ G ɍ , for all  ɍ ∈ G , since  ƭ G ( ɍ − 1 ⱴ ) = ƭ G ( ⱴ ɍ − 1 ) , for all  ⱴ ,   ɍ ∈ G .
The converse of Note 4 holds when the SSD-group is injective, as shown in Proposition 21:
Proposition 21.
If   ƭ G  is an injective SSD-group and  ɍ ƭ G = ƭ G ɍ  for all  ɍ ∈ G , then  G  is an abelian group.
Proof. 
Let ƭ G be an injective SSD-group and ɍ ƭ G = ƭ G ɍ , for all ɍ ∈ G . Then, for all ⱴ , y ∈ G , we have
ƭ G ( ⱴ y ) = ( ⱴ − 1 ƭ G ) ( y ) = ( ƭ G ⱴ − 1 ) ( y ) = ƭ G ( y ⱴ − 1 − 1 ) = ƭ G ( y ⱴ ) .
Since ƭ G is injective, ⱴ y   = y ⱴ for all ⱴ , y ∈ G . Thus, G is abelian. □
Theorem 5.
Let   ƭ G  be an SSD-group. Then,  ƭ G  is a normal SSD-group if and only if  ɍ ƭ G = ƭ G ɍ , for all    ɍ   ∈ G .
Proof. 
Let ɍ   ∈ G and ƭ G be a normal SSD-group. Then, ɍ ƭ G ⱴ = ƭ G ɍ − 1 ⱴ = ƭ G ⱴ ɍ − 1 = ƭ G ɍ ( ⱴ ) , for all ⱴ ∈ G . Thus, ɍ ƭ G = ƭ G ɍ , for all ɍ   ∈ G .
Conversely, let ɍ ƭ G = ƭ G ɍ , for all ɍ ∈ G . Then, ɍ ƭ G ⱴ = ƭ G ɍ ( ⱴ ) , for all ⱴ ∈ G . Thus, ƭ G ɍ − 1 ⱴ = ƭ G ⱴ ɍ − 1 , for all ⱴ ∈ G . Since ɍ − 1 ∈ G is arbitrary, ƭ G is a normal SSD-group. □
Example 9.
Consider the group   G = e , o , Ҍ , ƶ  and the SSD-group  ƭ G = e , ∅ , o , e , ϰ , Ҍ , e , ϰ , y , ƶ , y over  U   = D 2  in Example 1. Then, the soft left cosets of  ƭ G  are as follows:
e ƭ G = e , ∅ , o , e , ϰ , Ҍ , e , ϰ , y , ƶ , y ,
o ƭ G = e , e , ϰ , o , ∅ , Ҍ , y , ƶ , e , ϰ , y ,
Ҍ ƭ G = e , e , ϰ , y , o , y , Ҍ , ∅ , ƶ , e , ϰ ,
ƶ ƭ G = e , y , o , e , ϰ , y , Ҍ , e , ϰ , ƶ , ∅ .
Since  G  is an abelian group, the soft right cosets of  ƭ G  are as follows:
ƭ G e = e , ∅ , o , e , ϰ , Ҍ , e , ϰ , y , ƶ , y ,
ƭ G o = e , e , ϰ , o , ∅ , Ҍ , y , ƶ , e , ϰ , y ,
ƭ G Ҍ = e , e , ϰ , y , o , y , Ҍ , ∅ , ƶ , e , ϰ ,
ƭ G ƶ = e , y , o , e , ϰ , y , Ҍ , e , ϰ , ƶ , ∅ .
Note 5.
If  G  is an abelian group, then  ƭ G  is a normal SSD-group. Thus,  ɍ ƭ G = ƭ G ɍ , for all  ɍ ∈ G . However,  ƭ G  may be also a normal SSD-group, that is, it is possible that  ɍ ƭ G = ƭ G ɍ  for all  ɍ ∈ G , even when  G  is not abelian. Now, we give the following example:
Example 10.
Consider the group  G = { e , ϰ , ϰ 2 , y , y ϰ , y ϰ 2 }    and the SSD-group
ƭ G = e , ∅ , ϰ , ∅ , ϰ 2 , ∅ , y , 1,4 , y ϰ , 1,4 , y ϰ 2 , 1,4
over  U = 1,2 , 3,4  in Example 7. Then, the soft left cosets of  ƭ G  are as follows:
e ƭ G = ϰ ƭ G = ϰ 2 ƭ G = e , ∅ , ϰ , ∅ , ϰ 2 , ∅ , y , 1,4 , y ϰ , 1,4 , y ϰ 2 , 1,4 = ƭ G ,
y ƭ G = y ϰ ƭ G = y ϰ 2 ƭ G = { e , 1,4 , ϰ , { 1,4 } , ϰ 2 , { 1,4 } , y , ∅ , y ϰ , ∅ , y ϰ 2 , ∅ } .
The soft right cosets of  ƭ G  are as follows:
ƭ G e = ƭ G ϰ = ƭ G ϰ 2 = e , ∅ , ϰ , ∅ , ϰ 2 , ∅ , y , 1,4 , y ϰ , 1,4 , y ϰ 2 , 1,4 = ƭ G ,
ƭ G y = ƭ G y ϰ = ƭ G y ϰ 2 = { e , 1,4 , ϰ , { 1,4 } , ϰ 2 , { 1,4 } , y , ∅ , y ϰ , ∅ , y ϰ 2 , ∅ } .
Hence,  e ƭ G = ƭ G e ,  ϰ ƭ G = ƭ G ϰ ,   ϰ 2 ƭ G = ƭ G ϰ 2 ,  y ƭ G = ƭ G y ,  y x ƭ G   = ƭ G y ϰ ,  y ϰ 2 ƭ G = ƭ G y ϰ 2 .
We see that, although D 3 = G is not abelian, ɍ ƭ G = ƭ G ɍ , for all ɍ ∈ G ; that is, ƭ G is a normal SSD-group by Theorem 5.
Proposition 22.
If   ƭ G  is an SSD-group, then  e ƭ G   =  ƭ G e = ƭ G .
Proof. 
Let  ƭ G  be an SSD-group. Then, for all  ⱴ ∈ G , we have
( e ƭ G ) ( ⱴ ) = ƭ G ( e − 1 ⱴ ) = ƭ G ( ⱴ ) = ƭ G ( ⱴ e − 1 ) = ( ƭ G e ) ( ⱴ ) .
Thus,  ƭ G  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
y ƭ G = { e , 1,4 , ϰ , { 1,4 } , ϰ 2 , { 1,4 } , y , ∅ , y ϰ , ∅ , y ϰ 2 , ∅ }
given in Example 10. Since
y ƭ G ϰ ϰ 2 = y ƭ G e = 1,4 ⊈ y ƭ G ϰ ∆ y ƭ G ϰ 2 = ∅ ,
y ƭ G is not an SSD-group.
Theorem 6.
Let   ƭ G  be an SSD-group and  o ∈ G . Then,  o ∈ G ƭ G  if and only if  o ƭ G = ƭ G = ƭ G o , where  G ƭ G   = { ⱴ ∈ G   |   ƭ G ( ⱴ ) =  ƭ G ( e ) } .
Proof. 
Let ƭ G be an SSD-group and o ∈ G ƭ G . Then, ƭ G o = ƭ G e = ∅ . Thus, we have
o ƭ G ⱴ = ƭ G o − 1 ⱴ ⊆ ƭ G o − 1 ∆ ƭ G ⱴ = ƭ G o ∆ ƭ G ⱴ = ƭ G e ∆ ƭ G ⱴ = ƭ G ⱴ .
Thus, o ƭ G ⱴ ⊆ ƭ G ⱴ . Besides, for all ⱴ ∈ G ,
ƭ G ⱴ = ƭ G o o − 1 ⱴ ⊆ ƭ G o ∆ ƭ G o − 1 ⱴ = ƭ G e ∆ ƭ G o − 1 ⱴ = ƭ G o − 1 ⱴ = o ƭ G ⱴ .
Hence, ƭ G ⱴ ⊆ o ƭ G ⱴ . Then, o ƭ G ⱴ = ƭ G ⱴ for all ⱴ ∈ G . Similarly, for all ⱴ ∈ G , we have
ƭ G o ⱴ = ƭ G ⱴ o − 1 ⊆ ƭ G ⱴ ∆ ƭ G o − 1 = ƭ G ⱴ ∆ ƭ G o = ƭ G ⱴ ∆ ƭ G e = ƭ G ⱴ .
Thus, ƭ G o ⱴ ⊆ ƭ G ⱴ . Besides, for all ⱴ ∈ G ,
ƭ G ⱴ = ƭ G ⱴ o − 1 o ⊆ ƭ G ⱴ o − 1 ∆ ƭ G o = ƭ G ⱴ o − 1 ∆ ƭ G e = ƭ G ⱴ o − 1 = ƭ G o ⱴ .
Thereby, ƭ G ⱴ ⊆ ƭ G o ⱴ . Then, ƭ G o ⱴ = ƭ G ⱴ , for all ⱴ ∈ G . In conclusion, o ƭ G = ƭ G = ƭ G o , for all ɍ ∈ G .
Conversely, let us assume that o ƭ G = ƭ G = ƭ G o . Then, for all ⱴ ∈ G , we have
o ƭ G ⱴ = ƭ G ⱴ = ƭ G o ⱴ .
Moreover, if we choose ⱴ = o , then
o ƭ G o = ƭ G o = ƭ G o o ⇒ ƭ G o − 1 o = ƭ G o = ƭ G o o − 1 ⇒ ƭ G e = ƭ G o ⇒ o ∈ G ƭ G .
This completes the proof. □
Note 7.
Theorem 6 plays a central role because it determines which of these cosets coincide even when   G  is non-abelian and  ƭ G  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  G ƭ G  exceeds 1.
Proposition 23.
Let   ƭ G  be an SSD-group and  ɍ , ɗ   ∈   G . Then,
ɍ β ɗ ⇔ ƭ G ( ɍ ɗ − 1 ) = ƭ G ( e )
is an equivalence relation on  G .
Proof. 
Let ƭ G be an SSD-group and ɍ , ɗ , c ∈ G . Since for all ɍ ∈ G ; ƭ G ( ɍ ɍ − 1 ) = ƭ G ( e ) , β is reflexive.
Suppose that ɍ β ɗ . Then,   ƭ G ɍ ɗ − 1 = ƭ G e . Thus, ƭ G ɗ ɍ − 1 = ƭ G e , implying that ɗ β ɍ . Thus, β is symmetric.
Let ɍ β ɗ and ɗ β c . Then, ɍ ɗ − 1 = ƭ G e   and ƭ G ɗ c − 1 = ƭ G e . Hence,
ƭ G ɍ c − 1 = ƭ G ɍ ɗ − 1 ɗ c − 1 ⊇ ƭ G ɍ ɗ − 1 ∩ ƭ G ɗ c − 1 = ƭ G e ∩   ƭ G e = ƭ G e .
This implies that   ɍ β c . Thus, β is transitive.
Since β is an equivalence relation on G , we can mention the equivalence classes for all ɍ ∈ G :
ɍ - = ɗ   ƭ G ɍ ɗ − 1 = ƭ G e = ɗ   ɍ ɗ − 1 ∈ G ƭ G = ɗ   ɗ ɍ − 1 ∈ G ƭ G = ɗ   ɗ ∈ G ƭ G ɍ = G ƭ G ɍ .
That is ɍ - = G ƭ G ɍ . Note here that if the relation is defined as follows, ɍ β ɗ ⇔ ƭ G ( ɍ − 1 ɗ ) = ƭ G ( e ) , then ɍ - = ɍ G ƭ G . □
Theorem 7.
Let   ƭ G  be an SSD-group. Then,
ɍ ƭ G = ɗ ƭ G ⇔ ɍ G ƭ G = ɗ G ƭ G ⇔ ɍ − 1 ɗ   ∈ G ƭ G
for all  ɍ , ɗ   ∈    G.
Proof. 
Let  ƭ G  be an SSD-group. Suppose that  ɍ ƭ G  =  ɗ ƭ G , for all  ɍ , ɗ ∈ G . Thus,  ɍ ƭ G ( ⱴ )  =  ɗ ƭ G ( ⱴ ) , for all  ⱴ ∈ G , which means that  ƭ G ɍ − 1 ⱴ = ƭ G   ɗ − 1 ⱴ , for all  ⱴ ∈ G . Choosing  ⱴ = ɗ  yields  ƭ G ɍ − 1 ɗ = ƭ G   ɗ − 1 ɗ = ƭ G e . Thus,  ɍ − 1 ɗ ∈ G ƭ G , so  ɍ G ƭ G  =  ɗ G ƭ G .
Conversely, suppose that  ɍ − 1 ɗ ∈ G ƭ G .  Since  G ƭ G  is a subgroup of  G , then  ɗ − 1   ɍ ∈ G ƭ G . It follows that
ɍ ƭ G ⱴ = ƭ G ɍ − 1 ⱴ = ƭ G ɍ − 1 ɗ   ɗ − 1 ⱴ ⊆ ƭ G ɍ − 1 ɗ ) ∆   ƭ G ( ɗ − 1 ⱴ = ƭ G e ) ∆   ƭ G ( ɗ − 1 ⱴ =   ƭ G ( ɗ − 1 ⱴ ) = ɗ ƭ G ⱴ .
Thus,  ɍ ƭ G ⱴ ⊆ ɗ ƭ G ⱴ , for all  ⱴ ∈ G . Similarly,
ɗ ƭ G ⱴ = ƭ G ɗ − 1 ⱴ = ƭ G ɗ − 1 ɍ   ɍ − 1 ⱴ ⊆ ƭ G ɗ − 1 ɍ ) ∆   ƭ G ( ɍ − 1 ⱴ = ƭ G e ) ∆   ƭ G ( ɍ − 1 ⱴ =   ƭ G ( ɍ − 1 ⱴ ) = ɍ ƭ G ⱴ .
Hence, ɗ ƭ G ⱴ ⊆ ɍ ƭ G ⱴ  for all  ⱴ ∈ G , implying that  ɍ ƭ G = ɗ ƭ G . □
Theorem 8.
Let   ƭ G  be an SSD-group. Then,
ƭ G ɍ = ƭ G ɗ ⇔ G ƭ G ɍ = G ƭ G ɗ ⇔ ɍ ɗ − 1 ∈ G ƭ G
for all  ɍ , ɗ ∈ G .
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   G = { e , ϰ , ϰ 2 , y , y ϰ , y ϰ 2 }    and the SSD-group
ƭ G = e , ∅ , ϰ , ∅ , ϰ 2 , ∅ , y , 1,4 , y ϰ , 1,4 , y ϰ 2 , 1,4
over  U = 1,2 , 3,4  in Example 7, where  G ƭ G = e , ϰ , ϰ 2 .
Then,  e G ƭ G = e e , ϰ , ϰ 2 = { e , ϰ , ϰ 2 } ,  ϰ G ƭ G = ϰ e , ϰ , ϰ 2 = { ϰ , ϰ 2 , e } ,  ϰ 2 G ƭ G = ϰ 2 e , ϰ , ϰ 2 = { ϰ 2 ,   e , ϰ } .
Similarly,  y G ƭ G = y e , ϰ , ϰ 2 = { y , y ϰ , y ϰ 2 } ,  y ϰ G ƭ G = y ϰ e , ϰ , ϰ 2 = { y ϰ , y ϰ 2 , e } ,  y ϰ 2 G ƭ G = y ϰ 2 e , ϰ , ϰ 2 = { y ϰ 2 , e , y ϰ } .
It is seen that  e G ƭ G = ϰ G ƭ G = ϰ 2 G ƭ G  and  y G ƭ G = y ϰ G ƭ G = y ϰ 2 G ƭ G . In Example 10, it is also shown that  e ƭ G = ϰ ƭ G = ϰ 2 ƭ G  and  y ƭ G = y ϰ ƭ G = y ϰ 2 ƭ G .
Proposition 24.
Let   ƭ G  be an SSD-group and  ɍ , ɗ   ∈ G . If  ɍ ƭ G =   ɗ ƭ G ,  then  ƭ G ( ɍ ) = ƭ G ( ɗ ) .
Proof. 
Let ƭ G be an SSD-group, ɍ , ɗ ∈ G and ɍ ƭ G = ɗ ƭ G . Then, □
ɍ ƭ G = ɗ ƭ G ⇒   ɍ G ƭ G = ɗ G ƭ G ⇒ ɍ − 1 ɗ ∈ G ƭ G ⇒ ƭ G ( ɍ ) = ƭ G ( ɗ ) .
Proposition 25.
Let  ƭ G  be an SSD-group and  ɍ , ɗ   ∈ G . If  ƭ G ɍ = ƭ G ɗ ,  then  ƭ G ( ɍ ) = ƭ G ( ɗ ) .
Proof. 
The proof is similar to the proof of Proposition 24. □
Proposition 26.
Let  ƭ G  be an SSD-group and  ɍ , ɗ   ∈ G . Then,  ɍ ƭ G =   ɗ ƭ G    if and only if  ƭ G ( ɍ − 1 ɗ ) = ƭ G ( ɗ − 1 ɍ )   = ƭ G ( e ) .
Proof. 
Let ƭ G be an SSD-group, ɍ , ɗ ∈ G and   ɍ ƭ G = ɗ ƭ G . Then,
  ɍ ƭ G = ɗ ƭ G ⇒   ɍ G ƭ G = ɗ G ƭ G ⇒ ɍ − 1 ɗ ∈ G ƭ G ,   ɗ − 1 ɍ ∈ G ƭ G ⇒ ƭ G ɍ − 1 ɗ = ƭ G ɗ − 1 ɍ = ƭ G e .
Conversely, let ƭ G ɍ − 1 ɗ = ƭ G ɗ − 1 ɍ = ƭ G e . Then, for all ⱴ ∈ G , we have
  ɍ ƭ G ⱴ = ƭ G ɍ − 1 ⱴ = ƭ G ɍ − 1 ɗ ɗ − 1 ⱴ ⊆ ƭ G ɍ − 1 ɗ ∆ ƭ G ɗ − 1 ⱴ = ƭ G ɗ − 1 ⱴ = ɗ ƭ G ⱴ   = ƭ G ɗ − 1 ⱴ = ƭ G ɗ − 1 ɍ ɍ − 1 ⱴ ⊆ ƭ G ɗ − 1 ɍ ∆   ƭ G ɍ − 1 ⱴ = ƭ G ɍ − 1 ⱴ = ɍ ƭ G ⱴ .
Thus, ɍ ƭ G = ɗ ƭ G . □
Proposition 27.
Let   ƭ   G  be an SSD-group and  ɍ ∈ G . Then,  ɍ ƭ G = ɍ − 1 ƭ G  if and only if  ɍ 2 ∈ G ƭ G .
Proof. 
Let ƭ G be an SSD-group and ɍ ∈ G . Then, □
ɍ ƭ G = ɍ − 1 ƭ G ⇔ ɍ G ƭ G = ɍ − 1 G ƭ G ⇔ ɍ − 1 ɍ − 1 ∈ G ƭ G ⇔ ( ɍ − 1 ) 2 ∈ G ƭ G ⇔   ( ɍ 2 ) − 1 ∈ G ƭ G ⇔ ɍ 2 ∈ G ƭ G .
Example 13.
In Example 7 and Example 10,  ϰ − 1 = ϰ 2 ,  ϰ ƭ G = ϰ 2 ƭ G  and  ϰ 2 ∈ G ƭ G .
Proposition 28.
Let  ƭ   G  be an SSD-group and  ɍ ∈ G . If  ɍ 2 ∈ G   ƭ G , for all  ɍ ∈ G , then  ƭ G  is a normal SSD-group.
Proof. 
Let ƭ G be an SSD-group and for all ɍ ∈ G , ɍ 2 ∈ G ƭ G . Thus, ƭ G ( e ) = ƭ G ( ɍ 2 ) . Let ɍ , ɗ ∈ G . Then, ɍ ɗ ∈ G . Thus,
ƭ G ( e ) = ƭ G ( ( ɍ ɗ ) 2 ) = ƭ G ( ɍ ɗ ɍ ɗ ) = ƭ G ( ɍ ɗ ( ɍ − 1 ɍ 2 ) ɗ ) = ƭ G ( ( ɍ ɗ ɍ − 1 ) ( ɍ 2 ɗ ) ) .
We obtain that ƭ G ( ( ɍ ɗ ɍ − 1 ) ( ɍ 2 ɗ ) ) = ƭ G ( e ) . By Proposition 20 (i), ƭ G ( ɍ ɗ ɍ − 1 ) =   ƭ G ( ɍ 2 ɗ ) . Therefore, we have
ƭ G ɍ ɗ ɍ − 1 = ƭ G ɍ 2 ɗ ⊆ ƭ G ɍ 2   ∆ ƭ G ɗ = ƭ G e ∆ ƭ G ɗ = ƭ G ɗ .
for all ɍ , ɗ ∈ G . By Theorem 4, ƭ G is a normal SSD-group. □
Theorem 9.
Let   ƭ   G  be an SSD-group and  ɍ ∈ G . If  ɍ ƭ G = ɍ − 1 ƭ G , for all  ɍ ∈ G ,    then  ƭ G  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 ƭ G an SSD-group and A = { ƭ G ɍ : ɍ ∈ G } and B = { ɍ ƭ G : ɍ ∈ G } be the set of soft right and soft left cosets of ƭ G , respectively. Define a map from A to B as follows:
φ :   A ⟶ B
ƭ G ɍ ⟶ φ ( ƭ G ɍ ) = ɍ − 1 ƭ G
First, let us show φ is a well-defined function. Let ɍ , ɗ ∈ G and ƭ G ɍ = ƭ G ɗ . We need to show that ɍ − 1 ƭ G = ɗ − 1 ƭ G .
ƭ G ɍ = ƭ G ɗ ⇒ G ƭ G ɍ = G ƭ G ɗ ⇒ ɍ ɗ − 1 ∈ G ƭ G ⇒ ( ɍ − 1 ) − 1 ɗ − 1 ∈ G ƭ G ⇒ ɍ − 1 G ƭ G = ɗ − 1 G ƭ G ⇒ ɍ − 1 ƭ G = ɗ − 1 ƭ G .
Hence, φ is a well-defined function. Now, we show that φ is an injective function. Let ɍ , ɗ ∈ G and φ ( ƭ G ɍ ) = φ ( ƭ G ɗ ) . We need to show that ƭ G ɍ = ƭ G ɗ .
φ ( ƭ G ɍ ) = φ ( ƭ G ɗ )   ⇒ ɍ − 1 ƭ G = ɍ − 1 ƭ G ⇒ ɍ − 1 G ƭ G = ɗ − 1 G ƭ G ⇒ ɍ ɗ − 1 ∈ G ƭ G ⇒ G ƭ G ɍ = G ƭ G ɗ ⇒ ƭ G ɍ = ƭ G ɗ .
Hence, φ is an injective function. Since, for all ɍ ƭ G ∈ B , there exists ƭ G ɍ − 1 ∈ A such that φ ( ƭ G ɍ − 1 ) = ɍ ƭ G , φ 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   ƭ G  is equal to the number of different soft left cosets, and is known as the soft index of  ƭ G  in  G , denoted by  [ G :  ƭ G ] .
Example 14.
In Example 1, different soft left cosets of   ƭ G  are    e ƭ G , o ƭ G , Ҍ ƭ G  and  ƶ ƭ G , and so  [ G :  ƭ G ] = 4 . In Example 10, different soft left cosets of  ƭ G  are  e ƭ G   a n d   y ƭ G , and so  [ G :  ƭ G ] = 2 .
Corollary 1.
By the proof of Theorem 10, we can conclude that   ƭ G ɍ = ƭ G ɗ ⇔ ɍ − 1 ƭ G = ɗ − 1 ƭ G ( ɍ ƭ   G = ɗ ƭ G ⇔ ƭ G ɍ − 1 = ƭ G ɗ − 1 ) for all  ɍ ,  ɗ   ∈ G , where  ƭ G  is an SSD-group. In fact, in Example 10,  ƭ G ϰ = ƭ G ϰ 2 ,  ϰ − 1 = ϰ 2  and  ϰ 2 ƭ G = ϰ ƭ G .
Theorem 11.
Let   ɍ ,  ɗ ∈ G  and  ƭ G  be a normal SSD-group. Then,  ƭ G ɍ = ƭ G ɗ  if and only if  ƭ G ɍ − 1 = ƭ G ɗ − 1 , for all  ɍ ,  ɗ ∈   G .
Proof. 
Let ɍ , ɗ ∈ G and ƭ G ɍ = ƭ G ɗ . We need to show that ƭ G ɍ − 1 = ƭ G ɗ − 1 . Since ƭ G is a normal SSD-group, then
ƭ G ɍ = ƭ G ɗ ⇒ G ƭ G ɍ = G ƭ G ɗ ⇒ ɍ ɗ − 1 ∈ G ƭ G ⇒ ɗ ɍ − 1 ∈ G ƭ G ⇒ ɍ − 1 ɗ ∈ G ƭ G ⇒ G ƭ G ɍ − 1 = G ƭ G ɗ − 1 ⇒ ƭ G ɍ − 1 = ƭ G ɗ − 1 .
Here note that since ƭ G is a normal SSD-group, then ɗ ɍ − 1 ∈ G ƭ G ⇒ ƭ G ( ɗ ɍ − 1 ) = ƭ G ( ɍ − 1 ɗ ) = ƭ G ( e ) , thus ɍ − 1 ɗ   ∈ G ƭ G .
Now, let ƭ G ɍ − 1 = ƭ G ɗ − 1 for all ɍ , ɗ ∈ G . We need to show that ƭ G ɍ = ƭ G ɗ .
ƭ G ɍ − 1 = ƭ G ɗ − 1 ⇒ G ƭ G ɍ − 1 = G ƭ G ɗ − 1 ⇒ ɍ − 1 ɗ ∈ G ƭ G ⇒ ɗ ɍ − 1 ∈ G ƭ G ⇒ ɍ ɗ − 1 ∈ G ƭ G ⇒ G ƭ G ɍ = G ƭ G ɗ ⇒ ƭ G ɍ = ƭ G ɗ .
Here again note that since ƭ G is a normal SSD-group, then ɍ − 1 ɗ ∈ G ƭ G ⇒ ƭ G ( ɍ − 1 ɗ ) = ƭ G ( ɗ ɍ − 1 ) = ƭ G ( e ) , thus ɗ ɍ − 1 ∈ G ƭ G . In fact, in Example 10, ƭ G ϰ = ƭ G ϰ 2 , ϰ − 1 = ϰ 2 and ƭ G ϰ = ƭ G ϰ 2 . □
Theorem 12.
Let   ɍ ,  ɗ ∈ G  and  ƭ G  be a normal SSD-group. Then,  ɍ ƭ   G =   ɗ ƭ G  if and only if  ɍ − 1 ƭ G = ɗ − 1 ƭ G  for all  ɍ ,  ɗ   ∈ G .
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   ƭ G  be a normal SSD-group. Consider the set  G ƭ G , where  G ƭ G =   ⱴ ƭ G :   ⱴ ∈ G    is the set of all the soft left (right) cosets of  ƭ G . Define an operation of composition on  G ƭ G  as follows:
⊙ : G ƭ G   x G ƭ G ⟶ G ƭ G
( ⱴ ƭ G , y ƭ G ) = ⱴ ƭ G ⊙ y ƭ G = ⱴ y ƭ G
for all  ⱴ , y ∈ G . Then,  G ƭ G , ⊙  is called the soft quotient (or factor) group of  G  relative to the normal SSD-group  ƭ G .
Theorem 13.
If   ƭ G  is a normal SSD-group, then  G ƭ G = ⱴ ƭ G :   ⱴ ∈ G  forms a group under the composition  ⊙  on  G ƭ G , where  ⱴ ƭ G ⊙ y ƭ G = ⱴ y ƭ G , for all  ⱴ , y ∈ G .
Proof. 
Let ƭ G be a normal SSD-group and consider the set G ƭ G = ⱴ ƭ G : ⱴ ∈ G . Define the composition on G ƭ G as ⱴ ƭ G ⊙ y ƭ G = ⱴ y ƭ G . To show that the above composition is well-defined, let ɍ 1 , ɍ 2 , ɗ 1 , ɗ 2 ∈ G and ( ɍ 1 ƭ G , ɗ 1 ƭ G ) = ( ɍ 2 ƭ G , ɗ 2 ƭ G ) . We need to show that
ɍ 1 ƭ G ⊙ ɗ 1 ƭ G = ɍ 2 ƭ G ⊙ ɗ 2 ƭ G .
Since ( ɍ 1 ƭ G , ɗ 1 ƭ G ) = ( ɍ 2 ƭ G , ɗ 2 ƭ G ) , we have ɍ 1 ƭ G = ɍ 2 ƭ G and ɗ 1 ƭ G = ɗ 2 ƭ G . Let ⱴ ∈ G . Then, we have
( ɍ 1 ɗ 1 ) ƭ G ( ⱴ ) = ƭ G ( ( ɍ 1 ɗ 1 ) − 1 ⱴ ) = ƭ G ( ( ɗ 1 − 1 ɍ 1 − 1 ) ⱴ ) = ( ɗ 1 ƭ G ) ( ɍ 1 − 1 ⱴ ) = ( ɗ 2 ƭ G ) ( ɍ 1 − 1 ⱴ ) = ( ƭ G ɗ 2 ) ( ɍ 1 − 1 ⱴ ) = ( ƭ G ) ( ɍ 1 − 1 ⱴ ɗ 2 − 1 ) = ( ɍ 1 ƭ G ) ( ⱴ ɗ 2 − 1 ) = ( ɍ 2 ƭ G ) ( ⱴ ɗ 2 − 1 ) = ( ƭ G ɍ 2 ) ( ⱴ ɗ 2 − 1 ) = ƭ G ( ⱴ ɗ 2 − 1 ɍ 2 − 1 ) = ƭ G ( ⱴ ( ɍ 2 ɗ 2 ) − 1 ) = ( ɍ 2 ɗ 2 ) ƭ G ( ⱴ ) .
Thus, ɍ 1 ɗ 1 ƭ G = ɍ 2 ɗ 2 ƭ G and so ɍ 1 ƭ G ⊙ ɗ 1 ƭ G = ɍ 2 ƭ G ⊙ ɗ 2 ƭ G . So, we are done.
We can easily show that G ƭ G , ⊙   is a group with the identity e ƭ G . It is obvious that the order of G ƭ G is the soft index of ƭ G in G . □
Example 15.
Consider the normal SSD-group   ƭ G  in Example 1. By Example 9,  G ƭ G = { e ƭ G , o ƭ G , Ҍ ƭ G , ƶ ƭ G }  and the Cayley table of the soft quotient group  G ƭ G  is as Table 4:
Table 4. Cayley table of the soft quotient group in Example 15.
One can easily show that  G ƭ G , ⊙  is a group, even isomorphic to  D 2 .
Theorem 14.
If   ƭ G  is a normal SSD-group, then  G ƭ G ≅ G G ƭ G .
Proof. 
Since ƭ G is a normal SSD-group, by Proposition 17, G ƭ G is a normal subgroup of G. Hence, G G ƭ G is a quotient group. Let the operation defined on G ƭ G   be “ ⊙ ”   and G G ƭ G be “ ⊡ ”. By Theorem 13, G ƭ G , ⊙   is a group. Now, define a map by
Φ :   G ƭ G , ⊙   ⟶   G G ƭ G , ⊡
ⱴ ƭ G ⟶ ⱴ G ƭ G
Firstly, Φ is a homomorphism, since
Φ ( ( ⱴ ƭ G ) ⊙ ( y ƭ G ) ) = Φ ( ⱴ y ƭ G ) = ⱴ y G ƭ G = ( ⱴ G ƭ G ) ⊡ ( y G ƭ G ) = Φ ( ⱴ ƭ G ) ⊡ Φ ( y ƭ G ) .
for all ⱴ ƭ G , y ƭ G ∈   G ƭ G . On the other hand, if ⱴ G ƭ G = y G ƭ G , then ⱴ ƭ G = y ƭ G . Thus, ψ is injective. Moreover, for all ⱴ G ƭ G ∈ G G ƭ G , there exists at least one ⱴ ƭ G ∈ G ƭ G such that Φ ( ⱴ ƭ G ) = ⱴ G ƭ G . Hence, Φ is bijective and so, G ƭ G ≅ G G ƭ G . □
Example 16.
In Example 9, G ƭ G = { e }. Thus,  G G ƭ G =   { e G ƭ G ,   ɍ G ƭ G , ɗ G ƭ G , ƶ G ƭ G }    and  G ƭ G = { e ƭ G ,   ɍ ƭ G , ɗ ƭ G , ƶ ƭ G } .
Note 9.
By Theorems 8 and 14,   [ G :    G ƭ G ] = [ G :  ƭ G ] .
This equality indicates that once the set G ƭ G is known, we can determine the number of distinct soft left or right cosets of G ƭ G in G ; that is, we can compute the index of G ƭ G in G , and consequently the soft index of ƭ G in G .
Example 17.
In Example 9, [   G  :  G ƭ G ] = 4  and in Example 10, [ G :  G ƭ G ] = 2 . Thus, in Example 9, [ G :  ƭ G ] = 4  and in Example 10, [ G :  ƭ G ] = 2 .
Proposition 29.
Let   ƭ G  be an SSD-group and  G ƭ G = e . Then,  ɍ ƭ G = ɗ ƭ G  if and only if  ɍ = ɗ , where  ɍ , ɗ ∈ G .
Proof. 
Let G ƭ G = e and ɍ ƭ G = ɗ ƭ G , where ɍ , ɗ ∈ G . Then, G G ƭ G   ≅   G , and so G ƭ G ≅   G . Since [ G : G ƭ G ] = [ G : ƭ G ], the number of different soft left (right) cosets is the order of G . Thus, ɍ = ɗ . The converse is obvious. □
Example 18.
In Example 9,   G ƭ G = e  and there do not exist any soft left (right) coset such that  ɍ ≠   ɗ  and  ɍ ƭ G =   ɗ ƭ G , where  ɍ , ɗ   ∈ G .
In fact in Example 9, G ƭ G = e and G ƭ G = { e ƭ G ,   ɍ ƭ G , ɗ ƭ G , c ƭ G } . That is, there are four different soft (left) right cosets, which equals the order of G .
Theorem 15.
Let   ƭ G  be an SSD-group. Then,  ƭ G  is a normal SSD-group if and only if  G ƭ G  is abelian.
Proof. 
Let ƭ G be a normal SSD-group and the operation defined on G ƭ G be ⊙ . Since ƭ G is a normal SSD-group, we can construct the quotient group G ƭ G . Let ( ⱴ y ⱴ − 1 y − 1 ) = ƭ G ( e ) for all ⱴ , y ∈ G . Thus, we have
ƭ G ( ( ⱴ y ) ( y ⱴ ) − 1 ) = ƭ G ( e ) ⇒ ƭ G ( ( y ⱴ ) − 1 ( ⱴ y ) ) = ƭ G ( e ) ⇒ ( y ⱴ ) − 1 ( ⱴ y ) ∈ G ƭ G ⇒   y ⱴ G ƭ G = ⱴ y G ƭ G ⇒   y ⱴ ƭ G = ⱴ y ƭ G ⇒ y ƭ G ⊙ ⱴ ƭ G = ⱴ ƭ G ⊙ y ƭ G .
Thus, G ƭ G is abelian.
Conversely, let G ƭ G be an abelian group. Then, we have
ⱴ ƭ G ⊙ y ƭ G = y ƭ G ⊙ ⱴ ƭ G ⇒ ⱴ y ƭ G = y ⱴ ƭ G   ⇒ ⱴ y G ƭ G = y ⱴ G ƭ G ⇒ ⱴ y − 1 y ⱴ ∈ G ƭ G ⇒ ƭ G ( ( ⱴ y ) − 1 ( y ⱴ ) ) = ƭ G ( e ) ⇒ ƭ G ( ⱴ y ) = ƭ G ( y ⱴ )
for all ⱴ , y ∈ G . Thus,   ƭ G is a normal SSD-group. □
Corollary 2.
If [ G  :  ƭ G ] = 2 ,  p  or  p 2 , where  p  is a prime number, then  ƭ G  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 p -SSD-group as follows:
Definition 25.
Let   ƭ G  be an SSD-group. If there exists a positive integer  n  such that  ƭ G ɍ n = ƭ G e , then  ɍ  is said to have finite order and the smallest such positive integer  n  such that  ƭ G ɍ n = ƭ G e  is called the order of  ɍ  with respect to  ƭ G , and is denoted by  S O ƭ G ( ɍ ) . If there does not exist such a positive integer, then  ɍ  is said to have infinite order.
Definition 26.
If   S O ƭ G ( ɍ )  is a power of a prime number  p  for all  ɍ ∈ G ,  ƭ G  is called  p -SSD-group.
Example 19.
In Example 1,   S O ƭ G ( e )  =1,  S O ƭ G ( o ) =  S O ƭ G Ҍ =   S O ƭ G ƶ = 2 . Thus,  ƭ G  is a  2 -SSD-group.
Definition 27.
Let   G ƭ G  be a quotient group and  ɍ ƭ G ∈ G ƭ G . If there exists a positive integer  n  such that  ( ɍ ƭ G ) n = ƭ G    then  ɍ ƭ G  is said to have finite order and the smallest such positive integer  n  such that  ( ɍ ƭ G ) n = ƭ G  is called the order of    ɍ ƭ G  is denoted by  S O ( ɍ ƭ G ) .
Definition 28.
Let   G ƭ G  be a quotient group. If there exist nonnegative integers  k  and a prime  p  such that  ( ɍ ƭ G ) p k = e ƭ G , for any  ɍ ∈ G , then  G ƭ G  is called a  p -group.
Theorem 16.
Let   ƭ G  be a normal SSD-group. Then,  ƭ G  is a  p -SSD-group if and only if      G   ƭ G  is a  p -group.
Proof. 
Let ƭ G   be a normal p -SSD-group. Then, for any ɍ ∈ G , there exist nonnegative integers k and a prime p such that ƭ G ɍ p k = ƭ G e . Then, we have
ƭ G ɍ p k = ƭ G e ⟹ ɍ p k ∈ G ƭ G ⟹ ɍ p k ƭ G = e ƭ G = ƭ G ⟹ ( ɍ ƭ G ) p k = e ƭ G .
Thus, G ƭ G is a p -group. Conversely, let G ƭ G be a p -group. Then, for any ɍ ∈ G , there exist nonnegative integers k and prime p such that ( ɍ ƭ G ) p k = e ƭ G . Thus,
( ɍ ƭ G ) p k = e ƭ G ⟹ ɍ p k ƭ G = e ƭ G = ƭ G   ⟹ ɍ p k ∈ G ƭ G ⟹ ƭ G ( ɍ p k ) = ƭ G ( e ) .
Hence, ƭ G is a p -SSD-group. □
Proposition 30.
Let   ƭ   G  be an SSD-group and    ɍ ∈ G . If  ɍ 2 ∈ G   ƭ G ,  for all  ɍ ∈ G ,  then  G ƭ G  is an abelian  2 -group.
Proof. 
Let ƭ G be an SSD-group, ɍ 2 ∈ G   ƭ G ,   for all ɍ ∈ G , and the operation defined on G ƭ G be ⊙ . By Proposition 28, ƭ G is a normal SSD-group. Then, by Theorem 15, G ƭ G   is an abelian group. Thus, we need to demonstrate that G ƭ G is a 2 -group. Let ɍ 2 ∈ G ƭ G for all ɍ ∈ G . Then, ƭ G ( ɍ 2 ) = ƭ G ( e ) , for all ɍ ∈ G . Thus, we have
ƭ G ɍ 2 = ƭ G e ⇒ ɍ 2 ∈ G ƭ G ⇒ ɍ 2 ƭ G = ƭ G ⇒ ɍ ɍ ƭ G = ɍ ƭ G ⊙ ɍ ƭ G = ƭ G ⇒ ( ɍ ƭ G ) 2 = ƭ G .
Thus, for all ɍ ∈ G , o r d ( ɍ ƭ G ) ≤ 2 , where o r d ( ɍ ƭ G ) is the order of ɍ ƭ G . Therefore, for all ɍ ∈ G , o r d ( ɍ ƭ G ) = 1 or o r d ( ɍ ƭ G ) = 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

  1. Zadeh, L.A. Fuzzy sets. Inform. Control 1965, 8, 338–353. [Google Scholar] [CrossRef] [Scilit]
  2. Molodtsov, D. Soft set theory-First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Scilit]
  3. Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Scilit]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. Sezgin, A.; Atagün, A.O. On operations of soft sets. Comput. Math. Appl. 2011, 61, 1457–1467. [Google Scholar] [CrossRef] [Scilit]
  11. 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).
  12. Fu, L. Notes on soft set operations. ARPN J. Syst. Softw. 2011, 1, 205–208. [Google Scholar]
  13. Ge, X.; Yang, S. Investigations on some operations of soft sets. World Acad. Sci. Eng. Technol. 2011, 5, 370–373. [Google Scholar]
  14. 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]
  15. 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]
  16. 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]
  17. 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]
  18. Singh, D.; Onyeozili, I.A. Notes on soft matrices operations. ARPN J. Sci. Technol. 2012, 2, 861–869. [Google Scholar]
  19. Zhu, P.; Wen, Q. Operations on Soft Sets Revisited. J. Appl. Math. 2013, 2013, 105752. [Google Scholar] [CrossRef] [Scilit]
  20. Jayanta, S. On algebraic structure of soft sets. Ann. Fuzzy Math. Inform. 2014, 7, 1013–1020. [Google Scholar]
  21. 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]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. Güzel Ergül, Z. A new type of soft multi rough sets. Demonstr. Math. 2025, 58, 20250199. [Google Scholar] [CrossRef] [Scilit]
  27. Xiao, Z.; Gong, K.; Xia, S.; Zou, Y. Exclusive disjunctive soft sets. Comput. Math. Appl. 2010, 59, 2128–2137. [Google Scholar] [CrossRef] [Scilit]
  28. Zhang, H.; Luo, M. The “generator” of int-soft filters on residuated lattices. Mathematics 2019, 7, 236. [Google Scholar] [CrossRef] [Scilit]
  29. Jana, C.; Pal, M. On (α,β)-US sets in BCK/BCI-Algebras. Mathematics 2019, 7, 252. [Google Scholar] [CrossRef] [Scilit]
  30. Min, W.K. Consistent sets of soft contexts defined by soft sets. Mathematics 2019, 7, 71. [Google Scholar] [CrossRef] [Scilit]
  31. Al Ghour, S. Some modifications of pairwise soft sets and some of their related concepts. Mathematics 2021, 9, 1781. [Google Scholar] [CrossRef] [Scilit]
  32. Alexandru, A.; Ciobanu, G. Soft sets with atoms. Mathematics 2022, 10, 1956. [Google Scholar] [CrossRef] [Scilit]
  33. 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]
  34. Ameen, Z.A.; Alqahtani, M.H. Baire category soft sets and their symmetric local properties. Symmetry 2023, 15, 1810. [Google Scholar] [CrossRef] [Scilit]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. Onar, S.A. Note on neutrosophic soft set over hyperalgebras. Symmetry 2024, 16, 1288. [Google Scholar] [CrossRef] [Scilit]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. Kalaiselvan, S.; Vijayabalaji, S. Soft expert symmetric group and ıts application in MCDM problem. Symmetry 2022, 14, 2685. [Google Scholar] [CrossRef] [Scilit]
  51. Ahmmad, J.; Mahmood, T. Picture fuzzy soft prioritized aggregation operators and their applications in medical diagnosis. Symmetry 2023, 15, 861. [Google Scholar] [CrossRef] [Scilit]
  52. 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]
  53. 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]
  54. 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]
  55. 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]
  56. Qin, K.Y.; Hong, Z.Y. On soft equality. J. Comput. Appl. Math. 2010, 234, 1347–1355. [Google Scholar] [CrossRef] [Scilit]
  57. 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]
  58. 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]
  59. Feng, F.; Li, Y. Soft subsets and soft product operations. Inform. Sci. 2013, 232, 44–57. [Google Scholar] [CrossRef] [Scilit]
  60. Abbas, M.; Ali, B.; Romaguera, S. On generalized soft equality and soft lattice structure. Filomat 2014, 28, 1191–1203. [Google Scholar] [CrossRef] [Scilit]
  61. 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]
  62. 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]
  63. Al-shami, T.M.; El-Shafei, T. T-soft equality relation. Turk. J. Math. 2020, 44, 25. [Google Scholar] [CrossRef] [Scilit]
  64. 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]
  65. 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]
  66. 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]
  67. Ç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]
  68. 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]
  69. Sezgin, A. A new approach to semigroup theory I: Soft union semigroups, ideals and bi-ideals. Algebra Lett. 2016, 2016, 3. [Google Scholar]
  70. 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]
  71. Kaygisiz, K. On soft int-groups. Ann. Fuzzy Math. Inform. 2012, 4, 365–375. [Google Scholar]
  72. 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]
  73. 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]
  74. Aktaş, H.; Çağman, N. Soft set and soft groups. Inf. Sci. 2007, 177, 2726–2735. [Google Scholar] [CrossRef] [Scilit]
  75. 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]
  76. Sezgin, A.; Atagün, A.O. Soft groups and normalistic soft groups. Comput. Math. Appl. 2011, 62, 685–698. [Google Scholar] [CrossRef] [Scilit]
  77. Aslam, M.; Qurashi, S.M. Some contributions to soft groups. Ann. Fuzzy Math. Inf. 2012, 4, 177–195. [Google Scholar]
  78. Aktaş, H.; Özlü, Ş. Cyclic soft groups and their applications on groups. Sci. World J. 2014, 2014, 5. [Google Scholar] [CrossRef] [Scilit]
  79. Nazmal, S. Some properties of soft groups and fuzzy soft groups under soft mappings. Palest. J. Math. 2019, 8, 189–199. [Google Scholar]
  80. Barzegar, R.; Hosseini, S.B.; Çağman, N. Second type nilpotent soft subgroups. Afr. Math. 2023, 34, 17. [Google Scholar] [CrossRef] [Scilit]
  81. Alajlan, A.I.; Alghamdi, A.M. Soft groups and characteristic soft subgroups. Symmetry 2023, 15, 1450. [Google Scholar] [CrossRef] [Scilit]
  82. 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]
  83. Ç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]
  84. Kaygisiz, K. Normal soft int-groups. arXiv 2012, arXiv:1209.3157. [Google Scholar] [CrossRef] [Scilit]
  85. Kaygisiz, K. Homomorphism and isomorphism of soft int-groups. Afr. Mat. 2018, 29, 641–654. [Google Scholar] [CrossRef] [Scilit]
  86. Rasuli, R. Notes on the normal soft int-groups of a soft int-group. Ann. Math. Comput. Sci. 2022, 9, 41–51. [Google Scholar]
  87. Ç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]
  88. 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]
  89. 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]
  90. 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]
  91. 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]
  92. 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.
  93. 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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.