Semigroups for which every right congruence of finite index is finitely generated

We call a semigroup $S$ f-noetherian if every right congruence of finite index on $S$ is finitely generated. We prove that every finitely generated semigroup is f-noetherian, and investigate whether the properties of being f-noetherian and being finitely generated coincide for various semigroup classes.


Introduction
A finiteness condition for a class of universal algebras is a property that is satisfied by at least all finite members of that class. The study of algebras via their finiteness conditions has been of significant importance in understanding the structure and behaviour of various kinds of algebraic structures. In recent decades there has been a considerable amount of interest in finiteness conditions on semigroups concerning their lattices of one-sided congruences. One-sided congruences play a key role in the theory of monoid acts (or, equivalently, representations of monoids by transformations of sets). Indeed, the cyclic right (resp. left) acts of a monoid M correspond to the right (resp. left) congruences on M. This means that finiteness conditions on monoids relating to their actions usually have equivalent formulations in terms of one-sided congruences; for example, the notions of coherency [4] and being noetherian [19].
Recently, in [5], Dandan, Gould, Quinn-Gregson and Zenab considered the property that the universal right congruence on a semigroup is finitely generated; we refer to such semigroups as finitely connected (see Remark 2.4 for the motivation behind using this term). Semigroups for which every right congruence is finitely generated, called right noetherian semigroups, have received a fair amount of attention (see [10,13,14,18]). Both of these properties have an interesting relationship to finite generation. It was proved in [5] that every finitely generated semigroup is finitely connected. The authors also prove there that finitely connected completely simple semigroups are finitely generated [5,Cor. 3.6]. However, an important strand of that paper is demostrating that, for general semigroups, the property of being finitely connected is substantially weaker than being finitely generated. For example, every monoid with a zero is finitely connected [5,Corollary 2.15].
The situation is rather different for the property of being right noetherian. It is easy to find finitely generated semigroups that are not right noetherian; e.g. the free monoid on two generators. It is well known that a commutative semigroup is (right) noetherian if and only if it is finitely generated. An intriguing open problem is whether every right noetherian semigroup S is finitely generated. This question was originally asked by Hotzel in [10], and has been considered in several subsequent papers [1,14,18]. It has been answered in the affirmative in the following cases: if S is weakly periodic (which inludes semisimple, and hence regular, semigroups) [10,Theorem 3.2]; if every J -class of S is a class of some congruence on S [10, Theorem 3.3]; if S is also left noetherian [14,Theorem 5].
In this paper we consider the property that every right congruence of finite index on a semigroup is finitely generated, which we call being f-noetherian. We will focus on its relationship with finite generation. Our condition of being fnoetherian is clearly 'between' the properties of being finitely connected and being right noetherian: right noetherian semigroups are f-noetherian, and f-noetherian semigroups are finitely connected. It will be shown that every finitely generated semigroup is f-noetherian. The main purpose of the article is to investigate, for various semigroup classes, whether the property of being f-noetherian coincides with finite generation, and to see how the situation differs for each of the properties of being finitely connected and being right noetherian. Specifically, we consider the following classes of semigroups: inverse, completely regular, idempotent, commutative, cancellative, nilpotent, archimedean, complete, (0-)simple and completely (0-)simple. Our findings are summarised in Table 1. Particularly noteworthy results are obtained regarding commutative semigroups. In particular, we exhibit two examples of f-noetherian commutative semigroups that are not finitely generated, one of which is cancellative, idempotent-free and countable, and the other uncountable. Furthermore, we prove that being countable is a necessary condition for a cancellative commutative semigroup to be f-noetherian.
The paper is structured as follows. In Section 2 we introduce the foundational material required for the rest of the paper. This section is divided into two subsections. In the first of these we make some basic definitions and observations, and provide alternative formulations of the property of being f-noetherian for groups and monoids. In the second subsection we establish some useful algebraic properties of f-noetherian semigroups. In Section 3 we prove that certain infinite transformation semigroups are f-noetherian. We then turn to the main theme of the paper in Section 4. Here we prove that every finitely generated semigroup is f-noetherian. In Sections 5-7 we investigate whether the converse holds for semigroups within various 'standard' classes. Section 5 is concerned with completely regular semigroups, Section 6 is devoted to commutative semigroups, and simple and 0-simple semigroups are considered in Section 7. Finally, in Section 8, we pose some open problems and directions for future research. The index of an equivalence relation ρ is the cardinality of the set of equivalence classes of ρ. We call a semigroup S f-noetherian if every right congruence of finite index on S is finitely generated. Now, let S be a semigroup and let X ⊆ S × S. We introduce the notation For a, b ∈ S, an X-sequence connecting a and b is any sequence where (x i , y i ) ∈ X and s i ∈ S 1 for 1 ≤ i ≤ k.
We now make the following definition.
Definition 2.1. Let S be a semigroup, let X ⊆ S × S, and let s, t ∈ S. We say that (s, t) is a consequence of X if either s = t or there exists an X-sequence connecting s and t.
We have the following basic lemma. It is obvious that every f-noetherian semigroup is finitely connected. In fact, the existence of any finitely generated right congruence of finite index implies that the universal right congruence is finitely generated.
Lemma 2.5. Let S be a semigroup, and let ρ and σ be two right congruences of finite index on S with ρ ⊆ σ. If ρ is finitely generated, then so is σ.
Proof. Let C i , i ∈ I, be the ρ-classes, and let X be a finite generating set for ρ. For each i ∈ I, fix α i ∈ C i , and define a set We claim that σ is generated by X ∪ H. Indeed, let a σ b with a = b. There exist i, j ∈ I such that a ∈ C i and b ∈ C j . Since a ρ α i and b ρ α j , we have that (a, α i ) and (b, α j ) are consequences of X. Now, either i = j or (α i , α j ) ∈ H, so (a, b) is a consequence of X ∪ H. Corollary 2.6. Let S be a semigroup. If there exists a right congruence of finite index on S which is finitely generated, then S is finitely connected.
For a group G, there is an isomorphism between the lattice of right congruences on G and the lattice of subgroups of G. In particular, right congruences of finite index correspond to subgroups of finite index. It is well known that in a finitely generated group G, every subgroup of G of finite index is also finitely generated, so we have the following fact.
Lemma 2.7. The following are equivalent for a group G: (1) G is f-noetherian; (2) G is finitely connected; (3) G is finitely generated.
Remark 2.8. For groups, being right noetherian is equivalent to every subgroup being finitely generated [18,Prop. 2.14]. There exist finitely generated groups that are not right noetherian; for example, the free group on two generators.
For a monoid M, there is a one-to-one correspondence between the set of right congruences on M and the set of cyclic M-acts. In the following, we provide some basic definitions about monoid acts; see [12] for more information.
Let M be a monoid. A (right) M-act is a non-empty set A together with a map such that a(mn) = (am)n and a1 = a for all a ∈ A and m, n ∈ M. For instance, M itself is an M-act via right multiplication. An equivalence relation ρ on an M-act A is an (M-act) congruence on A if (a, b) ∈ ρ implies (am, bm) ∈ ρ for all a, b ∈ A and m ∈ M. Note that the congruences on the M-act M are precisely the right congruences on M.
An M-act A is finitely generated if there exists a finite subset X ⊆ A such that A = XS 1 , and A is finitely presented if it is isomorphic to a quotient of a finitely generated free M-act by a finitely generated congruence. One may consult [12, Section 1.5] for further details. A more systematic study of finite presentability of monoid acts was developed in [16,17].
The following result characterises f-noetherian monoids in terms of their acts. Since M is f-noetherian, the right congruence ρ is finitely generated, so A is finitely presented.
(2) ⇒ (3). We prove by induction on the number of elements. The trivial M-act {0} is finitely presented by assumption. Now assume that every M-act with at most n elements is finitely presented, and let A be an M-act with n+1 elements. If A is the disjoint union of n + 1 copies of the trivial act, then A is finitely presented by [17,Corollary 5.9]. Suppose then that A contains a non-zero element a, and consider the subact B = a of A. Since B is cyclic, it is finitely presented by assumption. The Rees quotient A/B is the set (A\B) ∪ {0} with action given by and 0 · m = 0 for all a ∈ A\B and m ∈ M. The number of elements in A/B is |A| − |B| + 1 = (n + 2) − |B| ≤ (n + 2) − 2 = n, so A/B is finitely presented by the inductive hypothesis. Since B and A/B are finitely presented, it follows from [17,Corollary 4.4] that A is finitely presented.
(3) ⇒ (1). For any right congruence ρ of finite index on M, we have that the finite cyclic M-act A = M/ρ is finitely presented, so ρ is finitely generated by [17,Proposition 3.9].
Remark 2.10. It was observed in [5, Proposition 3.1] that a monoid M being finitely connected is equivalent to the trivial M-act being finitely presented.

Algebraic properties.
In the following we establish various algebraic properties of f-noetherian semigroups that will be useful in the remainder of the paper.
The following result shows that the property of being f-noetherian is closed under homomorphic images (or equivalently quotients).

Lemma 2.11. Let S be a semigroup and let T be a homomorphic image of
Proof. Let ρ be a right congruence of finite index on T . Let θ : S → T be a surjective homomorphism, and define a right congruence ρ ′ on S by s ρ ′ t ⇐⇒ sθ ρ tθ.
Clearly ρ ′ has findex index. Since S is f-noetherian, ρ ′ is generated by a finite set X. We claim that ρ is generated by the finite set Indeed, let a ρ b with a = b. There exist s, t ∈ S such that a = sθ and b = tθ. Since s ρ ′ t and s = t, there exists an X-sequence connecting s and t. Applying θ to every term of this sequence yields a Y -sequence connecting a and b.
Remark 2.12. Analogues of Lemma 2.11 for the properties of being finitely connected and being right noetherian are proved by essentially the same argument.
The next result states that semigroups and their subsemigroups of finite complement behave in the same way with regard to being f-noetherian.
Proof. The proof of this result is essentially identical to the prove of the corresponding result for right noetherian semigroups; see [18,Theorem 3.2].
16. An analogue of Proposition 2.13 holds for the property of being right noetherian. However, it does not hold for the property of being finitely connected. Indeed, adjoining a zero to any monoid yields a finitely connected monoid.
The next situation we consider is where the complement of a subsemigroup is an ideal.
Since S is f-noetherian, we have that the Rees quotient S/I = T ∪ {0} is f-noetherian, and hence T is f-noetherian by Corollary 2.15.
Ideals of f-noetherian semigroups are not in general f-noetherian; see Example 5.5, for instance. Monoid ideals, however, do inherit the property of being fnoetherian.
Lemma 2.18. Let S be a semigroup with an ideal I that has an identity e. If S is f-noetherian, then so is I.
Proof. Let ρ be a right congruence of finite index on I. We define a right congruence ρ ′ on S by s ρ ′ t ⇐⇒ es ρ et. Since ρ partitions I into finitely many classes and es ∈ I for all s ∈ S, therefore ρ ′ has finite index. Since S is f-noetherian, ρ ′ is generated by a finite set X. We claim that ρ is generated by the finite set Indeed, let a ρ b with a = b. We have that ea = a ρ b = eb, so a ρ ′ b. Therefore, there exists an X-sequence a = x 1 s 1 , y 1 s 1 = x 2 s 2 , . . . , y k s k = b.
We now have a Y -sequence a = (ex 1 )(s 1 e), (ey 1 )(s 1 e) = (ex 2 )(s 2 e), . . . , (ey k )(s k e) = b, Remark 2.19. Analogues of Lemma 2.18 hold for the properties of being finitely connected and being right noetherian, and the proofs are essentially the same.
It is well known that maximal subgroups of semigroups coincide with the group H-classes. Schützenberger showed in [21] how one can assign a group to an arbitrary H-class, and we now briefly describe his construction; one may consult [15] for more details and basic properties of Schützenberger groups.
Let S be a semigroup and let H be an H-class of S. Proof. Let ρ be the right congruence of finite index on S 1 given by Now S 1 is f-noetherian by Corollary 2.14, so ρ is generated by a finite set X.
Since H = Hs = (Hx 1 )s 1 , we have that Hx 1 ⊆ R. Therefore, we have that so Hx 2 ⊆ R. Continuing in this way, we have that Hx i ⊆ R for all i ∈ {1, . . . , k}. Let α i = α(x i , y i ), and choose β i ∈ S such that hα i = β i h. We now have that Therefore, we have that s σ α 1 . . . α k , and hence as required.
Corollary 2.21. Let S be a semigroup with a maximal subgroup G whose R-class is a finite union of H-classes. If S is f-noetherian, then G is finitely generated.
Maximal subgroups of f-noetherian semigroups are not in general finitely generated. For example, the full transformation semigroup T X on an infinite set X is f-noetherian by Proposition 3.3, but its maximal subgroup S X is not finitely generated.
It is an open problem whether the direct product of two right noetherian monoids is right noetherian [18,Open Problem 4.8]. On the other hand, it was shown in [5,Proposition 4.2] that the property of being finitely connected is preserved under direct products of monoids. We now state and prove the analogue of this result for the property of being f-noetherian. Proof. The direct implication follows from Lemma 2.11, so we just need to prove the converse.
Let ρ be a right congruence of finite index on M × N, and let C i , i ∈ I, be its classes. For each m ∈ M, we define a right congruence ρ N m on N by . In a similar way we define a right congruence ρ M n on M for each n ∈ N. Clearly ρ N m and ρ M n have finite index for every m ∈ M and n ∈ N. Let D j , j ∈ J, be the Since M and N are f-noetherian, we have that ρ N 1 M is generated by some finite set X, and each ρ M j = ρ M d j is generated by some finite set X j . We define a set and, for each j ∈ J, we let We claim that ρ is generated by the finite set Therefore, there exists an X-sequence connecting u and d j , and hence there clearly exists a Ysequence connecting (1 M , u) and (1 M , d j ). Multiplying every term of this latter sequence on the right by (m, 1 N ), we have a Y -sequence connecting (m, u) and , so m ρ j α i,j . Therefore, by a similar argument as above, there exists a Y j -sequence connecting (m, d j ) and Remark 2.24. The direct product of two f-noetherian semigroups is not necessarily f-noetherian. Indeed, it was shown in [5,Example 4.3] that N × N is not finitely connected.

Transformation semigroups
In this section we prove that certain infinite transformation semigroups are fnoetherian. The notion of the diagonal act of a semigroup will turn out to be useful. For any semigroup S and n ∈ N, the Cartesian product of n copies of S can be made into an S-act by defining (x 1 , . . . , x n )s = (x 1 s, . . . , x n s) for all x 1 , . . . , x n , s ∈ S. If n = 2, we call it the diagonal S-act, and for n ≥ 3 we refer to it as the n-diagonal S-act and denote it by S (n) .
It is easy to see that any set that generates the diagonal S-act is also a generating set for the universal right congruence on S. Gallagher showed in [7] that infinite semigroups from various 'standard' semigroup classes, such as commutative, inverse, idempotent, cancellative, completely regular and completely simple, do not have finitely generated diagonal acts. However, it was proved in [8] that the diagonal act is cyclic for various transformation semigroups on an infinite set.  Table 1] Let X be an infinite set, and let S be any of the following transformation semigroups on X: • B X (the monoid of binary relations); • T X (the full transformation monoid); • P X (the monoid of partial transformations); • F X (the monoid of full finite-to-one transformations).
Then the diagonal S-act is cyclic.
We show that a semigroup S whose diagonal act is cyclic is f-noetherian. In order to prove this, we require the following result of Gallagher. (1) The subsemigroup generated by a and b is free of rank two.
(2) For each n ∈ N, if we list the elements of {a, b} n (the set of words of length n over {a, b}) as w 1 , . . . , w 2 n , then S (2 n ) = (w 1 , . . . , w 2 n )S. Proof. If S is trivial, then it is obviously f-noetherian, so assume that S is nontrivial. Since the diagonal S-act is cyclic, there exist a, b ∈ S such that S × S = (a, b)S, and hence (a, b) generates the universal right congruence on S. We claim that the universal right congruence is the only right congruence of finite index on S. So, let ρ be a right congruence of index n on S. List the elements of {a, b} n , which are distinct by Proposition 3.2(1), as w 1 , . . . , w 2 n . By the Pigeonhole Principle, there exist i, j ∈ {1, . . . , 2 n } with i = j such that w i ρ w j . We have that S (2 n ) = (w 1 , . . . , w 2 n )S by Proposition 3.2 (2). It follows that S × S = (w i , w j )S, and hence ρ is the universal right congruence.
The symmetric inverse monoid I X on an infinite set X does not have a finitely generated diagonal act [8,Theorem 2.5]. However, it is f-noetherian: Proposition 3.4. Let X be an infinite set. Then the symmetric inverse monoid I X is f-noetherian.
Proof. Letting 1 and 0 denote the identity and zero of I X respectively, we have that the universal right congruence on I X is generated by the pair (1, 0). We claim that this is the only right congruence of finite index on I X . So, let ρ be a right congruence of index n on I X . Partition X as X = n+1 i=1 X i , where the X i are disjoint subsets of X, each with the same cardinality as X, and define bijections α i : X → X i . By the Pigeonhole Principle, there exist i, j ∈ {1, . . . , n + 1} with i = j such that α i ρ α j . But then we have that Remark 3.5. Let X be an infinite set. The semilattice of idempotents of I X is isomorphic to the semigroup P (X) of all subsets of X under intersection. It is finitely connected since it is a monoid with a zero. However, it is not f-noetherian. Indeed, the subsemigroup P (X) \ {X} has the infinite set of maximal elements {X \{x} : x ∈ X}, so it is not finitely connected by [5,Corollary 5.7], and hence not f-noetherian. It follows from Theorem 2.13 that P (X) is not f-noetherian.
Remark 3.6. The symmetric group S X on an infinite set X is not f-noetherian by Lemma 2.7, since it is not finitely generated.
For a set X, we denote the semigroups of full surjective transformations and full injective transformations on X by Surj X and Inj X respectively. Proposition 3.7. Let X be an infinite set. Then the semigroups Surj X and Inj X are not f-noetherian.
Proof. We note that S X is a subsemigroup of both Surj X and Inj X . It was shown in the proofs of [6, Theorems 4.4.2 and 4.4.4] that Surj X \S X is an ideal of Surj X and Inj X \S X is an ideal of Inj X . Therefore, since S X is not f-noetherian, we have that Surj X and Inj X are not f-noetherian by Lemma 2.17.

Finite generation
We now turn to the main theme of the paper, which is to investigate the relationship between the properties of being f-noetherian and being finitely generated. We have already seen in the previous section that there exist f-noetherian semigroups that are non-finitely generated (indeed, uncountable). In this section we show that the class of finitely generated semigroups is strictly contained within the class of f-noetherian semigroups. We also prove that the properties coincide for semigroups with finitely many L-classes. Proof. Let X be a finite generating set for S, and let ρ be a right congruence of finite index on S with classes C i , i ∈ I. For each i ∈ I, fix α i ∈ C i . We claim that ρ is generated by the finite set Indeed, let s ρ t with s = t. We have that s = x 1 . . . x n for some x i ∈ X. Let x 1 ∈ C i 1 and, for each j ∈ {1, . . . , n − 1}, let C i j x j+1 ⊆ C i j+1 and u j = x j+1 . . . x n . We then have the following H-sequence connecting s and α in : Similarly, there exists i ∈ I such that (t, α i ) is a consequence of H. Since s ρ t, we have that i n = i, so (s, t) is a consequence of H.
In the case that a semigroup has finitely many L-classes, the converse of Proposition 4.1 holds.

Proposition 4.2. Let S be a semigroup with finitely many L-classes. If S is f-noetherian, then it is finitely generated.
Proof. Recall that L is a right congruence on S. Since S is f-noetherian, we have that L = X for some finite set X ⊆ L. For each (x, y) ∈ X, choose α(x, y) ∈ S such that x = α(x, y)y. Let L i , i ∈ I, be the L-classes of S, and for each i ∈ I fix b i ∈ L i . We claim that S is generated by the finite set Indeed, if s ∈ S, then s ∈ L i for some i ∈ I. Let b = b i . If s = b, then s ∈ A, so assume that s = b. Since s L b, there exists an X-sequence where (x i , y i ) ∈ X and s i ∈ S 1 for 1 ≤ i ≤ k. Letting α i = α(x i , y i ) for 1 ≤ i ≤ k, we have that s = (α 1 y 1 )s 1 = α 1 (y 1 s 1 ) = α 1 (x 2 s 2 ) = · · · = α 1 . . . α k (y k s k ) = α 1 . . . α k b ∈ A , as required.

Remark 4.3.
In a left simple semigroup S, Green's L-relation coincides with the universal relation. Therefore, if S is finitely connected, then the same argument as the one in the proof of Proposition 4.2 shows that S is finitely generated.
Being f-noetherian does not imply finite generation under the weaker condition that a semigroup has finitely many D-classes. We demostrate this by providing an example of a 0-bisimple inverse monoid that is f-noetherian but not finitely generated.
Example 4.4. Let X be an infinite set, and let M be the monoid with zero defined by the presentation The monoid M is called the polycyclic monoid on X, and is easily seen to be 0bisimple and inverse. The universal right congruence on M is generated by the pair (1, 0). We claim that this is the only right congruence of finite index on M. Indeed, if ρ is a right congruence of finite index on M, there exist distinct x, y ∈ X with x ρ y. But then we have that 0) is the universal congruence.

Completely regular semigroups
In this section we consider completely regular semigroups. A completely regular semigroup is a semigroup which is a union of groups.
We shall make use of the following construction. Let Y be a semilattice and let (S α ) α∈Y be a family of disjoint semigroups, indexed by Y, such that S = α∈Y S α is a semigroup. If S α S β ⊆ S αβ for all α, β ∈ Y, then S is called a semilattice of semigroups, and we denote it by S = S(Y, S α ).
We have the following structure theorem for completely regular semigroups. The following necessary and sufficient conditions for a semilattice to be finitely connected were provided in [5]. We now prove that f-noetherian semilattices are finite.
Proof. Suppose for a contradiction that Y is infinite, and let Y = Y 1 . By Proposition 5.2, there exists a finite set Notice that Z 11 ⊂ Z 12 . Continue this procedure until we obtain sets Z 1 = Z 1n 1 and We have that Y 2 is f-noetherian by Proposition 2.13, so there exists a finite set X 2 ⊆ Y 2 such that Y 2 = X 2 Y 1 2 by Proposition 5.2. There exists x ∈ X 2 such that (xe 1 )Y 1 is infinite; choose x 21 ∈ X 2 with this property, and let In a similar way as above we construct sets X ′ 2 = {x 21 , . . . , x 2n 2 } and Z 2 = X 2 \X ′ 2 such that, letting e 2 = e 1 x 21 . . . x 2n 2 , we have e 2 Y 1 is infinite and (e 2 z)Y 1 is finite for all z ∈ Z 1 ∪ Z 2 .
Continuing this process ad infinitum, we obtain semilattices and, for each k ∈ N, we have the following: . . x kn k } and Z k = X k \x ′ k ; • an element e k = e 1 . . . e k−1 x k1 . . . x kn k such that e k Y 1 is infinite and (e k z)Y 1 is finite for every z ∈ k i=1 Z k . Now let U be the subsemilattice of Y generated by the set ∞ i=1 X ′ i . We claim that the complement Y \U is the ideal I = {g ∈ Y : g u for any u ∈ U}.
Clearly I ⊆ Y \U. Now let e ∈ Y \U, and suppose that e ∈ I, so e ≥ u for some u ∈ U. We then have that e ∈ Z j and u ∈ k i=1 X ′ i for some j, k ∈ N. Letting n = max(j, k), we have e ≥ ue j e k = e n . But then we have that e n Y 1 = (e n e)Y 1 is finite, which is a contradiction, so e ∈ I and Y \U = I.
It now follows from Lemma 2.17 that U is f-noetherian. However, U does not contain a zero, contradicting Proposition 5.2, and hence Y is finite.
Since the semilattice Y is a homomorphic image of S = S(Y, S α ), Lemma 2.11 and Proposition 5.3 together yield the following corollary. The following example shows that for a completely regular semigroup to be f-noetherian, it is not required that every completely simple semigroup in its semilattice decomposition be f-noetherian.
Example 5.5. Let S be the semigroup defined by the presentation a, b, c | ab = ba = 1, ac = c 2 = c .
We have that S is a semilattice of two semigroups S α = a, b ∼ = Z and S β = {ca i , cb i : i ∈ N} where α > β. Now S is f-noetherian since it is finitely generated. However, S β is an infinite right zero semigroup, and hence not finitely connected by [5,Corollary 3.6].
Green's relation H is not in general a congruence on a completely regular semigroup. A completely regular semigroup for which H is a congruence is called a cryptogroup. Examples of cryptogroups include completely simple semigroups, Clifford semigroups and bands. We shall show that every f-noetherian cryptogroup is finitely generated. We first prove the following technical lemma.
Lemma 5.6. Let S = S(Y, S α ) be a semilattice of semigroups, and suppose that S has a congruence ρ ⊆ L with the following property: for each α ∈ Y, if the semigroup S α /ρ α (where ρ α = ρ| Sα ) is f-noetherian, then it is finite. If S is fnoetherian, then it is finitely generated.
Proof. The semilattice Y is finite by Corollary 5.4. Let T = S/ρ. Then T is a semilattice S(Y, T α ), where T α = S α /ρ α , and T is f-noetherian by Lemma 2.11. We prove that T is finite by induction on the order of Y. If |Y | = 1, then T is finite by assumption. Suppose that |Y | > 1, and choose a maximal element β ∈ Y. We have that T β is f-noetherian by Lemma 2.17, and hence finite by assumption. Therefore, by Theorem 2.13, we have that T \T β = S(Y \{β}, T α ) is f-noetherian. By induction we have that T \T β is finite, and hence T is finite.
It now follows that S has finitely many L-classes, and is hence finitely generated by Proposition 4.2.
Theorem 5.7. Let S be a cryptogroup. If S is f-noetherian, then it is finitely generated.
Proof. We have that S is a semilattice S(Y, S α ) of completely simple semigroups by Theorem 5.1. For each α ∈ Y, the quotient S α /H α is a rectangular band. By [5,Corollary 6.4], any finitely connected rectangular band is finite. Hence, we have that S is finitely generated by Lemma 5.6.

Commutative semigroups
For commutative semigroups, being (right) noetherian is equivalent to being finitely generated. Finitely connected commutative semigroups, however, are not necessarily finitely generated. Indeed, in Section 5 we saw that there exist infinite finitely connected semilattices. In this section we investigate how the properties of being f-noetherian and being finitely generated relate to one another for commutative semigroups. We begin by presenting an example of a cancellative idempotent-free commutative semigroup that is f-noetherian but not finitely generated. Letting b i represent the generator (0, i), i ∈ Z, the semigroup S is defined by the presentation It is easy to see that S is commutative, cancellative, idempotent-free and not finitely generated. We now show that S is f-noetherian. Let ρ be a congruence of finite index on S. We have that ρ| A is generated by some pair (a s , a t ) with s < t; let r = t − s. Now choose m 0 , n 0 ∈ N 0 with n 0 > m 0 such that (n 0 , 0) ρ (m 0 , z) for some z ∈ Z. We let X = {(a s , a t )} ∪ { (n 0 , 0), (m 0 , z) }, and let U denote the finite set We show that ρ is generated by the set Y = X ∪ ρ ∩ (U × U) . We first make the following claim.
(2) For each n ∈ N 0 and i ∈ Z, there exists some 0 ≤ q < r such that (n, i), (n, q) is a consequence of (a s , a t ). Proof.
(1) We have the sequence (2) We have that i = pr +q for some p ∈ Z and 0 ≤ q < r. Now the pair (a s , a s+|p|r ) is a consequence of (a s , a t ). Therefore, if p ≥ 0, we obtain (n, q) = a s+pr (n, i + s) from (n, i) = a s (n, i + s), and if p < 0, we obtain (n, q) = a s (n, i + (s − pr)) from (n, i) = a s−pr (n, i + (s − pr)).
Now let s ρ t with s = t. If s ∈ A, then there exists i ∈ {s, . . . , t − 1} such that (s, a i ) is a consequence of (a s , a t ). If s = (n, i) ∈ B, then it follows from (1) of the above claim that there exist some m 0 ≤ k < n 0 and p ∈ Z such that (n, i), (k, p) is a consequence of (n 0 , 0), (m 0 , z) , and by (2) there exists some 0 ≤ q < r such that (k, i), (k, q) is a consequence of (a s , a t ). Therefore, in either case, there exists some u ∈ U such that (s, u) is a consequence of X. Similarly, there exists v ∈ U such that (t, v) is a consequence of X. Since (u, v) ∈ ρ ∩ (U × U), we have that (s, t) is a consequence of Y, as required.
Definition 6.2. An archimedean semigroup is a commutative semigroup S in which, for each a, b ∈ S, there exists n > 0 such that a n ≤ b.
We have the following structure theorem for commutative semigroups. Below we provide a characterisation of archimedean semigroups that have an idempotent. In general, archimedean semigroups can have a rather complex structure. We refer the reader to [9, Chapter IV] for more information.

3] A commutative semigroup S is archimedean with idempotent if and only if S is either a group or an ideal extension of a group by a nilpotent semigroup.
In the following we show that finitely connected archimedean semigroups are finitely generated. We begin with the following lemma. Lemma 6.5. Let T be a nilpotent semigroup. If T is finitely connected, then it is finite.
Proof. Since T is finitely connected, there exists a finite set X ⊆ T such that T = XT 1 . Let U = X . For each x ∈ X, let m(x) = min{n ∈ N : x n = 0}, and let N = x∈X m(x). It can be easily shown that |U| ≤ N. We claim that T = U. Suppose for a contradiction that T = U, and let a ∈ T \U. We have that a = x 1 t 1 for some x 1 ∈ X and t 1 ∈ T 1 . Since a / ∈ U, we have that t 1 ∈ T \ U. By a similar argument, there exist x 2 ∈ X and t 2 ∈ T \ U such that t 1 = x 2 t 2 . Continuing in this way, for each n ∈ N there exist x 1 , . . . , x n ∈ X and t n ∈ T \U such that a = (x 1 . . . x n )t n . However, we have that x 1 . . . x N = 0 and hence a = 0, which is a contradiction. Proposition 6.6. Let S be an archimedean semigroup. If S is finitely connected, then it is finitely generated.
Proof. Suppose first that S has an idempotent. If S is a group, then it is finitely generated by Lemma 2.7, so assume that S is not a group. By Lemma 6.4, there exists a group G that is an ideal of S such that T = S/G is a nilpotent semigroup. We have that G is finitely generated by Remark 2.19 and Lemma 2.7, and T is finite by Remark 2.12 and Lemma 6.5. It follows that S is finitely generated. Now suppose that S has no idempotent. Let a be a fixed element of S. The Tamura order on S (with respect to a) is defined by x ≤ a y ⇐⇒ x = a n y for some n ≥ 0.
By [9,Section IV.4], there exists a set M of maximal elements of S (under ≤ a ), where a ∈ M, such that every element of S can be written in the form p n = a n p with n ≥ 0 and p ∈ M, and the set I = S \ M is an ideal. The Rees quotient S/I is f-noetherian by Lemma 2.11. We have that S/I is nilpotent, since S is an archimedean semigroup, and hence it is finite by Remark 2.12 and Lemma 6.5. Therefore, the set M is finite and S = M is finitely generated. Our next result states that f-noetherian complete semigroups are finitely generated.
Proposition 6.8. Let S be a complete semigroup. If S is f-noetherian, then it is finitely generated.
Proof. We have that S is a semilattice of archimedean semigroups S(Y, S α ) where each S α contains an idempotent. Note that H is a congruence on S. For each α ∈ Y, we have that T α = S α /H α is a nilpotent semigroup. Therefore, if T α is f-noetherian, then it is finite by Lemma 6.5. It follows from Lemma 5.6 that S is finitely generated. Remark 6.9. There exist finitely connected complete semigroups that are not finitely generated; e.g. infinite finitely connected semilattices.
We now exhibit an example of an uncountable commutative semigroup that is f-noetherian. Example 6.10. Let A = a ∼ = N. Let B be the set of all infinite bounded sequences of non-negative integers, and define xy = 0 for all x, y ∈ B, where 0 denotes the sequence whose every term is 0; note that B is a null semigroup. We denote a sequence (x 1 , x 2 , . . . ) by (x n ). Let S = A ∪ B, and define a multiplication on S, extending those on A and B, as follows: where y n = max(x n − i, 0) for each n ∈ N. It it can be easily seen that, with this multiplication, S is an uncountable commutative semigroup. We now show that S is f-noetherian.
Notice that (x n ) = a i (x n + i), and a i (x n ) = 0 if and only if i ≥ max{x n : n ∈ N}. Let ρ be a congruence of finite index on S. Suppose first that there exists i ∈ N such that a i ρ 0. Let n be minimal such that a n ρ 0; we then have that {a i } is a singleton ρ-class for every i < n. We claim that ρ is generated by the pair (a n , 0). Indeed, for any s ∈ {a i : i > n} ∪ B, there exists t ∈ A ∪ B such that s = a n t, so we obtain (s, 0) by applying the pair (a n , 0), and the claim follows. Now suppose that there are no i ∈ N such that a i ρ 0. We have the ρ| A is generated by a pair (a m , a n ) with m < n. We claim that ρ is generated by (a m , a n ). Clealy it is enough to show that, for every x ∈ B, the pair (x, 0) is a consequence of (a m , a n ). So, let x = (x n ) ∈ B and let t = max{x n : n ∈ N}. There exists q ∈ N such that t ≤ qk, where k = n − m. Since x = a m (x n + m), 0 = a m+qk (x n + m), and (a m , a m+qk ) is a consequence of (a m , a n ), it follows that (x, 0) is a consequence of (a m , a n ), as required.
For cancellative commutative semigroups, being countable is a necessary condition for being f-noetherian. Proposition 6.11. Let S be a cancellative commutative semigroup. If S is fnoetherian, then it is countable.
Proof. By Theorem 6.3 we have that S is a semilattice of archimedean semigroups S(Y, S α ). Now Y is finite by Corollary 5.4. We prove that S is countable by induction on the order of Y. If |Y | = 1, then S is finitely generated, and hence countable, by Proposition 6.6. Suppose that |Y | > 1, and choose a maximal element β ∈ Y. We have that S β is f-noetherian by Lemma 2.17, and hence finitely generated by Proposition 6.6.
Suppose that S β contains an idempotent. Consider T = S/H = S(Y, T α ), where T α = S/H α . From the proof of Proposition 6.6, we have that S β is an ideal extension of a group by a finite nilpotent semigroup; hence T β is finite. Therefore, by Theorem 2.13, we have that T\T β = S(Y \{β}, T α ) is f-noetherian. By induction we have that T \ T β is countable, and hence T is countable, so S has countably many H-classes. Now, for every H-class H, the Schützenberger group Γ(H) is finitely generated by Proposition 2.20; therefore, since |H| = |Γ(H)|, we have that H is countable. Hence, we have that S, being a countable union of countable sets, is countable. Now suppose that S β has no idempotent, and fix an element a ∈ S β . Recall from the proof of Proposition 6.6 that there exists a finite set M of maximal elements in S β under the Tamura order ≤ a , where a ∈ M, such that every element of S β can be written in the form p n = a n p with n ≥ 0 and p ∈ M. We now define a congruence ρ on S by s ρ t ⇐⇒ s, t ∈ S α for some α ∈ Y, a m s = a n t for some m, n ≥ 0.
Let T = S/ρ. Letting ρ α denote ρ restricted to S α , we have that T = S(Y, T α ), where T α = S α /ρ α . It is clear that T β is finite. The same argument as above proves that T is countable, so S has countably many ρ-classes. Now consider a ρ-class C, and fix c ∈ C. Since S is countable, for each s ∈ S there exists some unique n s ≥ 0 such that a ns s = c or s = a ns c. We therefore have an injection It follows that each ρ-class C is countable, and hence S is countable.
7. Simple and 0-simple semigroups In this section we consider simple and 0-simple semigroups. We have already seen in Example 4.4 that the properties of being f-noetherian and being finitely generated do not coincide for the class of 0-simple semigroups. On the other hand, it was observed in Remark 4.3 that f-noetherian left simple semigroups are finitely generated. We shall show that this is not the case for the class of right simple semigroups by considering Baer-Levi semigroups.
So, let X be an infinite set, and let S be the set of all injective mappings α : X → X such that |X \Xα| is infinite. Under composition of mappings S is a semigroup, called the Baer-Levi semigroup on X. It turns out that Baer-Levi semigroups are right cancellative, right simple and idempotent-free [3, Theorem 8.2].
Theorem 7.1. The Baer-Levi semigroup S on an infinite set X is f-noetherian.
Proof. Partition X as X = ∞ i=1 X i , where the X i are disjoint subsets of X, each with the same cardinality as X, and define bijections α i : X → X i . We prove that, for any distint i, j ∈ N, the pair (α i , α j ) generates the universal right congruence. It then follows that the universal right congruence is the only right congruence of finite index on S, and S is f-noetherian.
So, let ρ be the right congruence on S generated by the pair (α i , α j ). We make the following claim.

Remark 7.2.
(1) Adjoining a zero to a Baer-Levi semigroup yields a right 0-simple semigroup that is f-noetherian but not finitely generated. Left 0-simple f-noetherian semigroups, however, are finitely generated by Proposition 4.2.
(2) Finitely connected left 0-simple semigroups are not in general finitely generated. Indeed, any group with a zero adjoined is finitely connected. (3) Any 0-simple right noetherian semigroup is finitely generated by [10,Thm. 3.2]. However, there exist finitely generated left/right 0-simple semigroups that are not right noetherian; e.g. the monoid G 0 where G is any finitely generated group with a non-finitely generated subgroup.
Remark 7.3. A semigroup S is said to be pseudo-finite if there exists a finite set X ⊆ S × S and some n ∈ N such that for any a, b ∈ S, there exists an X-sequence of length at most n connecting a and b. Clearly this property is stronger than that of being finitely connected. It was asked in [5, Open Problem 8.10] whether every pseudo-finite semigroup contains a completely simple ideal. It can be seen from the proof of Theorem 7.1 that Baer-Levi semigroups are pseudo-finite, answering this question in the negative.
It was shown in [5, Corollary 3.6] that every finitely connected completely simple semigroup is finitely generated, so we have the following generalisation of Lemma 2.7.
Theorem 7.4. The following are equivalent for a completely simple semigroup S: (1) S is f-noetherian; (2) S is finitely connected; (3) S is finitely generated.
Finitely connected completely 0-simple semigroups are not in general finitely generated by [5,Corollary 6.10]. However, the properties of being f-noetherian and being finitely generated coincide for completely 0-simple semigroups. Proof. We only need to prove the direct implication. Let S = M 0 (G; I, J; P ). Since S is finitely connected, we have that I is finite by [5,Corollary 6.10]. For each j ∈ J, define a map θ j : I → {1, 0} by We define a right congruence ρ on S by setting 0 ρ 0 and (i 1 , g 1 , j 1 ) ρ (i 2 , g 2 , j 2 ) ⇐⇒ θ j 1 = θ j 2 .