§1.6, proof of THEOREM 1, p. 70 — the "if" part needs |S| ≤ k·r(S) only for spans S
ProvedEdmondsPartition.Main.if_part_of_spansThroughout, 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 . A span is a set such that no circuit (minimal dependent set) has exactly one element outside . If every span of satisfies
then can be partitioned into mutually disjoint independent sets (some possibly empty).
Since every span is a subset of , this strengthens the "if" direction of THEOREM 1: the inequality need only be checked on spans.
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. The partition is an indexed family of pairwise disjoint independent sets covering , with empty parts allowed.
import Mathlib import Definitions.Def_WhitneyMatroid_RankIndep_Postulates import Definitions.Def_EdmondsPartition_Main_Basic
namespace EdmondsPartition.Main
open WhitneyMatroid.RankIndep
theorem if_part_of_spans {α : Type*} [Fintype α] [DecidableEq α] (Indep : Finset α → Prop)
(h1 : IndepI1 Indep) (h2 : Axiom2 Indep) (h0 : Indep ∅) (k : ℕ)
(hspan : ∀ S : Finset α, IsSpan Indep S → (S.card : ℤ) ≤ (k : ℤ) * rankOfIndep Indep S) :
∃ I : Fin k → Finset α, IsPartitionInto Indep k I := by sorry
end EdmondsPartition.Main
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.