apply_repairs
def
Given a type α with decidable equality, a family A : Finset (Finset α), and a collection of repairs R : Finset (Finset (Finset α)), apply_repairs A R is the union of A minus the conflict neighborhood of the union of R in A, and the union of all sets in R.
Statement
def apply_repairs {α : Type*} [DecidableEq α] (A : Finset (Finset α)) (R : Finset (Finset (Finset α))) : Finset (Finset α)
- Defined in
- arXiv:2610.10036 Sec. 1.1
- Verified
- 19 Oct 2026
- Axioms
- none listed
- Built on 1
- conflict_neighborhoodGiven a type α with decidable equality and two finite collections of finite subsets of α, A and X (both of type Finset (Finset α)),…
- Used by 2
- apply_repairs_emptyFor any type α with decidable equality and family A : Finset (Finset α), applying the empty repair family to A yields A.
- 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…
Read back from the Lean
Given a type α with decidable equality, a finite set A of finite subsets of α, and a finite set R of finite sets of finite subsets of α, apply_repairs A R is defined as the union of:
1. A \ conflict_neighborhood A (R.biUnion id), and
2. R.biUnion id.
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
/-- The packing obtained by applying a compatible family of repairs R to A. -/ def apply_repairs {α : Type*} [DecidableEq α] (A : Finset (Finset α)) (R : Finset (Finset (Finset α))) : Finset (Finset α) := (A \ conflict_neighborhood A (R.biUnion id)) ∪ (R.biUnion id)