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.