Theorems · Definition · combinatorics
Matroid.dualIndepMatroid
{α : Type u_1} → Matroid α → IndepMatroid αGiven M : Matroid α, the IndepMatroid α whose independent sets are
the subsets of M.E that are disjoint from some base of M
- Defined in
- Mathlib.Combinatorics.Matroid.Dual
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 67 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- Disjointproof · cited by 2,201
- Matroidstatement and proof · cited by 1,258
- Matroid.Eproof · cited by 550
- Matroid.IsBaseproof · cited by 239
- IndepMatroidstatement · cited by 15
Cited by3
Results whose statement or proof uses this declaration.
- Matroid.dualproof · cited by 79
- Matroid.dualIndepMatroid_Estatement and proof · cited by 0
- Matroid.dualIndepMatroid_Indepstatement and proof · cited by 0