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
- thue_morse_unhit_mean_nonnegFor all n and k, 0 ≤ thue_morse_unhit_mean n k.
- thue_morse_unhit_meanThe expected number of unhit inclusion-minimal factor coverages of t_n under a uniformly random k-tuple of positions: the sum over C in…
- thue_morse_min_factor_coverages_finset_memFor every n and every C, C belongs to thue_morse_min_factor_coverages_finset n if and only if C is an inclusion-minimal factor coverage of…
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)))