Leigh.Samphier/Sandbox/Rank of Matroid Circuit is One Less Than Cardinality

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $M = \struct {S, \mathscr I}$ be a matroid.

Let $C \subseteq S$ be a circuit of $M$.

Let $\rho: \powerset S \to \Z$ denote the rank function of $M$.


Then:

$\map \rho C = \card C -1$

Proof

$\blacksquare$