User:Leigh.Samphier/Matroids/Equivalence of Definitions of Matroid Base Axioms/Formulation 1 Iff Formulation 5
Jump to navigation
Jump to search
This page needs proofreading. Please check it for mathematical errors. If you believe there are none, please remove {{Proofread}} from the code.To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Proofread}} from the code. |
Theorem
Let $S$ be a finite set.
Let $\mathscr B$ be a non-empty set of subsets of $S$.
Then:
- $\mathscr B$ satisfies formulation $1$ of base axiom:
\((\text B 1)\) | $:$ | \(\ds \forall B_1, B_2 \in \mathscr B:\) | \(\ds x \in B_1 \setminus B_2 \implies \exists y \in B_2 \setminus B_1 : \paren {B_1 \setminus \set x} \cup \set y \in \mathscr B \) |
- $\mathscr B$ satisfies formulation $5$ of base axiom:
\((\text B 5)\) | $:$ | \(\ds \forall B_1, B_2 \in \mathscr B:\) | \(\ds x \in B_1 \setminus B_2 \implies \exists y \in B_2 \setminus B_1 : \paren {B_2 \setminus \set y} \cup \set x \in \mathscr B \) |
Proof
Follows immediately from:
$\blacksquare$