Generic points for dynamical systems with average shadowing

We study the Besicovitch pseudometric DB\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_B$$\end{document} for compact dynamical systems. The set of generic points of ergodic measures turns out to be closed with respect to DB\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$D_B$$\end{document}. It is proved that the weak specification property implies the average asymptotic shadowing property and the latter property does not imply the former one nor the almost specification property. Furthermore an example of a proximal system with the average shadowing property is constructed. It is proved that to every invariant measure μ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document} of a compact dynamical system one can associate a certain asymptotic pseudo orbit such that any point asymptotically tracing in average that pseudo orbit is generic for μ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mu $$\end{document}. A simple consequence of the theory presented is that every invariant measure has a generic point in a system with the asymptotic average shadowing property.


μ.
A simple consequence of the theory presented is that every invariant measure has

Introduction
The specification property or one of its variants are often applied in the theory of dynamical systems 1 to construct invariant measures with special properties (for example, measures of maximal entropy or equilibrium states, see [6,9]). These properties also help to define points with predetermined statistical behaviour like generic points or "non-typical" points, see [4,9]. Here, using the Besicovitch pseudometric, we show how to construct a certain asymptotic pseudo orbit associated with a given measure μ. This generalizes several proofs of existence of generic points for a given invariant measure, provided that a sufficiently strong tracing method is available in the system, e.g. see [7,8,[31][32][33][34].
The Besicovitch pseudodistance measures the average separation of points along two sequences in the space of all infinite X -valued sequences X ∞ = {{x n } ∞ n=0 : x n ∈ X } and is given for ρ(x n , x n ).
It extends naturally to a pseudometric on X given by the average separation of points along orbits of a dynamical system (X, T ), that is, where x, y ∈ X and ρ is a metric on X . An equivalent pseudometric is well known in the ergodic theory and symbolic dynamics asd -pseudometric, see [30,37]. A similar Weyl pseudodistance and the accompanying notion of quasi-unifrom convergence were also widely studied, see [13,18]. We prove that a point is generic for a non-necessarily ergodic measure if it asymptotically traces a special approximate trajectory (which in turn is a variant of the average asymptotic pseudoorbit), where the Besicovitch pseudodistance is used to define the pseudotrajectory and measures the accuracy of tracing. Recall that x ∈ X is generic for μ if lim n→∞ 1 n n−1 j=0 f (T j (x)) = X f dμ for every continuous f : X → R.
As a corollary we get that if a system has the asymptotic average shadowing property (a notion introduced by Gu in [17], see below), then every invariant measure has a generic point, because in such a system every average asymptotic pseudo-orbit is followed by the orbit of some point. The same result is proved independently in [10] via a direct construction. We believe that using the Besicovitch pseudodistance provides a new perspective and leads to short proofs extending the theory (see the proof of Theorem 21 and Example 23).
In order to compare our result with earlier developments, recall that generic points have full measure for every ergodic invariant measure, but non-ergodic invariant measures need not to have generic points. Sigmund proved that if a dynamical system has the periodic specification property (see [32]), then every invariant measure has a generic point. Many authors generalized this result.
We show that yet another variant of specification, known as the weak specification property implies the asymptotic average shadowing property. This together with results of [19] gives us the following diagram illustrating the connections between main generalizations of specification (we refer the reader to [22] for more details; here "AASP" stands for "(the) asymptotic average shadowing property"): Weak sp ecification AASP

Specification Almost sp ecification
It is proved in [23] that there are systems with the weak specification property, but without the almost specification property, hence there are systems with the asymptotic average shadowing property, but without almost specification property. This answers a problem we considered in [19]. We finish the paper with an example demonstrating that there are proximal systems with the average shadowing property, which also answers some natural questions one may ask about properties of systems with a generalized shadowing.
This paper is organized as follows. In Sect. 2 we recall some standard definitions from topological dynamics and related fields. Section 3 discusses the definition and basic properties of the Besicovitch pseudometric. In Sect. 4 we show that a set of measures generated by an orbit varies continuously as a function from X equipped with the Besicovitch pseudometric to the space of compact subsets of invariant measures considered with the Hausdorff distance. It follows that the set of generic points of ergodic measures is a closed set with respect to the Besicovitch pseudodistance. Section 5 establishes the relation between weak specification property and asymptotic average shadowing property. Possible applications of our studies on Besicovitch pseudodistance are provided in Sect. 6. Section 7 contains an example of a proximal, mixing shift space exhibiting the average shadowing property, but neither almost nor weak specification.

Topological dynamics Notation
Throughout this paper a pair (X, T ) is a dynamical system. This means that X is a compact metric space and T : X → X is a continuous map. All properties of T considered here are invariants of topological conjugacy, hence they do not depend on the choice of metric. Therefore we fix a metric ρ for X and assume without loss of generality that the diameter of X is equal to 1.
Given a compact metric space Y and A ⊂ Y we denote by dist(y, A) the distance of a point y ∈ Y to the set A. For ε > 0 we write A ε for the ε-hull of A, that is the set {y ∈ X : dist(y, A) < ε}. Let 2 Y = {K ⊂ Y : K compact and K = ∅} and The upper asymptotic density of A ⊂ N 0 is as usual denoted byd(A) and given bȳ n .
If the above upper limit is in fact a limit, we denote it by d(A) and call the asymptotic density of A.

Recurrence properties
Recall that T is transitive if for all non-empty open sets U, V ⊂ X there exists n ≥ 0 such that T n (U ) ∩ V = ∅. We say that T is (topologically) mixing if for all nonempty open sets U, V ⊂ X there exists N ≥ 0 such that for all n ≥ N one has T n (U ) ∩ V = ∅. A map T is (topologically) weakly mixing if the product map T × T is transitive. Finally, T is chain mixing if for every δ > 0 and all x, y ∈ X there exists N ∈ N such that for every n ≥ N there is a finite sequence x 0 , x 1 , . . . , x n in X satisfying x 0 = x, x n = y, and ρ(T (x i−1 ), x i ) < δ for i = 1, . . . , n.

Average shadowing
Given ε > 0 we say that a sequence {x j } ∞ j=0 is ε-shadowed in average by a point A dynamical system (X, T ) has the average shadowing property if for every ε > 0 there exists δ > 0 such that every δ-average pseudo-orbit is ε-shadowed in average by some point. A system (X, T ) has the asymptotic average shadowing property if every asymptotic average pseudo-orbit of T is asymptotically shadowed in average by some point.

Weak specification
An orbit segment of a point x over an interval [a, b], where a ≤ b are nonnegative integers is the sequence Let N : N → N be any function. A family of orbit segments A dynamical system (X, T ) has the weak specification property if for every ε > 0 there is a nondecreasing function M ε : N → N with M ε (n)/n → 0 as n → ∞ such that any M ε -spaced specification is ε-traced by some point in X . We refer the reader to [22] for more information about specification.

Invariant measures
Let M(X ) be the set of all Borel probability measures on X . Let It is well known that the topology induced by − → d is the weak * topology on M(X ). A measure μ ∈ M(X ) is: We denote by M T (X ) ⊂ M(X ) the family of all T -invariant measures and by M e T (X ) the family of all ergodic measures. The measure center of (X, T ) is the smallest closed subset F of X such that μ(F) = 1 for every T -invariant measure μ.
For x ∈ X letδ(x) ∈ M(X ) be the Dirac measure supported on {x}. Given x = {x j } ∞ j=0 ∈ X ∞ and n ∈ N we define an empirical measure: .
If T is clear from the context, then we write m(x, n) for m T (x, n). We call such a measure an empirical n=0 converges to μ in the weak * topology. The set of generic points of μ is denoted Gen(μ). A The set of all distribution measures of a sequence x is denoted byω(x). Clearly,ω(x) is a closed and nonempty subset of

Symbolic dynamics
Let A be a finite set of symbols with discrete topology. Let A ∞ be a product topological spaces. By σ we denote the continuous onto map from A ∞ to itself given by σ (ω) i = ω i+1 , where ω = (ω i ) ∈ A ∞ . A shift space is a nonempty, closed, and σ -invariant subset of A ∞ . For more details on symbolic dynamics we refer to [25].

Besicovitch pseudometric
To elucidate the construction of generic points we introduce the Besicovitch pseudometric. Recall that a pseudometric on X is a function p : X × X → [0, ∞) which is symmetric, obeys the triangle inequality, and p(x, x) = 0 for all x ∈ X . Every pseudometric space is a topological space in a natural manner, and most notions defined for metric spaces, like the (uniform) equivalence of metrics, remain meaningful for pseudometric spaces.
Recall that X ∞ denotes the set of all sequences indexed with nonnegative integers with entries in X . Given T : X → X we can define a map (also denoted by T ) on X ∞ by We define the shift map on X ∞ by σ (x) n = x n+1 for n ∈ N 0 and x = {x n } ∞ n=0 ∈ X ∞ . We can restate the definition of a pseudo orbit in our notation as follows: a sequence It turns out that in order to construct invariant measures and generic points it is convenient to work with the following pseudometric on X ∞ .
The Besicovitch pseudometric on (X, T ), also denoted by D B , equals the D B -distance between orbits, that is, It is easy to see that these functions are indeed pseudometrics on X ∞ and X , respectively. Furthermore, D B is σ -invariant on X ∞ and T -invariant on X . Besicovitch used a similar pseudodistance in his study of almost periodic functions, but the idea of measuring the average distance along two orbits in a dynamical systems is so natural that probably it has been reinvented independently by many authors, see Aulsander [2] who mentions earlier works of Fomin and Oxtoby, or [5,11,12,15,28] for more recent applications.
The pseudometric D B depends on ρ but this is not reflected in our notation because we will show that equivalent metrics induce uniformly equivalent Besicovitch pseudometrics.

Lemma 2 Let X be a compact metric space and ρ be a compatible metric on X . Then the Besicovitch pseudometric and the pseudometric D B on X
Proof Given x, z ∈ X ∞ and δ > 0 we define Summing the above from n = 0 to N − 1, dividing by N and passing with N to infinity we get Note also that To prove the claim assume that D B (x, z) < ε/2 and use (2) to see that the right hand side of (1) is strictly smaller than ε. This proves our claim and yields uniform continuity Then by the first inequality in (1) and the definition of δ we see that Lemma 2 yields immediately the following corollary (for a proof it is enough to note that if ρ andρ are uniformly equivalent, then so are D B andD B ).

Corollary 3 Letρ be another compatible metric on X andD B andD B be defined as above withρ in place of ρ. ThenD B and D B are uniformly equivalent on X ∞ .
We will now prove that if (X, σ ) is a shift space (symbolic dynamical system), then the Besicovitch pseudometric is uniformly equivalent with thed-pseudometric measuring the upper asymptotic density of the set of coordinates at which two symbolic sequences differ. This is probably a folklore, but for completeness we present a proof inspired by [13].
Let (X, T ) be a dynamical systems and x ∈ X . We define x T to be the sequence and for any family F containing continuous functions from X to R we set Proof Using compactness it is easy to see that if the family F T separates the points of X , then there exists a sequence { f n } ∞ n=1 ⊂ F T separating the points of X , where f n = g n • T k(n) for some k(n) ≥ 0 and g n ∈ F. Let x, x ∈ X and n ≥ 1. Define

Theorem 4 Let (X, T ) be a dynamical system and let F be a uniformy equicontinuous and uniformly bounded family of real-valued functions on X such that
Take any sequence of weights {a n } ∞ n=1 ⊂ such that 0 < a n < 1 and where || · || ∞ denotes the sup norm. For y, z ∈ X define Note that ρ is a metric on X equivalent to ρ because f n 's are equicontinuous and separate the points of X .
By Corollary 3 the Besicovitch pseudometric D B associated with ρ is uniformly equivalent to D B . Therefore it is enough to check that D B (x, x ) < ε. We have The last inequality holds because we took is uniformly continuous. To prove that is uniformly continuous one can follow the reasoning as in the proof of Lemma 2 to conclude that thanks to the uniform boundedness of F it is enough to show that for every ε > 0 there exists The latter easily follows from uniform equicontinuity of F and Lemma 2.
Observe that any finite family F is uniformly equicontinuous and uniformly bounded. In particular, if X is the space of sequences over a finite alphabet and T is the shift map, then taking F = {ι 0 }, where ι 0 (x 0 x 1 x 2 . . .) = x 0 yields the following corollary.

Besicovitch pseudometric and invariant measures
We are going to show that the map x →ω(x) is a uniformly continuous map from X ∞ equipped with D B to the space of nonempty compact subsets of M(X ) equipped with the Hausdorff metric. n)) ≤ ε for all sufficiently large n.

Remark 9
It is easy to see that if x = {x n } ∞ n=0 ∈ X ∞ is a δ-average-pseudo-orbit for T , then D B (T (x), σ (x)) < δ.
For any continuous map T : X → X letT : M(X ) → M(X ) be given by the formulâ T (μ) = μ • T −1 . The proof of the following fact can be found in [9, Proposition 3.2] (see also [35,Theorem 6.7]).

Theorem 10 The mapT : M(X ) → M(X ) is continuous. Additionally,T is surjective if and only if T is surjective.
Proof Let μ ∈ω(x) and m(x, k n ) → μ as n → ∞, where {k n } ∞ n=0 is a strictly increasing sequence of nonnegative integers. For every Borel set B and every x ∈ X one hasδ( Because of the continuity ofT one haŝ To finish the proof fix ε > 0 and use Lemma 6 to pick δ > 0 for ε/2. Then (3) and (4).

Remark 12
A sequence x = {x n } ∞ n=0 is an asymptotic average pseudo orbit if and only if D B (T (x), σ (x)) = 0.
We finish this section with a yet another application of the Besicovitch pseudometric. Although we will not use this result we add it here since we belive it is of independent interest. Note that Weiss [37] proves the analog of Theorem 15 for symbolic system and convergence with respect to thed-pseudometric. By Corollary 5 Weiss' result follows from our theorem.
Theorem 14 ([29], Sect. 5) Let x ∈ X be generic for some μ ∈ M T (X ). Then the following conditions are equivalent: For all f ∈ C(X ) and α > 0 Theorem 15 Let {μ p } ∞ p=1 ⊂ M e T (X ) and {x p } ∞ p=1 ⊂ X ∞ be such that x p is a generic point for μ p for every p ∈ N. If x ∈ X is such that D B (x p , x) → 0 as p → ∞, then x is generic for some μ ∈ M e T (X ).
Proof By Theorem 7 the function (X ∞ , D B ) x →ω(x) ∈ M(X ), H M(X) is continuous, and so there exists μ ∈ M T (X ) such that μ p → μ as p → ∞ and x ∈ Gen(μ). We will show that μ ∈ M e T (X ). To this end we are going to show that the condition from Theorem 14 (2) is fulfilled. Fix f ∈ C(X ). Notice that for every k, n, p ∈ N we have Take any α > 0. Let P ∈ N be such that for every p ≥ P we have Then for every p ≥ P and any k we have Therefore it is enough to prove that for any ε > 0 we can find p ≥ P and K ∈ N such that for all k ≥ K the following inequalities hold Note that the second inequality above holds for each p and all sufficiently large k by Theorem 14. So assume that the first inequality fails for some parameter ε, that is, there exists ε 0 > 0 such that for all p ≥ P and every K ∈ N there is k Let δ > 0 be such that x , x ∈ X and ρ(x , We are going to show that (5) implies that there is a constant γ > 0 such that for all p ≥ P we haved But the inequality (6) cannot hold for all p, because it contradicts D B (x p , x) → 0 as p → ∞. Hence it remains to prove that (5) implies (6). Let k 0 be one of those k's for which (5) holds and let It follows from (5) that for each N 0 there exists n ≥ N 0 such that # B(n) ≥ nε 0 /4. For each m ∈ B(n) it is easy to see that Therefore for infinitely many n we have But the above inequality clearly yields (6).

Weak specification implies the asymptotic average shadowing property
In [19] it was proved that a surjective system with the almost specification property satisfies the asymptotic average shadowing property. On the other hand it follows from [23] that the notions of almost specification and weak specification are independent, that is there exist: a system with the weak specification property which does not have the almost specification property and a system satisfying the almost specification property without the weak specification property. In this section we will show that weak specification also implies the asymptotic average shadowing property. Recall that g : N × (0, ε 0 ) → N 0 , where ε 0 > 0, is a mistake function if for all ε < ε 0 and all n ∈ N we have g(n, ε) ≤ g(n + 1, ε) and g(n, ε)/n → 0 as n → ∞. Given a mistake function g we define a function k g : (0, ∞) → N by k g (ε) = min{n ∈ N : g(m, ε) < mε for all m ≥ n}. For 0 < ε < ε 0 and n ≥ k g (ε) large enough for the inequality g(n, ε) < n to hold we set Given x ∈ X , ε > 0, n ∈ N and a mistake function g we define a Bowen ball by B n (x, ε) = y ∈ X : ρ T j (x), T j (y) < ε for every 0 ≤ j < n and a Bowen ball with mistakes by B n (g; x, ε) = y ∈ X : {0 ≤ j < n : ρ(T j (x), T j (y)) < ε} ∈ I (g, n, ε) .
We also need the following: Lemma 16 ([22], Theorem 17) Let (X, T ) be a dynamical system. If T is surjective and has the weak specification property, then T is mixing.

Lemma 17
Let (X, T ) be a surjective dynamical system with the weak specification property and M ε (n) is the constant associated to ε > 0 and n ∈ N in the definition of the weak specification property. Assume we are given (1)

an increasing sequence of integers {α
Then, setting l j = j−1 s=0 n s for j ∈ N we can find z ∈ X such that for every j ∈ N we have where g : N × (0, 1) → N is given by g(n, ε) = M ε/2 (n).
The next theorem is an analog of [19,Theorem 3.5]. Although the weak specification property and the almost specification property are independent the proof follows the same lines.

Theorem 18
If a surjective dynamical system (X, T ) has the weak specification property, then it has the asymptotic average shadowing property.
Proof The proof [19, Theorem 3.5] relies on chain mixing of every surjective dynamical system with the almost specification property ([19, Lemma 3.2]) and [19,Lemma 3.4]. The latter result is analogous to Lemma 17 with the only difference, that the almost specification property is replaced by the weak specification property. Therefore the Theorem follows from the proof of [19,Theorem 3.5] with Lemma 16 and 17 used where [19,Lemma 3.2] and [19,Lemma 3.4] were applied in [19].

Remark 19
In fact, it was proved in [38,Corollary 6.9] that there is no need to assume that T is surjective in [19,Theorem 3.5]. We do not know whether the surjectivity assumption can be relaxed in Theorem 18.

Asymptotic average pseudo-orbits and periodic decompositions
Following Banks [3] we say that a collection D = {D 0 , . . . , D n−1 } of subsets of X is a regular periodic decomposition if the following conditions are satisfied: the intersection D i ∩ D j is nowhere dense whenever i = j, (4) n−1 i=0 D i = X . Before we state the main result of this section we make the following observation. We leave the proof to the reader.
Remark 20 Fix r > 0. Let {n k } ∞ k=0 ⊂ N be such that 0 = n 0 < n 1 < n 2 < . . . and n k = 0 (mod r ). Thend {s N : n=0 is an average asymptotic pseudo orbit for T and z = {z nr } ∞ n=0 is an average asymptotic pseudo orbit for T r .
Now we are ready to prove the following. for T such thatω(z) = V (note that Sigmund used different terminology). It is easy to see that actually [34, Remark 1] allows us to assume that z k = T k−s N (y N ) for s N ≤ k < s N +1 for some sequences {n k } ∞ k=0 ⊂ N and {y N } ∞ N =0 ⊂ D 0 such that 0 = n 0 < n 1 < n 2 < · · · and n k = 0 (mod r ). By Remark 20 the sequence z = {z nr } ∞ n=0 is an average asymptotic pseudo-orbit for T r and furthermore, by definition we obtain that also z ⊂ D 0 . Let x ∈ D 0 asymptotically trace on average z for T r . Then D B (z , x T r ) = 0 and using Remark 20 one more time we get D B (z, x T ) = 0. By Corollary 8 we haveω(x) =ω(z) = V which ends the proof.
Since it is proved in [19] that the almost specification property implies the average shadowing property and in Sect. 5 we have shown that the same follows from the weak specification property, Theorem 21 immediately implies the following corollary, which can be also found in [10] (with a different proof).

Corollary 22
If (X, T ) is surjective and has the relative weak specification property (or relative almost specification property), then for every asymptotic average pseudo orbit x = {x i } ∞ i=0 ∈ X ∞ there exists a point z such thatω(x) =ω(z). In particular, if V ⊂ M T (X ) is nonempty, closed and connected, then there is a point z ∈ X such thatω(z) = V and every T -invariant measure has a generic point. [7,8,[31][32][33][34].

Example 23
The following example shows that there are maps which do not have the asymptotic average shadowing property but have a regular periodic decomposition {D 0 , . . . , D r −1 } such that T r | D 0 satisfies the asymptotic average shadowing property.
By T k = R k /Z k we denote the k-dimensional torus. Let S : T k → T k be a toral automorphism whose associated linear map is nonhyperbolic but has no roots of unity as eigenvalues. It was proved in [24,26] that such an automorphism satisfies the weak specification property. Let n ≥ 2 and T n : T 1 → T 1 (see Fig. 1) be given by is a regular periodic decomposition for F n . Moreover, F n n | T k ×[0,1/n] is a product of two maps which have the weak specification property and hence satisfies it as well. To see that F n does not have the asymptotic average shadowing property notice that the Lebesgue measure is a fully supported invariant measure for F n . By [19,Theorems 3.7 & 4.3] any map with the asymptotic average shadowing and fully supported invariant The graph G (4,6) measure must be weakly mixing, but F n n is not even transitive as F n n T k × [0, 1/n] ⊂ T k × [0, 1/n] (see Fig. 2).

Shift space with the asymptotic shadowing property but without almost specification
In this section we show that the proximal dynamical system Y with positive entropy introduced in [27] has the average shadowing property and fully supported invariant measure. By [23,Theorem 5.3], a nontrivial proximal system like Y never has the almost specification property. Recall that a pair (x, y) ∈ X × X is proximal, if lim inf n→∞ ρ T n (x), T n (y) = 0.
A dynamical system is proximal if every pair (x, y) ∈ X × X is proximal. It remains open whether Y has the asymptotic average shadowing property. We recall the construction from [27]. Let A = {0, ♦} and let 1 < s < t be positive integers. We define a labelled graph G (s,t) = (V, E, i, t, L) over A in the following way (for the definition of labelled graph and sofic shift see [25]): . . , e t−s , e 1 , . . . , e s−1 ,ê 1 ,ê 2 ,ê 3 , L(e) = ♦, e = e i or e =ê 1 0, e = e i or e ∈ ê 2 ,ê 3 .
Denote by X (s,t) the shift space consisting of sequences over A which are labels of infinite paths on G (s,t) . In other words, x ∈ X (s,t) is a concatenation of blocks of s zeros separated by blocks of t − s or t − s + 1 symbols ♦ (Fig. 3). Denote by p (s,t) a periodic sequence of the form (♦ t−s 0 s ) ∞ ∈ A ∞ . Now, define the following subsets of {0, 1} ∞ : It is easy to verify that each F (s,t) is a shift in {0, 1} ∞ .
Let s i = 2 i and t i = 10 i . Define Note that It was proved in [27] that (10) implies that Y is a topologically mixing and proximal system with positive topological entropy. Let

Lemma 24 For every
Proof Fix ε > 0. Use (10) to find n > 0 such that Take x ∈ Y n . Define z by z j = 0 if there is i > n such that p (s i ,t i ) j = 0, and z j = x j otherwise. Then z ∈ Y andd(x, z) < ε.

Lemma 25
Let X be a shift space. If for every ε > 0 there is a shift space X ε with the average shadowing property such that X ⊂ X ε and for every x ∈ X ε there is z ∈ X withd(x, z) < ε, then X has the average shadowing property.
Proof Fix ε > 0. Let β > 0 be such thatd(x, x ) < β implies D B (x, x ) < ε/2 (the existence of such a β is guaranteed by Corollary 5). Consider shift space X β . Use the average shadowing property for X β to find δ > 0 such that every δ-average pseudoorbit for σ contained in X β is ε/2 traced on average. Let x be a δ-average pseudoorbit for σ contained in X . Since X ⊂ X β there is a point y ∈ X β which ε/2traces x in average. Use the assumption to find a point z ∈ X such thatd(y, z) < β.

Lemma 26
For every nonempty open set U ⊂ Y there is y ∈ Y such that N (y, U ) has positive upper density.
Proof Let z ∈ U and k be such that the cylinder set defined by z [0,k) is contained in U . Take any n > k such that t n − s n > k and = 0, and p j = ♦ otherwise. Then p ∈ ∞ i=n+1 P (s i ,t i ) and we claim that the set A = i : p [i,i+k) = ♦ k has positive upper density. To see this, note that and since p i = 0 and i ≥ k implies p [i−l,i−l+k) = ♦ k for l = −k + 1, −k + 2, . . . , 0 we haved We have t n −1 j=0 j + t n N = N, therefore for some j ∈ {0, 1, . . . , t n − 1} the set A j = (A + j) ∩ t n N has upper density at least γ /t n . For that j we construct a point y = y 0 y 1 y 2 . . . by then y ∈ Y and obviously by our construction we have that A j ⊂ N (y, U ), hence N (y, U ) has positive upper density.

Theorem 27
The shift space Y is mixing, has the average shadowing property, positive topological entropy and fully supported invariant measure.
Proof Proximality, positive topological entropy and topological mixing follows from [27]. Let U = {U n : n ∈ N} be the base for the topology on Y. Lemma 26 implies that for any open set U n ∈ U we can find an invariant measure μ n such that μ(U ) > 0 (e.g. see [16]). Then μ = ∞ n=1 2 −n μ n is a fully supported measure.
is the intersection of mixing sofic shifts for every N ∈ N, therefore Z N is a mixing sofic shift. Since every mixing sofic shift has the specification property, it follows from [20] that Z N has the asymptotic average shadowing property and so it also has the average shadowing property by [19]. Now Y has the average shadowing property by Lemmas 24 and 25.

Corollary 28
The subshift Y has the average shadowing property but does not have the almost specification property.
Proof By [23] minimal points are dense in the measure center of any dynamical system with the almost specification property. On the other hand, it follows from Theorem 27 that Y is a nontrivial (hence uncountable) proximal system whose measure center equals the whole space. Proximality implies that Y has a fixed point which is the unique minimal point in the system (e.g. see [1]). Therefore minimal points of Y can not be dense in the measure center and Y can not have the almost specification property.
Our last example shows that the assumptions of Lemma 25 can not be weakened. Given a shift space X over an alphabet A we define the finite type approximation of order m ∈ N of X by X m = {x ∈ A ∞ : ∀k ∈ N 0 ∃y ∈ X x [k,k+m] = y [0,m] }.
In other words X m is a shift of finite type determined by finite blocks of length m + 1 occurring in X (see [9, p.111]). The following lemma is probably well-known (cf. Proposition 3.62 in [21]).

Lemma 29
Let X be a mixing shift space. The following conditions are equivalent: (1) X is chain mixing, (2) X m is mixing for every m ∈ N.
Sketch of the proof Note that for every m the points in X m are in the one to one correspondence with δ m -chains in X , where δ m goes to 0 as m → ∞. To see this take a point x ∈ X m and for each j ∈ N 0 pick x ( j) in the cylinder in X determined by x [ j, j+m] . Furthermore, chain mixing is equivalent to mixing for systems with the shadowing property and all shifts of finite type have the shadowing property by [36].

Corollary 30
Let X be a mixing shift space. Then there exists a decreasing sequence X 0 ⊃ X 1 ⊃ · · · ⊃ X of mixing shifts of finite type such that X = ∞ n=1 X n .
Note that if X = ∞ n=1 X n and X 1 ⊃ X 2 ⊃ · · · ⊃ X then for every ε > 0 there is n such that dist(x, X ) < ε for each x ∈ X n . Next Theorem shows that this is not enough to imply the average shadowing property on the intersection and the condition inf{d(x, y) : x ∈ X, y ∈ X n } < ε for all n large enough in Lemma 25 is essential.

Theorem 31
There exists a decreasing sequence X 1 ⊃ X 2 ⊃ · · · ⊃ X of mixing sofic shifts such that the shift space X = ∞ n=1 X n is mixing but does not have the average shadowing property.
Since periodic points are dense and X is nontrivial, there exists a periodic point p ∈ X such that d({i : p i = 1}) = α > 0. Using p and 0 ∞ interchangeably it is not hard to construct an asymptotic average pseudo-orbit {y (i) } ∞ i=0 such that