Bases for pseudovarieties closed under bideterministic product
Alfredo Costa, Ana Escada

TL;DR
This paper characterizes pseudovarieties of semigroups that have bases of pseudoidentities involving finite products of regular pseudowords, linking them to closure properties under bideterministic product in language varieties.
Contribution
It establishes an equivalence between bases of pseudoidentities and closure under bideterministic product, extending understanding of pseudovariety structure and locality.
Findings
Pseudovarieties containing finite semilattices and within DS have specific pseudoidentity bases.
Equivalence between pseudoidentity bases and closure under bideterministic product is proven.
The intersection of DH and ECom pseudovarieties is shown to be local.
Abstract
We show that if is a semigroup pseudovariety containing the finite semilattices and contained in , then it has a basis of pseudoidentities between finite products of regular pseudowords if, and only if, the corresponding variety of languages is closed under bideterministic product. The key to this equivalence is a weak generalization of the existence and uniqueness of -reduced factorizations. This equational approach is used to address the locality of some pseudovarieties. In particular, it is shown that is local, for any group pseudovariety .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Bases for
pseudovarieties closed under bideterministic product
Alfredo Costa
CMUC, Department of Mathematics, University of Coimbra, Apartado 3008, EC Santa Cruz, 3001-501 Coimbra, Portugal.
and
Ana Escada
CMUC, Department of Mathematics, University of Coimbra, Apartado 3008, EC Santa Cruz, 3001-501 Coimbra, Portugal.
Abstract.
We show that if is a semigroup pseudovariety containing the finite semilattices and contained in , then it has a basis of pseudoidentities between finite products of regular pseudowords if, and only if, the corresponding variety of languages is closed under bideterministic product. The key to this equivalence is a weak generalization of the existence and uniqueness of -reduced factorizations. This equational approach is used to address the locality of some pseudovarieties. In particular, it is shown that is local, for any group pseudovariety .
Key words and phrases:
Profinite semigroups; monoids; pseudovarieties; bideterministic product; basis of pseudoidentities; local pseudovarieties
2010 Mathematics Subject Classification:
20M07, 20M05, 20M35, 18B40
This work was partially supported by the Centre for Mathematics of the University of Coimbra – UID/MAT/00324/2019, funded by the Portuguese Government through FCT/MEC and co-funded by the European Regional Development Fund through the Partnership Agreement PT2020.
1. Introduction
Reiterman’s theorem [33] affirms that the pseudovarieties of semigroups are precisely the classes of finite semigroups defined by a basis of pseudoidentities between pseudowords. In this paper we refine this by showing that the basis may be chosen to consist solely of pseudoidentities between finite products of regular pseudowords, whenever is a pseudovariety in the interval that is closed under bideterministic product; motivated by this result, we call a finite product of regular pseudowords a multiregular pseudoword. Conversely, we give a proof that every pseudovariety of semigroups that has a basis of pseudoidentities between multiregular pseudowords is closed under bideterministic product; one may say that this converse is already hidden in the paper [31], where pseudovarieties closed under bideterministic product were first introduced, but note that neither in [31] nor in the sequels [15, 22, 16, 17] the profinite approach is explicitly present. In view of these results, one may argue that closure under bideterministic product is a relatively mild condition to impose upon a pseudovariety. Another reason for the interest in the bideterministic closure is that it is a natural companion of the closure under left deterministic product (which algebraically translates to the equality between and the Mal’cev product {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}), the closure under right deterministic product (that translates to {\mathsf{V}}={\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}), and of the closure under unambiguous product (translated to {\mathsf{V}}=\mathscr{L}{\mathsf{I}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{D}}).
Theorem 7.2, our main result, is the key to our refinement of Reiterman’s theorem and other results. It is a sort of weak generalization of the theorem on the uniqueness of -reduced factorizations [4], recalled as Theorem 6.4. It is also a theorem in the spirit of the solutions of the “pseudoword problem” (of knowing when a pseudoidentity is satisfied by a pseudovariety) obtained in [37] for pseudovarieties closed under left, right or unambiguous product.
Some inspiration was taken from the fact, shown in [7], that the free profinite semigroups over are equidivisible when is closed under unambiguous product. Here, we show that a weak form of equidivisibility still stands when we only know that is closed under bideterministic product (Theorem 4.9). This is crucial for the proof of our main result. This form of weak divisibility is based on the notion of good factorization, which defines the Pin-Thérien expansion, first introduced in [31].
The property of a pseudovariety of semigroups being local is relevant but often difficult to prove. In [19] it is shown that if is a local monoidal pseudovariety of semigroups containing , then {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} and {\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} are also local monoidal pseudovarieties of semigroups. Consider now the operator that associates to each pseudovariety of semigroups the least pseudovariety of semigroups containing that is closed under bideterministic product. The methods used in [19] do not carry on to this operator (see the discussion in Section 10). But, restricting our attention to the class of finite semigroups whose set of regular elements is a subsemigroup, then, with our key result (Theorem 7.2) we do prove that if is a local monoidal pseudovariety of semigroups contained in the interval , then is also a local monoidal pseudovariety of semigroups. This implies, for example, that is local, for every pseudovariety of groups (this family of peudovarieties has received some attention [11, 10, 13]).
The paper is organized as follows. After the introduction and a section of preliminaries, we recall in Section 3 the Pin-Thérien expansion of a monoid, also giving its semigroup counterpart. The latter is because we want to work with semigroup pseudovarieties that are non-monoidal, such as those of the form , seen in Section 10. Sections 4 to 7 constitute the paper’s core, where several aspects of the notion of good factorization of a pseudoword are explored, culminating in the main results. Finally, Sections 8 to 10 are motivated by the investigation on the locality of pseudovarieties.
2. Preliminaries
For more details on (profinite) semigroups the reader is referred to the introductory text [3] and the books [1, 34]. The definitions and results related with monoids are similar.
For a semigroup , the monoid is obtained from by adjoining to a neutral element not in . Every semigroup homomorphism admits an extension to a monoid homomorphism such that . The object may be different from the frequently used : the latter equals if is a monoid, and is if is not a monoid.
We use the standard notations for Green’s equivalence relations , and and its associated quasi-orders , and on a semigroup : for , if , if , an if , and for , we have when and . The elements such that are said to be regular. In general, the set of regular elements of a semigroup is not a subsemigroup. If is a compact semigroup (i.e., a semigroup endowed with a compact topology for which the semigroup operation is continuous), then, for each , a -class of contains a regular element if and only if all its elements are regular, in which case we say that is regular. Moreover, one also views as a compact semigroup by adding has an isolated point.
2.1. Pseudovarieties
A pseudovariety of semigroups is a class of finite semigroups closed under taking subsemigroups, homomorphic images and finitary direct products. The pseudovariety of all finite semigroups is denoted by . We list some other pseudovarieties which have a role in this paper: , the pseudovariety of all finite semillatices; , the pseudovariety of all finite semigroups whose regular -classes are trivial; , the pseudovariety of all finite semigroups whose idempotents are right zeros; and , the dual of . For any pseudovariety , one denotes by the pseudovariety of all finite semigroups such that , for all idempotents , and denotes the pseudovariety of all finite semigroups whose regular -classes are semigroups that belong to . As we have mentioned in the introduction, the pseudovariety will play a special role in this paper: quite frequently, in the study of pseudovarieties, one has to consider the cases and separately.
Let and be pseudovarieties of semigroups. The Mal’cev product {\mathsf{W}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} is the pseudovariety of semigroups generated by finite semigroups for which there is a semigroup homomorphism , for some , such that , for each idempotent . The semidirect product is the pseudovariety generated by all semidirect products of the form with and .
2.2. Free pro- semigroups
In what follows, finite semigroups are viewed as compact semigroups, endowed with the discrete topology. A compact semigroup is said to be -generated if there is a map such that generates a dense subsemigroup of . It is said to be residually in , where is a pseudovariety, if for every two distinct elements and of , there is some continuous homomorphism into a semigroup such that . By a pro- semigroup we mean a compact semigroup residually in .
In this paper all alphabets are finite. For each alphabet , there is a unique (up to isomorphism) -generated free pro- semigroup, denoted , endowed with a mapping , which satisfies the following universal property: for any map into a pro- semigroup there is a unique continuous homomorphism such that . The finiteness of guarantees that is metrizable. The elements of are called pseudowords (with respect to ). In particular, the map induces a unique continuous homomorphism , which is called the natural projection of onto , and satisfies . We write instead of . In case , we use the notation for , and we speak of profinite semigroups instead of pro- semigroups.
Let be the subsemigroup of generated by . If is not the trivial pseudovariety, then is injective, and so may actually be seen as a subset of . Moreover, if contains the pseudovariety of finite nilpotent semigroups, then is naturally isomorphic to the free semigroup , endowed with the discrete topology, and the elements of are isolated in . From hereon, we identify with when contains .
Let be a pseudovariety that contains and let be the content mapping, the unique continuous homomorphism from onto such that . If is a word on , then is the set of letters occurring in . In general, is the content of , for every .
A pseudoidentity in variables of the alphabet is a formal equality between elements and of . For a profinite semigroup , we write when satisfies the pseudoidentity (that is, for every map , we have ), and write when all semigroups of satisfy . More generally, we write when is a set of pseudoidentities satisfied by all semigroups of . The class of finite semigroups satisfying all elements of is denoted . Reiterman’s Theorem [33] states that the pseudovarieties of semigroups are precisely the classes of the form . As a relevant example, we have , where, if is an element of a profinite semigroup, is the idempotent (more generally, we use the notation ). One says that is a basis for when .
A language is -recognizable if there is a homomorphism from into a semigroup of such that . The following proposition establishes a link between -recognizable languages and the topology of , when contains . The restriction may be dropped, but the statement becomes less direct, and it suffices for us that .
Theorem 2.1** (cf. [1, Theorem 3.6.1]).**
Let be a semigroup pseudovariety containing . A language is -recognizable if and only if its closure in is open.
Note that, in Theorem 2.1, one has , because the elements of are isolated in . Hence, Theorem 2.1 states that the -recognizable languages of are precisely the traces in of the clopen subsets of . We shall use Theorem 2.1 abundantly, without reference.
Theorem 2.1 is relevant in the framework of Eilenberg’s Theorem [21] on the correspondence between a semigroup pseudovariety and the variety of -languages that are -recognizable (recall that a -language is a subset of a free semigroup, while a -language is a subset of a free monoid). For the sake of conciseness, we write whenever is a -recognizable language of , instead of the more precise .
We shall frequently switch from the viewpoint of -languages and semigroup pseudovarieties to that of -languages and monoid pseudovarieties.
2.3. Marked products
Our departing point is the following definition, whose first three items are nowadays classical [28].
Definition 2.2**.**
Let and be languages of , and let . The language , viewed as product of the languages , and – usually referred to as a marked product of and – is said to be:
- (1)
an unambiguous product when every element of has a unique factorization such that and ; 2. (2)
a left deterministic product when every word of has a unique prefix in ; 3. (3)
a right deterministic product when every word of has a unique suffix in ; 4. (4)
a bideterministic product if the marked product is simultaneously right and left deterministic.
We say that a language of is a prefix code (resp. suffix code) if , (resp. , ).
Note that is left deterministic if and only if is a prefix code. Dually, it is right deterministic if and only if is a suffix code.
Next, we introduce a varietal companion of Definition 2.2.
Definition 2.3**.**
Let be a pseudovariety of monoids, and let be the correspondent variety of -recognizable -languages. Then is said to be:
- (1)
closed under unanbiguous product if whenever , is a letter and is an unambiguous product; 2. (2)
closed under left deterministic product if whenever , is a letter and is a prefix code; 3. (3)
closed under right deterministic product if whenever , is a letter and is a suffix code; 4. (4)
closed under bideterministic product if whenever , is a letter, is a prefix code and is a suffix code.
It is well known that we have the following characterization of the first three types of pseudovarieties mentioned in Definition 2.3.
Theorem 2.4** **([27, 28, 30, 35],
see also survey [29]).
Let be a pseudovariety of monoids. Then:
- (1)
* is closed under unambiguous product if and only if {\mathsf{V}}=\mathscr{L}{\mathsf{I}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}};* 2. (2)
* is closed under left deterministic product if and only if {\mathsf{V}}={\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}};* 3. (3)
* is closed under right deterministic product if and only if {\mathsf{V}}={\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}.*
On the other hand, pseudovarieties closed under bidetermistic product have no characterization that, like in Theorem 2.4, uses a Mal’cev product.
In this section, we have so far stayed in the realm of -languages, and in the corresponding one of monoid pseudovarieties. But the definitions and results we reviewed have natural companions in the realms of -varieties and semigroup pseudovarieties. A way to define these counterparts is by restricting each language and to be either a -language or the language . We next see a concrete manifestation of this in the case of the bidetermistic product, the subject of attention in this paper.
Definition 2.5**.**
Let be a semigroup pseudovariety, and be the variety of -recognizable -languages. Then is closed under bideterministic product if when is a letter and the next conditions are satisfied: or ; or ; is a prefix code; is a suffix code.
For , let be the first letter of if , and . Dually, is the last letter of if , and . The maps and extend uniquely to continuous maps from into .
Remark 2.6**.**
The product of prefix codes is a prefix code. In particular, is a prefix code when is a prefix code, whenever . Dual remarks hold for suffix codes. This implies that, still assuming that is closed under bideterministic product and that is its corresponding variety of -languages, if , and , with when and , are such that is a prefix code and is a suffix code for every , then .
3. The Pin-Thérien expansion
3.1. The Pin-Thérien expansion of a finite monoid
In what follows, we consider an onto homomorphism of monoids such that is finite. The finiteness of is frequently not important (sometimes it is, like in Theorem 5.4), but that is the framework in which we are interested, and it is a general assumption also made in [31].
Definition 3.1**.**
A good factorization (with respect to ) is a triple of such that and . Two good factorizations and are said to be equivalent when , and . A good factorization of is a good factorization such that .
It is shown in [16] that, for all , every good factorization of is equivalent to at most one good factorization of .
Definition 3.2**.**
Let be the relation on defined by if and only if the following conditions are satisfied:
- (1)
; 2. (2)
each good factorization of is equivalent to a good factorization of ; 3. (3)
each good factorization of is equivalent to a good factorization of .
The relation is a congruence [31].
Definition 3.3**.**
Denote by , and by the corresponding quotient morphism from onto . We say that is the Pin-Thérien expansion of with respect to .
Note that there is a unique onto monoid homomorphism such that . Note also that the finiteness of guarantees the finiteness of [31]. The correspondence is indeed an expansion cut to generators in the sense of Birget and Rhodes, as shown in [31]. In fact, it is proved in [16] that it is an expansion in a broader sense.
Definition 3.4**.**
For a monoid pseudovariety , denote by the monoid pseudovariety generated by Pin-Thérien expansions of monoids in . We say that is closed under Pin-Thérien expansion when .
Theorem 3.5** ([31, Corollary 4.5]).**
Let be a monoid pseudovariety. Then if and only if is closed under bideterministic product.
The intersection of a family of monoid pseudovarieties closed under bideterministic product is a pseudovariety closed under bideterministic product. Hence, for each monoid pseudovariety we may consider the least monoid pseudovariety closed under bideterministic product and containing .
Remark 3.6**.**
Consider the chain of pseudovarieties recursively defined by and for each . Then is closed for the bideterministic product (cf. Theorem 3.5) and .
Example 3.7**.**
It is easy to see that the Pin-Thérien expansion of a finite group , viewed as a monoid, is itself. Hence, viewing a pseudovariety of groups as a monoid pseudovariety, one has .
Example 3.8**.**
Let be the pseudovariety of monoids whose idempotents commute. In [31] it is shown that , whenever is a pseudovariety of groups. In particular, the equality holds.
For a pseudovariety of monoids, we denote by the class of finite monoids whose set of regular elements is a submonoid in . When , is a pseudovariety, where is the pseudovariety of all finite monoids which are completely regular.
Example 3.9**.**
If , then . This formula was deduced in [22] from its special case, proved in [15], in which .
3.2. The Pin-Thérien expansion of a finite semigroup
In the following lines, we define a semigroup version of the Pin-Thérien expansion. Let be an onto homomorphism of semigroups, with finite. Consider the monoid homomorphism such that , when . Then the empty word of is the unique element of the -class of . Therefore, if is the identity of , then the semigroup satisfies , and so
[TABLE]
where we are making the identification . We may then consider the semigroup homomorphism obtained by the restriction of to . Note that
[TABLE]
The semigroup is the (semigroup) Pin-Thérien expansion of with respect to . We then let be the kernel of . We also denote by the unique onto semigroup homomorphism such that . Note also that, for such a , we have .
Remark 3.10**.**
The expansion may equivalently be defined by adapting the definitions given in Subsection 3.1, by letting be a good factorization of whenever and .
For a pseudovariety of monoids , one denotes by the least pseudovariety of semigroups containing . It is well known that if and only if . Moreover, if contains , then if and only if , a fact that we shall use in the proof of the next proposition.
Proposition 3.11**.**
If is a pseudovariety of monoids containing , then the equality holds.
Proof.
Let be a surjective homomorphism onto a monoid of . The proof of , equivalently of , is concluded once we show that , viewed as a semigroup, belongs to .
Denote by the identity of . We consider two cases.
Suppose first that . Let , where is a new letter not in . Consider the homomorphism such that and for every . Denote by . Consider also the semigroup homomorphism such that and . We claim that, in the category of semigroups, is a homomorphic image of . For that purpose, we collect the following series of facts:
- (1)
We have and , thus and are -classes, and is a -class. 2. (2)
If is a good factorization with respect to of an element of , then . 3. (3)
Let . Then is a good factorization with respect to if and only if is a good factorization with respect to . This is trus because unless , in which case and hold, and because of the dual phenomena concerning the third component of the factorizations.
Taking into account the partition , it follows that the map from to , sending to , is a well defined onto homomorphism of semigroups, thus establishing the claim. As and , it follows that .
Suppose now that . Then . Let be the monoid homomorphism from onto such that for every . Note that is onto and that . Moreover, since , the monoid belongs to . Hence, by the already proved case, we have . Let be the onto monoid homomorphism from to whose restriction to is the identity. Then . Because we are dealing with an expansion cut to generators, this implies that is a homomorphic image of , whence .
Finally, we show that . Let , and let be an onto homomorphism. Since contains , we have , whence . But , whence . ∎
We omit the proof of the following theorem, since it can be made by just imitating the proof in [31] of its monoid analog (Theorem 3.5).
Theorem 3.12**.**
A pseudovariety of semigroups satisfies if and only if is closed under bideterministic product.
As for monoids, let be the least semigroup pseudovariety, containing the semigroup pseudovariety , which is closed under bideterministic product. Note that Remark 3.6 also holds for pseudovarieties of semigroups. This fact and Proposition 3.11 yeld the following corollary.
Corollary 3.13**.**
If is a monoid pseudovariety containing , then the equality holds.∎
In Corollary 3.13, the hypothesis is needed as seen below.
Example 3.14**.**
Let be the class of trivial semigroups. Viewing as a pseudovariety of monoids, one has (Example 3.7), but if we view as a pseudovariety of semigroups, then we get . Indeed, because an -recognizable language is either finite or co-finite, and since a co-finite language can neither be a prefix code nor a suffix code, one clearly has that is closed under bideterministic product. On the other hand, since every finite language is the finite union of bideterministic products of the form , with letters.
4. Good factorizations of pseudowords
Inspired by the concept of good factorization of a word, we define an analog for pseudowords.
Definition 4.1**.**
Let be a pseudovariety of semigroups. A good factorization of an element of is a triple in , with , such that and .
We omit next lemma’s easy proof, analog to that of [31, Lemma 2.1].
Lemma 4.2**.**
Let be a pseudovariety of semigroups. Suppose that is a good factorization of an element of . Let be a suffix of and let be a prefix of . Then is a good factorization.
In the next definition the hypothesis is required to ensure that the elements of embed in (as isolated points).
Definition 4.3**.**
Let be a semigroup pseudovariety containing . A -good factorization of is a triple in , with , such that and .
Note that a good factorization is -good factorization (assuming ).
Starting in the next lemma, we use the usual notation for the open ball of center and radius .
Lemma 4.4**.**
Let be a pseudovariety of semigroups containing . Suppose that and are such that . Then, there is a positive integer such that, for every , and for every , the set
[TABLE]
is a prefix code.
Proof.
The proof reduces immediately to the case (cf. first two sentences in Remark 2.6). Let be the set of positive integers for which \Bigr{[}B\Bigl{(}\pi,\frac{1}{k}\Bigr{)}\cap A^{\ast}\Bigl{]}\cdot a is not a prefix code. Suppose that is infinite. For each , we may consider distinct elements and of B\Bigl{(}\pi,\frac{1}{k}\Bigr{)}\cap A^{\ast} such that is a prefix of . For such elements, there is with . Note that the sequences and converge to and that has some accumulation point in the compact space . Hence, we have the equality , contradicting the hypothesis that . To avoid the contradiction, the set must be finite. ∎
In the following proofs, we shall frequently use, without reference, that if is a semigroup pseudovariety closed under bideterministic product, then contains (cf. Example 3.14).
Corollary 4.5**.**
Let be a pseudovariety of semigroups closed under bideterministic product. Suppose that and are such that . Then, there is a positive integer such that, for every , and for every , the set B\Bigl{(}\pi,\frac{1}{k}\Bigr{)}\cdot au is clopen.
Proof.
By Lemma 4.4, there is a positive integer such that for every , the set \Bigr{[}B\Bigl{(}\pi,\frac{1}{k}\Bigr{)}\cap A^{\ast}\Bigl{]}\cdot a is a prefix code. Hence, for and , the language \Bigr{[}B\Bigl{(}\pi,\frac{1}{k}\Bigr{)}\cap A^{\ast}\Bigl{]}\cdot a\cdot u is a bideterministic product of -recognizable languages, and thus it is itself -recognizable by the hypothesis that is closed under bideterministic product. Taking the topological closure in , we conclude that B\Bigl{(}\pi,\frac{1}{k}\Bigr{)}\cdot au is clopen. ∎
Lemma 4.6**.**
Let be a pseudovariety of semigroups closed under bideterministic product. Suppose that is a -good factorization of . Let , be such that . Then and are good factorizations of .
Proof.
By symmetry, it suffices to show that is a good factorization. We suppose that and , as both the cases and are trivial. We only need to show . Suppose on the contrary that . Then for some . Let and be sequences of elements of respectively converging to and . Thanks to the dual of Corollary 4.5, there is a positive integer such that, for every , the set v\cdot B\Bigl{(}\rho,\frac{1}{k}\Bigr{)} is a clopen neighborhood of . Therefore, as converges to , we can build subsequences and such that z_{n_{k}}av\rho_{n_{k}}\in v\cdot B\Bigl{(}\rho,\frac{1}{k}\Bigr{)}, with \rho_{n_{k}}\in B\Bigl{(}\rho,\frac{1}{k}\Bigr{)}, for every . But then is an element of the intersection
[TABLE]
for every . This contradicts the dual of Lemma 4.4. ∎
Proposition 4.7**.**
Let be a pseudovariety of semigroups closed under bideterministic product. Suppose that is a -good factorization of an element of . For each positive integer , consider the subset of defined by:
[TABLE]
For all sufficiently large , the set is a clopen neighborhood of .
Proof.
Since is an ideal of , we have
[TABLE]
By Lemma 4.4, there is a positive integer such that, for every , the set \Bigr{[}B\Bigl{(}\pi,\frac{1}{k}\Bigr{)}\cap A^{\ast}\Bigl{]}\cdot\mathsf{i}_{1}(u) is a prefix code. By the dual of Lemma 4.4, there is a positive integer , such that, for every , the set \mathsf{t}_{1}(u)\cdot\Bigr{[}B\Bigl{(}\pi,\frac{1}{k}\Bigr{)}\cap A^{\ast}\Bigl{]} is a suffix code. Therefore, for , the product in the right side of (4.1) is -recognizable (cf. Remark 2.6), and so its closure in , the set , is open. ∎
The proof of the following proposition is an adaptation of part of the proof of [8, Lemma 3.2], where a description of compact metric semigroups with open multiplication is given in terms of a property of sequences.
Proposition 4.8**.**
Let be a semigroup pseudovariety closed under bideterministic product. Suppose that is a -good factorization of . Let be a sequence of elements of converging to . There are sequences and in , respectively converging to and , such that for all sufficiently large .
Proof.
For each integer , consider the set as in Proposition 4.7, and let be such that is a clopen neighborhood of for every (such exists by Proposition 4.7). For each , take such that when . Let be the strictly increasing sequence defined by and for . When , take \pi_{n}\in B\Bigl{(}\pi,\frac{1}{k}\Bigr{)} and \rho_{n}\in B\Bigl{(}\rho,\frac{1}{k}\Bigr{)} such that , which we can do as . If , take . Clearly, and respectively converge to and . ∎
We are ready to prove the next theorem, a sort of generalization of the equidivisibility property, observed in [7], of the finitely generated free profinite semigroups over pseudovarieties closed under unambiguous product.
Theorem 4.9**.**
Let be a pseudovariety of semigroups closed under bideterministic product. Suppose that is a good factorization of an element of . Let be a factorization of such that . Then, at least one of the three following cases occurs:
- (1)
, and ; 2. (2)
* and for some ;* 3. (3)
* and for some .*
Proof.
As is dense in , we may consider sequences and of elements of respectively converging to and . Let . Note that , and so, by Proposition 4.8, there are sequences and of elements of , respectively converging to and , and a positive integer , such that , . Since the latter is an equality of words of , for each one of the following three situations occurs:
- (a)
, and ; 2. (b)
and for some ; 3. (c)
and for some .
We let , and be the sets of positive integers greater or equal than for which, respectively, situations (a), (b) and (c) occur. At least one of the three sets is infinite. Suppose that is infinite. For each , let be as in (b). By compactness, the sequence has some accumulation point in . Taking limits, we get and , and so if is infinite then Case (2) holds. Arguing in a similar manner, we conclude that Case (3) holds if is infinite, and that Case (1) holds if is infinite. ∎
5. Pseudowords without good factorizations
An analog of the next proposition, and of the corollary following it, is implicitly proved in [31] for good factorizations with respect to a homomorphism defined in a free monoid (cf. proof of [31, Theorem 2.6]).
Proposition 5.1**.**
Let be a pseudovariety of semigroups closed under bideterministic product. The set of elements of without good factorizations is a closed subsemigroup of .
Proof.
Denote by the set of elements of without good factorizations.
Let . Suppose that has some good factorization . Take and such that . Applying Theorem 4.9 to , we conclude that one of the following occurs:
- (1)
, and ; 2. (2)
and for some ; 3. (3)
and for some .
In the first case, as is a good factorization, so is . But has no good factorizations, by hypothesis, and so the first case does not hold. If we are in the second case, then, as is a suffix of , we deduce from Lemma 4.2 that is a good factorization of , contradicting the hypothesis that has no good factorizations. Similarly, the third case is in contradiction with not having good factorizations. Therefore, has no good factorization, and is a subsemigroup of .
Finally, let be a sequence of elements of converging in to . Suppose that . We may then consider a good factorization of . By Proposition 4.8, there are sequences and of elements of , respectively converging to and , and there is such that for all . Consider the sets
[TABLE]
Since , every integer greater or equal to belongs to , and so at least one of the sets and is infinite. Suppose that is infinite. Since is a closed relation in , taking limits we get , contradicting that is a good factorization. Similarly, a contradiction arises if is infinite. Therefore, and so is closed. ∎
Corollary 5.2**.**
Let be a pseudovariety of semigroups closed under bideterministic product. If is a product of regular elements of , then has no good factorization.
Proof.
By Proposition 5.1, it suffices to show that an arbitrary regular element of has no good factorizations. Take such that . Suppose there is a good factorization of . As , by Theorem 4.9 one of three cases holds: , or is a prefix of , or is a suffix of . The second case immediately contradicts being a good factorization. And since is a suffix of , in the first and third cases we get , also a contradiction. Hence, has no good factorization. ∎
The next lemma and the theorem that follows it are proved in [31] for the corresponding monoid versions. We prove them in the semigroup versions with a somewhat different approach: we use pseudowords. For a semigroup , we let be the set of regular elements of , and let be the subsemigroup of generated by a nonempty subset of .
Lemma 5.3**.**
Let be a homomorphism onto a finite semigroup, and let be such that is a product of regular elements of . Then has no good factorizations with respect to .
Proof.
Consider the unique continuous homomorphism extending . Every regular element of is the image by of a regular element of , and so we may take in with . Let be a sequence of words converging to . Take the set of positive integers such that has a good factorization with respect to . Suppose that is infinite. Let be an accumulation point of . Then , and for every in an infinite subset of , one has , and . Therefore, and hold, thus and . Hence, is a good factorization of . But this contradicts Corollary 5.2, and so must be finite. As for all large enough , we conclude that for some without good factorizations with respect to . By the definition of the congruence , it follows that has no good factorizations with respect to . ∎
Theorem 5.4**.**
Let be a homomorphism onto a finite semigroup. Then restricts to an isomorphism .
Proof.
Since is finite, we have , so it remains to show the restriction is one-to-one. Take . Let be such that and . By Lemma 5.3, both and have no good factorizations with respect to . Therefore, we have if and only if , that is, if and only if . ∎
For the sake of conciseness, say that a pseudoword is -regular when is regular, and is -multiregular if is a finite product of -regular pseudowords (actually, one may drop the finiteness assumption in subsequent results, but the assumption is nevertheless included because of the examples we have in mind).
The following result is a sufficient condition to “climb up” a pseudoidentity from to .
Proposition 5.5**.**
Let be a pseudovariety of semigroups. If are -multiregulars, then implies .
Proof.
Let be a homomorphism onto a semigroup of . Take an arbitrary homomorphism . Let us show that .
Since is onto, by the freeness of there is a continuous homomorphism such that . As , we have
[TABLE]
As , there is a continuous homomorphism such that
[TABLE]
From the hypothesis that and are -multiregulars we get that the pseudowords and are also -multiregulars, and so, in view of (5.2), we conclude that and are both products of regular elements of . Then, applying Theorem 5.4, we obtain from equality (5.1) the equality , that is . Since is an arbitrary homomorphism from into , we conclude that . This shows that . ∎
The characterization of observed in Remark 3.6 (more precisely, the semigroup pseudovariety version of Remark 3.6) and Proposition 5.5 allow us to deduce the following, with a straightforward inductive argument.
Corollary 5.6**.**
Let be a pseudovariety of semigroups. If are -multiregulars, then implies .∎
Definition 5.7**.**
Let and be semigroup pseudovarieties with . Say that is multiregularly based in if it has a basis of pseudoidentities such that, for every pseudoidentity in , both and are -multiregular pseudowords. If , then we just say that is multiregularly based.
Proposition 5.8**.**
Let and be pseudovarieties of semigroups with and is multiregularly based in . If is closed under bideterministic product, then so is .
Proof.
Let be a basis for such that, for every pseudoidentity in , both and are -multiregulars. Fix an element of . Since and is closed under bideterministic product, the inclusion holds. It then follows from Proposition 5.5 that . This shows that , that is, is closed under bideterministic product. ∎
Example 5.9**.**
The pseudovarieties and are pseudovarieties of semigroups closed under bideterministic product, in view of Proposition 5.8.
Corollary 5.10**.**
If is a pseudovariety of semigroups multiregularly based then the pseudovariety is closed under bideterministic product.
Proof.
Suppose that , where is a set of pseudoidentities. For each pseudoidentity , consider an alphabet that contains and a letter . Let be the unique continuous endomorphism of such that for every letter of . Then the equality holds. Clearly, if and are multiregulars, then the same happens with and . Hence, if is multiregularly based, then is multiregularly based and, by Proposition (5.8), is closed under bideterministic product. ∎
We close this section applying Corollary 5.2 in the proof of the following technical lemma, to be used later on.
Lemma 5.11**.**
Let be a pseudovariety of semigroups closed under bideterministic product. Consider an element of such that for some regular element of . Then, there is not a good factorization of such that .
Proof.
Suppose, on the contrary, that there is a good factorization of such that . Let , with . Since is regular, it has a factorization , such that , , and . Applying Theorem 4.9 to compare the factorizations and of , and since and are finite words of the same length, we conclude that , and . As the triple is then a good factorization of , we may apply Lemma 4.2 to conclude that the triple is a good factorization of . But this contradicts Corollary 5.2. ∎
6. Organized factorizations
In this section, we quickly review the factorizations of pseudowords as products of words and regular elements over , and then proceed to an abstraction of that property. First, it is convenient to recall the following properties, going back to [14]. We give [1, Chapter 8] as reference.
Proposition 6.1**.**
Let . The following properties hold:
- (1)
* is -regular if and only if is -regular;
- (2)
if and are -regular, then if and only if ; 3. (3)
for every pseudovariety of semigroups such that , if is -regular, then if and only if .
Definition 6.2**.**
A factorization of an element of is -reduced if the next four conditions are satisfied:
- (1)
for every ; 2. (2)
is -regular for every ; 3. (3)
if and , then and are incomparable; 4. (4)
and , for every .
If, moreover, the fifth condition is also satisfied, then we say that is a -reduced multiregular element of .
Lemma 6.3**.**
Suppose that is a product of pseudowords that are -regular. Then factorizes as a -reduced multiregular pseudoword for some .
Proof.
Let be a factorization into -regular pseudowords. We show the lemma by induction on . The base case is trivial. Suppose the lemma holds for smaller values of . If and are incomparable for each , then the factorization is already -reduced. If, on the contrary, and are comparable for some , then is a -regular pseudoword (cf. Proposition 6.1(3)) and is a factorization of into less than -regular factors. We may then apply the induction hypothesis. ∎
As supporting references for the next theorem, we give [4, Section 4] and [1, Theorem 8.1.11].
Theorem 6.4**.**
Every element of has a -reduced factorization, and each -reduced factorization is unique modulo , that is, if
[TABLE]
are -reduced factorizations such that , then , and for every and .
The following interesting observation will be used later on.
Lemma 6.5**.**
Let be a semigroup pseudovariety in the interval . Suppose that is a -reduced multiregular pseudoword, and let . Then if and only if .
Proof.
As implies , the “if” part is immediate in view of Proposition 6.1. Conversely, suppose that , and let be such that . We then have . By the uniqueness of -reduced factorizations (Theorem 6.4), the sets and must be comparable, and so is -regular. Again by the uniqueness of -reduced factorizations and by Lemma 6.3 , the factorization must be -reduced, and moreover . In particular, we have . ∎
Next is an abstraction of some features of being -reduced.
Definition 6.6**.**
Let us consider a factorization of of the form
[TABLE]
for some , such that , when , and when .
Let be a semigroup pseudovariety. The factorization (6.1) is multiregularly organized in if the pseudowords , , are -multiregular. The same factorization (6.1) is organized with short -breaks if the following conditions hold:
- (SB.1)
when ; 2. (SB.2)
when ; 3. (SB.3)
if then ; 4. (SB.4)
if then .
Finally, the factorization (6.1) is organized with long -breaks if the following conditions hold:
- (LB.1)
for each ; 2. (LB.2)
for each ; 3. (LB.3)
if then ; 4. (LB.4)
if then .
Remark 6.7**.**
A factorization (6.1) that is organized with long -breaks is a factorization that is organized with short -breaks.
Definition 6.8**.**
A semigroup pseudovariety is organizing if, for every alphabet , every is multiregularly organized in .
Example 6.9**.**
The pseudovarieties and are organizing pseudovarieties, the former by Theorem 6.4 (and Proposition 6.1(1)), the latter by an analog result of Almeida and Weil (Proposition 3.7 in [10]).
Proposition 6.10**.**
Let be a pseudovariety of semigroups. Suppose that is an element of with a factorization multiregularly organized in a semigroup pseudovariety . Then there are and a set of pseudoidentities over satisfying the following conditions:
- (1)
; 2. (2)
* has a factorization multiregularly organized in and with short -breaks;* 3. (3)
*if belongs to , then and are -multiregulars. *
Proof.
By hypothesis, there is a factorization
[TABLE]
which is multiregularly organized in . Let and . We show the proposition by induction on . If or (the latter implies ), then just take and . In particular, this shows the initial step of the induction.
Suppose the proposition holds for smaller values of and that and . Let be the set of integers in such that and , or such that and . In fact, one always has , except, perhaps, when or . If , then we just take and . Suppose that , and let . Without loss of generality, we assume that and . Let , and let be such that . Then, there is such that
[TABLE]
Let . Since is a regular element of and is -multiregular, we know that is also -multiregular. Consider the pseudoword with factorization
[TABLE]
If , then this factorization is multiregularly organized in . If , then we also obtain a factorization of which is multiregularly organized in by “gluing” and . In any case, we produce a factorization of which is multiregularly organized in and with smaller value for than that we had in . We may therefore apply the induction hypothesis to obtain a pseudoword and a set of pseudoidentities over satisfying the following conditions:
- (1)
; 2. (2)
has a factorization multiregularly organized in and with short -breaks; 3. (3)
if belongs to , then and are -multiregulars.
Let . By (6.2), we know that . Moreover, as and are both -multiregulars, we immediately get that Condition (3) in the statement of the proposition holds for . Consider a semigroup in . Then belongs to , whence
[TABLE]
On the other hand, we also have , which implies that
[TABLE]
We immediately conclude that . We have therefore showed that , concluding the inductive step of the proof. ∎
Corollary 6.11**.**
Let and be pseudovarieties of semigroups, with being an organizing pseudovariety. Then has a basis of pseudoidentities with factorizations multiregularly organized in and with short -breaks.
Proof.
Let be a basis of pseudoidentities for . For each , let
[TABLE]
where we follow the definition included in Proposition 6.10. Consider the union . It suffices to show that .
Suppose that . For each , one has and . In particular, implies . We conclude that if , then holds. This establishes the inclusion .
Conversely, let . Take . Because , we have . Similarly, holds. But also implies , and so, all together, we get . This shows . ∎
7. Breaking factorizations assuming bideterministic closure
In this section we see how closure under bidetermistic product allows us to decompose the pseudoidentities found in Corollary 6.11 into pieces involving only products of regular elements over the organizing pseudovariety.
Proposition 7.1**.**
*Consider a semigroup pseudovariety closed under bideterministic product. Let . A factorization of is organized with short -breaks if and only if it is organized with long -breaks. *
Proof.
Recall that the “if” part of the theorem is immediate (Remark 6.7).
Conversely, consider a factorization
[TABLE]
that is organized with short -breaks. We prove by induction on that it is organized with long -breaks. The base case holds trivially. Suppose that and that the theorem holds for smaller values of .
We show that Conditions (LB.1) and (LB.4) in Definition 6.6 hold for (7.1). Since the factorization is clearly organized with short -breaks, it is, by the induction hypothesis, organized with long -breaks. Therefore, to establish Conditions (LB.1) and (LB.4) in Definition 6.6 for the factorization (7.1), it only remains to show that it is impossible to have and
[TABLE]
Suppose, on the contrary, that that is possible. Take and , with and . Then, by Lemma 4.4, for every sufficiently large positive integer , the sets
[TABLE]
are prefix codes. Therefore, for every sufficiently large , their product
[TABLE]
is a prefix code. Following the notation of Proposition 4.7, note that
[TABLE]
On the other hand, since \bigl{(}[\rho]_{{\mathsf{V}}},u_{n-1},[\pi_{n}]_{\mathsf{V}}\bigr{)} is a -good factorization, the language L_{k}\bigl{(}[\rho]_{{\mathsf{V}}},u_{n-1},[\pi_{n}]_{{\mathsf{V}}}\bigr{)}\cap A^{+} is -recognizable for every sufficiently large (cf. Proposition 4.7). Therefore, again applying the hypothesis that is closed under bideterministic product, we conclude that is a -recognizable language, and so the closure of in is a clopen subset of . Since
[TABLE]
we have . As we are assuming that (7.2), holds, there is such that and thus
[TABLE]
Let , and be sequences of elements of respectively converging in to , and , and let . Note that, for every sufficiently large , one has \rho_{m}\in B\Bigl{(}[\rho]_{{\mathsf{V}}},\frac{1}{k}\Bigr{)} and also \pi_{n,m}\in B\Bigl{(}[\pi_{n}]_{{\mathsf{V}}},\frac{1}{k}\Bigr{)}, thus and . On the other hand, by (7.3), the sequence of words converges in to . Since the latter has as a neighborhood, we conclude that for sufficiently large the word belongs to the intersection . But this contradicts being a prefix code. Therefore, in order to avoid this contradiction, one must not have (7.2) whenever .
We established Conditions (LB.1) and (LB.4) in Definition 6.6 for the factorization (7.1). Symmetrically, Conditions (LB.2) and (LB.3) hold for the same factorization. This concludes the inductive step. ∎
We are now ready for showing the central result of this paper.
Theorem 7.2**.**
Let be a semigroup pseudovariety closed under bideterministic product. Take such that . If
[TABLE]
are factorizations multiregularly organized in and with short -breaks, then , and for every and .
Proof.
If , then . Since , we then must have , and .
Suppose that . We prove the theorem by induction on
[TABLE]
Note that . If , then and for every possible . Therefore, and the theorem holds in the base case .
Suppose that , and suppose that the theorem holds for smaller values of . We consider the (possibly empty) pseudowords
[TABLE]
Note that, according to Proposition 7.1, both factorizations (7.4) and (7.5) are multiregularly organized with long -breaks. Therefore, if , with and , then is a good factorization, and if , with and , then is a good factorization. Then, taking into account that both and have regular elements of as prefixes (they are -multiregulars), applying Lemma 5.11 we conclude that if and only if .
Suppose that and . Without loss of generality, assume that . Consider the factorization such that and , and the factorization such that , and . Since and are finite words, when we use Theorem 4.9 to compare the factorizations and of , the first of which is a good one, the only possibility is that , , and
[TABLE]
Since
[TABLE]
we may apply in (7.6) the induction hypothesis, from which we conclude that , , and for every and . Therefore, we may suppose from hereon that .
Suppose that also holds (the case is symmetric). Note that then one has . Moreover, has no good factorizations (cf. Corollary 5.2), whence it has no -good factorization (cf. Lemma 4.6). The latter implies , . Hence, the theorem holds in this case.
Finally, we suppose that and . Consider factorizations with and , and with and . Compare the factorizations and . They are good, by Lemma 4.6. By Theorem 4.9, one of the following cases holds:
- (1)
, and ; 2. (2)
and , for some ; 3. (3)
and , for some .
Suppose Case (2) holds. Since is a good factorization of , it follows from Lemma 4.2 that is a good factorization of . But this is impossible in view of Corollary 5.2, because is a product of regular elements. Therefore, Case (2) does not hold. By symmetry, we conclude that Case (3) is also impossible, and therefore only Case (1) holds. We may then apply the induction hypothesis to
[TABLE]
to obtain (and so ), , and for every and .
This exhausts all possibles cases to consider in the inductive step. ∎
Corollary 7.3**.**
Let be a pseudovariety of semigroups closed under bideterministic product. Suppose that is an organizing pseudovariety containing . Then is multiregularly based in .
Proof.
By Corollary 6.11, has a basis of pseudoidentities multiregularly organized in (whence in ) and with short -breaks. Let . Suppose that the next factorizations are multiregularly organized in and have short -breaks:
[TABLE]
By Theorem 7.2, we know that , and for every and . The integer depends on , and for that reason we denote it by . For each , let . Consider the set of pseudoidentities . To conclude the proof, it suffices to show that . We already saw that . Conversely, suppose that is a semigroup such that . Fix a pseudoidentity . For each , we have . This clearly implies , in view of the factorizations of and with which we are working with. Hence, we have , that is, . This concludes the proof that . ∎
We next highlight the case where the organizing pseudovariety is .
Theorem 7.4**.**
Suppose that is a semigroup pseudovariety in the interval . The following conditions are equivalent:
- (1)
* is closed under bideterministic product;* 2. (2)
* is multiregularly based in ;* 3. (3)
* is multiregularly based.*
Proof.
(1)(2): This is a direct application of Corollary 7.3, in view of the fact that is an organizing pseudovariety.
(2)(3): If is a -multiregular pseudoword, then the product is a multiregular pseudoword for which we have . Therefore, if is a basis for formed by pseudoidentities between -multiregular pseudowords, then
[TABLE]
is a basis for , comprised solely by pseudoidentities between products of -regular pseudowords.
(3)(1): It follows from Proposition 5.8. ∎
8. Factorizations in the global
8.1. Semigroupoids
For the reader to situate himself better, we give some notation and recall some facts on semigroupoids. We refer to [24, 12, 34].
A semigroupoid is a graph endowed with two operations which give respectively the beginning and end vertices of each edge, and a partial associative multiplication on given by: for , is defined if and only if and, then, and . For a graph , the free semigroupoid on has as vertex-set and as edges the non-empty paths on .
Every semigroup may be viewed as a semigroupoid by taking the set of edges with both ends at an added vertex. Conversely, for a semigroupoid and a vertex of , the set of all loops at vertex constitutes an semigroup called the local semigroup of at .
A pseudovariety of semigroupoids is a class of finite semigroupoids closed under taking divisors of semigroupoids, and finitary direct products. The pseudovariety of all finite semigroupoids is denoted by .
From hereon, we assume that all semigroupoids have a finite number of vertices. A compact semigroupoid is a semigroupoid endowed with a compact topology on and the discrete topology in the finite set , with respect to which the partial operations , , and edge multiplication are continuous (see [6] for delicate questions related with infinite-vertex semigroupoids). Finite semigroupoids equipped with the discrete topology become compact semigroupoids. Let be a pseudovariety of semigroupoids. A compact semigroupoid is pro- if it is compact and every pair of distinct coterminal edges and can be separated by a continuous semigroupoid homomorphism into a semigroupoid of . For a finite graph , a compact semigroupoid is -generated if there is a graph homomorphism such that the subgraph of generated by is dense. We denote by the free pro- -generated semigroupoid. The semigroupoid has the usual universal property.
For each finite graph , the free semigroupoid generated by is dense in . The edges of are the nonempty paths on , whence the name pseudopath for the edges of . A generalization of Reiterman’s Theorem states that the pseudovarieties of semigroupoids are the classes of finite semigroupoids defined by pseudoidentities, that is formal identities between pseudopaths of finitely generated free pro- semigroupoids ([24, 12]).
We are mostly interested in two kinds of semigroupoid pseudovarieties induced by a semigroup pseudovariety : the pseudovariety of semigroupoids generated by (the global of ), and the pseudovariety of semigroupoids whose local semigroups belong to . One has , and if the equality holds, then the pseudovariety is said to be local.
Let be a finite graph. In general a pseudoidentity between edges and of is denoted , because if is a subgraph of , then a finite semigroupoid satisfying may not satisfy , see [34, pages 100 and 101]. However, if is a semigroup pseudovariety, then we can write a pseudoidentity satisfied by simply by , because in that case there is no dependence on [34, Theorem 2.5.15].
8.2. Semigroupoid versions of previous definitions and results
Several basic concepts for semigroups carry on to semigroupoids without substantial modifications. For example, in a semigroupoid one may consider the Green relations between edges, an edge is regular if for some edge of , etc. Definitions 6.6 and 6.8 also carry on to (pseudovarieties of) semigroupoids with no real modifications: just replace pseudowords by pseudopaths, and words by paths. For example, an edge of is -regular if its canonical projection in is regular, where is a semigroupoid pseudovariety. Next are the semigroupoid versions of Propositions 6.10 and Corollary 6.11, for which entirely analogous proofs hold.
Proposition 8.1**.**
Let be a pseudovariety of semigroupoids and let a finite graph. Suppose that is an edge of with a factorization multiregularly organized in , where is a semigroupoid pseudovariety. Then there is an edge in and a set of pseudoidentities over satisfying the following conditions:
- (1)
; 2. (2)
* has a factorization multiregularly organized in and with short -breaks;* 3. (3)
if belongs to , then and are -multiregulars.∎
Corollary 8.2**.**
Let and be pseudovarieties of semigroupoids, with being an organizing pseudovariety. Then has a basis of pseudoidentities with factorizations multiregularly organized in and with short -breaks.∎
8.3. The interval
We denote by the class of finite semigroups whose set of regular elements is a subsemigroup of . Although is not a pseudovariety, the class is a semigroup pseudovariety, with
[TABLE]
as the regular elements of a semigroup of are its group elements. Note also that (8.1) yields the following corollary of Proposition 5.8.
Corollary 8.3**.**
The pseudovariety is closed under bideterministic product.∎
Denote by the subgraph, of the semigroupoid , formed by the regular edges of . Let be the class of finite semigroupoids such that is a subsemigroupoid of . Here is the class of finite semigroupoids whose local semigroups belong to .
Proposition 8.4**.**
The equality holds.
Proof.
Clearly, for every semigroupoid , and every vertex of , an element of the local semigroup of at is regular in if and only if it is regular in . Therefore, the inclusion is immediate.
Conversely, let , and let be consecutive regular edges of . Take edges and such that and . Note that and are idempotents rooted at the vertex . Since and are regular elements of the local semigroup at , we know that for some loop belonging to . We then have
[TABLE]
thus showing that the edge is regular in . ∎
Corollary 8.5**.**
For any finite graph , every product of regular edges of is a regular edge of .∎
8.4. Honest pseudovarieties
Recall that a semigroupoid homomorphism is faithful if it maps distinct coterminal edges to distinct coterminal edges.
Proposition 8.6** ([2]).**
If is a pseudovariety of semigroups, then the unique continuous semigroupoid homomorphism from onto that maps to , for every , is a faithful homomorphism.
The next proposition brings nothing new, but we did not find a direct reference for it. The content of a pseudopath of is the subgraph of where satisfies . For pseudopaths , we write when is a subgraph of .
Proposition 8.7**.**
Let be a pseudovariety of semigroupoids in the interval . Let be a finite graph. Suppose that the edge of is regular in , and let be an edge of such that . Then we have if and only if .
Proof.
If , then holds because contains , whence . Conversely, suppose that . As is -regular, there is such that (which implies that is idempotent), and the graph is strongly connected. Therefore, and since , there is a path in such that and . We may then consider the idempotent loop of . Because , we also have and . Applying Proposition 8.6, we get , thus . Therefore, , establishing . ∎
Definition 8.8**.**
A pseudovariety of semigroups is honest if, for every finite graph , and such that is a product of regular elements of , the following conditions hold:
- (1)
when , one has ; 2. (2)
when , one has .
Proposition 8.9**.**
The semigroup pseudovarieties in the intervals and are honest.
Proof.
Suppose that . Let and be as in Definition 8.8, with (the case is symmetric). By Lemma 6.3, the projection of in , still denoted , is a -reduced multiregular in . Applying Lemma 6.5, from we get . It follows from Proposition 8.7 that , whence .
Finally, if , then a product of regular elements of is a regular element of , by Proposition 8.4. Therefore, implies by Proposition 8.7 also in this case. ∎
We leave open the problem of identifying all the honest pseudovarieties.
Proposition 8.10**.**
Let be a honest pseudovariety of semigroups that is closed under bideterministic product. Suppose is a semigroup pseudovariety containing and such that is an organizing pseudovariety. Then is multiregularly based in .
Proof.
By Corollary 8.2, the global has a basis formed by edge pseudoidentities with pseudopath factorizations
[TABLE]
that are both organized in and with short -breaks. Projecting in and seeing these factorizations as pseudowords factorizations, we see that they are multiregularly organized in and with short -breaks, the latter property holding because is honest. Combining with and Theorem 7.2, we get that , and for every and . In particular, we have the equalities and . Therefore, by Proposition 8.6, we have , for every .
As the integer depends on , we denote it by . For each , consider the set of pseudopath pseudoidentities defined by . Take the union Then, in view of the conclusion at which we arrived in the previous paragraph, we have , an equality whose detailed justification follows exactly the same argument as in the last lines of the proof of Corollary 7.3. ∎
Corollary 8.11**.**
Suppose that is a pseudovariety closed under bideterministic product and belonging to one of the intervals or . Then is multiregularly based.
Proof.
The pseudovariety is organizing by [9, Proposition 4.2]. Therefore, by Propositions 8.9 and 8.10, we know that is multiregularly based in . For each -multiregular pseudopath , take for each -regular pseudopath a pseudopath such that , and let . Note that is an -multiregular pseudopath. Therefore, if is a basis for formed by pseudoidentities between -multiregular pseudopaths, then
[TABLE]
is a basis for , comprised solely by multiregular pseudopaths. ∎
9. Preservation of locality inside
the interval
A pseudovariety of semigroups is monoidal if it is of the form , for some pseudovariety of monoids .
Theorem 9.1** ([19]).**
Let be a monoidal pseudovariety of semigroups. If is local then the pseudovarieties of semigroups {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}, {\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} and \mathscr{L}{\mathsf{I}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} are also local monoidal pseudovarieties of semigroups.
In this section we show that an analog of Theorem 9.1 is valid for the operator when restricted to the interval . It already follows from Corollary 3.13 that is monoidal when is monoidal. To proceed, we need the following lemma.
Lemma 9.2**.**
Let be a pseudovariety of semigroups such that {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} and {\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} are local pseudovarieties. If the pseudopaths and are loops such that , then we have \ell({\mathsf{N}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}})\models\pi^{\omega}=\pi^{\omega}\rho=\rho\pi^{\omega}=\rho^{\omega}.
Proof.
By the easy part of the Pin-Weil basis theorem for Mal’cev products [32], and by Proposition 8.6, we have g({\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}})\models\pi^{\omega}\rho=\pi^{\omega} and g({\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}})\models\rho\pi^{\omega}=\pi^{\omega}. Since the intersection {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}\cap{\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} contains (it is actually equal to) the pseudovariety {\mathsf{N}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}, and since {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} and {\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} are local by hypothesis, it follows in particular that \ell({\mathsf{N}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}})\models\pi^{\omega}\rho=\pi^{\omega}=\rho\pi^{\omega}. The latter implies
[TABLE]
On the other hand, the hypothesis is clearly equivalent to , and so we can interchange the roles of and in (9.1), which altogether implies \ell({\mathsf{N}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}})\models\pi^{\omega}=\rho^{\omega}\pi^{\omega}=\rho^{\omega}. ∎
The next proposition is the key to obtain the result we search for.
Proposition 9.3**.**
Let be a pseudovariety of semigroups. If {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} and {\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} are local, and if has a basis of pseudoidentities between pseudopaths that are regular in , then is local.
Proof.
Let be a pseudoidentity satisfied by such that and are regular in . The proof amounts to show that holds.
We may take a pseudopath such that
[TABLE]
and a pseudopath such that
[TABLE]
As , we have . Applying Lemma 9.2 to the latter (note that \ell{\mathsf{V}}\subseteq\ell({\mathsf{N}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}})) and observing that is idempotent in , we obtain
[TABLE]
In the pseudovariety , the pseudopath is an idempotent which is a prefix of , and so, in view of (9.3), a prefix of also. Therefore, we have
[TABLE]
Dually, we also have
[TABLE]
It follows from these facts that the pseudopath satisfies in the pseudoidentities and . Moreover, in we also have . Therefore, if necessary replacing by , we may suppose, as we do from hereon, that not only satisfies (9.2) and (9.3), but also . In particular, holds, whence . Then, as both and are idempotents in , applying Lemma 9.2 we obtain . It follows that . Replacing in the last term of this chain of pseudoidentities by by means of (9.3), we get , concluding the proof. ∎
We are now ready to deduce the main result of this section.
Theorem 9.4**.**
Let be a monoidal pseudovariety of semigroups in the interval . If is local, then is local.
Proof.
By Theorem 9.1, both {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} and {\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} are local. By Theorem 2.4, {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} and {\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} are closed under bideterministic product, so
[TABLE]
Then we have the equality {\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}={\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}\overline{{\mathsf{V}}} and, by duallity, {\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}={\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}\overline{{\mathsf{V}}}.
By Corollary 8.11, has a basis of pseudoidentities between multiregular pseudopaths. On the other, note that , as is closed under bideterministic product. In view of Proposition 8.4, it follows that has a basis of pseudoidentities between pseudopaths that are regular in , and thus in .
Altogether, the result then follows directly from Proposition 9.3. ∎
Let be the pseudovariety of finite groups and let be the pseudovariety of finite Abelian groups. It is proved in [26] that is local, but not . In contrast, we have the following.
Corollary 9.5**.**
For every pseudovariety of finite groups, the pseudovariety is local.
Proof.
It is shown in [25] that is local. Applying Theorem 9.4, we deduce that is local (cf. Example 3.8). ∎
Taking into account that every pseudovariety of bands is local [25], or that is local for every pseudovariety of groups [23], one finds in Example 3.9 other local pseudovarieties resulting from Theorem 9.4.
10. Interplay with the semidirect product with
Let be a unary operator on a sublattice of semigroup pseudovarieties containing , mapping monoidal pseudovarieties to monoidal pseudovarieties. A monoidal pseudovariety of semigroups containing is local if and only if , if and only if [36]. Therefore, is local if is local and the following inclusions hold:
[TABLE]
Theorem 9.1 was proved in [19] using this strategy. Indeed, these inclusions hold for each pseudovariety of semigroups containing when is one of the operators {\mathsf{V}}\mapsto{\mathsf{K}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} or {\mathsf{V}}\mapsto{\mathsf{D}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}. Other operators were considered in [19]. As observed in [19], for the operator {\mathsf{V}}\mapsto{\mathsf{N}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}} the first inclusion holds when , while the second fails for . In this section we verify that the strategy used in [19] does not work for the operator . While holds for many subpseudovarieties of (cf. Corollary 10.4), including , we have when . The latter follows from the next proposition, in view of the equality (cf. Example 3.8).
Proposition 10.1**.**
The pseudovariety is strictly contained in .
Before we proceed to the proof, recall from [1, Section 10.6] the so called -superposition homomorphism , the unique continuous extension of the mapping that sends words of length at most into the empty word and reads the consecutive factors of length in every word over with length at least . In the proof of Proposition 10.1 we only need to consider the case .
Proof of Proposition 10.1.
The inclusion follows immediately from the inclusion and by Corollary 5.10.
Consider the alphabet and the pseudowords and of . Since and have the same finite factors, the same set of finite prefixes, and the same set of finite suffixes, we have (cf. [20]). As and are products of idempotents, it follows from Corollary 5.6 that .
Let , , and . We have the factorizations
[TABLE]
Both factorizations are multiregularly organized with short ()-breaks. As is closed under bideterministic product, by Theorem 7.2 we have . This in turn implies that by [1, Theorem 10.6.12]. Since is contained in , we conclude that . ∎
Recall that the Brandt semigroup belongs to if and only if .
Lemma 10.2**.**
Let be a semigroup pseudovariety containing . If is multiregularly based, then is multiregularly based.
Proof.
In [5, Theorem 5.9] it is stated that if for a family of pseudoidentities, then , where is a certain graph canonically built from , with the pseudowords and seen as pseudopaths in . Hence, if the pseudoword is a regular factor of , say for some pseudoword , we have in particular , and the result follows. ∎
Recall that, for a positive integer , the pseudovariety of semigroups is defined by , and .
Proposition 10.3**.**
If is multiregularly based, then and are multiregularly based, for every .
Proof.
Let be a basis of such that, for each , both and are multiregular edges of . For each pseudoidentity in , let be the set of continuous semigroupoid homomorphisms from onto free profinite semigroups , with running the positive integers.
By [5, Theorem 3.2], we can pick a certain , for each pseudoidentity in , in such a way that
[TABLE]
Since and are multiregular edges, their homomorphic images and are multiregular pseudowords, establishing the proposition for .
Concerning , we make a proof by induction on . Beginning with case , we apply to the Almeida-Weil basis theorem [12, Theorem 5.3], as follows. For each , let be the set of families of elements of for which one has (actually, in a literal application of the Almeida-Weil basis theorem one has first , clearly equivalent to , as is a nonempty pseudoword). The Almeida-Weil basis theorem gives
[TABLE]
Fixed , consider the family . Note that we have , whence . On the other hand, the pseudoidentity is clearly a consequence of the pseudoidentity . We conclude that we actually have
[TABLE]
Therefore, it suffices to check that, fixed and , both and are multiregular. By hypothesis, there is a factorization such that is a regular edge of and is a product of regular edges of . Let be such that . Take with , for some (possibly empty) pseudopath . Since , and noting that , we have . It follows that , showing that is -equivalent to the regular pseudoword . Therefore, is a product of regular pseudowords. Symmetrically, as , the pseudoword is also a product of regular pseudowords. This shows the base step of the induction.
We proceed with the inductive step. If , then holds (cf. [1, Lemma 4.1]), thus . By the induction hypothesis, is multiregularly based. Since (cf. [5, Section 4]), it then follows from Lemma 10.2 that is multiregularly based. This reduces to the base case, thus proving that is multiregularly based. ∎
Corollary 10.4**.**
Suppose that is a semigroup pseudovariety belonging to one of the intervals or . If is closed under bideterministic product, then so is each of the pseudovarieties and , for every . Therefore, if belongs to one of the intervals or , the inclusions and hold.
Proof.
If is closed under bideterministic product, then is multiregularly based by Corollary 8.11. Therefore, the pseudovarieties and are multiregularly based, by Proposition 10.3, which implies by Proposition 5.8 that they are closed under bideterministic product. ∎
Example 10.5**.**
The pseudovariety is mutiregulary based, and therefore so is each of the pseudovarieties and .
Remark 10.6**.**
The existing proof that is local is a tour de force that does not depend on profinite methods [26]. Note that {\mathsf{DG}}={\mathsf{IE}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{Sl}}, where , so that \mathscr{L}{\mathsf{DG}}={\mathsf{IE}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathscr{L}{\mathsf{Sl}}}, as proved in [19, Appendix A]. Since is local, one has , where is the semigroup pseudovariety generated by . Moreover, thanks to [19, Theorem 4.2], the inclusion {\mathsf{IE}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}({\mathsf{V}}(B_{2})*{\mathsf{D}})\subseteq({\mathsf{IE}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}(B_{2}))*{\mathsf{D}} holds. Therefore, we may hope for an alternative proof of the locality of consisting in showing that
[TABLE]
This inclusion is indeed true, but the arguments we have for its justification depend on the locality of . In this context, Example 10.5 is relevant, since it reduces the problem to the search of a “profinite” proof of the inclusion (10.1) to showing that {\mathsf{IE}}\mathop{\raise 1.0pt\hbox{\footnotesize\bigcirc\kern-8.0pt\raise 1.0pt\hbox{\tinym}\kern 1.0pt}}{\mathsf{V}}(B_{2})\models\pi=\rho whenever and are multiregular pseudowords such that .
For pseudovarieties not contained in , we have the following proposition. We omit the proof, because it is an exercise using the ideas in the proof of [18, Lemma 3.11] and none of the equational techniques that are the subject of this paper.
Proposition 10.7**.**
Suppose that is a semigroup pseudovariety such that and . If is closed under bideterministic product, then so is , for every .
We leave open the question of whether the condition in Proposition 10.7 is really necessary. As one example that it might not be, take the pseudovariety : on one hand, and , on the other hand is closed under bideterministic product for each , by the combination of Lemma 10.2, Proposition 10.3 and Proposition 5.8.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Almeida, J.: Finite Semigroups and Universal Algebra. World Scientific, Singapore (1995). English translation
- 2[2] Almeida, J.: A syntactical proof of locality of DA. Int. J. Algebra Comput. 6 , 165–177 (1996)
- 3[3] Almeida, J.: Profinite semigroups and applications. In: V.B. Kudryavtsev, I.G. Rosenberg (eds.) Structural theory of automata, semigroups and universal algebra, pp. 1–45. Springer, New York (2005)
- 4[4] Almeida, J., Azevedo, A.: On regular implicit operations. Portugal. Math. 50 , 35–61 (1993)
- 5[5] Almeida, J., Azevedo, A., Teixeira, L.: On finitely based pseudovarieties of the forms V ∗ * D and V ∗ * D n . J. Pure Appl. Algebra 146 , 1–15 (2000)
- 6[6] Almeida, J., Costa, A.: Infinite-vertex free profinite semigroupoids and symbolic dynamics. J. Pure Appl. Algebra 213 , 605–631 (2009)
- 7[7] Almeida, J., Costa, A.: Equidivisible pseudovarieties of semigroups. Publ. Math. Debrecen 90 , 435–453 (2017)
- 8[8] Almeida, J., Costa, A., Costa, J.C., Zeitoun, M.: The linear nature of pseudowords. Tech. rep. (2017). Ar Xiv:1702.08083, submitted
