# Ultrafilter

A filter which is maximal, in the sense that every filter containing it coincides with it. An ultrafilter may be defined as a system of subsets satisfying three conditions: 1) the empty set is not included; 2) the intersection of two subsets in the system again belongs to it; and 3) for any subset, either it or its complement belongs to the system.

All ultrafilters are divided into two classes: trivial (or fixed or principal) and free ultrafilters. An ultrafilter is called trivial or principal if it is the system of all subsets containing a given point; such an ultrafilter is also called fixed in that point. An ultrafilter is called free if the intersection of all its elements is the empty set, in other words, if it is not fixed in any point. The existence of free ultrafilters is unprovable without the axiom of choice.

For every filter there is an ultrafilter containing it; moreover, every filter is precisely the intersection of all the ultrafilters containing it.

#### References

[1] | N. Bourbaki, "General topology" , Elements of mathematics , Springer (1989) pp. Chapts. 1–2 (Translated from French) |

[2] | K. Kuratowski, A. Mostowski, "Set theory" , North-Holland (1968) |

#### Comments

Ultrafilters support a considerable body of theory both in general topology and in mathematical logic. For a topologist, they are primarily the elements of free compact spaces — that is, of the Stone–Čech compactifications (cf. Stone–Čech compactification) of discrete spaces . is a free compact Hausdorff space on the set of generators, just like a free group on a set of generators; the defining characteristic is that every mapping from the set to a compact Hausdorff space extends uniquely to a continuous mapping .

To see that free ultrafilters are hard to describe, consider the mapping that assigns to each subset of the number in the interval . If is a free ultrafilter on , then the set is non-measurable.

For a logician, ultrafilters are primarily the indexing structures over which ultraproducts are formed. A number of simple but important existential results in model theory are proved in a rather uniform way: To get a model for an infinite set of sentences , form models for arbitrarily large finite subsets of (which is often easy to prove possible) and take any ultraproduct of them. For more control of the construction, one uses restricted ultrafilters, for instance good ultrafilters, or uniform ultrafilters; see [a1].

For a discussion of models of set theory without free ultrafilters see [a8].

There are two important partial orderings of isomorphism types of ultrafilters on a set, both originating in : the Rudin–Keisler order, defined over an arbitrary set , and the Rudin–Frolik order, defined only over a countable set . Two ultrafilters on , i.e. two points of , are related by in the Rudin–Keisler order if there is a mapping such that . If and , and are said to be of the same type. The relation induces a partial ordering of the types. The Rudin–Frolik order over is defined similarly, but using with discrete image.

[a1] is a rather full topologically oriented treatment of ultrafilter theory as of 1974, and still the best introduction to the subject. It has a -page chapter on large cardinals, a subject which has had near-revolutionary growth since 1974.

Let be an ultrafilter on an index set . For each , let be a set. Using one defines an equivalence relation on as follows: , , are equivalent if and only if (written: ). The quotient of by this equivalence relation is called the ultraproduct of the (with respect to the ultrafilter ).

For each , let be an -ary relation on (eventually corresponding to one and the same predicate of a language , where the are supposed to be interpretations of ). Then a corresponding relation on is defined by:

Here is the equivalence class of in . (This is well defined by the properties of ultrafilters.) Functions and individual constants are similarly defined.

If all the are the same, one speaks of ultrapowers instead of ultraproducts.

Ultraproducts have important applications in the theory of Diophantine equations and algebraic number theory. For instance, for each prime number , let be the field of -adic numbers and let be the field of Laurent series over the finite field . Then the Ax–Kochen theorem says that for each non-principal ultrafilter ,

This gives an immediate positive partial solution to Artin's conjecture on Diophantine equations in the form of the theorem: For each positive integer there exists a finite set of primes such that every homogeneous polynomial of degree over with has a non-trivial zero in for all . This result can also be deduced from results of Yu.L. Ershov ([a6]), which also use ultraproducts in their proof. Artin's conjecture in full generality says that is a -field, which means that the conclusion just formulated must hold for all (the "2" in -field refers to the "2" in "n>d2" ). However, G. Terjanian gave in 1966 a counterexample to the full Artin conjecture by providing a quartic form in variables over with only non-trivial zeros.

More precisely, let , be integers. Then a field is called a -field if every homogeneous polynomial of degree over in variables has a non-trivial zero in . A field that is for all is called a -field. The -fields are the algebraically closed fields. The -fields are also called quasi-algebraically closed. The rational functions in one variable over an algebraically closed field form a -field (Tsen's theorem). The field is a -field (H. Hasse, 1923) and also a -field (D.J. Lewis, 1952).

Other important applications of ultraproducts are in non-standard analysis; in particular, non-standard models of the reals, integers, etc. can be obtained as ultrapowers of , , etc.

Cf. Model theory and [a2] for results in logic involving ultrafilters and ultraproducts.

There are further important applications of ultrafilters to topology, cf. [a1], [a7].

#### References

[a1] | W.W. Comfort, S. Negrepontis, "The theory of ultrafilters" , Springer (1974) |

[a2] | J.L. Bell, A.B. Slomson, "Models and ultraproducts" , North-Holland (1969) |

[a3] | J. Ax, S. Kochen, "Diophantine problems over local fields I" Amer. J. Math. , 87 (1965) pp. 605–630 |

[a4] | J. Ax, S. Kochen, "Diophantine problems over local fields II. A complete set of axioms for -adic number theory" Amer. J. Math. , 87 (1965) pp. 631–648 |

[a5] | J. Ax, S. Kochen, "Diophantine problems over local fields III. Decidable fields" Ann. of Math. , 83 (1966) pp. 437–456 |

[a6] | Yu.L. Ershov, "On the elementary theory of maximal normal fields" Soviet Math. Dokl. , 6 (1965) pp. 1390–1393 Dokl. Akad. Nauk SSSR , 165 (1965) pp. 21–23 |

[a7] | A.V. Arkhangel'skii, V.I. Ponomarev, "Fundamentals of general topology: problems and exercises" , Reidel (1984) (Translated from Russian) |

[a8] | T.J. Jech, "Set theory" , Acad. Press (1978) pp. 523ff (Translated from German) |

[a9] | J. van Mill, "An introduction to " K. Kunen (ed.) J.E. Vaughan (ed.) , Handbook of Set-Theoretic Topology , North-Holland (1984) |

[a10] | W. Rudin, "Homogeneity problems in the theory of Čech compactification" Duke Math. J. , 23 (1956) pp. 409–419 |

**How to Cite This Entry:**

Ultrafilter.

*Encyclopedia of Mathematics.*URL: http://www.encyclopediaofmath.org/index.php?title=Ultrafilter&oldid=37143