You are here
HomeBoolean prime ideal theorem
Primary tabs
Boolean prime ideal theorem
Let $A$ be a Boolean algebra. Recall that an ideal $I$ of $A$ if it is closed under $\vee$, and for any $a\in I$ and $b\in A$, $a\wedge b\in I$. $I$ is proper if $I\neq A$ and nontrivial if $I\neq(0)$, and $I$ is prime if it is proper, and, given $a\wedge b\in I$, either $a\in I$ or $b\in I$.
Theorem 1 (Boolean prime ideal theorem).
Every Boolean algebra contains a prime ideal.
Proof.
Let $A$ be a Boolean algebra. If $A$ is trivial (the twoelement algebra), then $(0)$ is the prime ideal we want. Otherwise, pick $a\in A$, where $0\neq a\neq 1$, and let be the trivial ideal. By Birkhoff’s prime ideal theorem for distributive lattices, $A$, considered as a distributive lattice, has a prime ideal $P$ (containing $(0)$ obviously) such that $a\notin P$. Then $P$ is also a prime ideal of $A$ considered as a Boolean algebra. ∎
There are several equivalent versions of the Boolean prime ideal theorem, some are listed below:
1. Every Boolean algebra has a prime ideal.
2. Every ideal in a Boolean algebra can be enlarged to a prime ideal.
3. 4. An ideal and a filter in a Boolean algebra, disjoint from one another, can be enlarged to an ideal and a filter that are complement (as sets) of one another.
Remarks.
1. Because the Boolean prime ideal theorem has been extensively studied, it is often abbreviated in the literature as BPI. Since the prime ideal theorem for distributive lattices uses the axiom of choice, ZF+AC implies BPI. However, there are models of ZF+BPI where AC fails.
2. It can be shown (see John Bell’s online article here) that BPI is equivalent, under ZF, to some of the well known theorems in mathematics:

Tychonoff’s theorem for Hausdorff spaces: the product of compact Hausdorff spaces is compact under the product topology,

the compactness theorem for first order logic, and

the completeness theorem for first order logic.

References
 1 G. Grätzer, General Lattice Theory, 2nd Edition, Birkhäuser (1998).
 2 T. J. Jech, The Axiom of Choice, NorthHolland Pub. Co., Amsterdam, (1973).
 3 R. Sikorski, Boolean Algebras, 2nd Edition, SpringerVerlag, New York (1964).
Mathematics Subject Classification
06E05 no label found03G05 no label found03E25 no label found Forums
 Planetary Bugs
 HS/Secondary
 University/Tertiary
 Graduate/Advanced
 Industry/Practice
 Research Topics
 LaTeX help
 Math Comptetitions
 Math History
 Math Humor
 PlanetMath Comments
 PlanetMath System Updates and News
 PlanetMath help
 PlanetMath.ORG
 Strategic Communications Development
 The Math Pub
 Testing messages (ignore)
 Other useful stuff
Recent Activity
new collection: On the InformationTheoretic Structure of Distributed Measurements by rspuzio
Apr 15
new question: Prove a formula is part of the Gentzen System by LadyAnne
Mar 30
new question: A problem about Euler's totient function by mbhatia
new problem: Problem: Show that phi(a^n1), (where phi is the Euler totient function), is divisible by n for any natural number n and any natural number a >1. by mbhatia
new problem: MSC browser just displays "No articles found. Up to ." by jaimeglz
Mar 26
new correction: Misspelled name by DavidSteinsaltz
Mar 21
new correction: underlinetypo by Filipe
Mar 19
new correction: cocycle pro cocyle by pahio
Mar 7
new image: plot W(t) = P(waiting time <= t) (2nd attempt) by robert_dodier
new image: expected waiting time by robert_dodier