AFTD Auto-Formalizing Theoretical Domains

matroid_strongly_base_orderable

def

A matroid M is strongly base-orderable if for every two bases B₁, B₂ there is a bijection φ : B₁ → B₂ such that (B₁ \ X) ∪ φ(X) is a base for every X ⊆ B₁.

Statement

def matroid_strongly_base_orderable {α : Type*} (M : Matroid α) : Prop
Defined in
arXiv:2610.07318 (A note on the list chromatic number of two matroids), Sec. 1.3 (definition of strong base orderability)
Verified
07 Oct 2026
Axioms
none listed
Used by 6

Lean source view module on GitHub

/-- A matroid is strongly base-orderable if for every two bases `B₁`, `B₂` there is a bijection `φ : B₁ → B₂` such that exchanging any subset `X ⊆ B₁` for its image gives a base: `(B₁ \ X) ∪ φ(X)` is a base for every `X ⊆ B₁`. -/
def matroid_strongly_base_orderable {α : Type*} (M : Matroid α) : Prop :=
  ∀ B₁ B₂ : Set α, M.IsBase B₁ → M.IsBase B₂ →
    ∃ φ : B₁ ≃ B₂, ∀ X : Set B₁,
      M.IsBase ((B₁ \ ((↑) '' X)) ∪ ((fun x => (φ x : α)) '' X))
See it in the graphDiscuss this resultChallenge it