THEOREM 1, p. 69 — a matroid M splits into k independent sets iff no subset A has |A| > k·r(A)
ProvedEdmondsPartition.Main.theorem_1Throughout, is a finite matroid: a finite set of elements (the type , with the whole set) together with a family of independent subsets satisfying Axiom 1 (every subset of an independent set is independent) and Axiom 2 (for every subset , all maximal independent subsets of have the same number of elements). For , the rank is the largest cardinality of an independent subset of . Let be an integer. Then the elements of can be partitioned into as few as sets, each of which is independent, if and only if there is no subset of with
This is Edmonds's matroid partition theorem. It gives a good characterization of the minimum number of independent sets needed to cover a matroid: a partition certifies that sets suffice, and a single set with certifies that they do not. For graphic matroids it specializes to Nash-Williams's theorem on covering a graph by forests, and it is the starting point of matroid union and matroid intersection theory.
Formalization Note Lean also assumes that the empty set is independent (). The paper's rank, "the number of elements in each maximal independent set contained in ", presupposes that every set has an independent subset; with an empty family Axioms 1 and 2 hold vacuously and the statement fails. A partition into sets is an indexed family of pairwise disjoint independent sets whose union is ; any number of them may be empty, as on p. 71. The rank is integer-valued and the inequality is compared in . The case is included (it says is empty iff no has ).
import Mathlib import Definitions.Def_WhitneyMatroid_RankIndep_Postulates import Definitions.Def_EdmondsPartition_Main_Basic
namespace EdmondsPartition.Main
open WhitneyMatroid.RankIndep
theorem theorem_1 {α : Type*} [Fintype α] [DecidableEq α] (Indep : Finset α → Prop)
(h1 : IndepI1 Indep) (h2 : Axiom2 Indep) (h0 : Indep ∅) (k : ℕ) :
(∃ I : Fin k → Finset α, IsPartitionInto Indep k I) ↔
¬ ∃ A : Finset α, (k : ℤ) * rankOfIndep Indep A < (A.card : ℤ) := by sorry
end EdmondsPartition.Main
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.