---
title: Almost Average Shadowing Property
url: https://www.emergentmind.com/topics/almost-average-shadowing-property
type: topic
---

# Almost Average Shadowing Property

Searching arXiv for the cited papers and closely related work on almost average shadowing.
Almost Average Shadowing Property, usually abbreviated **ALASP**, is a shadowing notion for a continuous self-map \(f:X\to X\) on a metric space \((X,d)\). In the formulation introduced by Mukta Garg and Ruchi Das, ALASP requires that every sequence whose one-step errors are small in the **limsup Cesàro sense** be traced, again in the limsup Cesàro sense, by a genuine orbit: for every \(\varepsilon>0\) there exists \(\delta>0\) such that any sequence \(\{x_i\}_{i\ge 0}\) with
\[
\limsup_{n\to\infty}\frac{1}{n}\sum_{i=0}^{n-1} d\big(f(x_i),x_{i+1}\big)<\delta
\]
is traced by some \(x\in X\) satisfying
\[
\limsup_{n\to\infty}\frac{1}{n}\sum_{i=0}^{n-1} d\big(f^i(x),x_i\big)<\varepsilon.
\]
This places ALASP between strict pseudo-orbit tracing and weaker density- or average-based shadowing schemes, and also explains why the notion is closely entangled with average chain transitivity, average chain mixing, and asymptotic average shadowing [1602.04586].

## 1. Formal definition and immediate comparison with average shadowing

The ambient setting is a dynamical system \((X,f)\), where \(X\) is a metric space with metric \(d\) and \(f:X\to X\) is continuous. Garg and Das define an **almost \(\delta\)-average-pseudo-orbit** to be a sequence \(\{x_i\}_{i\ge 0}\) such that
\[
\limsup_{n\to\infty}\frac{1}{n}\sum_{i=0}^{n-1} d\big(f(x_i),x_{i+1}\big)<\delta.
\]
Such a sequence is **\(\varepsilon\)-shadowed in average** by a point \(x\in X\) when
\[
\limsup_{n\to\infty}\frac{1}{n}\sum_{i=0}^{n-1} d\big(f^i(x),x_i\big)<\varepsilon.
\]
The map \(f\) has the **Almost Average Shadowing Property** if for every \(\varepsilon>0\) there exists \(\delta>0\) such that every almost \(\delta\)-average-pseudo-orbit is \(\varepsilon\)-shadowed in average by some point of \(X\) [1602.04586].

In the same paper, the standard **average-shadowing property** (ASP) is stated using a stronger pseudo-orbit hypothesis. A sequence \(\{x_i\}_{i\ge 0}\) is a \(\delta\)-average-pseudo-orbit if there exists \(N=N(\delta)>0\) such that for all \(n\ge N\) and all \(k\ge 0\),
\[
\frac{1}{n}\sum_{i=0}^{n-1} d\big(f(x_{i+k}),x_{i+k+1}\big)<\delta.
\]
Thus ALASP weakens the admissibility condition from uniform control over all sufficiently long sliding windows to a single limsup condition over initial segments. Because every \(\delta\)-average-pseudo-orbit is, in particular, an almost \(\delta\)-average-pseudo-orbit, ALASP implies ASP [1602.04586].

This distinction is central. ALASP is not defined by uniform coordinatewise control, nor by a density-one tracing requirement, but by Cesàro control of local defect and Cesàro control of tracing error. The adjective “almost” modifies the pseudo-orbit condition rather than the tracing clause in the original Garg–Das formulation [1602.04586].

## 2. Relation to neighboring notions and terminological variation

The literature surrounding average shadowing is terminologically non-uniform. Several nearby notions coexist, and different papers use “almost” in different ways. The following table summarizes the principal average-type notions that appear in the cited works.

| Notion | Pseudo-orbit condition | Tracing condition |
|---|---|---|
| ALASP | \(\limsup \frac1n\sum d(f(x_i),x_{i+1})<\delta\) | \(\limsup \frac1n\sum d(f^i(x),x_i)<\varepsilon\) |
| ASP | sliding-window average error \(<\delta\) | \(\limsup \frac1n\sum d(f^i(x),x_i)<\varepsilon\) |
| AASP | \(\lim \frac1n\sum d(f(x_i),x_{i+1})=0\) | \(\lim \frac1n\sum d(f^i(x),x_i)=0\) |
| AAASP | weak asymptotic average pseudo-orbit with limsup bound \(<\delta\) | average tracing with limsup bound \(<\varepsilon\) |

In Kulczycki–Kwietniak–Oprocha, the exact term **“almost average shadowing property”** is not introduced. That paper instead develops the relations among **almost specification**, **asymptotic average shadowing property** (AAvSh or AASP), and **average shadowing property** (AvSh), proving on compact surjective systems that
\[
\text{almost specification} \Longrightarrow \text{AAvSh} \Longrightarrow \text{AvSh}.
\]
It also records that under the classical shadowing property these average-type properties become equivalent to strong transitivity and specification conditions [1307.0120].

A similar terminological caution appears in Kwietniak–Łącka–Oprocha. There, the operative notion is again **AASP**, not ALASP, and the main measure-theoretic consequence is that AASP implies that every invariant measure has a generic point. That paper also proves that weak specification implies AASP and uses the Besicovitch pseudometric \(D_B\) as the main technical device [1603.04091].

Later work makes the ambiguity explicit. In the gluing-based framework of “Average shadowing revisited,” the label **ALASP** is not used as a formal term, but the paper identifies what it calls “almost average shadowing” with the strong-average property \(S(A,A)\), whereas ASP is identified with \(S(A',A)\), where \(A\) denotes strong average pseudo-orbits and \(A'\) weak average pseudo-orbits. In that notation, ASP implies ALASP because \(A\subset A'\) [2205.10769]. This suggests that the phrase “almost average shadowing property” has acquired more than one technical meaning across adjacent strands of the literature.

## 3. Average chains and global dynamical consequences

Garg and Das introduced ALASP together with a family of **average chain** notions. For \(\delta>0\) and \(x,y\in X\), a **\(\delta\)-average-chain** from \(x\) to \(y\) of length \(n\) is a finite sequence
\[
x_0=x,\ x_1,\dots,x_n=y
\]
for which there exists \(N\in\mathbb N\), \(N\le n\), such that for all \(N\le m\le n\),
\[
\frac{1}{m}\sum_{i=0}^{m-1} d\big(f(x_i),x_{i+1}\big)<\delta.
\]
The map \(f\) is **average chain transitive** if for any \(\delta>0\) and any \(x,y\in X\) there exists a \(\delta\)-average-chain from \(x\) to \(y\). It is **average chain mixing** if for any \(\delta>0\) and any \(x,y\in X\) there exists \(n_0\in\mathbb N\) such that for every \(n>n_0\) there is a \(\delta\)-average-chain from \(x\) to \(y\) of length \(n\) [1602.04586].

The elementary implications recorded in that paper are
\[
\text{transitivity}\Rightarrow \text{chain transitivity}\Rightarrow \text{average chain transitivity}
\]
and
\[
\text{mixing}\Rightarrow \text{chain mixing}\Rightarrow \text{average chain mixing}.
\]
These implications place average-chain notions below their classical chain analogues [1602.04586].

ALASP has substantially stronger consequences than average chain transitivity alone. If \(X\) is compact and \(f\) is surjective, then ALASP implies that \(f\) is **chain transitive**; in particular, the chain recurrent set satisfies \(CR(f)=X\). Under the same compact surjective hypotheses, ALASP also implies **chain mixing**. Since ALASP is preserved by iterates, the proof of chain mixing passes through total chain transitivity and the known equivalence between total chain transitivity and chain mixing on compact metric spaces [1602.04586].

Further, on a compact dynamical system, ALASP forces the chain recurrent set to consist of a **single chain component**. This excludes decomposition of \(CR(f)\) into distinct chain components and shows that ALASP imposes a strong coarse connectivity on the dynamics [1602.04586].

A separate recurrence consequence appears when minimal points are dense. If \(X\) is compact, \(f\) has ALASP, and the minimal points of \(f\) are dense in \(X\), then \(f\) is **totally strongly ergodic** [1602.04586].

## 4. Stability properties and permanence under constructions

One of the notable features of ALASP in the Garg–Das framework is its permanence under several standard operations. If \(f\) has ALASP, then every iterate \(f^k\), \(k>1\), also has ALASP. The proof is based on converting an almost \(\delta\)-average-pseudo-orbit for \(f^k\) into an almost \(\delta\)-average-pseudo-orbit for \(f\) by inserting the intermediate points \(f^j(y_m)\) between successive \(y_m\) [1602.04586].

ALASP is also stable under bounded products. If \((X,f)\) and \((Y,g)\) are bounded dynamical systems and both \(f\) and \(g\) have ALASP, then \(f\times g\) has ALASP on \(X\times Y\) with the product metric
\[
d^*((x_1,y_1),(x_2,y_2))=\max\{d_1(x_1,x_2),d_2(y_1,y_2)\}.
\]
The proof uses explicit upper-density estimates for the set of times at which one of the coordinatewise tracing errors exceeds a prescribed threshold [1602.04586].

The surrounding average-chain theory provides additional permanence statements. If \(f^k\) is average chain transitive for some \(k>1\), then \(f\) is average chain transitive. If \(f\) is Lipschitz and average chain mixing, then \(f\) is totally average chain transitive. Moreover, average chain mixing implies that \(f\times f\) is average chain transitive, and the same conclusion holds when \(f\) is totally average chain transitive [1602.04586]. These results are not themselves ALASP theorems, but they clarify the average-chain background in which ALASP was introduced.

## 5. Examples, counterexamples, and separations

The basic positive example is the class of **constant maps**. Garg and Das note that constant maps have ALASP: every pseudo-orbit, whether average or almost average, is followed by the constant orbit in the required averaged sense [1602.04586].

The simplest negative example is the two-point discrete system \(X=\{a,b\}\) with the permutation \(f(a)=b\), \(f(b)=a\). For every \(\delta>0\), Garg and Das construct an almost \(\delta\)-average-pseudo-orbit that cannot be \(\varepsilon\)-shadowed in average for \(\varepsilon=1/3\). Hence this two-cycle does **not** have ALASP [1602.04586].

ALASP is strictly stronger than ASP. Garg and Das record that the space \(X_1\) and map \(f_1\) from the noncompact examples of Kulczycki–Kwietniak–Oprocha have ASP but do not have ALASP. The same source also shows that compactness is essential for several implications among average-shadowing notions [1602.04586; 1307.0120].

Classical shadowing does not imply ALASP. On the Cantor set \(\mathfrak C_2=\{0,1\}^{\mathbb N}\) with its usual Cantor metric, the identity map has the shadowing property, but it does not have ALASP. In the argument reported by Garg and Das, every point is minimal and minimal points are dense, so Theorem 4.8 excludes ALASP [1602.04586].

Average chain mixing is also strictly weaker than ALASP. The same paper gives examples of systems that are average chain mixing but not chain transitive: a constant map on a metric space with more than one element, the identity map on a union of two disjoint circles, and the map \(f(i)=(i+2)\bmod 2k\) on the finite discrete space \(\{1,2,\dots,2k\}\). The authors explicitly note that the two-point 2-cycle shows that average chain mixing need not imply ALASP [1602.04586].

## 6. Extensions, measure-theoretic links, and later equivalence results

Although ALASP itself was introduced in [1602.04586], most later developments in the arXiv literature focus on adjacent notions such as ASP, AASP, mean ergodic shadowing, and density-based shadowing. In “On various definitions of shadowing with average error in tracing,” Kulczycki, Oprocha, and collaborators proved that almost specification implies AASP and that AASP implies ASP, without assuming surjectivity. They also established equivalent formulations of ASP in terms of \(M_\alpha\)-shadowing for every \(\alpha\in[0,1)\), weak asymptotic average shadowing, and shadowing of \(\delta\)-asymptotic-average pseudo-orbits [1406.5822].

The measure-theoretic significance of asymptotic average shadowing was sharpened in “Generic points for dynamical systems with average shadowing.” For compact dynamical systems, every invariant measure can be realized by an asymptotic average pseudo-orbit, and any point asymptotically tracing that pseudo-orbit in average is generic for the measure. Consequently, AASP implies that **every invariant measure has a generic point**. The proof uses continuity of the distribution-measures map with respect to the Besicovitch pseudometric \(D_B\), and it also shows that the set of generic points of ergodic measures is \(D_B\)-closed [1603.04091].

Gluing-based frameworks broaden the scope of average shadowing beyond continuous invertible maps. In the work of Medvedev and coauthors, the key structural assumption is a gluing property with summable rate function. Under strong gluing with \(\sum_k \phi(k)<\infty\), the system has average shadowing for weak-average pseudo-orbits, and hence also the stronger “almost average” behavior in the sense \(S(A,A)\). These papers treat discontinuous and non-invertible systems and emphasize perturbations that are small only on average rather than uniformly [2205.10769; 2202.13407].

A further development concerns **almost asymptotic average shadowing** rather than ALASP in the Garg–Das sense. Das and Bag proved for finitely generated free semigroup actions that the average shadowing property, weak asymptotic average shadowing property, mean ergodic shadowing property, almost asymptotic average shadowing property, asymptotic average shadowing property, and \(M_\alpha\)-shadowing property for every \(\alpha\in(0,1)\) are equivalent. In the autonomous case, the same equivalence holds for continuous maps on compact metric spaces, giving an affirmative answer to the question of whether ASP implies AASP [2504.07799].

Taken together, these results show that ALASP belongs to a broader hierarchy of Cesàro-type tracing properties. In the original definition, it strengthens ASP by weakening only the pseudo-orbit admissibility condition; in later usage, the phrase may instead denote strong-average shadowing in a gluing framework. This suggests that precise identification of the pseudo-orbit class and tracing criterion is indispensable whenever “almost average shadowing” is invoked.

Source: https://www.emergentmind.com/topics/almost-average-shadowing-property