word_min_factor_coverages
def
H_min(w): the inclusion-minimal members of H(w), the family of factor coverages of w.
Statement
def word_min_factor_coverages {α : Type*} [DecidableEq α] (w : List α) : Set (Finset ℕ)
- Defined in
- arXiv:2610.10950 (Smallest String Attractors and Minimal Coverage Certificates of Thue–Morse Words), Sec. 3.2.
- Verified
- 12 Oct 2026
- Axioms
- none listed
- Built on 1
- word_factor_coveragesH(w): the family of coverages Cov_w(x) of the nonempty factors x of w.
- Used by 8
- word_min_factor_coverages_subsetEvery inclusion-minimal factor coverage is a factor coverage: H_min(w) ⊆ H(w).
- thue_morse_min_factor_coverages_finsetThe 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…
- thue_morse_unhit_mean_nonnegFor all n and k, 0 ≤ thue_morse_unhit_mean n k.
- exists_min_factor_coverage_subsetEvery factor coverage D ∈ H(w) contains some inclusion-minimal factor coverage C ∈ H_min(w).
- is_string_attractor_iff_forall_min_factor_coverageFor every finite word w and every Γ ⊆ [1, |w|], Γ is a string attractor of w if and only if Γ ∩ C ≠ ∅ for every inclusion-minimal factor…
- fibonacci_string_attractor_iff_meets_basisFor any natural number n, assuming the inclusion-minimal factor coverages of F_n are exactly the coverages of the basis B_n…
- word_min_factor_coverages_subset_of_certificateLet F ⊆ H(w) be a family of factor coverages such that for every Γ ⊆ [1, |w|], Γ is a string attractor of w iff Γ meets every member of F.…
- 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(w)`: the inclusion-minimal factor coverages of `w`. -/ def word_min_factor_coverages {α : Type*} [DecidableEq α] (w : List α) : Set (Finset ℕ) := {C | C ∈ word_factor_coverages w ∧ ∀ D ∈ word_factor_coverages w, D ⊆ C → D = C}