Misplaced Pages

Arnold's cat map

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

This is an old revision of this page, as edited by Pokipsy76 (talk | contribs) at 20:47, 17 May 2010 (Properties). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Revision as of 20:47, 17 May 2010 by Pokipsy76 (talk | contribs) (Properties)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.

Thinking of the torus T 2 {\displaystyle \mathbb {T} ^{2}} as R 2 / Z 2 {\displaystyle \mathbb {R} ^{2}/\mathbb {Z} ^{2}} Arnold's cat map is the transformation Γ : T 2 T 2 {\displaystyle \Gamma :\mathbb {T} ^{2}\to \mathbb {T} ^{2}} given by the formula

Γ : ( x , y ) ( 2 x + y , x + y ) mod 1 . {\displaystyle \Gamma \,:\,(x,y)\to (2x+y,x+y){\bmod {1}}.}

Equivalently, in matrix notation, this is

Γ ( [ x y ] ) = [ 2 1 1 1 ] [ x y ] mod 1 = [ 1 1 0 1 ] [ 1 0 1 1 ] [ x y ] mod 1 . {\displaystyle \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 pieces are rearranged when the modulo operation is performed. The lines with the arrows show the direction of the contracting and expanding eigenspaces

Properties

  • 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.
  • The number of points with period n is exactly |λ1 + λ2−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 ... . (The same equation holds for any unimodular hyperbolic toral automorphism if the eigenvalues are replaced.)

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
File:Pepper map.gif
Sample mapping on a picture of a pepper. Be patient!

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—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 the second 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.

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

n = 0: T(x,y) = Input Image (x,y)
n = 1: T(x,y) = T(mod(2x+y,N),mod(x+y,N))
.
.
.
n = k: T(x,y) = T(mod(2x+y,N),mod(x+y,N))
.
.
.
Output Image(x,y) = T(x,y)

See also

References

  1. *Template:Fr icon V. I. Arnold (1967). Problèmes Ergodiques de la Mécanique Classique. Paris: Gauthier-Villars. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help); English translation: V. I. Arnold (1968). Ergodic Problems in Classical Mechanics. New York: Benjamin. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
  2. Franks, John M. Invariant sets of hyperbolic toral automorphisms. American Journal of Mathematics, Vol. 99, No. 5 (Oct., 1977), pp. 1089–1095
  3. http://www2.research.att.com/~njas/sequences/A004146
  4. Period of a discrete cat mapping , Freeman J. Dyson and Harold Falk, American Mathematical Monthly 99 603-614 (1992).

External links

Categories: