Ultrafilter lemma

Ultrafilter lemma The Ultrafilter lemma states that every proper filter on a nonempty set can be extended to an ultrafilter. It occupies a central role in modern set theory and interacts with foundational principles such as the Axiom of Choice, Zermelo–Fraenkel axioms, and the Boolean prime ideal theorem. It appears across analysis, topology, and model theory, underpinning constructions like the Stone–Čech compactification and ultraproducts.

Statement

Let X be a nonempty set and F a proper filter on X. The lemma asserts there exists an ultrafilter U on X with F ⊆ U. An ultrafilter is a maximal proper filter: for each subset A ⊆ X either A ∈ U or X\A ∈ U. The lemma is often formulated for Boolean algebras: every proper filter in a Boolean algebra B can be extended to an ultrafilter (equivalently, a maximal filter). This formulation connects it to classical results about prime ideals in rings and Boolean algebras, such as the Boolean prime ideal theorem and the existence of atoms in certain algebraic structures.

Relationship to the Axiom of Choice

The Ultrafilter lemma is strictly weaker than the Axiom of Choice (AC) but not provable in ZF alone. It is implied by AC and by equivalent formulations like Zorn's Lemma and the Well-ordering theorem, since Zorn's Lemma yields maximal elements of partially ordered families of filters. However, the Ultrafilter lemma does not imply AC: there are models of ZF in which the Ultrafilter lemma holds while AC fails. It is equivalent to the Boolean prime ideal theorem (BPI) over ZF; BPI itself is independent from AC and ZF. The exact position of the lemma in the lattice of choice principles is clarified by comparisons with other choice principles such as the Tychonoff theorem for compactness in topology, where certain forms of Tychonoff are equivalent to AC while weaker forms are equivalent to the Ultrafilter lemma or BPI.

Proofs and equivalent forms

Standard proofs use maximality principles: apply Zorn's Lemma to the poset of filters containing a given proper filter, ordered by inclusion; Zorn yields a maximal element which is an ultrafilter. In Boolean algebra language, one proves that every proper filter extends to an ultrafilter by applying Zorn to proper filters or by using maximal ideals in Boolean algebras, invoking the correspondence between ideals and filters. Equivalent statements include the Boolean prime ideal theorem, the extension property for finitely additive 0–1 measures on power sets, and the existence of 2-valued measures that extend given partial 2-valued measures. Other equivalent forms arise in topology: the assertion that every compact Hausdorff space has a point in each ultrafilter limit can be recast to BPI in some contexts. Proof techniques vary: combinatorial constructions produce ultrafilters on ω under stronger hypotheses; algebraic arguments link to prime ideals in Boolean rings and to the spectrum of Boolean algebras. Historical proofs trace back to work by mathematicians associated with the development of set theory and topology in the early 20th century.

Applications

Ultrafilters serve as foundational tools across multiple fields. In topology, nonprincipal ultrafilters on ℕ generate points of the Stone–Čech compactification βℕ, leading to algebraic structures on βℕ relevant to combinatorial number theory and the Stone representation theorem for Boolean algebras. In model theory, ultrafilters underpin the construction of ultraproducts and ultrapowers, central to results by Łoś and applications to elementary equivalence and compactness theorems. In functional analysis and measure theory, ultrafilters relate to finitely additive measures and to limit processes beyond classical convergence, with uses in Banach limit constructions. Combinatorial set theory and Ramsey theory exploit ultrafilters for partition regularity results and structural theorems on large sets. Ultrafilters also appear in algebraic contexts such as reductions modulo ultrafilters yielding nonstandard models used in nonstandard analysis and in investigations of cardinal characteristics of the continuum, where selective and rapid ultrafilters define diverse combinatorial properties.

Models and independence results

The Ultrafilter lemma is independent of ZF: there exist models of ZF where it fails, and models where it holds but AC fails. Models constructed by techniques of permutation models and symmetric extensions show separations between AC, Ultrafilter lemma, and BPI. For example, models built by Paul Cohen’s forcing method can separate instances of choice from the Ultrafilter lemma, and models by Fraenkel and others exhibit failures of ultrafilter existence on certain infinite sets. Consistency results relate to large cardinal assumptions and to the structure of the Boolean algebra P(ω). The landscape of independence includes the existence of nonprincipal ultrafilters on ω, which is independent of ZF and equivalent to certain weak choice principles; further refinements classify ultrafilters (P-points, Ramsey ultrafilters, selective ultrafilters) whose existence requires additional combinatorial hypotheses that are independent of ZFC and sensitive to forcing axioms such as Martin's axiom.

Category:Set theory