The ultrafilter lemma
ProvedFamousTheorems.ultrafilter_lemma_7aThe ultrafilter lemma. Every proper filter on a set is contained in an ultrafilter on .
Tarski proved this in 1930 using Zorn's lemma. The ultrafilter lemma is strictly weaker than the axiom of choice and equivalent to the Boolean prime ideal theorem. It implies Tychonoff's theorem for Hausdorff spaces, the compactness theorem of first-order logic and the existence of non-principal ultrafilters, which are used in ultraproducts and nonstandard analysis.
Formalization note. Mathlib's Ultrafilter.exists_le. f.NeBot says that is proper, that is, . The coercion of an ultrafilter to a filter is taken, and on filters is reverse inclusion, so (u : Filter α) ≤ f means .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem ultrafilter_lemma_7a {α : Type*} (f : Filter α) [f.NeBot] : ∃ u : Ultrafilter α, (u : Filter α) ≤ f := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Ultrafilter.exists_le`. Proof here reduces to that Mathlib result.