Editing Boolean prime ideal theorem

{{short description|Ideals in a Boolean algebra can be extended to prime ideals}}
In [[mathematics]], the '''Boolean prime ideal theorem''' states that [[Ideal (order theory)|ideals]] in a [[Boolean algebra (structure)|Boolean algebra]] can be extended to [[Ideal (order theory)#Prime ideals | prime ideal]]s. A variation of this statement for [[Filter (set theory)|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, [[Ring (mathematics)|rings]] and prime ideals (of ring theory), or [[distributive lattice]]s 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 deduced 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&nbsp;+&nbsp;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.

==Prime ideal theorems==
An [[Ideal (order theory)|order ideal]] is a (non-empty) [[Directed set|directed]] [[lower set]]. If the considered [[partially ordered set]] (poset) has binary [[Supremum|suprema]] (a.k.a. [[Join and meet|joins]]), as do the posets within this article, then this is equivalently characterized as a non-empty lower set {{mvar|I}} that is closed for binary suprema (that is, <math>x, y \in I</math> implies <math>x \vee y \in I</math>). An ideal {{mvar|I}} is prime if its set-theoretic complement in the poset is a [[Filter (mathematics)|filter]] (that is, <math>x \wedge y \in I</math> implies <math>x \in I</math> or <math>y \in I</math>). Ideals are proper if they are not equal to the whole poset.

Historically, the first statement relating to later prime ideal theorems was in fact referring to filters—subsets that are ideals with respect to the [[Duality (order theory)|dual]] order. The ultrafilter lemma states that every filter on a set is contained within some maximal (proper) filter—an ''ultrafilter''. Recall that filters on sets are proper filters of the Boolean algebra of its [[powerset]]. In this special case, maximal filters (i.e. filters that are not strict subsets of any proper filter) and prime filters (i.e. filters that with each union of subsets ''X'' and ''Y'' contain also ''X'' or ''Y'') coincide. The dual of this statement thus assures that every ideal of a powerset is contained in a prime ideal.

The above statement led to various generalized prime ideal theorems, each of which exists in a weak and in a strong form. ''Weak prime ideal theorems'' state that every ''non-trivial'' algebra of a certain class has at least one prime ideal. In contrast, ''strong prime ideal theorems'' require that every ideal that is disjoint from a given filter can be extended to a prime ideal that is still disjoint from that filter. In the case of algebras that are not posets, one uses different substructures instead of filters. Many forms of these theorems are actually known to be equivalent, so that the assertion that "PIT" holds is usually taken as the assertion that the corresponding statement for Boolean algebras (BPI) is valid.

Another variation of similar theorems is obtained by replacing each occurrence of ''prime ideal'' by ''maximal ideal''. The corresponding maximal ideal theorems (MIT) are often—though not always—stronger than their PIT equivalents.

==Boolean prime ideal theorem==
The Boolean prime ideal theorem is the strong prime ideal theorem for Boolean algebras. Thus the formal statement is:

: Let ''B'' be a Boolean algebra, let {{mvar|I}} be an ideal and let ''F'' be a filter of ''B'', such that {{mvar|I}} and ''F'' are [[disjoint set|disjoint]]. Then {{mvar|I}} is contained in some prime ideal of ''B'' that is disjoint from ''F''.

The weak prime ideal theorem for Boolean algebras simply states:

: Every Boolean algebra contains a prime ideal.

We refer to these statements as the weak and strong ''BPI''. The two are equivalent, as the strong BPI clearly implies the weak BPI, and the reverse implication can be achieved by using the weak BPI to find prime ideals in the appropriate quotient algebra.

The BPI can be expressed in various ways. For this purpose, recall the following theorem:

For any ideal {{mvar|I}} of a Boolean algebra ''B'', the following are equivalent:
* {{mvar|I}} is a prime ideal.
* {{mvar|I}} is a maximal ideal, i.e. for any proper ideal {{mvar|J}}, if {{mvar|I}} is contained in {{mvar|J}} then {{math|1={{var|I}} = {{var|J}}}}.
* For every element ''a'' of ''B'', {{mvar|I}} contains exactly one of {''a'', ¬''a''}.
This theorem is a well-known fact for Boolean algebras. Its dual establishes the equivalence of prime filters and ultrafilters. Note that the last property is in fact self-dual—only the prior assumption that {{mvar|I}} is an ideal gives the full characterization. All of the implications within this theorem can be proven in ZF.

Thus the following (strong) maximal ideal theorem (MIT) for Boolean algebras is equivalent to BPI:

:Let ''B'' be a Boolean algebra, let {{mvar|I}} be an ideal and let ''F'' be a filter of ''B'', such that {{mvar|I}} and ''F'' are disjoint. Then {{mvar|I}} is contained in some maximal ideal of ''B'' that is disjoint from ''F''.

Note that one requires "global" maximality, not just maximality with respect to being disjoint from ''F''. Yet, this variation yields another equivalent characterization of BPI:

:Let ''B'' be a Boolean algebra, let {{mvar|I}} be an ideal and let ''F'' be a filter of ''B'', such that {{mvar|I}} and ''F'' are disjoint. Then {{mvar|I}} is contained in some ideal of ''B'' that is maximal among all ideals disjoint from ''F''.

The fact that this statement is equivalent to BPI is easily established by noting the following theorem: For any [[distributive lattice]] ''L'', if an ideal {{mvar|I}} is maximal among all ideals of ''L'' that are disjoint to a given filter ''F'', then {{mvar|I}} is a prime ideal. The proof for this statement (which can again be carried out in ZF set theory) is included in the article on ideals. Since any Boolean algebra is a distributive lattice, this shows the desired implication.

All of the above statements are now easily seen to be equivalent. Going even further, one can exploit the fact the dual orders of Boolean algebras are exactly the Boolean algebras themselves. Hence, when taking the equivalent duals of all former statements, one ends up with a number of theorems that equally apply to Boolean algebras, but where every occurrence of {{em|ideal}} is replaced by {{em|filter}}{{Citation needed|reason=(weak Ultrafilter ⇏ strong Ultrafilter), whereas (weak BPI ⇒ strong BPI)|date=November 2021}}. It is worth noting that for the special case where the Boolean algebra under consideration is a [[powerset]] with the [[subset]] ordering, the "maximal filter theorem" is called the ultrafilter lemma.

Summing up, for Boolean algebras, the weak and strong MIT, the weak and strong PIT, and these statements with filters in place of ideals are all equivalent. It is known that all of these statements are consequences of the [[Axiom of Choice]], ''AC'', (the easy proof makes use of [[Zorn's lemma]]), but cannot be proven in [[Zermelo–Fraenkel set theory|ZF]] (Zermelo-Fraenkel set theory without ''AC''), if ZF is [[consistent]]. Yet, the BPI is strictly weaker than the axiom of choice, though the proof of this statement, due to J. D. Halpern and [[Azriel Lévy]] is rather non-trivial.

==Further prime ideal theorems==
The prototypical properties that were discussed for Boolean algebras in the above section can easily be modified to include more general [[Lattice (order)|lattices]], such as [[distributive lattice]]s or [[Heyting algebra]]s. However, in these cases maximal ideals are different from prime ideals, and the relation between PITs and MITs is not obvious.

Indeed, it turns out that the MITs for distributive lattices and even for Heyting algebras are equivalent to the axiom of choice. On the other hand, it is known that the strong PIT for distributive lattices is equivalent to BPI (i.e. to the MIT and PIT for Boolean algebras). Hence this statement is strictly weaker than the axiom of choice. Furthermore, observe that Heyting algebras are not self dual, and thus using filters in place of ideals yields different theorems in this setting. Maybe surprisingly, the MIT for the duals of Heyting algebras is not stronger than BPI, which is in sharp contrast to the abovementioned MIT for Heyting algebras.

Finally, prime ideal theorems do also exist for other (not order-theoretical) abstract algebras. For example, the MIT for rings implies the axiom of choice. This situation requires to replace the order-theoretic term "filter" by other concepts—for rings a "multiplicatively closed subset" is appropriate.

==The ultrafilter lemma==
{{Main|Ultrafilter lemma}}
{{See also|Set-theoretic topology}}

A filter on a set {{mvar|X}} is a nonempty collection of nonempty subsets of {{mvar|X}} that is closed under finite intersection and under superset. An ultrafilter is a maximal filter.
The ultrafilter lemma states that every filter on a set {{mvar|X}} is a subset of some [[ultrafilter]] on {{mvar|X}}.<ref>{{citation
 | last = Halpern | first = James D.
 | year = 1966
 | title = Bases in Vector Spaces and the Axiom of Choice
 | journal = [[Proceedings of the American Mathematical Society]]
 | publisher = American Mathematical Society
 | jstor = 2035388
 | doi = 10.1090/S0002-9939-1966-0194340-1 | doi-access = free
 | volume = 17
 | issue = 3
 | pages = 670–673
 }}</ref>
An ultrafilter that does not contain finite sets is called "non-principal". The ultrafilter lemma, and in particular the existence of non-principal ultrafilters (consider the filter of all sets with finite complements), can be proven from [[Zorn's lemma]].

The ultrafilter lemma is equivalent to the Boolean prime ideal theorem, with the equivalence provable in ZF set theory without the axiom of choice. The idea behind the proof is that the subsets of any set form a Boolean algebra partially ordered by inclusion, and any Boolean algebra is representable as an algebra of sets by [[Stone's representation theorem]].

If the set {{mvar|X}} is finite then the ultrafilter lemma can be proven from the axioms ZF. This is no longer true for infinite sets; an additional axiom {{em|must}} be assumed. [[Zorn's lemma]], the [[axiom of choice]], and [[Tychonoff's theorem]] can all be used to prove the ultrafilter lemma. The ultrafilter lemma is strictly weaker than the axiom of choice.

The ultrafilter lemma has many [[Filters in topology|applications in topology]]. The ultrafilter lemma can be used to prove the [[Hahn-Banach theorem]] and the [[Alexander subbase theorem]].

==Applications==
Intuitively, the Boolean prime ideal theorem states that there are "enough" prime ideals in a Boolean algebra in the sense that we can extend ''every'' ideal to a maximal one. This is of practical importance for proving [[Stone's representation theorem for Boolean algebras]], a special case of [[Stone duality]], in which one equips the set of all prime ideals with a certain topology and can indeed regain the original Boolean algebra ([[up to]] [[isomorphism]]) from this data. Furthermore, it turns out that in applications one can freely choose either to work with prime ideals or with prime filters, because every ideal uniquely determines a filter: the set of all Boolean complements of its elements. Both approaches are found in the literature.

Many other theorems of general topology that are often said to rely on the axiom of choice are in fact equivalent to BPI. For example, the theorem that a product of compact [[Hausdorff spaces]] is compact is equivalent to it. If we leave out "Hausdorff" we get a [[Tychonoff's theorem|theorem]] equivalent to the full axiom of choice.

In [[graph theory]], the [[De Bruijn–Erdős theorem (graph theory)|de Bruijn–Erdős theorem]] is another equivalent to BPI. It states that, if a given infinite graph requires at least some finite number {{mvar|k}} in any [[graph coloring]], then it has a finite subgraph that also requires {{mvar|k|colors}}.<ref>{{citation
 | last = Läuchli | first = H.
 | year = 1971
 | title = Coloring infinite graphs and the Boolean prime ideal theorem
 | journal = [[Israel Journal of Mathematics]]
 | doi = 10.1007/BF02771458 | doi-access=
 | mr = 0288051
 | s2cid = 122090105
 | volume = 9
 | issue = 4
 | pages = 422–429
 }}</ref>

A not too well known application of the Boolean prime ideal theorem is the existence of a [[non-measurable set]]<ref>{{citation
 | last = Sierpiński | first = Wacław | author-link = Wacław Sierpiński
 | year = 1938
 | title = Fonctions additives non complètement additives et fonctions non mesurables
 | language = French
 | journal = [[Fundamenta Mathematicae]]
 | doi = 10.4064/fm-30-1-96-99 | doi-access = free
 | volume = 30
 | pages = 96–99
 }}</ref> (the example usually given is the [[Vitali set]], which requires the axiom of choice). From this and the fact that the BPI is strictly weaker than the axiom of choice, it follows that the existence of non-measurable sets is strictly weaker than the axiom of choice.

In linear algebra, the Boolean prime ideal theorem can be used to prove that any two [[Basis (linear algebra)|bases]] of a given [[vector space]] have the same [[cardinality]].

==See also==
* [[List of Boolean algebra topics]]

==Notes==
{{reflist}}

==References==
*{{citation
 | last1 = Davey | first1 = B. A.
 | last2 = Priestley | first2 = H. A. | author2-link = Hilary Priestley
 | year = 2002
 | title = Introduction to Lattices and Order
 | title-link = Introduction to Lattices and Order
 | edition = 2nd
 | publisher = Cambridge University Press
 | isbn = 978-0-521-78451-1
}}
: ''An easy to read introduction, showing the equivalence of PIT for Boolean algebras and distributive lattices.''

*{{citation
 | last = Johnstone | first = Peter | author-link = Peter Johnstone (mathematician)
 | year = 1982
 | title = Stone Spaces
 | series = Cambridge studies in advanced mathematics
 | publisher = Cambridge University Press
 | isbn = 978-0-521-33779-3
 | volume = 3
}}
: ''The theory in this book often requires choice principles. The notes on various chapters discuss the general relation of the theorems to PIT and MIT for various structures (though mostly lattices) and give pointers to further literature.''

*{{citation
 | last = Banaschewski | first = B.
 | year = 1983
 | title = The power of the ultrafilter theorem
 | journal = [[Journal of the London Mathematical Society]]
 | series = Second Series
 | doi = 10.1112/jlms/s2-27.2.193
 | volume = 27
 | issue = 2
 | pages = 193–202
}}
: ''Discusses the status of the ultrafilter lemma.''

*{{citation
 | last = Erné | first = M.
 | year = 2000
 | title = Prime ideal theory for general algebras
 | journal = Applied Categorical Structures
 | doi = 10.1023/A:1008611926427
 | s2cid = 31605587
 | volume = 8
 | pages = 115–144
 }}
: ''Gives many equivalent statements for the BPI, including prime ideal theorems for other algebraic structures. PITs are considered as special instances of separation lemmas.''

{{Order theory}}

[[Category:Axiom of choice]]
[[Category:Boolean algebra]]
[[Category:Order theory]]
[[Category:Theorems in lattice theory]]