Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PROPOSITION 1, p. 70 — Axioms 1 and 2' are equivalent to Axioms 1 and 2

Proved
EdmondsPartition.Main.proposition_1

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

circuitmatroidmatroid-axiomsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let MMM be a finite set and let a family of subsets of MMM be called independent. Axiom 1 says that every subset of an independent set is independent; Axiom 2 says that for every A⊆MA\subseteq MA⊆M all maximal independent subsets of AAA have the same cardinality; Axiom 2' says that for every independent set III and element eee, the set I∪{e}I\cup\{e\}I∪{e} contains at most one circuit (minimal dependent set). Then

Axiom 1∧Axiom 2  ⟺  Axiom 1∧Axiom 2’.\text{Axiom 1}\wedge\text{Axiom 2}\iff\text{Axiom 1}\wedge\text{Axiom 2'}.Axiom 1∧Axiom 2⟺Axiom 1∧Axiom 2’.

This lets the proof of THEOREM 1 work with Axiom 2', a statement about circuits, instead of the cardinality axiom that defines a matroid.

Formalization Note No other hypothesis is assumed: the statement is for an arbitrary family of subsets of a finite type, including the empty family (for which both sides hold).

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_1 {α : Type*} [Fintype α] [DecidableEq α]
    (Indep : Finset α → Prop) :
    (IndepI1 Indep ∧ Axiom2 Indep) ↔ (IndepI1 Indep ∧ Axiom2' Indep) := by sorry

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