binary_partial_word_sign
def
The rational signed incidence of a coordinate in a partial word, with zero outside its support.
Statement
def binary_partial_word_sign {V : Type*} [DecidableEq V] (s : Finset V) (b : V → Bool) (v : 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
- Built on 1
- binary_bool_signThe rational sign of a Boolean value: true gives one and false gives minus one.
- Used by 4
- 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_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_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…
Lean source view module on GitHub
open Finset set_option maxHeartbeats 1000000 set_option maxRecDepth 4000 def binary_partial_word_sign {V : Type*} [DecidableEq V] (s : Finset V) (b : V → Bool) (v : V) : ℚ := if v ∈ s then binary_bool_sign (b v) else 0