recurrence_b_map
def
The state transition map T : (ℤ/3ℤ)^k → (ℤ/3ℤ)^k for recurrence (B), sending (w_0, ..., w_{k-1}) to (w_1, ..., w_{k-1}, w_0 + w_{k-1}^2).
Statement
def recurrence_b_map (k : ℕ) (w : Fin k → ZMod 3) : Fin k → ZMod 3- Defined in
- arXiv:2610.34300 Proposition 7
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Used by 5
- recurrence_b_map_fixed_point_uniqueFor any integer k ≥ 2, a state w in (ℤ/3ℤ)^k is a fixed point of the transition map of recurrence (B) if and only if w is the zero vector.
- recurrence_b_transition_bijective_and_orbit_periodic_and_unique_fixed_pointFor any integer k ≥ 2, the transition map of recurrence (B) on (ℤ/3ℤ)^k is bijective, every orbit is purely periodic (for every state w,…
- recurrence_b_map_orbit_periodicFor any integer k ≥ 2, every orbit of the transition map of recurrence (B) on (ℤ/3ℤ)^k is purely periodic: for every state w, there exists…
- recurrence_b_map_bijectiveFor any integer k ≥ 2, the transition map of recurrence (B) on (ℤ/3ℤ)^k is bijective.
- recurrence_b_map_zeroThe state transition map of recurrence (B) on (ℤ/3ℤ)^k maps the zero vector to the zero vector.
Read back from the Lean
recurrence_b_map defines a function which takes a natural number $k$ and a map $w : \mathrm{Fin}\ k \to \mathbb{Z}/3\mathbb{Z}$, and returns a map $\mathrm{Fin}\ k \to \mathbb{Z}/3\mathbb{Z}$. For each $i \in \mathrm{Fin}\ k$, the output at $i$ is:
- $w(i + 1)$ if $i + 1 < k$;
- $w(0) + (w(k - 1))^2$ otherwise (that is, when $i = k - 1$, where the operations are in $\mathbb{Z}/3\mathbb{Z}$).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- State transition map for recurrence B on (ZMod 3)^k. -/ def recurrence_b_map (k : ℕ) (w : Fin k → ZMod 3) : Fin k → ZMod 3 := fun i => if h : (i : ℕ) + 1 < k then w ⟨i.val + 1, h⟩ else w ⟨0, by omega⟩ + (w ⟨k - 1, by omega⟩)^2