Relational delta-matroids on Boolean tuples #
IsDeltaMatroid R is the nonempty, one-sided symmetric exchange axiom of
Kazda, Kolmogorov and Rolínek, Definition 5, p. 4
(arXiv:1602.03124v6). Coordinates are arbitrary types; Fin n gives the usual tuples.
The set {i, j} is a singleton when i = j, allowing a one-coordinate exchange.
No simultaneous exchange at both feasible tuples is assumed.
IsEvenDeltaMatroid R additionally requires common parity, of either value, over a finite
coordinate type. Empty relations are excluded, including on the empty coordinate type.
Main definitions #
IsDeltaMatroid: nonempty one-sided symmetric exchange.IsEvenDeltaMatroid: a delta-matroid with common parity of either value.
Main results #
IsEvenDeltaMatroid.not_mem_flipOn_singleton: a one-coordinate flip is infeasible.IsEvenDeltaMatroid.exchange: exchange uses two distinct disagreeing coordinates.
A delta-matroid whose feasible tuples have common parity (possibly odd). This is the evenness condition in Definition 5 of [KKR18].
- isDeltaMatroid : IsDeltaMatroid R
- parity_eq ⦃x y : ι → Bool⦄ : x ∈ R → y ∈ R → parityOn Finset.univ x = parityOn Finset.univ y
Instances For
Empty relations are not delta-matroids under the nonempty convention.
A singleton relation is a delta-matroid.
The full Boolean cube is a delta-matroid, using a single-coordinate exchange.
A singleton relation is even, including a singleton of odd parity.
Flipping one coordinate negates total parity.
Flipping two distinct coordinates preserves total parity.
Evenness rules out feasible one-coordinate flips.
In an even delta-matroid, exchange flips two distinct coordinates on which the tuples differ.
Tuples of equal parity cannot disagree at just one coordinate.
Every nonempty total-parity fiber is an even delta-matroid. The witness is necessary: the odd fiber on the empty coordinate type is empty.