On -approachability, entropy density and -free shifts

Abstract We study approximation schemes for shift spaces over a finite alphabet using (pseudo) metrics connected to Ornstein’s d metric. This leads to a class of shift spaces we call d -approachable. A shift space is d -approachable when its canonical sequence of Markov approximations converges to it also in the d sense. We give a topological characterization of chain-mixing d -approachable shift spaces. As an application we provide a new criterion for entropy density of ergodic measures. Entropy density of a shift space means that every invariant measure of such a shift space is the weak ^* limit of a sequence ₙ of ergodic measures with the corresponding sequence of entropies h (ₙ) converging to h (). We prove ergodic measures are entropy-dense for every shift space that can be approximated in the d pseudometric by a sequence of transitive sofic shifts. This criterion can be applied to many examples that were beyond the reach of previously known techniques including hereditary B -free shifts and some minimal or proximal systems. The class of symbolic dynamical systems covered by our results includes also shift spaces where entropy density was established previously using the (almost) specification property.