# Arnold's cat map

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, hence the name.^{[1]}

Thinking of the torus as the quotient space Arnold's cat map is the transformation given by the formula

Equivalently, in matrix notation, this is

That is, with a unit . equal to the width of the square image, the image is sheared one unit up, then one unit to the right, and all that lies outside that unit square is shifted back by the unit until it's within the square.

## 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 irrational numbers, one greater and the other smaller than 1 (in absolute value), so they are associated respectively to an expanding and a contracting eigenspace 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 an automorphism of a torus given by a square unimodular matrix having no eigenvalues of absolute value 1.^{[2]} - The set of the points with a periodic orbit is dense on the torus. Actually a point is preperiodic if and only if its coordinates are rational.
- Γ is topologically transitive (i.e. there is a point whose orbit is dense, this happens for example for any points on the expanding eigenspace)
- The number of points with period
*n*is exactly |λ_{1}^{n}+ λ_{2}^{n}−2| (where λ_{1}and λ_{2}are the eigenvalues of the matrix). For example, the first few terms of this series are 1, 5, 16, 45, 121, 320, 841, 2205 ....^{[3]}(The same equation holds for any unimodular hyperbolic toral automorphism if the eigenvalues are replaced.) - Γ is ergodic and mixing,
- Γ is an Anosov diffeomorphism and in particular it is structurally stable.

## The discrete cat map

It is possible to define a discrete analogue 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, multiple smaller copies arranged in a repeating structure and even upside-down copies of the original image—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:

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:

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:

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.^{[4]}

For an image, the relationship between iterations could be expressed as follows:

## See also

## References

- ↑ Vladimir I. Arnold; A. Avez (1967).
*Problèmes Ergodiques de la Mécanique Classique*(in français). Paris: Gauthier-Villars.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles>;**English translation:**V. I. Arnold; A. Avez (1968).*Ergodic Problems in Classical Mechanics*. New York: Benjamin.<templatestyles src="Module:Citation/CS1/styles.css"></templatestyles> - ↑
**Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).** - ↑ "Sloane's A004146 ",
*The On-Line Encyclopedia of Integer Sequences*. OEIS Foundation. - ↑
**Lua error in Module:Citation/CS1/Identifiers at line 47: attempt to index field 'wikibase' (a nil value).**