Theorem 17 — building a non-separable matroid from a circuit by adding circuits
ProvedWhitneyMatroid.Components.nonSeparable_ear_decompositionconnectivitymatroidsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be a finite matroid on a ground set , and let be non-separable with nullity . Then there are sets with
- a circuit of and ;
- for , is non-separable of nullity ;
- for , there is a circuit of with
i.e. arises from by adding a set of elements which forms a circuit with one or more elements of .
This is Whitney's description of how any non-separable matroid is built up from a circuit, one unit of nullity at a time (an ear decomposition).
Formalization Note The chain is a function sets whose values at indices are the matroids of the paper; its values at other indices are irrelevant. is a subset of the ground set of an ambient finite matroid (Whitney's matroid is the submatroid ). Nullity is computed in .
Preamble
import Mathlib import Definitions.Def_WhitneyMatroid_Components_IsSeparable import Definitions.Def_WhitneyMatroid_Components_nullity
Formal statement
namespace WhitneyMatroid.Components
theorem nonSeparable_ear_decomposition {α : Type*} (M : Matroid α) [M.Finite]
(X : Set α) (n : ℕ) (hX : IsNonSeparable M X) (hn : 0 < n) (hnull : nullity M X = n) :
∃ N : ℕ → Set α,
M.IsCircuit (N 1) ∧ N n = X ∧
(∀ i, 1 ≤ i → i ≤ n → IsNonSeparable M (N i) ∧ nullity M (N i) = i) ∧
(∀ i, 1 ≤ i → i < n → N i ⊆ N (i + 1) ∧
∃ P : Set α, M.IsCircuit P ∧ P ⊆ N (i + 1) ∧ N (i + 1) \ N i ⊆ P ∧
(P ∩ N i).Nonempty) := by sorry
end WhitneyMatroid.Components
Source
Whitney, On the Abstract Properties of Linear Dependence, Amer. J. Math. 57 (1935), p. 520, Theorem 17
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.