- Source: Ultrafilter on a set
In the mathematical field of set theory, an ultrafilter on a set
X
{\displaystyle X}
is a maximal filter on the set
X
.
{\displaystyle X.}
In other words, it is a collection of subsets of
X
{\displaystyle X}
that satisfies the definition of a filter on
X
{\displaystyle X}
and that is maximal with respect to inclusion, in the sense that there does not exist a strictly larger collection of subsets of
X
{\displaystyle X}
that is also a filter. (In the above, by definition a filter on a set does not contain the empty set.) Equivalently, an ultrafilter on the set
X
{\displaystyle X}
can also be characterized as a filter on
X
{\displaystyle X}
with the property that for every subset
A
{\displaystyle A}
of
X
{\displaystyle X}
either
A
{\displaystyle A}
or its complement
X
∖
A
{\displaystyle X\setminus A}
belongs to the ultrafilter.
Ultrafilters on sets are an important special instance of ultrafilters on partially ordered sets, where the partially ordered set consists of the power set
℘
(
X
)
{\displaystyle \wp (X)}
and the partial order is subset inclusion
⊆
.
{\displaystyle \,\subseteq .}
This article deals specifically with ultrafilters on a set and does not cover the more general notion.
There are two types of ultrafilter on a set. A principal ultrafilter on
X
{\displaystyle X}
is the collection of all subsets of
X
{\displaystyle X}
that contain a fixed element
x
∈
X
{\displaystyle x\in X}
. The ultrafilters that are not principal are the free ultrafilters. The existence of free ultrafilters on any infinite set is implied by the ultrafilter lemma, which can be proven in ZFC. On the other hand, there exists models of ZF where every ultrafilter on a set is principal.
Ultrafilters have many applications in set theory, model theory, and topology.: 186 Usually, only free ultrafilters lead to non-trivial constructions. For example, an ultraproduct modulo a principal ultrafilter is always isomorphic to one of the factors, while an ultraproduct modulo a free ultrafilter usually has a more complex structure.
Definitions
Given an arbitrary set
X
,
{\displaystyle X,}
an ultrafilter on
X
{\displaystyle X}
is a non-empty family
U
{\displaystyle U}
of subsets of
X
{\displaystyle X}
such that:
Proper or non-degenerate: The empty set is not an element of
U
.
{\displaystyle U.}
Upward closed in
X
{\displaystyle X}
: If
A
∈
U
{\displaystyle A\in U}
and if
B
⊆
X
{\displaystyle B\subseteq X}
is any superset of
A
{\displaystyle A}
(that is, if
A
⊆
B
⊆
X
{\displaystyle A\subseteq B\subseteq X}
) then
B
∈
U
.
{\displaystyle B\in U.}
π−system: If
A
{\displaystyle A}
and
B
{\displaystyle B}
are elements of
U
{\displaystyle U}
then so is their intersection
A
∩
B
.
{\displaystyle A\cap B.}
If
A
⊆
X
{\displaystyle A\subseteq X}
then either
A
{\displaystyle A}
or its complement
X
∖
A
{\displaystyle X\setminus A}
is an element of
U
.
{\displaystyle U.}
Properties (1), (2), and (3) are the defining properties of a filter on
X
.
{\displaystyle X.}
Some authors do not include non-degeneracy (which is property (1) above) in their definition of "filter". However, the definition of "ultrafilter" (and also of "prefilter" and "filter subbase") always includes non-degeneracy as a defining condition. This article requires that all filters be proper although a filter might be described as "proper" for emphasis.
A filter subbase is a non-empty family of sets that has the finite intersection property (i.e. all finite intersections are non-empty). Equivalently, a filter subbase is a non-empty family of sets that is contained in some (proper) filter. The smallest (relative to
⊆
{\displaystyle \subseteq }
) filter containing a given filter subbase is said to be generated by the filter subbase.
The upward closure in
X
{\displaystyle X}
of a family of sets
P
{\displaystyle P}
is the set
P
↑
X
:=
{
S
:
A
⊆
S
⊆
X
for some
A
∈
P
}
.
{\displaystyle P^{\uparrow X}:=\{S:A\subseteq S\subseteq X{\text{ for some }}A\in P\}.}
A prefilter or filter base is a non-empty and proper (i.e.
∅
∉
P
{\displaystyle \varnothing \not \in P}
) family of sets
P
{\displaystyle P}
that is downward directed, which means that if
B
,
C
∈
P
{\displaystyle B,C\in P}
then there exists some
A
∈
P
{\displaystyle A\in P}
such that
A
⊆
B
∩
C
.
{\displaystyle A\subseteq B\cap C.}
Equivalently, a prefilter is any family of sets
P
{\displaystyle P}
whose upward closure
P
↑
X
{\displaystyle P^{\uparrow X}}
is a filter, in which case this filter is called the filter generated by
P
{\displaystyle P}
and
P
{\displaystyle P}
is said to be a filter base for
P
↑
X
.
{\displaystyle P^{\uparrow X}.}
The dual in
X
{\displaystyle X}
of a family of sets
P
{\displaystyle P}
is the set
X
∖
P
:=
{
X
∖
B
:
B
∈
P
}
.
{\displaystyle X\setminus P:=\{X\setminus B:B\in P\}.}
For example, the dual of the power set
℘
(
X
)
{\displaystyle \wp (X)}
is itself:
X
∖
℘
(
X
)
=
℘
(
X
)
.
{\displaystyle X\setminus \wp (X)=\wp (X).}
A family of sets is a proper filter on
X
{\displaystyle X}
if and only if its dual is a proper ideal on
X
{\displaystyle X}
("proper" means not equal to the power set).
Generalization to ultra prefilters
A family
U
≠
∅
{\displaystyle U\neq \varnothing }
of subsets of
X
{\displaystyle X}
is called ultra if
∅
∉
U
{\displaystyle \varnothing \not \in U}
and any of the following equivalent conditions are satisfied:
For every set
S
⊆
X
{\displaystyle S\subseteq X}
there exists some set
B
∈
U
{\displaystyle B\in U}
such that
B
⊆
S
{\displaystyle B\subseteq S}
or
B
⊆
X
∖
S
{\displaystyle B\subseteq X\setminus S}
(or equivalently, such that
B
∩
S
{\displaystyle B\cap S}
equals
B
{\displaystyle B}
or
∅
{\displaystyle \varnothing }
).
For every set
S
⊆
⋃
B
∈
U
B
{\displaystyle S\subseteq {\textstyle \bigcup \limits _{B\in U}}B}
there exists some set
B
∈
U
{\displaystyle B\in U}
such that
B
∩
S
{\displaystyle B\cap S}
equals
B
{\displaystyle B}
or
∅
.
{\displaystyle \varnothing .}
Here,
⋃
B
∈
U
B
{\displaystyle {\textstyle \bigcup \limits _{B\in U}}B}
is defined to be the union of all sets in
U
.
{\displaystyle U.}
This characterization of "
U
{\displaystyle U}
is ultra" does not depend on the set
X
,
{\displaystyle X,}
so mentioning the set
X
{\displaystyle X}
is optional when using the term "ultra."
For every set
S
{\displaystyle S}
(not necessarily even a subset of
X
{\displaystyle X}
) there exists some set
B
∈
U
{\displaystyle B\in U}
such that
B
∩
S
{\displaystyle B\cap S}
equals
B
{\displaystyle B}
or
∅
.
{\displaystyle \varnothing .}
If
U
{\displaystyle U}
satisfies this condition then so does every superset
V
⊇
U
.
{\displaystyle V\supseteq U.}
In particular, a set
V
{\displaystyle V}
is ultra if and only if
∅
∉
V
{\displaystyle \varnothing \not \in V}
and
V
{\displaystyle V}
contains as a subset some ultra family of sets.
A filter subbase that is ultra is necessarily a prefilter.
The ultra property can now be used to define both ultrafilters and ultra prefilters:
An ultra prefilter is a prefilter that is ultra. Equivalently, it is a filter subbase that is ultra.
An ultrafilter on
X
{\displaystyle X}
is a (proper) filter on
X
{\displaystyle X}
that is ultra. Equivalently, it is any filter on
X
{\displaystyle X}
that is generated by an ultra prefilter.
Ultra prefilters as maximal prefilters
To characterize ultra prefilters in terms of "maximality," the following relation is needed.
Given two families of sets
M
{\displaystyle M}
and
N
,
{\displaystyle N,}
the family
M
{\displaystyle M}
is said to be coarser than
N
,
{\displaystyle N,}
and
N
{\displaystyle N}
is finer than and subordinate to
M
,
{\displaystyle M,}
written
M
≤
N
{\displaystyle M\leq N}
or N ⊢ M, if for every
C
∈
M
,
{\displaystyle C\in M,}
there is some
F
∈
N
{\displaystyle F\in N}
such that
F
⊆
C
.
{\displaystyle F\subseteq C.}
The families
M
{\displaystyle M}
and
N
{\displaystyle N}
are called equivalent if
M
≤
N
{\displaystyle M\leq N}
and
N
≤
M
.
{\displaystyle N\leq M.}
The families
M
{\displaystyle M}
and
N
{\displaystyle N}
are comparable if one of these sets is finer than the other.
The subordination relationship, i.e.
≥
,
{\displaystyle \,\geq ,\,}
is a preorder so the above definition of "equivalent" does form an equivalence relation.
If
M
⊆
N
{\displaystyle M\subseteq N}
then
M
≤
N
{\displaystyle M\leq N}
but the converse does not hold in general.
However, if
N
{\displaystyle N}
is upward closed, such as a filter, then
M
≤
N
{\displaystyle M\leq N}
if and only if
M
⊆
N
.
{\displaystyle M\subseteq N.}
Every prefilter is equivalent to the filter that it generates. This shows that it is possible for filters to be equivalent to sets that are not filters.
If two families of sets
M
{\displaystyle M}
and
N
{\displaystyle N}
are equivalent then either both
M
{\displaystyle M}
and
N
{\displaystyle N}
are ultra (resp. prefilters, filter subbases) or otherwise neither one of them is ultra (resp. a prefilter, a filter subbase).
In particular, if a filter subbase is not also a prefilter, then it is not equivalent to the filter or prefilter that it generates. If
M
{\displaystyle M}
and
N
{\displaystyle N}
are both filters on
X
{\displaystyle X}
then
M
{\displaystyle M}
and
N
{\displaystyle N}
are equivalent if and only if
M
=
N
.
{\displaystyle M=N.}
If a proper filter (resp. ultrafilter) is equivalent to a family of sets
M
{\displaystyle M}
then
M
{\displaystyle M}
is necessarily a prefilter (resp. ultra prefilter).
Using the following characterization, it is possible to define prefilters (resp. ultra prefilters) using only the concept of filters (resp. ultrafilters) and subordination:
An arbitrary family of sets is a prefilter if and only it is equivalent to a (proper) filter.
An arbitrary family of sets is an ultra prefilter if and only it is equivalent to an ultrafilter.
A maximal prefilter on
X
{\displaystyle X}
is a prefilter
U
⊆
℘
(
X
)
{\displaystyle U\subseteq \wp (X)}
that satisfies any of the following equivalent conditions:
U
{\displaystyle U}
is ultra.
U
{\displaystyle U}
is maximal on
Prefilters
(
X
)
{\displaystyle \operatorname {Prefilters} (X)}
with respect to
≤
,
{\displaystyle \,\leq ,}
meaning that if
P
∈
Prefilters
(
X
)
{\displaystyle P\in \operatorname {Prefilters} (X)}
satisfies
U
≤
P
{\displaystyle U\leq P}
then
P
≤
U
.
{\displaystyle P\leq U.}
There is no prefilter properly subordinate to
U
.
{\displaystyle U.}
If a (proper) filter
F
{\displaystyle F}
on
X
{\displaystyle X}
satisfies
U
≤
F
{\displaystyle U\leq F}
then
F
≤
U
.
{\displaystyle F\leq U.}
The filter on
X
{\displaystyle X}
generated by
U
{\displaystyle U}
is ultra.
Characterizations
There are no ultrafilters on the empty set, so it is henceforth assumed that
X
{\displaystyle X}
is nonempty.
A filter subbase
U
{\displaystyle U}
on
X
{\displaystyle X}
is an ultrafilter on
X
{\displaystyle X}
if and only if any of the following equivalent conditions hold:
for any
S
⊆
X
,
{\displaystyle S\subseteq X,}
either
S
∈
U
{\displaystyle S\in U}
or
X
∖
S
∈
U
.
{\displaystyle X\setminus S\in U.}
U
{\displaystyle U}
is a maximal filter subbase on
X
,
{\displaystyle X,}
meaning that if
F
{\displaystyle F}
is any filter subbase on
X
{\displaystyle X}
then
U
⊆
F
{\displaystyle U\subseteq F}
implies
U
=
F
.
{\displaystyle U=F.}
A (proper) filter
U
{\displaystyle U}
on
X
{\displaystyle X}
is an ultrafilter on
X
{\displaystyle X}
if and only if any of the following equivalent conditions hold:
U
{\displaystyle U}
is ultra;
U
{\displaystyle U}
is generated by an ultra prefilter;
For any subset
S
⊆
X
,
{\displaystyle S\subseteq X,}
S
∈
U
{\displaystyle S\in U}
or
X
∖
S
∈
U
.
{\displaystyle X\setminus S\in U.}
So an ultrafilter
U
{\displaystyle U}
decides for every
S
⊆
X
{\displaystyle S\subseteq X}
whether
S
{\displaystyle S}
is "large" (i.e.
S
∈
U
{\displaystyle S\in U}
) or "small" (i.e.
X
∖
S
∈
U
{\displaystyle X\setminus S\in U}
).
For each subset
A
⊆
X
,
{\displaystyle A\subseteq X,}
either
A
{\displaystyle A}
is in
U
{\displaystyle U}
or (
X
∖
A
{\displaystyle X\setminus A}
) is.
U
∪
(
X
∖
U
)
=
℘
(
X
)
.
{\displaystyle U\cup (X\setminus U)=\wp (X).}
This condition can be restated as:
℘
(
X
)
{\displaystyle \wp (X)}
is partitioned by
U
{\displaystyle U}
and its dual
X
∖
U
.
{\displaystyle X\setminus U.}
The sets
P
{\displaystyle P}
and
X
∖
P
{\displaystyle X\setminus P}
are disjoint for all prefilters
P
{\displaystyle P}
on
X
.
{\displaystyle X.}
℘
(
X
)
∖
U
=
{
S
∈
℘
(
X
)
:
S
∉
U
}
{\displaystyle \wp (X)\setminus U=\left\{S\in \wp (X):S\not \in U\right\}}
is an ideal on
X
.
{\displaystyle X.}
For any finite family
S
1
,
…
,
S
n
{\displaystyle S_{1},\ldots ,S_{n}}
of subsets of
X
{\displaystyle X}
(where
n
≥
1
{\displaystyle n\geq 1}
), if
S
1
∪
⋯
∪
S
n
∈
U
{\displaystyle S_{1}\cup \cdots \cup S_{n}\in U}
then
S
i
∈
U
{\displaystyle S_{i}\in U}
for some index
i
.
{\displaystyle i.}
In words, a "large" set cannot be a finite union of sets none of which is large.
For any
R
,
S
⊆
X
,
{\displaystyle R,S\subseteq X,}
if
R
∪
S
=
X
{\displaystyle R\cup S=X}
then
R
∈
U
{\displaystyle R\in U}
or
S
∈
U
.
{\displaystyle S\in U.}
For any
R
,
S
⊆
X
,
{\displaystyle R,S\subseteq X,}
if
R
∪
S
∈
U
{\displaystyle R\cup S\in U}
then
R
∈
U
{\displaystyle R\in U}
or
S
∈
U
{\displaystyle S\in U}
(a filter with this property is called a prime filter).
For any
R
,
S
⊆
X
,
{\displaystyle R,S\subseteq X,}
if
R
∪
S
∈
U
{\displaystyle R\cup S\in U}
and
R
∩
S
=
∅
{\displaystyle R\cap S=\varnothing }
then either
R
∈
U
{\displaystyle R\in U}
or
S
∈
U
.
{\displaystyle S\in U.}
U
{\displaystyle U}
is a maximal filter; that is, if
F
{\displaystyle F}
is a filter on
X
{\displaystyle X}
such that
U
⊆
F
{\displaystyle U\subseteq F}
then
U
=
F
.
{\displaystyle U=F.}
Equivalently,
U
{\displaystyle U}
is a maximal filter if there is no filter
F
{\displaystyle F}
on
X
{\displaystyle X}
that contains
U
{\displaystyle U}
as a proper subset (that is, no filter is strictly finer than
U
{\displaystyle U}
).
= Grills and filter-grills
=If
B
⊆
℘
(
X
)
{\displaystyle {\mathcal {B}}\subseteq \wp (X)}
then its grill on
X
{\displaystyle X}
is the family
B
#
X
:=
{
S
⊆
X
:
S
∩
B
≠
∅
for all
B
∈
B
}
{\displaystyle {\mathcal {B}}^{\#X}:=\{S\subseteq X~:~S\cap B\neq \varnothing {\text{ for all }}B\in {\mathcal {B}}\}}
where
B
#
{\displaystyle {\mathcal {B}}^{\#}}
may be written if
X
{\displaystyle X}
is clear from context.
For example,
∅
#
=
℘
(
X
)
{\displaystyle \varnothing ^{\#}=\wp (X)}
and if
∅
∈
B
{\displaystyle \varnothing \in {\mathcal {B}}}
then
B
#
=
∅
.
{\displaystyle {\mathcal {B}}^{\#}=\varnothing .}
If
A
⊆
B
{\displaystyle {\mathcal {A}}\subseteq {\mathcal {B}}}
then
B
#
⊆
A
#
{\displaystyle {\mathcal {B}}^{\#}\subseteq {\mathcal {A}}^{\#}}
and moreover, if
B
{\displaystyle {\mathcal {B}}}
is a filter subbase then
B
⊆
B
#
.
{\displaystyle {\mathcal {B}}\subseteq {\mathcal {B}}^{\#}.}
The grill
B
#
X
{\displaystyle {\mathcal {B}}^{\#X}}
is upward closed in
X
{\displaystyle X}
if and only if
∅
∉
B
,
{\displaystyle \varnothing \not \in {\mathcal {B}},}
which will henceforth be assumed. Moreover,
B
#
#
=
B
↑
X
{\displaystyle {\mathcal {B}}^{\#\#}={\mathcal {B}}^{\uparrow X}}
so that
B
{\displaystyle {\mathcal {B}}}
is upward closed in
X
{\displaystyle X}
if and only if
B
#
#
=
B
.
{\displaystyle {\mathcal {B}}^{\#\#}={\mathcal {B}}.}
The grill of a filter on
X
{\displaystyle X}
is called a filter-grill on
X
.
{\displaystyle X.}
For any
∅
≠
B
⊆
℘
(
X
)
,
{\displaystyle \varnothing \neq {\mathcal {B}}\subseteq \wp (X),}
B
{\displaystyle {\mathcal {B}}}
is a filter-grill on
X
{\displaystyle X}
if and only if (1)
B
{\displaystyle {\mathcal {B}}}
is upward closed in
X
{\displaystyle X}
and (2) for all sets
R
{\displaystyle R}
and
S
,
{\displaystyle S,}
if
R
∪
S
∈
B
{\displaystyle R\cup S\in {\mathcal {B}}}
then
R
∈
B
{\displaystyle R\in {\mathcal {B}}}
or
S
∈
B
.
{\displaystyle S\in {\mathcal {B}}.}
The grill operation
F
↦
F
#
X
{\displaystyle {\mathcal {F}}\mapsto {\mathcal {F}}^{\#X}}
induces a bijection
∙
#
X
:
Filters
(
X
)
→
FilterGrills
(
X
)
{\displaystyle {\bullet }^{\#X}~:~\operatorname {Filters} (X)\to \operatorname {FilterGrills} (X)}
whose inverse is also given by
F
↦
F
#
X
.
{\displaystyle {\mathcal {F}}\mapsto {\mathcal {F}}^{\#X}.}
If
F
∈
Filters
(
X
)
{\displaystyle {\mathcal {F}}\in \operatorname {Filters} (X)}
then
F
{\displaystyle {\mathcal {F}}}
is a filter-grill on
X
{\displaystyle X}
if and only if
F
=
F
#
X
,
{\displaystyle {\mathcal {F}}={\mathcal {F}}^{\#X},}
or equivalently, if and only if
F
{\displaystyle {\mathcal {F}}}
is an ultrafilter on
X
.
{\displaystyle X.}
That is, a filter on
X
{\displaystyle X}
is a filter-grill if and only if it is ultra. For any non-empty
F
⊆
℘
(
X
)
,
{\displaystyle {\mathcal {F}}\subseteq \wp (X),}
F
{\displaystyle {\mathcal {F}}}
is both a filter on
X
{\displaystyle X}
and a filter-grill on
X
{\displaystyle X}
if and only if (1)
∅
∉
F
{\displaystyle \varnothing \not \in {\mathcal {F}}}
and (2) for all
R
,
S
⊆
X
,
{\displaystyle R,S\subseteq X,}
the following equivalences hold:
R
∪
S
∈
F
{\displaystyle R\cup S\in {\mathcal {F}}}
if and only if
R
,
S
∈
F
{\displaystyle R,S\in {\mathcal {F}}}
if and only if
R
∩
S
∈
F
.
{\displaystyle R\cap S\in {\mathcal {F}}.}
= Free or principal
=If
P
{\displaystyle P}
is any non-empty family of sets then the Kernel of
P
{\displaystyle P}
is the intersection of all sets in
P
:
{\displaystyle P:}
ker
P
:=
⋂
B
∈
P
B
.
{\displaystyle \operatorname {ker} P:=\bigcap _{B\in P}B.}
A non-empty family of sets
P
{\displaystyle P}
is called:
free if
ker
P
=
∅
{\displaystyle \operatorname {ker} P=\varnothing }
and fixed otherwise (that is, if
ker
P
≠
∅
{\displaystyle \operatorname {ker} P\neq \varnothing }
).
principal if
ker
P
∈
P
.
{\displaystyle \operatorname {ker} P\in P.}
principal at a point if
ker
P
∈
P
{\displaystyle \operatorname {ker} P\in P}
and
ker
P
{\displaystyle \operatorname {ker} P}
is a singleton set; in this case, if
ker
P
=
{
x
}
{\displaystyle \operatorname {ker} P=\{x\}}
then
P
{\displaystyle P}
is said to be principal at
x
.
{\displaystyle x.}
If a family of sets
P
{\displaystyle P}
is fixed then
P
{\displaystyle P}
is ultra if and only if some element of
P
{\displaystyle P}
is a singleton set, in which case
P
{\displaystyle P}
will necessarily be a prefilter. Every principal prefilter is fixed, so a principal prefilter
P
{\displaystyle P}
is ultra if and only if
ker
P
{\displaystyle \operatorname {ker} P}
is a singleton set. A singleton set is ultra if and only if its sole element is also a singleton set.
The next theorem shows that every ultrafilter falls into one of two categories: either it is free or else it is a principal filter generated by a single point.
Every filter on
X
{\displaystyle X}
that is principal at a single point is an ultrafilter, and if in addition
X
{\displaystyle X}
is finite, then there are no ultrafilters on
X
{\displaystyle X}
other than these. In particular, if a set
X
{\displaystyle X}
has finite cardinality
n
<
∞
,
{\displaystyle n<\infty ,}
then there are exactly
n
{\displaystyle n}
ultrafilters on
X
{\displaystyle X}
and those are the ultrafilters generated by each singleton subset of
X
.
{\displaystyle X.}
Consequently, free ultrafilters can only exist on an infinite set.
Examples, properties, and sufficient conditions
If
X
{\displaystyle X}
is an infinite set then there are as many ultrafilters over
X
{\displaystyle X}
as there are families of subsets of
X
;
{\displaystyle X;}
explicitly, if
X
{\displaystyle X}
has infinite cardinality
κ
{\displaystyle \kappa }
then the set of ultrafilters over
X
{\displaystyle X}
has the same cardinality as
℘
(
℘
(
X
)
)
;
{\displaystyle \wp (\wp (X));}
that cardinality being
2
2
κ
.
{\displaystyle 2^{2^{\kappa }}.}
If
U
{\displaystyle U}
and
S
{\displaystyle S}
are families of sets such that
U
{\displaystyle U}
is ultra,
∅
∉
S
,
{\displaystyle \varnothing \not \in S,}
and
U
≤
S
,
{\displaystyle U\leq S,}
then
S
{\displaystyle S}
is necessarily ultra.
A filter subbase
U
{\displaystyle U}
that is not a prefilter cannot be ultra; but it is nevertheless still possible for the prefilter and filter generated by
U
{\displaystyle U}
to be ultra.
Suppose
U
⊆
℘
(
X
)
{\displaystyle U\subseteq \wp (X)}
is ultra and
Y
{\displaystyle Y}
is a set.
The trace
U
|
Y
:=
{
B
∩
Y
:
B
∈
U
}
{\displaystyle U\vert _{Y}:=\{B\cap Y:B\in U\}}
is ultra if and only if it does not contain the empty set.
Furthermore, at least one of the sets
U
|
Y
∖
{
∅
}
{\displaystyle U\vert _{Y}\setminus \{\varnothing \}}
and
U
|
X
∖
Y
∖
{
∅
}
{\displaystyle U\vert _{X\setminus Y}\setminus \{\varnothing \}}
will be ultra (this result extends to any finite partition of
X
{\displaystyle X}
).
If
F
1
,
…
,
F
n
{\displaystyle F_{1},\ldots ,F_{n}}
are filters on
X
,
{\displaystyle X,}
U
{\displaystyle U}
is an ultrafilter on
X
,
{\displaystyle X,}
and
F
1
∩
⋯
∩
F
n
≤
U
,
{\displaystyle F_{1}\cap \cdots \cap F_{n}\leq U,}
then there is some
F
i
{\displaystyle F_{i}}
that satisfies
F
i
≤
U
.
{\displaystyle F_{i}\leq U.}
This result is not necessarily true for an infinite family of filters.
The image under a map
f
:
X
→
Y
{\displaystyle f:X\to Y}
of an ultra set
U
⊆
℘
(
X
)
{\displaystyle U\subseteq \wp (X)}
is again ultra and if
U
{\displaystyle U}
is an ultra prefilter then so is
f
(
U
)
.
{\displaystyle f(U).}
The property of being ultra is preserved under bijections. However, the preimage of an ultrafilter is not necessarily ultra, not even if the map is surjective. For example, if
X
{\displaystyle X}
has more than one point and if the range of
f
:
X
→
Y
{\displaystyle f:X\to Y}
consists of a single point
{
y
}
{\displaystyle \{y\}}
then
{
y
}
{\displaystyle \{y\}}
is an ultra prefilter on
Y
{\displaystyle Y}
but its preimage is not ultra. Alternatively, if
U
{\displaystyle U}
is a principal filter generated by a point in
Y
∖
f
(
X
)
{\displaystyle Y\setminus f(X)}
then the preimage of
U
{\displaystyle U}
contains the empty set and so is not ultra.
The elementary filter induced by an infinite sequence, all of whose points are distinct, is not an ultrafilter. If
n
=
2
,
{\displaystyle n=2,}
then
U
n
{\displaystyle U_{n}}
denotes the set consisting all subsets of
X
{\displaystyle X}
having cardinality
n
,
{\displaystyle n,}
and if
X
{\displaystyle X}
contains at least
2
n
−
1
{\displaystyle 2n-1}
(
=
3
{\displaystyle =3}
) distinct points, then
U
n
{\displaystyle U_{n}}
is ultra but it is not contained in any prefilter. This example generalizes to any integer
n
>
1
{\displaystyle n>1}
and also to
n
=
1
{\displaystyle n=1}
if
X
{\displaystyle X}
contains more than one element. Ultra sets that are not also prefilters are rarely used.
For every
S
⊆
X
×
X
{\displaystyle S\subseteq X\times X}
and every
a
∈
X
,
{\displaystyle a\in X,}
let
S
|
{
a
}
×
X
:=
{
y
∈
X
:
(
a
,
y
)
∈
S
}
.
{\displaystyle S{\big \vert }_{\{a\}\times X}:=\{y\in X~:~(a,y)\in S\}.}
If
U
{\displaystyle {\mathcal {U}}}
is an ultrafilter on
X
{\displaystyle X}
then the set of all
S
⊆
X
×
X
{\displaystyle S\subseteq X\times X}
such that
{
a
∈
X
:
S
|
{
a
}
×
X
∈
U
}
∈
U
{\displaystyle \left\{a\in X~:~S{\big \vert }_{\{a\}\times X}\in {\mathcal {U}}\right\}\in {\mathcal {U}}}
is an ultrafilter on
X
×
X
.
{\displaystyle X\times X.}
= Monad structure
=The functor associating to any set
X
{\displaystyle X}
the set of
U
(
X
)
{\displaystyle U(X)}
of all ultrafilters on
X
{\displaystyle X}
forms a monad called the ultrafilter monad. The unit map
X
→
U
(
X
)
{\displaystyle X\to U(X)}
sends any element
x
∈
X
{\displaystyle x\in X}
to the principal ultrafilter given by
x
.
{\displaystyle x.}
This ultrafilter monad is the codensity monad of the inclusion of the category of finite sets into the category of all sets, which gives a conceptual explanation of this monad.
Similarly, the ultraproduct monad is the codensity monad of the inclusion of the category of finite families of sets into the category of all families of set. So in this sense, ultraproducts are categorically inevitable.
The ultrafilter lemma
The ultrafilter lemma was first proved by Alfred Tarski in 1930.
The ultrafilter lemma is equivalent to each of the following statements:
For every prefilter on a set
X
,
{\displaystyle X,}
there exists a maximal prefilter on
X
{\displaystyle X}
subordinate to it.
Every proper filter subbase on a set
X
{\displaystyle X}
is contained in some ultrafilter on
X
.
{\displaystyle X.}
A consequence of the ultrafilter lemma is that every filter is equal to the intersection of all ultrafilters containing it.
The following results can be proven using the ultrafilter lemma.
A free ultrafilter exists on a set
X
{\displaystyle X}
if and only if
X
{\displaystyle X}
is infinite. Every proper filter is equal to the intersection of all ultrafilters containing it. Since there are filters that are not ultra, this shows that the intersection of a family of ultrafilters need not be ultra. A family of sets
F
≠
∅
{\displaystyle \mathbb {F} \neq \varnothing }
can be extended to a free ultrafilter if and only if the intersection of any finite family of elements of
F
{\displaystyle \mathbb {F} }
is infinite.
= Relationships to other statements under ZF
=Throughout this section, ZF refers to Zermelo–Fraenkel set theory and ZFC refers to ZF with the Axiom of Choice (AC). The ultrafilter lemma is independent of ZF. That is, there exist models in which the axioms of ZF hold but the ultrafilter lemma does not. There also exist models of ZF in which every ultrafilter is necessarily principal.
Every filter that contains a singleton set is necessarily an ultrafilter and given
x
∈
X
,
{\displaystyle x\in X,}
the definition of the discrete ultrafilter
{
S
⊆
X
:
x
∈
S
}
{\displaystyle \{S\subseteq X:x\in S\}}
does not require more than ZF.
If
X
{\displaystyle X}
is finite then every ultrafilter is a discrete filter at a point; consequently, free ultrafilters can only exist on infinite sets.
In particular, if
X
{\displaystyle X}
is finite then the ultrafilter lemma can be proven from the axioms ZF.
The existence of free ultrafilter on infinite sets can be proven if the axiom of choice is assumed.
More generally, the ultrafilter lemma can be proven by using the axiom of choice, which in brief states that any Cartesian product of non-empty sets is non-empty. Under ZF, the axiom of choice is, in particular, equivalent to (a) Zorn's lemma, (b) Tychonoff's theorem, (c) the weak form of the vector basis theorem (which states that every vector space has a basis), (d) the strong form of the vector basis theorem, and other statements.
However, the ultrafilter lemma is strictly weaker than the axiom of choice.
While free ultrafilters can be proven to exist, it is not possible to construct an explicit example of a free ultrafilter (using only ZF and the ultrafilter lemma); that is, free ultrafilters are intangible.
Alfred Tarski proved that under ZFC, the cardinality of the set of all free ultrafilters on an infinite set
X
{\displaystyle X}
is equal to the cardinality of
℘
(
℘
(
X
)
)
,
{\displaystyle \wp (\wp (X)),}
where
℘
(
X
)
{\displaystyle \wp (X)}
denotes the power set of
X
.
{\displaystyle X.}
Other authors attribute this discovery to Bedřich Pospíšil (following a combinatorial argument from Fichtenholz, and Kantorovitch, improved by Hausdorff).
Under ZF, the axiom of choice can be used to prove both the ultrafilter lemma and the Krein–Milman theorem; conversely, under ZF, the ultrafilter lemma together with the Krein–Milman theorem can prove the axiom of choice.
Statements that cannot be deduced
The ultrafilter lemma is a relatively weak axiom. For example, each of the statements in the following list can not be deduced from ZF together with only the ultrafilter lemma:
A countable union of countable sets is a countable set.
The axiom of countable choice (ACC).
The axiom of dependent choice (ADC).
Equivalent statements
Under ZF, the ultrafilter lemma is equivalent to each of the following statements:
The Boolean prime ideal theorem (BPIT).
Stone's representation theorem for Boolean algebras.
Any product of Boolean spaces is a Boolean space.
Boolean Prime Ideal Existence Theorem: Every nondegenerate Boolean algebra has a prime ideal.
Tychonoff's theorem for Hausdorff spaces: Any product of compact Hausdorff spaces is compact.
If
{
0
,
1
}
{\displaystyle \{0,1\}}
is endowed with the discrete topology then for any set
I
,
{\displaystyle I,}
the product space
{
0
,
1
}
I
{\displaystyle \{0,1\}^{I}}
is compact.
Each of the following versions of the Banach-Alaoglu theorem is equivalent to the ultrafilter lemma:
Any equicontinuous set of scalar-valued maps on a topological vector space (TVS) is relatively compact in the weak-* topology (that is, it is contained in some weak-* compact set).
The polar of any neighborhood of the origin in a TVS
X
{\displaystyle X}
is a weak-* compact subset of its continuous dual space.
The closed unit ball in the continuous dual space of any normed space is weak-* compact.
If the normed space is separable then the ultrafilter lemma is sufficient but not necessary to prove this statement.
A topological space
X
{\displaystyle X}
is compact if every ultrafilter on
X
{\displaystyle X}
converges to some limit.
A topological space
X
{\displaystyle X}
is compact if and only if every ultrafilter on
X
{\displaystyle X}
converges to some limit.
The addition of the words "and only if" is the only difference between this statement and the one immediately above it.
The Alexander subbase theorem.
The Ultranet lemma: Every net has a universal subnet.
By definition, a net in
X
{\displaystyle X}
is called an ultranet or an universal net if for every subset
S
⊆
X
,
{\displaystyle S\subseteq X,}
the net is eventually in
S
{\displaystyle S}
or in
X
∖
S
.
{\displaystyle X\setminus S.}
A topological space
X
{\displaystyle X}
is compact if and only if every ultranet on
X
{\displaystyle X}
converges to some limit.
If the words "and only if" are removed then the resulting statement remains equivalent to the ultrafilter lemma.
A convergence space
X
{\displaystyle X}
is compact if every ultrafilter on
X
{\displaystyle X}
converges.
A uniform space is compact if it is complete and totally bounded.
The Stone–Čech compactification Theorem.
Each of the following versions of the compactness theorem is equivalent to the ultrafilter lemma:
If
Σ
{\displaystyle \Sigma }
is a set of first-order sentences such that every finite subset of
Σ
{\displaystyle \Sigma }
has a model, then
Σ
{\displaystyle \Sigma }
has a model.
If
Σ
{\displaystyle \Sigma }
is a set of zero-order sentences such that every finite subset of
Σ
{\displaystyle \Sigma }
has a model, then
Σ
{\displaystyle \Sigma }
has a model.
The completeness theorem: If
Σ
{\displaystyle \Sigma }
is a set of zero-order sentences that is syntactically consistent, then it has a model (that is, it is semantically consistent).
Weaker statements
Any statement that can be deduced from the ultrafilter lemma (together with ZF) is said to be weaker than the ultrafilter lemma.
A weaker statement is said to be strictly weaker if under ZF, it is not equivalent to the ultrafilter lemma.
Under ZF, the ultrafilter lemma implies each of the following statements:
The Axiom of Choice for Finite sets (ACF): Given
I
≠
∅
{\displaystyle I\neq \varnothing }
and a family
(
X
i
)
i
∈
I
{\displaystyle \left(X_{i}\right)_{i\in I}}
of non-empty finite sets, their product
∏
i
∈
I
X
i
{\displaystyle {\textstyle \prod \limits _{i\in I}}X_{i}}
is not empty.
A countable union of finite sets is a countable set.
However, ZF with the ultrafilter lemma is too weak to prove that a countable union of countable sets is a countable set.
The Hahn–Banach theorem.
In ZF, the Hahn–Banach theorem is strictly weaker than the ultrafilter lemma.
The Banach–Tarski paradox.
In fact, under ZF, the Banach–Tarski paradox can be deduced from the Hahn–Banach theorem, which is strictly weaker than the Ultrafilter Lemma.
Every set can be linearly ordered.
Every field has a unique algebraic closure.
Non-trivial ultraproducts exist.
The weak ultrafilter theorem: A free ultrafilter exists on
N
.
{\displaystyle \mathbb {N} .}
Under ZF, the weak ultrafilter theorem does not imply the ultrafilter lemma; that is, it is strictly weaker than the ultrafilter lemma.
There exists a free ultrafilter on every infinite set;
This statement is actually strictly weaker than the ultrafilter lemma.
ZF alone does not even imply that there exists a non-principal ultrafilter on some set.
Completeness
The completeness of an ultrafilter
U
{\displaystyle U}
on a powerset is the smallest cardinal κ such that there are κ elements of
U
{\displaystyle U}
whose intersection is not in
U
.
{\displaystyle U.}
The definition of an ultrafilter implies that the completeness of any powerset ultrafilter is at least
ℵ
0
{\displaystyle \aleph _{0}}
. An ultrafilter whose completeness is greater than
ℵ
0
{\displaystyle \aleph _{0}}
—that is, the intersection of any countable collection of elements of
U
{\displaystyle U}
is still in
U
{\displaystyle U}
—is called countably complete or σ-complete.
The completeness of a countably complete nonprincipal ultrafilter on a powerset is always a measurable cardinal.
Ordering on ultrafilters
The Rudin–Keisler ordering (named after Mary Ellen Rudin and Howard Jerome Keisler) is a preorder on the class of powerset ultrafilters defined as follows: if
U
{\displaystyle U}
is an ultrafilter on
℘
(
X
)
,
{\displaystyle \wp (X),}
and
V
{\displaystyle V}
an ultrafilter on
℘
(
Y
)
,
{\displaystyle \wp (Y),}
then
V
≤
R
K
U
{\displaystyle V\leq {}_{RK}U}
if there exists a function
f
:
X
→
Y
{\displaystyle f:X\to Y}
such that
C
∈
V
{\displaystyle C\in V}
if and only if
f
−
1
[
C
]
∈
U
{\displaystyle f^{-1}[C]\in U}
for every subset
C
⊆
Y
.
{\displaystyle C\subseteq Y.}
Ultrafilters
U
{\displaystyle U}
and
V
{\displaystyle V}
are called Rudin–Keisler equivalent, denoted U ≡RK V, if there exist sets
A
∈
U
{\displaystyle A\in U}
and
B
∈
V
{\displaystyle B\in V}
and a bijection
f
:
A
→
B
{\displaystyle f:A\to B}
that satisfies the condition above. (If
X
{\displaystyle X}
and
Y
{\displaystyle Y}
have the same cardinality, the definition can be simplified by fixing
A
=
X
,
{\displaystyle A=X,}
B
=
Y
.
{\displaystyle B=Y.}
)
It is known that ≡RK is the kernel of ≤RK, i.e., that U ≡RK V if and only if
U
≤
R
K
V
{\displaystyle U\leq {}_{RK}V}
and
V
≤
R
K
U
.
{\displaystyle V\leq {}_{RK}U.}
Ultrafilters on ℘(ω)
There are several special properties that an ultrafilter on
℘
(
ω
)
,
{\displaystyle \wp (\omega ),}
where
ω
{\displaystyle \omega }
extends the natural numbers, may possess, which prove useful in various areas of set theory and topology.
A non-principal ultrafilter
U
{\displaystyle U}
is called a P-point (or weakly selective) if for every partition
{
C
n
:
n
<
ω
}
{\displaystyle \left\{C_{n}:n<\omega \right\}}
of
ω
{\displaystyle \omega }
such that for all
n
<
ω
,
{\displaystyle n<\omega ,}
C
n
∉
U
,
{\displaystyle C_{n}\not \in U,}
there exists some
A
∈
U
{\displaystyle A\in U}
such that
A
∩
C
n
{\displaystyle A\cap C_{n}}
is a finite set for each
n
.
{\displaystyle n.}
A non-principal ultrafilter
U
{\displaystyle U}
is called Ramsey (or selective) if for every partition
{
C
n
:
n
<
ω
}
{\displaystyle \left\{C_{n}:n<\omega \right\}}
of
ω
{\displaystyle \omega }
such that for all
n
<
ω
,
{\displaystyle n<\omega ,}
C
n
∉
U
,
{\displaystyle C_{n}\not \in U,}
there exists some
A
∈
U
{\displaystyle A\in U}
such that
A
∩
C
n
{\displaystyle A\cap C_{n}}
is a singleton set for each
n
.
{\displaystyle n.}
It is a trivial observation that all Ramsey ultrafilters are P-points. Walter Rudin proved that the continuum hypothesis implies the existence of Ramsey ultrafilters.
In fact, many hypotheses imply the existence of Ramsey ultrafilters, including Martin's axiom. Saharon Shelah later showed that it is consistent that there are no P-point ultrafilters. Therefore, the existence of these types of ultrafilters is independent of ZFC.
P-points are called as such because they are topological P-points in the usual topology of the space βω \ ω of non-principal ultrafilters. The name Ramsey comes from Ramsey's theorem. To see why, one can prove that an ultrafilter is Ramsey if and only if for every 2-coloring of
[
ω
]
2
{\displaystyle [\omega ]^{2}}
there exists an element of the ultrafilter that has a homogeneous color.
An ultrafilter on
℘
(
ω
)
{\displaystyle \wp (\omega )}
is Ramsey if and only if it is minimal in the Rudin–Keisler ordering of non-principal powerset ultrafilters.
See also
Extender (set theory) – in set theory, a system of ultrafilters representing an elementary embedding witnessing large cardinal propertiesPages displaying wikidata descriptions as a fallback
Filter (mathematics) – In mathematics, a special subset of a partially ordered set
Filter (set theory) – Family of sets representing "large" sets
Filters in topology – Use of filters to describe and characterize all basic topological notions and results.
Łoś's theorem – Mathematical constructionPages displaying short descriptions of redirect targets
Ultrafilter – Maximal proper filter
Universal net – A generalization of a sequence of pointsPages displaying short descriptions of redirect targets
Notes
Proofs
References
Bibliography
Arkhangel'skii, Alexander Vladimirovich; Ponomarev, V.I. (1984). Fundamentals of General Topology: Problems and Exercises. Mathematics and Its Applications. Vol. 13. Dordrecht Boston: D. Reidel. ISBN 978-90-277-1355-1. OCLC 9944489.
Bourbaki, Nicolas (1989) [1966]. General Topology: Chapters 1–4 [Topologie Générale]. Éléments de mathématique. Berlin New York: Springer Science & Business Media. ISBN 978-3-540-64241-1. OCLC 18588129.
Dixmier, Jacques (1984). General Topology. Undergraduate Texts in Mathematics. Translated by Berberian, S. K. New York: Springer-Verlag. ISBN 978-0-387-90972-1. OCLC 10277303.
Dolecki, Szymon; Mynard, Frédéric (2016). Convergence Foundations Of Topology. New Jersey: World Scientific Publishing Company. ISBN 978-981-4571-52-4. OCLC 945169917.
Dugundji, James (1966). Topology. Boston: Allyn and Bacon. ISBN 978-0-697-06889-7. OCLC 395340485.
Császár, Ákos (1978). General topology. Translated by Császár, Klára. Bristol England: Adam Hilger Ltd. ISBN 0-85274-275-4. OCLC 4146011.
Jech, Thomas (2006). Set Theory: The Third Millennium Edition, Revised and Expanded. Berlin New York: Springer Science & Business Media. ISBN 978-3-540-44085-7. OCLC 50422939.
Joshi, K. D. (1983). Introduction to General Topology. New York: John Wiley and Sons Ltd. ISBN 978-0-85226-444-7. OCLC 9218750.
Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. ISBN 978-1584888666. OCLC 144216834.
Schechter, Eric (1996). Handbook of Analysis and Its Foundations. San Diego, CA: Academic Press. ISBN 978-0-12-622760-4. OCLC 175294365.
Schubert, Horst (1968). Topology. London: Macdonald & Co. ISBN 978-0-356-02077-8. OCLC 463753.
Further reading
Comfort, W. W. (1977). "Ultrafilters: some old and some new results" (PDF). Bulletin of the American Mathematical Society. 83 (4): 417–455. doi:10.1090/S0002-9904-1977-14316-4. ISSN 0002-9904. MR 0454893.
Comfort, W. W.; Negrepontis, S. (1974), The theory of ultrafilters, Berlin, New York: Springer-Verlag, MR 0396267
Ultrafilter at the nLab
Kata Kunci Pencarian:
- Aljabar Boolean (struktur)
- Monad (teori kategori)
- Basis (aljabar linear)
- Infinitesimal
- Ultrafilter on a set
- Ultrafilter
- Almost everywhere
- Field (mathematics)
- Singleton (mathematics)
- Shelah cardinal
- Tychonoff's theorem
- Cofiniteness
- Ultraproduct
- Filter (set theory)
