Skip to main content

Section 8.2 Equivalent Definitions

While Definition 8.1.1 is the most common definition of a matroid, there are many other equivalent definitions that can be given in terms of the bases, rank function or circuits of the matroid. The theorems in this section outline some of these equivalent properties. The first few properties involves bases; these are often called the basis exchange axioms. For a set \(X\text{,}\) a collection \(\mathcal{I}\subseteq 2^X\) is downward closed or a downset if whenever \(A\in\mathcal{I}\) and \(B\subseteq A\text{,}\) we have \(B\in\mathcal{I}\text{.}\) In other words, \(\mathcal{I}\) is a downset if and only if it satisfies the second property of Definition 8.1.1.

Proof.

Property c \(\Rightarrow\) Property a: Since \(\mathcal{I}\) is a non-empty downset, it suffices to establish the third property of Definition 8.1.1. Suppose, to the contrary, that there exist \(Y,Z\in\mathcal{I}\) such that \(|Y|<|Z|\) and there does not exist \(z\in Z\setminus Y\) with \(Y\cup \{z\}\in\mathcal{I}\text{.}\) Among all such pairs of sets, choose \(Y\) and \(Z\) so that \(|Y\cap Z|\) is maximized. Let \(B_1,B_2\in\mathcal{B}\) such that \(Y\subseteq B_1\) and \(Z\subseteq B_2\text{.}\)
If \(Y\subseteq B_2\text{,}\) then, since \(B_2\in\mathcal{I}\) and \(\mathcal{I}\) is a downset, we would have that \(Y\cup Z\in\mathcal{I}\) which contradicts our choice of \(Y\) and \(Z\text{.}\) So, \(Y\nsubseteq B_2\text{.}\) Thus, we can let \(x\in Y\setminus B_2\subseteq B_1\setminus B_2\text{.}\) By Property c, there exists \(y\in B_2\setminus B_1\) such that \((B_2\setminus\{y\})\cup\{x\}\in\mathcal{B}\text{.}\) Note that \(y\notin Y\text{.}\) Thus, if we define \(Z':=(Z\setminus\{y\})\cup\{x\}\text{,}\) we have that \(|Z'|=|Z|\) and \(|Y\cap Z'|> |Y\cap Z|\text{.}\) So, by our choice of \(Y\) and \(Z\text{,}\) there exists an element of \(Z'\setminus Y\) that can be added to \(Y\) to get a set in \(\mathcal{I}\text{;}\) this completes the proof since \(Z'\setminus Y\subseteq Z\setminus Y\text{.}\)
Property a \(\Rightarrow\) Property b: By Lemma 8.1.3, we have that all elements of \(\mathcal{B}\) have the same cardinality. Let \(B_1,B_2\in\mathcal{B}\) and \(x\in B_1\setminus B_2\text{.}\) Then \(B_1\setminus\{x\}\) and \(B_2\) are both independent and, since all bases have the same size, the second of these sets is larger than the first. So, by the third property of Definition 8.1.1, there exists \(y\in B_2\setminus B_1\) such that \((B_1\setminus\{x\})\cup\{y\}\) is independent. Again, using the fact that all bases have the same size, this set must be a basis and so it is in \(\mathcal{B}\text{.}\)
Property b \(\Rightarrow\) Property c: Let \(\mathcal{I}^*\) be the collection of subsets of \(X\) that are disjoint from at least one set in \(\mathcal{B}\text{.}\) Note that \(\emptyset\in\mathcal{I}^*\) and \(\mathcal{I}^*\) is a downset. Now, let \(\mathcal{B}^*\) be the collection of all maximal elements of \(\mathcal{I}^*\text{.}\) Then it is not hard to see that
\begin{equation*} \mathcal{B}^*=\{X\setminus B: B\in\mathcal{B}\}. \end{equation*}
Indeed, every set of the form \(X\setminus B\) for \(B\in\mathcal{B}\) is disjoint from an element of \(\mathcal{B}\) (namely \(B\)) and is maximal with respect to that property, and vice versa.
We show that if Property b holds for \(\mathcal{B}\text{,}\) then Property c holds for \(\mathcal{B}^*\text{.}\) Let \(B_1\) and \(B_2\) be two elements of \(\mathcal{B}\) so that \(X\setminus B_2\) and \(X\setminus B_1\) are generic elements of \(\mathcal{B}^*\text{.}\) Let \(x\in (X\setminus B_2)\setminus (X\setminus B_1) = B_1\setminus B_2\text{.}\) Then, bsincey Property b holds for \(\mathcal{B}\text{,}\) we know that there exists \(y\in B_2\setminus B_1 = (X\setminus B_1)\setminus (X\setminus B_2)\) such that \((B_1\setminus \{x\})\cup \{y\}\in \mathcal{B}\text{.}\) This implies that the set
\begin{equation*} X\setminus ((B_1\setminus \{x\})\cup \{y\}) = ((X\setminus B_1)\setminus\{y\})\cup\{x\} \end{equation*}
is in \(\mathcal{B}^*\text{.}\) So, Property c holds for \(\mathcal{B}^*\text{.}\)
Now, as we have already shown, if \(\mathcal{B}^*\) satisfies Property c, then it satisfies Property b. But then the argument from the previous paragraph with the roles of \(\mathcal{B}\) and \(\mathcal{B}^*\) reversed gives us that \(\mathcal{B}\) satisfies Property c.
Using the previous theorem, we can now show that the dual of a matroid is indeed a matroid (i.e. we can prove Lemma 8.1.12).

Proof of Lemma 8.1.12.

The next theorem describes two equivalent conditions for a matroid in terms of circuits. The second one is seemingly stronger than the first, but we will show that they are formally equivalent.

Proof.

Property iii \(\Rightarrow\) Property ii: Let \(C_1,C_2\in \mathcal{C}\) such that \(C_1\neq C_2\) and let \(z\in C_1\cap C_2\text{.}\) By definition of \(\mathcal{C}\) and the fact that \(C_1,C_2\in \mathcal{C}\text{,}\) we cannot have \(C_2\subseteq C_1\text{.}\) So, we can choose \(x\in C_2\setminus C_1\text{.}\) Now, we are done by applying Property iii.
Property ii \(\Rightarrow\) Property i: Suppose that Property i and let \(Y,Z\in\mathcal{I}\) with \(|Y|< |Z|\) such that there does not exist \(z\in Z\setminus Y\) with \(Y\cup\{z\}\in\mathcal{I}\) and let \(|Y\cap Z|\) be maximum with respect to this. By our choice of \(Y\) and \(Z\text{,}\) we cannot have \(Y\subseteq Z\) and so we can choose \(y\in Y\setminus Z\text{.}\) Since \(|Y\cap Z|\) is maximal, we know that \(Z\cup\{y\}\notin\mathcal{I}\text{.}\) So, there is a set \(C_1\in\mathcal{C}\) contained in \(Z\cup\{y\}\text{.}\) We claim that there cannot be a set \(C_2\in\mathcal{C}\) distinct from \(C_1\) such that \(C_2\subseteq Z\cup\{y\}\text{.}\) Indeed, if there was, then, since \(Z\in\mathcal{I}\) and \(\mathcal{I}\) is a downset, we know that \(y\in C_1\cap C_2\text{.}\) So, by property Property ii, there is a set \(C_3\in\mathcal{C}\) contained in \((C_1\cup C_2)\setminus\{y\}\subseteq Z\) which is a contradiction.
Now, since \(C_1\nsubseteq Y\text{,}\) we can choose \(x\in C_1\cap (Z\setminus Y)\text{.}\) Now, define \(Z':=(Z\setminus\{x\})\cup\{y\}\text{.}\) Then \(Z'\) cannot contain any set of \(\mathcal{C}\) since \(x\in C_1\) and \(C_1\) is the unique such set contained in \(Z\cup\{y\}\text{.}\) So, \(Z'\) is in \(\mathcal{I}\) and satisfies \(|Z'|=|Z|\) and \(|Y\cap Z'|>|Y\cap Z|\text{.}\) So, by our choice of \(Y\) and \(Z\) there is an element of \(Z'\setminus Y\) that can be added to \(Y\) while maintaining containment in \(\mathcal{I}\text{;}\) this is a contradiction since \(Z'\setminus Y\subseteq Z\setminus Y\text{.}\)
Property i \(\Rightarrow\) Property iii: Let \(C_1,C_2\in\mathcal{C}\text{,}\) \(z\in C_1\cap C_2\) and \(x\in C_2\setminus C_1\text{.}\) We work in the restriction \(M':=M\mid (C_1\cup C_2)\text{.}\) Let \(\mathcal{B}'\) be the set of bases of \(M'\text{.}\) By minimality of \(C_1\) and \(C_2\text{,}\) we can let \(B_1,B_2\in\mathcal{B}'\) with \(B_1\supseteq C_1\setminus\{z\}\) and \(B_2\supseteq C_2\setminus\{x\}\text{.}\) Since \(\mathcal{I}\) is a downset that does not contain \(C_1\) nor \(C_2\text{,}\) we have \(z\notin B_1\) and \(x\notin B_2\text{.}\)
By Theorem 8.2.1 and since we are assuming Property i, we have that Property b holds. Suppose that \(x\in B_1\text{.}\) Then \(x\in B_1\setminus B_2\) which, by Property b, implies that there exists \(y\in B_2\setminus B_1\) such that \((B_1\setminus \{x\})\cup\{y\}\in\mathcal{B}'\text{.}\) Define \(B_1':=(B_1\setminus \{x\})\cup\{y\}\text{.}\) Then, since \(B_1\) contains \(C_1\setminus\{z\}\) and \(x\notin C_1\text{,}\) we have that \(B_1'\) is an element of \(\mathcal{B}'\) containing \(C_1\setminus\{z\}\text{.}\) So, by replacing \(B_1\) with \(B_1'\) if necessary, we can assume that \(x\notin B_1\text{.}\)
Since \(x\notin B_1\text{,}\) by maximality of \(B_1\text{,}\) we have \(B_1\cup \{x\}\notin\mathcal{I}\text{.}\) So, we can let \(C_3\in\mathcal{C}\) such that \(C_3\subseteq B_1\cup\{x\}\text{.}\) Then \(x\in C_3\) because \(C_3\nsubsetq B_1\text{.}\) Also, \(z\notin C_3\) as \(z\notin B_1\text{.}\) Finally, \(C_3\subseteq C_1\cup C_2\text{,}\) as this is the ground set of \(M'\) and so \(B_1\cup\{x\}\subseteq C_1\cup C_2\text{.}\)
We close this section with one more equivalent condition involving the rank function. For a set \(X\text{,}\) a function \(f:2^X\to[0,\infty)\) is said to be submodular if, for any \(A,B\subseteq X\text{,}\)
\begin{equation*} f(A)+f(B)\geq f(A\cap B)+f(A\cup B). \end{equation*}

Proof.

WRITE.
Here is a YouTube video related to this section: