AFTD Auto-Formalizing Theoretical Domains

thue_morse_min_factor_coverages_finset

def

The finite set of inclusion-minimal factor coverages H_min(t_n) of the n-th Thue-Morse word, realized as a Finset of subsets of the position set [1, 2^n].

Statement

noncomputable def thue_morse_min_factor_coverages_finset (n : ℕ) : Finset (Finset ℕ)
Source
step towards thue_morse_random_attractor_lattice_gumbel
Verified
29 Oct 2026
Axioms
none listed
Built on 2
  • word_min_factor_coveragesH_min(w): the inclusion-minimal members of H(w), the family of factor coverages of w.
  • thue_morse_wordThe n-th Thue-Morse word t_n over the alphabet {false, true}, defined recursively by t_0 = [false] and t_{n+1} obtained by replacing each…
Used by 3

Lean source view module on GitHub

/-- H_min(t_n) as a Finset over the position set [1, 2^n], so the expected unhit count is a finite sum. -/
noncomputable def thue_morse_min_factor_coverages_finset (n : ℕ) : Finset (Finset ℕ) := by
  classical
  exact (Finset.Icc 1 (thue_morse_word n).length).powerset.filter
    (fun C => decide (C ∈ word_min_factor_coverages (thue_morse_word n)))
See it in the graphDiscuss this resultChallenge it