Laws for generalised interior operations in semigroups

Motivated by interior operators and by analogous generalisations of closure operators to semigroups in general, we define left, right and two-sided interior operations on a semigroup S in terms of a distinguished set of idempotents E using the natural order. In the left-sided case, we require that for all s∈S\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s\in S$$\end{document}, there is a largest e∈E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$e\in E$$\end{document} under the natural order such that es=e\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$es=e$$\end{document}. We generalise them using suitable Green-like relations, and characterise the resulting classes of unary and biunary semigroups as quasivarieties or varieties.

• right pre-reduced if ≤ r is partial order on E (that is, e ∼ r f implies e = f for all e, f ∈ E, or equivalently, e = e f and f = f e imply e = f for all e, f ∈ E); left pre-reduced if ≤ l is partial order on E; • pre-reduced it is both right and left pre-reduced; • maximal right pre-reduced if E is right pre-reduced and is not contained in a strictly larger right pre-reduced set of idempotents. Obviously, if E is (left/right) reduced, then it is (left/right) pre-reduced (although the converses fail). A right pre-reduced subset E of E(S) is nothing other than a selection of at most one idempotent from each ∼ r -class in E(S); hence a typical maximal right pre-reduced subset E of E(S) may be obtained by selecting precisely one idempotent from each ∼ r -class of E(S), as is easily seen. Note that if E = E(S) is right prereduced (resp. left pre-reduced, pre-reduced), then it is automatically right reduced (resp. left reduced, reduced), as is well-known and easily shown.

Motivation
The concept of a closure operator is a familiar one: it is an operator given by A → cl(A) on the power set 2 X of the set X , satisfying the following familiar laws (expressed in terms of intersection): Defining the "closed sets" in X to be those of the form cl(A), A ⊆ X , it follows easily that for any A ∈ 2 X , cl(A) ∈ 2 X is the smallest closed subset of X containing A. Conversely, one can show that every closure operator on the set X arises in this way from a collection of "closed subsets" of X such that every subset of X is contained in a smallest closed subset. The case of topological closure operators defined on general Boolean algebras has been investigated in detail; see [11], where an equational basis for such algebras was given.
An abstraction to (meet-)semilattices is straightforward, and is just a special case of the concept as it applies to partially ordered sets: C is a closure operation on the semilattice S if there is E ⊆ S such that for all s ∈ S, there is a smallest e ∈ E for which se = s, called C(s); then E is the collection of closed elements (of the form C(s), s ∈ S), and can be shown to be a subsemilattice of S. One can write down some simple equational laws to characterise this situation -essentially those above for closure operators but with intersections replaced by meets.
Generalising to a semigroup setting, the concept of a C-semigroup was defined in [5], although it had earlier been defined in a different way in [1]. A C-semigroup is a semigroup equipped with a kind of "closure operation", the left-sided version of which is as follows: S is a left C-semigroup if S contains a multiplicative subsemigroup E ⊆ E(S) which is a subsemilattice and such that for every a ∈ S, there is a smallest e ∈ E (under the meet-semilattice order, which is of course the natural order on E) for which ea = a; denote this smallest e ∈ E by C(a). This order-theoretic approach rather than some definition in terms of laws (like those used to define closure operators) is the appropriate way to generalise the concept from semilattices to semigroups.
Nevertheless, it was shown in [5] that such unary semigroups could in any case be characterised in terms of finitely many equational axioms involving the induced unary operation C and multiplication. C-semigroups were studied for their own sake in [5], with numerous examples given, such as inverse semigroups and semigroups of partial functions. Denoting by PT (X ) the semigroup of partial functions acting on the right on the set X so that f g is "first f , then g" (here and throughout), then letting E be the semilattice under composition of all restrictions of the identity map on X to subsets of X , it is easy to see that C(s), the smallest member of E for which es = s, exists for all s ∈ PT (X ) and is just 1 dom(s) , the identity function restricted to the domain of s in X , dom(s). This results in the class of left restriction semigroups.
More recently, the current author became aware of semigroup settings in which the closed elements did not necessarily commute with one-another, arising naturally in other areas of mathematics. For example, consider any Rickart * -ring: this is an associative ring with identity and involution, such that the left (equivalently right) annihilator of every element is generated as a left (respectively right) ideal by a necessarily unique projection (symmetric idempotent e, satisfying e * = e). Rickart * -rings arise in the theory of operator algebras. If R is one such and s ∈ R, with the projection ann(s) generating the left annihilator (0 : s) = {r ∈ R | rs = 0} of s ∈ R, then letting D(s) = 1 − ann(s), we find that D(s) is the smallest e ∈ E * (R), the set of projections of R, under the natural order, such that es = s. This is formally identical to the definition of C(s) in a left C-semigroup, but note that members of E * (R) do not commute with one-another and E * (R) is not in general a multiplicative subsemigroup of R.
This leads to consideration of semigroups S, with or without involution, equipped with a subset E of idempotents for which for all s ∈ S, there is a smallest e ∈ E under the natural order for which es = s. Such D-semigroups were considered in [13], where they were axiomatised as a variety of unary semigroups, and their properties studied in the semigroup and ring cases. It was noted in [13] that D-semigroups have a close connection with a class of semigroups defined by means of a generalised Green's relation. Thus, for a semigroup S and non-empty E ⊆ E(S), we define R E as follows: (a, b) ∈ R E if and only if for all e ∈ E, ea = a if and only if eb = b. Then S is weakly left E-abundant (also known in the literature as "left E-semiabundant") if for all s ∈ S there is e ∈ E for which (s, e) ∈ R E . This notion is a variant of the notion of left abundance of a semigroup, which is defined in terms of the generalised Green's relation R * given by (a, b) ∈ R * if and only if for all x, y ∈ S 1 , xa = ya if and only if xb = yb; one says that S is left abundant if every R * -class contains at least one idempotent. It is easily seen that left abundance implies weak left E(S)-abundance.
Following notation introduced in Sect. 1.1 of [9], as well as in Sect. 1 of [15], we shall adopt the following conventions throughout: if S is a semigroup with E ⊆ E(S) and ρ an equivalence relation on S, we shall say S is • (E, ρ)-abundant if every ρ-class of S contains an element of E; • ρ-abundant if E = E(S) in the above; and • if the idempotent in each ρ-class in each of the above is unique we replace "abundant" with "amiable".
We shall use this standardised notation and terminology throughout what follows. In terms of this new notation, we see that It was shown in [13] that S is a D-semigroup if and only if S is (D(S), R D(S) )abundant where D(S) = {D(s) | s ∈ S}, and D(S) is left reduced. It then follows easily that for s ∈ S, D(s) is in fact the unique e ∈ D(S) such that (s, e) ∈ R E , and so S is (D(S), R D(S) )-amiable.
At this point a possible generalisation of D-semigroups becomes obvious: just drop the left reduced requirement but retain amiability. It is easily seen that a semigroup S This yields the definition of "generalised D-semigroups" given in [14]. There, it was noted that every (E, R E )-abundant semigroup S can be made into such a generalised D-semigroup, by selecting precisely one e ∈ E from each R E -class at the outset to give F ⊆ E, and defining D(s) = e ∈ F where (s, e) ∈ R E , and moreover that R E = R F , and F is necessarily left pre-reduced. (Of course, in general there may be many ways to choose F and hence to define D.) A generalised version of the original order-theoretic motivation can now be recovered: a generalised D-semigroup S is precisely a semigroup with distinguished set of idempotents E such that for all s ∈ S, there is a unique smallest e ∈ E under the left quasiorder ≤ l on E for which es = s; this forces E to be left pre-reduced, (s, D(s)) ∈ R E for all s ∈ S, and D(S) = E. The class of generalised D-semigroups has a finite equational axiomatisation as a class of unary semigroups, generalising that for C-semigroups. The class of generalised D-semigroups which are (E, R * )-abundant as semigroups may be characterised as a proper subquasivariety.
In the current work, our interest moves from closure-like operations on semigroups to interior-like operations. The original motivating examples come from topology and modal logic, although in those settings, closure and interior operators are essentially equivalent, since if int (A) denotes the interior of the subset A of a topological space, this is nothing but the complement of cl(A c ), where A c is the complement of A in X . More abstractly, one may define an interior algebra to be a Boolean algebra equipped with a unary operation satisfying certain laws, modelling the case of the power set algebra of a topological space equipped with its interior operator; these also arise as so-called type S4 modal Boolean algebras in modal logic. Interior algebras were studied from the varietal perspective in [2].
Generalising interior algebras to semilattices is again straightforward: we may say that the semilattice S is an interior semilattice if there is distinguished E ⊆ E(S) such that for all s ∈ S, there is a largest e ∈ E (under the meet-semilattice order on S) such that es = e. The passage to semigroups is then analogous to this passage from closure operations on semilattices to general C-semigroups. Thus, in [8], so-called interior semigroups were considered; an interior semigroup S is a semigroup with subsemigroup that forms a semilattice E for which, for all s ∈ S, there is a largest e ∈ E, denoted I (s), such that es = e; an equational axiomatisation of such interior semigroups was given in [8].
Examples of interior semigroups defined this way arise from the theory of partial functions. Denoting again by PT (X ) the semigroup of partial functions on the set X , and again letting E be the semilattice under composition all restrictions of the identity map on X to subsets of X , it is easy to see that I (s), the largest member of E for which es = e, exists for all s ∈ PT (X ) and is just 1 fix(s) , the identity function restricted to the fix-set of s in X , fix (s) = {x ∈ X | xs = x}.
It is natural to generalise the concept of an interior operation in the same way that C-semigroups were generalised to give D-semigroups, by dropping the requirement that E be a semilattice and instead using the natural order on E. For example, in a Rickart * -ring R, one can define I (s) = 1 − D(1 − s) = ann(1 − s), and then one can check that I (s) is the largest e ∈ E * (R) (the set of symmetric idempotents) under the natural order such that es = e; in terms of left annihilators, I (s) is simply the projection that generates (0 : 1 − s). This leads to consideration of any semigroup S equipped with some set of idempotents E such that for every s ∈ S, there is a largest e ∈ E under the natural order for which es = e. As a special case of more general results, we give axioms for these left interior semigroups in Sect. 4 and study their basic properties.
An alternative way to generalise semilattices with a (left) interior operation (which are of course commutative) is to consider any semigroup S equipped with a set of idempotents E such that for each s ∈ S, there is an element I (s) ∈ E which is simultaneously both the largest e ∈ E for which es = e and the largest e ∈ E for which se = e. We call such semigroups two-sided interior semigroups, and also consider these in what follows.
Just as for D-semigroups, the notion of general left interior semigroup we have just defined can be described in terms of some kind of variant of a Green's relation which will be studied in Sect. 3. The relevant analog of R E here is the equivalence relation F E , defined on any semigroup with E ⊆ E(S), as follows: There is an obvious right-sided variant G E , defined as follows: (s, t) ∈ G E if and only if, for all e ∈ E, (se = e ⇔ te = e).
The notation here stems from the use of the symbols F and G in [15] for the relations defined as follows: In that work, these were compared to Green's relations L and R as well as their variants L * and R * , and F-abundance and amiability of semigroups were studied, as were variants of superabundance involving K = F ∩ G. A major difference between F (resp. G) and L (resp. R) is that the latter is a right (resp. left) congruence, whereas the former is not.
It follows that S is a left interior semigroup in the general sense described above if and only if S is (I (S), F I (S) )-abundant (where I (S) = {I (s) | s ∈ S}) and I (S) is right reduced; again it will follow that I (s) is the unique e ∈ I (S) such that (s, e) ∈ F I (S) , so that S is (I (S), F I (S) )-amiable.
As for D-semigroups, an obvious generalisation beckons: in Sect. 4, we define left generalised interior semigroups (left GI-semigroups) to be nothing but (E, F E )amiable semigroups (equivalently, (E, F E )-abundant semigroups in which E is right pre-reduced), equipped with the obvious induced unary operation I . (There is an obvious notion of right GI-semigroups, defined from (E, G E )-amiable semigroups in the same way.) As for generalised D-semigroups, every (E, F E )-abundant semigroup S can be made into a left GI-semigroup, by selecting precisely one e ∈ E from each F E -class at the outset to give F ⊆ E, and defining I (s) = e ∈ F where (s, e) ∈ F E ; then F is necessarily right pre-reduced and F E = F F . Again the choice of F and hence of I here is far from unique.
Again, there is a nice order-theoretic formulation of the left GI-semigroup notion. We shall show that a left GI-semigroup S is nothing but a semigroup with distinguished set of idempotents E such that for all s ∈ S, there is a unique largest f ∈ E under the right quasiorder for which f s = f , namely f = I (s); this forces E to be right pre-reduced, (s, I (s)) ∈ F E for all s ∈ S, and I (S) = E.
We shall show that the class of left GI-semigroups is a proper quasivariety, and we give a finite axiomatisation. This differentiates left GI-semigroups from generalised D-semigroups, which form a variety. We also show that the class of those left GIsemigroup S which are (E, F)-abundant is a proper subquasivariety of the class of left GI-semigroups. We shall see in Proposition 5.1 that in any left GI-semigroup S and for any e, f ∈ I (S), I (e f ) is an upper bound on all the common lower bounds of e, f ; in many cases it is also a lower bound of them and hence is their meet. We give an equational description of those left GI-semigroups having such "large meets" (formally defined in Definition 5.2).
We shall consider semigroups which are both left GI-semigroups and right GIsemigroups with respect to the same set of idempotents; of particular interest are those for which the left and right interior operations are equal. We give an equational characterisation of the resulting unary semigroups, which we call two-sided GI-semigroups. In these cases, I (S) is reduced and is a meet-semilattice under the natural order having large meets in the sense of the previous paragraph. Indeed, we show that two-sided GI-semigroups are nothing but the two-sided interior semigroups discussed previously, in which for every s ∈ S, I (s) is both the largest e ∈ E under the natural order for which es = e, and the largest e ∈ E under the natural order for which se = e.
We conclude the paper by considering the relation K E = F E ∩ G E for its own sake; we shall see that K E -abundance implies K E -amiability (parallelling the situation for superabundance involving L * ∩ R * , and K-abundance as in [15]). We give a finite properly quasiequational axiomatisation of the resulting class of unary semigroups, which contains the variety of two-sided GI-semigroups.
To conclude this section, we give two tables that summarise some of the key information. In the first of them, immediately below, we show how to define D(s) and I (s) in the main motivating examples we discussed.
In the second table, we give the three ways of defining the two operations in generalised D-semigroups and left GI-semigroups respectively: order-theoretically, via generalised Green's relations, and via axioms. The first two ways are defined in terms of some distinguished set of idempotents E, where the order is ≤ l on E for D and ≤ r on E for I , and for the second we are assuming amiability with respect to the relevant generalised Green's relation determined by E.
finitely based variety finitely based proper quasivariety

The (E, F E )-abundance property
Throughout the remainder, suppose S is a semigroup, with E(S) its set of idempotent elements, and E some subset of E(S). A simple fact that will be useful from time to time is the following.

Lemma 3.1
For a semigroup S, if e ∈ E(S) and s ∈ S are such that es = e, then se ∈ E(S) and se ∼ r e.
As noted in the previous section, the most general formulation of the interior operation idea arises via consideration of certain generalised Green-like relations, and we consider these first.
The following is clear.

Proposition 3.3 If non-empty, fix(a) is a left ideal of S, and for T
It follows that (a, b) ∈ F if and only if fix(a) = fix(b), and that for E ⊆ E(S), The following is now clear.

Proposition 3.4 We have the inclusion F ⊆ F E for any E ⊆ E(S); hence for any G ⊆ E(S), if S is (G, F)-abundant, then it is (G, F E )-abundant.
We show in Example 3.10 below that the converse to the second part of the above is false even if E = G = E(S).
For a semigroup S, denote by S 0 the semigroup S with adjoined zero 0. Denote by T X the transformation semigroup on the non-empty set X . It was shown in [15] that T 0 X is F-abundant, and T X is G-abundant (whence so is T 0 X ). Hence by Proposition 3.4, they are F E(S) -abundant and G E(S) -abundant respectively. Note that both T X and T 0 X are regular; in the regular case, a converse of Proposition 3.4 holds.

Proposition 3.5 Suppose S is regular. Then S is F-abundant if and only if it is
Example 3.7 in [15] therefore furnishes an example of a regular (indeed inverse) semigroup which is not F E(S) -abundant, since it was shown there not to be F-abundant.
We have the folowing analog of Proposition 2.1 in [14].

Proposition 3.6
For e, f ⊆ E(S), the following are equivalent: then because e f = e, we obtain that

Corollary 3.7 If θ is either of F and F E , then each θ -class of S has at most one member of E if and only if E is right pre-reduced.
For each a ∈ S, denote by i(a) the (possibly empty) subset of E consisting of the elements of E in the F E -class of a ∈ S. By Proposition 3.6, these are precisely the elements equivalent under the quasiorder ≤ r . It follows that i(S) = {i(s) | s ∈ S, i(s) = ∅} is a partially ordered set, with i(x) ≤ i(y) if and only if e ≤ r f for any, hence every, e ∈ i(x), f ∈ i(y). This partially ordered set is easily seen to be isomorphic to E/∼ r , hence to E itself if E is right pre-reduced.

Proposition 3.8 For all x ∈ S,
Proof If (x, e) ∈ F E for x ∈ S and e ∈ E, then since ee = e, it must be that ex = e, So i(x) consists of the "largest left zeros" (with respect to ≤ r ) of x in E.
which (x, e) ∈ F, so for all a ∈ S, ax = a if and only if ae = a. But ee = e, so ex = e. But since (x, y) ∈ F E , this means ey = e as well. If ax = a then ae = a, so ay = aey = ae = a. Symmetry thus gives equivalence of ax = a with ay = a. So (x, y) ∈ F.

Example 3.10 An F E(S) -abundant semigroup which is not F-abundant.
Let T = {0, a, b, 1}, made into a semigroup as follows: (It will follow from Example 5.10 below that this is in fact a semigroup.) Now This then leads to correspondences between generalised D-semigroup structures definable on rings and generalised interior operations definable on them. However, our focus here is on the semigroup case, where the concepts differ.
Analogous to Green's relation H = L ∩ R and completely regular semigroups, in [15] we defined K = F ∩ G.
Of course, K-abundance is analogous to the notions of complete regularity, superabundance and U -superabundance, respectively defined using Green's relations L and R (with H = L∩R), the generalised Green's relations L * and R * (with H * = L * ∩R * as in [3]), and the still further generalised Green's relations [12] and then [9]). In contrast to completely regular semigroups, in which each H-class is a group, or superabundant semigroups, in which each H * -class is a cancellative semigroup of a special kind, the K-classes of a K-abundant semigroup are not even subsemigroups in general, as shown in Example 4.2 of [15].
From Proposition 3.6 and its dual, and the fact that for idempotents e, f , if e ∼ r f and e ∼ l f , then e = f , we have the following (the first part of which was noted in [15]).

Proposition 3.12 If S is a semigroup and E ⊆ E(S), then each K-class contains at most one idempotent and each K E -class contains at most one idempotent from E. Hence if S is (E, K)-abundant then E = E(S) and so it is K-amiable, and if it is
It was noted in Proposition 5.3 of [15] that if a semigroup is F-abundant, then it is both F-amiable and G-amiable if and only if F = G. This has the following variant.

Proposition 3.13 Suppose S is an F E(S) -abundant semigroup. Then S is F E(S)amiable and G E(S) -amiable if and only if F E(S) = G E(S) .
Proof The proof follows that of Proposition 5.3 in [15] (plus that of Lemma 5.2 and its dual in [15]) with few differences, but for completeness we present it afresh here.
then e ∼ r f and e ∼ l f by Proposition 3.6 and its dual, Conversely, suppose S is F E(S) -amiable and G E(S) -amiable. Pick e in E(S) and s ∈ S such that (s, e) ∈ F E(S) , and let f ∈ E(S) be such that (s, f ) ∈ G E(S) . Then es = e (since ee = e and (s, e) ∈ F E(S) ), so se ∈ E(S) and e ∼ r se by Lemma 3.1, and so by Proposition 3.6, se = e; dually, . By symmetry, they are equal.

Left GI-semigroups
Throughout, let S be a semigroup. If T is any unary operation on S, we denote by As indicated in the introduction, we make the following formal definition. In [15], F I -abundant left GI-semigroups were considered in the case where I (S) = E(S) and first-order axioms were given; see Proposition 5.8 there. (We note an error in the laws in that result: the law F(s)s = s should be F(s)s = F(s). The proof given there requires an equally small adjustment. There are similar corrections needed to the statement of Proposition 4.3 of [15] and its proof.) We generalise that here.
Clearly, if a left GI-semigroup is F I -abundant then it is F-abundant as a semigroup, and a central left GI-semigroup is also a right GI-semigroup under the same unary operation. The second part follows from Proposition 3.9.
The following is clear.

Proposition 4.3
For the semigroup S and E ⊆ E(S), the following are equivalent.

S is a left GI-semigroup with I
Similarly, the following are equivalent.

S is an F I -abundant left GI-semigroup with I (S) = E. 2. S is (E, F)-abundant and E is right pre-reduced. 3. S is (E, F)-abundant and E is maximal right pre-reduced in E(S).
One natural choice of right pre-reduced set of idempotents in a semigroup includes its set of central idempotents C(S) = {e ∈ E(S) | es = se for all s ∈ S}. In the case of an involuted semigroup, another natural choice is its set of projections (symmetric idempotents) E * (S) = {e ∈ E(S) | e * = e}; this is I (R) in a Rickart * -ring, as described in the introduction, and such cases are (E * (R), F)-abundant, so E * (R) is maximal right pre-reduced in E(R) by the above result. In both these cases ≤ r coincides with the natural order on E.
As previewed in Sect. 2, there is an order-theoretic characterisation of left GIsemigroups. Conversely, if S is a left GI-semigroup then for all x ∈ S, i(x) contains precisely one element e ∈ I (S), namely I (x), which has the given description by Proposition 3.8.
If e, f ∈ E and e f = e and f e = f then e ∼ r f , so by Proposition 3.6, (e, f ) ∈ F E , and so e = f . Hence E is right pre-reduced and so ≤ r is a partial order on E.
Of particular interest are cases in which the natural order on E may be used to define I , which is the original motivation for the study of such operations, discussed in Sect. 2. We have the following consequence of Proposition 4.4.

Corollary 4.6 Let S be a unary semigroup with unary operation I . Then S is a left interior semigroup if and only if it is a left GI-semigroup in which I (S) is right reduced.
Proof Suppose S is a left interior semigroup. Then for e, f ∈ I (S), suppose e = e f .
Hence e ≤ f , so e = f e. So I (S) is right reduced, and so ≤ r equals ≤ on I (S). It now follows from Proposition 4.4 that S is a left GI-semigroup.
Conversely, suppose S is a left GI-semigroup and I (S) is right reduced, so that ≤ r equals ≤ on I (S). By Proposition 4.4, I (s) is the unique largest e ∈ I (S) under ≤ r for which es = e, hence is the largest under ≤ with this property. Hence, S is a left interior semigroup.
From the above and Proposition 4.3, we now obtain the following.

S is a left interior semigroup with I (S) = E. 2. S is (E, F E )-abundant and E is right reduced.
A third way to view left GI-semigroups is via first order logic, in terms of equations and quasiequations.

All of the above classes of unary semigroups are proper quasivarieties.
Proof If S is a left GI-semigroup then the above laws all hold by Proposition 4.3. Conversely, assume the above laws hold. First note that because I (x)x = I (x), then by the second law, I (x)I (x) = I (x). So I (x) ∈ E(S) for all x ∈ S. The first two laws guarantee that I (x) is a largest element of I (S) under the quasiorder ≤ r for which ex = e, and the third ensures it is the unique largest, so S is a left GI-semigroup by Proposition 4.4.
The claim regarding the class of F I -abundant left GI-semigroups follows from the fact that the stated law expresses the fact that (y, I (y)) ∈ F for all y ∈ S, establishing (I (S), F)-abundance, the rest following from the fact that I (S) is right pre-reduced.
To show both classes are proper quasivarieties, consider the following semigroup: S = {a, e, f , g, 1} ⊆ T (X ), the full transformation semigroup on X , where X = {x, y, z} and It is easily checked that this is a subsemigroup of T (X ) with the following multiplication table: · a e g f 1 a 1 e g f a e g e g f e g e e g f g f f e g f f 1 a e g f 1

-abundant and so can be made into a left GI-semigroup with I (S) = E.
There is a congruence on S that respects I and which partitions S into {e, g} and the three singleton sets {a}, { f }, {1}. Representing the singleton sets using their only elements and writing e for {e, g} gives the following quotient. Note that E in the above example is right reduced, so S is a left interior semigroup.
The laws for F-amiable semigroups (viewed as left GI-semigroups) given in Proposition 5.8 of [15] (again noting the error there) are the above laws for F I -abundant semigroups, with the second law for left GI-semigroups removed since it follows from the additional law for the F I -abundant case, together with a further law that forces I (S) to be all of E(S), namely "  I (x)). Now apply the third law to give equality of I (y I (x)) and I (x I (y I (x))).
In fact the two equational laws obtained in Lemma 4.9 may be used to replace the third law for left GI-semigroups, leaving only one quasiequation.

Proposition 4.10 The laws for left GI-semigroups may be equivalently given as semigroups with unary operation I satisfying the following laws:
Proof By Lemma 4.9 the class of algebras satisfying the above four laws contains the class of left GI-semigroups. Conversely, consider a unary semigroup satisfying the given laws. Suppose I (x)I (y) = I (x) and I (y)I (x) = I (y). Then using the third law above, with x replaced by I (x) and y replaced by I (y) gives I (I (x)I (I (y)I (I (x)))) = I (I (y)I (I (x))), so using the second law above we obtain I (I (x)I (I (y)I (x))) = I (I (y)I (x)), and then using our assumption about x, y, we obtain I (I (x)I (I (y))) = I (I (y)), so I (I (x)I (y)) = I (y), and so I (I (x)) = I (y), so I (x) = I (y), so the third left GI-semigroup law holds.
There is an easy corollary to Proposition 4.10 and the final part of Proposition 4.8, applying to the F I -abundant case.

Corollary 4.11 The laws for F I -abundant left GI-semigroups may be equivalently given as semigroups with unary operation I satisfying the following laws:
Not all left GI-semigroups are F I -abundant.

Proposition 4.12 Suppose S is a semilattice which is a left GI-semigroup. Then it is F I -abundant if and only if I (x) = s for all s ∈ S.
Proof In a semilattice, ∼ r is the equality relation, so every element is in a distinct F-class by Proposition 3.6.
So any semilattice that is a left GI-semigroup in a non-trivial way (with I (s) = s for some s) cannot be F I -abundant. Examples arise from the subsets of a topological space, where I is the usual interior operator on subsets. Note also that every semilattice (indeed every band) is trivially F-abundant, showing that for a left GI-semigroup S, F-abundance of S as a semigroup is not sufficient to ensure its F I -abundance as a left GI-semigroup.
As noted earlier, a non-trivial example of a left GI-semigroup comes from the theory of partial function semigroups, where I (s) is the identity map on the subset {x ∈ dom(s) | xs = x}. Then the law st = s ⇒ s I (t) = s is easily seen to hold, so this example is F I -abundant. It was shown in [6] that the class of all such functional unary semigroups has no finite axiomatisation.
The case of associative rings whose multiplicative semigroups are interior semigroups in the earlier sense in which I (S) is a subsemigroup which is a semilattice was considered in [8]. A different approach is as follows. On any associative ring, one may define the so-called adjoint (or circle) operation • by setting a • b = a + b − ab for all a, b ∈ R. Then (R, •) is a semigroup. (This operation is due to Nathan Jacobson and was essential in his study of radicals of associative rings; see [7].) Note that the adjoint operation exchanges the closure and interior operations, so that in particular, (R, .) is a generalised D-semigroup if and only if (R, •) is a left GI-semigroup (and dually). Hence, the closure rings considered in [4] are nothing but associative rings equipped with a unary operation making the semigroup (R, •) (the opposite of) an interior semigroup in the above sense.
Bands are important types of semigroups, and for these we obtain an equational decription of left GI-semigroups.

Proposition 4.14 The class of all F I -abundant left GI-semigroups in which S is a band is a variety, in which the quasiequation in Corollary 4.11 and the band law x 2 = x may be replaced by the equation x I (x) = x.
Proof If the F I -abundant left GI-semigroup S is a band, then for all x ∈ S, because x 2 = x, we have x I (x) = x. Conversely, if S is a unary semigroup satisfying the equational laws in Proposition 4.10 together with x I (x) = x, then if x, y ∈ S are such that x y = x, we have x I (y) = x y I (y) = x y = x, and

Corollary 4.15 If S is a central F I -abundant left GI-semigroup which is a band, then S is a semilattice with I (s) = s for all s ∈ S.
Proof By Proposition 4.14, for all x ∈ S we have I (x) = I (x)x = x I (x) = x, and so S = I (S) is a semilattice.
Example 5.10 shows that in general, the class of central left GI-semigroups is not a variety, even in the F I -abundant case. However, in other respects they are wellbehaved at least in the F I -abundant case.

Meets in I(S)
The interior semigroups of [8] (more precisely, their left-sided duals) are defined to be unary semigroups given by the following equational laws: • I (x)I (x y) = I (x)I (y). In [8], it was shown that these are nothing but semigroups equipped with a subsemilattice E such that for all x ∈ S, I (x) is the largest e ∈ E for which ex = e, and then E = I (S). So these are certainly left GI-semigroups as well, and it is obvious that they may alternatively be described as left GI-semigroups such that for all x, y ∈ S, I (x)I (y) = I (y)I (x) = I (I (x)I (y)), since these extra laws ensure that I (S) not only commutes but is a semilattice.
In such an interior semigroup, e f is of course the meet, or greatest lower bound, of e, f ∈ I (S), with respect to the natural order (which in this case equals ≤ r ). However, in general left GI-semigroups, such meets need not exist at all: any right zero semigroup in which I (x) = x for all x gives a left GI-semigroup, as is easily checked; however, meets do not exist since ≤ r is just equality.
It was shown in Proposition 5.9 of [15] that in an F I -abundant left GI-semigroup S in which I (S) = E(S) is reduced (rather than just right reduced, as it must be), E(S) is a meet-semilattice under the natural order, with e ∧ f = I (e f ) for all e, f ∈ E(S).
In general, we have the following. Thus, F I -abundant left GI-semigroups in which I (S) = E(S) is reduced have large meets, by Proposition 5.9 in [15]. This carries over to left GI-semigroups in general, as we now show. (The proof is quite similar to that of Proposition 5.9 in [15] but we include it here for completeness.) The assumption that I (S) = E(S) in the above cannot be dropped, as we shall see later.

Proof
In general, those left GI-semigroups having large meets have a useful and relatively simple characterisation.

Corollary 5.5 Every left GI-semigroup in which I (S) commutes has large meets.
The converse of the above fails in general, as we see later. Next we note that the class of left GI-semigroups with large meets can be defined equationally.

Corollary 5.7 The class of left GI-semigroups in which I (S) commutes is a variety of unary algebras.
However, classes of F I -abundant left GI-semigroups in which even quite strong conditions are placed on I (S) are not so well-behaved.  {0, a, b, c} and {1}, so S is F-amiable, so can be viewed as an F I -abundant left GI-semigroup in which I (S) = E(S). In Example 3.9 in [15], the semigroup congruence θ on S was defined by setting (a, b) ∈ θ , with all other pairs of distinct elements unrelated, and is easily seen to respect I as well. But the quotient S = S/θ was observed in [15] to not even be F-abundant, so certainly the quotient left GI-semigroup structure on S cannot be F I -abundant.
So, in contrast to the class of all left GI-semigroups, the subclass of F I -abundant left GI-semigroups is a proper quasivariety. This example also shows that I (S) being a subsemilattice of S is not enough to ensure homomorphic closure of F I -abundant left GI-semigroups.

Example 5.9 A left GI-semigroup which is a semilattice but in which I (S) is not even a subsemigroup of S.
Consider the poset S = {e, f , a, 0}, in which 0 ≤ a ≤ e, f , a meet-semilattice with multiplication table as follows.  by setting (a, c) ∈ θ , with all other elements unrelated. This is easily checked to be a congruence respecting I , and (writing the congruence class {a, c} as a, and so on) S = S/θ has multiplication table as follows: 0 0 a a  b 0 a 1 b  1 0 a b 1 This is Example 3.10, which is not F-abundant, hence certainly cannot be F I -abundant as a left GI-semigroup.

Double GI-semigroups
A given semigroup may be both a left GI-semigroup and a right GI-semigroup in independent ways. However, sometimes the same set of idempotents is involved in both.

Definition 6.1 We say S is a double GI-semigroup (resp. double interior semigroup)
if it is a left GI-semigroup (resp. left interior semigroup) with unary operation I and a right GI-semigroup (resp. right interior semigroup) with unary operation J , and I (S) = J (S). We say it is FG I -abundant if it is F I -abundant as a left GI-semigroup and G I -abundant as a right GI-semigroup.
It is easy to write down laws that define the class of double GI-semigroups and double interior semigroups, using Proposition 4.8 and its dual, and adding the requirement that I (S) = J (S). Proposition 6.2 Let S be a semigroup. If S is a double GI-semigroup with respect to E ⊆ E(S), with associated unary operations I , J then the following laws are satisfied: In this case, I (S) = J (S) = E, which is pre-reduced (that is, ≤ r and ≤ l are partial orders).
Conversely, if S is a biunary semigroup satisfying the above laws, then it is a double GI-semigroup with respect to I (S) = J (S). The

The double GI-semigroup S is F G I -abundant if and only if it satisfies the laws
These laws can be re-phrased using Proposition 4.10, and then simplified somewhat, as follows: The laws for double GI-semigroups may be equivalently given as semigroups with unary operations I , J satisfying the following laws: Hence the laws for F G I -abundant double GI-semigroups may be given as the laws above with the third and sixth replaced respectively by Proof Mostly this follows from Proposition 4.10 and its dual. The redundancy of the law I (I (s)) = I (s) follows because we may argue using the above laws that for all s ∈ S, I (I (s)) = I (J (I (s))) = J (I (s)) = I (s); similarly for J (J (s)) = J (s).
We note that PT (X ) is an example of a double GI-semigroup, in which I (S) = J (S) consists of all restrictions of the identity function on X : define I ( f ) to be the identity map on the fix-set of f ∈ PT (X ), and define J ( f ) to be the restriction of I ( f ) to those x ∈ dom(I ( f )) whose inverse image set is just {x}. In this case I (S) is a semilattice and one may easily verify the claim that PT (X ) is a double GI-semigroup by verifying the order-theoretic characterisations of I , J in terms of the natural order on I (S).
If each of the one-sided structures associated with a double GI-semigroup has large meets, then the laws in Proposition 6.3 may be restated equationally, courtesy of Proposition 5.6. However, in general we have the following. A congruence on S that respects I and J is obtained by grouping {e, f , k, l} with all other elements kept separate. Just using e to stand for the four-element congruence class gives the following factor semigroup T . In this last proof, S cannot have large meets with respect to at least one of its onesided GI-semigroup structures, by the earlier comments, even though I (S) is evidently reduced, showing that the assumption that I (S) = E(S) is necessary in Proposition 5.3.

Two-sided GI-semigroups
In [15], it was shown that every (F, G)-amiable semigroup S (meaning one that is both F-amiable and G-amiable) is such that F = G, which therefore equals K, and so when viewed as an FG I -abundant double GI-semigroup in which I (S) = J (S) = E(S), the two induced unary operations are equal. This helps motivate the following. Definition 7.1 Let S be a double GI-semigroup (resp. double interior semigroup). We say it is a two-sided GI-semigroup (resp. two-sided interior semigroup) if I (s) = J (s) for all s ∈ S, and we say it is K -abundant if it is FG I -abundant as a double GIsemigroup.
Examples of two-sided GI-semigroups include any central left GI-semigroup, since we may simply define J (s) = I (s) for all s. Similarly, we have the following easy consequence of Proposition 3.13.

Corollary 7.2 Suppose S is a double GI-semigroup in which I (S) = E(S). Then it is a two-sided GI-semigroup.
Not all two-sided GI-semigroups have I (S) = E(S). For example, if S = {0, 1} with 0 a zero and 1 an identity element, then defining I (s) = 1 for all s ∈ S is easily seen to make the semilattice S into a two-sided GI-semigroup. Moreover, not every double GI-semigroup is a two-sided GI-semigroup, as the example of a double GI-semigroup given in the proof of Proposition 6.4 shows.
We noted earlier that every (F, G)-amiable semigroup can be viewed as a Kabundant two-sided GI-semigroup. But the converse is true also: for if S is a Kabundant two-sided GI-semigroup, then x 2 = x implies x I (x) = x, yet x I (x) = I (x), so x = I (x), and so I (S) = E(S), and so S is (F, G)-amiable.
In contrast to Proposition 6.4 and the properties of the example given in its proof (it was not left reduced), for two-sided GI-semigroups we have the following. proving the final law above. Arguing dually, we see that S is also a right GI-semigroup with large meets with respect to I , and so is right reduced by the dual of Proposition 5.6. Hence I (S) is reduced, so both ≤ l and ≤ r are the natural order.
Conversely, assume the given laws hold for S. Then for all e ∈ I (S) and y ∈ S, I (ey)e = I (ye)e = I (ye)yee = I (ye)ye = I (ye) = I (ey), and so I (I (ey)e)I (y) = I (I (ey))I (y) = I (ey)I (y). So by Proposition 5.6, S is a left GI-semigroup with respect to I . Indeed, we may evidently dualise this entire argument to obtain that S is a right GI-semigroup with respect to I providing only that the law I (x)I (x I (y)) = I (x I (y)), dual to the final law in the theorem statement, holds. But we have that as required. So S is a two-sided GI-semigroup with respect to I . It follows that the class of two-sided GI-semigroups is a subvariety (of unary semigroups) of the class of left GI-semigroups with large meets.
There is an order-theoretic characterisation of two-sided GI-semigroups, following from Corollary 4.6 and its dual, that relates to the discussion of generalised interior operations given in Sect. 2.

Corollary 7.4 Suppose S is a semigroup with E ⊆ E(S) such that for all s ∈ S, there
is I (s) ∈ E such that I (s) is both the largest e ∈ E under the natural order such that es = e and the largest e ∈ E under the natural order such that se = e. Then S is a two-sided GI-semigroup with respect to I , and I (S) = E. Moreover, every two-sided GI-semigroup arises in this way.
If S is a two-sided GI-semigroup, although I (S) must be reduced, stronger properties need not hold. ∈ E(S). This example also shows that the converse of Corollary 5.5 fails, even under additional assumptions: by Theorem 7.3, the above example has large meets (with respect to any of ≤ r , ≤ l and ≤, which are all equal) and I (S) is reduced, but I (S) does not commute (as e f = f e).
By contrast, Example 5.8, which is commutative, can be viewed as a K-abundant two-sided GI-semigroup; this shows that the class of K-abundant two-sided GIsemigroups is not a variety (even when I (S) is a semilattice), in contrast to the larger class of two-sided GI-semigroups.

Digression: K E -semigroups
As noted in Proposition 3.12, for a K-abundant (respectively, an (E, K E )-abundant) semigroup, amiability is automatic; for s ∈ S, define K (s) to be the unique e ∈ E(S) (respectively, e ∈ E) for which (s, e) ∈ K (respectively, (s, e) ∈ K E ). In particular, no special assumptions are required regarding K (S): it need be neither left nor right pre-reduced in general, so we do not expect to obtain left or right GI-semigroups. Definition 8. 1 We say the unary semigroup S with unary operation K is a K Esemigroup (resp. a K -semigroup) if S is (E, K E )-abundant (resp. K-abundant) and K is defined as above.
It follows immediately that if one defines a K E -semigroup from an (E, K E )abundant semigroup S, then K (S) = E.
A two-sided GI-semigroup is nothing but a semigroup which is both (E, F E )amiable and (E, G E )-amiable and such that F E = G E , so it is trivially also (E, K E )amiable as well. This means that the two-sided GI-semigroups just studied form a subclass of K E -semigroups.
In fact laws for K -semigroups are given in Proposition 4.3 of [15] (again note the error in the first law given there). These laws are: 2. x y = x implies x K (y) = x; and 3. yx = x implies K (y)x = x.
A simple example was given in [15] to show that these laws are properly quasiequational. In the same way, we obtain the following.

Theorem 8.2
The class of K E -semigroups is a proper quasivariety given by the following laws.
Proof Suppose S is an (E, K E )-abundant semigroup with K defined as above. The argument that the above laws all hold is very similar to the proof of the corresponding direction of Proposition 4.8: they essentially state that (x, K (x)) ∈ F E and (x, K (x)) ∈ G E , that is, (x, K (x)) ∈ K E for all x ∈ S (noting only that E = {K (s) | s ∈ S}).
Conversely, assume the above laws hold. Since K (x)x = K (x), then by the second law, K (x)K (x) = K (x), so K (x) ∈ E(S) for all x ∈ S. Let E = {K (s) | s ∈ S}; then once again, the above laws simply spell out that S is (E, K E )-abundant.
Consider the left GI-semigroup S as in the proof of Theorem 4.8. We saw there that F E partitions S as follows: {a, f }, {e}, {g}, {1}. On the other hand, lfix E (a) = {e, g, f } = lfix E (e) = lfix E (g) = lfix E ( f ), while lfix E (1) = E, and so G E partitions S as follows: {a, e, g, f }, {1}. So F E ⊆ G E and so K E = F E , so we have K Eabundance and so the left GI-semigroup structure is also a K E -semigroup structure. Using the same congruence as used previously, the resulting quotient structure does not satisfy the second law in Proposition 8.2. So the quasivariety of K E -semigroups is proper.
We have the following easy consequence of Proposition 3.9 and its dual.