AFTD Auto-Formalizing Theoretical Domains

fibonacci_attractor_basis

def

For a natural number n, fibonacci_attractor_basis n is the finite set (Finset (List Bool)) formed by the union of: (1) the image under fibonacci_singular_word of Finset.range (n - 1) (natural numbers j < n - 1), and (2) the image under fibonacci_boundary_word of the filter of Finset.Icc 3 (n - 4) on j % 2 = n % 2.

Statement

def fibonacci_attractor_basis (n : ℕ) : Finset (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 2
  • fibonacci_singular_wordThe 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)…
  • fibonacci_boundary_wordThe 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)…
Used by 3

Read back from the Lean

For a given natural number n, fibonacci_attractor_basis n is defined as the finite set of boolean lists formed by the union of: 1. the image under fibonacci_singular_word of {j ∈ ℕ | j < n - 1}, and 2. the image under fibonacci_boundary_word of {j ∈ ℕ | 3 ≤ j ≤ n - 4 and j ≡ n (mod 2)}.

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 canonical attractor basis B_n consisting of singular words S_j for 0 <= j <= n-2 and boundary words E_j for 3 <= j <= n-4 with j = n mod 2. -/
def fibonacci_attractor_basis (n : ℕ) : Finset (List Bool) := ((Finset.range (n - 1)).image fibonacci_singular_word) ∪
  (((Finset.Icc 3 (n - 4)).filter (fun j => j % 2 = n % 2)).image fibonacci_boundary_word)
See it in the graphDiscuss this resultChallenge it