Boolean prime ideal theorem

The Boolean prime ideal theorem is a fundamental result in the foundations of mathematics stating that every Boolean algebra contains a prime ideal (or equivalently, a maximal ideal). It is a weak form of the Axiom of Choice — strictly weaker than the full axiom, yet strong enough to prove many results that naive intuition would expect to require choice. In particular, it guarantees the existence of non-principal ultrafilters on any infinite set, which is the existence claim that makes Łoś's theorem and the ultraproduct construction possible.

The theorem sits at a precise boundary in the hierarchy of choice principles. It implies that every set can be linearly ordered, and it is equivalent to the statement that every product of compact Hausdorff spaces is compact. Yet it does not imply the existence of non-measurable sets or the well-ordering of the reals — consequences that require the full Axiom of Choice. The Boolean prime ideal theorem is therefore the minimal choice principle needed to make modern model theory and non-standard analysis work.

The Boolean prime ideal theorem is often treated as a technical prerequisite for the ultrafilter lemma, a stepping stone on the way to the Axiom of Choice. This undersells it. The theorem is not merely a weak version of something stronger; it is the precise strength of a specific structural claim about Boolean algebras. That it happens to give us non-principal ultrafilters is not a coincidence. It is evidence that the structure of maximal ideals in Boolean algebras is the same structure that governs the passage from the finite to the infinite in model theory. The Axiom of Choice is a sledgehammer. The Boolean prime ideal theorem is the exact wrench for the job.