The Setting
A pair of matroids on a common ground set satisfies intersection when there are a set independent in both and and a partition of into sets and with (1)✦ The Matroid Intersection Conjecture asserts that every such pair satisfies intersection.
A matroid is uniform when every subset of its ground set is independent or spanning in .✦ A matroid on a set is partitional when there are uniform matroids on sets , indexed by in a set , and a bijection from the disjoint union of the onto with (2)✦
The question here is whether intersection can fail for two partitional matroids on a countable ground set. The pair examined is made of the two ray matroids of one self-dual uniform matroid : copies of laid along the integers, at the even integers for one matroid and at the odd integers for the other.
Ray Matroids
The set is the countable set of pairs with a natural number and .✦ The set is the disjoint union of two copies of , the left copy made of the pairs with second entry false and the right copy of those with second entry true.✦ The ground set is the union of the bundles for .✦
Let be a set and a matroid on , its two halves named as in . For a parity , the vertices of parity are the integers with .✦ Each such vertex carries a copy of , placed on the two bundles and by the map , (3)✦ The ray matroid of parity is the matroid on obtained from the direct sum of one copy of for each vertex of parity by sending each element of the copy at to : (4)✦ For a matroid on we write and , two matroids on .
Packing and Covering
For a matroid and a subset of its ground set, the contraction of onto is the matroid on .✦
A pair of matroids on a common ground set has a packing/covering partition when there are disjoint sets and with , disjoint sets and sets such that (5)✦ Two matroids and on a common ground set have an independent cover when is the union of a set independent in and a set independent in .
The Claim
Theorem 1.
The set is countably infinite, and there is a uniform matroid on with whose ray matroids and are partitional and satisfy (6)✦ and for which the pair has no independent cover, has no packing/covering partition and does not satisfy intersection.
Let and be matroids with the same ground set such that satisfies intersection. Then (7)✦
Let be a set, a uniform matroid on and . Then (8)✦
In the paper, the result reads: the pair of Theorem 1.1 consists of partitional matroids and does not satisfy intersection, in that for every set independent in both and every partition ; hence the unrestricted infinite Matroid Intersection Conjecture is false in Zermelo-Fraenkel set theory with choice, and Joó’s Question 1.5 has a negative answer for two partitional matroids on a common countable ground set.
What Is Checked
The claim is stated over the sets , and , the ray matroids (4) with their placements (3), uniform and partitional matroids (2), the contraction onto a set, independent covers, packing/covering partitions (5) and intersection (1).
About these constructions, the library also shows that for each parity the map of (4) is a bijection from the pairs , with a vertex of parity and , onto .✦