Lemma 6.11.2. For , one has if and only if some circuit satisfies .
Argument in the manuscript
Proof. Choose a maximal independent subset of . Its cardinality is , and adding is dependent exactly when . In that case a minimal dependent subset of is a circuit and must contain , since is independent. Conversely, in a circuit , deleting any element leaves an independent set of rank . Thus , and closure is monotone, giving the assertion for . The facts about maximal independent sets and monotone closure follow from the rank axioms by adding one element at a time and applying submodularity. ◻