From Surf Wiki (app.surf) — the open knowledge base
Ornstein isomorphism theorem
In mathematics, the Ornstein isomorphism theorem is a deep result in ergodic theory. It states that if two Bernoulli schemes have the same Kolmogorov entropy, then they are isomorphic.{{cite journal
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 T_t such that 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 T_t and S_t are two Bernoulli flows with the same entropy, then 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 \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,..., p**n) is given by
: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, 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.M. Keane and M. Smorodinsky, "Bernoulli schemes of the same entropy are finitarily isomorphic". Annals of Mathematics (2) 109 (1979), pp 397–406.
References
References
- 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) "[https://web.math.princeton.edu/facultypapers/Sinai/MetricEntropy2.pdf Metric Entropy of Dynamical System]"
- Christopher Hoffman, "[https://www.ams.org/journals/tran/1999-351-10/S0002-9947-99-02446-0/ A K counterexample machine]", ''Trans. Amer. Math. Soc.'' '''351''' (1999), pp 4263–4280
- M. Keane and M. Smorodinsky, "[https://www.ams.org/journals/bull/1979-01-02/S0273-0979-1979-14633-0/ The finitary isomorphism theorem for Markov shifts]",''Bull. Amer. Math. Soc.'' '''1''' (1979), pp. 436–438
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Ornstein isomorphism theorem — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report