is_compatible_repair_family
def
For a type α with decidable equality, a finite collection of repairs R : Finset (Finset (Finset α)) is compatible (is_compatible_repair_family R) if the union of all sets appearing in repairs in R (as a subset of Finset α) is pairwise disjoint.
Statement
def is_compatible_repair_family {α : Type*} [DecidableEq α] (R : Finset (Finset (Finset α))) : Prop
- Defined in
- arXiv:2610.10036 Sec. 1.1
- Verified
- 19 Oct 2026
- Axioms
- none listed
- Used by 2
- apply_repairs_is_packingIn a weighted k-set packing instance inst over α with decidable equality, applying a compatible family of repairs R whose sets belong to…
- claws_from_packing_compatibleIn a weighted k-set packing instance inst over α with decidable equality, any collection of repairs R : Finset (Finset (Finset α)) whose…
Read back from the Lean
For a type α with decidable equality and a finite set R of finite sets of finite subsets of α (R : Finset (Finset (Finset α))), is_compatible_repair_family R asserts that the union of all families in R (that is, the set of all A : Finset α belonging to some S ∈ R) is pairwise disjoint: for any two distinct elements A and B in this union, A and B are disjoint (A ∩ B = ∅).
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
/-- A family of repairs is compatible if their constituent sets are pairwise disjoint. -/ def is_compatible_repair_family {α : Type*} [DecidableEq α] (R : Finset (Finset (Finset α))) : Prop := (R.biUnion id : Set (Finset α)).PairwiseDisjoint id