# Boolean Prime Ideal Theorem

In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime ideals. A variation of this statement for filters on sets is known as the ultrafilter lemma. Other theorems are obtained by considering different mathematical structures with appropriate notions of ideals, for example, rings and prime ideals (of ring theory), or distributive lattices and maximal ideals (of order theory). This article focuses on prime ideal theorems from order theory.

Although the various prime ideal theorems may appear simple and intuitive, they cannot be derived in general from the axioms of Zermelo–Fraenkel set theory without the axiom of choice (abbreviated ZF). Instead, some of the statements turn out to be equivalent to the axiom of choice (AC), while others—the Boolean prime ideal theorem, for instance—represent a property that is strictly weaker than AC. It is due to this intermediate status between ZF and ZF + AC (ZFC) that the Boolean prime ideal theorem is often taken as an axiom of set theory. The abbreviations BPI or PIT (for Boolean algebras) are sometimes used to refer to this additional axiom.

Read more about Boolean Prime Ideal Theorem:  Prime Ideal Theorems, Boolean Prime Ideal Theorem, Further Prime Ideal Theorems, The Ultrafilter Lemma, Applications

### Famous quotes containing the words prime, ideal and/or theorem:

Weekend planning is a prime time to apply the Deathbed Priority Test: On your deathbed, will you wish you’d spent more prime weekend hours grocery shopping or walking in the woods with your kids?
Louise Lague (20th century)

... my whole existence is governed by abstract ideas.... the ideal must be preserved regardless of fact.
Mary Corinna Putnam (1842–1906)

To insure the adoration of a theorem for any length of time, faith is not enough, a police force is needed as well.
Albert Camus (1913–1960)