
The ρis strongly regular if and only if (H/ρ, ⊗)is a
semigroup(resp. group), with respect to operation:
x⊗y={z|z∈x◦y}.
Definition 2.4 Let (H, ◦)be a semihypergroup and n
be a nonzero natural number. We say that
xβny⇔ ∃(a1, a2, . . . , an)∈Hn,{x, y} ⊆
n
Y
i=1
ai.
Let β=S
n≥1
βn. Clearly, βis reflexive and symmetric.
Denote by β∗the transitive closure of β.
Theorem 2.5 [5] [?]β∗is the smallest strongly reg-
ular relation on H.
The smallest equivalence relation β∗in above
is called the fundamental relation on (resp.
semi)hypergroup (H, ◦), and the derived(resp.
semi)group H/β∗is called the fundamental(resp.
semigroup) group of H. R. Ameri in [?] shown
that this relation is fanctorial, that is, the rela-
tion β∗induced a functor from category of (resp.
semi)hypergroups to category of (resp. semi)groups.
Theorem 2.6 [6] If (H, ◦)is a hypergroup, then β∗=
β.
Example 2.7
Let (H, ◦)be a very thin hypergroup, such that for all,
only a pair of the element of Hthe hypercomposition
is a singleton set, that is there exists a unique pair
(a, b)∈H2,|a◦b|>1, and |x◦y|= 1 for all
x, y ∈H, (x, y)6= (a, b). Then β∗(x) = {x}, for all
x /∈a◦b, and β∗(y) = β∗(a◦b), for all y∈a◦b.
Remark 2.8 Freni in [4] introduced a new relation γ
on a hypergroup Has follows:
γ=Sn≥1γn, where γ1={(x, x); x∈H}, and
for positive integer n > 1,γnis defined by
xγny⇐⇒ ∃ai∈H, ∃σ∈Sn,1≤i≤n;
x∈Qn
i=1 ai, y ∈Qn
i=1 aσ(i).
Evidently, for every n∈N,the relations γnhave
symmetric and reflexive properties, and hence the re-
lation γ=Sn≥1γnhas reflexive and symmetric prop-
erties. Assume γ∗be the transitive closure of γ. Also,
the class of H/γ∗is considered γ∗(z) = {w|zγ∗w},
for z, w ∈H. It was proved that the relation γis
transitive, and also γ∗has the smallest strongly reg-
ular equivalence property so that H/γ∗is an abelian
group.
Theorem 2.9 [4] The relation γ∗is the small-
est strongly regular relation on a (resp. hyper-
group)semihypergroup such that the quotient H/γ∗is
commutative (resp. group) semigroup.
Theorem 2.10 [4] If Hbe a hypergroup, then γ=
γ∗.
3 A new Relation α
In this section we introduce a new relation αon a
(resp. semi)hypergroup H, and reformulate the re-
lation γ∗based on the relation α.
Definition 3.1 Consider the relations αand δon a
group Gas follows:
g1αg2⇐⇒ ∃m∈N,∃(y1, y2, ..., ym)∈Gm,
∃σ∈Sm:g1∈Qm
i−1yi,and g2∈Qm
i=1yσ(i).
and
g1δg2⇐⇒ g1g−1
2∈G0,
where G0is derived group (or commutator sub-
group) of G.
As usual, we usually use, the congruence relation in-
stead, (strongly)regular relation on groups or semi-
groups.
Lemma 3.2 The relation αand δare congruence re-
lations on G.
Proof. By definition it is clear that δis a con-
gruence relation on G. Also, αis a symmetric
and reflexive relation. Let g1αg2and g2αg3,
then by definition α, there will be m, n ∈N,
σ∈Sn,τ∈Sm,(x1, x2, ..., xm)∈Gmand
(y1, y2, ..., yn)∈Gn, such that g1=Qm
i=1 xi,g2=
Qm
i=1 xσ(i)=Qn
j=1 yj,g3=Qn
j=1 yτ(j). So, g1g2=
x1x2...xmy1y2...ynαyj1yj2...yjnxi1xi2...xim=
g3gg2.
Now we can write
x1x2...xmy1y2...yn(y−1
ny−1
n−1...y−1
1)αyj1yj2...yjnxi1xi2...
xim(y−1
ny−1
n−1...y−1
1).Therefore, g1αg2. Sup-
pose g1αg2and g3∈G, so there are
n∈N,σ∈Snand (x1, x2, ..., xn)∈Gn, such
that g1=x1x2...xnαxi1xi2...xim=g2. So, one has
g3g1=g3x1x2...xnαg3xi1xi2...xing3g2.
Lemma 3.3 On a group α=δ.
Proof. We must show that δ⊆αand α⊆δ. Be-
cause, αis a congruence relation, then (Gα, •)is a
group, where [a1]α•[a2]α= [a1a2]αand eG/α =
[eG]α, and [a]−1
α= [a−1]α. Since, a1a2αa2a1, then
EQUATIONS
DOI: 10.37394/232021.2023.3.13