Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 35 — the circuits of a strict fundamental set determine all circuits

Proved
WhitneyMatroid.Binary.circuits_determined_by_strictFundamentalSet

by mikedeng1 · 1 vote · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

binary-matroidscombinatoricsmatroidsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

As soon as the circuits of a strict fundamental set are known, all the circuits may be determined. Precisely: let MMM and M′M'M′ be two matroids on the same elements e1,…,ene_1, \dots, e_ne1​,…,en​, n=r+qn = r + qn=r+q, both satisfying Postulate (C*), and let P1,…,PqP_1, \dots, P_qP1​,…,Pq​ be a strict fundamental set of circuits with respect to en−q+1,…,ene_{n-q+1}, \dots, e_nen−q+1​,…,en​ in both MMM and M′M'M′. Then for every set CCC of elements,

C is a circuit of M  ⟺  C is a circuit of M′.C \text{ is a circuit of } M \iff C \text{ is a circuit of } M'.C is a circuit of M⟺C is a circuit of M′.

This contrasts with matroids in general: Whitney's example at the end of §9 gives two matroids with a common strict fundamental set and different circuits. Theorem 37 uses this result to identify the matroid of the constructed matrix with MMM.

Formalization Note Both matroids have ground set all of Fin (r + q). "Determined" is formalized as the statement Theorem 37's proof uses: two (C*)-matroids sharing a strict fundamental set have the same circuits.

Preamble
import Mathlib
import Definitions.Def_WhitneyMatroid_Binary_Cycles
import Definitions.Def_WhitneyMatroid_Binary_IsStrictFundamentalSet
Formal statement
namespace WhitneyMatroid.Binary

/-- Theorem 35 (Appendix, p. 531). As soon as the circuits of a strict fundamental set are known,
all the circuits may be determined: two matroids `M`, `M'` on `e₁, …, eₙ` (`Fin (r + q)`), both
satisfying (C*), that have the same strict fundamental set of circuits `P₁, …, P_q` with respect
to `e_{n-q+1}, …, eₙ` have exactly the same circuits. -/
theorem circuits_determined_by_strictFundamentalSet {r q : ℕ} (M M' : Matroid (Fin (r + q)))
    (hE : M.E = Set.univ) (hE' : M'.E = Set.univ)
    (hC : SatisfiesCStar {C | M.IsCircuit C}) (hC' : SatisfiesCStar {C | M'.IsCircuit C})
    (P : Fin q → Set (Fin (r + q)))
    (hP : IsStrictFundamentalSet M P) (hP' : IsStrictFundamentalSet M' P) :
    ∀ C : Set (Fin (r + q)), M.IsCircuit C ↔ M'.IsCircuit C := by sorry

end WhitneyMatroid.Binary
Source
Whitney, On the Abstract Properties of Linear Dependence, Amer. J. Math. 57 (1935), p. 531, Theorem 35
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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