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
- matroid_sbo_common_list_chromatic_eq_of_le_twoFor two loopless strongly base-orderable matroids on a common finite ground set whose common chromatic number is at most 2, the common…
- matroid_sbo_common_list_colorable_three_of_common_colorable_twoIf two finite strongly base-orderable matroids have a common coloring with two colors, they are 3-list-colorable (immediate from…
- matroid_sbo_common_list_colorable_two_of_common_colorable_twoIf two strongly base-orderable matroids on a common finite ground set have a common coloring with two colors, then they are…
- matroid_sbo_list_colorable_two_of_colorable_twoIf M₁ and M₂ are strongly base-orderable matroids on a common finite ground set and each of them is 2-colorable (its ground set is the…
- matroid_strongly_base_orderable_freeOnA free matroid (every subset of the ground set independent) is strongly base-orderable.
- matroid_sbo_reduction_pairs_of_two_indepLet M be a finite strongly base-orderable matroid whose ground set is the union of two disjoint independent sets I and J. Then M has a…
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))