The matroids here are infinite matroids in the sense of Bruhn, Diestel, Kriesell, Pendavingh and Wollan, whose axioms provide restriction, contraction and duality. For a matroid on and , the contraction of onto is . A packing/covering partition of a family of matroids on is a partition together with pairwise disjoint sets , each spanning the restriction , and sets , each independent in , whose union is . The infinite matroid packing/covering conjecture asserts that every family of matroids on a common ground set, indexed by a set, has a packing/covering partition. A pair of matroids on satisfies intersection if some set independent in both has a partition with . The unrestricted infinite Matroid Intersection Conjecture asserts that every pair of matroids on a common ground set satisfies intersection. A matroid is self-dual if on the same labelled ground set. Uniform matroids are those in which every subset of the ground set is independent or spanning. A matroid is partitional if, up to relabelling, it is a direct sum of uniform matroids. A matroid is finitary if a set is independent whenever all its finite subsets are independent. A matroid is cofinitary if its dual is finitary.
Bowler and Carmesin formulated the packing/covering conjecture. They proved that a pair of matroids on one ground set satisfies intersection if and only if has a packing/covering partition. Nash-Williams’ original intersection conjecture, in an early published formulation by Aharoni and Ziv, concerned finitary matroids. Joó proved intersection for two finitary matroids on a countable ground set. Joó later proved that every family of matroids on a countable ground set, indexed by a set, whose members are direct sums of finitary and cofinitary matroids has a packing/covering partition. Intersection for an arbitrary matroid paired with a direct sum of finitely many uniform matroids was also proved by Joó. He asked there whether intersection holds for two partitional matroids on a common countable ground set. Bowler and Geschke constructed self-dual uniform matroids on a countably infinite set under Martin’s axiom for countable partially ordered sets, and hence under the continuum hypothesis. They left open whether an infinite self-dual uniform matroid can be constructed in ZFC.
The preprint proves in ZFC that there are a countably infinite set and two self-dual matroids on such that for every independent set of and every independent set of . The pair has no packing/covering partition. It also does not satisfy intersection. Both and are partitional. The preprint also constructs in ZFC a self-dual uniform matroid on a countably infinite set. It further shows that neither nor has a nonempty finitary or cofinitary direct summand, which the Lean library does not contain.
The results on these pages are those of the Lean library InfiniteMatroid, each stated as the Lean library states it and linked to the Lean declaration behind it. Lean has checked every result of the Lean library, so the Lean library is the reference. Where the preprint states a result differently, the statement on its page is the Lean library’s, with the preprint’s beside it. The preprint is a guide only: it gives the results their order and their names.
InfiniteMatroid is a Lean library: 31 items, in seven groups. Each has a page written by OctoInform, listed below.
No item matches.