For a finite measurable partition ,Its conditional entropy of finite measurable partitions relative to isThe concavity of , equivalently conditioning reduces entropy, gives
SetThe chain rule and invariance give , so is a subadditive sequence. ThereforeThe Kolmogorov-Sinai entropy is over finite partitions.
Taking immediately shows that the infimum over arbitrary finite is at most . For the reverse inequality, apply Shearer's inequality to translates of a fixed finite inside a long interval. Every interior coordinate is covered times, while only boundary coordinates are lost. Subadditivity bounds the boundary contribution; division by the interval length and passage to the limit giveTaking the infimum proves
Articles by others on the same topic
There are currently no matching articles.