- Arnold's cat map
In mathematics, Arnold's cat map is a chaotic map from the
torus into itself, named afterVladimir Arnold , who demonstrated its effects in the 1960s using an image of acat . [*fr icon cite book|author=V. I. Arnold|coauthors=A. Avez|title=Problèmes Ergodiques de la Mécanique Classique|location=Paris|publisher=Gauthier-Villars|year=1967; English translation: cite book|author=V. I. Arnold|coauthors=A. Avez|title=Ergodic Problems in Classical Mechanics|location=New York|publisher=Benjamin|year=1968]Thinking of the torus as Arnold's cat map is the transformation given by the formula
:
Equivalently, in matrix notation, this is
:
That is, with a unit size equal to the width of the square image, the image is sheared one unit to the right, then one unit up, and all that lies without that unit square is wrapped around on the other respective side to be within it.
Properties
* Γ is invertible because the matrix has
determinant 1 and therefore its inverse has integer entries,* Γ is area preserving,
* Γ has a unique
hyperbolic fixed point (the vertices of the square). The linear transformation which defines the map is hyperbolic: itseigenvalue s are real numbers, one greater and the other smaller than 1, so they are associated respectively to an expanding and a contractingeigenspace which are also the stable and unstable manifolds. The eigenspace are orthogonal because the matrix is symmetric. Since the eigenvectors have rationally independent components both the eigenspaces densely cover the torus. Arnold's cat map is a particularly well-known example of a "hyperbolic toral automorphism", which is anautomorphism of atorus given by a squareunimodular matrix having noeigenvalues of absolute value 1. [Franks, John M. Invariant sets of hyperbolic toral automorphisms. American Journal of Mathematics, Vol. 99, No. 5 (Oct., 1977), pp. 1089-1095]* The set of the points with a
periodic orbit is dense on the torus. Actually a point has a periodic orbit if and only if its coordinates are rational.* Γ is topologically transitive (i.e. there is a point whose orbit is dense)
* The set of points with period "n" is λ1"n"+λ2–"n"-2 (where λ1 and λ2 are the eigenvalues of the matrix)
* Γ is
ergodic andmixing ,* Γ is an
Anosov diffeomorphism and in particular it is structurally stable.The discrete cat map
right|frame|From order to chaos and back.Sample mapping on a picture of 150x150 pixels. The numbers shows theiteration step. After 300 iterations arriving at the original imageIt is possible to define a discrete analogous of the cat map. One of this map's features is that image being apparently randomized by the transformation but returning to its original state after a number of steps. As can be seen in the picture to the right, the original image of the cat is sheared and then wrapped around in the first iteration of the transformation. After some iterations, the resulting image appears rather random or disordered, yet after further iterations the image appears to have further order—ghost-like images of the cat—and ultimately returns to the original image.The discrete cat map describes the
phase space flow corresponding to the discrete dynamics of a bead hopping from site qt (0 ≤ qt < N) to site qt+1 on a circular ring with circumference N, according to thesecond order equation ::qt+1 - 3qt + qt-1 = 0 mod N
Defining the momentum variable pt = qt - qt-1, the above second order dynamics can be re-written as a mapping of the square 0 ≤ q, p < N (the
phase space of the discrete dynamical system) onto itself::qt+1 = 2qt + pt mod N
:pt+1 = qt + pt mod N
This Arnold cat mapping shows mixing behavior typical for chaotic systems. However, since the transformation has a
determinant equal to unity, it is area-preserving and therefore invertible the inverse transformation being::qt-1 = 2qt - pt mod N
:pt-1 = -qt + pt mod N
For real variables q and p, it is common to set N = 1. In that case a mapping of the unit square with periodic boundary conditions onto itself results.
When N is set to an integer value, the position and momentum variables can be restricted to integers and the mapping becomes a mapping of a toroidial square grid of points onto itself. Such an integer cat map is commonly used to demonstrate mixing behavior with Poincaré recurrence utilising digital images. The number of iterations needed to restore the image can be shown never to exceed 3N. [Period of a discrete cat mapping , Freeman J. Dyson and Harold Falk, American Mathematical Monthly 99 603-614 (1992).]
ee also
*
List of chaotic maps References
External links
*MathWorld|urlname=ArnoldsCatMap|title=Arnold's Cat Map
* [http://hypatia.math.uri.edu/~kulenm/diffeqaturi/victor442/index.html A description and demonstration] , using an image of theEarth as an example
* [http://www.mpipks-dresden.mpg.de/mpi-doc/kantzgruppe/wiki/projects/Recurrence.html Effect of randomisation of initial conditions on recurrence time]
* [http://demonstrations.wolfram.com/ArnoldsCatMap/ Arnold's Cat Map] by Enrique Zeleny,The Wolfram Demonstrations Project .
* [http://online.redwoods.cc.ca.us/instruct/darnold/maw/catmap3.htm Arnold's Cat Map] , David Arnold.
Wikimedia Foundation. 2010.