Misplaced Pages

Arnold's cat map: Difference between revisions

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.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 11:04, 8 August 2016 editNarky Blert (talk | contribs)Autopatrolled, Extended confirmed users, Page movers417,450 edits Properties: Link to DAB page removed← Previous edit Revision as of 14:34, 14 August 2016 edit undoPokipsy76 (talk | contribs)Extended confirmed users2,250 editsNo edit summaryNext edit →
Line 19: Line 19:
* The set of the points with a ] is ] on the torus. Actually a point is preperiodic if and only if its coordinates are ]. * The set of the points with a ] is ] on the torus. Actually a point is preperiodic if and only if its coordinates are ].
* Γ is ] (i.e. there is a point whose orbit is ], this happens for example for any points on the expanding ]) * Γ is ] (i.e. there is a point whose orbit is ], this happens for example for any points on the expanding ])
* The number of points with period ''n'' is exactly <sub>1</sub><sup>''n''</sup>&nbsp;+&nbsp;λ<sub>2</sub><sup>''n''</sup>&minus;2| (where λ<sub>1</sub> and λ<sub>2</sub> are the eigenvalues of the matrix). For example, the first few terms of this series are 1, 5, 16, 45, 121, 320, 841, 2205 ....<ref>{{SloanesRef|sequencenumber=A004146}}</ref> (The same equation holds for any unimodular hyperbolic toral automorphism if the eigenvalues are replaced.) * The number of points with period <math>n</math> is exactly <math>|\lambda_1^n+\lambda_2^n-2|</math> (where <math>\lambda_1</math> and <math>\lambda_2</math> are the eigenvalues of the matrix). For example, the first few terms of this series are 1, 5, 16, 45, 121, 320, 841, 2205 ....<ref>{{SloanesRef|sequencenumber=A004146}}</ref> (The same equation holds for any unimodular hyperbolic toral automorphism if the eigenvalues are replaced.)
* Γ is ] and ], * Γ is ] and ],
* Γ is an ] and in particular it is ]. * Γ is an ] and in particular it is ].

Revision as of 14:34, 14 August 2016

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

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.

Thinking of the torus T 2 {\displaystyle \mathbb {T} ^{2}} as the quotient space 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 . 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

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
Sample mapping on a picture of a pair of cherries. The image is 74 pixels wide, and takes 114 iterations to be restored, although it appears upside-down at the halfway point.

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

q t + 1 3 q t + q t 1 = 0 mod N {\displaystyle q_{t+1}-3q_{t}+q_{t-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:

q t + 1 = 2 q t + p t mod N {\displaystyle q_{t+1}=2q_{t}+p_{t}\mod N}
p t + 1 = q t + p t mod N {\displaystyle 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 = q t p t mod N {\displaystyle q_{t-1}=q_{t}-p_{t}\mod N}
p t 1 = q t + 2 p t mod N {\displaystyle p_{t-1}=-q_{t}+2p_{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.

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

n = 0 : T 0 ( x , y ) = Input Image ( x , y ) n = 1 : T 1 ( x , y ) = T 0 ( mod ( 2 x + y , N ) , mod ( x + y , N ) ) n = k : T k ( x , y ) = T k 1 ( mod ( 2 x + y , N ) , mod ( x + y , N ) ) n = m : Output Image ( x , y ) = T m ( x , y ) {\displaystyle {\begin{array}{rrcl}n=0:\quad &T^{0}(x,y)&=&{\mbox{Input Image}}(x,y)\\n=1:\quad &T^{1}(x,y)&=&T^{0}\left({\bmod {(}}2x+y,N),{\bmod {(}}x+y,N)\right)\\&&\vdots \\n=k:\quad &T^{k}(x,y)&=&T^{k-1}\left({\bmod {(}}2x+y,N),{\bmod {(}}x+y,N)\right)\\&&\vdots \\n=m:\quad &{\mbox{Output Image}}(x,y)&=&T^{m}(x,y)\end{array}}}

See also

References

  1. Vladimir I. Arnold; A. Avez (1967). Problèmes Ergodiques de la Mécanique Classique (in French). Paris: Gauthier-Villars.; English translation: V. I. Arnold; A. Avez (1968). Ergodic Problems in Classical Mechanics. New York: Benjamin.
  2. Franks, John M (October 1977). "Invariant sets of hyperbolic toral automorphisms". American Journal of Mathematics. 99 (5). The Johns Hopkins University Press: 1089–1095. doi:10.2307/2374001. ISSN 0002-9327.
  3. Sloane, N. J. A. (ed.). "Sequence A004146". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. Dyson, Freeman John; Falk, Harold (1992). "Period of a Discrete Cat Mapping". The American Mathematical Monthly. 99 (7). Mathematical Association of America: 603–614. doi:10.2307/2324989. ISSN 0002-9890. JSTOR 2324989.

External links

Chaos theory
Concepts
Core
Theorems
Conus textile shell


Circle map with black Arnold tongues
Theoretical
branches
Chaotic
maps (list)
Discrete
Continuous
Physical
systems
Chaos
theorists
Related
articles
Categories: