The cat map is the area-preserving map of the real torus given byIts integer matrix has determinant one and inverse , so reducing coordinates modulo one retains an invertible transformation of the torus.
Geometrically, stretches a unit square into a parallelogram. Cutting that parallelogram along the integer grid and translating its pieces by integer vectors brings it back into a unit square. Edges are identified on the torus, which is why cutting the drawing does not make the torus map discontinuous.
The eigenvalues and give one expanding and one contracting eigenvector. Their product one agrees with area preservation, while the absence of eigenvalues on the unit circle makes this a hyperbolic toral automorphism. The Fibonacci powers of the cat-map matrix give its iterates explicitly. Thus an integer matrix that is easy to multiply provides a concrete model of simultaneous uniform stretching, contraction and global wrapping.
Use the standard Fibonacci number convention , , . For the cat map matrix,At , the right side is . To prove the induction step, multiply it by . The top-left entry becomes , the top-right becomes , and the lower row follows from the same recurrence. This advances all indices by two.
For example, , so two iterations send to modulo one. The formula turns repeated matrix multiplication into an explicit integer recurrence; the exponential growth of the Fibonacci numbers agrees with the expanding eigenvalue of the cat map.
Articles by others on the same topic
There are currently no matching articles.