AFTD Auto-Formalizing Theoretical Domains

fibonacci_boundary_word

def

The j-th boundary word E_j, defined for j ≥ 0 by prefixing the last symbol of F_{j-1} (which is true if j is even and false if j is odd) to F_j followed by false.

Statement

def fibonacci_boundary_word (j : ℕ) : List Bool
Defined in
arXiv:2610.10950 Smallest String Attractors and Minimal Coverage Certificates of Thue--Morse Words
Verified
29 Oct 2026
Axioms
none listed
Built on 1
  • fibonacci_wordThe sequence of binary Fibonacci words F_n over Bool, defined by F_0 = [false], F_1 = [false, true], and F_{n+2} = F_{n+1} ++ F_n.
Used by 1
  • fibonacci_attractor_basisFor a natural number n, fibonacci_attractor_basis n is the finite set (Finset (List Bool)) formed by the union of: (1) the image under…

Read back from the Lean

A definition of a function fibonacci_boundary_word taking a natural number $j$ and returning a list of booleans (List Bool). For a given $j$, the list consists of: 1. A leading boolean which is true if $j$ is even and false if $j$ is odd (decide (Even j)), 2. followed by fibonacci_word j, 3. followed by a single trailing false.

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 j-th boundary word E_j: last(F_{j-1}) followed by F_j followed by 0 (false). -/
def fibonacci_boundary_word (j : ℕ) : List Bool := decide (Even j) :: fibonacci_word j ++ [false]
See it in the graphDiscuss this resultChallenge it