Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 34 — the cycles are the 2^q sums (mod 2) of a strict fundamental set

Proved
WhitneyMatroid.Binary.cycles_eq_sums_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 MMM be a matroid on the elements e1,…,ene_1, \dots, e_ne1​,…,en​, n=r+qn = r + qn=r+q, satisfying Postulate (C*), and let P1,…,PqP_1, \dots, P_qP1​,…,Pq​ be a strict fundamental set of circuits in MMM with respect to en−q+1,…,ene_{n-q+1}, \dots, e_nen−q+1​,…,en​. Then the cycles of MMM are exactly the sums (mod 2) of subfamilies of P1,…,PqP_1, \dots, P_qP1​,…,Pq​,

{cycles of M}={∑i∈sPi (mod 2)  :  s⊆{1,…,q}},\{\text{cycles of } M\} = \Big\{ \textstyle\sum_{i \in s} P_i \ (\mathrm{mod}\ 2) \;:\; s \subseteq \{1, \dots, q\} \Big\},{cycles of M}={∑i∈s​Pi​ (mod 2):s⊆{1,…,q}},

and there are exactly 2q2^q2q cycles in MMM.

So the cycles of a (C*)-matroid form a vector space over the integers mod 2 of dimension q=n(M)q = n(M)q=n(M) with the fundamental circuits as a basis; this is the counting step behind Theorems 35 and 37.

Formalization Note Elements are Fin (r + q), ground set all of it; subfamilies are indexed by Finset (Fin q) (with P i Whitney's Pi+1P_{i+1}Pi+1​), and the number of cycles is the Set.ncard of the set of cycles.

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

/-- Theorem 34 (Appendix, p. 531). Let `M` be a matroid on `e₁, …, eₙ` (`Fin (r + q)`)
satisfying (C*), and let `P₁, …, P_q` be a strict fundamental set of circuits in `M` with respect
to `e_{n-q+1}, …, eₙ`. Then the cycles in `M` are exactly the sums (mod 2) of subfamilies of
`P₁, …, P_q`, and there are exactly `2^q` of them. -/
theorem cycles_eq_sums_of_strictFundamentalSet {r q : ℕ} (M : Matroid (Fin (r + q)))
    (hE : M.E = Set.univ) (hC : SatisfiesCStar {C | M.IsCircuit C})
    (P : Fin q → Set (Fin (r + q))) (hP : IsStrictFundamentalSet M P) :
    {Q | IsCycleOf {C | M.IsCircuit C} Q} = Set.range (fun s : Finset (Fin q) => sumMod2 s P) ∧
      {Q | IsCycleOf {C | M.IsCircuit C} Q}.ncard = 2 ^ q := by sorry

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