User:Leigh.Samphier/Matroids/Equivalence of Definitions of Matroid Base Axioms/Axiom B1 Implies Set of Matroid Bases

Theorem
Let $S$ be a finite set.

Let $\mathscr B$ be a non-empty set of subsets of $S$ satisfying the base axiom:

Then $\mathscr B$ is the set of bases of a matroid on $S$.

Proof
Let $\mathscr I = \set{X \subseteq S : \exists B \in \mathscr B : X \subseteq B}$

It is to be shown that:
 * $\quad \mathscr I$ satisfies that the matroid axioms

and
 * $\quad \mathscr B$ is the set of bases of the matroid $M = \struct{S, \mathscr I}$

Matroid Axiom $(\text I 1)$
We have $\mathscr B$ is non-empty.

Let $B \in \mathscr B$.

From Empty Set is Subset of All Sets:
 * $\O \subseteq B$

By definition of $\mathscr I$:
 * $\O \in \mathscr I$

Matroid Axiom $(\text I 2)$
Let $X \in \mathscr I$.

Let $Y \subseteq X$.

By definition of $\mathscr I$:
 * $\exists B \in \mathscr B : X \subseteq B$

From Subset Relation is Transitive:
 * $Y \subseteq B$

By definition of $\mathscr I$:
 * $Y \in \mathscr I$

Matroid Axiom $(\text I 3)$
Let $U, V \in \mathscr I$ such that:
 * $\size V < \size U$

By definition of $\mathscr I$:
 * $\exists B_1, B_2 \in \mathscr B : U \subseteq B_1, V \subseteq B_2$

From Max Equals an Operand:
 * $\exists B_1, B_2 \in \mathscr B : U \subseteq B_1, V \subseteq B_2 : \size{B_1 \cap B_2} = \max \set{\size{C_1 \cap C_2} : U \subseteq C_1, V \subseteq C_2 \text{ and } C_1, C_2 \in \mathscr B}$

We have:

and


 * $B_2 \cap \paren{U \setminus V} = \O$
 * $B_2 \cap \paren{U \setminus V} = \O$

From Subset of Set Difference iff Disjoint Set:
 * $U \setminus V \subseteq B_1 \setminus B_2$

We have: