Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

THEOREM 1, p. 69 — a matroid M splits into k independent sets iff no subset A has |A| > k·r(A)

Proved
EdmondsPartition.Main.theorem_1

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

good-characterizationmatroidmatroid-partitionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rank

Throughout, MMM is a finite matroid: a finite set of elements (the type α\alphaα, with MMM 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 AAA, all maximal independent subsets of AAA have the same number of elements). For A⊆MA\subseteq MA⊆M, the rank r(A)r(A)r(A) is the largest cardinality of an independent subset of AAA. Let k≥0k\ge 0k≥0 be an integer. Then the elements of MMM can be partitioned into as few as kkk sets, each of which is independent, if and only if there is no subset AAA of MMM with

∣A∣>k⋅r(A).|A|>k\cdot r(A).∣A∣>k⋅r(A).

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 kkk sets suffice, and a single set AAA with ∣A∣>k r(A)|A|>k\,r(A)∣A∣>kr(A) 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 (h0h_0h0​). The paper's rank, "the number of elements in each maximal independent set contained in AAA", 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 kkk sets is an indexed family of kkk pairwise disjoint independent sets whose union is MMM; any number of them may be empty, as on p. 71. The rank is integer-valued and the inequality is compared in Z\mathbb ZZ. The case k=0k=0k=0 is included (it says MMM is empty iff no AAA has ∣A∣>0|A|>0∣A∣>0).

Preamble
import Mathlib
import Definitions.Def_WhitneyMatroid_RankIndep_Postulates
import Definitions.Def_EdmondsPartition_Main_Basic
Formal statement
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
Source
Edmonds, Minimum partition of a matroid into independent subsets, J. Res. NBS 69B (1965), p. 69, THEOREM 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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