The Setting
Matroids are the infinite matroids of Bruhn, Diestel, Kriesell, Pendavingh and Wollan, given by their bases with the maximality axiom. For a matroid , is its dual and its restriction to a set ; a matroid with ground set is self-dual when . The contraction of a matroid onto a set is the matroid (1)✦
A packing/covering partition of two matroids and with a common ground set is a partition of into sets and such that and have disjoint spanning sets and , and and have independent sets and whose union is : (2)✦ The infinite matroid packing/covering conjecture asserts that every pair of matroids with a common ground set has a packing/covering partition.
The Double Ray
Let be the set of all Boolean functions, each paired with its number of variables✦, and let be the product of the integers with : (3)✦
Over a set , the set is a double ray: its vertices are the integers, and its edges are the bundles , the bundle joining the vertices and . The set is the double ray over .✦ For , the vertices of parity are the integers .✦
Let be a matroid on , two copies of labelled and . At a vertex , the map from to lays the two copies on the bundles and that meet at : for , (4)✦ The ray matroid of parity is the matroid on obtained from the direct sum of copies of , one at each vertex of parity , by carrying the copy at through : (5)✦
The Claim
Theorem 1.
The set is countably infinite, and there are self-dual matroids and , each with ground set , such that every independent set of and every independent set of satisfy (6)✦ and the pair has no packing/covering partition.
Let be a set and a matroid on . If is independent in and is independent in , then (7)✦
Let and be self-dual matroids, each with ground set , and suppose the pair has a packing/covering partition. Then there are an independent set of and an independent set of with (8)✦
In the paper, the result reads: in Zermelo-Fraenkel set theory with the axiom of choice (ZFC) there are a countably infinite set and two infinite matroids , on with on the same labelled ground set, such that for every independent set of and of ; the pair has no packing/covering partition, and consequently the infinite matroid packing/covering conjecture is false.
What Is Checked
The claim is stated over infinite matroids given by bases with the maximality axiom, with their duals, restrictions and self-duality, the contraction (1), the packing/covering partition (2), the set and the double ray of (3), and the ray matroids of (5), laid out by the maps of (4). The library proves that for each parity the map is a bijection from the disjoint union of copies of , one at each vertex of parity , onto .✦