§1.6, proof of THEOREM 1, p. 71 — rank drop: S(I ∩ S) ⊆ S and r(S(I ∩ S)) < r(S)
ProvedEdmondsPartition.Main.span_inter_rank_ltThroughout, 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 , and is the minimal span containing . Let be a span and an independent set with . Then
In the main proof this is the step with , which makes the chain of spans strictly decrease in rank and hence terminate.
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.
import Mathlib import Definitions.Def_WhitneyMatroid_RankIndep_Postulates import Definitions.Def_EdmondsPartition_Main_Basic
namespace EdmondsPartition.Main
open WhitneyMatroid.RankIndep
theorem span_inter_rank_lt {α : Type*} [Fintype α] [DecidableEq α] (Indep : Finset α → Prop)
(h1 : IndepI1 Indep) (h2 : Axiom2 Indep) (h0 : Indep ∅)
(S I : Finset α) (hS : IsSpan Indep S) (hI : Indep I)
(hlt : ((I ∩ S).card : ℤ) < rankOfIndep Indep S) :
spanOf Indep (I ∩ S) ⊆ S ∧ rankOfIndep Indep (spanOf Indep (I ∩ S)) < rankOfIndep Indep S := by sorry
end EdmondsPartition.Main
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.