star_token_steiner_dominating_set
For an implicit natural number k and a set S : Set (Finset (Fin (2 * k - 1))), star_token_steiner_dominating_set S is the set of elements v of the subtype { s : Finset (Option (Fin (2 * k - 1))) // s.card = k } such that there exists some X ∈ S with v.val = insert none (X.image some) or v.val = (Finset.univ \ X).image some.
Statement
def star_token_steiner_dominating_set {k : ℕ} (S : Set (Finset (Fin (2 * k - 1)))) :
Set { s : Finset (Option (Fin (2 * k - 1))) // s.card = k }- Defined in
- arXiv:2611.11191, Theorem 6.2
- Verified
- 11 Nov 2026
- Axioms
- none listed
Read back from the Lean
Given an implicit natural number k and a set S of finsets of Fin (2 * k - 1), star_token_steiner_dominating_set is defined as the set of all k-element finsets v of Option (Fin (2 * k - 1)) such that there exists some X ∈ S satisfying either:
1. v = {none} ∪ {some x | x ∈ X}, or
2. v = {some x | x ∈ Fin (2 * k - 1) \ X}.
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
/-- Candidate perfect dominating set in F_k(S_{2k-1}) constructed from a set of blocks S. -/ def star_token_steiner_dominating_set {k : ℕ} (S : Set (Finset (Fin (2 * k - 1)))) : Set { s : Finset (Option (Fin (2 * k - 1))) // s.card = k } := { v | ∃ X ∈ S, v.val = insert none (X.image some) ∨ v.val = (Finset.univ \ X).image some }