The Class Equation and the Commutativity Degree for Complete Hypergroups

: The aim of this paper is to extend, from group theory to hypergroup theory, the class equation and the concept of commutativity degree. Both of them are studied in depth for complete hypergroups because we want to stress the similarities and the differences with respect to group theory, and the representation theorem of complete hypergroups helps us in this direction. We also ﬁnd conditions under which the commutativity degree can be expressed by using the class equation.


Introduction
In a non-abelian group-or, more generally, in a non-abelian algebraic structure-it makes sense to compute the probability that two elements commute. This problem was first addressed by Miller [1] in 1944, when he studied the relative number of non-invariant operators in a group. Later on, Erdös and Turan [2] introduced the concept of commutativity degree as the probability that an arbitrary element x in a finite group G commutes with another arbitrary element y in G, that is, d(G) = |{(x, y) ∈ G × G | xy = yx}| /(|G| 2 ). After that, many studies have been developed to determine some bounds for this degree. For example, Gustafson [3] and MacHale [4] proved independently in 1974 that for a non-abelian finite group G, the commutativity degree d(G) ≤ 5 8 . Other upper bounds for commutativity degree in terms of centralizers have been obtained for the dihedral group D n by Omer et al. [5]. A classification of the groups for which the commutativity degree is above 11/32 was given in 1979 by Rusin [6], while in 2001, Lescot [7] classified the finite groups with d(G) ∈ 1 2 , 1 , just to recall only some of the studies on this topic. The notion of commutativity degree was generalized in different ways later on. For example, the probability that an element of a given subgroup of a finite group commutes with an element of the group was studied in [8], and the probability that the commutator of a pair of elements of a finite group equals a certain given number was investigated in [9]. The notion of the subgroup commutativity degree of finite groups was proposed by Tȃrnȃuceanu [10] as the probability that two subgroups of a given group commute, that is, the probability that the product of two subgroups is again a subgroup.
On the other hand, the concept of commutativity degree can also be studied in other algebraic structures, such as in hypergroups. These are a natural generalization of groups, where the operation is substituted by a hyperoperation, i.e., a function defined on the cartesian product of the support set H with values in P * (H), the family of all non-empty subsets of H. Thus, the result of the combination of two elements from the support set is not just an element, as in the classical algebraic structures, but a nonempty subset of the initial set. The hypergroups were introduced by F. Marty in 1934 with their theoretical meaning: The quotient of a group by any of its normal subgroups is again a group; while considering a non-normal subgroup, the quotient may be endowed with a hypergroup structure. The recently published paper by Massouros [11] presents the course of development from the hypergroup, as it was initially defined by F. Marty, to the hypergroups endowed with more axioms, and this is used nowadays. The theory of algebraic hypercompositional structures, particularly the hypergroups and hyperrings, becomes then a flourishing area of Modern Algebra, and in the last years, more and more studies in algebraic geometry [12][13][14], number theory [15], scheme theory [16], tropical geometry [17], and theory of matroids [18] have highlighted the important role of these structures.
In this paper, in the context of complete hypergroups, we address two correlated problems: the class equation and the commutativity degree. We consider this particular type of hypergroup because, by using their representation theorem, i.e., Theorem 1, we notice that there exists a strong relationship between groups and complete hypergroups. Any complete hypergroup can be obtained using a group, and vice-versa, any group can be viewed as a complete hypergroup. The structure of our study is as follows. First, in Section 2, we fix the notation and terminology, and we recall the basic definitions related with the class equation and commutativity degree in group theory, as well as those related to complete hypergroups, which will be used in the following. The class equation for complete hypergroups is established in Section 3, while in Section 4, we study the commutativity degree for these hypergroups. In addition, we explain that, in order to compute the number of the elements that commute in a finite complete hypergroup, it is necessary to compute the number of the elements that commute in a group, so the commutativity degree of a group influences the commutativity degree of a complete hypergroup (see Theorem 4). This connection is also clearly described with several examples that show that the commutativity degree of a complete hypergroup depends on the decomposition of the hypergroup. Thus, the finite complete hypergroups of a certain cardinality and constructed with the same finite group can have different commutativity degrees. Finally, we calculate the commutativity degree using the conjugacy classes (see Theorem 5)-the same notion used for determining the class equation. The last section contains the conclusions of our study and some open problems related to it.

Preliminaries
In this section, we first recall the basic notions and results about the class equation and commutativity degree in group theory. Most of them are gathered in the M.A. Thesis of Ref. [19]. Secondly, we briefly present a short review of complete hypergroups, since in the next sections, we will determine the class equation and commutativity degree for such hypergroups. For more details regarding the theory of hypergroups, the reader is refereed to the fundamental books of Refs. [20][21][22].

Class Equation and Commutativity Degree for Groups
Let (G, ·) be a group and Z(G) = {a ∈ G | ab = ba, ∀b ∈ G} be the center of the group G. Definition 1. Ref. [19] We say that two elements a and b are conjugated in G, denoted here by a ∼ G b, if there exists g ∈ G such that a = g −1 bg.
The relation ∼ G is an equivalence relation, and the equivalence class of each element a ∈ G, i.e., [a] = {b ∈ G | ∃g ∈ G : b = gag −1 }, is called the conjugacy class of a. For a finite group G, denote by k(G) the number of distinct conjugacy classes of G, i.e., G = We may recall now the famous class equation in group theory: The class equation can be related to another important notion in group theory, one of commutativity degree, which represents the probability that two elements of a group commute [3]. It is defined as follows: Let us enumerate some properties of the commutativity degree d(G) [19]: The function d(G) is multiplicative, i.e., d( , for any two finite groups G 1 and G 2 . 5. d(G) = k(G) |G| .

Complete Hypergroups
Let (H, •) be a hypergroupoid, that is, a nonempty set H endowed with a multi-valued operation • : H × H −→ P * (H) (also called hyperoperation), where by P * (H), we denote the family of nonempty subsets of H. For any nonempty subsets A, B ⊆ H, we denote In any group, there exists only one identity, and each element has a unique inverse. This property does not hold anymore in hypergroups, in the sense that there may exist (or not) more identities, and each element may have more inverses, or none.
An element e ∈ H is called an identity or unit if, for all a ∈ H, a ∈ a • e ∩ e • a. An element a ∈ H is called an inverse of a ∈ H if there exists an identity e ∈ H, such that e ∈ a • a ∩ a • a. A hypergroup that has at least one identity and has the property that, for each element of H, there exists at least one inverse is called regular.
The most natural connection between hypergroups and groups is assured by the fundamental relations because the quotient structure of a hypergroup through a fundamental relation is a group with the same properties of the hypergroup. Let us now recall the definition of one of them, i.e., the β relation: If (H, •) is a hypergroup, then β is an equivalence relation, and the quotient H/β is a group. In addition, let ϕ H : H −→ H/β be the canonical projection. The heart of a hypergroup H is the set Moreover, the complete closure of A in H, denoted by C(A), is the intersection of all complete parts of H that contain A. It can be characterized using the heart of a hypergroup with C(A) Now, we have all elements for defining the complete hypergroups. Their definition is based on the concept of a complete part.
In practice, it is more convenient to use a construction, which is called hereafter called the representation theorem, starting from a given group, as described in the next result. (G, ·) is a group.

2.
For all It is worth noticing that, for any group G, there are several non-isomorphic complete hypergroups of the same cardinality, depending on the cardinalities of the subsets A g with g ∈ G. This property will have a strong influence on the studies presented in the next sections. For more details and the tables of all non-isomorphic complete hypergroups of order less than 6, see [23,24].
The most important properties of the complete hypergroups are gathered in the following result.

1.
The heart ω H is the set of all identities of H, and thus, ω H = A e , where e is the identity of the group G that appears in the representation theorem of H.

2.
H is a reversible and regular hypergroup.

The Class Equation for Complete Hypergroups
The aim of this section is to establish, similarly to in group theory, the class equation for finite complete hypergroups based on the notion of conjugation. The starting point is the representation theorem (Theorem 1) for complete hypergroups, which assures a strong connection between complete hypergroups and groups.
First, we define the conjugation relation between two elements in an arbitrary hypergroup.
Since in a complete hypergroup (H, •), for any two elements a, b ∈ H, we have C(a • b) = a • b, then, based on Theorem 1, we may reformulate Definition 2 as follows. Proof. It is clear that the relation is reflexive, since for a ∈ H, we have a • a = a • a, meaning that a ∼ H a.
Let us prove now that the relation ∼ H is symmetric, and suppose that a ∼ H b. It follows that there exists c ∈ H such that c • a = b • c. Since (H, •) is a complete hypergroup, there exist (and they are unique) the elements g 1 , g 2 , h ∈ G such that a ∈ A g 1 , b ∈ A g 2 and c ∈ A h . Therefore, it follows that A h·g 1 = A g 2 ·h , and based on the second condition of Theorem 1, we state that hg 1 = g 2 h, meaning that For proving the transitivity, take a, b, c ∈ H, such that a ∼ H b and b ∼ H c. Similarly to proving the symmetry, there exist (and they are unique) the elements g 1 , g 2 , g 3 ∈ G such that a ∈ A g 1 , b ∈ A g 2 and c ∈ A g 3 , and the unique elements h, k ∈ G such that hg 1 = g 2 h and kg 2 = g 3 k, leading to the equalities khg 1 = kg 2 h = g 3 kh, which mean that a ∼ H c, concluding the transitivity.
Therefore, ∼ H is an equivalence relation.
Based on this proof, a linkage between the conjugated elements in a complete hypergroup and the corresponding conjugated elements in the associated group that appears in the representation of the complete hypergroup can be stated as follows. It follows very easily that the number of the distinct conjugacy classes in the complete hypergroup H is the same as the number of the distinct conjugacy classes in the associated group, i.e., k(G) = k(H).
where a ∈ A g and g ∈ G.
Proof. In a complete hypergroup H, for any a ∈ H, there exists a unique g ∈ G such that a ∈ A g . According to Proposition 2 and using the definition of the conjugacy class, we observe that Considering the cardinalities and using the fact that A g i ∩ A g j = ∅, for any g i = g j ∈ G, i = j, the conclusion immediately follows.
We can state now the main result of this section, namely the class equation for finite complete hypergroups.
Proof. Let G be a finite group of cardinality n, n ∈ N, n ≥ 2, that appears in the representation theorem of the complete hypergroup H. We have ω H = A e , where e is the neutral element of the group G.
Hence, the complete hypergroup H could be written as where the union is a disjoint one. We intend to check that .
Notice that, if the group G is abelian, then the conjugacy class of an element from H is the entire set to which it belongs.

Proof.
We easily check this assertion by using the definition of the conjugacy class [a] = {b ∈ H | ∃ c ∈ H : c • a = b • c}. Thus, there exist, and they are unique, the elements g 1 , g 2 , and g 3 in G such that a ∈ A g 1 , b ∈ A g 2 , and c ∈ A g 3 . Thereby, A g 3 ·g 1 = A g 2 ·g 3 , which implies that g 3 g 1 = g 2 g 3 = g 3 g 2 by the commutativity of G, meaning that g 1 = g 2 . So, we conclude that b ∈ A g 1 , i.e., [a] = A g 1 .
In the following, we will present an example to highlight the class equation defined above. Example 1. Let G =< ρ, σ | ρ 3 = σ 2 = (σρ) 2 = e >= {e, ρ, ρ 2 , σ, ρσ, ρ 2 σ} be the dihedral group D 6 of order 6 and let (H, •) be a proper complete hypergroup of order 7 constructed with the group G. According to the representation theorem of the complete hypergroups, we may construct more of such non-isomorphic hypergroups depending on the cardinalities of the subsets A g with g ∈ G that partition the hypergroup. In every case, five sets A g will contain one element, while the sixth one will contain two elements (this is the unique possibility to decompose the number 7 as a sum of 6 natural numbers). Moreover, the conjugacy classes of the elements of the groups G = Let H = {a 0 , a 1 , a 2 , a 3 , a 4 , a 5 , a 6 }. We analyze the cases: For this representation, according to Equation (5)  Case

Commutativity Degree of Complete Hypergroups
The aim of this section is to define the commutativity degree of a hypergroup and to study it in depth for complete hypergroups because of their strong connection with groups. As already mentioned in the preliminaries, the commutativity degree of a finite group is the probability that two arbitrary elements of the group commute. Explicitly, if we denote by then the commutativity degree can be expressed, as proved in [19], by In a similar way we introduce the commutativity degree for hypergroups. Let (H, •) be a finite hypergroup. Define the commutativity degree by the formula Since any complete hypergroup is constructed with use of a group, we intend to study the commutativity degree of complete hypergroups and find a relationship with the commutativity degree of the corresponding group.
According to the representation theorem for complete hypergroups, i.e., Theorem 1, any finite complete hypergroup (H, •) of cardinality m can be represented as H = g∈G A g , where for any element g of a finite group (G, ·) of cardinality n, the subsets A g of H satisfy the relations: i) For any g 1 = g 2 ∈ G, we have A g 1 ∩ A g 2 = ∅; ii) If (a, b) ∈ A g 1 × A g 2 , then a • b = A g 1 ·g 2 .
Based on this property, the formula of the commutativity degree of a complete hypergroup can be written as So, we immediately notice a relationship between the pair of the elements commuting in the complete hypergroup and the pair of the elements commuting in the group. This suggests us that there may exist a connection between d(H) and d(G) and in the following, which we aim to find out.
First, we will present a method, which will be described in several steps, for counting the number of the pairs (a, b) ∈ H 2 that commute.
Let us fix some notations. For an arbitrary set S, we denote its cardinality by |S|. Consider the complete hypergroup (H, •) with |H| = m and the group (G, ·) that appears in the representation of H with |G| = n, where m, n ∈ N, m, n ≥ 2. Since we consider only proper hypergroups, we also have the restriction m > n. In addition, for any i ∈ {1, 2, . . . , n}, take |A g i | = m i , and then A g i are the subsets that appear in the decomposition of H, as in Theorem 1.
The main idea of this method is to emphasize the sets A g i that contain one element, so m i = 1. Then, the remaining sets that contain more than one element, and thus have m i > 1, will be written as a union of another two their subsets: The first one contains only one element, and the second one contains all the other elements. By doing this, we can count the number of the elements that commute and belong to a singleton set as |c(G)| = d(G) · |G| 2 .
Let us start with a general form of the sets A g i , i = 1, 2, . . . , n.

•
Step. We count that pairs of elements that commute and belong to sets with only one element. Since we have the equivalences: pairs of elements that commute. 2 • Step. It is clear that the elements contained in the same set A g i commute between them because their commutativity means g i · g i = g i · g i, , which is always true. Each element of the set A g i commutes with itself, meaning that we count m i elements. Then, the number of different elements that commute between them is equal to Therefore, the number of the elements from the set A g i that commute between them and were not counted at the 1 • Step is (m i − 1) m i + m i − 1 = m 2 i − 1. Since we have n different sets A g i , at this step, we count pairs of elements that commute.
Step. Since all the elements of G commute with the identity e, it follows that a • b = b • a for any a ∈ A e , b ∈ A g i , and g i = e. Now, if we take g 1 = e, the number of the ordered pairs of elements from A g 1 and A g 2 commuting are 2m 1 m 2 , but the pairs x 1 , x m 1 +1 and x m 1 +1 , x 1 were already counted in the first step. So, we have only 2m 1 · m 2 − 2 pairs. Repeating this procedure for all sets A i , we calculate pairs of elements of this step. 4 • Step. It remains to consider the pairs of elements from A g i and A g j with g i g j = g j g i , i = j, i, j > 1, which were not considered in the first step. It is clear that their number is Combining the results of all four cases, we conclude that the commutativity degree of H is After making some simple computations, we find The method that we presented before suggests the following result.
where c(i, j) = 2 ∑ which confirms the validity of the formula.
In the following example, we will calculate the commutativity degree of some complete hypergroups H, of the same cardinality, m = 7, obtained from the same group G = D 6 , i.e., the dihedral group of order 6, but with different decompositions. More precisely, the cardinalities of the subsets A g with g ∈ G that partition the hypergroup are different, as we presented in Example 1. (H, •) be a complete hypergroup of order 7 constructed from the group D 6 , for which we know that d(G) = 1 2 [19]. I Case. Consider that we have the following decomposition of H:

Example 2. Let
Then, using formula (14), we obtain I I Case. Consider that we have the following decomposition of H:  In the following, we will express the commutativity degree d(H) of a complete hypergroup as a formula involving the conjugacy classes of the elements of H. In group theory, it is known that the commutativity degree of a finite group G can be expressed as d(G) = k(G) |G| , where k(G) represents the number of the distinct conjugacy classes of the elements of G.
Now, we will explain how and why this formula changes in the class of hypergroups. First of all, we will recall some results concerning groups. For any element g of a group G, we denote by [g] the conjugacy class of g, i.e.
[g] = {h ∈ G| ∃ a ∈ G : h = aga −1 }, and by C G (g) the centralizer of the element g in G, i.e., C G (g) = {h ∈ G | gh = hg}, which is a subgroup of G.
Then, we have meaning that the product |[g]| · |C G (g)| is constant, or in other words, for any This property does not hold anymore for complete hypergroups, as we can notice for the hypergroups described in Example 2.
For an arbitrary hypergroup H, the centralizer C H (x) of an element x in H is defined as where in the particular case of the complete hypergroups, the complete closure C(x • y) is equal to x • y. So, for a complete hypergroup (H, •) with the representation H = g∈G A g , for any x ∈ H, there exists a unique g x ∈ G such that x ∈ A g x and thereby: where we have a disjoint union. It follows that where k(H) is the number of the distinct conjugacy classes [x i ] of the elements of H, and thus, H = Proof. We know already from the previous section that k(G) = k(H). First, we will determine the cardinality of the centralizer c(H) of the complete hypergroup H = Then, for a = x i j and b ∈ C H (a), we obtain |{( Now, according to the hypothesis, for any Based on the definition of the commutativity degree d(H), we conclude that So, it is clear that the condition in the hypothesis of Theorem 5 holds. Now let us calculate the cardinalities of the sets E i , when In the next example, we will consider the same group G = D 6 and a complete hypergroup H of the same cardinality 7 constructed from G, but with a different partition of the sets A g . Here, the condition expressed in Theorem 5 does hold anymore, and the formula (16) is also not true. As in Example 3, first, we determine the centralizers of the elements: We notice that a 5 ∈ [a 3 ], but |C H (a 5 )| = |C H (a 3 )|, so the condition in Theorem 5 does not hold. Now, by calculating ∑ x∈H |C H (x)|, we obtain that its value is 1 · 7 + 2 · 3 + 2 · 3 + 2 + 2 = 23, so d(H) = 23 49 , as we calculated in Example 2.
If we apply the formula (16), we get which is not the correct value.

Conclusions
Any finite group can be partitioned in sets of disjoint conjugacy classes. The class equation states that the cardinality of the group is equal to the sum of the cardinalities of the above-mentioned classes. This result has different applications in group theory; among them, we recall the degree of the commutativity of a group, that is, the probability for two different elements to commute (in a non-commutative group). These two fundamental concepts, i.e., the class equation and commutativity degree, are also related in the hypergroup theory. In this paper, we studied them for complete hypergroups. First, we defined the conjugacy relation on a hypergroup, which is an equivalence relation, proving that, in a complete hypergroup, the number of the distinct conjugacy classes is the same as the number of the distinct conjugacy classes in the group that appears in the construction of the considered complete hypergroup. We then stated the class equation for such hypergroups, which is similar to the class equation for groups, with the difference that the role of the center of the group is played now by the heart of the complete hypergroup. The second part of the paper is dedicated to the study of the commutativity degree of a complete hypergroup. This is the probability that two randomly chosen elements commute in a non-commutative hypergroup. It has been already studied for HX-groups [25] and polygroups [26]. First, we have presented a general method to compute this degree, obtaining a formula that depends on the commutativity degree of the group that appears in the representation theorem of the considered complete hypergroup. It is important to stress the fact that, by using a certain group, more non-isomorphic complete hypergroups of the same cardinality can be constructed. Thus, their commutativity degree is not the same, but if the centralizer of each element in a conjugacy class is the same, i.e., |C H (y)| = |C H (x)| for any y ∈ [x], then the commutativity degree of the complete hypergroup H can be expressed using the class equation of H (see Theorem 5). Moreover, it would be interesting to see under which conditions the commutativity degree of the complete hypergroups of a fixed cardinality and constructed from the same group are maximal, or to find a constant c ∈ (0, 1] such that if the commutativity degree is greater than c, then the complete hypergroup is commutative. These problems will be investigated in our future work, since the commutativity aspect is an interesting topic in algebra, and is also studied for polynomials, for example, in [27,28].

Conflicts of Interest:
The authors declare no conflict of interest.