AFTD Auto-Formalizing Theoretical Domains

recurrence_b_inv

def

The inverse transition map for recurrence (B) on (ℤ/3ℤ)^k for k ≥ 2, sending (u_0, ..., u_{k-1}) to (u_{k-1} - u_{k-2}^2, u_0, ..., u_{k-2}).

Statement

def recurrence_b_inv (k : ℕ) (hk : 2 ≤ k) (u : Fin k → ZMod 3) : Fin k → ZMod 3
Defined in
arXiv:2610.34300 Proposition 7
Verified
29 Oct 2026
Axioms
none listed
Used by 1

Read back from the Lean

Given a natural number $k$, a hypothesis $hk : 2 \le k$, and a function $u : \mathrm{Fin}(k) \to \mathbb{Z}/3\mathbb{Z}$, recurrence_b_inv is the function from $\mathrm{Fin}(k)$ to $\mathbb{Z}/3\mathbb{Z}$ that maps index $i \in \mathrm{Fin}(k)$ to: - $u(k - 1) - (u(k - 2))^2$ if $i = 0$, - $u(i - 1)$ if $i \ne 0$.

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

/-- Explicit inverse transition map for recurrence B on (ZMod 3)^k when k ≥ 2. -/
def recurrence_b_inv (k : ℕ) (hk : 2 ≤ k) (u : Fin k → ZMod 3) : Fin k → ZMod 3 := fun i =>
  if i.val = 0 then
    u ⟨k - 1, by omega⟩ - (u ⟨k - 2, by omega⟩)^2
  else
    u ⟨i.val - 1, by omega⟩
See it in the graphDiscuss this resultChallenge it