Weak approximation of an invariant measure and a low boundary of the entropy, II
Boris Gurevich

TL;DR
This paper investigates how the entropy of a measurable map's invariant measure can be approximated from below using a converging sequence of invariant measures, highlighting the necessity of finite entropy assumptions.
Contribution
It provides a lower bound estimate for the Kolmogorov--Sinai entropy based on a sequence of invariant measures, emphasizing the importance of finite entropy partitions.
Findings
Lower bound estimate for entropy in terms of sequence measures
Finite entropy assumption is essential for the estimate
Explicit example demonstrating the necessity of the assumption
Abstract
For a measurable map and a sequence of -invariant probability measures that converges in some sense to a -invariant probability measure , an estimate from below for the Kolmogorov--Sinai entropy of with respect to is suggested in terms of the entropies of with respect to , , \dots. This result is obtained under the assumption that some generating partition has finite entropy. By an explicite example it is shown that, in general, this assumption cannot be removed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · advanced mathematical theories
