binary_partial_word_cube
def
The finite Boolean cube determined by fixing the coordinates of a finite support to the values of a Boolean word.
Statement
def binary_partial_word_cube {V : Type*} [Fintype V] [DecidableEq V] (s : Finset V) (b : V → Bool) : Finset (V → Bool)
- 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 18
- ordered_biclique_minimum_incidence_intervalsLet g be positive and take g-1 bicliques indexed by cuts r+1 of the ordered set Fin g, with the first side strictly above r and the second…
- binary_partial_word_cube_memMembership in a partial-word cube is exactly agreement on every supported coordinate.
- binary_partial_word_cube_sign_sumThe sum of a coordinate sign on a partial-word cube is its cardinality times the signed incidence of that coordinate.
- binary_partial_word_partition_both_bitsEvery mentioned coordinate of a finite partial-word cube partition occurs with both Boolean values.
- binary_partial_word_partition_dimension_boundA finite partition of a Boolean cube by pairwise conflicting partial words, mentioning every coordinate, has at least one more part than…
- binary_partial_word_cube_cardA partial-word cube on a finite coordinate type has cardinality two to the number of coordinates outside its support.
- binary_partial_word_cube_odd_sumA rational function which changes sign under flipping a free coordinate of a partial-word cube sums to zero on that cube.
- binary_partial_word_cube_cover_iffA family of partial-word cubes covers the whole Boolean cube exactly when every Boolean assignment agrees with one of the partial words on…
- binary_partial_word_cube_disjointTwo partial-word cubes with a conflicting supported coordinate are disjoint.
- 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_twinsIf a coordinate appears in exactly two parts of a Boolean cube partition, once at each value, those parts have equal supports and agree at…
- binary_partial_word_cube_sign_pair_sumFor distinct coordinates, their sign product summed on a partial-word cube equals its cardinality times the two signed incidences.
- binary_partial_word_partition_momentsFor a partition by pairwise conflicting partial-word cubes, the cardinality-weighted first signed incidences and mixed signed incidences…
- 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_cube_packingPairwise conflicting partial words pack disjoint cubes into the full Boolean cube, bounding the sum of their cardinalities.
- 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…
- binary_partial_word_cube_cover_of_volume_eqPairwise conflicting partial words whose rational volume sum is one cover the entire finite Boolean cube.
Lean source view module on GitHub
open Finset set_option maxHeartbeats 1000000 set_option maxRecDepth 4000 def binary_partial_word_cube {V : Type*} [Fintype V] [DecidableEq V] (s : Finset V) (b : V → Bool) : Finset (V → Bool) := Fintype.piFinset (fun v => if v ∈ s then {b v} else univ)