period_doubling_min_factor_coverages_finset
For any natural number n, period_doubling_min_factor_coverages_finset n is the finite set of inclusion-minimal factor coverages H_min(w_n) of the n-th period-doubling word w_n, realized as a Finset of subsets of [1, |w_n|].
Statement
noncomputable def period_doubling_min_factor_coverages_finset (n : ℕ) : Finset (Finset ℕ)
- Related work
- arXiv:2610.10950; arXiv:2602.16152
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Built on 2
- period_doubling_wordThe sequence of finite period-doubling words w_n over Bool, defined by w_0 = [false] and w_{n+1} obtained by simultaneously replacing…
- word_min_factor_coveragesH_min(w): the inclusion-minimal members of H(w), the family of factor coverages of w.
- Used by 4
- period_doubling_min_factor_coverages_finset_memFor every natural number n and every set of positions C, C belongs to period_doubling_min_factor_coverages_finset n if and only if C is an…
- period_doubling_min_factor_coverages_four_cardThe cardinality of the set of inclusion-minimal factor coverages of the fourth period-doubling word w_4,…
- period_doubling_string_attractor_iff_forall_min_factor_coverageFor every natural number n and every set of positions Γ ⊆ [1, (period_doubling_word n).length], Γ is a string attractor of the n-th…
- period_doubling_min_factor_coverages_three_cardThe cardinality of the set of inclusion-minimal factor coverages of the third period-doubling word w_3,…
Read back from the Lean
period_doubling_min_factor_coverages_finset is a definition that takes a natural number n : ℕ and returns the Finset (Finset ℕ) obtained by filtering the powerset of Finset.Icc 1 (period_doubling_word n).length for those subsets C that satisfy C ∈ word_min_factor_coverages (period_doubling_word n) (using classical decidability). That is, it produces the finite set of all minimal factor coverages of the n-th period-doubling word.
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 finite set of inclusion-minimal factor coverages H_min(w_n) of the n-th period-doubling word w_n. -/ noncomputable def period_doubling_min_factor_coverages_finset (n : ℕ) : Finset (Finset ℕ) := by classical exact (Finset.Icc 1 (period_doubling_word n).length).powerset.filter (fun C => decide (C ∈ word_min_factor_coverages (period_doubling_word n)))