Encyclopedia > Ultrafilter

  Article Content

Ultrafilter

In mathematics, an ultrafilter is a maximal filter. Equivalently, an ultrafilter F on a set S is a filter on S with the additional property that for every subset A of S, either A is in F or S \ A is in F.

There are two very different types of ultrafilter: principal and free. A principal (or fixed, or trivial) ultrafilter on S consists of all sets containing a particular point of S. Any ultrafilter which is not principal is called a free (or non-principal) ultrafilter.

One can show that every filter is contained in an ultrafilter (see Ultrafilter Lemma) and that free ultrafilters therefore exist, but the proofs involve the axiom of choice in the form of Zorn's Lemma, so explicit examples of free ultrafilters cannot be given. Nonetheless, almost all ultrafilters on an infinite set are free. By contrast, every ultrafilter on a finite set is principal.

Ultrafilters are useful in topology, especially in relation to compact Hausdorff spaces. Every ultrafilter on a compact Hausdorff space converges to exactly one point.

The set G of all ultrafilters on a set S can be topologized in a natural way. For any subset A of S, let DA = { U in G : A in U }. Then the set of all DA is a base for a compact Hausdorff topology on G. The resulting topological space is the Stone-Čech compactification of a discrete space of cardinality |S|.

Ultrafilters are also used in the construction of hyperreal numbers.

Gödel's ontological proof of God's existence uses as an axiom that the set of all "positive properties" is an ultrafilter.



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Wheatley Heights, New York

... For every 100 females there are 95.1 males. For every 100 females age 18 and over, there are 89.3 males. The median income for a household in the town is $75,076, and ...

 
 
 
This page was created in 23.8 ms