A filter on a set is a nonempty family that excludes the empty set, is upward closed, and is closed under finite intersections. An ultrafilter is a proper filter that contains exactly one of and for every subset .
To prove the ultrafilter lemma, order the proper filters containing by inclusion. The union of any chain is again a proper filter, so Zorn lemma gives a maximal extension . If neither nor belonged to , adjoining either one would generate an improper filter. There would then be with and . But , contradicting propriety. Hence is an ultrafilter.
The Stone-Čech compactification of the natural numbers is the set of all ultrafilters on , with basic sets
The identities
show that these sets form a basis of clopen sets. Distinct ultrafilters disagree on some ; one lies in and the other in the disjoint set . Thus is a Hausdorff space.
If a family of basic closed sets has the finite intersection property, then the sets have the same property. They generate a proper filter, which extends to an ultrafilter lying in every . The Alexander subbase theorem now implies that is a compact space.

Articles by others on the same topic (0)

There are currently no matching articles.