Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 17 — building a non-separable matroid from a circuit by adding circuits

Proved
WhitneyMatroid.Components.nonSeparable_ear_decomposition

by mikedeng1 · 1 vote · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

connectivitymatroidsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let MMM be a finite matroid on a ground set EEE, and let X⊆EX\subseteq EX⊆E be non-separable with nullity n(X)=n>0n(X)=n>0n(X)=n>0. Then there are sets N1⊆N2⊆⋯⊆NnN_1\subseteq N_2\subseteq\cdots\subseteq N_nN1​⊆N2​⊆⋯⊆Nn​ with

  1. N1N_1N1​ a circuit of MMM and Nn=XN_n = XNn​=X;
  2. for 1≤i≤n1\le i\le n1≤i≤n, NiN_iNi​ is non-separable of nullity n(Ni)=in(N_i)=in(Ni​)=i;
  3. for 1≤i<n1\le i<n1≤i<n, there is a circuit PPP of MMM with
P⊆Ni+1,Ni+1∖Ni⊆P,P∩Ni≠∅,P\subseteq N_{i+1},\qquad N_{i+1}\setminus N_i\subseteq P,\qquad P\cap N_i\neq\emptyset ,P⊆Ni+1​,Ni+1​∖Ni​⊆P,P∩Ni​=∅,

i.e. Ni+1N_{i+1}Ni+1​ arises from NiN_iNi​ by adding a set of elements which forms a circuit with one or more elements of NiN_iNi​.

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 N:N→N:\mathbb N\toN:N→ sets whose values at indices 1,…,n1,\dots,n1,…,n are the matroids M1,…,MnM_1,\dots,M_nM1​,…,Mn​ of the paper; its values at other indices are irrelevant. XXX is a subset of the ground set of an ambient finite matroid (Whitney's matroid MMM is the submatroid XXX). Nullity is computed in Z\mathbb ZZ.

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
  • 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me