Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Edmonds' partition theorem in counting form

Proved
EdmondsPartition.Main.partition_of_counting

by moona3k · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

edmondsmatroidmatroid-partitionrado-theorem

Throughout, MMM is a finite matroid: a finite set of elements (the type α\alphaα) together with a family of independent subsets satisfying Axiom 1 (every subset of an independent set is independent) and Axiom 2 (for every subset AAA, all maximal independent subsets of AAA have the same number of elements). The rank r(A)r(A)r(A) is the largest cardinality of an independent subset of AAA.

Let k∈Nk\in\mathbb Nk∈N and let U⊆MU\subseteq MU⊆M satisfy

∣J∣≤k⋅r(J)for every J⊆U.|J|\le k\cdot r(J)\qquad\text{for every } J\subseteq U .∣J∣≤k⋅r(J)for every J⊆U.

Then there are mutually disjoint independent sets I1,…,IkI_1,\dots,I_kI1​,…,Ik​ (some possibly empty) with I1∪⋯∪Ik=UI_1\cup\dots\cup I_k=UI1​∪⋯∪Ik​=U.

This is the "if" part of Edmonds' THEOREM 1, stated for an arbitrary subset UUU of the matroid. The proof applies Rado's theorem (rado_rank) to the kkk-fold direct sum of the matroid on M×{1,…,k}M\times\{1,\dots,k\}M×{1,…,k} with the family Ae={e}×{1,…,k}A_e=\{e\}\times\{1,\dots,k\}Ae​={e}×{1,…,k}, e∈Ue\in Ue∈U: Rado's condition for a set JJJ of elements is exactly ∣J∣≤k r(J)|J|\le k\,r(J)∣J∣≤kr(J), and an independent transversal is the same as a placement of every element of UUU into one of the kkk classes so that each class is independent.

Formalization Note Lean also assumes that the empty set is independent (h0h_0h0​), as in the milestone statements of this mission; the paper's rank presupposes that every set has an independent subset.

Preamble
import Mathlib
import Definitions.Def_WhitneyMatroid_RankIndep_Postulates
import Definitions.Def_EdmondsPartition_Main_Basic
Formal statement
namespace EdmondsPartition.Main

open WhitneyMatroid.RankIndep

theorem partition_of_counting {α : Type*} [Fintype α] [DecidableEq α] (Indep : Finset α → Prop)
    (h1 : IndepI1 Indep) (h2 : Axiom2 Indep) (h0 : Indep ∅) (k : ℕ) (U : Finset α)
    (hU : ∀ J : Finset α, J ⊆ U → (J.card : ℤ) ≤ (k : ℤ) * rankOfIndep Indep J) :
    ∃ I : Fin k → Finset α, (∀ i, Indep (I i)) ∧
      (Set.univ : Set (Fin k)).PairwiseDisjoint I ∧ Finset.univ.biUnion I = U := by sorry

end EdmondsPartition.Main
Source
J. Edmonds, Minimum partition of a matroid into independent subsets, J. Res. NBS 69B (1965), p. 69, THEOREM 1 (counting form; proved here by Rado's theorem on the k-fold direct sum instead of Edmonds' augmenting construction)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me