AFTD Auto-Formalizing Theoretical Domains

period_doubling_word

def

The sequence of finite period-doubling words w_n over Bool, defined by w_0 = [false] and w_{n+1} obtained by simultaneously replacing false with [false, true] and true with [false, false].

Statement

def period_doubling_word : ℕ → List Bool
Defined in
arXiv:2602.16152
Verified
15 Nov 2026
Axioms
none listed

Read back from the Lean

The function period_doubling_word : ℕ → List Bool, defined by structural recursion on natural numbers: - period_doubling_word 0 is the single-element list [false]. - period_doubling_word (n + 1) is obtained by taking period_doubling_word n and replacing (via List.flatMap) each occurrence of false with [false, true] and each occurrence of true with [false, 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 n-th finite period-doubling word w_n over Bool. -/
def period_doubling_word : ℕ → List Bool
| 0 => [false]
| n + 1 => (period_doubling_word n).flatMap (fun b => match b with | false => [false, true] | true => [false, false])
See it in the graphDiscuss this resultChallenge it