Arnold's cat map

From Wikipedia, the free encyclopedia

In mathematics, Arnold's cat map is a chaotic map from the torus into itself, named after Vladimir Arnold, who demonstrated its effects in the 1960s using an image of a cat.^[1]

Arnold's cat map is the transformation $\Gamma : \mathbb{T}^2 \to \mathbb{T}^2$ given by the formula

$\Gamma \, : \, (x,y) \to (2x+y,x+y) \bmod 1$

Equivalently, in matrix notation, this is

$\Gamma \left( \begin{bmatrix} x \\ y \end{bmatrix} \right) = \begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} \bmod 1 = \begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix} \begin{bmatrix} 1 & 0 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} \bmod 1$

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.

Picture showing how the linear map stretches the unit square and how its peaces are rearranged when the modulo operation is performed. The lines with the arrows show the direction of the contracting and expanding eigenspaces

1 Properties
2 The discrete cat map
3 See also
4 References
5 External links

[edit] 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: its eigenvalues are real numebers, one greater and the other smaller than 1, so they are associated respectively to an expanding and a contracting eigenspace which are also the stable and unstable manifolds. The eigenspace are othogonal because the matrix is symmetric. Since the eigenvectors have rationally independent components both the eigenspaces densely cover the torus,

The set of the points with a periodic orbit is dense on the torus,

Γ is ergodic and mixing,

Γ is an Anosov diffeomorphism.

[edit] The discrete cat map

From order to chaos and back. Sample mapping on a picture of 150x150 pixels. The numbers shows the iteration step. After 300 iterations arriving at the original image

It 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 q_t (0 ≤ q_t < N) to site q_t+1 on a circular ring with circumference N, according to the second order equation:

q_t+1 - 3q_t + q_t-1 = 0 mod N

Defining the momentum variable p_t = q_t - q_t-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:

q_t+1 = 2q_t + p_t mod N

p_t+1 = q_t + p_t 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:

q_t-1 = 2q_t - p_t mod N

p_t-1 = -q_t + p_t 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.^[2]

[edit] See also

List of chaotic maps

[edit] References

^ *(French) V. I. Arnold; A. Avez (1967). Problèmes Ergodiques de la Mécanique Classique. Paris: Gauthier-Villars. ; English translation: V. I. Arnold; A. Avez (1968). Ergodic Problems in Classical Mechanics. New York: Benjamin.
^ Period of a discrete cat mapping , Freeman J. Dyson and Harold Falk, American Mathematical Monthly 99 603-614 (1992).