PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
Boolean prime ideal theorem (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\ne A$ and non-trivial if $I\ne (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 two-element algebra), then $(0)$ is the prime ideal we want. Otherwise, pick $a\in A$ , where $0\ne a\ne 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. $ \qedsymbol$

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. Given a set $S$ in a Boolean algebra $A$ , and an ideal $I$ disjoint from $S$ , then there is a prime ideal $P$ containing $I$ and disjoint from $S$ .
  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:

Bibliography

1
G. Grätzer, General Lattice Theory, 2nd Edition, Birkhäuser (1998).
2
T. J. Jech, The Axiom of Choice, North-Holland Pub. Co., Amsterdam, (1973).
3
R. Sikorski, Boolean Algebras, 2nd Edition, Springer-Verlag, New York (1964).




"Boolean prime ideal theorem" is owned by CWoo.
(view preamble | get metadata)

View style:

Other names:  BPI
Log in to rate this entry.
(view current ratings)

Cross-references: completeness theorem, first order logic, Stone representation theorem, product topology, compact, product, Hausdorff spaces, Tychonoff's theorem, implies, ZF, axiom of choice, complement, filter, disjoint, equivalent, distributive lattice, distributive, Birkhoff's prime ideal theorem, algebra, contains, theorem, prime ideal, prime, closed under, ideal, Boolean algebra
There are 3 references to this entry.

This is version 7 of Boolean prime ideal theorem, born on 2009-01-23, modified 2009-01-24.
Object id is 11545, canonical name is BooleanPrimeIdealTheorem.
Accessed 1070 times total.

Classification:
AMS MSC03E25 (Mathematical logic and foundations :: Set theory :: Axiom of choice and related propositions)
 03G05 (Mathematical logic and foundations :: Algebraic logic :: Boolean algebras)
 06E05 (Order, lattices, ordered algebraic structures :: Boolean algebras :: Structure theory)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)