Theorem 33 — under (C*), a circuit is a minimal non-null cycle, and conversely
ProvedWhitneyMatroid.Binary.isCircuit_iff_minimal_nonnull_cyclebinary-matroidscombinatoricsmatroidsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a matroid on a finite set of elements satisfying Postulate (C*). Then a set is a circuit of if and only if it is a minimal non-null cycle: is a cycle, , and
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.