Lemma 6 — if e is dependent on P₁ but on no proper subset of P₁, then P₁ + e is a circuit
ProvedWhitneyMatroid.RankCircuit.circuit_of_minimal_dependentcircuitsmatroidsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1rank-function
Let be a rank function on the subsets of a finite set satisfying –. Let and . Suppose is dependent on , i.e. , but on no proper subset of : for every , . Then
Together with Lemma 5 this is the bridge between dependence of an element on a set and circuits through that element (Theorem 4).
Formalization Note The hypothesis is tacit in the paper (it writes and its proof uses ); it is added as a binder.
Preamble
import Mathlib import Definitions.Def_WhitneyMatroid_RankCircuit_IsRankSystem
Formal statement
namespace WhitneyMatroid.RankCircuit
theorem circuit_of_minimal_dependent {α : Type*} [Fintype α] [DecidableEq α]
(r : Finset α → ℤ) (hr : IsRankSystem r) (P₁ : Finset α) (e : α) (he : e ∉ P₁)
(hdep : IsDependentOn r e P₁) (hmin : ∀ Q : Finset α, Q ⊂ P₁ → ¬ IsDependentOn r e Q) :
circuitsOfRank r (insert e P₁) := by sorry
end WhitneyMatroid.RankCircuit
Source
Whitney, On the Abstract Properties of Linear Dependence, Amer. J. Math. 57 (1935), p. 512, Lemma 6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.