Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1.6, proof of THEOREM 1, p. 71 — rank drop: S(I ∩ S) ⊆ S and r(S(I ∩ S)) < r(S)

Proved
EdmondsPartition.Main.span_inter_rank_lt

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

matroidmatroid-partitionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1rankspan

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. A span is a set SSS such that no circuit (minimal dependent set) has exactly one element outside SSS, and S(A)S(A)S(A) is the minimal span containing AAA. Let SSS be a span and III an independent set with ∣I∩S∣<r(S)|I\cap S|<r(S)∣I∩S∣<r(S). Then

S(I∩S)⊆Sandr(S(I∩S))<r(S).S(I\cap S)\subseteq S\qquad\text{and}\qquad r\bigl(S(I\cap S)\bigr)<r(S).S(I∩S)⊆Sandr(S(I∩S))<r(S).

In the main proof this is the step Si+1=S(Ii+1∩Si)S_{i+1}=S(I_{i+1}\cap S_i)Si+1​=S(Ii+1​∩Si​) with r(Si+1)<r(Si)r(S_{i+1})<r(S_i)r(Si+1​)<r(Si​), which makes the chain of spans S1⊇S2⊇⋯S_1\supseteq S_2\supseteq\cdotsS1​⊇S2​⊇⋯ strictly decrease in rank and hence terminate.

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.

Preamble
import Mathlib
import Definitions.Def_WhitneyMatroid_RankIndep_Postulates
import Definitions.Def_EdmondsPartition_Main_Basic
Formal statement
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
Source
Edmonds, Minimum partition of a matroid into independent subsets, J. Res. NBS 69B (1965), p. 71, §1.6, proof of THEOREM 1 ("Where S_{i+1} = S(I_{i+1} ∩ S_i), we have r(S_{i+1}) < r(S_i)"; "By construction, S₁ ⊃ S₂ ⊃ … ⊃ S_h")
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