Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

PROPOSITION 2, p. 70 — Axioms 1 and 2' are equivalent to the circuit axioms 1c and 2c

Proved
EdmondsPartition.Main.proposition_2

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. For a family C\mathcal CC of subsets ("circuits"), Axiom 1c says no circuit contains a different circuit, and Axiom 2c says that if distinct circuits C1,C2C_1,C_2C1​,C2​ both contain an element eee, then (C1∪C2)∖{e}(C_1\cup C_2)\setminus\{e\}(C1​∪C2​)∖{e} contains a circuit. Starting from circuits, call a set independent when it contains no circuit.

  1. If a family of independent sets satisfies Axioms 1 and 2', then its circuits (minimal dependent sets) satisfy Axioms 1c and 2c, and the sets containing none of these circuits are exactly the independent sets.
  2. If a family C\mathcal CC satisfies Axioms 1c and 2c, then the sets containing no member of C\mathcal CC satisfy Axioms 1 and 2', and the minimal dependent sets of this system are exactly the members of C\mathcal CC.

Together the two translations are mutually inverse, so matroids can equally be axiomatized by their circuits.

Formalization Note Both directions are stated for arbitrary families of subsets of a finite type, with no non-emptiness assumption; for the empty independence family the circuits are {∅}\{\emptyset\}{∅}, and conversely.

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_2 {α : Type*} [Fintype α] [DecidableEq α] :
    (∀ Indep : Finset α → Prop, IndepI1 Indep → Axiom2' Indep →
      Axiom1c (IsCircuit Indep) ∧ Axiom2c (IsCircuit Indep) ∧
        indepOfCircuits (IsCircuit Indep) = Indep) ∧
    (∀ Circ : Finset α → Prop, Axiom1c Circ → Axiom2c Circ →
      IndepI1 (indepOfCircuits Circ) ∧ Axiom2' (indepOfCircuits Circ) ∧
        IsCircuit (indepOfCircuits Circ) = Circ) := by sorry

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