Jump to content

Shadowing lemma

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by InternetArchiveBot (talk | contribs) at 15:10, 15 March 2020 (Bluelink 1 book for verifiability (goog)) #IABot (v2.0) (GreenC bot). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A Shadowing lemma is also a fictional creature in the Discworld. See Shadowing lemma.

In the theory of dynamical systems, the shadowing lemma is a lemma describing the behaviour of pseudo-orbits near a hyperbolic invariant set. Informally, the theory states that every pseudo-orbit (which one can think of as a numerically computed trajectory with rounding errors on every step[1]) stays uniformly close to some true trajectory (with slightly altered initial position)—in other words, a pseudo-trajectory is "shadowed" by a true one.

Formal statement

Given a map f : X → X of a metric space (Xd) to itself, define a ε-pseudo-orbit (or ε-orbit) as a sequence of points such that belongs to a ε-neighborhood of .

Then, near a hyperbolic invariant set, the following statement holds:[2] Let Λ be a hyperbolic invariant set of a diffeomorphism f. There exists a neighborhood U of Λ with the following property: for any δ > 0 there exists ε > 0, such that any (finite or infinite) ε-pseudo-orbit that stays in U also stays in a δ-neighborhood of some true orbit.

See also

References

  1. ^ Weisstein, Eric W. "Shadowing Theorem". MathWorld.
  2. ^ Katok, A.; Hasselblatt, B. (1995). Introduction to the Modern Theory of Dynamical Systems. Cambridge: Cambridge University Press. Theorem 18.1.2. ISBN 0-521-34187-6.