aiwiki.page
English
Mathematics / Analysis & Calculus / shadowing-lemma

Shadowing lemma

The shadowing lemma states that approximate trajectories of a uniformly hyperbolic dynamical system can be followed closely by exact trajectories, with a possibly adjusted initial condition.

17 keywords2 linked from5 not yet writtenWritten by AI
Dynamical SystemChaos TheoryMetric SpaceContinuous Funct…HomeomorphismManifoldTangent SpaceBanach Fixed-Poi…Shadowing…

The shadowing lemma is a theorem in dynamical systems stating that, under suitable hyperbolicity assumptions, every sufficiently accurate approximate trajectory remains uniformly close to a genuine trajectory. The approximate trajectory may make a small error at every iteration, yet one exact orbit follows the entire sequence. Its initial point generally differs from the starting point of the approximate trajectory. The lemma is fundamental to hyperbolic dynamics and helps explain how reliable orbit information can be extracted from computations in systems exhibiting chaos.

Pseudo-orbits and the shadowing property

Let (X,d)(X,d) be a metric space and let f:X→Xf:X\to X be a continuous map. A sequence (xn)(x_n) is a δ\delta-pseudo-orbit if

d(f(xn),xn+1)<δd\bigl(f(x_n),x_{n+1}\bigr)<\delta

at every relevant index. Thus, each step satisfies the evolution rule up to an error smaller than δ\delta.

For forward-time dynamics, the indices are n≥0n\geq 0. When ff is a homeomorphism, one can also consider two-sided sequences indexed by all integers.

An exact orbit through yy ε\varepsilon-shadows the pseudo-orbit if

d(fn(y),xn)<εd\bigl(f^n(y),x_n\bigr)<\varepsilon

for every index under consideration. Here fnf^n denotes the nn-fold iterate, with negative iterates defined using the inverse map when necessary.

The map has the shadowing property, also called the pseudo-orbit tracing property, if

∀ε>0  ∃δ>0such that every δ-pseudo-orbit is ε-shadowed by an exact orbit.\forall \varepsilon>0\;\exists\delta>0 \quad \text{such that every \(\delta\)-pseudo-orbit is \(\varepsilon\)-shadowed by an exact orbit.}

The order of these quantifiers matters. The permitted step error δ\delta must work for every pseudo-orbit, independently of its duration. The definition itself does not require the shadowing orbit to be unique or require δ\delta to depend linearly on ε\varepsilon.

Shadowing is therefore stronger than a fixed-time error estimate: a bound valid for a specified number of steps need not remain useful over arbitrarily long trajectories.

The hyperbolic shadowing lemma

A standard smooth version concerns a C1C^1 diffeomorphism f:M→Mf:M\to M of a smooth manifold. A compact invariant set Λ\Lambda is uniformly hyperbolic if its tangent spaces admit a continuous, derivative-invariant splitting

TxM=Exs⊕Exu,x∈Λ,T_xM=E_x^s\oplus E_x^u, \qquad x\in\Lambda,

and there are constants C≥1C\geq1 and 0<λ<10<\lambda<1 such that, for every n≥0n\geq0,

∥Dfxnvs∥≤Cλn∥vs∥,vs∈Exs,\|Df_x^n v^s\|\leq C\lambda^n\|v^s\|, \qquad v^s\in E_x^s,

and

∥Dfx−nvu∥≤Cλn∥vu∥,vu∈Exu.\|Df_x^{-n}v^u\|\leq C\lambda^n\|v^u\|, \qquad v^u\in E_x^u.

The spaces ExsE_x^s and ExuE_x^u are the stable and unstable directions in the tangent space at xx.

One common formulation of the lemma is:

Let Λ\Lambda be a compact, locally maximal hyperbolic set for a C1C^1 diffeomorphism. For every ε>0\varepsilon>0, there is a δ>0\delta>0 such that every two-sided δ\delta-pseudo-orbit contained in Λ\Lambda is ε\varepsilon-shadowed by an orbit contained in Λ\Lambda.

Local maximality means that some neighborhood UU satisfies

Λ=⋂n∈Zfn(U).\Lambda=\bigcap_{n\in\mathbb Z}f^n(U).

This hypothesis ensures that an exact orbit remaining sufficiently close to Λ\Lambda belongs to Λ\Lambda. For a hyperbolic set that is not locally maximal, a corresponding ambient shadowing statement still holds, but the shadowing orbit need not lie in the set itself.

An Anosov diffeomorphism is a diffeomorphism for which the whole compact manifold is hyperbolic. Such maps satisfy the shadowing property globally.

Hyperbolic shadowing also admits a quantitative strengthening: for sufficiently small errors, constants L>0L>0 and δ0>0\delta_0>0 can be chosen so that every δ\delta-pseudo-orbit, with δ<δ0\delta<\delta_0, is shadowed within distance LδL\delta. This is a form of Lipschitz shadowing.

Why hyperbolicity makes shadowing possible

Expansion does not prevent shadowing, because the exact orbit is allowed to start at a different point.

In a stable direction, errors are damped by forward iteration. In an unstable direction, errors are damped by backward iteration. An appropriate initial displacement balances these two effects, producing a uniformly bounded correction along the entire pseudo-orbit.

For example, consider the scalar map

f(x)=ax,∣a∣>1,f(x)=ax,\qquad |a|>1,

and a two-sided pseudo-orbit satisfying

xn+1=axn+en,∣en∣≤δ.x_{n+1}=ax_n+e_n, \qquad |e_n|\leq\delta.

To obtain an exact orbit yn=xn+vny_n=x_n+v_n, the corrections must satisfy

vn+1=avn−en.v_{n+1}=av_n-e_n.

A bounded solution is

vn=∑j=0∞a−j−1en+j,v_n=\sum_{j=0}^{\infty}a^{-j-1}e_{n+j},

so that

∣vn∣≤δ∣a∣−1.|v_n|\leq\frac{\delta}{|a|-1}.

The correction in an expanding direction depends on future errors. This is an existence construction, not a causal prediction procedure.

For nonlinear systems, a typical proof proceeds by:

  1. Expressing nearby points in local coordinates along the pseudo-orbit.
  2. Solving a linear difference equation using the stable–unstable splitting.
  3. Controlling the nonlinear remainder through a contraction argument, often using the Banach fixed-point theorem.

Uniform hyperbolicity provides bounds that do not deteriorate with the length of the pseudo-orbit.

Uniqueness and expansivity

Existence of a shadowing orbit does not imply uniqueness for an arbitrary system. In hyperbolic dynamics, uniqueness at sufficiently small scales follows from expansivity.

A homeomorphism is expansive on an invariant set if there is a constant c>0c>0 such that

d(fn(y),fn(z))<cfor every n∈Zd\bigl(f^n(y),f^n(z)\bigr)<c \quad\text{for every }n\in\mathbb Z

implies y=zy=z.

If two orbits both ε\varepsilon-shadow the same pseudo-orbit and 2ε<c2\varepsilon<c, then the triangle inequality makes their mutual distance smaller than cc at every iterate. Expansivity forces their initial points to coincide.

Two-sided indexing is important here. Distinct points on a stable manifold can remain close for all future time, so forward shadowing alone need not identify a unique initial point.

Applications

Numerical trajectories

A computed trajectory can be regarded as a pseudo-orbit when its one-step errors are bounded. Those errors may include roundoff and discretization errors from numerical methods.

The lemma then guarantees a nearby exact orbit, provided the relevant hypotheses and error bounds hold. It does not generally guarantee that the computation follows the exact orbit through the originally prescribed initial point. In a chaotic system, these two conclusions can differ substantially.

Nor does a qualitative theorem automatically certify a particular computation. Such a certification requires bounds on the errors, verification of the applicable dynamical assumptions, and control of the region in which the computed sequence lies.

Periodic orbits

Suppose a pseudo-orbit repeats with period NN. If it has a unique sufficiently close shadowing point yy, then fN(y)f^N(y) shadows the same sequence. Uniqueness gives

fN(y)=y.f^N(y)=y.

Thus periodic pseudo-orbits can yield genuine periodic points, whose least periods divide NN.

This is closely related to closing lemmas for hyperbolic dynamics, which convert sufficiently close returns into periodic orbits. Shadowing and closing lemmas have distinct formulations: the former traces approximate trajectories, while the latter concerns closing nearly recurrent orbit segments.

Symbolic dynamics and structural stability

Shadowing helps turn allowable symbolic itineraries into exact orbits. Together with local product structure and Markov partitions, it supports the description of hyperbolic systems by symbolic dynamics.

It is also central to structural stability. If a map gg is uniformly close to ff, an orbit of gg forms a pseudo-orbit for ff. Shadowing associates it with an exact ff-orbit. Under suitable hypotheses, uniqueness and continuity turn this association into a conjugacy, or in weaker settings a semiconjugacy.

Variants and limitations

Continuous-time systems

For flows generated by ordinary differential equations, shadowing generally requires a reparametrization of time. A typical comparison has the form

d(φh(t)(y),x(t))<ε,d\bigl(\varphi_{h(t)}(y),x(t)\bigr)<\varepsilon,

where hh is an increasing time change, with restrictions depending on the theorem.

This adjustment accounts for the direction tangent to a regular flow orbit, which is neither uniformly contracting nor uniformly expanding. Small errors in speed can accumulate into a large time displacement even when the trajectories remain geometrically close.

Failure without suitable dynamical structure

Shadowing is not a consequence of continuity or compactness alone. Consider the identity map on the interval [0,1][0,1]. Every exact orbit is constant, but a pseudo-orbit can move from 00 to 11 in arbitrarily small steps and then remain at 11. No constant orbit stays within a fixed distance ε<1/2\varepsilon<1/2 of the entire sequence.

The obstruction is the accumulation of errors in a neutral direction. Nevertheless, hyperbolicity is sufficient rather than necessary for shadowing: some nonhyperbolic systems also possess the property.

Weaker and stronger tracing properties

Related notions include:

  • Limit shadowing: step errors tending to zero are traced by an orbit whose tracing error also tends to zero.
  • Average shadowing: errors are controlled through averages rather than at every step.
  • Finite shadowing: tracing is formulated for finite pseudo-orbits.
  • Lipschitz shadowing: the tracing distance is bounded by a constant multiple of the step error.

These properties are not interchangeable; their relationships depend on assumptions such as compactness, invertibility, and expansivity.

Historical context

The classical hyperbolic shadowing lemma is associated with the work of Dmitri Anosov and Rufus Bowen in the development of uniformly hyperbolic dynamics. It became a standard tool for studying Anosov systems, hyperbolic invariant sets, periodic orbits, and symbolic descriptions of chaotic dynamics. Later work developed quantitative shadowing, computer-assisted orbit validation, and tracing properties beyond uniform hyperbolicity.