Abstract
Classical information theory considers the Information \(\mathcal{I}\) on the lattice \((\mathfrak{P},\wedge ,\vee )\) of partitions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Compare Definition 9.10.
- 2.
It is surprising that the “opposite” orderings ≤ and \(\preccurlyeq \) coincide on \(\mathfrak{P}\).
- 3.
Here our requirement added to Definition 9.1 leads to the requirement that \(p(\omega )\neq 0\) for every \(\omega \in \Omega \). So \(\mathfrak{P}\) only has a largest element, if Ω is countable.
References
Adler, R.L., Konheim, A.G., & McAndrew, M.H. (1965). Topological entropy. Transactions of the American Mathematical Society, 114, 309–319.
Goodwyn, L.W. (1969). Topological entropy bounds measure-theoretic entropy. Proceedings of the American Mathematical Society, 23, 679–688.
Goodman, T. N.T. (1971). Relating topological entropy and measure entropy. Bulletin of the London Mathematical Society, 3, 176–180.
Walters, P. (1982). An introduction to ergodic theory. Berlin, Heidelberg, New York: Springer.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Palm, G. (2012). Information Theory on Lattices of Covers. In: Novelty, Information and Surprise. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29075-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-29075-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29074-9
Online ISBN: 978-3-642-29075-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)