Skip Navigation

Journal of the London Mathematical Society 1979 s2-20(2):347-357; doi:10.1112/jlms/s2-20.2.347
© 1979 by London Mathematical Society
This Article
Right arrow Full Text (PDF)
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 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 Ellis, M. H.
Right arrow Articles by Friedman, N. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

Subset Generators for Nonsingular Transformations

Martin H. Ellis and Nathaniel A. Friedman

Mathematics Department, Northeastern University Boston, Massachusetts 02115, U.S.A.
Mathematics Department, State University of New York at Albany Albany, New York 12222, U.S.A.

Let (X,B,m) be a separable probability space, and let {Ts:sisins} be an infinite collection of invertible bimeasurable nonsingular transformations of X onto X. A sufficient condition is given for the existence of a countable partition P of X for which the class {Tsp: pisinP, sisins} generates B (mod m). This condition is satisfied by every infinite subcollection of every freely acting group of transformations. Also, sufficient (and sometimes necessary) conditions are given for the existence of a set A in B for which {TsA : sisin|S} is dense in B.


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.