Hamaker theory: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>ZéroBot
m r2.7.1) (Robot: Adding it:Teoria di Hamaker
 
en>Khazar2
m clean-up, MOS:HYPHEN, replaced: heavily- → heavily using AWB
 
Line 1: Line 1:
Alyson is the name people use to call me and I think it sounds quite great when you say it. To perform lacross is some thing he would never give up. Office supervising is  [http://cspl.postech.ac.kr/zboard/Membersonly/144571 clairvoyants] exactly where her primary  [http://medialab.zendesk.com/entries/54181460-Will-You-Often-End-Up-Bored-Try-One-Of-These-Hobby-Ideas- best psychic] earnings arrives from. My wife and I live in Mississippi and I love every working day residing right here.<br><br>Look into my site clairvoyance ([http://www.january-yjm.com/xe/index.php?mid=video&document_srl=158289 please click the next internet page])
In [[mathematics]], the '''Ornstein isomorphism theorem''' is a deep result for [[ergodic theory]].  It states that if two different [[Bernoulli scheme]]s have the same [[Kolmogorov entropy]], then they are isomorphic.<ref>Donald Ornstein, "Bernoulli shifts with the same entropy are isomorphic", ''Advances in Math.'' '''4''' (1970), pp. 337–352</ref><ref>Donald Ornstein, "Ergodic Theory, Randomness and Dynamical Systems" (1974) Yale University Press, ISBN 0-300-01745-6</ref> The result, given by [[Donald Ornstein]] in 1970, is important because it states that many systems previously believed to be unrelated are in fact isomorphic; these include all finite [[stationary stochastic process]]es, [[subshifts of finite type]] and [[Markov shift]]s, [[Anosov flow]]s and [[Sinai's billiards]], ergodic automorphisms of the ''n''-torus, and the [[GKW|continued fraction transform]].
 
==Discussion==
The theorem is actually a collection of related theorems. The first theorem states that if two different [[Bernoulli shift]]s have the same [[Kolmogorov entropy]], then they are [[isomorphism of dynamical systems|isomorphic as dynamical systems]].  The third theorem extends this result to [[flow (mathematics)|flows]]: namely, that there exists a flow <math>T_t</math> such that <math>T_1</math> 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 <math>T_t</math> and <math>S_t</math> are two flows with the same entropy, then <math>S_t = T_{ct}</math> for some constant ''c''.
 
A corollary of these results is that a Bernoulli shift can be factored arbitrarily: So, for example, given a shift ''T'', there is another shift <math>\sqrt{T}</math> that is isomorphic to it.
 
==History==
The question of isomorphism dates to [[von Neumann]], who asked if the two [[Bernoulli scheme]]s 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(''p''<sub>1</sub>, ''p''<sub>2</sub>,..., ''p''<sub>''n''</sub>) is given by<ref>Ya.G. Sinai, (1959) "On the Notion of Entropy of a Dynamical System", ''Doklady of Russian Academy of Sciences'' '''124''', pp. 768–771.</ref><ref>Ya. G. Sinai, (2007) "[http://web.math.princeton.edu/facultypapers/Sinai/MetricEntropy2.pdf Metric Entropy of Dynamical System]"</ref>
 
:<math>H = -\sum_{i=1}^N p_i \log p_i .</math>
 
The Ornstein isomorphism theorem, proved by [[Donald Ornstein]] in 1970, states that two Bernoulli schemes with the same entropy are [[isomorphism of dynamical systems|isomorphic]]. The result is sharp,<ref>Christopher Hoffman, "[http://www.ams.org/journals/tran/1999-351-10/S0002-9947-99-02446-0/ A K counterexample machine]", ''Trans. Amer. Math. Soc.'' '''351''' (1999), pp&nbsp;4263–4280</ref> in that very similar, non-scheme systems do not have this property; specifically, [[Kolmogorov system]]s with the same entropy are not isomorphic.  Ornstein received the [[Bôcher prize]] for this work.
 
A simplified proof of the isomorphism theorem was given by Michael S. Keane and M. Smorodinsky in 1979.<ref>M. Keane and M. Smorodinsky, "[http://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</ref><ref>M. Keane and M. Smorodinsky, "Bernoulli schemes of the same entropy are finitarily isomorphic". ''Annals of Mathematics'' (2) '''109''' (1979), pp 397–406.
</ref>  However, the original proof remains more powerful, as it provides a simple criterion that can be applied to determine if two different systems are isomorphic or not.
 
==References==
{{reflist}}
 
==Further reading==
* Steven Kalikow, Randall McCutcheon (2010) ''Outline of Ergodic Theory'', Cambridge University Press
* {{springer|author=D. Ornstein|title=Ornstein isomorphism theorem|id=Ornstein_isomorphism_theorem&oldid=27182}}
* Donald Ornstein (2008), "[http://www.scholarpedia.org/article/Ornstein_theory Ornstein theory]" Scholarpedia, '''3'''(3):3957.
 
[[Category:Ergodic theory]]
[[Category:Symbolic dynamics]]

Latest revision as of 04:59, 4 November 2013

In mathematics, the Ornstein isomorphism theorem is a deep result for ergodic theory. It states that if two different Bernoulli schemes have the same Kolmogorov entropy, then they are isomorphic.[1][2] The result, given by Donald Ornstein in 1970, is important because it states that many systems previously believed to be unrelated are in fact isomorphic; these include all finite stationary stochastic processes, subshifts of finite type and Markov shifts, Anosov flows and Sinai's billiards, ergodic automorphisms of the n-torus, and the continued fraction transform.

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 such that 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 and are two flows with the same entropy, then for some constant c.

A corollary of these results is that a Bernoulli shift can be factored arbitrarily: So, for example, given a shift T, there is another shift 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]

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, Kolmogorov systems with the same entropy are not isomorphic. Ornstein received the Bôcher prize for this work.

A simplified proof of the isomorphism theorem was given by Michael S. Keane and M. Smorodinsky in 1979.[6][7] However, the original proof remains more powerful, as it provides a simple criterion that can be applied to determine if two different systems are isomorphic or not.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

Further reading

  • Steven Kalikow, Randall McCutcheon (2010) Outline of Ergodic Theory, Cambridge University Press
  • Other Sports Official Kull from Drumheller, has hobbies such as telescopes, property developers in singapore and crocheting. Identified some interesting places having spent 4 months at Saloum Delta.

    my web-site http://himerka.com/
  • Donald Ornstein (2008), "Ornstein theory" Scholarpedia, 3(3):3957.
  1. ↑ Donald Ornstein, "Bernoulli shifts with the same entropy are isomorphic", Advances in Math. 4 (1970), pp. 337–352
  2. ↑ Donald Ornstein, "Ergodic Theory, Randomness and Dynamical Systems" (1974) Yale University Press, ISBN 0-300-01745-6
  3. ↑ Ya.G. Sinai, (1959) "On the Notion of Entropy of a Dynamical System", Doklady of Russian Academy of Sciences 124, pp. 768–771.
  4. ↑ Ya. G. Sinai, (2007) "Metric Entropy of Dynamical System"
  5. ↑ Christopher Hoffman, "A K counterexample machine", Trans. Amer. Math. Soc. 351 (1999), pp 4263–4280
  6. ↑ M. Keane and M. Smorodinsky, "The finitary isomorphism theorem for Markov shifts",Bull. Amer. Math. Soc. 1 (1979), pp. 436–438
  7. ↑ M. Keane and M. Smorodinsky, "Bernoulli schemes of the same entropy are finitarily isomorphic". Annals of Mathematics (2) 109 (1979), pp 397–406.
Retrieved from "https://en.formulasearchengine.com/index.php?title=Hamaker_theory&oldid=14062"