Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 36 — any admissible P₁, …, P_q is the strict fundamental set of a unique (C*)-matroid

Proved
WhitneyMatroid.Binary.exists_unique_matroid_of_strictFundamentalSet

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

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

Let e1,…,ene_1, \dots, e_ne1​,…,en​ be a set of elements, n=r+qn = r + qn=r+q, and let P1,…,PqP_1, \dots, P_qP1​,…,Pq​ be any subsets such that PiP_iPi​ contains en−q+ie_{n-q+i}en−q+i​ and possibly elements from e1,…,en−qe_1, \dots, e_{n-q}e1​,…,en−q​ alone:

en−q+i∈Pi⊆{e1,…,en−q}∪{en−q+i}(i=1,…,q).e_{n-q+i} \in P_i \subseteq \{e_1, \dots, e_{n-q}\} \cup \{e_{n-q+i}\} \qquad (i = 1, \dots, q).en−q+i​∈Pi​⊆{e1​,…,en−q​}∪{en−q+i​}(i=1,…,q).

Then there is a unique matroid MMM on e1,…,ene_1, \dots, e_ne1​,…,en​ satisfying Postulate (C*) with P1,…,PqP_1, \dots, P_qP1​,…,Pq​ as a strict fundamental set of circuits (with respect to en−q+1,…,ene_{n-q+1}, \dots, e_nen−q+1​,…,en​).

In Whitney's words, this furnishes a simple method of constructing all matroids satisfying (C*): each is obtained from a free choice of qqq subsets of e1,…,en−qe_1, \dots, e_{n-q}e1​,…,en−q​.

Formalization Note Elements are Fin (r + q) (ek↦k−1e_k \mapsto k-1ek​↦k−1); en−q+ie_{n-q+i}en−q+i​ is Fin.natAdd r (i-1) and {e1,…,en−q}\{e_1, \dots, e_{n-q}\}{e1​,…,en−q​} is the range of Fin.castAdd q. Uniqueness is among matroids whose ground set is all of Fin (r + q).

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

/-- Theorem 36 (Appendix, p. 531). Let `e₁, …, eₙ` (`Fin (r + q)`) be a set of elements, and let
`P₁, …, P_q` be any subsets such that `Pᵢ` contains `e_{n-q+i}` and possibly elements from
`e₁, …, e_{n-q}` alone. Then there is a unique matroid `M` on `e₁, …, eₙ` satisfying (C*), with
`P₁, …, P_q` as a strict fundamental set of circuits (with respect to `e_{n-q+1}, …, eₙ`). -/
theorem exists_unique_matroid_of_strictFundamentalSet {r q : ℕ}
    (P : Fin q → Set (Fin (r + q)))
    (hmem : ∀ i, Fin.natAdd r i ∈ P i)
    (hsub : ∀ i, P i ⊆ insert (Fin.natAdd r i) (Set.range (Fin.castAdd q : Fin r → Fin (r + q)))) :
    ∃! M : Matroid (Fin (r + q)),
      M.E = Set.univ ∧ SatisfiesCStar {C | M.IsCircuit C} ∧ IsStrictFundamentalSet M P := by sorry

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