Theorem 9 — a base B = e₁ + ⋯ + e_{n−q} determines a unique strict fundamental set of circuits
ProvedWhitneyMatroid.Binary.exists_unique_strictFundamentalSetLet be a matroid on the elements , , and suppose is a base of . Then there is a strict fundamental set of circuits with respect to , and it is unique:
This is the matroid analogue of reducing a non-singular square submatrix to the unit matrix by row operations. It provides the fundamental circuits from which, for matroids satisfying (C*), all cycles and circuits are recovered (Theorems 34 and 35) and the representing matrix is built (Theorem 37).
Formalization Note Elements are Fin (r + q) with ; the base is the range of Fin.castAdd q. The ground set of M is assumed to be all of Fin (r + q) (Whitney's matroid consists of exactly the elements ). Uniqueness is uniqueness of the whole indexed family .
import Mathlib import Definitions.Def_WhitneyMatroid_Binary_IsStrictFundamentalSet
namespace WhitneyMatroid.Binary
/-- Theorem 9 (§9, p. 517). If `B = e₁ + ⋯ + e_{n-q}` is a base in `M = e₁ + ⋯ + eₙ`, then
there is a strict fundamental set of circuits with respect to `e_{n-q+1}, …, eₙ`; these circuits
are uniquely determined. Elements `e_k ↦ k - 1 : Fin (r + q)`, `n = r + q`. -/
theorem exists_unique_strictFundamentalSet {r q : ℕ} (M : Matroid (Fin (r + q)))
(hE : M.E = Set.univ) (hB : M.IsBase (Set.range (Fin.castAdd q : Fin r → Fin (r + q)))) :
∃! P : Fin q → Set (Fin (r + q)), IsStrictFundamentalSet M P := by sorry
end WhitneyMatroid.Binary
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.