PROPOSITION 4, p. 70 — e ∈ S(A) iff e ∈ A or some circuit C has C − A = {e}
ProvedEdmondsPartition.Main.proposition_4Throughout, 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 circuit is a minimal dependent set, and a span is a set such that no circuit has exactly one element outside ; the span of is the minimal span containing . Then for every and every element ,
This gives the span an explicit description in terms of circuits and is the form in which spans are used in the main proof.
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. is the intersection of all spans containing .
import Mathlib import Definitions.Def_WhitneyMatroid_RankIndep_Postulates import Definitions.Def_EdmondsPartition_Main_Basic
namespace EdmondsPartition.Main
open WhitneyMatroid.RankIndep
theorem proposition_4 {α : Type*} [Fintype α] [DecidableEq α] (Indep : Finset α → Prop)
(h1 : IndepI1 Indep) (h2 : Axiom2 Indep) (h0 : Indep ∅) :
∀ (A : Finset α) (e : α),
e ∈ spanOf Indep A ↔ e ∈ A ∨ ∃ C : Finset α, IsCircuit Indep C ∧ C \ A = {e} := by sorry
end EdmondsPartition.Main
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.