Hostname: page-component-5c6d5d7d68-7tdvq Total loading time: 0 Render date: 2024-08-18T14:36:45.664Z Has data issue: false hasContentIssue false

Generators and Bernoullian factors for amenable actions and cocycles on their orbits

Published online by Cambridge University Press:  06 November 2002

ALEXANDRE I. DANILENKO
Affiliation:
Department of Mathematics and Mechanical Engineering, Kharkov National University, 4 Freedom square, Kharkov, 61077, Ukraine (e-mail: danilenko@univer.kharkov.ua)
KYEWON K. PARK
Affiliation:
Department of Mathematics, College of Natural Science, Ajou University, Suwon 442-749, Korea (e-mail: kkpark@madang.ajou.ac.kr)

Abstract

Using the orbital approach to the entropy theory we extend from \mathbb{Z}-actions to general countable amenable group actions T (or provide new short proofs for) the following results: (1) the relative and absolute Krieger Theorem about finite generating partitions (and its infinite Rokhlin counterpart in the case h(T)=\infty); (2) the relative and absolute Sinai Theorem about Bernoullian factors; (3) the Thouvenot Theorem that every intermediate factor of a relatively Bernoullian action is also relatively Bernoullian; (4) the Thouvenot Theorem that a factor of T with the strong Pinsker property enjoys this property; (5) the Smorodinsky–Thouvenot Theorem that T can be spanned by three Bernoullian factors; (6) the Ornstein–Weiss isomorphism theory for Bernoullian actions of the same entropy (provided that they possess generating partitions with at least three elements); and (7) there are uncountably many non-equivalent completely positive entropy extensions of T of the same relative entropy.

In proving these theorems, we were able to bypass the machinery of Orstein and Weiss except for the Rokhlin lemma. It is shown that the language of orbit equivalence relations and their cocycles (unlike the standard dynamical one) is well suited for the inducing operation needed to settle (1), (5) and (6).

Type
Research Article
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)