Next Article in Journal
A Study on the Centroid of a Class of Solvable Lie Algebras
Previous Article in Journal
Tracking Defects of Electronic Crystals by Coherent X-ray Diffraction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Soft Groups and Characteristic Soft Subgroups

by
Amlak I. Alajlan
1,2,* and
Ahmad M. Alghamdi
1
1
Department of Mathematical Sciences, Faculty of Applied Sciences, Umm Al-Qura University, P.O. Box 14035, Makkah 21955, Saudi Arabia
2
Department of Mathematics, College of Science, Qassim University, Buraydah 51452, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(7), 1450; https://doi.org/10.3390/sym15071450
Submission received: 21 June 2023 / Revised: 13 July 2023 / Accepted: 18 July 2023 / Published: 20 July 2023
(This article belongs to the Section Mathematics)

Abstract

:
Group theory is the part of mathematics which addresses the study of symmetry. This paper extends the investigation of the soft group theory which Aktaş and Çağman have defined. We study new concepts in the soft group theory such as the center of the soft group, the kernel of soft homomorphism and soft automorphisms with their basic properties. Furthermore, the concept of soft point groups is introduced and the properties of these soft groups are studied. We state the concept of characteristic soft subgroups of a given soft group. Also, some theorems related to this concept are investigated. We study the characteristic soft subgroups of a given soft point group. The characteristic soft subgroups play a significant part in the study of the soft group theory and are useful for understanding the structure of a soft group and its soft automorphisms. As an application of characteristic soft subgroups, they allow us to identify and study important soft subgroups that are preserved under soft automorphisms. Also, practical applications for our theory can be conducted in future work such as the relation with other disciplines in sciences.

1. Introduction

In 1999, Molodtsov [1] proposed the notion of soft set theory to solve complex problems and difficulties which are related to uncertainties in probability theory, fuzzy set theory [2], rough sets [3] and other mathematical tools. In fuzzy sets, every element is assigned a grade of membership function between 0 and 1. However, the selection of an appropriate membership function can be difficult in each particular case, especially when the underlying data are complex or uncertain. The rough sets are based on the idea of approximating a set by two subsets: the lower approximation and the upper approximation. This can be a useful way to handle incomplete or missing information, and it may become very complex when addressing large sets of data or complex relationships between elements and sets. While fuzzy sets and rough sets are beneficial frameworks for handling uncertainty, the concept of soft sets provides a more flexible and powerful approach to handling uncertainty by allowing each element of a set to be associated with a set of parameters that represent a different characterization or attributes. This can provide a more structured and complete representation of uncertainty than fuzzy sets or rough sets. Every fuzzy set and rough set can be represented as a particular case of a soft set, wherein the soft set parameters are defined by the degree of membership or the rough set approximations, respectively. Therefore, the soft sets have rapidly developed into a powerful and versatile framing for addressing uncertainty and have numerous applications in different fields. In 2002, Maji et al. [4] discussed the soft sets in decision-making problems and proposed a method for aggregating soft set parameters to make decisions. In a decision-making problem, a soft set can be used to represent each option or alternative being considered. The soft set parameters can represent the various factors that influence the decision, such as cost, risk or benefit. In 2003, Maji et al. [5] presented several basic notions of the soft set theory. In 2008, Yang [6] worked to correct some properties of the soft set theory that were introduced in [5]. In 2009, the authors of [7] improved some notions and introduced new operations in the soft sets theory. In 2012, Zorlutuna et al. [8] presented the concept of soft mappings between two collections of soft sets with some properties.
Rosenfeld [9] proposed fuzzy subgroups as an extension of the classical notion of subgroups in group theory. Biswas and Nanda [10] defined the rough groups as an extension of the rough set theory. The algebraic structure of the soft set was originated by Aktaş and Çağman in 2007. They [11] defined the soft group as a soft set F ˜ A over a group G such that F ( a ) is subgroup of the group G for all a A . In 2011, Sezgin and Atagün [12] did a correction for some properties of soft groups that were introduced in [11]. They also presented the concept of normalistic soft groups. Aslam et al. [13] introduced several concepts in soft groups with their properties such as cyclic and abelian soft groups, factor soft groups and others. In 2014, Aktaş and Özlü [14] proposed the order of the soft group and its basic properties were studied. In 2019, Nazmal [15] studied the homomorphic image and preimage of soft groups under the soft mapping that was defined in [8]. In 2023, Barazegar et al. [16] defined the commutator of soft groups and nilpotent soft groups. They also presented the second type nilpotent soft subgroup with its properties.
The relationship between the set theory and group theory is rather strong and the group theory is very rich with many applications in various fields of science. This motivates us to use its richness in the soft set theory. In the group theory, the concept of characteristic subgroups has been studied by many scholars. We say that a subgroup of a given group G is a characteristic subgroup of G if it is invariant under all automorphism of G. In [17,18], several researchers studied the concept of characteristic subgroups and the results related to this concept in fuzzy group theory. The objective of this paper is to further examine soft group theory and extend the concept of characteristic subgroups and their related properties and results to include soft groups. We will study some properties of the soft abelian group and cyclic soft group. We will study new concepts in the soft group such as the center of the soft group and the kernel of soft homomorphism with their basic properties. We will prove that the collection of all soft automorphisms of a given soft group forms a group and the collection of all its inner automorphisms forms a normal subgroup. We will state a new kind of soft group which is called a soft point group. Also, we will study its properties. We will define the characteristic soft subgroups as follows: Suppose that F ˜ A is a soft group over a given group G and H ˜ A is a soft subgroup of F ˜ A . Then, H ˜ A is called a characteristic soft subgroup of F ˜ A if it is invariant under all soft automorphism of F ˜ A , and will be denoted by H ˜ A c h a r s F ˜ A . We will study equivalent definitions to the definition of characteristic soft subgroups. We will prove that every characteristic soft subgroup of a normalistic soft subgroup is a soft normal subgroup. We will show that if H ˜ A c h a r s   K ˜ A and K ˜ A c h a r s F ˜ A , then K ˜ A c h a r s F ˜ A . We will prove that the restricted intersection of a collection of characteristic soft subgroups of F ˜ A is a characteristic soft subgroup of F ˜ A . We will study the characteristic soft subgroups of a soft point group. We will prove that every characteristic soft subgroup of a soft point group is a soft normal subgroup. This allows us to identify soft normal subgroups of a given soft point group and study their attributes using the characteristic soft subgroups. We will show that the center of a soft point group and every cyclic soft subgroup of a soft point group is a characteristic soft subgroup. The characteristic soft subgroups play a significant part in the study of soft group theory and are useful for understanding the structure of a soft group and its soft automorphisms. As an application of characteristic soft subgroups, they allow us to identify and study important soft subgroups that are preserved under soft automorphisms. Also, practical applications for our theory can be conducted in future work such as the relation with other disciplines in sciences.
The structure of this paper is as follows: following the introduction, Section 2 provides a review of the notions and theorems in soft theory and soft groups. In Section 3, we study new notions of soft groups, soft homomorphism, soft isomorphism and soft automorphisms. Then, we deduce their properties. After that, we present the concept of soft point groups and examine some of their properties. In Section 4, the definition of the characteristic soft subgroups of a given soft group is presented. Then, we investigate their properties.

2. Preliminaries

This section is devoted to recalling the main concepts and results in soft sets theory and soft groups which will be used in the following sections.

2.1. Soft Sets Theory

Throughout this section, X denotes an initial universe set and P ( X ) denotes the power set of X. We indicate the empty set by the symbol ∅.
Definition 1
([1]). Suppose that A is a set of parameters and F is a mapping from A into P ( X ) . Then, a soft set over X is presented as
F ˜ A = { ( a , F ( a ) ) : a A   a n d   F ( a ) X } .
The collection of all soft sets over X with respect to the set of parameters A will be symbolized by S S ( X ) A .
Definition 2
([5]). Suppose that F ˜ A is a soft set over X. If F ( a ) = for each a A , then F ˜ A is said to be a null soft set over X and is symbolized by Φ ˜ A .
Definition 3
([5]). Suppose that F ˜ A is a soft set over X. If F ( a ) = X for each a A , then F ˜ A is said to be an absolute soft over X and is symbolized by X ˜ A .
Definition 4
([7]). Consider F ˜ A is a soft set over X. Then, the relative complement of F ˜ A , symbolized by F ˜ A c , is presented as
F ˜ A c = { ( a , F ( a ) c ) : a A   a n d   F c : A P ( X )   s u c h   t h a t   F c ( a ) = F ( a ) c } .
Definition 5
([6]). Suppose that F ˜ A and H ˜ B are soft sets over X. Then, F ˜ A is called a soft subset of H ˜ B , symbolized by F ˜ A ˜ H ˜ B , if A B and F ( a ) H ( a ) for each a A . The soft sets F ˜ A and H ˜ B are soft equal if F ˜ A ˜ H ˜ B and H ˜ B ˜ F ˜ A .
Definition 6
([7]). Suppose F ˜ A and H ˜ B are soft sets over X such that A B . Then, the restricted intersection of F ˜ A and H ˜ B , symbolized by F ˜ A ˜ H ˜ B , is the soft set
T ˜ C = { ( c , T ( c ) ) : c C ,   T : C P ( X ) } ,
where C = A B and T ( c ) = F ( c ) H ( c ) for each c C .
Definition 7
([5]). Suppose that F ˜ A and H ˜ B are soft sets over X. Then, the union (extended union) of F ˜ A and H ˜ B , symbolized by F ˜ A ˜ H ˜ B , is the soft set T ˜ C = { ( c , T ( c ) ) : c C , T : C P ( X ) } , where C = A B and
T ( c ) = F ( c ) i f c A B , H ( c ) i f c B A , F ( c ) H ( c ) i f c A B .
Definition 8
([8]). Suppose that S S ( X ) A is a collection of soft sets over X and S S ( Y ) B is a collections of soft sets over Y . Let f : X Y and ψ : A B be two mappings. Then, Ψ f , ψ : S S ( X ) A S S ( Y ) B is a map defined as
  • If F ˜ A S S ( X ) A , then the image of F ˜ A is a soft set in S S ( Y ) B such that for all b B ,
    Ψ f , ψ ( F ˜ ) ( b ) = a ψ 1 ( b ) f ( F ( a ) ) i f ψ 1 ( b ) , i f ψ 1 ( b ) = .
  • If H ˜ B S S ( Y ) B , then the inverse image of a soft set H ˜ B is
    Ψ f , ψ 1 ( H ˜ B ) ( a ) = f 1 ( H ( ψ ( a ) ) )   f o r   a l l   a A .
Remark 1.
If f and ψ in Definition 8 are injective (resp. surjective, bijective) maps, then the map Ψ f , ψ is injective (resp. surjective, bijective).
Theorem 1
([8]). Consider S S ( X ) A is a collections of soft sets over X and S S ( Y ) B is a collection of soft sets over Y . We assume that Ψ f , ψ : S S ( X ) A S S ( Y ) B , where f : X Y and ψ : A B .
1. 
Ψ f , ψ Ψ f , ψ 1 ( H ˜ B ) ˜ H ˜ B for any H ˜ B S S ( Y ) B . If Ψ f , ψ is surjective, then Ψ f , ψ Ψ f , ψ 1 ( H ˜ B ) = H ˜ B .
2. 
F ˜ A ˜ Ψ f , ψ 1 Ψ f , ψ ( F ˜ A ) for any F ˜ A S S ( X ) A . If Ψ f , ψ is injective, then F ˜ A = Ψ f , ψ 1 Ψ f , ψ ( F ˜ A ) .

2.2. Soft Group

Within this section, G denotes a group with identity element e G . We call ( a , F ( a ) ) an element of the soft set F ˜ A , where a A .
Definition 9
([11]). Suppose that F ˜ A is a soft set over G . If F ( a ) is a subgroup of G for each a A , then F ˜ A is called a soft group over G .
Definition 10
([11]). Suppose that F ˜ A is a soft group over G.
1. 
If F ( a ) = { e G } for each a A , then F ˜ A is said to be an identity soft group and is denoted by e ˜ G .
2. 
If F ( a ) = G for each a A , then F ˜ A is said to be an absolute soft group and is denoted by G ˜ A .
Definition 11
([11]). Suppose that F ˜ A and H ˜ B are two soft groups over G. Then, F ˜ A is a soft subgroup of H ˜ B , symbolized by F ˜ A ˜ H ˜ B , if A B and F ( a ) is a subgroup of H ( a ) for each a A . If F ( a ) is a normal subgroup of H ( a ) for each a A , then F ˜ A is a normal soft subgroup of H ˜ B and symbolized by F ˜ A ˜ H ˜ B .
Definition 12
([12]). Suppose that F ˜ A is a soft group over G . If F ( a ) is a normal subgroup of G for each a A , then F ˜ A is called a normalistic soft group over G .
Let us now recollect the definitions of soft homomorphism and soft isomorphism between two soft groups.
Definition 13
([11]). Suppose that F ˜ A is a soft group over G and H ˜ B is a soft group over the group K . Suppose that f : G K and ψ : A B are two mappings. Then, a pair ( f , ψ ) is considered a soft homomorphism from F ˜ A to H ˜ B if the following conditions are met:
  • f is a group homomorphism from G onto K;
  • ψ is a map from A onto B;
  • f ( F ( a ) ) = H ( ψ ( a ) ) for each a A .
Definition 14
([11]). Suppose that F ˜ A is a soft group over G and H ˜ B is a soft group over the group K . Let ( f , ψ ) be a soft homomorphism from F ˜ A to H ˜ B . If f is a group isomorphism from G to K and ψ is a bijective mapping from A to B, then the pair ( f , ψ ) is said to be a soft isomorphism from F ˜ A to H ˜ B . Also, we call F ˜ A a soft isomorphic to H ˜ B and is symbolized by F ˜ A H ˜ B .
The following theorem clarifies the soft homomorphic image and preimage of soft groups under the soft mappings mentioned in Definition 8.
Theorem 2
([15]). Consider S S ( G ) A a collections of soft sets over G and S S ( K ) B is a collection of soft sets over the group K . Suppose that Ψ f , ψ : S S ( G ) A S S ( K ) B , where ( f , ψ ) is a soft homomorphism.
1. 
Ψ f , ψ ( e ˜ G ) = e ˜ K and Ψ f , ψ ( G ˜ A ) = K ˜ B .
2. 
If H ˜ B is a soft group over K , then Ψ f , ψ 1 ( H ˜ B ) is a soft group over G.
3. 
If F ˜ A is a soft group over G and ψ is an injective map, then Ψ f , ψ ( F ˜ A ) is a soft group over K.
4. 
If F ˜ A and U ˜ A are soft groups over G such that F ˜ A ˜ U ˜ A and ψ is an injective map, then Ψ f , ψ ( F ˜ A ) ˜ Ψ f , ψ ( U ˜ A ) . Also, if F ˜ A ˜ U ˜ A and ψ is an injective map, then Ψ f , ψ ( F ˜ A ) ˜ Ψ f , ψ ( U ˜ A ) .
5. 
If H ˜ B and N ˜ B are soft groups over K such that H ˜ B ˜ N ˜ B , then Ψ f , ψ 1 ( H ˜ B ) ˜ Ψ f , ψ 1 ( N ˜ B ) . Also, if H ˜ B ˜ N ˜ B , then Ψ f , ψ 1 ( H ˜ B ) ˜ Ψ f , ψ 1 ( N ˜ B ) .
In what follows, definitions and some theorems of the order of soft groups and cyclic soft groups are presented.
Definition 15
([14]). Suppose that F ˜ A is a soft group over G and ( a , F ( a ) ) is an element of F ˜ A . Then, the order of ( a , F ( a ) ) , symbolized by | F ( a ) | , is the smallest positive integer n such that F ( a ) n = { e G } , where F ( a ) n = { g n : g F ( a ) } . The element ( a , F ( a ) ) of F ˜ A has infinite order if n does not exist.
Theorem 3
([14]). Suppose that F ˜ A is a soft group over a finite group G . Then, each element of F ˜ A has a finite order.
Theorem 4
([14]). Suppose that F ˜ A is a soft group over a finite group G and ( a , F ( a ) ) F ˜ A . Then, | F ( a ) | is the exponent of the subgroup F ( a ) .
Definition 16
([14]). Suppose that F ˜ A is a soft group over G.
1. 
For a finite group G, the order of F ˜ A is the exponent of F ˜ A , where the exponent of F ˜ A means the least common multiple of the orders of its elements.
2. 
For an infinite group G, the order of F ˜ A is determined by the number of its elements.
We denote the order of F ˜ A by | F ˜ A | .
Example 1.
Consider G = S 4 and A = { a 1 , a 2 , a 3 } . Then,
F ˜ A = { ( a 1 , S 3 ) , ( a 2 , ( 1234 ) , ( 13 ) D 8 ) , ( a 3 , ( 1234 ) C 4 ) }
is a soft group over G. Thus, | F ( a 1 ) | = 6 , | F ( a 2 ) | = 4 and | F ( a 3 ) | = 4 . Therefore, | F ˜ A | = 12 .
Example 2.
Consider G = R an additive group of real numbers and A = { a 1 , a 2 , a 3 } . Then,
F ˜ A = { ( a 1 , Z ) , ( a 2 , Q ) , ( a 3 , R ) }
is a soft group over G. Therefore, | F ˜ A | = 3 .
Definition 17
([14]). Assuming that F ˜ A is a soft group defined over G and X is a subset of G. If F ˜ A = { ( a , x ) : for each a A and x X G } , then F ˜ A is the soft group generated by the set X . If F ˜ A = X , then we say that F ˜ A is a cyclic soft group over G .
Remark 2.
Every soft group over a cyclic group is a cyclic soft group but the converse may fail.
Theorem 5
([14]). Suppose that F ˜ A is a soft group over G.
1. 
e ˜ G is a cyclic soft group over G generated by { e G } .
2. 
G ˜ A is a cyclic soft group over G if and only if G is a cyclic group.
3. 
If F ˜ A is a cyclic soft group, then every soft subgroup of F ˜ A is a cyclic soft group.
Theorem 6
([14]). Suppose that F ˜ A is soft group over G and H ˜ B is a soft group over the group K . Assume that ( f , ψ ) is a soft homomorphism that maps F ˜ A to H ˜ B . If F ˜ A is a cyclic soft group over G , then ( f ( F ˜ A ) , ψ ( A ) ) is a cyclic soft group over K .
Definition 18
([13]). Assuming that F ˜ A is a soft group over G . If F ( a ) is an abelian subgroup of G for each a A , then F ˜ A is called an abelian soft group over G .
Theorem 7
([13]). Suppose that F ˜ A is an abelian soft group over G and H ˜ B ˜ F ˜ A . Then, H ˜ B is a normal soft subgroup of F ˜ A .
Theorem 8
([13]). Assuming that F ˜ A is a cyclic soft group over G. Then, F ˜ A is an abelian soft group over G.
But the reverse of the above theorem is generally not true. For instance, V ˜ 4 is an abelian soft group over V 4 but not cyclic soft group over V 4 .
Now, we recall the definitions and theorems which are related to the commutator of soft groups and nilpotent soft groups.
Definition 19
([16]). Suppose that F ˜ A is a soft group over G and H ˜ B is a soft group over the group K . Then, the commutator of F ˜ A and H ˜ A is the soft set [ F ˜ A , H ˜ A ] : A P ( G ) such that
[ F ˜ A , H ˜ A ] ( a ) = [ F ( a ) , H ( a ) ]
for each a A . It is clear that [ F ˜ A , H ˜ A ] is a soft group of G .
Remark 3
([16]). Let { F ˜ A 1 , F ˜ A 2 , . . , F ˜ A n } be a collection of soft groups over G. Then, the n-commutator [ F ˜ A 1 , F ˜ A 2 , . . , F ˜ A n ] : A P ( G ) is defined as
[ F ˜ A 1 , F ˜ A 2 , . . , F ˜ A n ] ( a ) = [ F 1 ( a ) , F 2 ( a ) , , F n ( a ) ]
for each a A .
Definition 20
([16]). Suppose that F ˜ A is soft group over G . A chain of soft groups over G
e ˜ G = F ˜ A 0 ˜ F ˜ A 1 ˜ . . ˜ F ˜ A n = F ˜ A
is said to be a central series if [ F ˜ A i , F ˜ A ] ˜ F ˜ A i 1 for all 1 i n .
Definition 21
([16]). Suppose that F ˜ A is a soft group over G . Then, F ˜ A is said to be a nilpotent soft group if it possesses a central series. The nilpotency class of F ˜ A is defined as the length of its shorter central series and symbolized by c ( F ˜ A ) .

3. Some More Properties of Soft Groups, Soft Homomorphisms and Soft Automorphisms

In this section, we introduce concepts and results which are related to soft groups, soft isomorphisms and soft automorphisms. Also, we point out the concept of soft point groups and deduce their basic properties. The notations are the same as in Section 2.2.
First, we introduce theorems of abelian soft groups.
Theorem 9.
Suppose that F ˜ A is a soft group over G . If | F ˜ A | = 2 , then F ˜ A is an abelian soft group over G .
Proof. 
It is straightforward. □
Theorem 10.
Suppose that F ˜ A is a soft group over G . Then, [ F ˜ A , F ˜ A ] = e ˜ G if and only if F ˜ A is an abelian soft group over G.
Proof. 
Necessity. Suppose that [ F ˜ A , F ˜ A ] = e ˜ G . Then, [ F ( a ) , F ( a ) ] = { e G } for each a A . Therefore, F ( a ) is an abelian subgroup of G for each a A . Hence, F ˜ A is an abelian soft group over G.
Sufficiency. We assume that F ˜ A is an abelian soft group over G . Then, F ( a ) is an abelian subgroup of G for each a A . Therefore, [ F ( a ) , F ( a ) ] = { e G } for each a A . Hence, [ F ˜ A , F ˜ A ] = e ˜ G .
Theorem 11.
Suppose that F ˜ A is an abelian soft group over G . Then, F ˜ A is a nilpotent soft group.
Proof. 
Suppose that F ˜ A is an abelian soft group over G . By Definition 20, a chain
e ˜ G = F ˜ A 0 ˜ F ˜ A 1 ˜ . . ˜ F ˜ A n = F ˜ A
of soft groups over G is central series if and only if [ F ˜ A i , F ˜ A ] ˜ F ˜ A i 1 for all 1 i n . Then, by Theorem 10, [ F ˜ A n , F ˜ A ] = [ F ˜ A , F ˜ A ] = { e G } . Thus, [ F ˜ A n , F ˜ A ] ˜ F ˜ A n 1 for all 1 i n . Hence, F ˜ A is a nilpotent soft group. □
The reverse of the above theorem is generally not true, as illustrated in the next example.
Example 3.
Let G = D 8 = a , b | a 4 = b 2 = ( a b ) 2 = 1 . Let A = { a 1 , a 2 , a 3 } and F ˜ A = { ( a 1 , D 8 ) , ( a 2 , a ) , ( a 2 , a 2 ) } be a soft group over G . Therefore, F ˜ A is a nilpotent soft group over G since it has a central series
e ˜ G = F ˜ A 0 ˜ F ˜ A 1 ˜ F ˜ A n = F ˜ A ,
where F ˜ A 1 = { ( a 1 , a 2 ) , ( a 2 , a 2 ) , ( a 3 , a 2 ) } . It is obvious that F ˜ A is not an abelian soft group over G .
Now, we look at the image of abelian and cyclic soft groups under the soft mapping which is defined in Definition 8.
Theorem 12.
Suppose that F ˜ A is a soft group over G. We assume that Ψ f , ψ : S S ( G ) A S S ( K ) B , where f : G K is a group homomorphism and ψ : A B is a bijection mapping.
1. 
If F ˜ A is an abelian soft group, then Ψ f , ψ ( F ˜ A ) is an abelian soft group over K.
2. 
If F ˜ A is a cyclic soft group, then Ψ f , ψ ( F ˜ A ) is a cyclic soft group over K .
Proof. 
  • By Theorem 2, Ψ f , ψ ( F ˜ A ) is a soft group over K . By the definition of Ψ f , ψ , Ψ f , ψ ( F ˜ ) ( b ) = f ( F ( ψ 1 ( b ) ) ) for each b B . Since F ( ψ 1 ( b ) ) is an abelian subgroup of G for each a A then f ( F ( ψ 1 ( b ) ) ) is an abelian subgroup of K for each b B . Therefore, Ψ f , ψ ( F ˜ A ) is an abelian soft group over K.
  • It is similar to the proof part 1.
Now, we present the notion of the center of a soft group.
Definition 22.
Suppose that F ˜ A is a soft group over G . Then, we define the center of F ˜ A as
Z ( F ˜ A ) = { ( a , Z ( F ( a ) ) ) :   f o r   e a c h   a A } ,
where Z ( F ( a ) ) is the center of the subgroup F ( a ) . It is clear that Z ( F ˜ A ) is a soft subgroup of F ˜ A .
Example 4.
Consider G = S 3 and F ˜ A = { ( a 1 , ( 123 ) ) , ( a 2 , S 3 ) } is a soft group over G . Then, Z ( F ˜ A ) = { ( a 1 , ( 123 ) ) , ( a 2 , { e G } ) } .
Theorem 13.
Assuming that F ˜ A is a soft group over G . Then, Z ( F ˜ A ) ˜ F ˜ A .
Proof. 
Since Z ( F ( a ) ) is a normal subgroup of F ( a ) for each a A then Z ( F ˜ A ) ˜ F ˜ A .
Definition 23.
Suppose that F ˜ A is a soft group over G . If every element of F ˜ A has order a power of some fixed prime p, then F ˜ A is called a soft p-group.
Theorem 14.
Assuming that F ˜ A is a soft p-group over G. Then, Z ( F ˜ A ) is a non-trivial soft group, meaning that Z ( F ˜ A ) is not equal to the identity soft group.
Proof. 
Since F ˜ A is a soft p-group, every element ( a , F ( a ) ) F ˜ A has order is a power of p. By a fact in the basic group theory, for each a A , F ( a ) has a non-trivial center. Then, Z ( F ˜ A ) is a non-trivial soft group. □
We now introduce and study some concepts and properties which are related to soft homomorphisms, soft isomorphisms and soft automorphisms.
Definition 24.
Suppose that F ˜ A is soft group over G and H ˜ B is a soft group over the group K . We assume that ( f , ψ ) is a soft homomorphism that maps F ˜ A to H ˜ B . Then, we define the kernel of ( f , ψ ) as
K e r ( f , ψ ) = { ( a , K e r f a ) :   f o r   e a c h   a A } ,
where K e r f a is the kernel of the restriction of f to the subgroup F ( a ) .
Theorem 15.
Suppose that F ˜ A is soft group over G and H ˜ B is a soft group over the group K . We assume that ( f , ψ ) is a soft homomorphism that maps F ˜ A to H ˜ B . Then, K e r ( f , ψ ) is a normal soft subgroup of F ˜ A .
Proof. 
By a fact in the basic group theory, we have K e r f a F ( a ) for each a A . Thus, K e r ( f , ψ ) ˜ F ˜ A .
The following theorem explains the symmetry part between the kernel of a homomorphism between two groups G and K and the kernel of a soft homomorphism between the soft group F ˜ A over G and the soft group H ˜ B over K .
Theorem 16.
Suppose that F ˜ A is soft group over G and H ˜ B is a soft group over the group K . We assume that ( f , ψ ) is a soft homomorphism that maps F ˜ A to H ˜ B . If K e r f = { e G } , then K e r ( f , ψ ) = e ˜ G .
Proof. 
Suppose that K e r f = { e G } . Let U ˜ A = K e r ( f , ψ ) then f a ( U ( a ) ) = { e K } for each a A . Therefore, U ( a ) = { e G } for each a A since K e r f = { e G } . Hence, K e r ( f , ψ ) = e ˜ G .
The next example elaborates that the above theorem cannot be reversed.
Example 5.
Consider G = ( S 3 , ) and K = ( Z 2 , ) . Consider that A = { a 1 , a 2 } and B = { b 1 , b 2 } are two sets of parameters. Then, F ˜ A = { ( a 1 , ( 12 ) ) , ( a 2 , ( 13 ) ) } is a soft group over G and H ˜ B = { ( b 1 , Z 2 ) , ( b 2 , Z 2 ) } is a soft group over K . Let ( f , ψ ) be a soft homomorphism from F ˜ A to H ˜ B , where f and ψ are defined as
f ( ( e ) ) = f ( ( 123 ) ) = f ( ( 132 ) ) = 0 ¯   a n d   f ( ( 12 ) ) = f ( ( 13 ) ) = f ( ( 23 ) ) = 1 ¯ , ψ ( a 1 ) = b 1 , ψ ( a 2 ) = b 2 .
We note that K e r f = A 3 and K e r ( f , ψ ) = e ˜ G .
Corollary 1.
Suppose that F ˜ A is soft group over G and H ˜ B is a soft group over the group K . We assume that ( f , ψ ) is a soft homomorphism that maps F ˜ A to H ˜ B . If ( f , ψ ) is a soft isomorphism, then K e r ( f , ψ ) = e ˜ G .
Proof. 
If ( f , ψ ) is a soft isomorphism, then f is a monomorphism from G to K . Then, by a fact in basic group theory, K e r f = { e G } . Therefore, by Theorem 16, K e r ( f , ψ ) = e ˜ G .
Theorem 17.
Suppose that F ˜ A is soft group over G and H ˜ B is a soft group over the group K . We assume that ( f , ψ ) is a soft isomorphism that maps F ˜ A to H ˜ B . Then, ( f 1 , ψ 1 ) is a soft isomorphism from H ˜ B to F ˜ A .
Proof. 
Since f : G K is a group isomorphism, then f 1 : K G is an isomorphism of groups. Also, since ψ is a bijection mapping, there exists a bijection map ψ 1 : B A . Therefore,
f 1 ( H ( b ) ) = f 1 ( H ( ψ ( a ) ) ) , sin ce ψ is bijection , let ψ ( a ) = b = f 1 ( f ( F ( a ) ) ) , sin ce ( f , ψ ) is a soft isomorphism = F ( a ) , sin ce f 1 f = i d G : G G = F ( ψ 1 ( b ) ) , sin ce ψ ( a ) = b .
for each b B . Hence, ( f 1 , ψ 1 ) is a soft isomorphism from H ˜ B to F ˜ A . □
Remark 4.
A soft identity map is a pair ( i d G , i d A ) , where i d G : G G and i d A : A A such that i d G ( g ) = g for each g G and i d A ( a ) = a for each a A . Therefore, it is clear that ( i d G , i d A ) is a soft isomorphism that maps F ˜ A to itself, where F ˜ A is a soft group over G .
Theorem 18.
Let Ω be the set of soft groups. Then, the relation ≃ is an equivalence relation on Ω .
Proof. 
  • Suppose that F ˜ A is any soft group over G . By Remark 4, ( i d G , i d A ) is a soft isomorphism that maps F ˜ A to itself. Then, F ˜ A F ˜ A . Therefore, the relation ≃ is a reflexive relation.
  • Suppose that F ˜ A is a soft group over G and H ˜ B is a soft group over the group K . We assume that F ˜ A H ˜ B . Then, there exists a soft isomorphism ( f , ψ ) from F ˜ A to H ˜ B . By Theorem 17, ( f 1 , ψ 1 ) is a soft isomorphism that maps H ˜ B to F ˜ A . Therefore, the relation ≃ is a symmetric relation.
  • Suppose that F ˜ A , H ˜ B and U ˜ C are soft groups over the groups G , K and S , respectively. We assume that F ˜ A H ˜ B and H ˜ B U ˜ C . Then, there exist a soft isomorphism ( f , ψ ) from F ˜ A to H ˜ B and a soft isomorphism ( f 1 , ψ 1 ) from H ˜ B to U ˜ C . Since f and f 1 are isomorphisms of groups then f 1 f is an isomorphism from G to S. Similarly, since ψ and ψ 1 are bijection mappings then ψ 1 ψ is a bijection mapping from A to C . Moreover,
    f 1 f ( F ( a ) ) = f 1 ( f ( F ( a ) ) ) = f 1 ( H ( ψ ( a ) ) ) , sin ce ( f , ψ ) is a soft isomorphism = U ( ψ 1 ( ψ ( a ) ) ) , sin ce ( f 1 , ψ 1 ) is a soft isomorphism = U ( ( ψ 1 ψ ) ( a ) )
    for each a A . Thus, ( f 1 f , ψ 1 ψ ) is a soft isomorphism from F ˜ A to U ˜ C . Therefore, the relation ≃ is a transitive relation.
Hence, the relation ≃ is an equivalence relation on Ω .
Theorem 19.
Suppose that F ˜ A is soft group over a finite group G . Assuming that Ψ f , ψ : S S ( G ) A S S ( K ) B , where f : G K is a group isomorphism and ψ : A B is a bijection mapping. Then, | F ˜ A | = | Ψ f , ψ ( F ˜ A ) | .
Proof. 
Suppose that | F ˜ A | = n , F ( a ) n = { e G } for each a A . By the definition of Ψ f , ψ , Ψ f , ψ ( F ˜ A ) ( b ) = f ( F ( ψ 1 ( b ) ) ) for each b B . Since f is an isomorphism of groups, | f ( F ( ψ 1 ( b ) ) ) | = | F ( ψ 1 ( b ) ) | for each b B . Thus, | Ψ f , ψ ( F ˜ A ) | = n . Now, if | Ψ f , ψ ( F ˜ A ) | = m , then f ( F ( ψ 1 ( b ) ) ) m = { e K } for each b B . Since f is an isomorphism of groups, F ( ψ 1 ( b ) ) m = { e G } for each a A . Then, n m since n is the exponent of F ˜ A . This proves the theorem. □
Theorem 20.
Suppose that F ˜ A is a soft group over an infinite group G. Assuming that Ψ f , ψ : S S ( G ) A S S ( K ) B , where f : G K is a group isomorphism and ψ : A B is a bijection mapping. Then, | F ˜ A | = | Ψ f , ψ ( F ˜ A ) | .
Proof. 
Since the order of F ˜ A is equal to the number of its elements and ( f , ψ ) is a soft isomorphism then it is clear that | F ˜ A | = | Ψ f , ψ ( F ˜ A ) | .
Theorem 21.
Every cyclic soft group over a finite cyclic group of order n is a soft isomorphic to a soft group over additive group Z n .
Proof. 
We assume that G = g is a cyclic group of order n . Then, by a fact in the basic group theory, there exists a group isomorphism, f : Z n G defined by f ( k ¯ ) = g k . Let ψ : B A be any bijection map between two sets of parameters. Therefore, for any soft group F ˜ A = { ( ψ ( b ) , g k ) : k < n for all b B } over G, there exists a soft group H ˜ B = { ( b , k ¯ ) : k < n for all b B } over Z n . This yields that f is a group isomorphism, ψ is a bijection map and
f ( H ( b ) ) = f ( k ¯ ) = g k = F ( ψ ( b ) )
for each b B . Hence, H ˜ B is a soft isomorphic to F ˜ A .
Theorem 22.
Every cyclic soft group over an infinite cyclic group is a soft isomorphic to a soft group over additive group Z .
Proof. 
It is similar to the proof Theorem 21. □
Theorem 23.
Suppose that F ˜ A is soft group over G and H ˜ B is a soft group over the group K . We assume that Ψ f , ψ : S S ( G ) A S S ( K ) B , where f : G K and ψ : A B are mappings. If ( f , ψ ) is a soft isomorphism, then Ψ f , ψ Ψ f , ψ 1 ( H ˜ B ) = H ˜ B and Ψ f , ψ 1 Ψ f , ψ ( F ˜ A ) = F ˜ A , where Ψ f , ψ 1 = Ψ f 1 , ψ 1 .
Proof. 
Since ( f , ψ ) is a soft isomorphism, f is a group isomorphism and ψ is a bijection mapping. Then, by Theorem 1, Ψ f , ψ Ψ f , ψ 1 ( H ˜ B ) = H ˜ B and Ψ f , ψ 1 Ψ f , ψ ( F ˜ A ) = F ˜ A .
Definition 25.
Suppose that F ˜ A is a soft group over G. Let f : G G and ψ : A A be two mappings.
  • A pair ( f , ψ ) is said to be a soft endomorphism if ( f , ψ ) is a soft homomorphism.
  • A pair ( f , ψ ) is said to be a soft automorphism if ( f , ψ ) is a soft isomorphism.
Definition 26.
Suppose that F ˜ A is a soft group over G . Let f : G G and ψ : A A be two mappings. Then, a pair ( f , ψ ) is said to be a soft inner automorphism if the pair ( f , ψ ) is a soft automorphism and f I n n ( G ) . The collection of all soft inner automorphisms is symbolized by I n n ( F ˜ A ) .
The next results demonstrate that the collection of all soft automorphism of any soft group over a group G forms a group and the collection of all soft inner automorphism forms a normal subgroup of it.
Theorem 24.
Suppose that F ˜ A is a soft group over G . Let
A u t ( F ˜ A ) = { ( f , ψ ) : ( f , ψ )   is a soft automorphism from   F ˜ A   to itself } .
Then, ( A u t ( F ˜ ) , ) is a group, where the operation ∘ is defined as
( f , ψ ) ( f 1 , ψ 1 ) = ( f f 1 , ψ ψ 1 ) .
Proof. 
Let ( f , ψ ) , ( f 1 , ψ 1 ) A u t ( F ˜ A ) . We show that ( f , ψ ) ( f 1 , ψ 1 ) A u t ( F ˜ ) . Since f and f 1 are isomorphisms of groups, f f 1 is an isomorphism of groups. Also, since ψ and ψ 1 are bijection, ψ ψ 1 is a bijection mapping. We need to show that f f 1 ( F ( a ) ) = F ( ( ψ ψ 1 ) ( a ) ) for each a A . Then,
f f 1 ( F ( a ) ) = f ( f 1 ( F ( a ) ) ) = f ( F ( ψ 1 ( a ) ) ) , sin ce ( f 1 , ψ 1 ) is a soft isomorphism = F ( ψ ( ψ 1 ( a ) ) ) , sin ce ( f , ψ ) is a soft isomorphism = F ( ( ψ ψ 1 ) ( a ) )
for each a A . Hence, ( f , ψ ) ( f 1 , ψ 1 ) A u t ( F ˜ ) . Since the function compositions always associative, A u t ( F ˜ ) has the associative property. By Remark 4, ( i d G , i d A ) A u t ( F ˜ A ) . It is clear that ( f , ψ ) ( i d G , i d A ) = ( i d G , i d A ) ( f , ψ ) = ( f , ψ ) . Hence, ( i d G , i d A ) is an identity element in A u t ( F ˜ ) . By Theorem 17, if ( f , ψ ) A u t ( F ˜ A ) , then ( f 1 , ψ 1 ) A u t ( F ˜ A ) . It is clear that ( f , ψ ) ( f 1 , ψ 1 ) = ( f 1 , ψ 1 ) ( f , ψ ) = ( i d G , i d A ) . Hence, ( A u t ( F ˜ A ) , ) is a group. □
Theorem 25.
Suppose that F ˜ A is a soft group over G . Then, I n n ( F ˜ A ) is a normal subgroup of A u t ( F ˜ A ) .
Proof. 
It is clear that ( i d G , i d A ) I n n ( F ˜ A ) then I n n ( F ˜ A ) . Let ( f x , ψ 1 ) , ( f y , ψ 2 ) I n n ( F ˜ A ) , where x , y G . By a fact in the basic group theory, f x f y 1 I n n ( G ) and ψ 1 ψ 2 1 is a bijection map since ψ 1 and ψ 2 are bijection mappings. It remains to show that f x f y 1 ( F ( a ) ) = F ( ( ψ 1 ψ 2 1 ) ( a ) ) . Then,
f x f y 1 ( F ( a ) ) = f x ( f y 1 ( F ( a ) ) ) = f x ( F ( ψ 2 1 ( a ) ) ) , sin ce ( f y 1 , ψ 2 1 ) is a soft automorphism = F ( ψ 1 ( ψ 2 1 ( a ) ) ) , sin ce ( f x , ψ 1 ) is a soft automorphism = F ( ( ψ 1 ψ 2 1 ) ( a ) )
for each a A . Therefore, ( f x , ψ 1 ) ( f y 1 , ψ 2 1 ) I n n ( F ˜ A ) . Hence, I n n ( F ˜ A ) is a subgroup of A u t ( F ˜ A ) . Now, let ( f , ψ ) A u t ( F ˜ ) and ( f x , ψ 1 ) I n n ( F ˜ ) . Then, f f x f 1 I n n ( G ) and ψ ψ 1 ψ 1 is a bijection mapping. It is clear that f f x f 1 ( F ( a ) ) = F ( ( ψ ψ 1 ψ ) ( a ) ) for all a A . Hence, I n n ( F ˜ A ) is a normal subgroup of A u t ( F ˜ A ) .
Theorem 26.
Suppose that F ˜ A is a soft group over G . If ( f , ψ ) A u t ( F ˜ A ) , where f ( g ) = g 1 for each g G , then F ˜ A is an abelian soft group over G.
Proof. 
We assume that ( f , ψ ) A u t ( F ˜ A ) , where f ( g ) = g 1 for each g G . Then, f A u t ( G ) . By a fact in the basic group theory, G is an abelian group. Hence, F ˜ A is an abelian soft group over G .
Here is an example to point out that the reverse of the above theorem does not hold in general.
Example 6.
Consider G = S 3 and F ˜ A = { ( a 1 , ( 123 ) ) , ( a 2 , ( 12 ) ) , ( a 3 , ( 13 ) ) } is an abelian soft group over G. Let f A u t ( G ) such that f ( g ) = g 1 for all g G . We define the map ψ : A A as
ψ ( a 1 ) = a 1 , ψ ( a 2 ) = a 3   a n d   ψ ( a 3 ) = a 2 ,
where A = { a 1 , a 2 , a 3 } . Then, f ( F ( a 2 ) ) = F ( a 2 ) and F ( a 2 ) F ( ψ ( a 2 ) ) . Hence, ( f , ψ ) A u t ( F ˜ A ) .
Theorem 27.
Suppose that F ˜ A is a soft group over G . Then, F ˜ A is a normalistic soft group over G if and only if ( f g , i d A ) I n n ( F ˜ A ) for each g G .
Proof. 
Necessity. Suppose that F ˜ A is a normalistic soft group over G . For each g G , we have f g I n n ( G ) and i d A is a bijection map. Since F ˜ A is normalistic soft group over G, then f g ( F ( a ) ) = F ( a ) = F ( ψ ( a ) ) for each g G and for each a A . Hence, ( f g , i d A ) I n n ( F ˜ A ) for all g G .
Sufficiency. It is clear. □
Theorem 28.
Suppose that F ˜ A is soft group over G and H ˜ B is a soft group over the group K . Let Ψ f , ψ : S S ( G ) A S S ( K ) B , where f : G K and ψ : A B are mappings. If ( f , ψ ) is a soft isomorphism then ( f ( F ˜ A ) , ψ ( A ) ) = Ψ f , ψ ( F ˜ A ) , where ( f ( F ˜ A ) , ψ ( A ) ) = { ( ψ ( a ) , f ( F ( a ) ) : for each a A } .
Proof. 
By the definition of Ψ f , ψ , Ψ f , ψ ( F ˜ A ) ( b ) = f ( F ( ψ 1 ( b ) ) ) for each b B . Then, Ψ f , ψ ( F ˜ A ) = { ( b , f ( F ( ψ 1 ( b ) ) ) : for each b B } . Since ψ is a bijection map, we take ψ 1 ( b ) = a . Therefore, Ψ f , ψ ( F ˜ A ) = { ( ψ ( a ) , f ( F ( a ) ) ) : for each a A } . This proves the theorem. □
Now, we study a new type of soft group which is called soft point groups.
Definition 27.
Suppose that F ˜ A is a soft group over G . Then, F ˜ A is said to be a soft point group over G , symbolized by F ˜ a , if F ( a ) = H G and F ( b ) = { e G } for each b A { a } .
Example 7.
Consider G = S 3 and A = { ( e ) , ( 12 ) } . We define F : A P ( G ) as
F ( x ) = { y S 3 : x R y y x } ,
where R is a relation that connects an element from the set A to an element of G . Then,
F ( e G ) = { e G }   a n d   F ( ( 12 ) ) = ( 12 ) .
Thus, F ˜ ( 12 ) is a soft point group over G .
From now, F ˜ a and H ˜ b are referred to as soft point groups with respect to the set of parameters A and B, respectively.
Theorem 29.
Suppose that F ˜ a and H ˜ b are two soft point groups over G . If A B , then the restricted intersection of F ˜ a and H ˜ b is either a soft point group over G or equal to the identity soft group.
Proof. 
Since F ˜ a and H ˜ b are soft point groups over G, then
F ˜ a ˜ H ˜ b = e ˜ G if a b , L ˜ a if a = b ,
where L ( a ) = F ( a ) H ( a ) . Therefore, if a b , then F ˜ a ˜ H ˜ b = e ˜ G and if a = b , then F ˜ a ˜ H ˜ b is a soft point group over G since the intersection of F ( a ) and H ( b ) is a subgroup of G. □
Theorem 30.
Suppose that F ˜ a and H ˜ b are two soft point groups over G . If a b , then the union (extended union) of F ˜ a and H ˜ b is a soft group over G .
Proof. 
Suppose that a b . We assume that F ˜ a ˜ H ˜ b = L ˜ . Then,
L ( x ) = { e G } if x a b , F ( x ) if x = a , H ( x ) if x = b .
Therefore, F ˜ a ˜ H ˜ b is a soft group over G since F ( a ) and H ( b ) are subgroups of G .
The next example demonstrates that if a = b , then the union (extended union) of two soft point groups F ˜ a and H ˜ a over G may not be a soft group.
Example 8.
Consider G = S 3 . Let F ˜ a = { ( a , ( 12 ) ) , ( d , { e G } ) } and H ˜ a = { ( a , ( 13 ) ) , ( c , { e G } ) } be two soft point groups over G . It is clear that F ˜ a ˜ H ˜ b is not a soft group over G since F ( a ) H ( a ) is not a subgroup of G .
Remark 5.
From the above example, we note that if a = b , then the union (extended union) of two soft point groups F ˜ a and H ˜ a over G is a soft point group over G if and only if F ( a ) H ( a ) or H ( a ) F ( a ) .
Theorem 31.
Suppose that F ˜ a is a soft point group over G. We assume that f is a monomorphism from G to the group K . Then, ( f ( F ˜ a ) , ψ ( A ) ) is a soft point group over K , where ψ is any mapping from A to any set of parameters.
Proof. 
Since f is a monomorphism from G to K, f ( { e G } ) = { e K } and f ( F ( a ) ) is a subgroup of K . Thus, ( f ( F ˜ a ) , ψ ( A ) ) is a soft point group over the group K. □
Theorem 32.
Suppose that F ˜ a is a soft point group over G .
1. 
If H ( a ) F ( a ) , then H ˜ a ˜ F ˜ a and if H ( a ) F ( a ) , then H ˜ a ˜ F ˜ a .
2. 
If F ( a ) is a normal subgroup of G , then F ˜ a is a normalistic soft group over G .
3. 
If F ( a ) is an abelian subgroup of G , then F ˜ a is an abelian soft group over G .
4. 
If F ( a ) is a cyclic subgroup of G , then F ˜ a is a cyclic soft group over G .
5. 
| F ˜ a | = | F ( a ) | .
6. 
[ F ˜ a , F ˜ a ] is a soft point group over G . If F ( a ) is an abelian subgroup of G, then [ F ˜ a , F ˜ a ] = e ˜ G .
7. 
Z ( F ˜ a ) is either a soft point group over G or equal to the identity soft group.
Proof. 
It is straightforward. □
Theorem 33.
Suppose that F ˜ a is a soft point group over G and H ˜ b is a soft point group over the group K . If ( f , ψ ) is a soft isomorphism from F ˜ a to H ˜ b , then ψ ( a ) = b .
Proof. 
Suppose that ( f , ψ ) is a soft isomorphism from F ˜ a to H ˜ b . Then, f is an isomorphism from G to K . This implies that
f ( F ( a ) ) = N K   and   f ( F ( a 1 ) ) = { e K }   for all   a 1 a .
Therefore, since ( f , ψ ) is a soft isomorphism from F ˜ a to H ˜ b , f ( F ( a ) ) = H ( ψ ( a ) ) and f ( F ( a 1 ) ) = H ( ψ ( a 1 ) ) for all a 1 a . Hence, if H ( b ) { e K } , then we must have ψ ( a ) = b . □
Theorem 34.
Suppose that F ˜ a is a soft point group over G and H ˜ b is a soft point group over the group K . Then, ( f , ψ ) is a soft isomorphism maps F ˜ a to H ˜ b if and only if the following conditions are met:
  • f is a group isomorphism from G to K;
  • ψ is a bijection mapping from A to B;
  • ψ ( a ) = b and f ( F ( a ) ) = H ( b ) .
Proof. 
It is straightforward. □
Theorem 35.
Suppose that F ˜ a is a soft point group over G . If ψ is a bijection mapping from A to itself such that ψ ( a ) = a , then ( f g , ψ ) I n n ( F ˜ a ) for all g F ( a ) .
Proof. 
We assume that F ˜ a is a soft point group over G . Let f g I n n ( G ) , g F ( a ) . Then, f g ( F ( a ) ) = F ( a ) for each g F ( a ) . Since ψ ( a ) = a , f g ( F ( a ) ) = F ( ψ ( a ) ) . Hence, ( f g , ψ ) I n n ( F ˜ a ) for each g F ( a ) .
Theorem 36.
Suppose that F ˜ a is a soft point group over G . Let ψ be a bijection mapping from A to itself such that ψ ( a ) = a . Then, F ( a ) is a normal subgroup of G if and only if ( f g , ψ ) I n n ( F ˜ a ) for each g G .
Proof. 
Necessity. We assume that F ( a ) is a normal subgroup of G . Then, f g ( F ( a ) ) = F ( a ) for each g G , where f g I n n ( G ) . Thus, f g ( F ( a ) ) = F ( ψ ( a ) ) since ψ ( a ) = a . Therefore, ( f g , ψ ) I n n ( F ˜ a ) for each g G .
Sufficiency. Let ( f g , ψ ) I n n ( F ˜ a ) for each g G . Then, f g ( F ( a ) ) = g F ( a ) g 1 = F ( a ) = F ( ψ ( a ) ) for each g G . Hence, F ( a ) is a normal subgroup of G .

4. Characteristic Soft Subgroup

This section introduces the concept of characteristic soft subgroups of a given soft group over the group G. Also, we study the features of these soft subgroups. The notations are the same as in Section 2.2.
Definition 28.
Suppose that F ˜ A is a soft group over G and H ˜ A ˜ F ˜ A . Then, H ˜ A is said to be a characteristic soft subgroup of F ˜ A , symbolized by H ˜ A c h a r s F ˜ A , if for any soft automorphism ( f , ψ ) A u t ( F ˜ A ) , we have ( f ( H ˜ A ) , ψ ( A ) ) = H ˜ A .
Remark 6.
By Theorem 28, we have Ψ f , ψ ( H ˜ A ) = ( f ( H ˜ A ) , ψ ( A ) ) . Then, H ˜ A c h a r s F ˜ A if Ψ f , ψ ( H ˜ A ) = H ˜ A .
Example 9.
1. 
e ˜ G   c h a r s   F ˜ A , for each soft group F ˜ A over G .
2. 
F ˜ A   c h a r s   F ˜ A , for each soft group F ˜ A over G .
3. 
Z ( G ˜ A )   c h a r s   G ˜ A .
Theorem 37.
Suppose that F ˜ A is a soft group over G and H ˜ A ˜ F ˜ A . If Ψ f , ψ ( H ˜ A ) ˜ H ˜ A for every soft automorphism ( f , ψ ) A u t ( F ˜ A ) , then H ˜ A c h a r s F ˜ A .
Proof. 
Let ( f , ψ ) A u t ( F ˜ A ) . By Theorem 17, ( f 1 , ψ 1 ) A u t ( F ˜ A ) . Therefore, Ψ f , ψ 1 ( H ˜ A ) ˜ H ˜ A by the assumption. By applying Ψ f , ψ , we have
Ψ f , ψ Ψ f , ψ 1 ( H ˜ A ) ˜ Ψ f , ψ ( H ˜ A ) .
By Theorem 23, we obtain H ˜ A ˜ Ψ f , ψ ( H ˜ A ) . Then, we obtain Ψ f , ψ ( H ˜ A ) = H ˜ A . Hence, H ˜ A is a characteristic soft subgroup of F ˜ A .
Theorem 38.
Suppose that F ˜ A is a soft group over G and H ˜ A ˜ F ˜ A . Then, H ˜ A c h a r s F ˜ A if and only if for each ( f , ψ ) A u t ( F ˜ A ) , f ( H ( a ) ) = H ( ψ ( a ) ) for each a A .
Proof. 
Necessity. We assume that H ˜ A c h a r s F ˜ A . Then, ( f ( H ˜ A ) , ψ ( A ) ) = H ˜ A for each ( f , ψ ) A u t ( F ˜ A ) . Therefore, for each a A , we have ( f ( H ( a ) ) , ψ ( a ) ) = ( H ( ψ ( a ) ) , ψ ( a ) ) . Hence, f ( H ( a ) ) = H ( ψ ( a ) ) for each a A .
Sufficiency. We assume that f ( H ( a ) ) = H ( ψ ( a ) ) for each a A and for each ( f , ψ ) A u t ( F ˜ A ) . Therefore,
( f ( H ˜ A ) , ψ ( A ) ) = { ( f ( H ( a ) ) , ψ ( a ) ) : for all a A } = { ( H ( ψ ( a ) ) , ψ ( a ) ) : for all a A } , sin ce f ( H ( a ) ) = H ( ψ ( a ) ) for all a A = H ˜ A .
Thus, H ˜ A c h a r s F ˜ A .
Theorem 39.
Suppose that F ˜ A is a normalistic soft group over G and H ˜ A c h a r s F ˜ A . Then, H ˜ A is a normalistic soft group over G and H ˜ A ˜ F ˜ A .
Proof. 
We assume that F ˜ A is a normalistic soft group over G . By Theorem 27, ( f g , i d A ) I n n ( F ˜ A ) for each g G . By Theorem 38, for each a A , f g ( H ( a ) ) = H ( i d A ( a ) ) for each g G . Therefore, we have for each a A , g H ( a ) g 1 = H ( a ) for each g G . Thus, H ˜ A is a normalistic soft group over G . Since H ( a ) F ( a ) for each a A , H ˜ A ˜ F ˜ A .
If F ˜ A is a normalistic soft group over G and H ˜ A ˜ F ˜ A , then H ˜ A is not necessarily a characteristic soft subgroup of F ˜ A as the next example shows.
Example 10.
Consider G = Q is an additive group of rational numbers. Then, F ˜ A = { ( a , Q ) , ( b , Q ) } is a normalistic soft group over G and H ˜ A = { ( a , Z ) , ( b , Z ) } is a soft normal subgroup of F ˜ A . We have ( f , i d A ) A u t ( F ˜ A ) , where f : Q Q is defined as f ( q ) = q 2 for all q Q . It is clear that ( f ( H ˜ A ) , i d A ) H ˜ A . Thus, H ˜ A is not a characteristic soft subgroup of F ˜ A .
Theorem 40.
Suppose that F ˜ A is a soft group over G and F ˜ A c h a r s G ˜ A . If H ˜ A is a unique soft subgroup of F ˜ A , then H ˜ A c h a r s F ˜ A .
Proof. 
Let ( f , ψ ) A u t ( G ˜ A ) . Then, ( f ( F ˜ A ) , ψ ( A ) ) = F ˜ A = Ψ f , ψ ( F ˜ A ) since F ˜ A c h a r s G ˜ A . Therefore, by Theorem 38, f ( F ( a ) ) = F ( ψ ( a ) ) for each a A . So, ( f , ψ ) A u t ( F ˜ A ) . By Theorem 2, Ψ f , ψ ( H ˜ A ) ˜ Ψ f , ψ ( F ˜ A ) = F ˜ A . Then, Ψ f , ψ ( H ˜ A ) = H ˜ A since H ˜ A is a unique soft subgroup of F ˜ A and | H ˜ A | = | Ψ f , ψ ( H ˜ A ) | . Hence, H ˜ A c h a r s F ˜ A .
Theorem 41.
Suppose that F ˜ A , H ˜ A and K ˜ A are soft groups over G. If H ˜ A c h a r s K ˜ A and K ˜ A c h a r s F ˜ A , then H ˜ A c h a r s F ˜ A .
Proof. 
Since H ˜ A c h a r s K ˜ A , ( f ( H ˜ A ) , ψ ( A ) ) = H ˜ A for each ( f , ψ ) A u t ( K ˜ A ) . Similarly, ( f 1 ( K ˜ A ) , ψ 1 ( A ) ) = K ˜ A for each ( f 1 , ψ 1 ) A u t ( F ˜ A ) since K ˜ A c h a r s F ˜ A . By Theorem 38, f 1 ( K ( a ) ) = K ( ψ 1 ( a ) ) for each a A . Therefore, ( f 1 , ψ 1 ) A u t ( K ˜ A ) and ( f 1 ( H ˜ A ) , ψ 1 ( A ) ) = H ˜ A . Hence, H ˜ A c h a r s F ˜ A .
Theorem 42.
Suppose that F ˜ A is a soft group over G . If H ˜ A c h a r s F ˜ A and K ˜ A c h a r s F ˜ A , then [ H ˜ A , K ˜ A ] c h a r s F ˜ A .
Proof. 
Let L ˜ A = [ H ˜ A , K ˜ A ] = { ( a , [ H ( a ) , K ( a ) ] ) : for each a A } . Let ( f , ψ ) A u t ( F ˜ A ) . Then,
f ( L ( a ) ) = f ( [ H ( a ) , K ( a ) ] ) = [ f ( H ( a ) ) , f ( K ( a ) ) ] , by a fact in basic group theory = [ H ( ψ ( a ) ) , K ( ψ ( a ) ) ] , sin ce H ˜ A c h a r s F ˜ A and K ˜ A c h a r s F ˜ A = L ( ψ ( a ) )
for each a A . Hence, by Theorem 38, L ˜ A c h a r s F ˜ A .
Corollary 2.
Suppose that F ˜ A is a soft group over G . Then, [ F ˜ A , F ˜ A ] c h a r s F ˜ A .
Theorem 43.
Suppose that F ˜ A is a soft group over G. Then, for any collection of characteristic soft subgroups of F ˜ A , their restricted intersection is a characteristic soft subgroup of F ˜ A .
Proof. 
Suppose that Δ is a collection of characteristic soft subgroups of F ˜ A . Let N ˜ = ˜ H ˜ A Δ H ˜ A . Let ( f , ψ ) A u t ( F ˜ A ) . Then,
Ψ f , ψ ( N ˜ A ) ˜ Ψ f , ψ ( H ˜ A ) , for each H ˜ A Δ = H ˜ A , for each H ˜ A Δ sin ce H ˜ A c h a r s F ˜ A .
Therefore, Ψ f , ψ ( N ˜ ) ˜ ˜ H ˜ A Δ H ˜ A . Thus, Ψ f , ψ ( N ˜ ) ˜ N ˜ . By Theorem 37, N ˜ c h a r s F ˜ A .
It can be seen in the next results the properties of the characteristic soft subgroups of a given soft point group over G. We note that these properties may not hold in the soft group.
Theorem 44.
Suppose that F ˜ a is a soft point group over G and H ˜ a c h a r s F ˜ a . Then, H ˜ a is a soft normal subgroup of F ˜ a .
Proof. 
Since H ˜ a c h a r s F ˜ a , ( f ( H ˜ a ) , ψ ( A ) ) = H ˜ a for each ( f , ψ ) A u t ( F ˜ a ) . By Theorem 33, we have ψ ( a ) = a . From Theorem 35, we have ( f g , ψ ) I n n ( F ˜ a ) A u t ( F ˜ a ) for each g F ( a ) . Then, ( f g ( H ˜ a ) , ψ ( A ) ) = H ˜ a for each g F ( a ) . Therefore, f g ( H ( a ) ) = g H ( a ) g 1 = H ( ψ ( a ) ) for all g F ( a ) . Thus, H ( a ) F ( a ) . Hence, by Theorem 32, H ˜ a is a soft normal subgroup of F ˜ a .
The reverse of the above theorem is generally not true, as illustrated in the next example.
Example 11.
Consider G = Q is an additive group of rational numbers. Then, F ˜ A = { ( a , Q ) , ( b , { e G } ) } is a soft point group over G . Then, H ˜ A = { ( a , Z ) , ( b , { e G } ) } is a soft normal subgroup of F ˜ A but not a characteristic soft subgroup of F ˜ a for the same reason as in Example 10.
Theorem 45.
Assuming that F ˜ A is a soft group over G . Then, Z ( F ˜ a ) c h a r s F ˜ a .
Proof. 
Let H ˜ a = Z ( F ˜ a ) = { ( a , Z ( F ( a ) ) ) : for each a A } . Let ( f , ψ ) A u t ( F ˜ a ) . By Theorem 33, ψ ( a ) = a . Therefore, f ( F ( a ) ) = F ( a ) . Thus, f ( H ( a ) ) = H ( a ) since H ( a ) = Z ( F ( a ) ) and Z ( F ( a ) ) is a characteristic subgroup of F ( a ) . Hence, f ( H ( a ) ) = H ( ψ ( a ) ) for each a A . By Theorem 38, H ˜ a c h a r s F ˜ a .
Theorem 46.
Suppose that F ˜ a is a soft point group over G . If H ˜ a is a cyclic soft subgroup of F ˜ a , then H ˜ a c h a r s F ˜ a .
Proof. 
It is similar to the proof of Theorem 45. □
Theorem 47.
Suppose that F ˜ a is a soft point group over G . If H ˜ a is a unique soft subgroup of F ˜ a , then H ˜ a c h a r s F ˜ a .
Proof. 
We assume that H ˜ a is a unique soft subgroup of F ˜ a ; then, H ( a ) is a unique subgroup of F ( a ) . Let ( f , ψ ) A u t ( F ˜ a ) . By Theorem 33, ψ ( a ) = a . Therefore, f ( F ( a ) ) = F ( a ) . By a fact in basic group theory, f ( H ( a ) ) = H ( a ) since H ( a ) is a unique subgroup of F ( a ) . Hence, f ( H ( a ) ) = H ( ψ ( a ) ) for each a A . By Theorem 38, H ˜ a c h a r s F ˜ a .
Theorem 48.
Suppose that F ˜ a is a soft point group over G . Let ψ be any bijection mapping from A to itself such that ψ ( a ) = a . If H ˜ a is a soft normal subgroup of F ˜ a and K ˜ a c h a r s H ˜ a , then K ˜ a is a soft normal subgroup of F ˜ a
Proof. 
Let g F ( a ) . By Theorem 35, ( f g , ψ ) A u t ( F ˜ a ) . Since H ˜ a ˜ F ˜ a , g H ( a ) g 1 = H ( a ) = H ( ψ ( a ) ) . Therefore, ( f g , ψ ) A u t ( H ˜ a ) . Therefore, ( f g ( K ˜ a ) , ψ ( A ) ) = K ˜ a since K ˜ a c h a r s H ˜ a . Then, f g ( K ( a ) ) = g K ( a ) g 1 = K ( ψ ( a ) ) = K ( a ) . Since g is an arbitrary element of F ( a ) and g K ( a ) g 1 = K ( a ) , K ( a ) F ( a ) . By Theorem 32, K ˜ a ˜ F ˜ a .

5. Conclusions

In this paper, we have studied new concepts in the soft group theory with their results such as the center of the soft group, the kernel of soft homomorphism and soft automorphism. The soft point group as a type of soft group has been introduced with its basic properties. We have extended the concept of characteristic subgroups to include soft groups. We have studied the equivalent definitions to the definition of characteristic soft subgroups. We have studied the properties of characteristic soft subgroups. In addition, we have investigated the characteristic soft subgroups of a soft point group. In future work, more concepts and results related to characteristic subgroups in group theory could be analogously presented in the soft group theory. In addition, we plan to study many applications of characteristic soft subgroups in actions of soft groups, soft representation of soft groups and soft topological groups. Also, we plan to build more theory and to investigate some crucial relationships with advanced group theory in this setting.

Author Contributions

Conceptualization, A.I.A. and A.M.A.; Methodology, A.I.A.; Validation, A.I.A.; Investigation, A.I.A.; Writing—original draft preparation, A.I.A.; Writing—review and editing, A.I.A.; Supervision, A.M.A. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Molodtsov, D. Soft set theory-first results. Comput. Math. Appl. 1999, 37, 19–31. [Google Scholar] [CrossRef] [Green Version]
  2. Zadeh, L. Fuzzy sets. Inf. Control. 1965, 8, 338–353. [Google Scholar] [CrossRef] [Green Version]
  3. Pawlak, Z. Rough sets. Int. J. Inform. Comput. Sci. 1982, 11, 341–356. [Google Scholar] [CrossRef]
  4. Maji, P.K.; Roy, A.R.; Biswas, R. An application of soft sets in a decision making problem. Comput. Math. Appl. 2002, 44, 1077–1083. [Google Scholar] [CrossRef] [Green Version]
  5. Maji, P.K.; Biswas, R.; Roy, A.R. Soft set theory. Comput. Math. Appl. 2003, 45, 555–562. [Google Scholar] [CrossRef] [Green Version]
  6. Min, W.K. A note on soft topological spaces. Comput. Math. Appl. 2011, 62, 3524–3528. [Google Scholar] [CrossRef] [Green Version]
  7. 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] [Green Version]
  8. Zorlutuna, I.; Akdag, M.; Min, W.K.; Atmaca, S. Remarks on soft topological spaces. Ann. Fuzzy Math. Inf. 2012, 3, 171–185. [Google Scholar]
  9. Rosenfeld, A. Fuzzy groups. J. Math. Anal. Appl. 1971, 35, 512–517. [Google Scholar] [CrossRef] [Green Version]
  10. Biswas, R.; Nanda, S. Rough groups and rough subgroups. Bull. Polish Acad. Sci. Math. 1994, 42, 251. [Google Scholar]
  11. Aktaş, H.; Çağman, N. Soft set and soft groups. Inf. Sci. 2007, 177, 2726–2735. [Google Scholar] [CrossRef]
  12. Sezgin, A.; Atagün, A.O. Soft groups and normalistic soft groups. Comput. Math. Appl. 2011, 62, 685–698. [Google Scholar] [CrossRef] [Green Version]
  13. Aslam, M.; Qurashi, S.M. Some contributions to soft groups. Ann. Fuzzy Math. Inf. 2012, 4, 177–195. [Google Scholar]
  14. Aktaş, H.; Özlü, Ş. Cyclic soft groups and their applications on groups. Sci. World J. 2014, 2014, 5. [Google Scholar] [CrossRef] [PubMed]
  15. Nazmal, S. Some properties of soft groups and fuzzy soft groups under soft mappings. Palest. J. Math. 2019, 8, 189–199. [Google Scholar]
  16. Barzegar, R.; Hosseini, S.B.; Çağman, N. Second type nilpotent soft subgroups. Afr. Math. 2023, 34, 17. [Google Scholar] [CrossRef]
  17. Sidky, F.I.; Mishref, M.A.A. Fully invariant, characteristic and S -fuzzy subgroups. Inf. Sci. 1991, 55, 27–33. [Google Scholar] [CrossRef]
  18. Ajmal, N.; Jahan, I. A study of normal fuzzy subgroups and characteristic fuzzy subgroups of a fuzzy group. Fuzzy Inf. Eng. 2012, 4, 123–143. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Alajlan, A.I.; Alghamdi, A.M. Soft Groups and Characteristic Soft Subgroups. Symmetry 2023, 15, 1450. https://doi.org/10.3390/sym15071450

AMA Style

Alajlan AI, Alghamdi AM. Soft Groups and Characteristic Soft Subgroups. Symmetry. 2023; 15(7):1450. https://doi.org/10.3390/sym15071450

Chicago/Turabian Style

Alajlan, Amlak I., and Ahmad M. Alghamdi. 2023. "Soft Groups and Characteristic Soft Subgroups" Symmetry 15, no. 7: 1450. https://doi.org/10.3390/sym15071450

APA Style

Alajlan, A. I., & Alghamdi, A. M. (2023). Soft Groups and Characteristic Soft Subgroups. Symmetry, 15(7), 1450. https://doi.org/10.3390/sym15071450

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop