OpenAI preprint, September 2026 · §7. The separate Covering and Packing conjectures · §7
The Covering (7.1) and Packing (7.2) conjectures:Conjecturally, a family covers
exactly when every
whose restrictions have a packing is covered by them; dually for
packing, with contractions
The Covering and Packing Conjectures for a family of matroids.
Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its
declaration both in Lean and in words.
The Setting
Take a family of matroids on a common ground set , indexed by an arbitrary set , and a set . Two questions are asked of it: whether is covered by independent sets of the matroids, one from each, and whether the matroids have pairwise disjoint spanning sets, one in each. The Covering Conjecture and the Packing Conjecture each tie one of these questions to a condition on the subsets of : the first through the restrictions of the matroids to , the second through their contractions onto .
Coverings, Packings and Contractions
A covering of a set by a family of matroids is a family of sets, each independent in its matroid, whose union is :(1)✦ A family of matroids covers a set when there is a covering of by .
A packing of a family of matroids is a family of pairwise disjoint sets, each spanning in its matroid: (2)✦
For a matroid on and a set , the contraction of onto is the matroid on given by (3)✦
The Definition
Definition 1. Let be a family of matroids on a set and let .The Covering Conjecture for and is the statement (4)✦The Packing Conjecture for and is the statement (5)✦
What Is Checked
Both conjectures are stated over an arbitrary family of matroids on and an arbitrary set , through coverings(1), packings(2), restrictions to and contractions onto (3).