Theorem 23 — duals iff bases correspond to base complements
ProvedWhitneyMatroid.Duality.isDualVia_iff_isBase_complLet and be matroids on finite sets of elements and let be a one-to-one correspondence between their elements. Then is a dual of via (identity (11.1) for every subset) if and only if bases in one correspond to base complements in the other: for every subset of ,
This turns the rank identity (11.1) into a statement about bases only; it is how Whitney proves Theorem 28, and it shows that a matroid's duals are exactly the copies of its usual dual matroid .
Formalization Note Whitney's Theorem 23 reads " and are duals if and only if there is a 1–1 correspondence such that bases in one correspond to base complements in the other." It is stated here for a fixed correspondence , as in Whitney's proof; the existential version follows by quantifying over on both sides. Since is a bijection, the displayed equivalence for all covers both directions of "bases in one correspond to base complements in the other". Both ground sets are the whole finite types.
import Mathlib import Definitions.Def_WhitneyMatroid_Duality_IsDual
namespace WhitneyMatroid.Duality
/-- Whitney, Theorem 23 (p. 522), for a fixed correspondence `σ`: `M` and `M′` (each with the whole
finite type as ground set) are duals via `σ` if and only if bases in one correspond to base
complements in the other: `B` is a base of `M` exactly when the complement of `σ(B)` is a base of
`M′`. -/
theorem isDualVia_iff_isBase_compl {α β : Type*} [Finite α] [Finite β] (M : Matroid α)
(M' : Matroid β) (σ : α ≃ β) (hE : M.E = Set.univ) (hE' : M'.E = Set.univ) :
IsDualVia M M' σ ↔ ∀ B : Set α, M.IsBase B ↔ M'.IsBase (Set.univ \ σ '' B) := by sorry
end WhitneyMatroid.Duality
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.