Boolean Prime Ideal Theorem/Proof 3
Jump to navigation
Jump to search
![]() | This article needs to be linked to other articles. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links. 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 {{MissingLinks}} from the code. |
Theorem
Let $\struct {S, \le}$ be a Boolean lattice.
Let $I$ be an ideal in $S$.
Let $F$ be a filter on $S$.
Let $I \cap F = \O$.
Then there exists a prime ideal $P$ in $S$ such that:
- $I \subseteq P$
and:
- $P \cap F = \O$
Proof
We prove that the Boolean Prime Ideal Theorem is equivalent to Stone's Representation Theorem for Boolean Algebras in ZF.
![]() | This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. 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 {{ProofWanted}} from the code.If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page. |