1. Introduction
In [
1], Rasouli established a connection between stabilizers and Galois connection in residuated lattices. For more details about Galois connections, we refer the reader to Chapter 1 of [
2]. Some examples for Galois connections can be found in [
2]. Motivated by the recent work of S. Rasouli [
1], on Galois connection of stabilizers in residuated lattices, we investigate Galois connections between ordered semihyperrings.
Hypergroups were introduced in 1934 by Marty [
3] as group generalizations. The notion of hyperrings and hyperfields was introduced by Krasner [
4] as a generalization of rings. Hyperrings and hyperfields were introduced by Krasner in connection with his work on valued fields. In [
5], Jun studied algebraic and geometric aspects of Krasner hyperrings. Some principal applications of hyperring theory can be found in Chapter 8 of [
6].
Derivations has been of great interest to different fields of science. The notion of derivation in a prime ring first appeared in Posner’s classic paper [
7]. The study of derivations is an interesting topic in hyperstructure theory. Asokkumar [
8] and Kamali Ardekani and Davvaz [
9] initiated the study of derivations on hyperrings and prime hyperrings. In 2017, Zhang and Li [
10] studied derivations of partially ordered sets. In 2019, Omidi and Davvaz [
11] studied derivation in (ordered) hyper(near)-rings. Derivations have been applied in coding theory [
12].
The interested reader can find all relevant applications of monoids and categories in wreath products and graphs in [
13]. Maximal ideals and congruences of the partial semiring
of all continuous functions are investigated in [
14]. The tropical semiring has various applications, and forms the basis of tropical geometry. In [
15], the authors found formulas for the subpolygroup commutativity degree of some polygroups and applied it to the polygroup associated to the dihedral group. The dihedral group
is the symmetry group of a regular polygon with
n sides.
A mapping
is called a
hyperoperation on
S. By
hypergroupoid we mean a non-empty set
S, endowed with a hyperoperation ∘. If
and
, then:
A hypergroupoid
is called a
semihypergroup if for all
,
, which means that:
Bijan Davvaz, in Chapter 3 of his book
"Semihypergroup Theory" [
16], studied ordered semihypergroups. An ordered semihypergroup
is a semihypergroup
together with a partial order relation ≤ that is compatible with the hyperoperation ∘. The concept of an ordered semihypergroup was first defined by Heidari and Davvaz [
17]. Many researchers worked on the ordered semihypergroups, (see [
18,
19,
20]). For instance, in 2015, Davvaz et al. studied the pseudoorder of the product of ordered semihypergroups [
18]. After that, in [
19], Gu and Tang presented basic results of ordered regular equivalence relations on ordered semihypergroups. Later, Tang et al. [
20] completely proved the following open problem on ordered semihypergroups.
Open Problem. [
18] Is there a regular relation
on an ordered semihypergroup
for which
is an ordered semihypergroup?
In [
21], Cristea and Kankaraš studied the reducibility of hyperrings. In [
22,
23], the (
m-)
k-hyperideals of an ordered semihyperring are studied. In [
23], the concept of derivation on ordered semihyperrings are studied and the relation between
m-
k-hyperideals and
k-hyperideals on ordered semihyperrings are investigated. Omidi and Davvaz [
24] tried to make connections between ordered semihyperrings by using 2-hyperideals. Let
be an ordered semihyerring and
I a proper 2-hyperideal of
R. Consider the Rees relation
on
R as follows:
By Theorem 3.8 of [
24],
is an ordered regular equivalence relation on
R. In fact, the authors constructed an ordered regular equivalence relation
on an ordered semihyperring
R by a proper 2-hyperideal
I of
R, such that the corresponding quotient structure is also an ordered semihyperring. In [
25], the authors studied ordered semihyperrings to find a strongly regular relation such that the constructed quotient structure is an ordered semiring. Motivated by the above works on ordered semihyperrings [
22,
23,
24,
25], in this study, we define the concept of an (antitone) Galois connection between ordered semihyperrings; several properties are provided. Furthermore, we discuss the relationship between ordered semihyperrings by using two fundamental notions, the homomorphisms of ordered semihyperrings and the homo-derivations. The study ends with conclusions and ideas for future work.
By a
semihyperring [
26], we mean a triple hypergroup
with two hyperoperations + and · such that:
- (1)
is a (commutative) semihypergroup;
- (2)
is a semi(hyper)group;
- (3)
· is distributive with respect to the hyperoperation +, i.e., and for all .
If there exists an element
such that
and
for all
; then 0 is called the
zero element of
R. The
ordered semihyperring (po-semihyperring),
[
25] introduced by Omidi and Davvaz, is defined as follows:
Definition 1. [25] A semihyperring , together with a suitable (partial) order (reflexive, anti-symmetric, and transitive) relation ≤ that is compatible with the hyperoperations ⊕ and ⊙, i.e., - (1)
for any , implies ;
- (2)
for any , implies and ,
is called an ordered semihyperring. Here, if U and V are non-empty subsets of R, then: A non-empty subset of an ordered semihyperring is called a subsemihyperring of T if for all , , and is the relation ≤ restricted to .
Definition 2. [25] Let and be two ordered semihyperrings. The map is called a homomorphism if for all , we have: - (1)
,
- (2)
,
- (3)
φ is isotone, i.e., implies .
Furthermore, is an order-embedding homomorphism if for all , if , then .
Definition 3. [1,27] Let and be ordered sets. Suppose and are a pair of functions such that for all and all ,Then the pair is called a antitone Galois connection between and . 2. Main Results
First of all, we consider an ordered semihyperring, where we define an ordered regular equivalence relation , such that the quotient is an ordered semihyperring. In fact, we can construct an ordered semihyperring on the quotient set.
Example 1. Let be a set with two symmetrical hyperoperations + and · and the (partial) order relation on R defined as follows:Then (R,+,·,≤R) R We can now set:Consider the regular equivalence relation on R as follows:By definition of , we obtain:Then , where , and . Clearly, is an ordered semihyperring, where ⊕, ⊙ and are defined by:The Hasse diagram and the figure of are given by: The aim of this study is to introduce (antitone) the Galois connection between ordered semihyperrings. Moreover, some properties of these connections are investigated.
Theorem 1. Suppose that φ is a homomorphism of an ordered semihyperring onto an ordered semihyperring . If φ is an order-embedding homomorphism, then φ is injective.
Proof. Let . Then and . Since is an order-embedding homomorphism, we get and . This implies that . Thus, is an injective homomorphism. □
An isomorphism from into is a bijective good homomorphism. Then is an isomorphism if and only if is a surjection and is an order-embedding homomorphism. We continue this section with the following definition.
Definition 4. Let and be ordered semihyperrings. Suppose and are a pair of functions such that for all and all ,Then the pair is called a Galois connection between and . Example 2. Let φ be an isomorphism between and . Then is also one. Thus, we have:So,Then forms a Galois connection between and . Proposition 1. Let , and be ordered semihyperrings. Suppose and are a pair of functions, such that is a Galois connection between and . Let and be a pair of functions, such that is a Galois connection between and . Then, forms a Galois connection between and .
Proof. Let
,
and
. Since
is a Galois connection, then we have:
So,
On the other hand, by Definition 4, we have:
Which implies that:
Now, it is easy to see that:
Therefore, by Definition 4,
forms a Galois connection between
and
. □
Theorem 2. Let and be ordered semihyperrings. Suppose and are a pair of functions. Then is a Galois connection between and if and only if:
- (1)
for all , , and ;
- (2)
φ and ψ are both isotone.
Proof. Let form a Galois connection. Consider . Since is reflexive, we get . As a particular case of Definition 4, we have . Similarly, we have . Now, let . If , then by condition (1), we get . Since is transitive, it follows that . But, by Definition 4, we have . So, is isotone. Similarly, we can show that is isotone.
Conversely, let (1) and (2) be holds. Let for some and . Since is isotone, it follows that . By condition (1), we have . Since is transitive, we get . Therefore, forms a Galois connection between and . □
For a semihyperring
with (partial) order relation
, a
derivation on
T [
23] is a function
having the property that (i)
for all
; (ii)
for all
and (iii)
d is isotone, i.e., for any
,
implies
. A derivation
d on an ordered semihyperring
is called
positive if
for
. We say that a positive derivation
d on
R is a
homo-derivation on
R if
. In the following example, we present the Galois connection between homomorphisms and derivations on an ordered semihyperring.
Example 3. Consider the semihyperring with the symmetrical hyperaddition + and the hypermultiplication · defined as follows:We can now set:Then is an ordered semihyperring The covering relation and the Hasse diagram of R are given by:Define a function by and . Now, we have:and:Furthermore,and,We can easily verify that implies , for all . Hence, d is a derivation on R. On the other hand, we have:Hence, d is a homo-derivation on R. By Theorem 2, is a Galois connection for . Theorem 3. Let and be ordered semihyperrings. If is a Galois connection between and , then:
- (1)
;
- (2)
.
Proof. (1): By Theorem 2, we have . So, . Now, let and . By Theorem 2, is isotone. It implies that . On the other hand, . Therefore, and hence is the maximum of .
(2): It is an interesting exercise. □
Definition 5. Let be an ordered semihyperring. A closure function for is a function φ such that, for all , we have:
- (1)
φ is extensive, i.e., ;
- (2)
If , then ;
- (3)
φ is idempotent, i.e., .
Theorem 4. Let and be ordered semihyperrings. If is a Galois connection between and , then is a closure function for .
Proof. The following are the steps of our definition:
Step 1. By Theorem 2, we have for all .
Step 2. By Theorem 2, and are both isotone. If , then . It implies that .
Step 3. Let
. By Theorem 2, we have
. Since
is isotone, it follows that
. As
is reflexive,
But by Definition 4 we have:
Since
is antisymmetric, we get
. Thus,
Therefore,
is a closure function for
. □
Let
and
be ordered semihyperrings. Suppose
and
are a pair of functions.
is
antitone if
implies
, for all
. There is an
antitone Galois connection between
and
, meaning a pair of functions
such that:
Theorem 5. Let and be ordered semihyperrings. Suppose and are a pair of functions. Then is an antitone Galois connection between and if and only if:
- (1)
for all , , and ;
- (2)
φ and ψ are both antitone.
Proof. Let form an antitone Galois connection. Consider . Since is reflexive, . As a particular case of Definition 4, we have . Then, . Similarly, we have . Now, let . If , then by condition (1), we get . Since is transitive, it follows that . As is an antitone Galois connection, . Then, is antitone. Similarly, we can prove that is antitone.
Conversely, let (1) and (2) hold. Let
for some
and
. Since
is antitone, it follows that
. By condition (1),
, then we get:
Thus,
implies
. Similarly,
implies
. Therefore,
forms an antitone Galois connection between
and
. □