Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1.6, proof of THEOREM 1, p. 71 — counting step: some member I of F has |I ∩ S| < r(S)

Proved
EdmondsPartition.Main.exists_member_inter_lt_rank

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

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

Let MMM be a finite set with an independence family and rank r(A)r(A)r(A), the largest cardinality of an independent subset of AAA. Let I1,…,IkI_1,\dots,I_kI1​,…,Ik​ be mutually disjoint subsets of MMM and let xxx be an element in none of them. If S⊆MS\subseteq MS⊆M contains xxx and ∣S∣≤k⋅r(S)|S|\le k\cdot r(S)∣S∣≤k⋅r(S), then there is an index iii with

∣Ii∩S∣<r(S).|I_i\cap S|<r(S).∣Ii​∩S∣<r(S).

In the main proof this is applied to the nested spans S0=M⊇S1⊇⋯S_0=M\supseteq S_1\supseteq\cdotsS0​=M⊇S1​⊇⋯: if every IiI_iIi​ had r(S)r(S)r(S) elements in SSS, their disjoint union together with xxx would give more than k⋅r(S)k\cdot r(S)k⋅r(S) elements in SSS.

Formalization Note The argument is pure counting, so no matroid axiom and no independence of the IiI_iIi​ is assumed; this makes the statement stronger than the page's setting, where the IiI_iIi​ are the independent members of the family FFF.

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

open WhitneyMatroid.RankIndep

theorem exists_member_inter_lt_rank {α : Type*} [Fintype α] [DecidableEq α]
    (Indep : Finset α → Prop) (k : ℕ) (I : Fin k → Finset α)
    (hdisj : (Set.univ : Set (Fin k)).PairwiseDisjoint I) (x : α) (hx : ∀ i, x ∉ I i)
    (S : Finset α) (hxS : x ∈ S) (hS : (S.card : ℤ) ≤ (k : ℤ) * rankOfIndep Indep S) :
    ∃ i : Fin k, ((I i ∩ S).card : ℤ) < 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 ("Similarly, x ∈ S₁ = S(I₁) implies …")
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