The identities of the free product of a pair of two-element monoids
Mikhail Volkov

TL;DR
This paper proves that the identities of the free product of any pair of two-element monoids cannot be finitely axiomatized, highlighting complexity in their algebraic structure.
Contribution
It establishes that the identities of free products of two-element monoids have no finite basis, a novel result in algebraic theory.
Findings
No finite basis for identities of free products of two-element monoids
Identifies complexity in algebraic identities of simple monoids
Extends understanding of free product structures
Abstract
Up to isomorphism, there exist two non-isomorphic two-element monoids. We show that the identities of the free product of every pair of such monoids admit no finite basis.
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.
The identities of the free product
of a pair of two-element monoids
M. V. Volkov
Institute of Natural Sciences and Mathematics, Ural Federal University, Lenina 51, 620000 Ekaterinburg, Russia
Abstract.
Up to isomorphism, there exist two non-isomorphic two-element monoids. We show that the identities of the free product of every pair of such monoids admit no finite basis.
Let stand for the semigroup defined by the semigroup presentation ; in other words, is the free product of two one-element semigroups (in the category of semigroups). It is known (and easy to verify) that is the only free product in the category of semigroups that satisfies a nontrivial identity [Shneerson, 1972]. Shneerson and the author [2017] have characterized the identities of and proved that these identities admit a finite basis.
In the present note we address the identities of free products in the category of monoids considered as algebras of type (2,0). If and are two monoids, then when constructing their monoidal free product , one has to amalgamate the identity elements of and . Therefore the free monoidal product of two one-element monoids is again the one-element monoid. Moreover, it is evident that the product is isomorphic to one of its factors whenever the other factor is the one-element monoid. In view of this observation, if we want the operation of free product to produce something new, we have to assume that both and contain at least two elements. On the other hand, if one of the factors of contains at least three elements, cannot satisfy any nontrivial identity. Indeed, let and , say. Take and let be such that . Then it is easy to see that the elements and generate a free subsemigroup in the free product .
Thus, studying identities of the free product makes sense only if both and consist of two elements. Up to isomorphism, there exist two non-isomorphic two-element monoids: one is the two-element idempotent monoid, which we denote by , and the other one is the two-element group, which we denote by . Therefore, up to isomorphism, the free products to be considered are , , and . These free products can be defined by the following monoid presentations:
[TABLE]
The monoid defined by the presentation (1) is denoted . Observe that the monoid presentation (1) looks exactly as the semigroup presentation used above to define the semigroup , whence the monoid is nothing but the semigroup with identity element adjoined. Shneerson and the author [2017] have shown that the identities of with identity element adjoined are not finitely based.
It is easy to see that the presentation (2) defines a group known in the literature as the infinite dihedral group . The group is an extension of the infinite cyclic group generated by the element by the two-element group; in particular, is a metabeian group. A general result by Sapir [1987] implies that if the semigroup identities of a group are finitely based and is an extension of an abelian subgroup by a group of finite exponent, then either is abelian or has finite exponent; see [Sapir, 1987, Proposition 6]. Applying this result to , we conclude that the semigroup identities of are not finitely based. Observe that, in contrast, the group identities of are finitely based; this follows from another general result, due to Cohen [1967], who proved that the group identities of any metabelian group admit a finite basis.
Thus, it remains to analyze the identities of the monoid defined by the presentation (3). This monoid is generated by an idempotent and an involution, and we denote it by , having in mind Kuratowski’s closure-complement theorem111The classic version of Kuratowski’s closure-complement theorem basically describes the monoid generated by two operators on subsets of an arbitrary topological space: the operator of taking the closure of a subset and the operator of forming the complement of a subset; see the excellent survey by Gardner and Jackson [2008] for quite a comprehensive treatment. Many generalizations have been considered in which the operator of taking closure has been substituted by various idempotent operators while the operator of forming complement has been substituted by various involutive operators; some of these generalizations are surveyed in [Gardner and Jackson, 2008, Subsection 4.2]. Clearly, all monoids of operators arising this way are homomorphic images of the monoid .. The main result of the present note is the following
Theorem 1**.**
The identities of the monoid are not finitely based.
We prove Theorem 1 re-using the technique that was applied by Shneerson and the author [2017] to prove the analog of this theorem for the monoid . (In fact, the same technique could have been applied to show the absence of a finite basis for the semigroup identities of the group .) The technique stems from Auinger et al. [2015]; in order to present it, we need to recall three concepts.
The first concept is that of Mal’cev product. The Mal’cev product of two classes of semigroups and , say, is the class \mathbf{A}\mathop{\hbox{\bigcirc\kern-9.5pt\raise 1.0pt\hbox{\scriptsizem}\kern 1.5pt}}\mathbf{B} of all semigroups for which there exists a congruence such that the quotient semigroup lies in while all -classes that are subsemigroups in belong to . Notice that a -class forms a subsemigroup of if and only if the class is an idempotent of the quotient . We denote by and the classes of all commutative semigroups and all finite semigroups, respectively.
The next concept we need is that of a Zimin word. Let be a sequence of letters. The sequence of Zimin words is defined inductively by
[TABLE]
Observe that in the word the letter , , occurs times and the length of is .
Finally, recall a word is called an isoterm relative to a semigroup if the only word such that satisfies the identity is the word itself.
Now we state the main result of Auinger et al. [2015] in a form that it convenient for the use in the present note.
Theorem 2** ([Auinger et al., 2015, Theorem 6]).**
The identities of a semigroup have no finite basis provided that:
- (i)
* lies in the Mal’cev product \mathbf{Com}\mathop{\hbox{\bigcirc\kern-9.5pt\raise 1.0pt\hbox{\scriptsizem}\kern 1.5pt}}\mathbf{Fin}, and*
- (ii)
each Zimin word is an isoterm relative to .
Proof of Theorem 1.
From the definition of the free product, it readily follows that each non-identity element of the monoid can be uniquely represented as an alternating product of the generators and .
First we show that satisfies the condition (i) of Theorem 2. Consider the monoid defined by the following presentation:
[TABLE]
It is easy to compute that consists of 6 elements: , all of which except are idempotents. The map extends to a monoid homomorphism . The kernel of this homomorphism is a congruence on the monoid with two singleton classes and and four infinite classes:
[TABLE]
The infinite -classes and the -class are subsemigroups in . Clearly, the latter subsemigroup is commutative, and a direct computation shows that so are the four other subsemigroups. Thus, the monoid lies in the Mal’cev product \mathbf{Com}\mathop{\hbox{\bigcirc\kern-9.5pt\raise 1.0pt\hbox{\scriptsizem}\kern 1.5pt}}\mathbf{Fin}.
Now we aim to verify the condition (i) of Theorem 2, that is, we want to show that no non-trivial identity of the form may hold in . This verification repeats the argument used by Shneerson and the author [2017] for the monoid , but we reproduce it for the reader’s convenience. We induct on . Observe that the subsemigroup of is isomorphic to the additive semigroup of positive integers . It is well known that every identity satisfied by is balanced, that is, every letter occurs the same number of times in and in . Therefore if an identity of the form holds in , it must be balanced, and this immediately implies that for any such identity must be trivial. Now assume that our claim holds for some and let a word be such that the identity holds in . If we substitute 1 for in this identity, we conclude that also the identity
[TABLE]
should hold in . However, the word is nothing but the Zimin word and by the induction assumption we have . This, together with the fact that the identity must be balanced, means that the word is obtained from the Zimin word by inserting occurrences of the letter in the latter. If the insertion is made in a way such that the occurrences of alternate with occurrences of , then coincides with , and we are done. It remains to verify that any other way of inserting occurrences of in produces a word such that the identity fails in . Indeed, substitute for and for all other letters in this identity. The value of the left-hand side under this substitution is . On the other hand, since at least two occurrences of in the word are adjacent, we are forced to apply the relation at least once to get a representation of the value of the right-hand side as an alternating product of the generators and . Hence occurs less than times in this representation, and therefore, the value cannot be equal to .
Theorem 1 now follows from Theorem 2. ∎
Taking into account the discussion preceding the formulation of Theorem 1, we arrive at the following
Corollary 3**.**
For each pair of two-element monoids, the identities of their free product admit no finite basis.
Remark 1*.*
We have already mentioned in passing that our technique could have been used to verify that the semigroup identities of the group admit no finite basis. Inspecting the above proof of Theorem 1, the reader may see that this is indeed the case. The containment D_{\infty}\in\mathbf{Com}\mathop{\hbox{\bigcirc\kern-9.5pt\raise 1.0pt\hbox{\scriptsizem}\kern 1.5pt}}\mathbf{Fin} immediately follows from the fact that is an extension of the infinite cyclic group by the two-element group. The inductive proof that all Zimin words are isoterms relative to works also for with the following minimal adjustments: one has to change the generator of to the generator of and use the relation from the presentation (2) instead of the relation from the presentation (3).
Remark 2*.*
The similarity in the arguments used here and in [Shneerson and Volkov, 2017] to establish the absence of finite identity bases for each of the monoids , , and may lead one to the conjecture that some of the three monoids or perhaps all of them satisfy exactly the same identities. However, this is not the case. Indeed, the results of [Shneerson and Volkov, 2017] easily imply that the monoid satisfies the identity . This identity fails in both and as one can see by evaluating the variables and at the generators of the latter monoids. Further, since the group is an extension of the infinite cyclic group by the two-element group, the identity holds in , but it fails in and as again is revealed by evaluating the variables at the generators.
The observations just made suffice to claim that the sets , , and of identities holding in respectively , , and are pairwise distinct; moreover, the sets and are incomparable. In fact, one can show that satisfies the identity that fails in so that the sets and are incomparable as well. One can also show that is a proper subset of . These results rely on a characterization of which will be the subject of a separate paper.
Acknowledgements. The author acknowledges support from the Ministry of Education and Science of the Russian Federation, project no. 1.3253.2017, the Competitiveness Program of Ural Federal University, and from the Russian Foundation for Basic Research, project no. 17-01-00551.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Auinger et al. [2015] Auinger, K., Chen, Yuzhu, Hu, Xun, Luo, Yanfeng, and Volkov, M.V. [2015]: The finite basis problem for Kauffman monoids , Algebra Universalis 74 (3–4), 333–350.
- 2Cohen [1967] Cohen, D.E. [1967]: On the laws of a metabelian variety , J. Algebra 5 (3), 267–273.
- 3Gardner and Jackson [2008] Gardner, B.J., and Jackson, M.G. [2008]: The Kuratowski closure-complement theorem , New Zealand J. Math. 38 , 9–44.
- 4Sapir [1987] Sapir, M.V. [1987]: Problems of Burnside type and the finite basis property in varieties of semigroups , Izv. Akad. Nauk SSSR, Ser. Mat. 51 , 319–340 [in Russian; Engl. translation Math. USSR–Izv. 30 , 295–314].
- 5Shneerson [1972] Shneerson, L.M. [1972]: Identities in one-relator semigroups , Uchen. Zap. Ivanov. Gos. Pedag. Inst. 1 (1-2), 139–156 [in Russian].
- 6Shneerson and Volkov [2017] Shneerson, L.M., and Volkov, M.V. [2017]: The identities of the free product of two trivial semigroups , Semigroup Forum 95 (1), 245–250.
