Startseite A further study on ordered regular equivalence relations in ordered semihypergroups
Artikel Open Access

A further study on ordered regular equivalence relations in ordered semihypergroups

  • Jian Tang , Xinyang Feng , Bijan Davvaz und Xiang-Yun Xie EMAIL logo
Veröffentlicht/Copyright: 20. März 2018

Abstract

In this paper, we study the ordered regular equivalence relations on ordered semihypergroups in detail. To begin with, we introduce the concept of weak pseudoorders on an ordered semihypergroup, and investigate several related properties. In particular, we construct an ordered regular equivalence relation on an ordered semihypergroup by a weak pseudoorder. As an application of the above result, we completely solve the open problem on ordered semihypergroups introduced in [B. Davvaz, P. Corsini and T. Changphas, Relationship between ordered semihypergroups and ordered semigroups by using pseuoorders, European J. Combinatorics 44 (2015), 208–217]. Furthermore, we establish the relationships between ordered regular equivalence relations and weak pseudoorders on an ordered semihypergroup, and give some homomorphism theorems of ordered semihypergroups, which are generalizations of similar results in ordered semigroups.

MSC 2010: 20N20; 06F05; 20M12

1 Introduction

The theory of algebraic hyperstructures was first introduced by Marty [1], which is a generalization of the theory of ordinary algebraic structures. Later on, people have observed that hyperstructures have many applications to several branches of both pure and applied sciences (see [2, 3, 4, 5]). In particular, a semihypergroup is the simplest algebraic hyperstructure which possess the properties of closure and associativity. Nowadays, semihypergroups have been found useful for dealing with problems in different areas of algebraic hyperstructures. Many authors have studied different aspects of semihypergroups, for instance, see [6, 7, 8, 9, 10, 11, 12, 13]. Especially, regular and strong regular relations on semihypergroups have been introduced and investigated in [14].

On the other hand, the theory of ordered algebraic structure was first studied by Fuchs [15] in 1960’s. In particular, an ordered semigroup is a semigroup together with a partial order that is compatible with the semigroup operation. Ordered semigroups have several applications in the theory of sequential machines, formal languages, computer arithmetics and error-correcting codes. There are several results which have been added to the theory of ordered semigroups by many researchers, for example, N. Kehayopulu, M. Tsingelis, X. Y. Xie, M. Kuil and others. For partial results, the reader is referred to [16, 17, 18, 19, 20, 21, 22].

A theory of hyperstructures on ordered semigroups has been recently developed. In [23], Heidari and Davvaz applied the theory of hyperstructures to ordered semigroups and introduced the concept of ordered semihypergroups, which is a generalization of the concept of ordered semigroups. Also see [2]. The work on ordered semihypergroup theory can be found in [24, 25, 26, 27]. It is worth pointing out that Davvaz et al. [25] introduced the concept of a pseudoorder on an ordered semihypergroup, and extended some results in [16] on ordered semigroups to ordered semihypergroups. In particular, they posed an open problem about ordered semihypergroups: Is there a regular relation ρ on an ordered semihypergroup (S, ∘, ≤) for which S/ρ is an ordered semihypergroup? To answer the above open problem, Gu and Tang attempted in [28] to introduce the concept of ordered regular equivalence relations on ordered semihypergroups, and construct an ordered regular equivalence relation ρI on an ordered semihypergroup S by a proper hyperideal I of S such that the corresponding quotient structure is also an ordered semihypergroup. However, they only provide a partial solution to the above problem. In fact, for an ordered semihypergroup S, S doesn’t necessarily exist a proper hyperideal (see Example 3.3). As a further study, in the present paper we study the ordered regular equivalence relations on ordered semihypergroups in detail and completely solve the open problem given by Davvaz et al. in [25].

The rest of this paper is organized as follows. In Section 2 we recall some basic notions and results from the hyperstructure theory which will be used throughout this paper. In Section 3, we introduce the concept of weak pseudoorders on an ordered semihypergroup S, and illustrate this notion is a generalization of the concept of pseudoorders on S by some examples. Furthermore, the properties of weak pseudoorders on an ordered semihypergroup are investigated. In particular, we construct an ordered regular equivalence relation on an ordered semihypergroup by a weak pseudoorder. As an application of the above result, we give a complete answer to the open problem given by Davvaz et al. in [25]. In Section 4, the relationships between ordered regular equivalence relations and weak pseudoorders on an ordered semihypergroup is established, and some homomorphism theorems of ordered semihypergroups by weak pseudoorders are given. Some conclusions are given in the last Section.

2 Preliminaries and some notations

Recall that a hypergroupoid (S, ∘) is a nonempty set S together with a hyperoperation, that is a map ∘ : S × SP(S), where P(S) denotes the set of all the nonempty subsets of S. The image of the pair (x, y) is denoted by xy. If xS and A, BP(S), then AB is defined by AB=aA,bBab. Also Ax is used for A ∘ {x} and xA for {x} ∘ A. Generally, the singleton {x} is identified by its element x.

We say that a hypergroupoid (S, ∘) is a semihypergroup if the hyperoperation “∘” is associative, that is, (xy) ∘ z = x ∘ (yz) for all x, y, zS (see [14]).

We now recall the notion of ordered semihypergroups from [23]. An algebraic hyperstructure (S, ∘, ≤) is called an ordered semihypergroup (also called po-semihypergroup in [23]) if (S, ∘) is a semihypergroup and (S, ≤) is a partially ordered set such that: for any x, y, aS, xy implies axay and xaya. Here, if A, BP(S), then we say that AB if for every aA there exists bB such that ab. Clearly, every ordered semigroup can be regarded as an ordered semihypergroup, see [26]. By a subsemihypergroup of an ordered semihypergroup S we mean a nonempty subset A of S such that AAA. A nonempty subset A of a semihypergroup (S, ∘) is called a left (resp. right) hyperideal of S if (1) SAA (resp. ASA) and (2) If aA and Sba, then bA. If A is both a left and a right hyperideal of S, then it is called a hyperideal of S (see [26]).

Let ρ be a relation on a semihypergroup (S, ∘) or an ordered semihypergroup (S, ∘, ≤). If A and B are nonempty subsets of S, then we set

AρB(aA)(bB)aρb,AρB(bB)(aA)aρb,Aρ¯BAρBandAρB,Aρ¯¯B(aA,bB)aρb.

An equivalence relation ρ on S is called regular [14, 25] if

(x,y,aS)xρyaxρ¯ayandxaρ¯ya;

ρ is called strongly regular [14, 25] if

(x,y,aS)xρyaxρ¯¯ayandxaρ¯¯ya.

Example 2.1

We consider a set S:= {a, b, c, d} with the following hyperoperation “∘” and the order “≤”:

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}:={(a,a),(a,b),(a,c),(b,b),(c,c),(d,b),(d,c),(d,d)}.

We give the covering relation “≺” and the figure of S as follows:

={((a,b),(a,c),(d,b),(d,c)}.

Then (S, ∘, ≤) is an ordered semihypergroup (see [26]). Let ρ1, ρ2be equivalence relations on S defined as follows:

ρ1:={(a,a),(a,d),(b,b),(c,c),(d,a),(d,d)},ρ2:={(a,a),(a,c),(b,b),(c,a),(c,c),(d,d)}.

Then

  1. ρ1is a strongly regular relation on S.

  2. ρ2is a regular relation on S, but it is not a strongly regular relation on S. In fact, since aρc, while aaρ̿ca doesn’t hold.

Lemma 2.2

([14]). Let (S, ∘) be a semihypergroup and ρ an equivalence relation on S. Then

  1. If ρ is regular, then (S/ρ, ⊗) is a semihypergroup with respect to the following hyperoperation: (a)ρ ⊗ (b)ρ = cab(c)ρ. In this case, we call (S/ρ, ⊗) a quotient semihypergroup.

  2. If ρ is strongly regular, then (S/ρ, ⊗) is a semigroup with respect to the following operation: (a)ρ ⊗ (b)ρ = (c)ρfor allab. In this case, we call (S/ρ, ⊗) a quotient semigroup.

A relation ρ on an ordered semihypergroup (S, ∘, ≤) is called pseudoorder [25] if it satisfies the following conditions: (1) ≤⊆ ρ, (2) aρb and bρc imply aρc, i.e., ρρρ and (3) aρb implies acρ̿bc and caρ̿cb, for all cS.

Example 2.3

Consider the ordered semihypergroup (S, ∘, ≤) given in Example 2.1, and define a relation ρ on S as follows:

ρ:={(a,a),(a,b),(a,c),(a,d),(b,b),(c,c),(d,a),(d,b),(d,c),(d,d)}.

It is not difficult to verify that ρ is a pseudoorder on S.

Let (S, ∘, ≤), (T, ⋄, ⪯) be two ordered semihypergroups and f: ST a mapping from S to T. f is called isotone if xy implies f(x)⪯ f(y), for all x, yS. f is called reverse isotone if x, yS, f(x) ⪯ f(y) implies xy. f is called homomorphism [25] if it is isotone and satisfies f(x) ⋄ f(y) = zxyf(z), for all x, yS. f is called isomorphism if it is homomorphism, onto and reverse isotone. The ordered semihypergroups S and T are called isomorphic, in symbol ST, if there exists an isomorphism between them.

Remark 2.4

Let S and T be two ordered semihypergroups. If f is a homomorphism and reverse isotone mapping from S to T, then SIm(f).

In order to investigate the structure of quotient ordered semihypergroups, Gu and Tang [28] introduced the concept of (strongly) ordered regular equivalence relations on an ordered semihypergroup. A regular (resp. strongly regular) equivalence relation ρ on an ordered semihypergroup S is called ordered regular (resp. strongly ordered regular) if there exists an order relation “⪯” on (S/ ρ, ⊗) such that:

  1. (S/ρ, ⊗, ⪯) is an ordered semihypergroup (resp. ordered semigroup), where the hyperoperation “ ⊗” is defined as one in Lemma 2.2.

  2. The mapping φ : SS/ρ, x ↦ (x)ρ is isotone, that is, φ is a homomorphism from S onto S/ρ.

    The reader is referred to [2, 19] for notation and terminology not defined in this paper.

3 Weak pseudoorders on ordered semihypergroups

In [25], Davvaz et al. obtained an ordered semigroup from an ordered semihypergroup by means of pseudoorders. In the same paper they posed the following open problem about ordered semihypergroups.

Problem 3.1

Is there a regular equivalence relation ρ on an ordered semihypergroup (S, ∘, ≤) for which S/ρ is an ordered semihypergroup?

To answer the above open problem, Gu and Tang [28] defined an equivalence relation ρI on an ordered semihypergroup S as follows:

ρI:={(x,y)SI×SI|x=y}(I×I),

where I is a proper hyperideal of S. Furthermore, they provided the following theorem:

Theorem 3.2

([28]). Let (S, ∘, ≤) be an ordered semihypergroup and I a hyperideal of S. Then ρI is an ordered regular equivalence relation on S.

As we have seen in Theorem 3.2, for an ordered semihypergroup S, there exists a regular equivalence relation ρI on S such that the corresponding quotient structure S/ρI is also an ordered semihypergroup, where I is a proper hyperideal I of S. However, in general, there need not exist proper hyperideals in S. We can illustrate it by the following example.

Example 3.3

We consider a set S:= {a, b, c, d} with the following hyperoperation “∘” and the order “≤”:

abcda{a}{a,b}{a,c}Sb{b}{b}{b,d}{b,d}c{c}{c,d}{c}{c,d}d{d}{d}{d}{d}:={(a,a),(a,b),(b,b),(c,c),(c,d),(d,d)}.

We give the covering relation “≺” and the figure of S as follows:

={(a,b),(c,d)}.

Then (S, ∘, ≤) is an ordered semihypergroup. Moreover, it is a routine matter to verify that there do not exist proper hyperideals in S.

By the above example, it can be seen that Theorem 3.2 only provides a partial solution to Problem 3.1, and not completely. In order to fully solve the open problem, we need define and study the weak pseudoorders on an ordered semihypergroup.

If A, BP(S), then we set

Aρ~B(aA)(bB)aρbandbρa&(bB)(aA)aρbandbρa.

Definition 3.4

Let (S, ∘, ≤) be an ordered semihypergroup and ρ a relation on S. ρ is called weak pseudoorder if it satisfies the following conditions:

  1. ≤⊆ ρ;

  2. aρb and bρc imply aρc;

  3. aρb implies acρ⃗ bc and ca ρ⃗ cb, for all cS;

  4. aρb and bρa imply ac ρ̃ bc and ca ρ̃ cb, for all cS.

Remark 3.5

Note that if (S, ∘, ≤) is an ordered semigroup, then Definition 3.4 coincides with Definition 1 in [16].

Lemma 3.6

Let (S, ∘, ≤) be an ordered semihypergroup. Then there exists a weak pseudoorder relation on S.

Proof

With a small amount of effort one can verify that the order relation “≤” on S is a weak pseudoorder relation on S. □

One can easily observe that every pseudoorder relation on an ordered semihypergroup S is a weak pseudoorder on S. However, the converse is not true, in general, as shown in the following example.

Example 3.7

We consider a set S:= {a, b, c, d} with the following hyperoperation “∘” and the order “≤”:

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}:={(a,a),(a,c),(b,b),(c,c),(d,c),(d,d)}.

We give the covering relation “≺” and the figure of S as follows:

={(a,c),(d,c)}.

Then (S, ∘, ≤) is an ordered semihypergroup. Let ρ be a relation on S defined as follows:

ρ:={(a,a),(b,b),(c,c),(d,d),(a,c),(b,a),(b,c),(d,a),(d,c)}.

We can easily verify that ρ is a weak pseudoorder on S, but it is not a pseudoorder on S. In fact, since aρc, while abρ̿cb doesn’t hold.

In the following, we shall construct a regular equivalence relation on an ordered semihypergroup by a weak pseudoorder, from which we can answer Problem 3.1 completely.

Theorem 3.8

Let (S, ∘, ≤) be an ordered semihypergroup and ρ a weak pseudoorder on S. Then, there exists a regular equivalence relation ρ*on S such that S/ρ*is an ordered semihypergroup.

Proof

We denote by ρ* the relation on S defined by

ρ:={(a,b)S×S|aρbandbρa}(=ρρ1).

First, we claim that ρ* is a regular equivalence relation on S. In fact, for any aS, clearly, (a, a) ∈≤⊆ ρ, so *a. If (a, b) ∈ ρ*, then aρb and bρa. Thus (b, a) ∈ ρ*. Let (a, b) ∈ ρ* and (b, c) ∈ ρ*. Then aρb, bρa, bρc and cρb. Hence aρc and cρa. It implies that (a, c) ∈ ρ*. Thus ρ* is an equivalence relation on S. Now, let *b and cS. Then aρb and bρa. Since ρ is a weak pseudoorder on S, by condition (4) of Definition 3.4, we have

acρ~bcandcaρ~cb.

Thus, for every xac, there exists ybc such that xρy and yρx which imply that *y, and for every y′ ∈ bc, there exists x′ ∈ ac such that xρ y′ and yρx’ which mean that xρ*y′. It thus follows that acρ*bc. Similarly, it can be obtained that caρ*cb. Hence ρ* is indeed a regular equivalence relation on S. Thus, by Lemma 2.2, (S/ρ*, ⊗) is a semihypergroup with respect to the following hyperoperation:

((a)ρ,(b)ρS/ρ)(a)ρ(b)ρ=cab(c)ρ.

Now, we define a relation ⪯ρ on S/ρ* as follows:

ρ:={((x)ρ,(y)ρ)S/ρ×S/ρ|(x,y)ρ}.

Then (S/ρ*, ⪯ρ) is a poset. Indeed, suppose that (x)ρ*S/ρ*, where xS. Then (x, x) ∈≤⊆ ρ. Hence, (x)ρ*ρ (x)ρ*. Let (x)ρ*ρ (y)ρ* and (y)ρ*ρ (x)ρ*. Then xρy and yρx. Thus *y, and we have (x)ρ* = (y)ρ*. Now, if (x)ρ*ρ (y)ρ* and (y)ρ*ρ (z)ρ*, then xρy and yρz. Hence, by hypothesis, xρz, and we conclude that (x)ρ*ρ (z)ρ*.

Furthermore, let (x)ρ*, (y)ρ*, (z)ρ*S/ρ* be such that (x)ρ*ρ (y)ρ*. Then xρy and zS. Since ρ is a weak pseudoorder on S, by condition (3) of Definition 3.4, we have xz ρ⃗ yz and zx ρ⃗ zy. Thus, for any axz there exists byz such that aρb. This implies that (a)ρ*ρ (b)ρ*. Hence we have

(x)ρ(z)ρ=axz(a)ρρbyz(b)ρ=(y)ρ(z)ρ.

In a similar way, it can be obtained that (z)ρ* ⊗ (x)ρ*ρ (z)ρ* ⊗ (y)ρ*. Therefore, (S/ρ*, ⊗, ⪯ρ) is an ordered semihypergroup. □

Furthermore, we have the following proposition:

Proposition 3.9

Let (S, ∘, ≤) be an ordered semihypergroup and ρ a weak pseudoorder on S. Then ρ*is an ordered regular equivalence relation on S, where ρ* = ρρ−1.

Proof

By Theorem 3.8, (S/ρ*, ⊗, ⪯ρ) is an ordered semihypergroup, where the order relation ⪯ρ is defined as follows:

ρ:={((x)ρ,(y)ρ)S/ρ×S/ρ|(x,y)ρ}.

Also, let x, yS and xy. Then, since ρ is a weak pseudoorder on S, (x, y) ∈≤⊆ ρ, and thus ((x)ρ*, (y)ρ*) ∈ ⪯ρ, i.e., (x)ρ*ρ (y)ρ*. Therefore, ρ* is an ordered regular equivalence relation on S. □

Example 3.10

We consider a set S:= {a, b, c, d, e} with the following hyperoperation “∘” and the order “≤”:

abcdea{a,b}{a,b}{c}{c}{c}b{a,b}{a,b}{c}{c}{c}c{a,b}{a,b}{c}{c}{c}d{a,b}{a,b}{c}{d,e}{d}e{a,b}{a,b}{c}{d}{e}:={(a,a),(a,c),(a,d),(a,e),(b,b),(b,c),(b,d),(b,e),(c,c),(c,d),(c,e),(d,d),(e,e)}.

We give the covering relation “≺” and the figure of S as follows:

={(a,c),(b,c),(c,d),(c,e)}.

Then (S, ∘, ≤) is an ordered semihypergroup (see [26]). Let ρ be a weak pseudoorder on S defined as follows:

ρ={(a,a),(a,c),(a,d),(a,e),(b,b),(b,c),(b,d),(b,e),(c,c),(c,d),(c,e),(d,c),(d,d),(d,e),(e,c),(e,d),(e,e)}.

Applying Theorem 3.8, we get

ρ={(a,a),(b,b),(c,c),(c,d),(c,e),(d,c),(d,d),(d,e),(e,c),(e,d),(e,e)}.

Then S/ρ* = {w1, w2, w3, where w1 = {a}, w2 = {b} and w3 = {c, d, e}. Moreover, (S/ρ*, ⊗, ⪯ρ) is an ordered semihypergroup with the hyperoperation “ ⊗” and the order “ ⪯ρare given below:

w1w2w3w1{w1,w2}{w1,w2}{w3}w2{w1,w2}{w1,w2}{w3}w3{w1,w2}{w1,w2}{w3}:={(w1,w1),(w1,w3),(w2,w2),(w2,w3),(w3,w3)}.

We give the covering relation “≺ρand the figure of S/ρ*as follows:

ρ={(w1,w3),(w2,w3)}.

Similar to Theorem 4.3 in [25], we have the following theorem.

Theorem 3.11

Let (S, ∘, ≤) be an ordered semihypergroup and ρ a weak pseudoorder on S. Let

A:={θ|θisaweakpseudoorderonSsuchthatρθ}.

Let 𝓑 be the set of all weak pseudoorders on S/ρ*. Then, card(𝓐) = card(𝓑).

Proof

For θ ∈ 𝓐, we define a relation θ′ on S/ρ* as follows:

θ:={((x)ρ,(y)ρ)S/ρ×S/ρ|(x,y)θ}.

To begin with, we claim that θ′ is a weak pseudoorder on S/ρ*. To prove our claim, let ((x)ρ*, (y)ρ*) ∈⪯ρ. Then, by Theorem 3.8, (x, y) ∈ ρθ, which implies that ((x)ρ*, (y)ρ*) ∈ θ′. Thus, ⪯ρθ′. Now, assume that ((x)ρ*, (y)ρ*) ∈ θ′ and ((y)ρ*, (z)ρ*) ∈ θ′. Then, (x, y) ∈ θ and (y, z) ∈ θ. It implies that (x, z) ∈ θ. Hence, ((x)ρ*, (z)ρ*) ∈ θ′. Also, let ((x)ρ*, (y)ρ*) ∈ θ′ and (z)ρ*S/ρ*. Then, (x, y) ∈ θ and zS. Since θ is a weak pseudoorder on S, we have xzθ⃗yz and zxθ⃗zy. Thus, for every axz there exists byz, we have (a, b) ∈ θ. This implies that ((a)ρ*, (b)ρ*) ∈ θ′, and thus we have

(x)ρ(z)ρ=axz(a)ρθbyz(b)ρ=(y)ρ(z)ρ.

Similarly, we obtain that (z)ρ* ⊗ (x)ρ*θ′⃗ (z)ρ* ⊗ (y)ρ*. Furthermore, let ((x)ρ*, (y)ρ*), (z)ρ*S/ρ* be such that ((x)ρ*, (y)ρ*) ∈ θ′ and ((y)ρ*, (x)ρ*) ∈ θ′. Then (x, y) ∈ θ, (y, x) ∈ θ and zS. By hypothesis, we have xzθ͠yz and zxθ͠zy. Then, similarly as in the above proof, it can be obtained that (x)ρ* ⊗ (z)ρ*θ′͠ (y)ρ* ⊗ (z)ρ* and (z)ρ* ⊗ (x)ρ*θ′͠ (z)ρ* ⊗ (y)ρ*. Therefore, θ′ is indeed a weak pseudoorder on S/ρ*.

Now, we define the mapping f: 𝓐 → 𝓑 by f(θ) = θ′, ∀ θ ∈ 𝓐. Then, f is a bijection from 𝓐 onto 𝓑. In fact,

  1. f is well defined. Indeed, let θ1, θ2 ∈ 𝓐 and θ1 = θ2. Then, for any ((x)ρ*, (y)ρ*) ∈ θ1 we have (x, y) ∈ θ1 = θ2. It implies that ((x)ρ*, (y)ρ*) ∈ θ2. Hence θ1θ2 By symmetry, it can be obtained that θ2θ1.

  2. f is one to one. In fact, let θ1, θ2 ∈ 𝓐 and θ1=θ2. Assume that (x, y) ∈ θ1. Then, ((x)ρ*, (y)ρ*) ∈ θ1 and thus ((x)ρ*, (y)ρ*) ∈ θ2. This implies that (x, y) ∈ θ2. Thus, θ1θ2. Similarly, we obtain θ2θ1.

  3. f is onto. In fact, let δ ∈ 𝓑. We define a relation θ on S as follows:

    θ:={(x,y)S×S|((x)ρ,(y)ρ)δ}.

    We show that θ is a weak pseudoorder on S and ρθ. Assume that (x, y) ∈ ρ. Then, by Theorem 3.8, ((x)ρ*, (y)ρ*) ∈⪯ρδ, and thus (x, y) ∈ θ. This implies that ρθ. If (x, y) ∈ ≤, then (x, y) ∈ ρθ. Hence, ≤⊆ θ. Let now (x, y) ∈ θ and (y, z) ∈ θ. Then ((x)ρ*, (y)ρ*) ∈ δ and ((y)ρ*, (z)ρ*) ∈ δ. Hence ((x)ρ*, (z)ρ*) ∈ δ, which implies that (x, z) ∈ θ. Also, let x, y, zS be such that (x, y) ∈ θ. Then ((x)ρ*, (y)ρ*) ∈ δ and (z)ρ*S/ρ*. Since δ is a weak pseudoorder on S/ρ*, we have (x)ρ* ⊗ (z)ρ*δ⃗ (y)ρ* ⊗ (z)ρ* and (z)ρ* ⊗ (x)ρ*δ⃗ (z)ρ* ⊗ (y)ρ*, i.e., axz(a)ρδbyz(b)ρ and azx(a)ρδbzy(b)ρ Thus, for every axz there exists byz such that ((a)ρ*, (b)ρ*) ∈ δ, and for every a′ ∈ zx there exists b′ ∈ zy such that ((a′)ρ*, (b′)ρ*) ∈ δ. It implies that (a, b) ∈ θ and (a′, b′) ∈ θ. Hence we conclude that xzθ⃗yz and zxθ⃗zy. Furthermore, let x, y, zS be such that (x, y) ∈ θ and (y, x) ∈ θ. Then, similarly as in the previous proof, we can deduce that xzθ͠yz and zxθ͠zy. Thus θ is a weak pseudoorder on S and ρθ. In other words, θ ∈ 𝓐. Moreover, clearly, θ′ = δ. It thus follows that f(θ) = δ.

    Therefore, f is a bijection from 𝓐 onto 𝓑, and card(𝓐) = card(𝓑). □

By the proof of Theorem 3.11, we immediately obtain the following corollary:

Corollary 3.12

Let (S, ∘, ≤) be an ordered semihypergroup and ρ, θ be weak pseudoorders on S such that ρθ. We define a relation θ/ρ on S/ρ*as follows:

θ/ρ:={((x)ρ,(y)ρ)S/ρ×S/ρ|(x,y)θ}.

Then θ/ρ is a weak pseudoorder on S/ρ*.

4 Homomorphism theorems of ordered semihypergroups

In the current section, we shall establish the relationships between ordered regular equivalence relations and weak pseudoorders on an ordered semihypergroup, and discuss homomorphism theorems of ordered semihypergroups by weak pseudoorders.

In order to establish the relationships between ordered regular equivalence relations and weak pseudoorders on an ordered semihypergroup, the following lemma is essential.

Lemma 4.1

Let (S, ∘, ≤) be an ordered semihypergroup and σ a relation on S. Then the following statements are equivalent:

  1. σ is a weak pseudoorder on S.

  2. There exist an ordered semihypergroup (T, ⋄, ⪯) and a homomorphism φ : ST such that

    kerφ:={(a,b)S×S|φ(a)φ(b)}=σ.

Proof

(1) ⇒(2). Let σ be a weak pseudoorder on S. We denote by σ* the regular equivalence relation on S defined by

σ:={(a,b)S×S|(a,b)σ,(b,a)σ}(=σσ1).

Then, by Theorem 3.8, the set S/σ* := {(a)σ* | aS} with the hyperoperation (a)σ(b)σ=cab(c)σ, for all a, bS and the order

σ:={((x)σ,(y)σ)S/σ×S/σ|(x,y)σ}

is an ordered semihypergroup. Let T = (S/σ*, ⊗, ⪯σ) and φ be the mapping of S onto S/σ* defined by φ :SS/σ* | a ↦ (a)σ*. Then, by Proposition 3.9, φ is a homomorphism from S onto S/σ* and clearly, kerφ = σ.

(2) ⇒(1). Let (S, ∘, ≤) be an ordered semihypergroup. If there exist an ordered semihypergroup (T, ⋄, ⪯) and a homomorphism φ : ST such that kerφ = σ, then σ is a weak pseudoorder on S. Indeed, let (a, b) ∈ ≤. Then, by hypothesis, φ(a) ⪯ φ(b). Thus (a, b) ∈ kerφ = σ, and we have ≤⊆ σ. Moreover, let (a, b) ∈ σ and (b, c) ∈ σ. Then φ(a) ⪯ φ(b) ⪯ φ(c). Hence φ(a) ⪯ φ(c), i.e., (a, c) ∈ kerφ = σ. Also, if (a, b) ∈ σ, then φ(a) ⪯ φ(b). Since (T, ⋄, ⪯) is an ordered semihypergroup, for any cS we have φ(a) ⋄ φ(c) ⪯ φ(b)⋄ φ(c). Since φ is a homomorphism from S to T, we have

xacφ(x)=φ(a)φ(c)φ(b)φ(c)=ybcφ(y).

Thus, for every xac there exists ybc such that φ(x) ⪯ φ(y), and we have (x, y) ∈ kerφ = σ, which implies that acσ⃗bc. In the same way, it can be shown that caσ⃗cb. Furthermore, let (a, b) ∈ σ, (b, a) ∈ σ and cS. Then φ(a) ⪯ φ(b) and φ(b) ⪯ φ(a). Thus φ(a) = φ(b), which implies that φ(a) ⋄ φ(c) = φ(b)⋄ φ(c), i.e., xacφ(x)=ybcφ(y). Hence, for any xac, there exists ybc such that φ(x) = φ(y), and we have φ(x) ⪯φ(y) and φ(y) ⪯φ(x). It thus follows that xσy and yσ x. On the other hand, for any y′ ∈ bc, there exists x′ ∈ ac such that φ(x′) = φ(y′). Hence we have φ(x′) ⪯φ(y′) and φ(y′) ⪯φ(x′), which imply that xσy′ and yσx′. Thus, acσ͠bc, exactly as required. Similarly, it can be obtained that caσ͠cb. □

In the following, we give a characterization of ordered regular equivalence relations in terms of weak pseudoorders.

Theorem 4.2

Let (S, ∘, ≤) be an ordered semihypergroup and ρ an equivalence relation on S. Then the following statements are equivalent:

  1. ρ is an ordered regular equivalence relation on S.

  2. There exists a weak pseudoorder σ on S such that ρ = σσ−1.

  3. There exist an ordered semihypergroup T and a homomorphism φ: ST such that ρ = ker(φ), where kerφ = {(a, b) ∈ S × S | φ (a) = φ (b)} is the kernel of φ.

Proof

(1) ⇒(2). Let ρ be an ordered regular equivalence relation on S. Then there exists an order relation “ ⪯” on the quotient semihypergroup (S/ρ, ⊗) such that (S/ρ, ⊗, ⪯) is an ordered semihypergroup, and φ: SS/ρ is a homomorphism. Let σ = kerφ. By Lemma 4.1, σ is a weak pseudoorder on S and it is easy to check that ρ = σσ−1.

(2) ⇒(3). For a weak pseudoorder σ on S, by Lemma 4.1, there exist an ordered semihypergroup T and a homomorphism φ: ST such that σ = kerφ. Then we have

kerφ=kerφ(kerφ)1=σσ1=ρ.

(3) ⇒(1). By hypothesis and Lemma 4.1, kerφ is a weak pseudoorder on S. Then, by Theorem 3.8, ρ = kerφ ∩ (kerφ)−1 is a regular equivalence relation on S. Thus, by the proof of Lemma 4.1, ρ is an ordered regular equivalence relation on S. □

Example 4.3

We consider a set S:= {a, b, c, d, e} with the following hyperoperation “∘” and the order “≤S”:

abcdea{a}{e}{c}{d}{e}b{a}{b,e}{c}{d}{e}c{a}{e}{c}{d}{e}d{a}{e}{c}{d}{e}e{a}{e}{c}{d}{e}S:={(a,a),(a,d),(a,e),(b,b),(c,c),(c,e),(d,d),(e,e)}.

We give the covering relation “≺Sand the figure of S as follows:

S={(a,d),(a,e),(c,e)}.

Then (S, ∘, ≤S) is an ordered semihypergroup (see [28]). Let ρ be an equivalence relation on S defined as follows:

ρ={(a,a),(b,b),(c,c),(c,d),(d,c),(d,d),(e,e)}.

Then S/ρ = {{a}, {b}, {c, d}, {e}}, and ρ is regular. Moreover, we have

  1. ρ is an ordered regular equivalence relation on S. In fact, let S/ρ = {m, n, p, q}, where m = {a}, n = {b}, p = {c, d}, q = {e}. The hyperoperation “ ⊗” and the order “ ⪯” on S/ρ are the follows:

    mnpqm{m}{q}{p}{q}n{m}{n,q}{p}{q}p{m}{q}{p}{q}q{m}{q}{p}{q}:={(m,m),(n,n),(p,p),(q,q),(m,p),(m,q),(p,q)}.

    We give the covering relation “≺” and the figure of S/ρ2as follows:

    ={(m,p),(p,q)}.

    Then (S/ρ, ⊗, ⪯) is an ordered semihypergroup and the mapping ψ :SS/ ρ, x ↦ (x)ρis isotone. Hence ρ is an ordered regular equivalence relation on S.

  2. Let σ be a relation on S defined as follows:

    σ={(a,a),(a,c),(a,d),(a,e),(b,b),(c,c),(c,d),(c,e),(d,c),(d,d),(e,e)}.

    With a small amount of effort one can verify that σ is a weak pseudoorder on S, and ρ = σσ−1.

  3. Let T:= {x, y, z, u, v} with the operation “∙” and the order relation “≤Tbelow:

    xyzuvx{x}{y}{z}{u}{u}y{x}{y}{z}{u}{u}z{x}{y}{z}{u}{u}u{x}{y}{z}{u}{u}v{x}{y}{z}{u}{u,v}T:={(x,x),(x,z),(x,u),(x,v),(y,y),(y,z),(y,u),(y,v),(z,z),(z,u),(z,v),(u,u),(v,v)}.

    We give the covering relation “≺Tand the figure of S as follows:

    T={(x,z),(y,z),(z,u),(z,v)}.

    It is easy to check that (T, ∙, ≤T) is also an ordered semihypergroup. We define a mapping φ from S to T such that φ(a) = x, φ(b) = v, φ(c) = φ(d) = z, φ(e) = u. It is a routine matter to verify that φ: ST is a homomorphism and ρ = ker(φ).

Remark 4.4

(1) For an ordered regular equivalence relationρonS, since the order “⪯” such that (S/ρ, ⊗, ⪯) is an ordered semihypergroup is not unique in general, we have the weak pseudoorderσcontainingρsuch thatρ = σσ−1is not unique.

(2) Ifσis a weak pseudoorder on an ordered semihypergroupS, thenρ = σσ−1is the greatest ordered regular equivalence relation onScontained inσ. In fact, ifρ1is an ordered regular equivalence relation onScontained inσ, thenρ1 = ρ1ρ11σσ−1 = ρ.

Let σ be a weak pseudoorder on an ordered semihypergroup (S, ∘, ≤). Then, by Theorem 4.2, ρ = σσ−1 is an ordered regular equivalence relation on S. We denote by ρ the mapping from S onto S/ρ, i.e., ρ : SS/ρ | x ↦ (x)ρ, which is a homomorphism. In the following, we give out a homomorphism theorem of ordered semihypergroups by weak pseudoorders, which is a generalization of Theorem 1 in [17].

Theorem 4.5

Let (S, ∘, ≤) and (T, ⋄, ⪯) be two ordered semihypergroups, φ : STa homomorphism. Then, ifσis a weak pseudoorder onSsuch thatσkerφ, then there exists the unique homomorphismf : S/ρT | (a)ρφ(a) such that the diagram

commutes, whereρ = σσ−1. Moreover, Im(φ) = Im(f). Conversely, ifσis a weak pseudoorder onSfor which there exists a homomorphismf : (S/ρ, ⊗, ⪯σ) → (T, ⋄, ⪯) (ρ = σσ−1) such that the above diagram commutes, thenσkerφ.

Proof

Let σ be a weak pseudoorder on S such that σkerφ, f : S/ρT | (a)ρφ(a). Then

  1. f is well defined. Indeed, if (a)ρ = (b)ρ, then (a, b) ∈ ρσ. Since σkerφ, we have (φ(a), φ(b)) ∈⪯. Furthermore, since (b, a) ∈ σkerφ, we have (φ(b), φ(a)) ∈ ⪯. Therefore, φ(a) = φ(b).

  2. f is a homomorphism and φ = fρ. In fact, by Lemma 4.1, there exists an order relation “⪯σ” on the quotient semihypergroup (S/ρ, ⊗) such that (S/ρ, ⊗, ⪯σ) is an ordered semihypergroup and the mapping ρ is a homomorphism. Moreover, we have

(a)ρσ(b)ρ(a,b)σkerφφ(a)φ(b)f((a)ρ)f((b)ρ).

Also, let (a)ρ, (b)ρS/ρ. Since φ is a homomorphism from S to T, we have

f((a)ρ)f((b)ρ)=φ(a)φ(b)=cabφ(c)=(c)ρ(a)ρ(b)ρf((c)ρ).

Furthermore, for any aS, (fρ)(a) = f((a)ρ) = φ(a), and thus φ = fρ.

We claim that f is the unique homomorphism from S/ρ to T. To prove our claim, let g is a homomorphism from S/ρ to T such that φ = gρ. Then

f((a)ρ)=φ(a)=(gρ)(a)=g((a)ρ).

Moreover, Im(f) = {f((a)ρ) | aS} = {φ(a) | aS} = Im(φ).

Conversely, let σ be a weak pseudoorder on S, f : S/ρT is a homomorphism and φ = fρ. Then σkerφ. Indeed, by hypothesis, we have

(a,b)σ(a)ρσ(b)ρf((a)ρ)f((b)ρ)(fρ)(a)(fρ)(b)φ(a)φ(b)(a,b)kerφ,

where the order ⪯σ on S/ρ is defined as in the proof of Lemma 4.1, that is

σ:={((x)ρ,(y)ρ)S/ρ×S/ρ|(x,y)σ}.

Corollary 4.6

Let (S, ∘, ≤) and (T, ⋄, ⪯) be two ordered semihypergroups andφ: STa homomorphism. ThenS/kerφIm(φ), wherekerφis the kernel ofφ.

Proof

Let σ = kerφ and ρ = kerφ ∩ (kerφ)−1. Then, by Theorems 4.2 and 4.5, ρ is an ordered regular equivalence relation on S and f : S/ρT | (a)ρφ(a) is a homomorphism. Moreover, f is inverse isotone. In fact, let (a)ρ, (b)ρ be two elements of S/ρ such that f((a)ρ) ⪯ f((b)ρ). Then φ(a) ⪯ φ(b), and we have (a, b)∈ kerφ. Thus, by Lemma 4.1, ((a)ρ, (b)ρ) ∈⪯σ, i.e., (a)ρσ(b)_ρ. Clearly, ρ = kerφ. By Remark 2.4, S/kerφIm(f). Also, by Theorem 4.5, Im(f) = Im(φ). Therefore, S/kerφIm(φ). □

Remark 4.7

Note that ifSandTare both ordered semigroups, thenCorollary 4.6coincides with Corollary in[17].

Let (S, ∘, ≤) be an ordered semihypergroup, ρ, θ be weak pseudoorders on S such that ρθ. We define a relation θ/ρ on (S/ρ*, ⊗, ⪯ρ) as follows:

θ/ρ:={((a)ρ,(b)ρ)S/ρ×S/ρ|(a,b)θ},

where ⪯ρ := {((a)ρ*, (b)ρ*) | (a, b) ∈ ρ}, ρ* = ρρ−1. By Corollary 3.12, θ/ρ is a weak pseudoorder on S/ρ*. Moreover, we have the following theorem.

Theorem 4.8

Let (S, ∘, ≤) be an ordered semihypergroup, ρ, θbe weak pseudoorders onSsuch thatρθ. Then (S/ρ*)/(θ/ρ)*S/θ*.

Proof

We claim that the mapping φ : S/ρ*S/θ* | (a)ρ* ↦ (a)θ* is a homomorphism. In fact:

  1. φ is well-defined. Indeed, let (a)ρ* = (b)ρ*. Then (a, b) ∈ ρ*. Thus, by the definition of ρ*, (a, b) ∈ ρθ and (b, a) ∈ ρθ. This implies that (a, b) ∈ θ*, and thus (a)θ* = (b)θ*.

  2. φ is a homomorphism. In fact, let (a)ρ*, (b)ρ*S/ρ*. Then, since ρ*,θ* are both ordered regular equivalence relations on S, we have

    (a)ρρ(b)ρ=xab(x)ρ,(a)θθ(b)θ=xab(x)θ,

where “ ⊗ρ ” and “ ⊗θ ” are the hyperactions on S/ρ* and S/θ*, respectively. Thus

φ((a)ρ)θφ((b)ρ)=(a)θθ(a)θ=xab(x)θ=(x)ρ(a)ρρ(b)ρφ((x)ρ).

Also, if (a)ρ*ρ (b)ρ*, then (a, b) ∈ ρθ. It implies that (a)θ* ⪯_θ (b)θ*, and thus φ is isotone. On the other hand, it is easy to see that φ is onto, since

Im(φ)={φ((a)ρ)|aS}={(a)θ|aS}=S/θ.

It thus follows from Corollary 4.6 that (S/ρ*)/kerφIm(φ) = S/θ*.

Furthermore, let kerφ := {((a)ρ*, (b)ρ*) ∈ S/ρ* × S/ρ* | φ ((a)ρ*) ⪯θφ ((b)ρ*)}. Then

((a)ρ,(b)ρ)kerφ(a)θθ(b)θ(a,b)θ((a)ρ,(b)ρ)θ/ρ.

Therefore, kerφ = kerφ ∩ (kerφ)−1 = (θ/ρ) ∩ (θ/ρ)−1 = (θ/ρ)*. We have thus shown that (S/ρ*)/(θ/ρ)*S/θ*. □

Definition 4.9

Let (S, ∘, ≤) and (T, ⋄, ⪯) be two ordered semihypergroups, ρ, θbe two weak pseudoorders onSandT, respectively, and the mappingf : STa homomorphism. Then, fis called a (ρ, θ)-homomorphism if (x, y) ∈ ρimplies (f(x), f(y)) ∈ θ, for allx, yS.

Example 4.10

Consider the ordered semihypergroups (S, ∘, ≤S) and (T, ∙, ≤T) given inExample 4.3, and define the relationsρ, θonSandT, respectively, as follows:

ρ:={(a,a),(a,c),(a,d),(a,e),(b,b),(c,c),(c,d),(c,e),(d,c),(d,d),(e,e)},θ:={(x,x),(x,z),(x,u),(x,v),(y,y),(y,z),(y,u),(y,v),(z,z),(z,u),(z,v),(u,u),(v,v)}.

It is not difficult to verify thatρ, θis pseudoorders onSandT, respectively. Furthermore, we define a mappingffromStoTsuch thatf(a) = x, f(b) = v, f(c) = f(d) = z, f(e) = u. ByExample 4.3, f : STis a homomorphism. Hencefis a (ρ, θ)-homomorphism.

Lemma 4.11

Let (S, ∘, ≤) and (T, ⋄, ⪯) be two ordered semihypergroups, ρ, θbe two weak pseudoorders onSandT, respectively, and the mappingf : STa (ρ, θ)-homomorphism. Then, the mappingf : (S/ρ*, ⊗ρ, ⪯ρ) → (T/θ*, ⊗θ, ⪯θ) defined by

(xS)f¯((x)ρ):=(f(x))θ

is a homomorphism of ordered semihypergroups, where the ordersρ, ⪯θonS/ρ*andT/θ*, respectively, are both defined as in the proof of Lemma 4.1.

Proof

Let f : ST be a (ρ, θ)-homomorphism and f: S/ρ*T/θ* | (x)ρ* ↦ (f(x))θ*. Then

  1. f is well defined. In fact, let (x)ρ*, (y)ρ*S/ρ* be such that (x)ρ* = (y)ρ*. Then (x, y) ∈ ρ*ρ. Since f is a (ρ, θ)-homomorphism, we have (f(x),f(y)) ∈ θ. It implies that ((f(x))θ*,(f(y))θ*) ∈⪯θ. Similarly, since (y, x) ∈ ρ, we have ((f(y))θ*,(f(x))θ*) ∈⪯θ. Therefore, ((f(x))θ* = (f(y))θ*, i.e., f((x)ρ*)=f((y)ρ*).

  2. f is a homomorphism. Indeed, let (x)ρ*,(y)ρ*S/ρ*. By Theorem 4.2, ρ*,θ* are ordered regular equivalence relations on S and T, respectively. Since f is a homomorphism, by Lemma 2.2 we have

    f¯((x)ρ)θf¯((y)ρ)=(f(x))θθ(f(y))θ=axy(f(a))θ=(a)ρ(x)ρρ(y)ρf¯((a)ρ).

Also, since f is a (ρ, θ)-homomorphism, we have

(x)ρρ(y)ρ(x,y)ρ(f(x),f(y))θ(f(x))θθ(f(y))θf¯((x)ρ)θf¯((y)ρ).

Hence f is isotone. We have thus shown that f is a homomorphism, as required. □

Lemma 4.12

Let (S, ∘, ≤) and (T, ⋄, ⪯) be two ordered semihypergroups, ρ, θbe two weak pseudoorders onSandT, respectively, and the mappingf : STa (ρ, θ)-homomorphism. Then, We define a relation onS/ρ*denoted byρfas follows:

ρf:={((x)ρ,(y)ρ)S/ρ×S/ρ|(f(x))θθ(f(y))θ}.

Thenρfis a weak pseudoorder onS/ρ*.

Proof

Assume that ((x)ρ*,(y)ρ*) ∈⪯ρ. By Lemma 4.11, f is a homomorphism. Then f((x)ρ*) ⪯θf((y)ρ*), i.e., (f(x))θ*θ (f(y))θ*. It implies that ((x)ρ*,(y)ρ*)∈ ρf, and thus ⪯ρρf. Now, let ((x)ρ*,(y)ρ*) ∈ ρf and ((y)ρ*,(z)ρ*) ∈ ρf. Then (f(x))θ*θ (f(y))θ* and (f(y))θ*θ (f(z))θ*. Thus, by the transitivity of ⪯θ, (f(x))θ*θ (f(z))θ*. This implies that ((x)ρ*,(z)ρ*)∈ ρf. Also, let ((x)ρ*,(y)ρ*) ∈ ρf and (z)ρ*S/ρ*. Then (f(x))θ*θ (f(y))θ*. Since (T/θ*, ⊗θ, ⪯θ) is an ordered semihypergroup, it can be obtained that (f(x))θ*θ (f(z))θ*θ (f(y))θ*θ (f(z))θ*, that is, f((x)ρ*)⊗θf((z)ρ*) ⪯θf((y)ρ*)⊗θf((z)ρ*). Then, since f is a homomorphism, we have

(a)ρ(x)ρρ(z)ρf¯((a)ρ)θ(b)ρ(y)ρρ(z)ρf¯((b)ρ),

which means that axz (f(a))θ*θbyz(f(b))θ*. Thus, for any axz, there exists byz such that (f(a))θ*θ (f(b))θ*. Hence ((a)ρ*, (b)ρ*) ∈ ρf. It thus implies that (x)ρ*ρ (z)ρ*ρ⃗f (y)ρ*ρ (z)ρ*. Similarly, it can be shown that (z)ρ*ρ (x)ρ*ρ⃗f (z)ρ*ρ (y)ρ*. Furthermore, let (x)ρ*,(y)ρ*,(z)ρ*S/ρ* be such that ((x)ρ*,(y)ρ*) ∈ ρf and ((y)ρ*,(x)ρ*) ∈ ρf. Then, similarly as in the above proof, it can be verified that (x)ρ*ρ (z)ρ*ρ̃f (y)ρ*ρ (z)ρ* and (z)ρ*ρ (x)ρ*ρ̃f (z)ρ*ρ (y)ρ*. Therefore, ρf is a weak pseudoorder on S/ρ*. □

By Lemmas 4.11 and 4.12, we immediately obtain the following corollary:

Corollary 4.13

Let (S, ∘, ≤) and (T, ⋄, ⪯) be two ordered semihypergroups, ρ, θbe two weak pseudoorders onSandT, respectively, and the mappingf : STbe a (ρ, θ)-homomorphism. Then, the following diagram

commutates.

Theorem 4.14

Let (S, ∘, ≤) and (T, ⋄, ⪯) be two ordered semihypergroups, ρ, θbe two weak pseudoorders onSandT, respectively, and the mappingf : STa (ρ, θ)-homomorphism. Ifσis a weak pseudoorder onS/ρ*such thatσρf, then there exists the unique homomorphismφ : (S/ρ*)/σ*T/θ* | ((a)ρ*)σ*f((a)ρ*) such that the diagram

commutes.

Conversely, ifσis a weak pseudoorder onS/ρ*for which there exists a homomorphismφ : (S/ρ*)/σ*T/θ*such that the above diagram commutes, thenσρf.

Proof

The proof is straightforward by Lemma 4.11, Lemma 4.12 and Theorem 4.5, and we omit the details. □

Let (S, ∘, ≤S) and (T, ⋄, ≤T) be two ordered semihypergroups. In [25], it is shown that (S × T, ⋆, ≤S×T) is also an ordered semihypergroup with the hyperoperation “ ⋆ ” and the order relation “ ≤S×T ” below: for any (s1, t1), (s2, t2) ∈ S × T,

(s1,t1)(s2,t2)=(s1s2)×(t1t2);(s1,t1)S×T(s2,t2)s1Ss2andt1Tt2.

Lemma 4.15

Let (S, ∘, ≤S) and (T, ⋄, ≤T) be ordered semihypergroups, ρ1, ρ2be two weak pseudoorders onSandT, respectively. We define a relationρonS × Tas follows:

((s1,t1),(s2,t2)S×T)(s1,t1)ρ(s2,t2)s1ρ1s2andt1ρ2t2.

Thenρis a weak pseudoorder onS × T.

Proof

The verifications of the conditions (1), (2) and (3) of Definition 3.4 are straightforward. We only need show that the condition (4) of Definition 3.4 is satisfied.

Let (s1, t1), (s2, t2), (s, t) ∈ S × T be such that (s1, t1)ρ (s2, t2) and (s2, t2)ρ (s1, t1). Then s1ρ1s2, t1ρ2t2, s2ρ1s1, t2ρ2t1 and sS, tT. Since ρ1, ρ2 are weak pseudoorders on S and T, respectively, we have

s1sρ~1s2sandt1tρ~1t2t.

Thus

(xs1s)(us2s)xρ1uanduρ1x&(us2s)(xs1s)xρ1uanduρ1x,(yt1t)(vt2t)yρ2vandvρ2y&(vt2t)(yt1t)yρ2vandvρ2y.

Hence we have

((x,y)(s1s)×(t1t))((u,v)(s2s)×(t2t))(x,y)ρ(u,v)and(u,v)ρ(x,y),((u,v)(s2s)×(t2t))((x,y)(s1s)×(t1t))(x,y)ρ(u,v)and(u,v)ρ(x,y).

It thus follows that (s1s) × (t1t) ρ̃ (s2s) × (t2t), i.e., (s1, t1) ⋆ (s, t) ρ̃ (s2, t2) ⋆ (s, t). Similarly, it can be verified that (s, t) ⋆ (s1, t1) ρ̃ (s, t)⋆ (s2, t2). □

By Theorem 3.8 and Lemma 4.15, ((S × T)/ρ*, ⊗ρ, ⪯ρ) and (S/ρ1 × T/ρ2, ⋆′, ⪯S×T) are both ordered semihypergroups, where the hyperoperation ⋆′ and the order relation ⪯S×T on S/ρ1 × S/ρ2 are similar to the hyperoperation ⋆ and the order relation ≤S×T on S × T, respectively. Furthermore, we have the following theorem:

Theorem 4.16

Let (S, ∘, ≤S) and (T, ⋄, ≤T) be ordered semihypergroups, ρ1, ρ2be two weak pseudoorders onSandT, respectively. Then (S × T)/ρ*S/ρ1 × T/ρ2.

Proof

We claim that the mapping φ : (S × T)/ρ*S/ρ1 × T/ρ2 | ((s, t))ρ* ↦ ((s)ρ1, (t)ρ2) is an isomorphism. In fact:

  1. φ is well-defined. Indeed, let ((s1, t1))ρ* = ((s2, t2))ρ*. Then (s1, t1)ρ*(s2, t2). Hence, by the definition of ρ*, (s1, t1)ρ(s2, t2) and (s2, t2)ρ(s1, t1). It thus follows that s1ρ1s2, t1ρ2t2, s2ρ1s1 and t2ρ2t1, which imply s1ρ1s2 and t1ρ2t2. Thus, ((s1)ρ1,(t1)ρ2) = ((s2)ρ1, (t2)ρ2).

  2. φ is an isomorphism. In fact, for any ((s1, t1))ρ*,((s2, t2))ρ*∈ (S × T)/ρ*, we have

    φ(((s1,t1))ρ)φ(((s2,t2))ρ)=((s1)ρ1,(t1)ρ2)((s2)ρ1,(t2)ρ2)=((s1)ρ1ρ1(s2)ρ1,(t1)ρ2ρ2(t2)ρ2)=(ss1s2(s)ρ1,tt1t2(t)ρ2)=ss1s2tt1t2((s)ρ1,(t)ρ2)=(s,t)(s1s2)×(t1t2)φ(((s,t))ρ)=(s,t)(s1,t1)(s2,t2)φ(((s,t))ρ)=((s,t))ρ((s1,t1))ρρ((s2,t2))ρφ(((s,t))ρ).

Moreover, it can be easily seen that φ is onto. Also, φ is isotone and reverse isotone. Indeed, let ((s1, t1))ρ*,((s2, t2))ρ* ∈ (S × T)/ρ*. Then we have

((s1,t1))ρρ((s2,t2))ρ(s1,t1)ρ(s2,t2)s1ρ1s2andt1ρ2t2(s1)ρ1ρ1(s2)ρ1and(t1)ρ2ρ2(t2)ρ2((s1)ρ1,(t1)ρ2)S×T((s2)ρ1,(t2)ρ2)φ(((s1,t1))ρ)S×Tφ(((s2,t2))ρ).

Therefore, φ is indeed an isomorphism, which means that (S × T)/ρ*S/ρ1 × T/ρ2. □

5 Conclusions

As we know, (strongly) regular equivalence relations on ordered semihypergroups play an important role in studying the structure of ordered semihypergroups. In this paper, we further studied the ordered regular equivalence relations on ordered semihypergroups. We introduced the concept of weak pseudoorders on an ordered semihypergroup, and established the relationships between ordered regular equivalence relations and weak pseudoorders on an ordered semihypergroup. Especially, we constructed an ordered regular equivalence relation on an ordered semihypergroup by a weak pseudoorder, and gave a complete answer to the open problem given by Davvaz et al. in [25].

In [25], for a pseudoorder ρ on an ordered semihypergroup S, Davvaz et al. obtained an ordered semigroup S/ρ*, where ρ*(= ρρ−1) is a strongly regular equivalence relation on S. Moreover, they provided some homomorphism theorems of ordered semigroups by pseudoorders, for example see Theorems 4.5, 4.11 and 4.15 in [25]. However, they have not established the homomorphisms of ordered semihypergroups. As a further study, in the present paper we also discussed the homomorphic theory of ordered semihypergroups by weak pseudoorders, and generalized some similar results in ordered semigroups.

Acknowledgement

This research was partially supported by the National Natural Science Foundation of China (No. 11361027), the University Natural Science Project of Anhui Province – “The algebraic structure of (ordered) semihypergroups and its applications” in 2018, the Key Project of Department of Education of Guangdong Province (No. 2014KZDXM055) and the Natural Science Foundation of Guangdong Province (No. 2014A030313625).

References

[1] Marty, F., Sur une generalization de la notion de groupe, Proc. 8th Congress Mathematiciens Scandenaves, Stockholm, 1934, 45-49Suche in Google Scholar

[2] Corsini, P., Leoreanu, V., Applications of Hyperstructure Theory, Advances in Mathematics (Kluwer Academic Publishers, Dordrecht, 2003)10.1007/978-1-4757-3714-1Suche in Google Scholar

[3] Davvaz, B., Leoreanu, V., Hyperring Theory and Applications (International Academic Press, Florida, 2007)Suche in Google Scholar

[4] Vougiouklis, T., Hyperstructures and Their Representations (Hadronic Press, Florida, 1994)Suche in Google Scholar

[5] Leoreanu, V., Rosenberg, I. G., Davvaz, B., Vougiouklis, T., A new class of n-ary hyperoperations, European J. Combinatorics, 2015, 44, 265-27310.1016/j.ejc.2014.08.013Suche in Google Scholar

[6] Anvariyeh, S. M., Mirvakili, S., Kazanci, O., Davvaz, B., Algebraic hyperstructures of soft sets associated to semihypergroups, Southeast Asian Bull. Math., 2011, 35, 911-925Suche in Google Scholar

[7] Davvaz, B., Some results on congruences on semihypergroups, Bull. Malays. Math. Sci. Soc., 2000, 23, 53-58Suche in Google Scholar

[8] Davvaz, B., Poursalavati, N. S., Semihypergroups and S-hypersystems, Pure Math. Appl., 2000, 11, 43-49Suche in Google Scholar

[9] Salvo, M. D., Freni, D., Faro, G. L., Fully simple semihypergroups, J. Algebra, 2014, 399, 358-37710.1016/j.jalgebra.2013.09.046Suche in Google Scholar

[10] Fasino, D., Freni, D., Existence of proper semihypergroups of type U on the right, Discrete Math., 2007, 307, 2826-283610.1016/j.disc.2007.03.001Suche in Google Scholar

[11] Hila, K., Davvaz, B., Naka, K., On quasi-hyperideals in semihypergroups, Comm. Algebra, 2011, 39(11), 4183-419410.1080/00927872.2010.521932Suche in Google Scholar

[12] Leoreanu, V., About the simplifiable cyclic semihypergroups, Ital. J. Pure Appl. Math., 2000, 7, 69-76Suche in Google Scholar

[13] Naz, S., Shabir, M., On prime soft bi-hyperideals of semihypergroups, J. Intell. Fuzzy Systems, 2014, 26(3), 1539-154610.3233/IFS-130837Suche in Google Scholar

[14] Corsini, P., Prolegomena of Hypergroup Theory (Aviani Editore Publisher, Italy, 1993)Suche in Google Scholar

[15] Fuchs, L., Partially Ordered Algebraic Systems (Pergamon Press, New York, 1963)Suche in Google Scholar

[16] Kehayopulu, N., Tsingelis, M., On subdirectly irreducible ordered semigroups, Semigroup Forum, 1995, 50(2), 161-17710.1007/BF02573514Suche in Google Scholar

[17] Kehayopulu, N., Tsingelis, M., Pseudoorder in ordered semigroups, Semigroup Forum, 1995, 50(3), 389-39210.1007/BF02573534Suche in Google Scholar

[18] Kehayopulu, N., Tsingelis, M., On congruences in ordered semigroups, Russian Mathematics (Iz. VUZ), 2000, 44 (5), 35-37Suche in Google Scholar

[19] Xie, X. Y., An Introduction to Ordered Semigroup Theory (Science Press, Beijing, 2001)Suche in Google Scholar

[20] Xie, X. Y., On regular, strongly regular congruences on ordered semigroups, Semigroup Forum, 2000, 61(2), 159-17810.1007/PL00006018Suche in Google Scholar

[21] Xie, X. Y., Wu, M. F., On congruences on ordered semigroups, Math. Japonica, 1997, 45(1), 81-84Suche in Google Scholar

[22] Kuil, M., On varieties of ordered semigroups, Semigroup Forum, 2015, 90(2), 475-49010.1007/s00233-014-9630-zSuche in Google Scholar

[23] Heidari, D., Davvaz, B., On ordered hyperstructures, University Politehnica of Bucharest Scientific Bulletin, Series A, 2011, 73(2), 85-96Suche in Google Scholar

[24] Changphas, T., Davvaz, B., Properties of hyperideals in ordered semihypergroups, Ital. J. Pure Appl. Math., 2014, 33, 425-432Suche in Google Scholar

[25] Davvaz, B., Corsini, P., Changphas, T., Relationship between ordered semihypergroups and ordered semigroups by using pseuoorders, European J. Combinatorics, 2015, 44, 208-21710.1016/j.ejc.2014.08.006Suche in Google Scholar

[26] Tang, J., Davvaz, B., Luo, Y. F., Hyperfilters and fuzzy hyperfilters of ordered semihypergroups, J. Intell. Fuzzy Systems, 2015, 29(1), 75-8410.3233/IFS-151571Suche in Google Scholar

[27] Tang, J., Davvaz, B., Xie, X. Y., An investigation on hyper S-posets over ordered semihypergroups, Open Mathematics, 2017, 15, 37-5610.1515/math-2017-0004Suche in Google Scholar

[28] Gu, Z., Tang, X. L., Ordered regular equivalence relations on ordered semihypergroups, J. Algebra, 2016, 450, 384-39710.1016/j.jalgebra.2015.11.026Suche in Google Scholar

Received: 2017-05-30
Accepted: 2017-11-15
Published Online: 2018-03-20

© 2018 Tang et al., published by De Gruyter

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Artikel in diesem Heft

  1. Regular Articles
  2. Algebraic proofs for shallow water bi–Hamiltonian systems for three cocycle of the semi-direct product of Kac–Moody and Virasoro Lie algebras
  3. On a viscous two-fluid channel flow including evaporation
  4. Generation of pseudo-random numbers with the use of inverse chaotic transformation
  5. Singular Cauchy problem for the general Euler-Poisson-Darboux equation
  6. Ternary and n-ary f-distributive structures
  7. On the fine Simpson moduli spaces of 1-dimensional sheaves supported on plane quartics
  8. Evaluation of integrals with hypergeometric and logarithmic functions
  9. Bounded solutions of self-adjoint second order linear difference equations with periodic coeffients
  10. Oscillation of first order linear differential equations with several non-monotone delays
  11. Existence and regularity of mild solutions in some interpolation spaces for functional partial differential equations with nonlocal initial conditions
  12. The log-concavity of the q-derangement numbers of type B
  13. Generalized state maps and states on pseudo equality algebras
  14. Monotone subsequence via ultrapower
  15. Note on group irregularity strength of disconnected graphs
  16. On the security of the Courtois-Finiasz-Sendrier signature
  17. A further study on ordered regular equivalence relations in ordered semihypergroups
  18. On the structure vector field of a real hypersurface in complex quadric
  19. Rank relations between a {0, 1}-matrix and its complement
  20. Lie n superderivations and generalized Lie n superderivations of superalgebras
  21. Time parallelization scheme with an adaptive time step size for solving stiff initial value problems
  22. Stability problems and numerical integration on the Lie group SO(3) × R3 × R3
  23. On some fixed point results for (s, p, α)-contractive mappings in b-metric-like spaces and applications to integral equations
  24. On algebraic characterization of SSC of the Jahangir’s graph 𝓙n,m
  25. A greedy algorithm for interval greedoids
  26. On nonlinear evolution equation of second order in Banach spaces
  27. A primal-dual approach of weak vector equilibrium problems
  28. On new strong versions of Browder type theorems
  29. A Geršgorin-type eigenvalue localization set with n parameters for stochastic matrices
  30. Restriction conditions on PL(7, 2) codes (3 ≤ |𝓖i| ≤ 7)
  31. Singular integrals with variable kernel and fractional differentiation in homogeneous Morrey-Herz-type Hardy spaces with variable exponents
  32. Introduction to disoriented knot theory
  33. Restricted triangulation on circulant graphs
  34. Boundedness control sets for linear systems on Lie groups
  35. Chen’s inequalities for submanifolds in (κ, μ)-contact space form with a semi-symmetric metric connection
  36. Disjointed sum of products by a novel technique of orthogonalizing ORing
  37. A parametric linearizing approach for quadratically inequality constrained quadratic programs
  38. Generalizations of Steffensen’s inequality via the extension of Montgomery identity
  39. Vector fields satisfying the barycenter property
  40. On the freeness of hypersurface arrangements consisting of hyperplanes and spheres
  41. Biderivations of the higher rank Witt algebra without anti-symmetric condition
  42. Some remarks on spectra of nuclear operators
  43. Recursive interpolating sequences
  44. Involutory biquandles and singular knots and links
  45. Constacyclic codes over 𝔽pm[u1, u2,⋯,uk]/〈 ui2 = ui, uiuj = ujui
  46. Topological entropy for positively weak measure expansive shadowable maps
  47. Oscillation and non-oscillation of half-linear differential equations with coeffcients determined by functions having mean values
  48. On 𝓠-regular semigroups
  49. One kind power mean of the hybrid Gauss sums
  50. A reduced space branch and bound algorithm for a class of sum of ratios problems
  51. Some recurrence formulas for the Hermite polynomials and their squares
  52. A relaxed block splitting preconditioner for complex symmetric indefinite linear systems
  53. On f - prime radical in ordered semigroups
  54. Positive solutions of semipositone singular fractional differential systems with a parameter and integral boundary conditions
  55. Disjoint hypercyclicity equals disjoint supercyclicity for families of Taylor-type operators
  56. A stochastic differential game of low carbon technology sharing in collaborative innovation system of superior enterprises and inferior enterprises under uncertain environment
  57. Dynamic behavior analysis of a prey-predator model with ratio-dependent Monod-Haldane functional response
  58. The points and diameters of quantales
  59. Directed colimits of some flatness properties and purity of epimorphisms in S-posets
  60. Super (a, d)-H-antimagic labeling of subdivided graphs
  61. On the power sum problem of Lucas polynomials and its divisible property
  62. Existence of solutions for a shear thickening fluid-particle system with non-Newtonian potential
  63. On generalized P-reducible Finsler manifolds
  64. On Banach and Kuratowski Theorem, K-Lusin sets and strong sequences
  65. On the boundedness of square function generated by the Bessel differential operator in weighted Lebesque Lp,α spaces
  66. On the different kinds of separability of the space of Borel functions
  67. Curves in the Lorentz-Minkowski plane: elasticae, catenaries and grim-reapers
  68. Functional analysis method for the M/G/1 queueing model with single working vacation
  69. Existence of asymptotically periodic solutions for semilinear evolution equations with nonlocal initial conditions
  70. The existence of solutions to certain type of nonlinear difference-differential equations
  71. Domination in 4-regular Knödel graphs
  72. Stepanov-like pseudo almost periodic functions on time scales and applications to dynamic equations with delay
  73. Algebras of right ample semigroups
  74. Random attractors for stochastic retarded reaction-diffusion equations with multiplicative white noise on unbounded domains
  75. Nontrivial periodic solutions to delay difference equations via Morse theory
  76. A note on the three-way generalization of the Jordan canonical form
  77. On some varieties of ai-semirings satisfying xp+1x
  78. Abstract-valued Orlicz spaces of range-varying type
  79. On the recursive properties of one kind hybrid power mean involving two-term exponential sums and Gauss sums
  80. Arithmetic of generalized Dedekind sums and their modularity
  81. Multipreconditioned GMRES for simulating stochastic automata networks
  82. Regularization and error estimates for an inverse heat problem under the conformable derivative
  83. Transitivity of the εm-relation on (m-idempotent) hyperrings
  84. Learning Bayesian networks based on bi-velocity discrete particle swarm optimization with mutation operator
  85. Simultaneous prediction in the generalized linear model
  86. Two asymptotic expansions for gamma function developed by Windschitl’s formula
  87. State maps on semihoops
  88. 𝓜𝓝-convergence and lim-inf𝓜-convergence in partially ordered sets
  89. Stability and convergence of a local discontinuous Galerkin finite element method for the general Lax equation
  90. New topology in residuated lattices
  91. Optimality and duality in set-valued optimization utilizing limit sets
  92. An improved Schwarz Lemma at the boundary
  93. Initial layer problem of the Boussinesq system for Rayleigh-Bénard convection with infinite Prandtl number limit
  94. Toeplitz matrices whose elements are coefficients of Bazilevič functions
  95. Epi-mild normality
  96. Nonlinear elastic beam problems with the parameter near resonance
  97. Orlicz difference bodies
  98. The Picard group of Brauer-Severi varieties
  99. Galoisian and qualitative approaches to linear Polyanin-Zaitsev vector fields
  100. Weak group inverse
  101. Infinite growth of solutions of second order complex differential equation
  102. Semi-Hurewicz-Type properties in ditopological texture spaces
  103. Chaos and bifurcation in the controlled chaotic system
  104. Translatability and translatable semigroups
  105. Sharp bounds for partition dimension of generalized Möbius ladders
  106. Uniqueness theorems for L-functions in the extended Selberg class
  107. An effective algorithm for globally solving quadratic programs using parametric linearization technique
  108. Bounds of Strong EMT Strength for certain Subdivision of Star and Bistar
  109. On categorical aspects of S -quantales
  110. On the algebraicity of coefficients of half-integral weight mock modular forms
  111. Dunkl analogue of Szász-mirakjan operators of blending type
  112. Majorization, “useful” Csiszár divergence and “useful” Zipf-Mandelbrot law
  113. Global stability of a distributed delayed viral model with general incidence rate
  114. Analyzing a generalized pest-natural enemy model with nonlinear impulsive control
  115. Boundary value problems of a discrete generalized beam equation via variational methods
  116. Common fixed point theorem of six self-mappings in Menger spaces using (CLRST) property
  117. Periodic and subharmonic solutions for a 2nth-order p-Laplacian difference equation containing both advances and retardations
  118. Spectrum of free-form Sudoku graphs
  119. Regularity of fuzzy convergence spaces
  120. The well-posedness of solution to a compressible non-Newtonian fluid with self-gravitational potential
  121. On further refinements for Young inequalities
  122. Pretty good state transfer on 1-sum of star graphs
  123. On a conjecture about generalized Q-recurrence
  124. Univariate approximating schemes and their non-tensor product generalization
  125. Multi-term fractional differential equations with nonlocal boundary conditions
  126. Homoclinic and heteroclinic solutions to a hepatitis C evolution model
  127. Regularity of one-sided multilinear fractional maximal functions
  128. Galois connections between sets of paths and closure operators in simple graphs
  129. KGSA: A Gravitational Search Algorithm for Multimodal Optimization based on K-Means Niching Technique and a Novel Elitism Strategy
  130. θ-type Calderón-Zygmund Operators and Commutators in Variable Exponents Herz space
  131. An integral that counts the zeros of a function
  132. On rough sets induced by fuzzy relations approach in semigroups
  133. Computational uncertainty quantification for random non-autonomous second order linear differential equations via adapted gPC: a comparative case study with random Fröbenius method and Monte Carlo simulation
  134. The fourth order strongly noncanonical operators
  135. Topical Issue on Cyber-security Mathematics
  136. Review of Cryptographic Schemes applied to Remote Electronic Voting systems: remaining challenges and the upcoming post-quantum paradigm
  137. Linearity in decimation-based generators: an improved cryptanalysis on the shrinking generator
  138. On dynamic network security: A random decentering algorithm on graphs
Heruntergeladen am 13.10.2025 von https://www.degruyterbrill.com/document/doi/10.1515/math-2018-0016/html?lang=de
Button zum nach oben scrollen