The Setting
Let be a relation on a finite set , and let and be families of pairs in . A pair of advances its first coordinate along an arc, a pair of advances its second, and a pair of one family may conflict with a pair of the other. Pruning the two families means deleting pairs from both so that no conflict is left between them; the question is how few deletions suffice.
The library defines conflicts and covered points, and states, for two given families and for every two families, what a pruning must achieve.
Conflicts and Covered Points
A pair of conflicts with a pair of when (1)✦ Two families and of pairs in are conflict-free when no pair of conflicts with a pair of .✦
The set of and is the subset of of the points of their conflicts, and the set of and is the subset of of the points of their conflicts: (2)✦ (3)✦
A pair of covers a point of from the left when (4)✦ and from the right when (5)✦
The left image of a family is the set of points that some pair of covers from the left✦, and the right image of a family is the set of points that some pair of covers from the right.✦ A point of is covered by the families and when (6)✦
For two further families and of pairs in , the uncovered part of is the set of the points of that and do not cover: (7)✦
The Claim
Definition 1. Let and be families of pairs in , with the set of (3). A pruning of and is a pair of families and such that and are conflict-free, every pair of that conflicts with no pair of lies in , every pair of that conflicts with no pair of lies in , and (8)✦ where is the set of (7). A relation on a finite set has the pruning property when (9)✦
What Is Checked
The definitions are stated over a relation on a finite set and families , , , of pairs in ; a pruning (8) is stated in terms of conflicts (1), the sets and of (2) and (3), and the uncovered part (7) of .
For any two families and , the library proves (10)✦ and that and are conflict-free if and only if (11)✦