# Ornstein isomorphism theorem

Contents 1 Discussion 2 History 3 References 4 Further reading Discussion The theorem is actually a collection of related theorems. The first theorem states that if two different Bernoulli shifts have the same Kolmogorov entropy, then they are isomorphic as dynamical systems. The third theorem extends this result to flows: namely, that there exists a flow {displaystyle T_{t}} such that {displaystyle T_{1}} is a Bernoulli shift. The fourth theorem states that, for a given fixed entropy, this flow is unique, up to a constant rescaling of time. The fifth theorem states that there is a single, unique flow (up to a constant rescaling of time) that has infinite entropy. The phrase "up to a constant rescaling of time" means simply that if {displaystyle T_{t}} and {displaystyle S_{t}} are two Bernoulli flows with the same entropy, then {displaystyle S_{t}=T_{ct}} for some constant c. The developments also included proofs that factors of Bernoulli shifts are isomorphic to Bernoulli shifts, and gave criteria for a given measure-preserving dynamical system to be isomorphic to a Bernoulli shift.

A corollary of these results is a solution to the root problem for Bernoulli shifts: So, for example, given a shift T, there is another shift {displaystyle {sqrt {T}}} that is isomorphic to it.

History The question of isomorphism dates to von Neumann, who asked if the two Bernoulli schemes BS(1/2, 1/2) and BS(1/3, 1/3, 1/3) were isomorphic or not. In 1959, Ya. Sinai and Kolmogorov replied in the negative, showing that two different schemes cannot be isomorphic if they do not have the same entropy. Specifically, they showed that the entropy of a Bernoulli scheme BS(p1, p2,..., pn) is given by[3][4] {displaystyle H=-sum _{i=1}^{N}p_{i}log p_{i}.} The Ornstein isomorphism theorem, proved by Donald Ornstein in 1970, states that two Bernoulli schemes with the same entropy are isomorphic. The result is sharp,[5] in that very similar, non-scheme systems do not have this property; specifically, there exist Kolmogorov systems with the same entropy that are not isomorphic. Ornstein received the Bôcher prize for this work.

A simplified proof of the isomorphism theorem for symbolic Bernoulli schemes was given by Michael S. Keane and M. Smorodinsky in 1979.[6][7] References ^ Ornstein, Donald (1970). "Bernoulli shifts with the same entropy are isomorphic". Advances in Mathematics. 4: 337–352. doi:10.1016/0001-8708(70)90029-0. ^ Donald Ornstein, "Ergodic Theory, Randomness and Dynamical Systems" (1974) Yale University Press, ISBN 0-300-01745-6 ^ Ya.G. Sinai, (1959) "On the Notion of Entropy of a Dynamical System", Doklady of Russian Academy of Sciences 124, pp. 768–771. ^ Ya. G. Sinai, (2007) "Metric Entropy of Dynamical System" ^ Christopher Hoffman, "A K counterexample machine", Trans. Amer. Math. Soc. 351 (1999), pp 4263–4280 ^ M. Keane and M. Smorodinsky, "The finitary isomorphism theorem for Markov shifts",Bull. Amer. Math. Soc. 1 (1979), pp. 436–438 ^ M. Keane and M. Smorodinsky, "Bernoulli schemes of the same entropy are finitarily isomorphic". Annals of Mathematics (2) 109 (1979), pp 397–406. Further reading Steven Kalikow, Randall McCutcheon (2010) Outline of Ergodic Theory, Cambridge University Press Donald Ornstein (2001) [1994], "Ornstein isomorphism theorem", Encyclopedia of Mathematics, EMS Press Donald Ornstein (2008), "Ornstein theory" Scholarpedia, 3(3):3957. Daniel J. Rudolph (1990) Fundamentals of measurable dynamics: Ergodic theory on Lebesgue spaces, Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1990. ISBN 0-19-853572-4 Categories: Ergodic theorySymbolic dynamics

Si quieres conocer otros artículos parecidos a Ornstein isomorphism theorem puedes visitar la categoría Ergodic theory.

Subir

Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información