Theorem 19 — two elements share a component iff some circuit contains both
ProvedWhitneyMatroid.Components.same_component_iff_mem_circuitLet be a finite matroid on a ground set , and let be two distinct elements. Then and lie in the same component of if and only if they are contained in a common circuit:
Components are defined through the rank function (maximal non-separable parts), while circuits are minimal dependent sets; the theorem identifies the rank-theoretic decomposition with the relation "lie on a common circuit". In particular that relation is an equivalence relation on distinct elements, and, as Whitney notes, König's "Glieder" of a graph are the same as the components of its matroid.
Formalization Note The elements are assumed distinct (), which Whitney's "the elements and " leaves tacit: for a coloop forms its own component but lies on no circuit. Components are the rank-defined IsComponent (not the classes of the circuit relation, which would make the theorem a tautology); circuits are Mathlib's Matroid.IsCircuit.
import Mathlib import Definitions.Def_WhitneyMatroid_Components_IsSeparable import Definitions.Def_WhitneyMatroid_Components_IsComponent
namespace WhitneyMatroid.Components
theorem same_component_iff_mem_circuit {α : Type*} (M : Matroid α) [M.Finite]
(e₁ e₂ : α) (he₁ : e₁ ∈ M.E) (he₂ : e₂ ∈ M.E) (hne : e₁ ≠ e₂) :
(∃ K : Set α, IsComponent M K ∧ e₁ ∈ K ∧ e₂ ∈ K) ↔
∃ P : Set α, M.IsCircuit P ∧ e₁ ∈ P ∧ e₂ ∈ P := by sorry
end WhitneyMatroid.Components
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.