Criteria for the density of the graph of the entropy map restricted to ergodic states
Henri Comman

TL;DR
This paper investigates conditions under which the entropy map's graph, restricted to ergodic states, is dense, providing criteria involving differentiability, large deviation principles, and convexity, with implications for equilibrium states.
Contribution
It introduces new criteria for the density of the entropy map graph in ergodic states, linking differentiability, large deviations, and convexity properties.
Findings
Criteria based on Gateaux differentiability of the pressure map.
Equivalence between density of the entropy graph and existence of a dense space of functions with unique equilibrium states.
Conditions involving large deviation principles and convexity properties.
Abstract
We consider a non-uniquely ergodic dynamical system given by a -action (or -action) on a non-empty compact metrisable space , for some . Let (D) denote the following property: The graph of the restriction of the entropy map to the set of ergodic states is dense in the graph of . We assume that is finite and upper semi-continuous. We give several criteria in order that (D) holds, each of which is stated in terms of a basic notion: Gateaux differentiability of the pressure map on some sets dense in the space of real-valued continuous functions on , level-2 large deviation principle, level-1 large deviation principle, convexity properties of some maps on for all . The one involving the Gateaux differentiability of is of particular relevance in the context…
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.
