Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 33 — under (C*), a circuit is a minimal non-null cycle, and conversely

Proved
WhitneyMatroid.Binary.isCircuit_iff_minimal_nonnull_cycle

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 a finite set of elements satisfying Postulate (C*). Then a set CCC is a circuit of MMM if and only if it is a minimal non-null cycle: CCC is a cycle, C≠∅C \neq \emptysetC=∅, and

D a non-null cycle, D⊆C  ⟹  D=C.D \text{ a non-null cycle},\ D \subseteq C \implies D = C.D a non-null cycle, D⊆C⟹D=C.

This identifies the circuits of a (C*)-matroid from its cycles alone, which is how Theorem 36 defines the circuits of the matroid it constructs and how Theorem 35 recovers all circuits from a fundamental set.

Formalization Note Cycles are taken with respect to the circuit family {C | M.IsCircuit C} of the Mathlib matroid M; the ground type is finite.

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

/-- Theorem 33 (Appendix, p. 531). In a matroid `M` satisfying (C*), a circuit is a minimal
non-null cycle, and conversely. -/
theorem isCircuit_iff_minimal_nonnull_cycle {α : Type*} [Finite α] (M : Matroid α)
    (hC : SatisfiesCStar {C | M.IsCircuit C}) (C : Set α) :
    M.IsCircuit C ↔
      (IsCycleOf {C | M.IsCircuit C} C ∧ C.Nonempty ∧
        ∀ D : Set α, IsCycleOf {C | M.IsCircuit C} D → D.Nonempty → D ⊆ C → D = C) := by sorry

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