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 rewieving 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 each Hi is a finitely generated subgroup of G. This significantly extends classical results by 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. Division of Natural Sciences, New College of the University of South Florida, Sarasota, FL 34243, USA. University of Nebraska, Lincoln, NE 68588, USA. Sponsored in part by NSF DMS8703010 and the Center for Communications Information Sciences, University of Nebraska-Lincoln. LITP, Université Paris VI et CNRS, Tour 55-65, 4 Place Jussieu 75252 Paris Cedex 05, FRANCE and Bull Research and Development, rue Jean-Jaurès, 78340 Les Clayes-sous-Bois, FRANCE. Research on this paper was partially supported by PRC “Mathématiques et Informatique”. Dept. of Mathematics, University of California, Berkeley, CA 94720, USA. Sponsored in part by NSF grant DMS90–01734.