binary_partial_word_restrict_support
def
Restrict the support of a partial word to the coordinate subtype excluding one specified coordinate.
Statement
def binary_partial_word_restrict_support {V : Type*} [Fintype V] [DecidableEq V] (s : Finset V) (v : V) : Finset {w : V // w ≠ v}
- Source
- Reusable finite-cube and ordered-biclique helpers for the uniform OP-205 / RT-1 full-root-gap reduction following arXiv:2610.15635. The deficiency-one singular-coordinate/tree argument formalizes the Boolean setting of arXiv:1103.3693 Lemma 2.5.4 and Corollary 2.5.6; arXiv:2212.14685 Section 2.3 gives a related partition-size discussion. These are helper formalizations, not an original graph covering result; no advance is claimed.
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Used by 4
- binary_partial_word_partition_order_convexIn a finite Boolean cube partition with one more part than mentioned coordinates, linearly order the parts so that every false occurrence…
- binary_partial_word_partition_restrictFixing one coordinate of a finite partial-word cube partition and retaining the compatible words gives a partition with the same…
- binary_partial_word_partition_singular_coordinateA finite Boolean cube partition mentioning every coordinate and having exactly one more part than coordinates, with a nonempty coordinate…
- binary_partial_word_partition_min_degree_restrict_essentialFixing a coordinate with minimum occurrence count in a finite cube partition that mentions every coordinate leaves every other coordinate…
Lean source view module on GitHub
open Finset set_option maxHeartbeats 1000000 set_option maxRecDepth 4000 def binary_partial_word_restrict_support {V : Type*} [Fintype V] [DecidableEq V] (s : Finset V) (v : V) : Finset {w : V // w ≠ v} := univ.filter (fun w => w.val ∈ s)