In the mathematical field of order theory, an ultrafilter on a given partially ordered set (or "poset") P {\textstyle P} is a certain subset of P , {\displaystyle P,} namely a maximal filter on P ; {\displaystyle P;} that is, a proper filter on P {\textstyle P} that cannot be enlarged to a bigger proper filter on P . {\displaystyle P.}
If X {\displaystyle X} is an arbitrary set, its power set P ( X ) , {\displaystyle {\mathcal {P}}(X),} ordered by set inclusion, is always a Boolean algebra and hence a poset, and ultrafilters on P ( X ) {\displaystyle {\mathcal {P}}(X)} are usually called ultrafilters on the set X {\displaystyle X} . An ultrafilter on a set X {\displaystyle X} may be considered as a finitely additive 0-1-valued measure on P ( X ) {\displaystyle {\mathcal {P}}(X)} . In this view, every subset of X {\displaystyle X} is either considered "almost everything" (has measure 1) or "almost nothing" (has measure 0), depending on whether it belongs to the given ultrafilter or not. Ultrafilters have many applications in set theory, model theory, topology and combinatorics.
Ultrafilters on partial orders In order theory, an ultrafilter is a subset of a partially ordered set that is maximal among all proper filters. This implies that any filter that properly contains an ultrafilter has to be equal to the whole poset. Formally, if P {\textstyle P} is a set, partially ordered by ≤ {\displaystyle \,\leq \,} then
a subset F ⊆ P {\displaystyle F\subseteq P} is called a filter on P {\textstyle P} if
F {\displaystyle F} is nonempty, for every x , y ∈ F , {\displaystyle x,y\in F,} there exists some element z ∈ F {\displaystyle z\in F} such that z ≤ x {\displaystyle z\leq x} and z ≤ y , {\displaystyle z\leq y,} and for every x ∈ F {\displaystyle x\in F} and y ∈ P , {\displaystyle y\in P,} x ≤ y {\displaystyle x\leq y} implies that y {\displaystyle y} is in F {\displaystyle F} too; a proper subset U {\displaystyle U} of P {\textstyle P} is called an ultrafilter on P {\textstyle P} if
U {\displaystyle U} is a filter on P , {\displaystyle P,} and there is no proper filter F {\displaystyle F} on P {\textstyle P} that properly extends U {\displaystyle U} (that is, such that U {\displaystyle U} is a proper subset of F {\displaystyle F} ).
… excerpt ends here. Continue reading the full article.


