Commutativity and Completeness Degrees of Weakly Complete Hypergroups

We introduce a family of hypergroups, called weakly complete, generalizing the construction of complete hypergroups. Starting from a given group G, our construction prescribes the β-classes of the hypergroups and allows some hyperproducts not to be complete parts, based on a suitably defined relation over G. The commutativity degree of weakly complete hypergroups can be related to that of the underlying group. Furthermore, in analogy to the degree of commutativity, we introduce the degree of completeness of finite hypergroups and analyze this degree for weakly complete hypergroups in terms of their β-classes.


Introduction
We refer to hypercompositional algebra as the branch of algebra concerned with hypercompositional structures, that is, algebraic structures where the composition of two elements is a nonempty set rather than a single element [1]. Although hypercompositional algebra differs from classic algebra in its subjects, methods, and goals, the two fields are connected by certain equivalence relations, called fundamental relations [2,3]. Through the fundamental relations, hypercompositional algebra can make use of the wealth of tools typical of traditional algebra.
A fundamental relation is the smallest equivalence relation defined on a hypercompositional structure such that the corresponding quotient is a classic structure whose operational properties are analogous to those of the original structure [4,5]. For example, the quotient of a hypergroup modulo the equivalence β is isomorphic to a group [6][7][8]. On the other hand, given a group G and a family F = {A k } k∈G of nonempty and pairwise disjoint sets, the set H = k∈G A k equipped with the hyperproduct x • y = A ij , for all x ∈ A i and y ∈ A j , is a hypergroup. Hypergroups built in this way are called complete [4] and have the property that the β-classes are the sets A k . For any nonempty subset A of a hypergroup (H, •), the set C(A) = a∈A β(a) is the complete closure of A. Hence, a hypergroup (H, •) is complete if and only if x • y = C(x • y), for all x, y ∈ H. Complete hypergroups have been the subject of many studies, see, e.g., [9][10][11][12], because they have a variety of group-like properties. Notably, in [13], the authors define the commutativity degree of complete hypergroups and characterize it with an identity that is analogous to the class equation for groups. Recall that the commutativity degree of a finite group G was defined by W. Gustafson in [14] as the probability that two randomly chosen elements commute, |{(x, y) ∈ G 2 | xy = yx}| |G| 2 .
Inspired by this concept, in [13] the commutativity degree of a finite hypergroup (H, •) is defined as The probabilistic interpretation of this number is completely analogous to that for groups. In this paper, we define the completeness degree of a finite hypergroup (H, •) as the number and determine some formulas which allow us to compute the previous numbers for a special class of hypergroups, called weakly complete, that include complete hypergroups. The plan of this paper is the following: In Section 2, we introduce definitions, notations, and fundamental facts to be used throughout the paper. In Section 3, we give the definition of product-free relations on a group G and study their main characteristics. In particular, we characterize product-free relations that are maximal with respect to inclusion. In Section 4, we present a new construction of hypergroups. These hypergroups are called weakly complete and are defined using a product-free relation I on a group G, a family {A k : k ∈ G} of nonempty and pairwise disjoint sets and a special family of functions {ϕ i,j : (i, j) ∈ I}. The main features of these hypergroups are discussed in this section. The completeness degree ∆(H) of finite weakly complete hypergroups is defined and analyzed in Section 5. There, we prove lower bounds for ∆(H) that depend only on the size of the β-classes of H. Finally, in Section 6, we discuss the commutativity degree d(H) of finite weakly complete hypergroups, and establish relations between d(H) and ∆(H). In particular, in our last theorem we prove that, if the cardinality of A k does not depend on k, then |d(H) − ∆(H)| ≤ 1 4 .

Basic Definitions and Notations
We adopt from known texbooks [1,4,5] standard definitions of basic concepts in hypercompositional algebra, such as semihypergroups and hypergroups. For the reader's convenience, we present below a few concepts that are needed in this work.
Given a semihypergroup (H, •), the relation β ⊆ H × H is defined as β = ∪ n≥1 β n , where β 1 is the diagonal relation in H and, for every integer n > 1, β n is defined as follows: see, e.g., [2,3]. This relation is one of the main fundamental relations alluded to in the Introduction. For some special families of semihypergroups, β is transitive; see, e.g., [15,16]. In particular, if (H, •), is a hypergroup then β is an equivalence relation, see [7,8], and we have the chain of inclusions Moreover, the quotient set H/β equipped with the operation β(x) ⊗ β(y) = β(z) for all x, y ∈ H and z ∈ x • y, is a group. More precisely, β is the smallest strongly regular equivalence on H such that the quotient H/β is a group [2]. The canonical epimorphism π : H → H/β fulfills the identity π(x • y) = π(x) ⊗ π(y) for all x, y ∈ H, and the kernel ω H = π −1 (1 H/β ) of π is the heart of (H, •).
Let (H, •) be a hypergroup. We say that a nonempty subset A ⊆ H is a complete part if for every n ≥ 1 and x 1 , x 2 , . . . , x n ∈ H, The complete closure of A is the intersection of all complete parts containing A and is denoted with C(A). Using the canonical projection π : H → H/β * , the complete closure of A can be characterized as follows: Finally, let G be a group and let I ⊆ G × G be a binary relation on G. We denote I T the transpose relation of I ⊆ G × G, that is, (a, b) ∈ I ⇔ (b, a) ∈ I T . Furthermore, we associate with I the span and support sets defined below: Here and in the following, G * denotes the set G \ {1 G }.

Product-Free Relations on a Group
The class of complete hypergroups is among the best known in hypergroup theory, and is characterized by the fact that the hyperproduct of any two elements is a β-class. These hypergroups were introduced by P. Corsini in [4] and can be built by considering a group G and a family F = {A k } k∈G of nonempty and pairwise disjoint sets. The set H = k∈G A k is endowed with the product x • y = A ij for x ∈ A i and y ∈ A j . Then, (H, •) is a complete hypergroup and the β-classes of (H, •) are the sets A k . In this section, we introduce a special family of binary relations in a group G. These relations will allow us to define in the next section the class of hypergroups that generalize that of complete hypergroups and is the main subject of this work. Definition 1. Let G be a group. A binary relation I ⊆ G × G is called product-free or PF-relation if, for all i, j, k ∈ G, (i, j) ∈ I =⇒ (ij, k) / ∈ I and (k, ij) / ∈ I.
PF G denotes the family of all PF-relations in the group G. If I ∈ PF G and (i, j) ∈ I, then the elements i, j are different from 1 G . Otherwise, if, for example, i = 1 G , then we have the contradiction (i, j) = (i, 1 G j) = (i, ij) ∈ I. As a consequence, if |G| = 1, then PF G reduces to the empty relation. Hence, if I = ∅, then |G| ≥ 2 and I ⊂ G * × G * .
Our first result provides a characterization of PF-relations in terms of support and span sets. Subsequently, we analyze the structure of PF G and provide some examples. Proof. If x ∈ Supp(I) ∩ Span(I), then (x, y) ∈ I or (y, x) ∈ I for some y ∈ G * and there exists (i, j) ∈ I such that ij = x. We obtain (ij, y) ∈ I or (y, ij) ∈ I, a contradiction. Conversely, if I / ∈ PF G , then there exists (i, j) ∈ I and y ∈ G such that (ij, y) ∈ I or (y, ij) ∈ I. However, then we have ij ∈ Supp(I) ∩ Span(I).
Below we provide a couple of examples of how PF-relations can be built. Example 1. Let G be a group. For any subset S ⊆ G * , let I S be the relation It is can be seen that Supp(I S ) ⊆ S and Span(I S ) ⊆ G \ S. Hence, I S ∈ PF G by Lemma 1. For example, I G * is the relation consisting of the pairs (x, x −1 ) for x ∈ G * . On the other hand, I 1 G is the empty relation.

Example 2.
Let G and G be groups. Moreover, let I ∈ PF G and I ∈ PF G . Then, the direct product relation is a PF-relation on the direct product G × G . Indeed, Supp(I ⊗ I ) = Supp(I) × Supp(I ) and Span(I ⊗ I ) ⊆ Span(I) × Span(I ), so the claim follows from Lemma 1.
The following features of PF-relations are self-evident, so we refrain from including a proof.
• Every subset of a PF-relation is a PF-relation.
Let G be abelian. Then, I ∈ PF G if and only if I T ∈ PF G . Hereafter, we show that no PF-relation can contain more than a quarter of all possible pairs of elements in the group. This result will play an important role in the forthcoming sections. Theorem 1. Let G be a finite group and I ∈ PF G . Then, |I| ≤ |G| 2 /4.

Proof.
For notational simplicity, let S = Supp(I). For any element i ∈ S, let S(i) = {j ∈ G : (i, j) ∈ I} and R(i) = {ij : j ∈ S(i)}. Obviously, S(i) and R(i) have the same cardinality, since the application f i : To maximize the rightmost quantity, we set |S| = |G|/2, and we have the claim.
The following example shows that the inequality in the preceding theorem is the best possible, since it can hold as an equality. Example 3. Let G = (Z m , +), where m ≥ 2 is even. Consider the following relation I ⊂ G × G: It is easy to see that Span(I) = {i ∈ Z m : i ≡ 0 (mod 2)} and Supp(I) = {i ∈ Z m : i ≡ 1 (mod 2)}. Hence, I ∈ PF G by Lemma 1. Finally, |Span(I)| = |Supp(I)| = m/2 and |I| = |G| 2 /4.

Maximal PF-Relations
PF-relations can be semi-ordered by inclusion; hence, it is worth considering maximal elements in PF G , with regard to their existence and characterization. The existence of maximal relations is shown in the forthcoming result. Proof. The family PF G is nonempty because it contains the empty relation. Moreover, for each chain {R j } j∈J in the partially ordered set (PF G , ⊆), the relation R = ∪ j∈J R j is product free. Indeed, if (x, y) ∈ R and by chance there exists z ∈ G such that (xy, z) ∈ R, then there exist j 1 , j 2 ∈ J such that (x, y) ∈ R j 1 and (xy, z) ∈ R j 2 . Since {R j } j∈J is a chain, we can assume that R j 1 ⊂ R j 2 , and so {(x, y), (xy, z)} ⊆ R j 2 , which is impossible because R j 2 ∈ PF G . Hence, R is a upper bound of {R j } j∈J . By Zorn's Lemma, in PF G there exists a maximal element.
Using an argument similar to the previous one, we also have that every PF-relation I on a group G is contained in a maximal PF-relation M. It suffices to apply Zorn's lemma to the family of PF-relations that contain I. Hence, we have the following result: The same fact is not true if the group is not abelian, as shown in the following example. Let G be a noncommutative group with two elements a, b ∈ G − {1 G } such that ab = 1 G , a 2 = 1 G and ab = ba, e.g., the symmetric group S 3 . In these hypotheses, a = b and the relation The empty relation is maximal if and only if G is trivial. In the next result, we give a necessary and sufficient condition for a PF-relation to be maximal.

Theorem 2.
Let G be a group and let I ∈ PF G . Moreover, let Then, we have 1.
2. By point 1, if I ∪ I = G * × G * , then I is maximal. On the other hand, let I be maximal and (x, y) ∈ G * × G * with (x, y) ∈ I. Since I ∪ {(x, y)} is not a PF-relation, two cases are possible: (a) There exist (i, j) ∈ I and k ∈ G * such that (x, y) = (ij, k) or (x, y) = (k, ij). (b) There exists k ∈ G * such that (xy, k) ∈ I or (k, xy) ∈ I.
In the first case, we obtain x = ij or y = ij; hence, (x, y) ∈ I. In the second case, we have (x, y) ∈ I because xy ∈ {xy, k}. In both cases, we obtain I ∪ I = G * × G * .

Remark 2.
We observe that if I and I are maximal PF-relations, then the tensor product relation I ⊗ I is not necessarily maximal. For example, let G = {1 G , a} and G = {1 G , a , b } be groups isomorphic to (Z 2 , +) and (Z 3 , +), respectively. Moreover, let I = {(a, a)} ⊂ G × G and The relations I and I are maximal PF-relations. However, the tensor product relation I ⊗ I = {((a, a ), (a, b )), ((a, b ), (a, a ))} is not maximal because it is contained in the following PF-relation on G × G :

Weakly Complete Hypergroups
In this section, we introduce a new class of hypergroups, whose construction is fundamentally based on PF-relations. We introduce a few auxiliary concepts and notations for background information. In what follows, we denote P * (X) the collection of nonempty subsets of the set X.

Definition 2. Let A, B, C be nonempty sets. A function
A bi-covering ϕ : Example 4. Bi-covering functions can be constructed by considering a group G and three nonempty sets A, B, C of size ≥ |G|. If α : A → G, β : B → G and γ : C → G are three surjective functions; then, the function ϕ : Hence, x∈B ϕ(a, x) = C for all a ∈ A. Analogous arguments prove that x∈A ϕ(x, b) = C, for all b ∈ B. Thus, ϕ is a bi-covering. We note in passing that in the previous construction the role of the group G can be played by an arbitrary hypergroup.
Let G be a group and let I be a relation on G. Consider a family F = {A k } k∈G of nonempty and pairwise disjoint sets, and let I = {ϕ i,j } (i,j)∈I be a family of bi-coverings ϕ i,j : A i × A j → P * (A ij ). In particular, if I = ∅, then I = ∅. In the set, H = k∈G A k introduce the hyperproduct • : H × H → P * (H), defined as follows: for all x, y ∈ H. This hyperproduct is well defined because the sets in the family F = {A k } k∈G are nonempty and pairwise disjointed. The hyperproduct is naturally extended to nonempty subsets of H as usual: For X, Y ∈ P * (H) let In particular, for every i, j ∈ G and x ∈ A j , we have From this observation, it is not difficult to derive that if I = ∅ or all functions ϕ i,j are trivial; for every (i, j) ∈ I, then (H, •) is a complete hypergroup. The following result shows that (H, •) is always a hypergroup under the sole condition that I ∈ PF G . Theorem 3. Let I ∈ PF G . Then, in the previous notations, (a) for every i, j, k ∈ G, x ∈ A i , y ∈ A j and z ∈ A k , we have (b) for every integer n ≥ 3 and for every z 1 , z 2 , . . . , z n ∈ H there exists i ∈ G such that .
(b) It suffices to apply (5) and the previous part a) and proceed by induction on n.
(c) To prove that (H, •) is a hypergroup, we only need to show that • is reproducible. Let x ∈ H and x ∈ A i . Clearly, iG = G for all i ∈ G and, by Equation (5), we obtain The identity H • x = H follows analogously for every x ∈ H, so (H, •) is a hypergroup. Finally, let xβy. By (2), there exists n ≥ 3 such that xβ n y. By point b), there exists i ∈ G such that {x, y} ⊆ A i . Now, let a ∈ A 1 G . Since (i, 1 G ) / ∈ I, by (4) we have {x, y} ⊆ A i = x • a and we deduce xβ 2 y. Example 5. Let G be a group and let I ⊂ G × G be a relation on G. Consider a family F = {A k } k∈G of nonempty and pairwise disjoint sets such that |A k | ≥ |G|, for all k ∈ G. Moreover, let { f k : A k → G} k∈G be a family of surjective functions. Proceeding as in Example 4, we obtain a family of bi-covering functions I = {ϕ i,j : A i × A j → P * (A ij )} (i,j)∈I . If I ∈ PF G , then Theorem 3 provides a hypergroup (H, •).
Considering the functions ϕ 1,1 and ϕ 2,2 , definition (4) returns the following hypergroup: On the other hand, considering the functions ϕ 1,1 and ϕ 2,2 , we have the hyperproduct . This example reveals a specific quality of PF-relations: If a hyperproduct defined as in (4) is associative and reproducible, independent of families F = {A k } k∈G and I = {ϕ i,j } (i,j)∈I , then the relation I is product free. This fact is formalized in the following result. Proof. Firstly, note that we have I = ∅ as I / ∈ PF G . The proof can be reduced to the analysis of two cases: (a) there exists (i, j) ∈ I such that 1 G ∈ {i, j}; and (b) there exists i, j, k ∈ G * such that (i, j) ∈ I and (ij, k) ∈ I (or, equivalently, (k, ij) ∈ I).
(a) If i = j = 1 G then it suffices to consider arbitrary families F and I where A 1 G = {a, b} and the function ϕ 1 G ,1 G is described by the following table: Then, associativity fails because (a • a) • a = {a, b} = {a} = a • (a • a). Otherwise, without loss of generality, assume j = 1 G and (1 G , 1 G ) ∈ I. Let F and I verify the following conditions: |A | = 2 for every ∈ G and |ϕ p,q (x, y)| = 1 for all (p, q) ∈ I. Let x ∈ A i and y, z ∈ A 1 G . Then, (b) Let F = {A : ∈ G} and I = {ϕ p,q : (p, q) ∈ I} be arbitrary families verifying the following conditions: (b1) |A | = 2 for every ∈ G; (b2) if (i, jk) ∈ I then ϕ i,jk (x, y) = A ijk for every x ∈ A i and y ∈ A jk ; |ϕ p,q (x, y)| = 1 in all remaining cases. Let x ∈ A i , y ∈ A j , and z ∈ A k . Then, Since 1 G / ∈ {i, j, k}, then (i, j) = (i, jk) and (ij, k) = (i, jk). Hence, |(x • y) • z| = 1 by (b2). On the other hand, for some w ∈ y • z ⊆ A jk , we have By (b1) we can conclude that (x • y) • z = x • (y • z). (The proof proceeds in a similar way if (k, ij) ∈ I.) Definition 3. The hypergroups (H, •) defined as in (4) with a PF-relation I are called weakly complete. A weakly complete hypergroup is n-uniform if |A i | = n for all i ∈ G; if the size n is not relevant, then we simply call it uniform.
The term "weakly complete" originates from the following observations: Let (H, •) be a weakly complete hypergroup built from families F = {A k } k∈G and I = {ϕ i,j } (i,j)∈I , and let be the hyperproduct obtained from the same set family F using only trivial bi-coverings. Then, (H, ) is a complete hypergroup and x • y ⊆ x y for all x, y ∈ H. We also obtain the same conclusion by replacing the given relation I with the empty relation. Furthermore, both in complete hypergroups and weakly complete hypergroups, the fundamental relation β coincides with β 2 , as shown in Theorem 3.
In the following, we use the notation (H, •) = W (G, I, F, I) to indicate a weakly complete hypergroup whose hyperproduct • is defined as (4) from I ∈ PF G and the families F = {A k } k∈G and I = {ϕ i,j } (i,j)∈I . We call W (G, I, F, I) a representation of (H, •). It is worth noting that a weakly complete hypergroup may have multiple representations. Indeed, let (H, •) = W (G, I, F, I) and let (i, j) / ∈ I. If the relation I = I ∪ {(i, j)} is product free, then the same hypergroup admits the representation W (G, I, F, I) where I = I ∪ {ϕ i,j } and ϕ i,j (x, y) = A ij for every x ∈ A i and y ∈ A j . However, all possible representations of a given weakly complete hypergoup share the same group G and family F. This fact should be evident from the following proposition, where we explain the algebraic role of the parameters of a representation of a weakly complete hypergroup. The sets A i ∈ F are the β-classes of H, i.e, for every x ∈ H, x ∈ A i ⇔ β(x) = A i .
Every subhypergroup K of (H, •) is a complete part of H, that is, C(K) = K.

4.
A subset K ⊆ H is a subhypergroup of (H, •) if and only if there exists a subgroup G of G such that K = i∈G A i .
Proof. 1. Let x ∈ A k and a ∈ A 1 G . Then, A k = x • a, and so y ∈ A k implies yβ 2 x. Conversely, if yβ 2 x, then there exist a, b ∈ H such that {x, y} ⊆ a • b. By construction, there exists r ∈ G such that a • b ⊆ A r . Therefore, since x ∈ A k ∩ A r and the sets of the family F are pairwise disjoint, we obtain y ∈ a • b ⊆ A r = A k . Hence, y ∈ A k if and only if yβ 2 x. By Theorem 3, we conclude A k = β(x).
2. The map f : 3. We must prove that β(x) ⊆ K, for all x ∈ K. By reproducibility of K, if x ∈ K then there exists u ∈ K such that x ∈ x • u. Considering the canonical epimorphism π : H → H/β, we obtain π(x) = π(x) ⊗ π(u) and so π(u) = 1 H/β . Hence, from point 2., we have 4. Since iG = G = G i, for all i ∈ G , the proof of the implication ⇐ is similar to the one used in point 3. of Theorem 3 to prove that (H, •) is a hypergroup. Now, we prove the implication ⇒. By point 1., the β-classes of (H, •) are the sets A i , for all i ∈ G. Let π : H → H/β be the canonical epimorphism and f : H/β → G be the isomorphism such that f (A i ) = i, for all i ∈ G. If K is a subhypergroup of (H, •), then G = ( f • π)(K) is a subgroup of G. Moreover, if x ∈ K then there exists i ∈ G such that x ∈ A i . By point 1., On the other hand, if x ∈ i∈G A i , there exists i ∈ G such that x ∈ A i . Clearly, there exists y ∈ K such that ( f • π)(y) = i. If we suppose that y ∈ A j , then we have A j = β(y) and i = ( f • π)(y) = f (π(y)) = f (A j ) = j. Finally, by point 3., The following result, which follows from the definition of hyperproduct in (4) and point 1 in Proposition 3, describes all cases where a weakly complete hypergroup is complete. if I = ∅, then (H, •) is complete ⇐⇒ ϕ i,j is trivial, for every (i, j) ∈ I. Example 6. Let (H, •) = W (G, I, F, I) such that |A k | > 1 for some k ∈ G and |A i | = 1 for i = k. Then, (H, •) is complete, as a consequence of the previous corollary. Indeed, if (i, j) ∈ I and ij = k, then |A ij | = 1 and ϕ i,j is trivial. On the other hand, if k = ij then k ∈ {i, j} because I is product free. Thus, |A i | = |A j | = 1 and ϕ i,j are trivial since it is a bi-covering.
The next example shows a weakly complete hypergroup that contains both complete and noncomplete subhypergroups.
In the set H = {a, b, c, d, e, f , g, h}, define the hyperproduct represented in the following table: Then, (H, •) ia a weakly complete hypergroup. The subsets are a subhypergroup of (H, •). Moreover, K 3 is complete and K 1 and K 2 are not complete.
The next theorem characterizes weakly complete hypergroups, in that it yields a necessary and sufficient condition for a given hypergroup to be weakly complete, based on the structure of its quotient group.
The following conditions are equivalent: 1.
J is product free; 2.
Proof. Suppose that J is product free. For every i ∈ H/β, let A i = π −1 (i), and note that It is not difficult to see that f i,j is a bi-covering. Indeed, for any fixed x ∈ A i we have by construction The identity x∈A i f i,j (x, y) = A ij can be derived analogously, so f i,j is a bi-covering. It remains to observe that (H, •) = W (H/β, J, {A i }, { f i,j }), and we have the first part of the claim.
Conversely, suppose that (H, •) is a weakly complete hypergroup, (H, •) = W (G, I, F, I). Identifying G with H/β modulo an isomorphism, we have J ⊆ I. Indeed, let (i, j) ∈ J. By hypotesis, there exist x, y ∈ H such that π(x) = i, π(y) = j and x • y = C(x • y). Hence, (i, j) ∈ I by (4). This conclusion follows immediately from the fact that a subset of a PF-relation is a PF-relation.

Completeness Degree of Finite Hypergroups
In this section, we introduce the notion of completeness degree of finite hypergroups and analyze the completeness degree of finite weakly complete hypergroups.
The rational number is the completeness degree of (H, •).
Thus, the completeness degree of a hypergroup is the probability that the hyperproduct of two randomly chosen elements is a β-class. Clearly, ∆(H) ∈ [0, 1] and ∆(H) = 1 if and only if (H, •) is complete. In the next lemma, we deduce an explicit formula for the completeness degree of finite weakly complete hypergroups. For this purpose, we make use of the following auxiliary notation. Let (H, •) = W (G, I, F, I). For every i, j ∈ G, let Moreover, if (H, •) is uniform, then Proof. Firstly, note that C H = i,j C i,j . From the definition of the hyperproduct • in (4), we deduce the alternative formula Recalling that the sets of the family F are pairwise disjoint, we obtain and Equation (6) follows. Moreover, if (H, •) is n-uniform, then |H| = n|G| and and we also obtain (7).
Our next result provides two lower bounds on ∆(H) that depend only on the size of the β-classes of H.
Proof. Let {A i } i∈G be the family of disjoint sets in the representation of (H, •). Then, Recalling that A 1 G = ω H and using (6), we obtain the first inequality. Moreover, from (7) we have ∆(H) ≥ 1 − |I|/|G| 2 ; hence, the second part of the claim is an immediate consequence of Theorem 1.
The next example shows that the inequalities in Theorem 6 can hold as equalities.
Example 8. Let m ≥ 2 be an even number, and let G and I be the same as in Example 3. Let (H, •) = W (G, I, F, I) be any uniform weakly complete hypergroup such that C i,j = ∅ for all (i, j) ∈ I; i.e., all bi-coverings are proper. A straightforward application of Lemma 2 proves that ∆(H) = 3/4. Moreover, if m = 2, then |H| = 2n and |ω H | = n. Thus, also the first inequality in Theorem 6 holds as an equality.
In the forthcoming example, we construct uniform weakly complete hypergroups where all bi-coverings are proper, that is, C i,j = ∅, for all (i, j) ∈ I. According to Lemma 2, these hypergroups achieve the smallest ∆(H) possible for a given PF-relation.

Example 9.
Let G be a group and I ∈ PF G . Let F = {A k } k∈G be a family of finite, pairwise disjoint sets such that |A k | = n ≥ 2 for all k ∈ G. We assume A k = B k ∪ C k , with B k , C k nonempty disjoint sets. For every (i, j) ∈ I, let ϕ i,j : A i × A j → A ij be defined as follows: It is not difficult to verify that ϕ i,j is a proper bi-covering. Moreover, the hypergroup (H, •) = W (G, I, {A i }, {ϕ i,j }) is n-uniform. Owing to (7) and the finiteness of G, the completeness degree of (H, •) is i.e., the smallest possible value for the given relation I.

Commutativity Degree of Weakly Complete Hypergroups
In a nonabelian group and, more generally, in any nonabelian algebraic structure, it makes sense to compute the probability that two randomly chosen elements commute. This problem was popularized by Gustafson in [14], who defined the commutativity degree d(G) of a group G as the probability that two arbitrary elements commute, and proved that if d(G) > 5 8 then G is abelian. Moreover, we have d( The basic technique adopted for the proof relies on the relationship between d(G) and the number of conjugacy classes of G, and can be traced back to a paper by Erdős and Turán [17]. Later on, there has been considerable interest in the use of probabilistic techniques in group theory, and this concept has had significant developments.
Recently, the concept of commutativity degree has been introduced also in hypergroup theory [13,18]. In particular, in [13] the authors defined the commutativity degree of a finite hypergroup (H, •) as and characterized this index when (H, •) is complete by considering a partitioning of H into suitably defined conjugacy classes. In this section, we study the commutativity degree of weakly complete hypergroups. Our main tool is the partitioning of H into β-classes. To begin with, we point out an important observation. For any i, j ∈ G and for any x ∈ A i and y ∈ A j , a necessary condition for the identity Hence, we can restrict our attention to pairs (i, j) belonging to the set This set is directly related to the commutativity degree of G, since d(G) = |c(G)|/|G| 2 .

Definition 5.
We say that a relation I ∈ PF G is G-symmetric if its restriction to c(G) is symmetric; that is, for every i, j ∈ G, if ij = ji then (i, j) ∈ I ⇐⇒ (j, i) ∈ I.
Equivalently, I ∈ PF G is G-symmetric if and only if I ∩ c(G) = I T ∩ c(G). It can be observed that if G is abelian then a relation in PF G is G-symmetric if and only if it is symmetric. The relevance of the previous definition lies in the fact that every weakly complete hypergroup admits a representation with a G-symmetric relation, as shown in the following lemma.  (H, •). If I is G-symmetric, then it is complete. Otherwise, I ∩ c(G) = I T ∩ c(G) and we define the relation We have I ∩ c(G) = I T ∩ c(G), so I is G-symmetric, and I properly extends I. Moreover, from Lemma 1 we can deduce that I ∈ PF G , because both the support and the span of I coincide with those of I.
For every (i, j) ∈ I \ I let ψ i,j : A i × A j → A ij be the trivial bi-covering, and define I = I ∪ {ψ i,j }. To conclude the proof, it suffices to show that the hypergroup (H, ) = W (G, I, F, I) coincides with (H, •). Indeed, for arbitrary x ∈ A i and y ∈ A j , if (i, j) ∈ I \ I , then Otherwise, if either (i, j) ∈ I or (i, j) / ∈ I then the identity x y = x • y follows trivially from the construction (4). We can conclude that (H, •) = W (G, I, F, I).
In what follows, we obtain different characterizations of the commutativity degree of a weakly complete hypergroup (H, •) = W (G, I, F, I) in terms of the parameters of its representation. By virtue of Lemma 3, we can safely assume that I is G-symmetric. In this case, for every pair (i, j) ∈ c(G) ∩ I the sets are well defined.
Moreover, if (H, •) is uniform then Proof. Let i, j ∈ c(G), x ∈ A i and y ∈ A j . Two cases are possible: (a) (i, j) ∈ c(G) \ I. In this case, (b) (i, j) ∈ I ∩ c(G). Owing to the G-symmetry of I, we have both x • y = ϕ ij (x, y) and y • x = ϕ ji (y, x). By (10), The first claim follows from the fact that the set c(G) is the disjoint union of c(G) \ I and I ∩ c(G). Moreover, if |A i | = n for all i ∈ G, then ∑ (i,j)∈c(G)\I |A i ||A j | = n 2 |c(G) \ I| = n 2 (|c(G)| − |c(G) ∩ I|).
Since |H| = n|G|, we also have and (13) follows. Finally, using (11) we obtain which yields (14), and the proof is complete.
The previous theorem yields a few notable consequences. For example, taking I = ∅ we conclude that if (H, •) is complete and In particular, if (H, •) is also uniform, then d(H) = d(G). More generally, d(H) ≤ d(G) for any uniform weakly complete hypergroup, and the equality holds if and only if ϕ i,j (x, y) = ϕ j,i (y, x) for every (i, j) ∈ c(G) ∩ I.
Finally, the similarity between formulas (6) and (12) suggests that we should study the relationship between the degrees of commutativity and completeness, at least in the commutative case. We propose our result below. Before doing so, we recall that if G is abelian, then G-symmetric relations are symmetric. Hence, by Lemma 3, every weakly complete hypergroup built from an abelian group admits a representation whose PFrelation is symmetric. Proof. Since G is abelian, we have c(G) ∩ I = I and the condition (i, j) ∈ c(G) \ I reduces to (i, j) / ∈ I. Therefore, subtracting (13) from (6) we obtain (15). Furthermore, for every (i, j) ∈ I we have D i,j ∪ C i,j ⊆ A i × A j . If H is n-uniform, then |H| = n|G| and |A i × A j | = n 2 . Hence, −n 2 ≤ |D i,j | − |C i,j | ≤ n 2 .

Conclusions
The class of complete hypergroups is among the best known in hypergroup theory. Complete hypergroups have a variety of group-like properties and are characterized by the fact that the composition of two elements is a β-class [9][10][11][12]. In this paper, we introduce a class of hypergroups (H, •) that includes complete hypergroups as a particular case. The construction of these hypergroups, called weakly complete, is crucially based on particular binary relations defined on the quotient group H/β. We call these relations product free because no group element is in relation with the product of two elements that are related to each other. Product-free relations are interesting by themselves, and we show a number of their main properties on generic groups in Section 2. For example, we prove an attainable upper bound on the cardinality of product-free relations in finite groups.
The main motivation of introducing weakly complete hypergroups lies in the possibility of measuring their "closeness" to complete hypergroups. Indeed, to every finite hypergroup, we can associate a completeness degree, which quantifies how close to completion the hypergroup is. We introduce and analyze this concept in Section 5. More precisely, the completeness degree of a hypergroup is the probability that the composition of two randomly chosen elements is a β-class. For a weakly complete hypergroup whose β-classes have the same cardinality, this probability is bounded from below by 3 4 . Indeed, the completeness degree of weakly complete hypergroups admits simple closed formulas. Furthermore, it can be related to the commutativity degree, which has been recently brought into hypercompositional algebra from group theory [13,18].
Completeness concepts and probabilistic methods are relevant topics nowadays not only in classical algebra but also in hypercompositional algebra, and this discipline is continually expanding with the introduction of structures with distinctive properties [19]. It would be interesting to discover more hypergroup classes, and more general hypercompositional structures, for which useful results can be found along these directions.