Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9 — a base B = e₁ + ⋯ + e_{n−q} determines a unique strict fundamental set of circuits

Proved
WhitneyMatroid.Binary.exists_unique_strictFundamentalSet

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

combinatoricsfundamental-circuitsmatroidsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let MMM be a matroid on the elements e1,…,ene_1, \dots, e_ne1​,…,en​, n=r+qn = r + qn=r+q, and suppose B={e1,…,en−q}B = \{e_1, \dots, e_{n-q}\}B={e1​,…,en−q​} is a base of MMM. Then there is a strict fundamental set of circuits P1,…,PqP_1, \dots, P_qP1​,…,Pq​ with respect to en−q+1,…,ene_{n-q+1}, \dots, e_nen−q+1​,…,en​, and it is unique:

∃! (P1,…,Pq) strict fundamental set of circuits of M w.r.t. en−q+1,…,en.\exists!\, (P_1, \dots, P_q) \text{ strict fundamental set of circuits of } M \text{ w.r.t. } e_{n-q+1}, \dots, e_n.∃!(P1​,…,Pq​) strict fundamental set of circuits of M w.r.t. en−q+1​,…,en​.

This is the matroid analogue of reducing a non-singular square submatrix to the unit matrix by row operations. It provides the fundamental circuits from which, for matroids satisfying (C*), all cycles and circuits are recovered (Theorems 34 and 35) and the representing matrix is built (Theorem 37).

Formalization Note Elements are Fin (r + q) with ek↦k−1e_k \mapsto k-1ek​↦k−1; the base is the range of Fin.castAdd q. The ground set of M is assumed to be all of Fin (r + q) (Whitney's matroid consists of exactly the elements e1,…,ene_1, \dots, e_ne1​,…,en​). Uniqueness is uniqueness of the whole indexed family P1,…,PqP_1, \dots, P_qP1​,…,Pq​.

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

/-- Theorem 9 (§9, p. 517). If `B = e₁ + ⋯ + e_{n-q}` is a base in `M = e₁ + ⋯ + eₙ`, then
there is a strict fundamental set of circuits with respect to `e_{n-q+1}, …, eₙ`; these circuits
are uniquely determined. Elements `e_k ↦ k - 1 : Fin (r + q)`, `n = r + q`. -/
theorem exists_unique_strictFundamentalSet {r q : ℕ} (M : Matroid (Fin (r + q)))
    (hE : M.E = Set.univ) (hB : M.IsBase (Set.range (Fin.castAdd q : Fin r → Fin (r + q)))) :
    ∃! P : Fin q → Set (Fin (r + q)), IsStrictFundamentalSet M P := by sorry

end WhitneyMatroid.Binary
Source
Whitney, On the Abstract Properties of Linear Dependence, Amer. J. Math. 57 (1935), p. 517, Theorem 9
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