Theorems · Theorem · combinatorics
Matroid.ext_isCircuit_not_indep
∀ {α : Type u_1} {M₁ M₂ : Matroid α},
M₁.E = M₂.E → (∀ (C : Set α), M₁.IsCircuit C → ¬M₂.Indep C) → (∀ (C : Set α), M₂.IsCircuit C → ¬M₁.Indep C) → M₁ = M₂A stronger version of Matroid.ext_isCircuit:
two matroids on the same ground set are equal if no circuit of one is independent in the other.
- Defined in
- Mathlib.Combinatorics.Matroid.Circuit
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 97 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Matroidstatement and proof · cited by 1,258
- Matroid.Estatement and proof · cited by 550
- Matroid.Indepstatement and proof · cited by 367
- Matroid.IsCircuitstatement and proof · cited by 108
- Matroid.not_indep_iffproof · cited by 11
- Matroid.Dep.exists_isCircuit_subsetproof · cited by 5
- Matroid.IsCircuit.eq_of_not_indep_subsetproof · cited by 3
- Matroid.ext_isCircuitproof · cited by 2
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.