Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PROPOSITION 3 (Lehman), p. 70 — strong circuit elimination: a ∈ C ⊆ C₁ ∪ C₂ − e

Proved
EdmondsPartition.Main.proposition_3

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

circuitcircuit-eliminationmatroidp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let C\mathcal CC be a family of subsets ("circuits") of a finite set satisfying Axiom 1c (no circuit contains a different circuit) and Axiom 2c (if distinct circuits C1,C2C_1,C_2C1​,C2​ both contain eee, then (C1∪C2)∖{e}(C_1\cup C_2)\setminus\{e\}(C1​∪C2​)∖{e} contains a circuit). If C1,C2C_1, C_2C1​,C2​ are circuits with an element e∈C1∩C2e\in C_1\cap C_2e∈C1​∩C2​ and an element a∈C1∖C2a\in C_1\setminus C_2a∈C1​∖C2​, then there is a circuit CCC with

a∈C⊆(C1∪C2)∖{e}.a\in C\subseteq (C_1\cup C_2)\setminus\{e\}.a∈C⊆(C1​∪C2​)∖{e}.

This strengthening of Axiom 2c, due to Lehman, controls which element the eliminated circuit keeps; it is used in the proof of PROPOSITION 4.

Formalization Note The page states the result for the circuits of a matroid, but its proof assumes only Axioms 1c and 2c, so it is stated for any circuit family satisfying them; the matroid form follows by PROPOSITION 2. Edmonds writes ⊂\subset⊂ for inclusion, rendered here as ⊆\subseteq⊆.

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

open WhitneyMatroid.RankIndep

theorem proposition_3 {α : Type*} [Fintype α] [DecidableEq α]
    (Circ : Finset α → Prop) (h1c : Axiom1c Circ) (h2c : Axiom2c Circ) :
    ∀ (C₁ C₂ : Finset α) (e a : α), Circ C₁ → Circ C₂ → e ∈ C₁ → e ∈ C₂ → a ∈ C₁ → a ∉ C₂ →
      ∃ C : Finset α, Circ C ∧ a ∈ C ∧ C ⊆ (C₁ ∪ C₂).erase e := by sorry

end EdmondsPartition.Main
Source
Edmonds, Minimum partition of a matroid into independent subsets, J. Res. NBS 69B (1965), p. 70, PROPOSITION 3 (Lehman)
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