Abstract
The main purpose of this paper is to introduce the structure of the soft group category. In this category, we determine some special objects and morphisms having a universal structure such as the final object and a product. Therefore, the category of soft groups is a symmetric monodial category.
MSC:
18A05; 18A20; 19D23
1. Introduction
The real world is too complex for us to understand and interpret it. Therefore, simplified reality models of the real world are used. But these mathematical models are also very complex, and it is very difficult to analyze them. Uncertainty in data makes classical methods unsuccessful when trying to shape problems in engineering, physics, computer science, economics, social sciences, health sciences, etc. Therefore, it is not entirely appropriate to use classical set theory based on exact cases when solving problems with such uncertainties. To deal with these problems, many mathematical theories such as fuzzy set theory, intuitionistic fuzzy set theory, indeterminate set theory, mathematical time theory, and rough set theory have been defined. These theories are used as tools against uncertain situations. However, it has been seen that all these theories have their own problems.
According to Molodtsov, these difficulties are most likely due to the inadequacy of the theory’s parameterization tools. Molodtsov, freed from these troubles, put forward the soft set theory as a mathematical theory in 1999 in [1]. In his works, he successfully applied this new theory and its results to other fields such as probability theory, Perron integration, Riemann integration, research operation, and game theory. In most of the games, you need to design human behaviors or human models. There are many approaches to explain human behavior in game theory such as payment and selection functions. A selection function is a transformation that relates a set of strategies to a particular situation. Molodsov defined the soft function as a mathematical tool that retains all the good sides of the selection function and eliminates the drawbacks of the pay function and the selection function. Tripathy et al. [2] also defined the basic definitions and concepts for soft sets in the decision-making process and provided the use of soft sets in the decision-making process based on game theory.
Recently, many authors have worked on the algebraic structures of soft sets. Aktaş and Çağman [3] introduced the soft group structure depending on the definition of soft sets given by Molodsov and showed a way to construct algebraic structures based on the concept of a soft set. Due to [3], the soft group is defined by using the concepts of the soft set and classical group together, and this exhibits an algebraic structure containing parameters and uncertainty. Therefore, unlike classical groups, soft groups allow for the solution of problems that involve uncertainty and parametric analysis.
As for category theory, it was introduced by Samuel Elenberg and Saunders Maclane in the 1940s. The main purpose of category theory is to model and solve problems in a simpler way by using objects and morphisms.
Category theory is a comprehensive area of study in mathematics that examines, in an abstract way, the basic common language used to describe structures occurring in different contexts. These developments play a very important role in programming studies, logic, and authentication in computer science.
In category theory, all information about objects is encoded with morphisms between them. In order to examine the internal structure of an object, not only the object itself but also the relations of this object with other objects in the category are considered. The characterization of the relations between any particular type of object and the rest of the universe in which it is located is called a universal structure, and this is very common in category theory. For this reason, it should be investigated whether the category has special objects and morphisms, if any, in order to create the universal structure associated with the category.
If any category has a finite product and the final object, the product is a monoidal product, and the final object is the unit in this category, then this category is called a Cartesian monoidal category [4]. Any Cartesian monoidal category is a symmetric monoidal category [5]. Open games can be considered as morphisms of a symmetric monoidal category with objects consisting of pairs of sets. However, morphisms in the symmetric monoidal category are also illustrations of Feynman diagrams in quantum field theory.
The main objective of this paper is to show that the category of soft groups is a symmetric monoidal category with powerful applications among the building blocks of modern mathematics. First, we provide a novel soft kernel definition for a soft homomorphism between any two soft groups. After that, we obtain the category of soft groups and investigate the structures of both special objects (the final object and a product) and morphisms (epimorphism and monomorphism) in the category of soft groups as an analogue to Mac Lane’s study [4]. As a result, it can be seen that the category of soft groups, which is denoted by , is a symmetric monoidal category. Finally, we give an example of a soft group homomorphism with the soft kernel based on the structure of the hyperoctahedral group, which is a finite real reflection group. Thus, this example clearly shows that a soft group can also be defined on some parameterized finite reflection groups.
2. Preliminaries
In this section, we will recall some basic definitions and results related to soft set theory and soft group theory that will be used throughout the paper.
Definition 1.
Let U, , and E be a universal set, the power set of U, and a set of parameters, respectively. If is a function, then the pair is said to be a soft set over U, where [1].
Definition 2.
Let and be any two soft sets over the same universal set U. If the following conditions are satisfied, then is called a soft subset of , and we denote it by [6]:
- 1.
- 2.
- and are two identical predictions for every .
See [1,3,6] for more detailed information about soft sets.
Definition 3.
Let G be any group, and let be a soft set over G. If is a subgroup of G for each , then the pair is called a soft group over G [3].
As a convention, throughout this paper, we denote by the soft group over the group G.
Definition 4.
Let be a soft group. If for all , then is said to be a trivial or identity soft group, where e stands for the identity element of G [3].
Definition 5.
Let be a soft group. If for all , then is called a completely soft group [3].
Inspired by [7], we will define a soft group homomorphism between any two soft groups as follows:
Definition 6.
Let and be two soft groups. If there is a group homomorphism and a function such that
then the pair is said to be a soft group homomorphism from to , where f and are identical on the power set .
In other words, the pair is a soft group homomorphism if and only if the following diagram is commutative:
Definition 7.
Let the pair be a soft group homomorphism from to . If f is a group isomorphism and p is a bijection, then the soft groups and are called isomorphic and written .
The proof of the following theorem is immediately seen from Equation (1) and the associative property of composition of functions.
Theorem 1.
The composition of two soft group homomorphisms is a soft group homomorphism.
Definition 8
([3]). Let and be two soft groups. The soft product of the soft groups and is defined as
for all , and it is represented by
This concept can be generalized to three or finitely many soft groups in the following way:
Definition 9.
Let be soft groups. The soft product of these soft groups is defined as
for all and is denoted by
3. Soft Group Category
The objects of the soft group category are soft groups, and the morphisms between these objects are soft group homomorphisms. The composition in this category is defined as the composition of soft group homomorphisms.
Proposition 1.
Soft groups and soft group homomorphisms between them form a category.
Proof.
The proof is clear from the Equation (1) and Theorem 1. □
Note here that in this category for each object , the unit morphism is defined as the soft group homomorphism , where is the identity group homomorphism and is an identity map. Throughout this paper, this category is denoted by .
We will give the definition of a soft kernel, which is not included in the literature and will be needed to prove that a monic morphism is one-to-one in the category of soft groups inspired by group theory.
Definition 10.
Let and be any two soft groups. Let be a soft group homomorphism. Let be the set consisting of such that . Having fixed
we define as the restriction function of F to . Then, the soft group is called the soft kernel of .
Remark 1.
The soft kernel of a soft group homomorphism may not always be defined. One can construct a soft group homomorphism with the soft kernel by defining for some .
Theorem 2.
Let and be any two soft groups. Assume that is a soft group homomorphism such that for some . Then, f is injective if and only if , which is the soft kernel of , is the trivial soft subgroup.
Proof.
Let be a monomorphism, and let be the restriction of the function F to , where is defined as in the Equation (2). Thus, the pair is the trivial soft subgroup of . Conversely, let be the trivial soft subgroup, where is the soft kernel of . We can write for all . Therefore, f is an injective group homomorphism. □
Definition 11.
Let and be two soft group homomorphisms. Then, is equal to if and only if and .
Theorem 3.
Let be a soft group homomorphism such that for some . If is monic, then f and p are injective.
Proof.
Suppose that f is not injective. Thus, we have . When , we obtain , where . Hence the map is not monic.
Now p is not injective. Then, we have two different such that .
If we define the maps as
and
then we have . Now, we want to show that the map is a soft group homomorphism. In what follows, we need to prove that the diagram
is commutative. Suppose . Then, we obtain
Due the fact that and f is injective, we conclude that and so
Now, we first take . For any , we write and so . Secondly, if , then we obtain and again . Therefore, is a soft group homomorphism.
In the similar way, we can prove that the map is a soft group homomorphism. Eventually, we have
However, is not monic since . This completes the proof. □
Theorem 4.
Let be a morphism in the soft group category . If both f and p are injective, then the morphism is monic.
Proof.
Assume that f and p are injective. Let be any two morphisms in such that . Thus, it can been easily seen that . Then, we obtain and . Since both f and p are one-to-one, we obtain in and in , where and represent the group category and set category, respectively. Therefore, the morphism is monic in . □
Theorem 5.
If a soft group morphism in the is split monic, then both f and p is injective.
Proof.
Let and be any two soft groups, and let be a soft split monic morphism. Since is a split monic morphism, then there is such that . Because of Definition 11, we have and . It follows that f is a split monic morphism in the group category and p is a split monic morphism in the set category . Thus, both f and p are injective. □
Theorem 6.
Let be a morphism in the soft group category . If both f and p are surjective, then the morphism is epic.
Proof.
Assume that are any two morphisms in such that . Thus, we deduce that . From this, we obtain and . We obtain in and in due to the fact that f is an epimorphism and q is onto. Hence, the morphism is epic in . □
4. Properties of the Soft Group Category
In this section, we will show that the category is a symmetric monoidal category by proving the existence of the universal properties such as the final object and a product.
Theorem 7.
Let be the trivial group, and let be a singleton. Let be a soft group such that . Then, is the final object in the soft group category .
Proof.
Let be an object in the soft group category . Then, the following diagram
is commutative, where for every and
states the group homomorphism defined by for each . Thus, is the unique soft group homomorphism that can be defined from to . As a result, any soft group constructed by a parameter set with a single-element and a group with one element is the final object in the soft group category . □
Proposition 2.
Let and be soft groups, and let be the soft product of them. For , let be i-th projection function on the parameter sets and let be i-th projection homomorphism on groups. Then, the map for each is a soft group homomorphism.
Proof.
To prove that is a soft group homomorphism for each , we need to show that the following diagram is commutative:
For this purpose, it is sufficient to show that the equality is satisfied. For any pair , we obtain
and so the proof is completed. □
We can generalize the above proposition as follows:
Corollary 1.
Let be soft groups, and let be the product of these soft groups in the sense of Definition 9. For each , let be the i-th projection function on the parameter sets and let be i-th projection homomorphism on groups. Then, the map for each is a soft group homomorphism.
Proof.
In order to show that is a soft group homomorphism for each , we must prove that the following diagram is commutative:
For any , we conclude that
which completes the proof. □
Theorem 8.
Let and be any two objects in , and let be the soft product of and . Then, the product of and in is no other than , where for , is the i-th projection function on the parameter sets and is the i-th projection homomorphism on groups.
Proof.
Assume that is an object and each , is a morphism in . To prove the uniqueness of the product of and , we need to show that there is a unique soft group homomorphism , where we define and . For this reason, we will verify that the diagram below is commutative:
For any element b of B, we have
so is a soft group homomorphism. We illustrated the morphisms in the diagram below for the purpose of a better explanation of the subject.
Now, we show that for each the realtion . For any , we have
and so . Similarly, we can prove the relation .
Finally, let be another morphism satisfying the condition . Since
for each , then we have . We conclude that due to the fact that each is a group monomorphism. In a similar manner, one can see . Consequently, we obtain , which means is unique. Thus, we complete the proof. □
5. Example
In this section, we will give a soft group homomorphism with the soft kernel based on the structure of the hyperoctahedral group, which is a finite real reflection group.
We assume that for any such that . Let be a Weyl group of type , which is also called a hyperoctahedral group, where is the canonical set of generators of [8]. Any element acts as a signed permutation on the set such that for each . The group has a Dynkin diagram with respect to the set of generators as follows:

The subgroup of generated by K is said to be a standard parabolic subgroup for any subset K of , and a subgroup of conjugate to for some is called a parabolic subgroup [8]. Let for each . It is well-known that , where is the symmetric group generated by and is a normal subgroup of generated by reflections in . That is, is a split group extension of by , and clearly the cardinality of the group is . Note here that is identified with
and is defined by
For more detailed information about the Weyl group of type , one can apply to [8].
A signed composition of n can be considered of as an expression of n as an ordered sequence of nonzero integers [9]. More precisely, a signed composition of n is a finite sequence of nonzero integers satisfying . Put . We will denote the set of all signed compositions of n by .
A bi-partition of n is a pair , where and are partitions such that [9]. It is well-known from [9] that is a surjective map, where (resp. ) is the rearrangement of the positive components (resp. absolute value of negative components) of A in decreasing order. For , is a unique signed composition obtained by concatenating the sequence of components of to those of , and is a reflection subgroup of (see [9]).
We will denote by the set of all bi-partitions of n. In [9], Bonnafé and Hohlweg assigned each signed composition of n to a reflection subgroup of in the following way: the reflection subgroup of with respect to wasgenerated by the reflection subset , which is defined by
where
Let denote the power set of . If we pick the parameter set as and accordingly define the map , then the pair is a soft group.
Now, we give another soft group example. If we take as the parameter set and define the map F as , where we can write for every , then the pair is a soft group due to the fact that is a subgroup of .
The pair is a soft group homomorphism with the soft kernel. Therefore, we say that the following diagram is commutative:
where is the trivial isomorphism and is the identity function on . In fact, let and let . Thus, we can write , so it is clear that for every . Therefore, for every , we obtain
Hence, the above diagram is commutative. The soft kernel of this soft group homomorphism is equal to the set since is the trivial subgroup of .
6. Conclusions
In this paper, we first defined a soft homomorphism between soft groups, then we established its soft kernel. Then, we constructed the category of soft groups and investigated the structures of special objects and morphisms such as the final object, a finite product, and monomorphism and epimorphism in this category. Since the final object and a finite product exist in this category, we concluded that the category of soft groups is a symmetric monoidal category. Finally, we presented an example of a soft group homomorphism with the soft kernel that depends more on the structure of the hyperoctahedral group, which is considered a signed permutation group. In future studies, monoid objects can be investigated in the category of soft groups. Soft group objects may be studied in the category of groupoids.
Author Contributions
Methodology, N.A.; Writing—original draft, H.A. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Molodtsov, D. Soft set theory-First results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Scilit]
- Tripathy, B.K.; Sooraj, T.R.; Mohanty, R.N. Application of Soft Set in Game Theory. In Encyclopedia of Informotion Science and Technology, 4th ed.; IGI Global: Hershey, PA, USA, 2018. [Google Scholar]
- Aktaş, H.; Çagman, N. Soft sets and soft groups. Inf. Sci. 2007, 177, 2726–2735. [Google Scholar] [CrossRef] [Scilit]
- Mac Lane, S. Categories for the Working Mathematician; Graduate Text in Mathematics; Springer: New York, NY, USA, 1971; Volume 5. [Google Scholar]
- Baez, J.; Stay, M. Physics, Topology, Logic and Computation: A Rosetta Stone, in New Structures for Physics; Coecke, B., Ed.; Lecture Notes in Physics; Springer: Berlin, Germany, 2011; Volume 813, pp. 95–174. [Google Scholar]
- Maji, P.K.; Bismas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Scilit]
- Sezgin, A.; Atagun, A.O. Soft Groups and Normalistic Soft Groups. Comput. Math. Appl. 2011, 62, 1457–1467. [Google Scholar] [CrossRef] [Scilit]
- Humphreys, J.E. Reflection Groups and Coxeter Groups; Cambridge University Press: Cambridge, UK, 1990; No. 29. [Google Scholar]
- Bonnafe, C.; Hohlweg, C. Generalized descent algebra and construction of irreducible characters of hyperoctahedral groups. Ann. Inst. Fourier 2006, 56, 131–181. [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. |
© 2025 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 (https://creativecommons.org/licenses/by/4.0/).