Abstract (EN):
It is well known that clopen subgroups of finitely generated free profinite groups are again finitely generated free profinite groups. Clopen submonoids of free profinite monoids need not be finitely generated nor free. Margolis, Sapir and Weil proved that the closed submonoid generated by a finite code (which is, in fact, clopen) is a free profinite monoid generated by that code. In this note we show that a clopen submonoid is free profinite if and only if it is the closure of a rational free submonoid. In this case its unique closed basis is clopen, and is, in fact, the closure of the corresponding rational code. More generally, our results apply to free pro-H monoids for H an extension-closed pseudovariety of groups.
Language:
English
Type (Professor's evaluation):
Scientific