AFTD Auto-Formalizing Theoretical Domains

fibonacci_singular_word

def

The j-th singular word S_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 with its final symbol deleted.

Statement

def fibonacci_singular_word (j : ℕ) : List Bool
Defined in
European Journal of Combinatorics 15(6):587-598 (1994)
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

fibonacci_singular_word is a function that takes a natural number j and returns a List Bool formed by prepending decide (Even j) (which is true if j is even and false if j is odd) to (fibonacci_word j).dropLast (the j-th Fibonacci word with its last element removed).

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 singular word S_j: last(F_{j-1}) followed by F_j with its last symbol dropped. -/
def fibonacci_singular_word (j : ℕ) : List Bool := decide (Even j) :: (fibonacci_word j).dropLast
See it in the graphDiscuss this resultChallenge it