In this paper, we give a unified method for constructing commutative relations, band relations and semilattice relations on a semihypergroup. Moreover, we show that the set of all commutative relations, the set of all band relations and the set of all semilattice relations on a semihypergroup are complete lattices.
Citation: Ze Gu. Semilattice relations on a semihypergroup[J]. AIMS Mathematics, 2023, 8(6): 14842-14849. doi: 10.3934/math.2023758
[1] | Jukkrit Daengsaen, Sorasak Leeratanavalee . Semilattice strongly regular relations on ordered $ n $-ary semihypergroups. AIMS Mathematics, 2022, 7(1): 478-498. doi: 10.3934/math.2022031 |
[2] | Jian Tang, Xiang-Yun Xie, Ze Gu . A study on weak hyperfilters of ordered semihypergroups. AIMS Mathematics, 2021, 6(5): 4319-4330. doi: 10.3934/math.2021256 |
[3] | Mona Aaly Kologani, Rajab Ali Borzooei, Hee Sik Kim, Young Bae Jun, Sun Shin Ahn . Construction of some algebras of logics by using intuitionistic fuzzy filters on hoops. AIMS Mathematics, 2021, 6(11): 11950-11973. doi: 10.3934/math.2021693 |
[4] | Warud Nakkhasen, Teerapan Jodnok, Ronnason Chinram . Intra-regular semihypergroups characterized by Fermatean fuzzy bi-hyperideals. AIMS Mathematics, 2024, 9(12): 35800-35822. doi: 10.3934/math.20241698 |
[5] | Shahida Bashir, Rabia Mazhar, Bander Almutairi, Nauman Riaz Chaudhry . A novel approach to study ternary semihypergroups in terms of prime soft hyperideals. AIMS Mathematics, 2023, 8(9): 20269-20282. doi: 10.3934/math.20231033 |
[6] | Madeleine Al Tahan, Sarka Hoskova-Mayerova, B. Davvaz, A. Sonea . On subpolygroup commutativity degree of finite polygroups. AIMS Mathematics, 2023, 8(10): 23786-23799. doi: 10.3934/math.20231211 |
[7] | Ze Gu . On weakly semiprime segments of ordered semihypergroups. AIMS Mathematics, 2021, 6(9): 9882-9885. doi: 10.3934/math.2021573 |
[8] | Man Jiang . Properties of R0-algebra based on hesitant fuzzy MP filters and congruence relations. AIMS Mathematics, 2022, 7(7): 13410-13422. doi: 10.3934/math.2022741 |
[9] | Ali Raza, Mobeen Munir, Tasawar Abbas, Sayed M Eldin, Ilyas Khan . Spectrum of prism graph and relation with network related quantities. AIMS Mathematics, 2023, 8(2): 2634-2647. doi: 10.3934/math.2023137 |
[10] | Naveed Yaqoob, Jian Tang . Approximations of quasi and interior hyperfilters in partially ordered LA-semihypergroups. AIMS Mathematics, 2021, 6(8): 7944-7960. doi: 10.3934/math.2021461 |
In this paper, we give a unified method for constructing commutative relations, band relations and semilattice relations on a semihypergroup. Moreover, we show that the set of all commutative relations, the set of all band relations and the set of all semilattice relations on a semihypergroup are complete lattices.
Similar to congruences on a semigroup, strongly regular relations on a semihypergroup (see [1]) play an important role in studying the algebraic structure of a semihypergroup. For example, M. De Salvo, D. Fasino, D. Freni and G. Lo Faro characterize and enumerate certain hypergroup classes based on the partition induced by the smallest strongly regular relation in [2,3].
A hypergroupoid (S,∘) is a nonempty set S together with a hyperoperation, that is a mapping ∘:S×S→P∗(S), where P∗(S) denotes the family of all nonempty subsets of S. If x∈S and A,B are nonempty subsets of S, then we denote
A∘B=⋃a∈A,b∈Ba∘b, |
x∘A={x}∘A, |
A∘x=A∘{x}. |
A hypergroupoid (S,∘) is called a semihypergroup if ∘ is associative, that is
x∘(y∘z)=(x∘y)∘z, |
for every x,y,z∈S. If a semihypergroup S contains an element 1 with the property that
(∀x∈S)x∘1=1∘x={x}, |
then we say that 1 is an absolute identity. Clearly, a semihypergroup has at most an absolute identity. If a semihypergroup S has no absolute identity, then we adjoin an extra element 1 to S and define
1∘1={1}, |
(∀s∈S)1∘s=s∘1={s}. |
Thus S∪{1} becomes a semihypergroup containing an absolute identity. We now define
S1={SifShas an absolute identity,S∪{1}otherwise. |
Let (S,∘) be a semihypergroup and ρ a binary relation on S. If A and B are nonempty subsets of S, then we set
AˉρB⇔(∀a∈A,∃b∈B)aρband(∀b′∈B,∃a′∈A)a′ρb′, |
and
AˉˉρB⇔aρb(∀a∈A,∀b∈B). |
A binary relation ρ on S is called left strongly compatible if
(∀a,b,x∈S)aρb⇒(x∘a)ˉˉρ(x∘b), |
and right strongly compatible if
(∀a,b,x∈S)aρb⇒(a∘x)ˉˉρ(b∘x). |
A binary relation on S is called strongly compatible if it is both left and right strongly compatible. An equivalence relation on S is called strongly regular if it is strongly compatible.
Let (S,∘) be a semihypergroup and ρ a strongly regular relation on S. We denote by (a)ρ the equivalence ρ-class containing a. It is well known from [1] that the quotient S/ρ is a semigroup with respect to the operation (x)ρ⋆(y)ρ=(z)ρ for every z∈x∘y. Let ρ be any relation on a nonempty set S. Then ρ∞ denotes the transitive closure of ρ, that is, ρ∞=∪m≥1ρm. The least strongly regular relation (fundamental relation) [4] β∗=β∞ is the transitive closure of the relation β=∪n≥1βn, where
β1=1S={(x,x)∣x∈S} |
is the diagonal relation on S, and for every integer n>1,βn is defined as follows
xβny⇔(∃(x1,x2,⋯,xn)∈Sn){x,y}⊆n∏i=1xi. |
A strongly regular relation ρ on S is called commutative if the quotient S/ρ is a commutative semigroup. The least commutative relation [5] γ∗=γ∞ is the transitive closure of the relation γ=∪n≥1γn, where
γ1=1S={(x,x)∣x∈S} |
is the diagonal relation on S, and for every integer n>1,γn is defined as follows
xγny⇔(∃(x1,x2,⋯,xn∈Sn,∃σ∈Sn))x∈n∏i=1xi,y∈n∏i=1xσi. |
By constructing special strongly regular relations on a semihypergroup, we can obtain some special quotient structures (see [6,7,8,9,10,11]). In this regards, we give a unified method for constructing special strongly regular relations. A strongly regular relation ρ on S is called a band relation if the quotient S/ρ is a band, and a semilattice relation if the quotient S/ρ is a semilattice, that is ρ is both a band relation and commutative. In this paper, we introduce three preliminary relations on a semihypergroup. Using these relations, we construct the commutative relation, the band relation and the semilattice relation generated by a given binary relation. As consequences, the least commutative relation, the least band relation and the least semilattice relation on S are given. Moreover, we show that the set of all commutative relations, the set of all band relations and the set of all semilattice relations on S are complete lattices.
Let (S,∘) be a semihypergroup and ρ a binary relation on S. We denote by ρrs the relation ρ∪ρ−1∪1S on S. It is obvious that ρrs is the smallest reflexive and symmetric relation containing ρ. Let {ρi∣i∈I} be the family of all strongly regular relations on S containing ρ. Then the relation ⋂i∈Iρi is clearly the least strongly regular relation on S containing ρ, which is called the strongly regular relation on S generated by ρ. Similarly, the least commutative (resp. band, semilattice) relation on S containing ρ, denoted by ρc (resp. ρb, ρs), is called the commutative (resp. band, semilattice) relation on S generated by ρ.
Definition 2.1. Let ρ be a binary relation on a semihypergroup (S,∘). We define the relation ρsc on S as
uρscv⇔(∃(x1,x2,⋯,xm)∈(S1)m,(y1,y2,⋯,yn)∈(S1)n)(∃(a,b)∈ρ),u∈m∏i=1xi∘a∘n∏j=1yj,v∈m∏i=1xi∘b∘n∏j=1yj. |
It is easy to see that ρsc has the following property.
Lemma 2.1. Let ρ and σ be two relations on a semihypergroup (S,∘). Then
(i) ρ⊆σ⇒ρsc⊆σsc;
(ii) (ρsc)−1=(ρ−1)sc;
(iii) (ρ∪σ)sc=ρsc∪σsc.
Lemma 2.2. Let ρ be a binary relation on a semihypergroup (S,∘). Then ρsc is the least strongly compatible relation on S containing ρ.
Proof. (1) If (u,v)∈ρ, then (u,v)∈(1∘u∘1)×(1∘v∘1). Thus (u,v)∈ρsc and so ρ⊆ρsc.
(2) Let (u,v)∈ρ and w∈S. Then
(u,v)∈(m∏i=1xi∘a∘n∏j=1yj)×(m∏i=1xi∘b∘n∏j=1yj) |
for some x1,x2,⋯,xm,y1,y2,⋯,yn∈S1 and some (a,b)∈ρ. Hence
w∘u⊆(w∘m∏i=1xi)∘a∘n∏j=1yj, |
w∘v⊆(w∘m∏i=1xi)∘b∘n∏j=1yj, |
and so
(w∘u)¯¯ρsc(w∘v). |
Therefore, ρsc is left strongly compatible. In the same way, we can obtain that ρsc is right strongly compatible.
(3) Suppose that σ is a strongly compatible relation on S containing ρ. Then for all x1,x2,⋯,xm,y1,y2,⋯,yn∈S1 and all (a,b)∈ρ, we have
(m∏i=1xi∘a∘n∏j=1yj)ˉˉσ(m∏i=1xi∘b∘n∏j=1yj). |
Hence, ρsc⊆σ.
Lemma 2.3. Let ρ be a binary relation on a semihypergroup (S,∘). Then (ρsc)∞ is a strongly compatible relation on S.
Proof. Let (u,v)∈(ρsc)∞. Then (u,v)∈(ρsc)n for some positive integer n. Thus there exist a1,a2,⋯,an−1∈S such that
uρsca1ρsca2ρsc⋯ρscan−1ρscv. |
It follows from Lemma 2.2 that
(w∘u)¯¯ρsc(w∘a1)¯¯ρsc(w∘a2)¯¯ρsc⋯¯¯ρsc(w∘an−1)¯¯ρsc(w∘v) |
for all w∈S. Hence
(w∘u)¯¯(ρsc)n(w∘v) |
and so
(w∘u)¯¯(ρsc)∞(w∘v). |
Similarly,
(u∘w)¯¯(ρsc)∞(v∘w). |
Therefore, (ρsc)∞ is strongly compatible.
Denote
C=⋃a,b∈S{(x,y)∣x∈a∘b,y∈b∘a},B=⋃a∈S{(a,b)∣b∈a∘a},S=C∪B. |
Theorem 2.1. Let ρ be a binary relation on a semihypergroup (S,∘). Then
(i) ρc=(((ρ∪C)rs)sc)∞;
(ii) ρb=(((ρ∪B)rs)sc)∞;
(iii) ρs=(((ρ∪S)rs)sc)∞.
Proof. (i) Denote δ=(((ρ∪C)rs)sc)∞. It is easy to see that δ is an equivalence relation containing ρ and C on S. Moreover, by Lemma 2.2 and 2.3, we have δ is strongly compatible. Therefore, δ is a strongly regular relation on S. Thus (S/δ,⋆) is a semigroup, where the operation ⋆ is defined as
(a)δ⋆(b)δ=(x)δ(∀x∈a∘b) |
for every a,b∈S. Next, we show that S/δ is commutative. In fact, for any x∈a∘b and y∈b∘a, we have xCy and so xδy. Hence,
(a)δ⋆(b)δ=(x)δ=(y)δ=(b)δ⋆(a)δ. |
Suppose that σ is a commutative relation on S containing ρ. It is obvious that C⊆σ. Then
(ρ∪C)rs=(ρ∪C)∪(ρ∪C)−1∪1S⊆σ∪σ−1∪1S=σ. |
Hence
((ρ∪C)rs)sc⊆σsc=σ |
from Lemma 2.1 and 2.2. Therefore,
(((ρ∪C)rs)sc)∞⊆σ∞=σ. |
Thus, we obtain our conclusion.
The conclusions (ii) and (iii) can be obtained by applying the similar approach in the proof of (i).
From Theorem 2.1, we can obtain the least commutative relation which is also given in another form γ∗ (see [5]), the least band relation and the least semilattice relation on a semihypergroup.
Corollary 2.1. Let S be a semihypergroup. Then ((Crs)sc)∞ (resp. ((Brs)sc)∞, ((Srs)sc)∞) is the least commutative (resp. band, semilattice) relation on S.
Let S be a semihypergroup. We denote by C(S),B(S) and SL(S) the set of all commutative relations, the set of all band relations and the set of all semilattice relations on S respectively. It is obvious that C(S),B(S) and SL(S) are partially ordered sets under the set inclusion. In the following, we show that (C(S),⊆,∩,∨c), (B(S),⊆,∩,∨b) and (SL(S),⊆,∩,∨s) are complete lattices where ∨c,∨b and ∨s are defined as
ρ∨cσ=(ρ∪σ)c,ρ∨bσ=(ρ∪σ)b,ρ∨sσ=(ρ∪σ)s. |
A meet-semilattice (∩-semilattice) L is said to be ∩-complete if every subset of L has a minimum element. Dually, a join-semilattice (∪-semilattice) L is said to be ∪-complete if every subset of L has a maximum element. A lattice is said to be complete if it is both ∩-complete and ∪-complete.
Lemma 3.1. (Theorem 2.11 [12]) A ∩-complete ∩-semilattice is a complete lattice if and only if it has a maximum element.
Theorem 3.1. Let (S,∘) be a semihypergroup. Then (C(S),⊆,∩,∨c), (B(S),⊆,∩,∨b) and (SL(S),⊆,∩,∨s) are complete lattices.
Proof. We just prove that (C(S),⊆,∩,∨c) is a complete lattice. Using the similar approach, we can obtain that (B(S),⊆,∩,∨b) and (SL(S),⊆,∩,∨s) are also complete lattices.
It is obvious that the universal relation S×S is the maximum element of C(S). From Lemma 3.1, we need only show that C(S) is a ∩-complete ∩-semilattice. Let {ρα∣α∈Γ} be a family of commutative relations on S. Then ⋂α∈Γρα is a commutative relation on S. Indeed, we know from [13] that ⋂α∈Γρα is a strongly regular relation on S. Thus (S/⋂α∈Γρα,⋆) is a semigroup, where the operation ⋆ is defined as
(a)⋂α∈Γρα⋆(b)⋂α∈Γρα=(x)⋂α∈Γρα(∀x∈a∘b) |
for every a,b∈S. For any x∈a∘b and y∈b∘a, we have xCy. It follows from C⊆⋂α∈Γρα that x⋂α∈Γραy. Hence, (S/⋂α∈Γρα,⋆) is a commutative semigroup and so ⋂α∈Γρα∈C(S).
Remark 3.1. Let (S,∘) be a semihypergroup. We know from Theorem 3.1 that C(S),B(S) and SL(S) are all complete lattices. Moreover, it is easy to see that SL(S)=C(S)∩B(S) as lattices.
At the end of this paper, we illustrate our main results by the following example.
Example 3.1. Let S={a,b,c,d} with the operation ∘ below:
∘abcda{a,d}{a,d}{a,d}{a}b{a,d}{b}{a,d}{a,d}c{a,d}{a,d}{c}{a,d}d{a}{a,d}{a,d}{d} |
Then (S,∘) is a semihypergroup. It is obvious that S={(a,a),(a,d),(b,b),(c,c),(d,a),(d,d)}. Define two relations ρ1={(a,b)} and ρ2={(a,c)}. Then we have
Ss=S, |
ρs1=S∪{(a,b),(b,a),(b,d),(d,b)}, |
ρs2=S∪{(a,c),(c,a),(c,d),(d,c)}, |
(ρ1∪ρ2)s=S×S. |
Moreover, it is not difficult to verify that SL(S)={S,ρs1,ρs2,S×S}. Since S=ρs1∩ρs2 and ρs1∨sρs2=S×S, we have (SL(S),⊆,∩,∨s) is a complete lattice.
Let ρ be a binary relation on a semihypergroup S. In this paper, we characterize the commutative relation ρc (resp. band relation ρb, semilattice relation ρs) generated by ρ on S. Finally, we show that the set of all commutative relations C(S) (resp. band relations B(S), semilattice relations SL(S)) on S is a complete lattice.
The author thanks the editor and referees whose comments led to significant improvements to this paper. This work is supported by the National Natural Science Foundation of China (No. 11701504), the Guangdong Basic and Applied Basic Research Foundation (No. 2022A1515011081), the Characteristic Innovation Project of Department of Education of Guangdong Province (No. 2020KTSCX159), the Innovative Research Team Project of Zhaoqing University and the Scientific Research Ability Enhancement Program for Excellent Young Teachers of Zhaoqing University.
The author declares no conflict of interest.
[1] | B. Davvaz, Semihypergroup Theory, London: Academic Press, 2016. https://doi.org/10.1016/C2015-0-06681-3 |
[2] |
M. De Salvo, D. Fasino, D. Freni, G. Lo Faro, 1-hypergroups of small sizes, Mathematics, 9 (2021), 108. https://doi.org/10.3390/math9020108 doi: 10.3390/math9020108
![]() |
[3] |
M. De Salvo, D. Fasino, D. Freni, G. Lo Faro, On hypergroups with a β-class of finite height, Symmetry, 12 (2020), 168. https://doi.org/10.3390/sym12010168 doi: 10.3390/sym12010168
![]() |
[4] | M. Koskas, Groupoides, demi-hypergroupes et hypergroupes, J. Math. Pures Appl., 49 (1970), 155–192. |
[5] |
D. Freni, A new characterization of the derived hypergroup via strongly regular equivalences, Comm. Algebra, 30 (2006), 3977–3989. https://doi.org/10.1081/AGB-120005830 doi: 10.1081/AGB-120005830
![]() |
[6] |
H. Aghabozorgi, B. Davvaz, M. Jafarpour, Nilpotent groups derived from hypergroups, J. Algebra, 382 (2013), 177–184. https://doi.org/10.1016/j.jalgebra.2013.02.011 doi: 10.1016/j.jalgebra.2013.02.011
![]() |
[7] |
R. Ameri, E. Mohammadzadeh, Engel groups derived from hypergroups, European J. Combin., 44 (2015), 191–197. https://doi.org/10.1016/j.ejc.2014.08.004 doi: 10.1016/j.ejc.2014.08.004
![]() |
[8] |
Z. Gu, On cyclic hypergroups, J. Algebra Appl., 18 (2019), 1950213. https://doi.org/10.1142/S021949881950213X doi: 10.1142/S021949881950213X
![]() |
[9] |
Z. Gu, X. L. Tang, Ordered regular equivalence relations on ordered semihypergroups, J. Algebra, 450 (2016), 384–397. https://doi.org/10.1016/j.jalgebra.2015.11.026 doi: 10.1016/j.jalgebra.2015.11.026
![]() |
[10] |
M. Jafarpour, H. Aghabozorgi, B. Davvaz, Solvable groups derived from hypergroups, J. Algebra Appl., 15 (2016), 1650067. https://doi.org/10.1142/S0219498816500675 doi: 10.1142/S0219498816500675
![]() |
[11] |
S. S. Mousavi, V. Leoreanu-Fotea, M. Jafarpour, H. Babaei, Equivalence relations in semihypergroups and the corresponding quotient structures, European J. Combin., 33 (2012), 463–473. https://doi.org/10.1016/j.ejc.2011.11.008 doi: 10.1016/j.ejc.2011.11.008
![]() |
[12] | T. S. Blyth, Lattices and Ordered Algebraic Structures, London: Springer, 2005. https://doi.org/10.1007/b139095 |
[13] |
R. Ameri, Fuzzy congruence of hypergroups, J. Intell. Fuzzy Syst., 19 (2008), 141–149. https://doi.org/10.5555/1369389.1369394 doi: 10.5555/1369389.1369394
![]() |