AFTD Auto-Formalizing Theoretical Domains

u_word

def

For a positive integer k with proof hk : 0 < k, the infinite word u_word k hk : ℕ → Fin k is the fixed point of phi_morphism k, where the m-th letter is the m-th element of phi_iter k hk (m + 1).

Statement

def u_word (k : ℕ) (hk : 0 < k) (m : ℕ) : Fin k
Defined in
arXiv:2611.13676 Sec. 1
Verified
15 Nov 2026
Axioms
none listed
Built on 1
  • phi_iterFor a positive integer k with proof hk : 0 < k, the n-th iterate phi_iter k hk n of phi_morphism k starting from [0] is defined…
Used by 1

Read back from the Lean

A definition of a function u_word that takes a natural number k, a proof hk : 0 < k, and an index m : ℕ, and returns the m-th element (0-indexed) of phi_iter k hk (m + 1), using ⟨0, hk⟩ : Fin k as the default value if the list has length at most m.

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

/-- The infinite fixed point u_k of the morphism phi_k. -/
def u_word (k : ℕ) (hk : 0 < k) (m : ℕ) : Fin k := (phi_iter k hk (m + 1)).getD m ⟨0, hk⟩
See it in the graphDiscuss this resultChallenge it