A new approach to a network of congruences on an inverse semigroup
Ying-Ying Feng
Department of Mathematics, Foshan University,
Foshan 528000, P. R. China
Li-Min Wang
Correspondence author. Email: [email protected]
School of Mathematics, South China Normal University,
Guangzhou 510631, P. R. China
Lu Zhang
School of Mathematics, South China Normal University,
Guangzhou 510631, P. R. China
Hai-Yuan Huang
School of Mathematics, South China Normal University,
Guangzhou 510631, P. R. China
Abstract
This paper enriches the list of known properties of congruence sequences starting from the universal relation and successively performing
the operators lower k and lower t. Two series of inverse semigroups, namely kerαn-is-Clifford semigroups and
βn-is-over-E-unitary semigroups, are investigated. Two congruences, namely αn+2 and βn+2, are found to be the
least kerαn-is-Clifford and least βn-is-over-E-unitary congruences on S, respectively. A new system of implications is
established for the quasivarieties of inverse semigroups induced by the min network.
Keywords: inverse semigroup, congruence, kerαn-is-Clifford semigroup, βn-is-over-E-unitary semigroup, min
network.
2000 MR Subject Classification: 20M18
In semigroup theory it is not possible to avoid the explicit study of congruences. Congruences play a central role in many of the structure
theorems and other important considerations in the theory of inverse semigroups. An efficient handling of congruences on inverse semigroups is
the kernel - trace approach. From the kernel - trace decomposition of congruences, we obtain two operators, lower k and lower t, on the
congruence lattice C(S) of an inverse semigroup. We denote by ρk the least congruence on S having the same kernel as
ρ, and by ρt the least congruence having the same trace as ρ. Starting with the universal congruence ω on S, we form
two sequences:
[TABLE]
These congruences,
together with the intersections ωt∩ωk, (ωt)k∩(ωk)t, ⋯, form a sublattice of the lattice of all
congruences on S. Petrich – Reilly [6] first investigated properties of these congruences and established a system of
implications for the resulting quasivarieties.
Recall that (ωt)k=π is the least E-unitary congruence, and that ((ωk)t)k=λ is the least E-reflexive congruence.
An inverse semigroup S is E-reflexive if for any x,y∈S and e∈ES, exy∈ES implies eyx∈ES. Equivalently, S is E-reflexive if and only if every η-class of
S, where η denotes the least semilattice congruence, is E-unitary, i.e. η is over E-unitary inverse semigroups. In this sense,
E-unitary inverse semigroups can be viewed as semigroups whose universal relation ω is over E-unitary inverse semigroups. There is
some relationship between the semigroups associated with the congruences βn+2 and βn at the first few levels of the min
network. Dually, recall that (ωk)t=ν is the least Clifford congruence, and ((ωt)k)t is the least Eω-Clifford
congruence, or the least kerσ-is-Clifford congruence. And Clifford semigroups can be regarded as kerω-is-Clifford
semigroups in this sense. There is also a relationship between the semigroups associated with the congruences αn+2 and αn. We
wonder whether these patterns continue indefinitely.
Motivated by the symmetry observed above, our objective here is to obtain properties of the min network which highlights two series of inverse
semigroups, namely kerαn-is-Clifford semigroups and βn-is-over-E-unitary semigroups, and lead to characterizations of both
series. Finally we come to a similar but totally new system of implications. Although both of ours and Petrich – Reilly’s ([6])
characterizations for the min network are inductive ones, Petrich – Reilly focus on the the properties leading to expressions of
quasivarieties. The new characterization is based on all sorts of familiar, omnipresent relations, including special congruences, Green’s
relations, F and C-relations. It investigates the inner relations among these extremal congruences and the known
relations, which makes it possible to have more equivalent descriptions. Furthermore, the new characterization reflects symmetry in inverse
semigroups, where “kernel” corresponds to “over” and “Clifford” corresponds to
“E-unitary”.
In Section 1 we summarize notation and terminology to be used in the paper. In Section 2 we study kerαn-is-Clifford semigroups,
βn-is-over E-unitary semigroups and related congruences. A similar but symmetric system of implications for the quasivarieties induced
by the min network is established. The principal results for Section 3 are necessary and sufficient conditions for coincidences of certain
congruences.
1 Preliminaries
Throughout the entire paper, S denotes an arbitrary inverse semigroup with semilattice ES of
idempotents. When more than one semigroup is under discussion, θ(S) or θ(S/ρ) would be used to clarify the semigroup on which
the congruence is.
We shall use the notation and terminology of Howie [3] and Petrich [4], to which the reader is referred for basic
information and results on inverse semigroups. For an arbitrary inverse semigroup S, we denote by ES the semilattice
of its idempotents. The complete lattice of congruences on S is denoted by C(S). For ρ∈C(S),
trρ=ρ∣ES is the trace of ρ, and kerρ={a∈S∣aρe for some e∈ES} is the kernel of ρ. The kernel of a congruence on an inverse semigroup is a normal inverse
subsemigroup. A congruence on an inverse semigroup is determined uniquely by its trace and kernel.
Lemma 1.1**.**
([5, Theorem 4.4])*
Let ρ be a congruence on S. Then*
[TABLE]
For any ρ, θ∈C(S), the relations T and K are defined as follows,
[TABLE]
The relation T is a complete congruence
on the lattice C(S), while K is an equivalence relation on
C(S). The equivalence class ρT [resp. ρK] is an interval of C(S) with greatest and
least element to be denoted by ρT [resp. ρK] and ρt [resp. ρk], respectively.
Lemma 1.2**.**
([4, Theorem III.2.5])*
For any congruence ρ on S,*
[TABLE]
On any inverse semigroup S, two relations F and C are defined by
[TABLE]
Lemma 1.3**.**
([6, Theorem 6.2])*
For any congruence ρ on an inverse semigroup S,*
[TABLE]
where ξ∗ denotes the least congruence on S containing ξ.
ESζ, the centralizer of ES in S, is defined by
[TABLE]
ESω, the closure of ES
in S, is defined by
[TABLE]
where ≥
denotes the natural partial order on S defined by a≤b⇔(∃e∈ES) a=eb⇔(∃f∈ES) a=bf. A
semigroup which is a semilattice of groups is a Clifford semigroup. Equivalently, S is a Clifford semigroup if and only if S is
regular and its idempotents lie in its centre. A semigroup S is said to be E-unitary if ey=e for some e∈ES implies that y∈ES. Equivalently S is E-unitary if and only if it satisfies the
implication xy=x⇒y2=y. A subset K of S is full if ES⊆K. A congruence ρ
saturates K if K is a union of ρ-classes.
Let P be a class of semigroups and ρ∈C(S). Then ρ is over P if each ρ-class which
is a subsemigroup of S belongs to P. Also ρ is a P-congruence if S/ρ∈P. A congruence
ρ on S is idempotent separating if e2=e, f2=f and eρf imply that e=f. Equivalently, ρ is idempotent
separating if and only if ρ⊆H. On the other hand, ρ is idempotent pure if
kerρ=ES. Equivalently, ρ is idempotent pure if and only if ρ⊆C. We denote by
σ, η, μ and τ the least group, least semilattice, greatest idempotent separating and greatest idempotent pure congruences
on S, respectively. The equality and the universal relations on S are denoted by ε and ω respectively.
An inverse semigroup S is fundamental if ε is the only congruence on S contained in H (equivalently,
if μ=ε). An inverse semigroup S is E-disjunctive if ε is the only congruence on S saturating
ES (equivalently, if τ=ε).
Inverse semigroups the closure of whose set of idempotents is a Clifford semigroup were first studied by Billhardt [1].
Lemma 1.4**.**
([1, Lemma 5])*
Let S be an inverse semigroup and σ be the least group congruence on S. Then the following statements are equivalent.
(1) ESω is a Clifford semigroup;
(2) [aσb and a−1a≤b−1b]⇒aa−1≤bb−1;
(3) σ∩L=σ∩R;
(4) σ∩L is a congruence;
(5) σ∩R is a congruence.*
Properties of congruences obtained by starting with ω and successively forming ρt and ρk were first studied by Petrich –
Reilly [6].
Definition 1.5**.**
([6, Definition 5.1])
On S we define inductively the following two sequences of congruences:
[TABLE]
We call the aggregate {αn,βn}n=0∞, together with the inclusion relation for congruences, the min network of
congruences on S.
The min network is related to the following family of implications.
Definition 1.6**.**
([6, Definition 5.2])
An inverse semigroup S might satisfy one of the following implications:
(A0) x=y; (A1) x−1x=y−1y; (A2) y∈Eζ;
(An) xy=x, xβn−3y⇒y∈Eζ, n⩾3;
(B0) x=y; (B1) y∈E;
(Bn) xy=x, xβn−2y⇒y∈E, n⩾2.
The next few results develop some basic facts about the min network.
Lemma 1.7**.**
*(1) ([6, Proposition 5.3]) For n⩾1, we have αn−1∩βn−1=αn∨βn;
(2) ([6, Proposition 5.4]) the min network, together with the intersections of corresponding pairs, is a sublattice of
C(S).*
The quotients S/ωt, S/ωk, ⋯, as S runs over all inverse semigroups, form quasivarieties.
Lemma 1.8**.**
([6, Theorem 5.5])*
(1) αn is the minimum congruence ρ on S such that S/ρ satisfies (An);
(2) βn is the minimum congruence ρ on S such that S/ρ satisfies (Bn).*
The first few levels of the min network are depicted in Figure 1 ([6]) together with some relationships and alternative
characterizations.
2 Characterizations of αn+2 and βn+2
We will now develop characterizations of the congruences αn+2 and βn+2 for any natural number n on S. After defining
kerαn-is-Clifford semigroups and βn-is-over-E-unitary semigroups, we provide some equivalent conditions in terms of
implications as well as congruences. We then characterize kerαn-is-Clifford congruences and βn-is-over-E-unitary
congruences on an inverse semigroup S and prove that they form a complete ∩-subsemilattice of the lattice of all congruences on S with
least element αn+2 and βn+2 respectively.
Definition 2.1**.**
An inverse semigroup for which kerαn is a Clifford [resp. E-reflexive] semigroup is called a kerαn-is-Clifford
[resp. kerαn-is-E-reflexive] semigroup. An inverse semigroup S is called a βn-is-over-E-unitary
semigroup if eβn is E-unitary for each e∈ES. A congruence ρ on S is called a
kerαn-is-Clifford congruence if kerαn(S/ρ) is a Clifford semigroup. A congruence ρ on S is called a
βn-is-over-E-unitary congruence if βn(S/ρ) is over E-unitary semigroups.
We shall need some auxiliary results first.
Lemma 2.2**.**
For n⩾2, semigroups satisfying (Bn) are exactly βn−2-is-over-E-unitary semigroups.
Proof.
First suppose that S satisfies (Bn) and let x, y∈eβn−2 with xy=x. Then it is clear from the assumption that y∈E,
that is, eβn−2 is E-unitary.
Conversely, suppose that S is a βn−2-is-over-E-unitary semigroup, and let xy=x with xβn−2y. Then
x=xyβn−2y2βn−2x2 and xβn−2∈E(S/βn−2). Using our assumption we find that xβn−2 is
E-unitary whence y∈E.
∎
Remark 2.3**.**
Lemma 1.8 and Lemma 2.2 show that βn is the least βn−2-is-over-E-unitary congruence.
Let An denote the set of all congruences γ on S such that the kernel of αn(S/γ) is a Clifford semigroup. Let
Bn denote the set of all congruences θ on S such that βn(S/θ) is over E-unitary semigroups.
Lemma 2.4**.**
For n⩾0, An and Bn have least elements.
Proof.
Since the kernel of αn(S/ω) is trivial, it follows that ω∈An so that An=∅.
Suppose that G is a nonempty family of kerαn-is-Clifford congruences. It follows from Lemma 1.8 that the semigroups (S/ρ)/(αn(S/ρ)) (ρ∈G) all satisfy the implications in (An), hence so also does their direct product ρ∈G∏(S/ρ)/(αn(S/ρ)) as well as any subdirect product of ρ∈G∏(S/ρ)/(αn(S/ρ)).
Let γ denote the product of congruences ρ∈G∏αn(S/ρ). Then γ is a congruence on ρ∈G∏S/ρ. Now S/(ρ∈G⋂ρ) is (isomorphic to) a subdirect product of ρ∈G∏S/ρ and therefore γ induces a congruence on S/(ρ∈G⋂ρ). In addition, we have
[TABLE]
which also satisfies (An). But αn(ρ∈G∏S/ρ) is the least such congruence by Lemma 1.8 and therefore αn(ρ∈G∏S/ρ)⊆ρ∈G∏αn(S/ρ) so that kerαn(ρ∈G∏S/ρ)⊆ker(ρ∈G∏αn(S/ρ))=ρ∈G∏ker(αn(S/ρ)). However, the kernels of αn(S/ρ) (ρ∈G) are Clifford semigroups. This implies that the kernel of ρ∈G∏αn(S/ρ) is also a Clifford semigroup and therefore so also is the kernel of αn(S/(ρ∈G⋂ρ)). Therefore ρ∈G⋂ρ∈An. In other words, the set of congruences on S for which the quotient is a kerαn-is-Clifford semigroup is closed under arbitrary intersections. Therefore there exists a least such congruence, that is, An has a least element. A similar argument establishes the assertion concerning Bn and so the proof is complete.
∎
We are now ready for characterizations of kerαn-is-Clifford inverse semigroups.
Proposition 2.5**.**
*For n⩾1, the following conditions on an inverse semigroup S are equivalent.
(1) S is a kerαn-is-Clifford semigroup;
(2) [aαnb and a−1a≤b−1b]⇒aa−1≤bb−1;
(3) αn∩L=αn∩R;
(4) αn∩L is a congruence;
(5) αn∩R is a congruence;
(6) αn∩L=αn∩μ;
(7) there exists an idempotent separating βn−1-is-over-E-unitary congruence on S;
(8) βn+1⊆μ;
(9) (βn+1)t=ε;
(10) βn+1∩F=ε;
(11) kerαn⊆ESζ;
(12) S satisfies the implication xy=x, x−1xαnyy−1⇒y∈ESζ.*
Proof.
(1)⇒(2). Let aαnb and a−1a≤b−1b. Then ba−1∈kerαn whence it also follows that a−1≤b−1ba−1=b−1(bb−1)(ba−1)=b−1(ba−1)(bb−1). Thus aa−1≤(ab−1)(ba−1)(bb−1)≤bb−1.
(2)⇒(3). From the hypothesis, we have
[TABLE]
(3)⇒(4). Obvious, since L is a right and R is a left congruence.
(4)⇒(1). Here we have
[TABLE]
and
[TABLE]
Therefore we have aa−1=a−1a. It follows that kerαn is a Clifford semigroup.
(3)⇒(5)⇒(1). The proof is dual to that for (3)⇒(4)⇒(1) and is omitted.
(4)⇒(6). On the one hand, αn∩L∈C(S) and αn∩L⊆L
give that αn∩L is idempotent separating. Hence αn∩L⊆μ so that αn∩L⊆αn∩μ. On the other hand, μ⊆L gives αn∩μ⊆αn∩L. Consequently, αn∩L=αn∩μ, as required.
(6)⇒(7). From αn∩L=αn∩μ it follows that αn∩L is a congruence and thus
also that the βn−1-is-over-E-unitary congruence βn+1=(αn)k=(αn∩L)∗=αn∩L⊆L is idempotent separating.
(7)⇒(8). Assume that ρ is an idempotent separating congruence such that βn−1(S/ρ) is over E-unitary
semigroups. By Remark 2.3, βn+1 is the least such congruence. Therefore βn+1⊆ρ⊆μ.
(8)⇒(9). Since βn+1⊆μ, we have (βn+1)t⊆μt=ε and thus
(βn+1)t=ε.
(9)⇒(10). It follows directly from Lemma 1.3.
(10)⇒(7). If βn+1∩F=ε, then by Lemma 1.3 βn+1 is idempotent separating. By
Remark 2.3, βn+1 is a βn−1-is-over-E-unitary congruence.
(7)⇒(4). Since (7)⇒(8), we know that βn+1⊆ρ⊆μ. By [4, Proposition
III.3.2], μ⊆L. Hence Definition 1.5 and Lemma 1.3 give that (αn∩L)∗=(αn)k=βn+1⊆L. Thus, with αn∩L⊆αn, we have (αn∩L)∗⊆αn∗=αn and (αn∩L)∗=αn∩L so that αn∩L is a congruence.
(1)⇒(11). Let a∈kerαn. By the fact that kerαn is a full inverse subsemigroup and the assumption that
kerαn is a Clifford semigroup, we find that ae=ea for all e∈ES, and thus a∈ESζ.
(11)⇒(12). Let xy=x and x−1xαnyy−1. Then yαnx−1xy=x−1x. But kerαn⊆ESζ and so y∈ESζ.
(12)⇒(1). Let a∈kerαn. By the dual of [4, Notation III.2.4] and [4, Exercise
III.2.14(iii)], ea=e for some e∈ES with eβn−1aa−1. Notice that
trβn−1=trαn. We have e−1e=eαnaa−1 and therefore a∈ESζ by assumption.
This together with the fact that kerαn is a full inverse subsemigroup gives that S is a kerαn-is-Clifford semigroup.
∎
An important property of kerαn-is-Clifford semigroups is contained in the following proposition.
Proposition 2.6**.**
Let S be an inverse semigroup and n⩾2. If kerαn−1∩N is a Clifford subsemigroup for every η-class N of
S, then kerαn is a Clifford semigroup.
Proof.
Let a∈kerαn and f∈ES. Since aηa−1a, we have afηa−1af. Further,
aαna−1a gives afαna−1af, whence af, a−1af∈kerαn⊆kerαn−1. We
consequently have (af)(a−1af)=(a−1af)(af) since kerαn−1∩(a−1af)η is a Clifford subsemigroup of S. Notice
that (af)(a−1af)=a(a−1af)=af and (a−1af)(af)=(fa−1a)(af). It follows that af=fa−1aaf and faf=f(fa−1aaf)=af. But
aηaa−1 and so faηfaa−1. Again, aαnaa−1 gives faαnfaa−1, whence fa, faa−1∈kerαn⊆kerαn−1. Therefore we have (fa)(faa−1)=(faa−1)(fa) by assumption. It is clear from
(fa)(faa−1)=faaa−1f and (faa−1)(fa)=f(faa−1)a=fa that fa=faaa−1f and faf=(faaa−1f)f=fa. We conclude that fa=faf=af
and that kerαn is a Clifford semigroup.
∎
Remark 2.7**.**
Proposition 2.6 presents a response to the problem in [2].
For a given congruence ρ, an exactly parallel argument to Lemma 2.4’s establishes that the least βn-is-over-E-unitary
congruence containing ρ exists. Denote it by (βn+2)ρ. The next result characterizes kerαn-is-Clifford congruences
in terms of more familiar notions.
Proposition 2.8**.**
*For n⩾1, the following statements concerning a congruence ρ on an inverse semigroup S are equivalent.
(1) ρ is a kerαn-is-Clifford congruence;
(2) (βn+1)ρ⊆ρT, where (βn+1)ρ is the least βn−1-is-over-E-unitary congruence on S
containing ρ;
(3) tr(βn+1)ρ=trρ.*
Proof.
(1)⇒(2). Clearly (S/ρ)/((βn+1)ρ/ρ)≃S/(βn+1)ρ. Thus (βn+1)ρ/ρ is a
βn−1-is-over-E-unitary congruence on S/ρ. If θ/ρ is a βn−1-is-over-E-unitary congruence on S/ρ with
ρ⊆θ, then S/θ≃(S/ρ)/(θ/ρ) which implies that θ is a βn−1-is-over-E-unitary
congruence on S. Hence (βn+1)ρ⊆θ and (βn+1)ρ/ρ⊆θ/ρ. Consequently
(βn+1)ρ/ρ is the least βn−1-is-over-E-unitary congruence on S/ρ whence
βn+1(S/ρ)=(βn+1)ρ/ρ.
If S/ρ is a kerαn-Clifford semigroup, then (βn+1)ρ/ρ=βn+1(S/ρ)⊆μ(S/ρ)=ρT/ρ,
and thus (βn+1)ρ⊆ρT.
(2)⇒(3). Since ρ⊆(βn+1)ρ⊆ρT, we have trρ⊆tr(βn+1)ρ⊆trρT=trρ, which implies tr(βn+1)ρ=trρ.
(3)⇒(1). tr(βn+1)ρ=trρ implies (βn+1)ρ⊆ρT. Since
trρ=tr(βn+1)ρ, (βn+1)ρ/ρ is an idempotent separating congruence on S/ρ, which gives that
S/ρ is a kerαn(S/ρ)-is-Clifford semigroup by Proposition 2.5. This completes the proof that ρ is a
kerαn-is-Clifford congruence.
∎
Remind that An is the set of all congruences γ on an inverse semigroup S such that the kernel of αn(S/γ) is
a Clifford semigroup. Equivalently, An is the set of all kerαn-is-Clifford congruences on S ordered by inclusion.
Theorem 2.9**.**
*Let S be an inverse semigroup.
(1) An is a complete ∩-subsemilattice of C(S) whose least element is αn+2=(βn+1)t=(βn+1∩F)∗ and greatest element is ω;
(2) the interval [αn+2,βn+1] is a complete sublattice of An.*
Proof.
(1) It follows directly from Lemma 2.4 that An is a complete ∩-subsemilattice of C(S).
Since (βn+1)(βn+1)t=βn+1⊆(βn+1)T=((βn+1)t)T, we have by Proposition 2.8
that (βn+1)t is a kerαn-is-Clifford congruence. If ρ is a kerαn-is-Clifford congruence, then βn+1⊆(βn+1)ρ⊆ρT and (βn+1)t⊆(ρT)t=ρt⊆ρ. This proves that
αn+2=(βn+1)t is the least kerαn-is-Clifford congruence.
(2) If ρ∈[αn+2,βn+1], then trρ=trαn+2=trβn+1. But then (βn+1)ρ=βn+1⊆ρT, and thus Proposition 2.8 gives that ρ is a kerαn-is-Clifford congruence.
Let A be a non-empty family of congruences on S such that ρ∈[αn+2,βn+1] for every ρ∈A, then ρ∈A⋂ρ, ρ∈A⋁ρ∈[αn+2,βn+1], and so ρ∈A⋂ρ,
ρ∈A⋁ρ are kerαn-is-Clifford congruences by what was proved earlier,
which completes the proof of the assertion.
∎
We now turn to characterizations of βn+2. Compare the following result with Proposition 2.5.
Proposition 2.10**.**
*For n⩾1, the following conditions on an inverse semigroup S are equivalent.
(1) S is a βn-is-over-E-unitary semigroup;
(2) βn∩F is a congruence;
(3) βn∩C is a congruence;
(4) βn∩F=βn∩τ;
(5) βn∩C=βn∩τ;
(6) there exists an idempotent pure kerαn−1-is-Clifford congruence on S;
(7) αn+1⊆τ;
(8) (αn+1)k=ε;
(9) trβn⊆trτ;
(10) S satisfies the implication xy=x, x−1xαn+1yy−1⇒y∈ES;
(11) αn+1∩L=ε.*
Proof.
(7)⇒(8). It follows from αn+1⊆τ that (αn+1)k⊆τk=ε, and hence that
(αn+1)k=ε.
(8)⇒(7). By (αn+1)k=ε, we have kerαn+1=ker(αn+1)k=ES. Hence
αn+1 is idempotent pure so that αn+1⊆τ.
(7)⇒(6). The hypothesis implies that the kerαn−1-is-Clifford congruence αn+1 is idempotent pure.
(6)⇒(3). Assume that ρ is an idempotent pure kerαn−1-Clifford congruence. Then αn+1⊆ρ⊆τ⊆C so that (βn∩C)∗=αn+1⊆C. Also by (βn∩C)∗⊆βn, (βn∩C)∗⊆βn∩C and thus (βn∩C)∗=βn∩C, which implies that βn∩C is a congruence.
(3)⇒(9). If βn∩C is a congruence, then βn∩C is idempotent pure since
βn∩C⊆C. Hence βn∩C⊆τ and βn∩C⊆βn∩τ. Therefore βn∩C=βn∩τ from the fact that τ⊆C.
Let e, f∈ES with eβnf. Then e(βn∩C)f since any two idempotents is
C-related on inverse semigroups. By βn∩C=βn∩τ, we get eτf, as required.
(9)⇒(7). Suppose that a∈kerαn+1=ker(βn)t. Then by [4, Exercises
III.2.14 (iii)] there exists e∈ES such that ae=e and
eβna−1a, and thus eτa−1a by assumption. Hence e=aeτa(a−1a)=a which gives a∈ES.
(3)⇒(2). If βn∩C is a congruence, then βn∩F⊆(βn∩F)∗=(βn∩C)∗=βn∩C⊆βn∩F, and thus βn∩F=βn∩C is a congruence.
(2)⇒(4). On the one hand, βn∩F∈C(S) and βn∩F⊆F
give that βn∩F is idempotent pure. Hence βn∩F⊆τ so that βn∩F⊆βn∩τ. On the other hand, τ⊆F gives βn∩τ⊆βn∩F. Consequently, βn∩F=βn∩τ, as required.
(4)⇒(5). Assume that βn∩F=βn∩τ. Then βn∩C⊆βn∩F=βn∩τ⊆βn∩C, which gives that βn∩C=βn∩τ.
(5)⇒(7). It follows directly from the hypothesis that αn+1=(βn)t=(βn∩C)∗=(βn∩τ)∗=βn∩τ⊆τ.
(3)⇒(11). Since βn∩C is a congruence, we have that αn+1=(βn)t=(βn∩C)∗=βn∩C, and thus αn+1∩L=βn∩C∩L=βn∩ε=ε.
(11)⇒(7). Since αn+1∩L=ε, by [4, Proposition III.4.2] we have that
αn+1 is idempotent pure and thus αn+1⊆τ.
(7)⇒(1). Let a∈eβn and a∈Eeβnω. Then a=fg for some f, g∈Eeβn so that ag=fg and gβna−1aβnf. Thus a(βn)tf which implies that
aαn+1f. But αn+1⊆τ which yields a∈E.
(1)⇒(10). Let x,y∈S be such that xy=x and x−1xαn+1yy−1. Then x−1xβnyy−1 since
trαn+1=trβn. Hence x−1x=x−1xyβnyy−1y=y, which together with x−1xy=x−1x implies y∈ES by assumption.
(10)⇒(7). Assume that a(βn)te for some e∈ES. Then there exists f∈ES such that fa=fe and fβnaa−1βne, which implies that (fe)a=e(fa)=e(fe)=fe and
fe=faβn(aa−1)a=a. Therefore feβnaa−1 whence feαn+1aa−1, since trβn=trαn+1.
The hypothesis yields a∈ES and thus ker(βn)t=ES so that
αn+1=(βn)t⊆τ.
∎
The next proposition illustrates this class of inverse semigroups.
Proposition 2.11**.**
Let S be a βn-is-over-E-unitary inverse semigroup and n⩾1. Then S is a kerαn−1-is-E-reflexive
semigroup.
Proof.
Let x,y∈kerαn−1, e∈ES be such that exy∈ES. Then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Hence exyCyexyy−1, eyxCyexyy−1. But x,y∈kerαn−1=kerβn, so
[TABLE]
[TABLE]
Hence exy(βn∩C)yexyy−1,
eyx(βn∩C)yexyy−1. Since βn∩C is a congruence by Proposition 2.10, it is also an
equivalence relation. So exy(βn∩C)eyx. That βn∩C is an idempotent pure congruence gives
eyx∈ES. We deduce that kerαn−1 is E-reflexive.
∎
For a given congruence ρ, in a similar way to Lemma 2.4’s we may find that the least kerαn-is-Clifford congruence
containing ρ exists. Denote it by (αn+2)ρ. We are now ready for characterizations of βn-is-over E-unitary
congruences.
Proposition 2.12**.**
*For n⩾1, the following statements concerning a congruence ρ on an inverse semigroup S are equivalent.
(1) ρ is a βn-is-over-E-unitary congruence;
(2) (αn+1)ρ⊆ρK, where (αn+1)ρ is the least kerαn−1-is-Clifford congruence on S
containing ρ;
(3) ker(αn+1)ρ=kerρ.*
Proof.
(1)⇒(2). The correspondence of congruences on S containing ρ and congruences on S/ρ shows that for any a,b∈S,
[TABLE]
If S/ρ is a βn-is-over-E-unitary semigroup, then
(αn+1)ρ/ρ=αn+1(S/ρ)⊆τ(S/ρ)=ρK/ρ, and thus (αn+1)ρ⊆ρK.
(2)⇒(3). Since ρ⊆(αn+1)ρ⊆ρK, we have kerρ⊆ker(αn+1)ρ⊆kerρK=kerρ, which implies ker(αn+1)ρ=kerρ.
(3)⇒(1). ker(αn+1)ρ=kerρ implies (αn+1)ρ⊆ρK. Since
kerρ=ker(αn+1)ρ, (αn+1)ρ/ρ is an idempotent pure congruence on S/ρ, which gives that S/ρ
is a βn-is-over-E-unitary semigroup by Proposition 2.10. This completes the proof that ρ is a
βn-is-over-E-unitary congruence.
∎
We now turn to the set of all βn-is-over-E-unitary congruences on an inverse semigroup. Recall that Bn is the set of all
congruences θ on S such that βn(S/θ) is over E-unitary semigroups, or equivalently, the set of all
βn-is-over-E-unitary congruences on S ordered by inclusion.
Theorem 2.13**.**
*Let S be an inverse semigroup.
(1) Bn is a complete ∩-subsemilattice of C(S) with least element βn+2=(αn+1)k=(αn+1∩L)∗ and greatest element ω;
(2) the interval [βn+2,αn+1] is a complete sublattice of Bn.*
Proof.
(1) It follows immediately from Lemma 2.4 that Bn is a complete ∩-subsemilattice of C(S).
To prove that (αn+1)k is the least βn-is-over-E-unitary congruence on S, we first note that
(αn+1)(αn+1)k=αn+1⊆αn+1K=((αn+1)k)K so that (αn+1)k is a
βn-is-over-E-unitary congruence. If ρ is a βn-is-over-E-unitary congruence, then αn+1⊆(αn+1)ρ⊆ρK and (αn+1)k⊆(ρK)k=ρk⊆ρ, which implies that
βn+2=(αn+1)k is the least βn-is-over-E-unitary congruence.
(2) The argument here goes along the same lines as in Theorem 2.9.
∎
We conclude this section with a new observation comparing to Petrich – Reilly [6, Theorem 5.5].
Definition 2.14**.**
An inverse semigroup S might satisfy one of the following implications:
(A0′) x=y; (A1′) x−1x=y−1y; (A2′) y∈Eζ;
(An′) xy=x, x−1xαn−2yy−1⇒y∈Eζ, n⩾3;
(B0′) x=y; (B1′) y∈E;
(Bn′) xy=x, x−1xαn−1yy−1⇒y∈E, n⩾2.
We now come to the main theorem.
Theorem 2.15**.**
*For an inverse semigroup S,
(1) αn is the least congruence ρ on S such that S/ρ satisfies (An′);
(2) βn is the least congruence ρ on S such that S/ρ satisfies (Bn′).*
Proof.
We will first observe that the theorem is true for n=0, 1 and 2, and then complete the proof with an induction argument.
The assertion of the theorem for α0, α1, α2, β0 and β1 follows directly from [6, Theorem
5.5]. β2, as we know, is the least E-unitary congruence, or the least β0-is-over-E-unitary congruence. It follows
from [4, Proposition III.7.2] that β2 is the least congruence ρ such that S/ρ satisfies (B2′).
Now suppose that n⩾3 and that the theorem is valid for smaller integers. Then, by the induction hypothesis that βn−1 is a
βn−3-is-over-E-unitary congruence, applying Proposition 2.8, we obtain that S/αn is a
kerαn−2-is-Clifford semigroup, which satisfies (An′) by virtue of Proposition 2.5. Similarly, applying Proposition
2.12, by the induction hypothesis that αn−1 is a kerαn−3-is-Clifford congruence, we get that S/βn is a
βn−2-is-over-E-unitary semigroup, which satisfies (Bn′) in view of Proposition 2.10.
The minimality of these congruences follows immediately from Theorem 2.9 and Theorem 2.13.
∎
Remark 2.16**.**
(1) We obtain by Theorem 2.9 that ηt is the least Clifford congruence, and that πt is the least Eω-Clifford
congruence, which is due to Wang - Feng [2].
(2) By Theorem 2.13 we get that σk is the least E-unitary congruence, and that (πt)k is the least
π-is-over-E-unitary congruence. Proposition 2.11 shows that S/(πt)k is an Eω-E-reflexive semigroup. Here a
correction should be made to Theorem 3.2 of [2]: π-is-over-E-unitary semigroups are Eω-E-reflexive, but
Eω-E-reflexive semigroups are not necessarily π-is-over-E-unitary semigroups.
The min network is redepicted in Figure 2 together with the types of semigroups to which the quotient semigroups belong.
Refer to any inverse semigroup satisfying (An) as an An-semigroup. Similarly, an inverse semigroup satisfying (Bn) is called a
Bn-semigroup. The next proposition gives one further observation concerning the min network.
Proposition 2.17**.**
*Let m, n be nonnegative integers.
(1) αm+n is the least congruence ρ on S such that αn(S/ρ) is over Am-semigroups;
(2) βm+n is the least congruence ρ on S such that βn(S/ρ) is over Bm-semigroups.*
Proof.
We shall only prove that (eαm+n)(αn(S/αm+n))=(eαm+n)(αn/αm+n) satisfies (Am) for any e∈ES. Denote (eαm+n)(αn/αm+n)={aαm+n∣aαne} by E0. For m⩾3, notice that
βm−3(E0)=(βn+m−3/αm+n)∣E0. Suppose that aαm+n, bαm+n∈E0 with
(aαm+n)(bαm+n)=aαm+n and (aαm+n)βm−3(E0)(bαm+n). Then
(aαm+n)(bαm+n)=aαm+n and aβm+n−3b. But S/αm+n satisfies (Am+n) and bαm+n∈ES/αm+nζ and hence bαm+n∈EE0ζ. Thus E0 satisfies (Am). The minimality of the congruence follows
immediately from the fact that αm+n is the least congruence γ on S such that S/γ satisfies (Am′).
The remaining arguments go along the same lines and are omitted.
∎
3 Coincidences
Petrich [4] investigates necessary and sufficient conditions in order that two of the congruences in {ω,σ,η,ν,π,λ,μ,τ,ε} coincide. This creates many interesting classes of inverse semigroups. Further equivalent conditions
can be established if αn and βn are taken into account.
Proposition 3.1**.**
*The following statements hold in any inverse semigroups.
(1) For n⩾2, αn=ω⟺σ=η=ω⟺βn=ω;
(2) for n⩾3, αn=σ⟺βn−1=σ;
(3) for n⩾2, αn=η⟺βn+1=η;
(4) for n⩾4, αn=ν⟺βn−1=ν;
(5) for n⩾3, αn=π⟺βn+1=π;
(6) for n⩾4, αn=λ⟺βn+1=λ;
(7) for n⩾3, αn=μ⟺S is a βn−3-is-over-E-unitary fundamental inverse semigroup;
(8) for n⩾1, αn=τ⟺S is a βn−1-is-over-E-unitary semigroup with trτ=trβn−1;
(9) for n⩾2, βn=τ⟺S is a βn−2-is-over-E-unitary E-disjunctive inverse semigroup.*
Proof.
(1) Suppose that αn=ω. Since αn⊆σ and αn⊆η, it follows that σ=η=ω.
Conversely, if σ=η=ω, then π=σk=ωk=η=ω and ν=ηt=ωt=σ=ω. Similarly, we have
λ=ω and πt=ω. Inductively, we have αn=ω. σ=η=ω⟺βn=ω follows by duality.
(2) If αn=σ, then σ=αn⊆βn−1⊆β2⊆σ and thus βn−1=σ.
Conversely, if βn−1=σ, then αn=(βn−1)t=σt=σ.
(3) If αn=η, then βn+1=(αn)k=ηk=η. Conversely, if βn+1=η, then βn+1=(αn)k⊆αn⊆η and thus αn=η.
(4) If αn=ν, then ν=αn=(βn−1)t⊆βn−1⊆β3⊆ν and thus βn−1=ν.
Conversely, if βn−1=ν, then αn=(βn−1)t=νt=ν.
(5) If αn=π, then βn+1=(αn)k=πk=π. Conversely, if βn+1=π, then π=βn+1=(αn)k⊆αn⊆α3⊆π and thus αn=π.
(6) If αn=λ, then βn+1=(αn)k=λk=λ. Conversely, if βn+1=λ, then λ=βn+1⊆αn⊆α4⊆λ and thus αn=λ.
(7) For n=3, the assertion follows directly from [2, Proposition 4.3]. For n>3, suppose that αn=μ. Since
αn=(βn−1)t⊆βn−1⊆αnT=μT=μ=αn, it follows that αn=βn−1=μ and thus
μ=αn=(βn−1)t=μt=ε, which implies βn−1=ε. Thus μ=ε gives that S is
fundamental while βn−1=ε gives that S is a βn−3-is-over-E-unitary semigroup.
If S is a βn−3-is-over-E-unitary fundamental inverse semigroup, then μ=ε and βn−1=ε, which imply
that βn−1=μ. Hence αn=(βn−1)t=μt=ε=μ.
(8) For n=1 and n=2, the assertions follow directly from [4, Coincidences III.8.10]. For n⩾3, if
αn=τ, then trτ=trαn=trβn−1 and βn+1=(αn)k=τk=ε, which give that S is a
βn−1-is-over-E-unitary semigroup.
Now suppose that S is a βn−1-is-over-E-unitary semigroup with trτ=trβn−1. The hypothesis implies that
βn+1=ε so that kerαn=kerβn+1=ES=kerτ, and thus
trαn=trβn−1=trτ gives that αn=τ.
(9) For n=2, the assertion follows directly from [4, Coincidences III.8.10]. For n>2, if βn=τ, then
τ=βn=(βn)k=τk=ε, which gives that S is a βn−2-is-over-E-unitary semigroup and is E-disjunctive.
Conversely, if S is a βn−2-is-over-E-unitary E-disjunctive inverse semigroup, then βn=ε and τ=ε
which imply that βn=τ=ε.
∎
Acknowledgements The authors are grateful to the careful referee for thoughtful comments and insights which helped to improve the paper, in particular, with regard to Lemma 2.4 and Proposition 2.17. The first author would like to thank Professor
Victoria Gould for her continuing support and encouragement. This work is supported by a Grant of the National Natural Science Foundation of
China (11871150) and a Grant of the Ministry of Education of China (18YJCZH206).