Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I

This paper is concerned with the many deep and far reaching consequences of Ash's positive solution of the type II conjecture for finite monoids. After reviewing the statement and history of the problem, we show how it can be used to decide if a finite monoid is in the variety generated by the Malcev product of a given variety and the variety of groups. Many interesting varieties of finite monoids have such a description including the variety generated by inverse monoids, orthodox monoids and solid monoids. A fascinating case is that of block groups. A block group is a monoid such that every element has at most one semigroup inverse. As a consequence of the cover conjecture — also verified by Ash — it follows that block groups are precisely the divisors of power monoids of finite groups. The proof of this last fact uses earlier results of the authors and the deepest tools and results from global semigroup theory. We next give connections with the profinite group topologies on finitely generated free monoids and free groups. In particular, we show that the type II conjecture is equivalent with two other conjectures on the structure of closed sets (one conjecture for the free monoid and another one for the free group). Now Ash's theorem implies that the two topological conjectures are true and independently, a direct proof of the topological conjecture for the free group has been recently obtained by Ribes and Zalesskii. An important consequence is that a rational subset of a finitely generated free group G is closed in the profinite topology if and only if it is a finite union of sets of the form gH1H2…Hn, where g ∈ G and each Hi is a finitely generated subgroup of G. This significantly extends classical results of M. Hall. Finally, we return to the roots of this problem and give connections with the complexity theory of finite semigroups. We show that the largest local complexity function in the sense of Rhodes and Tilson is computable.

[1]  T. E. Hall,et al.  Finite semigroups with commuting idempotents , 1987, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[2]  Jan Reiterman,et al.  The Birkhoff theorem for finite algebras , 1982 .

[3]  J. Rhodes,et al.  Local Complexity of Finite Semigroups , 1976 .

[4]  John R. Stallings,et al.  Topology of finite graphs , 1983 .

[5]  Jean-Éric Pin Finite Group Topology and p-Adic Topology for Free Monoids , 1985, ICALP.

[6]  Jean-Eric Pin,et al.  A conjecture on the Hall topology for the free group , 1991 .

[7]  Bolyai János Matematikai Társulat,et al.  Algebraic theory of semigroups , 1979 .

[8]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[9]  Jean-Eric Pin,et al.  Product of Group Languages , 1985 .

[10]  John Rhodes New Techniques in Global Semigroup Theory , 1987 .

[11]  John Rhodes,et al.  Improved lower bounds for the complexity of finite semigroups , 1972 .

[12]  J. Rhodes Kernel systems—A global study of homomorphisms on finite semigroups , 1977 .

[13]  Robert Knast Some Theorems on Graph Congruences , 1983, RAIRO Theor. Informatics Appl..

[14]  Jean-Eric Pin,et al.  New results on the conjecture of Rhodes and on the topological conjecture , 1992 .

[15]  Marshall Hall,et al.  A Topology for Free Groups and Related Groups , 1950 .

[16]  Christophe Reutenauer,et al.  Sur mon article “une topologie du monoide libre” , 1981 .

[17]  Jean-Eric Pin Varietes de langages et monoide des parties , 1980 .

[18]  John Rhodes,et al.  Lower bounds for complexity of finite semigroups , 1971 .

[19]  J. Rhodes,et al.  Reduction theorem for the Type-II conjecture for finite monoids , 1990 .

[20]  Luis Ribes,et al.  On The Profinite Topology on a Free Group , 1993 .

[21]  G. Lallement Semigroups and combinatorial applications , 1979 .

[22]  J. L. Lions,et al.  INTRODUCTION TO SEMIGROUP THEORY , 1993 .

[23]  C. Ash Finite Idempotent-Commuting Semigroups , 1987 .

[24]  Jean-Eric Pin,et al.  Topologies for the free monoid , 1991 .

[25]  Peter R. Jones,et al.  Local Varieties of Completely Regular Monoids , 1992 .

[26]  Christophe Reutenauer,et al.  Une Topologie du Monoïde Libre , 1979 .

[27]  Stuart W. Margolis,et al.  Inverse semigroups and varieties of finite semigroups , 1987 .

[28]  John Rhodes,et al.  Decidability of complexity one-half for finite semigroups , 1982 .

[29]  Christopher J. Ash,et al.  Inevitable Graphs: a Proof of the Type II Conjecture and some Related Decision Procedures , 1991, Int. J. Algebra Comput..

[30]  Jorge Almeida,et al.  The algebra of implicit operations , 1989 .

[31]  Samuel Eilenberg,et al.  Algebra, topology, and category theory : a collection of papers in honor of Samuel Eilenberg , 1976 .

[32]  J. E. Pin On a conjecture of Rhodes , 1989 .

[33]  Bret Tilson Type II Redux , 1987 .

[34]  Karsten Henckell,et al.  Pointlike sets: the finest aperiodic cover of a finite semigroup , 1988 .

[35]  J. E. Pin A topological approach to a conjecture of Rhodes , 1988, Bulletin of the Australian Mathematical Society.

[36]  John L. Rhodes,et al.  Undecidability of the identity problem for finite semigroups , 1992, Journal of Symbolic Logic.

[37]  Jean-Camille Birget,et al.  Finite Semigroups Whose Idempotents Commute or Form a Subsemigroup , 1987 .

[38]  Jean Berstel,et al.  Transductions and context-free languages , 1979, Teubner Studienbücher : Informatik.

[39]  Jean-Eric Pin,et al.  Semigroups whose idempotents form a subsemigroup , 1992, Mathematical Proceedings of the Cambridge Philosophical Society.

[40]  Jean-Éric Pin Relational morphisms, transductions and operations on languages , 1988, Formal Properties of Finite Automata and Applications.