Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on April 8, 2008
Bulletin of the London Mathematical Society 2008 40(3):375-383; doi:10.1112/blms/bdn017
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
40/3/375    most recent
bdn017v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rhodes, J.
Right arrow Articles by Steinberg, B.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

Closed subgroups of free profinite monoids are projective profinite groups

John Rhodes

Department of Mathematics
University of California at Berkeley
Berkeley, CA 94720
USA
rhodes@math.berkeley.edu

Benjamin Steinberg

School of Mathematics and Statistics
Carleton University
1125 Colonel By Drive
Ottawa
Ontario
Canada K1S 5B6

Received 30 November 2006. Revision received 16 October 2007.

We prove that the class of closed subgroups of free profinite monoids is precisely the class of projective profinite groups. In particular, the profinite groups associated to minimal symbolic dynamical systems by Almeida are projective. Our result answers a question raised by Lubotzky during the lecture of Almeida at the Fields Workshop on Profinite Groups and Applications, Carleton University, August 2005. We also prove that any finite subsemigroup of a free profinite monoid consists of idempotents.


2000 Mathematics Subject Classification 20F20, 20M07.

The second author was supported in part by NSERC.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.