Dynamical systems and ergodic theory Ergodic theory Concept
Kolmogorov–Sinai entropy
Summary
The Kolmogorov–Sinai entropy, or metric entropy, of a measure-preserving transformation measures how much new information each step of the map produces. It is defined from the Shannon entropy of finite partitions, refined along the orbit and taken per step. It is an isomorphism invariant. It tells apart systems with the same spectral data, such as two Bernoulli shifts whose probability vectors have different entropies. By the Ornstein isomorphism theorem it is a complete invariant for Bernoulli shifts.
Where this leads
9 pages build on this one.
Further reading
About this page
| Tag | X1D1C7VH6P |
|---|---|
| URI | m2://X1D1C7VH6P |
| Kind | concept |
| Writing | W0 stub |
| MSC | 37A35, 28D20 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- Baker's map
- Ornstein isomorphism theorem
- Kolmogorov automorphism
- Sinai's factor theorem
- Bernoulli scheme
- Variational principle for topological entropy
- Shannon–McMillan–Breiman theorem
- Dyadic transformation
Results about this
- Ornstein isomorphism theorem
- Sinai's factor theorem
- Variational principle for topological entropy
- Shannon–McMillan–Breiman theorem