






“We live in an insane world, in which most governments behave like the pigs under an oak tree in the fable by Krylov, both eating the acorns and digging up its roots, thus destroying the source of their very sustenance.”
“Even more important than the ability to add fractions is the fact that a basic acquaintance with mathematics allows one to distinguish a correct argument from a faulty one. Without this ability, a society turns into a herd, easily manipulated by demagogues. According to Western experts, in the current situation in Russia, the assumption of power by a Hitler is even more likely than it was in Germany in the 1920s.”
— Vladimir Arnold
Read the full article here
\[\begin{bmatrix}x' \\ y'\end{bmatrix} = \begin{bmatrix}1 & 1 \\ 1 & 2\end{bmatrix} \begin{bmatrix}x \\ y\end{bmatrix} \mod 1\]
Theorem
A point on the cat map is periodic if and only if its coordinates are rational.
Let \(A\) be the matrix above. If a point \(x\) is periodic, then there exist a positive integer \(n\) such that \[A^n x - x \in \mathbb{Z}^2, \mbox{ i.e., } (A^n - I)x = y \in \mathbb{Z}^2.\]
Since \(A\) has integer entries, the matrix \(M = A^n - I\) does too. Furthermore the determinant \[\det(M) = \det(A^n - I) = \prod_{i=1}^2 (\lambda_i^n - 1)\] where \(\lambda_i\) are the eigenvalues of \(A\). The eigenvalues of \(A\) are real and irrational, thus \(\lambda_i^n - 1 \neq 0\) for all \(n\), so \(\det(M) \neq 0\).
Since \(M\) is an integer matrix with nonzero determinant, it is invertible over the rationals, so \(x = M^{-1} y\) so \(x\) is rational.
o
oo
o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o- -o+o-
oo
o
Conversely, if \(x\) is rational, we can factor out the common denominator \(d\) to get \(x = \frac{1}{d} z\) for some \(z \in \mathbb{Z}\). We want to show that there exist a positive integer \(n\) such that \[A^n x - x \in \mathbb{Z}^2, \mbox{ i.e., } A^n x \equiv x \mod 1. \]
We’ll use the pigeonhold principle.
Pigeons: matrices \(A^{n_i}\)
Pigeonholes: matrices \(A^{n_i}\) modulo \(d\)
Each entry of \(A^{n_i}\) modulo \(d\) gives \(d\) possible values, so there are \(d^4\) possible pigeonholes. The entries of \(A^{n_i}\) are (increasing) Fibonacci numbers so clearly there are more pigeons than pigeonholes, so by the pigeonhole principle there must be exist a pair of integers \(n_i\) and \(n_j\) such that \(A^{n_i} \equiv A^{n_j} \mod d\).
Since \(A\) is invertible, we can multiply both sides by \(A^{-n_j}\) to get \(A^{n_i - n_j} \equiv I \mod d\).
Visualize the cat map using this link to a 3D model