- Source: Filter (set theory)
In mathematics, a filter on a set
X
{\displaystyle X}
is a family
B
{\displaystyle {\mathcal {B}}}
of subsets such that:
X
∈
B
{\displaystyle X\in {\mathcal {B}}}
and
∅
∉
B
{\displaystyle \emptyset \notin {\mathcal {B}}}
if
A
∈
B
{\displaystyle A\in {\mathcal {B}}}
and
B
∈
B
{\displaystyle B\in {\mathcal {B}}}
, then
A
∩
B
∈
B
{\displaystyle A\cap B\in {\mathcal {B}}}
If
A
⊂
B
⊂
X
{\displaystyle A\subset B\subset X}
and
A
∈
B
{\displaystyle A\in {\mathcal {B}}}
, then
B
∈
B
{\displaystyle B\in {\mathcal {B}}}
A filter on a set may be thought of as representing a "collection of large subsets", one intuitive example being the neighborhood filter. Filters appear in order theory, model theory, and set theory, but can also be found in topology, from which they originate. The dual notion of a filter is an ideal.
Filters were introduced by Henri Cartan in 1937 and as described in the article dedicated to filters in topology, they were subsequently used by Nicolas Bourbaki in their book Topologie Générale as an alternative to the related notion of a net developed in 1922 by E. H. Moore and Herman L. Smith. Order filters are generalizations of filters from sets to arbitrary partially ordered sets. Specifically, a filter on a set is just a proper order filter in the special case where the partially ordered set consists of the power set ordered by set inclusion.
Preliminaries, notation, and basic notions
In this article, upper case Roman letters like
S
{\displaystyle S}
and
X
{\displaystyle X}
denote sets (but not families unless indicated otherwise) and
℘
(
X
)
{\displaystyle \wp (X)}
will denote the power set of
X
.
{\displaystyle X.}
A subset of a power set is called a family of sets (or simply, a family) where it is over
X
{\displaystyle X}
if it is a subset of
℘
(
X
)
.
{\displaystyle \wp (X).}
Families of sets will be denoted by upper case calligraphy letters such as
B
,
C
,
and
F
.
{\displaystyle {\mathcal {B}},{\mathcal {C}},{\text{ and }}{\mathcal {F}}.}
Whenever these assumptions are needed, then it should be assumed that
X
{\displaystyle X}
is non–empty and that
B
,
F
,
{\displaystyle {\mathcal {B}},{\mathcal {F}},}
etc. are families of sets over
X
.
{\displaystyle X.}
The terms "prefilter" and "filter base" are synonyms and will be used interchangeably.
Warning about competing definitions and notation
There are unfortunately several terms in the theory of filters that are defined differently by different authors.
These include some of the most important terms such as "filter".
While different definitions of the same term usually have significant overlap, due to the very technical nature of filters (and point–set topology), these differences in definitions nevertheless often have important consequences.
When reading mathematical literature, it is recommended that readers check how the terminology related to filters is defined by the author.
For this reason, this article will clearly state all definitions as they are used.
Unfortunately, not all notation related to filters is well established and some notation varies greatly across the literature (for example, the notation for the set of all prefilters on a set) so in such cases this article uses whatever notation is most self describing or easily remembered.
The theory of filters and prefilters is well developed and has a plethora of definitions and notations, many of which are now unceremoniously listed to prevent this article from becoming prolix and to allow for the easy look up of notation and definitions.
Their important properties are described later.
Sets operations
The upward closure or isotonization in
X
{\displaystyle X}
of a family of sets
B
⊆
℘
(
X
)
{\displaystyle {\mathcal {B}}\subseteq \wp (X)}
is
and similarly the downward closure of
B
{\displaystyle {\mathcal {B}}}
is
B
↓
:=
{
S
⊆
B
:
B
∈
B
}
=
⋃
B
∈
B
℘
(
B
)
.
{\displaystyle {\mathcal {B}}^{\downarrow }:=\{S\subseteq B~:~B\in {\mathcal {B}}\,\}=\bigcup _{B\in {\mathcal {B}}}\wp (B).}
Throughout,
f
{\displaystyle f}
is a map and
S
{\displaystyle S}
is a set.
Nets and their tails
A directed set is a set
I
{\displaystyle I}
together with a preorder, which will be denoted by
≤
{\displaystyle \,\leq \,}
(unless explicitly indicated otherwise), that makes
(
I
,
≤
)
{\displaystyle (I,\leq )}
into an (upward) directed set; this means that for all
i
,
j
∈
I
,
{\displaystyle i,j\in I,}
there exists some
k
∈
I
{\displaystyle k\in I}
such that
i
≤
k
and
j
≤
k
.
{\displaystyle i\leq k{\text{ and }}j\leq k.}
For any indices
i
and
j
,
{\displaystyle i{\text{ and }}j,}
the notation
j
≥
i
{\displaystyle j\geq i}
is defined to mean
i
≤
j
{\displaystyle i\leq j}
while
i
<
j
{\displaystyle i
is defined to mean that
i
≤
j
{\displaystyle i\leq j}
holds but it is not true that
j
≤
i
{\displaystyle j\leq i}
(if
≤
{\displaystyle \,\leq \,}
is antisymmetric then this is equivalent to
i
≤
j
and
i
≠
j
{\displaystyle i\leq j{\text{ and }}i\neq j}
).
A net in
X
{\displaystyle X}
is a map from a non–empty directed set into
X
.
{\displaystyle X.}
The notation
x
∙
=
(
x
i
)
i
∈
I
{\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}
will be used to denote a net with domain
I
.
{\displaystyle I.}
Warning about using strict comparison
If
x
∙
=
(
x
i
)
i
∈
I
{\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}
is a net and
i
∈
I
{\displaystyle i\in I}
then it is possible for the set
x
>
i
=
{
x
j
:
j
>
i
and
j
∈
I
}
,
{\displaystyle x_{>i}=\left\{x_{j}~:~j>i{\text{ and }}j\in I\right\},}
which is called the tail of
x
∙
{\displaystyle x_{\bullet }}
after
i
{\displaystyle i}
, to be empty (for example, this happens if
i
{\displaystyle i}
is an upper bound of the directed set
I
{\displaystyle I}
).
In this case, the family
{
x
>
i
:
i
∈
I
}
{\displaystyle \left\{x_{>i}~:~i\in I\right\}}
would contain the empty set, which would prevent it from being a prefilter (defined later).
This is the (important) reason for defining
Tails
(
x
∙
)
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)}
as
{
x
≥
i
:
i
∈
I
}
{\displaystyle \left\{x_{\geq i}~:~i\in I\right\}}
rather than
{
x
>
i
:
i
∈
I
}
{\displaystyle \left\{x_{>i}~:~i\in I\right\}}
or even
{
x
>
i
:
i
∈
I
}
∪
{
x
≥
i
:
i
∈
I
}
{\displaystyle \left\{x_{>i}~:~i\in I\right\}\cup \left\{x_{\geq i}~:~i\in I\right\}}
and it is for this reason that in general, when dealing with the prefilter of tails of a net, the strict inequality
<
{\displaystyle \,<\,}
may not be used interchangeably with the inequality
≤
.
{\displaystyle \,\leq .}
Filters and prefilters
The following is a list of properties that a family
B
{\displaystyle {\mathcal {B}}}
of sets may possess and they form the defining properties of filters, prefilters, and filter subbases. Whenever it is necessary, it should be assumed that
B
⊆
℘
(
X
)
.
{\displaystyle {\mathcal {B}}\subseteq \wp (X).}
Many of the properties of
B
{\displaystyle {\mathcal {B}}}
defined above and below, such as "proper" and "directed downward," do not depend on
X
,
{\displaystyle X,}
so mentioning the set
X
{\displaystyle X}
is optional when using such terms. Definitions involving being "upward closed in
X
,
{\displaystyle X,}
" such as that of "filter on
X
,
{\displaystyle X,}
" do depend on
X
{\displaystyle X}
so the set
X
{\displaystyle X}
should be mentioned if it is not clear from context.
Filters
(
X
)
=
DualIdeals
(
X
)
∖
{
℘
(
X
)
}
⊆
Prefilters
(
X
)
⊆
FilterSubbases
(
X
)
.
{\displaystyle {\textrm {Filters}}(X)\quad =\quad {\textrm {DualIdeals}}(X)\,\setminus \,\{\wp (X)\}\quad \subseteq \quad {\textrm {Prefilters}}(X)\quad \subseteq \quad {\textrm {FilterSubbases}}(X).}
There are no prefilters on
X
=
∅
{\displaystyle X=\varnothing }
(nor are there any nets valued in
∅
{\displaystyle \varnothing }
), which is why this article, like most authors, will automatically assume without comment that
X
≠
∅
{\displaystyle X\neq \varnothing }
whenever this assumption is needed.
= Basic examples
=Named examples
The singleton set
B
=
{
X
}
{\displaystyle {\mathcal {B}}=\{X\}}
is called the indiscrete or trivial filter on
X
.
{\displaystyle X.}
It is the unique minimal filter on
X
{\displaystyle X}
because it is a subset of every filter on
X
{\displaystyle X}
; however, it need not be a subset of every prefilter on
X
.
{\displaystyle X.}
The dual ideal
℘
(
X
)
{\displaystyle \wp (X)}
is also called the degenerate filter on
X
{\displaystyle X}
(despite not actually being a filter). It is the only dual ideal on
X
{\displaystyle X}
that is not a filter on
X
.
{\displaystyle X.}
If
(
X
,
τ
)
{\displaystyle (X,\tau )}
is a topological space and
x
∈
X
,
{\displaystyle x\in X,}
then the neighborhood filter
N
(
x
)
{\displaystyle {\mathcal {N}}(x)}
at
x
{\displaystyle x}
is a filter on
X
.
{\displaystyle X.}
By definition, a family
B
⊆
℘
(
X
)
{\displaystyle {\mathcal {B}}\subseteq \wp (X)}
is called a neighborhood basis (resp. a neighborhood subbase) at
x
for
(
X
,
τ
)
{\displaystyle x{\text{ for }}(X,\tau )}
if and only if
B
{\displaystyle {\mathcal {B}}}
is a prefilter (resp.
B
{\displaystyle {\mathcal {B}}}
is a filter subbase) and the filter on
X
{\displaystyle X}
that
B
{\displaystyle {\mathcal {B}}}
generates is equal to the neighborhood filter
N
(
x
)
.
{\displaystyle {\mathcal {N}}(x).}
The subfamily
τ
(
x
)
⊆
N
(
x
)
{\displaystyle \tau (x)\subseteq {\mathcal {N}}(x)}
of open neighborhoods is a filter base for
N
(
x
)
.
{\displaystyle {\mathcal {N}}(x).}
Both prefilters
N
(
x
)
and
τ
(
x
)
{\displaystyle {\mathcal {N}}(x){\text{ and }}\tau (x)}
also form a bases for topologies on
X
,
{\displaystyle X,}
with the topology generated
τ
(
x
)
{\displaystyle \tau (x)}
being coarser than
τ
.
{\displaystyle \tau .}
This example immediately generalizes from neighborhoods of points to neighborhoods of non–empty subsets
S
⊆
X
.
{\displaystyle S\subseteq X.}
B
{\displaystyle {\mathcal {B}}}
is an elementary prefilter if
B
=
Tails
(
x
∙
)
{\displaystyle {\mathcal {B}}=\operatorname {Tails} \left(x_{\bullet }\right)}
for some sequence
x
∙
=
(
x
i
)
i
=
1
∞
in
X
.
{\displaystyle x_{\bullet }=\left(x_{i}\right)_{i=1}^{\infty }{\text{ in }}X.}
B
{\displaystyle {\mathcal {B}}}
is an elementary filter or a sequential filter on
X
{\displaystyle X}
if
B
{\displaystyle {\mathcal {B}}}
is a filter on
X
{\displaystyle X}
generated by some elementary prefilter. The filter of tails generated by a sequence that is not eventually constant is necessarily not an ultrafilter. Every principal filter on a countable set is sequential as is every cofinite filter on a countably infinite set. The intersection of finitely many sequential filters is again sequential.
The set
F
{\displaystyle {\mathcal {F}}}
of all cofinite subsets of
X
{\displaystyle X}
(meaning those sets whose complement in
X
{\displaystyle X}
is finite) is proper if and only if
F
{\displaystyle {\mathcal {F}}}
is infinite (or equivalently,
X
{\displaystyle X}
is infinite), in which case
F
{\displaystyle {\mathcal {F}}}
is a filter on
X
{\displaystyle X}
known as the Fréchet filter or the cofinite filter on
X
.
{\displaystyle X.}
If
X
{\displaystyle X}
is finite then
F
{\displaystyle {\mathcal {F}}}
is equal to the dual ideal
℘
(
X
)
,
{\displaystyle \wp (X),}
which is not a filter. If
X
{\displaystyle X}
is infinite then the family
{
X
∖
{
x
}
:
x
∈
X
}
{\displaystyle \{X\setminus \{x\}~:~x\in X\}}
of complements of singleton sets is a filter subbase that generates the Fréchet filter on
X
.
{\displaystyle X.}
As with any family of sets over
X
{\displaystyle X}
that contains
{
X
∖
{
x
}
:
x
∈
X
}
,
{\displaystyle \{X\setminus \{x\}~:~x\in X\},}
the kernel of the Fréchet filter on
X
{\displaystyle X}
is the empty set:
ker
F
=
∅
.
{\displaystyle \ker {\mathcal {F}}=\varnothing .}
The intersection of all elements in any non–empty family
F
⊆
Filters
(
X
)
{\displaystyle \mathbb {F} \subseteq \operatorname {Filters} (X)}
is itself a filter on
X
{\displaystyle X}
called the infimum or greatest lower bound of
F
in
Filters
(
X
)
,
{\displaystyle \mathbb {F} {\text{ in }}\operatorname {Filters} (X),}
which is why it may be denoted by
⋀
F
∈
F
F
.
{\displaystyle \bigwedge _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}.}
Said differently,
ker
F
=
⋂
F
∈
F
F
∈
Filters
(
X
)
.
{\displaystyle \ker \mathbb {F} =\bigcap _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}\in \operatorname {Filters} (X).}
Because every filter on
X
{\displaystyle X}
has
{
X
}
{\displaystyle \{X\}}
as a subset, this intersection is never empty. By definition, the infimum is the finest/largest (relative to
⊆
and
≤
{\displaystyle \,\subseteq \,{\text{ and }}\,\leq \,}
) filter contained as a subset of each member of
F
.
{\displaystyle \mathbb {F} .}
If
B
and
F
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}}}
are filters then their infimum in
Filters
(
X
)
{\displaystyle \operatorname {Filters} (X)}
is the filter
B
(
∪
)
F
.
{\displaystyle {\mathcal {B}}\,(\cup )\,{\mathcal {F}}.}
If
B
and
F
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}}}
are prefilters then
B
(
∪
)
F
{\displaystyle {\mathcal {B}}\,(\cup )\,{\mathcal {F}}}
is a prefilter that is coarser (with respect to
≤
{\displaystyle \,\leq }
) than both
B
and
F
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}}}
(that is,
B
(
∪
)
F
≤
B
and
B
(
∪
)
F
≤
F
{\displaystyle {\mathcal {B}}\,(\cup )\,{\mathcal {F}}\leq {\mathcal {B}}{\text{ and }}{\mathcal {B}}\,(\cup )\,{\mathcal {F}}\leq {\mathcal {F}}}
); indeed, it is one of the finest such prefilters, meaning that if
S
{\displaystyle {\mathcal {S}}}
is a prefilter such that
S
≤
B
and
S
≤
F
{\displaystyle {\mathcal {S}}\leq {\mathcal {B}}{\text{ and }}{\mathcal {S}}\leq {\mathcal {F}}}
then necessarily
S
≤
B
(
∪
)
F
.
{\displaystyle {\mathcal {S}}\leq {\mathcal {B}}\,(\cup )\,{\mathcal {F}}.}
More generally, if
B
and
F
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}}}
are non−empty families and if
S
:=
{
S
⊆
℘
(
X
)
:
S
≤
B
and
S
≤
F
}
{\displaystyle \mathbb {S} :=\{{\mathcal {S}}\subseteq \wp (X)~:~{\mathcal {S}}\leq {\mathcal {B}}{\text{ and }}{\mathcal {S}}\leq {\mathcal {F}}\}}
then
B
(
∪
)
F
∈
S
{\displaystyle {\mathcal {B}}\,(\cup )\,{\mathcal {F}}\in \mathbb {S} }
and
B
(
∪
)
F
{\displaystyle {\mathcal {B}}\,(\cup )\,{\mathcal {F}}}
is a greatest element (with respect to
≤
{\displaystyle \leq }
) of
S
.
{\displaystyle \mathbb {S} .}
Let
∅
≠
F
⊆
DualIdeals
(
X
)
{\displaystyle \varnothing \neq \mathbb {F} \subseteq \operatorname {DualIdeals} (X)}
and let
∪
F
=
⋃
F
∈
F
F
.
{\displaystyle \cup \mathbb {F} =\bigcup _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}.}
The supremum or least upper bound of
F
in
DualIdeals
(
X
)
,
{\displaystyle \mathbb {F} {\text{ in }}\operatorname {DualIdeals} (X),}
denoted by
⋁
F
∈
F
F
,
{\displaystyle \bigvee _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}},}
is the smallest (relative to
⊆
{\displaystyle \subseteq }
) dual ideal on
X
{\displaystyle X}
containing every element of
F
{\displaystyle \mathbb {F} }
as a subset; that is, it is the smallest (relative to
⊆
{\displaystyle \subseteq }
) dual ideal on
X
{\displaystyle X}
containing
∪
F
{\displaystyle \cup \mathbb {F} }
as a subset.
This dual ideal is
⋁
F
∈
F
F
=
π
(
∪
F
)
↑
X
,
{\displaystyle \bigvee _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}=\pi \left(\cup \mathbb {F} \right)^{\uparrow X},}
where
π
(
∪
F
)
:=
{
F
1
∩
⋯
∩
F
n
:
n
∈
N
and every
F
i
belongs to some
F
∈
F
}
{\displaystyle \pi \left(\cup \mathbb {F} \right):=\left\{F_{1}\cap \cdots \cap F_{n}~:~n\in \mathbb {N} {\text{ and every }}F_{i}{\text{ belongs to some }}{\mathcal {F}}\in \mathbb {F} \right\}}
is the π–system generated by
∪
F
.
{\displaystyle \cup \mathbb {F} .}
As with any non–empty family of sets,
∪
F
{\displaystyle \cup \mathbb {F} }
is contained in some filter on
X
{\displaystyle X}
if and only if it is a filter subbase, or equivalently, if and only if
⋁
F
∈
F
F
=
π
(
∪
F
)
↑
X
{\displaystyle \bigvee _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}=\pi \left(\cup \mathbb {F} \right)^{\uparrow X}}
is a filter on
X
,
{\displaystyle X,}
in which case this family is the smallest (relative to
⊆
{\displaystyle \subseteq }
) filter on
X
{\displaystyle X}
containing every element of
F
{\displaystyle \mathbb {F} }
as a subset and necessarily
F
⊆
Filters
(
X
)
.
{\displaystyle \mathbb {F} \subseteq \operatorname {Filters} (X).}
Let
∅
≠
F
⊆
Filters
(
X
)
{\displaystyle \varnothing \neq \mathbb {F} \subseteq \operatorname {Filters} (X)}
and let
∪
F
=
⋃
F
∈
F
F
.
{\displaystyle \cup \mathbb {F} =\bigcup _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}.}
The supremum or least upper bound of
F
in
Filters
(
X
)
,
{\displaystyle \mathbb {F} {\text{ in }}\operatorname {Filters} (X),}
denoted by
⋁
F
∈
F
F
{\displaystyle \bigvee _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}}
if it exists, is by definition the smallest (relative to
⊆
{\displaystyle \subseteq }
) filter on
X
{\displaystyle X}
containing every element of
F
{\displaystyle \mathbb {F} }
as a subset.
If it exists then necessarily
⋁
F
∈
F
F
=
π
(
∪
F
)
↑
X
{\displaystyle \bigvee _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}=\pi \left(\cup \mathbb {F} \right)^{\uparrow X}}
(as defined above) and
⋁
F
∈
F
F
{\displaystyle \bigvee _{{\mathcal {F}}\in \mathbb {F} }{\mathcal {F}}}
will also be equal to the intersection of all filters on
X
{\displaystyle X}
containing
∪
F
.
{\displaystyle \cup \mathbb {F} .}
This supremum of
F
in
Filters
(
X
)
{\displaystyle \mathbb {F} {\text{ in }}\operatorname {Filters} (X)}
exists if and only if the dual ideal
π
(
∪
F
)
↑
X
{\displaystyle \pi \left(\cup \mathbb {F} \right)^{\uparrow X}}
is a filter on
X
.
{\displaystyle X.}
The least upper bound of a family of filters
F
{\displaystyle \mathbb {F} }
may fail to be a filter. Indeed, if
X
{\displaystyle X}
contains at least 2 distinct elements then there exist filters
B
and
C
on
X
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}{\text{ on }}X}
for which there does not exist a filter
F
on
X
{\displaystyle {\mathcal {F}}{\text{ on }}X}
that contains both
B
and
C
.
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}.}
If
∪
F
{\displaystyle \cup \mathbb {F} }
is not a filter subbase then the supremum of
F
in
Filters
(
X
)
{\displaystyle \mathbb {F} {\text{ in }}\operatorname {Filters} (X)}
does not exist and the same is true of its supremum in
Prefilters
(
X
)
{\displaystyle \operatorname {Prefilters} (X)}
but their supremum in the set of all dual ideals on
X
{\displaystyle X}
will exist (it being the degenerate filter
℘
(
X
)
{\displaystyle \wp (X)}
).
If
B
and
F
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}}}
are prefilters (resp. filters on
X
{\displaystyle X}
) then
B
(
∩
)
F
{\displaystyle {\mathcal {B}}\,(\cap )\,{\mathcal {F}}}
is a prefilter (resp. a filter) if and only if it is non–degenerate (or said differently, if and only if
B
and
F
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}}}
mesh), in which case it is one of the coarsest prefilters (resp. the coarsest filter) on
X
{\displaystyle X}
(with respect to
≤
{\displaystyle \,\leq }
) that is finer (with respect to
≤
{\displaystyle \,\leq }
) than both
B
and
F
;
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}};}
this means that if
S
{\displaystyle {\mathcal {S}}}
is any prefilter (resp. any filter) such that
B
≤
S
and
F
≤
S
{\displaystyle {\mathcal {B}}\leq {\mathcal {S}}{\text{ and }}{\mathcal {F}}\leq {\mathcal {S}}}
then necessarily
B
(
∩
)
F
≤
S
,
{\displaystyle {\mathcal {B}}\,(\cap )\,{\mathcal {F}}\leq {\mathcal {S}},}
in which case it is denoted by
B
∨
F
.
{\displaystyle {\mathcal {B}}\vee {\mathcal {F}}.}
Let
I
and
X
{\displaystyle I{\text{ and }}X}
be non−empty sets and for every
i
∈
I
{\displaystyle i\in I}
let
D
i
{\displaystyle {\mathcal {D}}_{i}}
be a dual ideal on
X
.
{\displaystyle X.}
If
I
{\displaystyle {\mathcal {I}}}
is any dual ideal on
I
{\displaystyle I}
then
⋃
Ξ
∈
I
⋂
i
∈
Ξ
D
i
{\displaystyle \bigcup _{\Xi \in {\mathcal {I}}}\;\;\bigcap _{i\in \Xi }\;{\mathcal {D}}_{i}}
is a dual ideal on
X
{\displaystyle X}
called Kowalsky's dual ideal or Kowalsky's filter.
The club filter of a regular uncountable cardinal is the filter of all sets containing a club subset of
κ
.
{\displaystyle \kappa .}
It is a
κ
{\displaystyle \kappa }
-complete filter closed under diagonal intersection.
Other examples
Let
X
=
{
p
,
1
,
2
,
3
}
{\displaystyle X=\{p,1,2,3\}}
and let
B
=
{
{
p
}
,
{
p
,
1
,
2
}
,
{
p
,
1
,
3
}
}
,
{\displaystyle {\mathcal {B}}=\{\{p\},\{p,1,2\},\{p,1,3\}\},}
which makes
B
{\displaystyle {\mathcal {B}}}
a prefilter and a filter subbase that is not closed under finite intersections. Because
B
{\displaystyle {\mathcal {B}}}
is a prefilter, the smallest prefilter containing
B
{\displaystyle {\mathcal {B}}}
is
B
.
{\displaystyle {\mathcal {B}}.}
The π–system generated by
B
{\displaystyle {\mathcal {B}}}
is
{
{
p
,
1
}
}
∪
B
.
{\displaystyle \{\{p,1\}\}\cup {\mathcal {B}}.}
In particular, the smallest prefilter containing the filter subbase
B
{\displaystyle {\mathcal {B}}}
is not equal to the set of all finite intersections of sets in
B
.
{\displaystyle {\mathcal {B}}.}
The filter on
X
{\displaystyle X}
generated by
B
{\displaystyle {\mathcal {B}}}
is
B
↑
X
=
{
S
⊆
X
:
p
∈
S
}
=
{
{
p
}
∪
T
:
T
⊆
{
1
,
2
,
3
}
}
.
{\displaystyle {\mathcal {B}}^{\uparrow X}=\{S\subseteq X:p\in S\}=\{\{p\}\cup T~:~T\subseteq \{1,2,3\}\}.}
All three of
B
,
{\displaystyle {\mathcal {B}},}
the π–system
B
{\displaystyle {\mathcal {B}}}
generates, and
B
↑
X
{\displaystyle {\mathcal {B}}^{\uparrow X}}
are examples of fixed, principal, ultra prefilters that are principal at the point
p
;
B
↑
X
{\displaystyle p;{\mathcal {B}}^{\uparrow X}}
is also an ultrafilter on
X
.
{\displaystyle X.}
Let
(
X
,
τ
)
{\displaystyle (X,\tau )}
be a topological space,
B
⊆
℘
(
X
)
,
{\displaystyle {\mathcal {B}}\subseteq \wp (X),}
and define
B
¯
:=
{
cl
X
B
:
B
∈
B
}
,
{\displaystyle {\overline {\mathcal {B}}}:=\left\{\operatorname {cl} _{X}B~:~B\in {\mathcal {B}}\right\},}
where
B
{\displaystyle {\mathcal {B}}}
is necessarily finer than
B
¯
.
{\displaystyle {\overline {\mathcal {B}}}.}
If
B
{\displaystyle {\mathcal {B}}}
is non–empty (resp. non–degenerate, a filter subbase, a prefilter, closed under finite unions) then the same is true of
B
¯
.
{\displaystyle {\overline {\mathcal {B}}}.}
If
B
{\displaystyle {\mathcal {B}}}
is a filter on
X
{\displaystyle X}
then
B
¯
{\displaystyle {\overline {\mathcal {B}}}}
is a prefilter but not necessarily a filter on
X
{\displaystyle X}
although
(
B
¯
)
↑
X
{\displaystyle \left({\overline {\mathcal {B}}}\right)^{\uparrow X}}
is a filter on
X
{\displaystyle X}
equivalent to
B
¯
.
{\displaystyle {\overline {\mathcal {B}}}.}
The set
B
{\displaystyle {\mathcal {B}}}
of all dense open subsets of a (non–empty) topological space
X
{\displaystyle X}
is a proper π–system and so also a prefilter. If the space is a Baire space, then the set of all countable intersections of dense open subsets is a π–system and a prefilter that is finer than
B
.
{\displaystyle {\mathcal {B}}.}
If
X
=
R
n
{\displaystyle X=\mathbb {R} ^{n}}
(with
1
≤
n
∈
N
{\displaystyle 1\leq n\in \mathbb {N} }
) then the set
B
LebFinite
{\displaystyle {\mathcal {B}}_{\operatorname {LebFinite} }}
of all
B
∈
B
{\displaystyle B\in {\mathcal {B}}}
such that
B
{\displaystyle B}
has finite Lebesgue measure is a proper π–system and free prefilter that is also a proper subset of
B
.
{\displaystyle {\mathcal {B}}.}
The prefilters
B
LebFinite
{\displaystyle {\mathcal {B}}_{\operatorname {LebFinite} }}
and
B
{\displaystyle {\mathcal {B}}}
are equivalent and so generate the same filter on
X
.
{\displaystyle X.}
The prefilter
B
LebFinite
{\displaystyle {\mathcal {B}}_{\operatorname {LebFinite} }}
is properly contained in, and not equivalent to, the prefilter consisting of all dense subsets of
R
.
{\displaystyle \mathbb {R} .}
Since
X
{\displaystyle X}
is a Baire space, every countable intersection of sets in
B
LebFinite
{\displaystyle {\mathcal {B}}_{\operatorname {LebFinite} }}
is dense in
X
{\displaystyle X}
(and also comeagre and non–meager) so the set of all countable intersections of elements of
B
LebFinite
{\displaystyle {\mathcal {B}}_{\operatorname {LebFinite} }}
is a prefilter and π–system; it is also finer than, and not equivalent to,
B
LebFinite
.
{\displaystyle {\mathcal {B}}_{\operatorname {LebFinite} }.}
A filter subbase with no
⊆
−
{\displaystyle \,\subseteq -}
smallest prefilter containing it: In general, if a filter subbase
S
{\displaystyle {\mathcal {S}}}
is not a π–system then an intersection
S
1
∩
⋯
∩
S
n
{\displaystyle S_{1}\cap \cdots \cap S_{n}}
of
n
{\displaystyle n}
sets from
S
{\displaystyle {\mathcal {S}}}
will usually require a description involving
n
{\displaystyle n}
variables that cannot be reduced down to only two (consider, for instance
π
(
S
)
{\displaystyle \pi ({\mathcal {S}})}
when
S
=
{
(
−
∞
,
r
)
∪
(
r
,
∞
)
:
r
∈
R
}
{\displaystyle {\mathcal {S}}=\{(-\infty ,r)\cup (r,\infty )~:~r\in \mathbb {R} \}}
). This example illustrates an atypical class of a filter subbases
S
R
{\displaystyle {\mathcal {S}}_{R}}
where all sets in both
S
R
{\displaystyle {\mathcal {S}}_{R}}
and its generated π–system can be described as sets of the form
B
r
,
s
,
{\displaystyle B_{r,s},}
so that in particular, no more than two variables (specifically,
r
and
s
{\displaystyle r{\text{ and }}s}
) are needed to describe the generated π–system.
For all
r
,
s
∈
R
,
{\displaystyle r,s\in \mathbb {R} ,}
let
B
r
,
s
=
(
r
,
0
)
∪
(
s
,
∞
)
,
{\displaystyle B_{r,s}=(r,0)\cup (s,\infty ),}
where
B
r
,
s
=
B
min
(
r
,
s
)
,
s
{\displaystyle B_{r,s}=B_{\min(r,s),s}}
always holds so no generality is lost by adding the assumption
r
≤
s
.
{\displaystyle r\leq s.}
For all real
r
≤
s
and
u
≤
v
,
{\displaystyle r\leq s{\text{ and }}u\leq v,}
if
s
or
v
{\displaystyle s{\text{ or }}v}
is non-negative then
B
−
r
,
s
∩
B
−
u
,
v
=
B
−
min
(
r
,
u
)
,
max
(
s
,
v
)
.
{\displaystyle B_{-r,s}\cap B_{-u,v}=B_{-\min(r,u),\max(s,v)}.}
For every set
R
{\displaystyle R}
of positive reals, let
S
R
:=
{
B
−
r
,
r
:
r
∈
R
}
=
{
(
−
r
,
0
)
∪
(
r
,
∞
)
:
r
∈
R
}
and
B
R
:=
{
B
−
r
,
s
:
r
≤
s
with
r
,
s
∈
R
}
=
{
(
−
r
,
0
)
∪
(
s
,
∞
)
:
r
≤
s
in
R
}
.
{\displaystyle {\mathcal {S}}_{R}:=\left\{B_{-r,r}:r\in R\right\}=\{(-r,0)\cup (r,\infty ):r\in R\}\quad {\text{ and }}\quad {\mathcal {B}}_{R}:=\left\{B_{-r,s}:r\leq s{\text{ with }}r,s\in R\right\}=\{(-r,0)\cup (s,\infty ):r\leq s{\text{ in }}R\}.}
Let
X
=
R
{\displaystyle X=\mathbb {R} }
and suppose
∅
≠
R
⊆
(
0
,
∞
)
{\displaystyle \varnothing \neq R\subseteq (0,\infty )}
is not a singleton set. Then
S
R
{\displaystyle {\mathcal {S}}_{R}}
is a filter subbase but not a prefilter and
B
R
=
π
(
S
R
)
{\displaystyle {\mathcal {B}}_{R}=\pi \left({\mathcal {S}}_{R}\right)}
is the π–system it generates, so that
B
R
↑
X
{\displaystyle {\mathcal {B}}_{R}^{\uparrow X}}
is the unique smallest filter in
X
=
R
{\displaystyle X=\mathbb {R} }
containing
S
R
.
{\displaystyle {\mathcal {S}}_{R}.}
However,
S
R
↑
X
{\displaystyle {\mathcal {S}}_{R}^{\uparrow X}}
is not a filter on
X
{\displaystyle X}
(nor is it a prefilter because it is not directed downward, although it is a filter subbase) and
S
R
↑
X
{\displaystyle {\mathcal {S}}_{R}^{\uparrow X}}
is a proper subset of the filter
B
R
↑
X
.
{\displaystyle {\mathcal {B}}_{R}^{\uparrow X}.}
If
R
,
S
⊆
(
0
,
∞
)
{\displaystyle R,S\subseteq (0,\infty )}
are non−empty intervals then the filter subbases
S
R
and
S
S
{\displaystyle {\mathcal {S}}_{R}{\text{ and }}{\mathcal {S}}_{S}}
generate the same filter on
X
{\displaystyle X}
if and only if
R
=
S
.
{\displaystyle R=S.}
If
C
{\displaystyle {\mathcal {C}}}
is a prefilter satisfying
S
(
0
,
∞
)
⊆
C
⊆
B
(
0
,
∞
)
{\displaystyle {\mathcal {S}}_{(0,\infty )}\subseteq {\mathcal {C}}\subseteq {\mathcal {B}}_{(0,\infty )}}
then for any
C
∈
C
∖
S
(
0
,
∞
)
,
{\displaystyle C\in {\mathcal {C}}\setminus {\mathcal {S}}_{(0,\infty )},}
the family
C
∖
{
C
}
{\displaystyle {\mathcal {C}}\setminus \{C\}}
is also a prefilter satisfying
S
(
0
,
∞
)
⊆
C
∖
{
C
}
⊆
B
(
0
,
∞
)
.
{\displaystyle {\mathcal {S}}_{(0,\infty )}\subseteq {\mathcal {C}}\setminus \{C\}\subseteq {\mathcal {B}}_{(0,\infty )}.}
This shows that there cannot exist a minimal/least (with respect to
⊆
{\displaystyle \subseteq }
) prefilter that both contains
S
(
0
,
∞
)
{\displaystyle {\mathcal {S}}_{(0,\infty )}}
and is a subset of the π–system generated by
S
(
0
,
∞
)
.
{\displaystyle {\mathcal {S}}_{(0,\infty )}.}
This remains true even if the requirement that the prefilter be a subset of
B
(
0
,
∞
)
=
π
(
S
(
0
,
∞
)
)
{\displaystyle {\mathcal {B}}_{(0,\infty )}=\pi \left({\mathcal {S}}_{(0,\infty )}\right)}
is removed; that is, (in sharp contrast to filters) there does not exist a minimal/least (with respect to
⊆
{\displaystyle \subseteq }
) prefilter containing the filter subbase
S
(
0
,
∞
)
.
{\displaystyle {\mathcal {S}}_{(0,\infty )}.}
= Ultrafilters
=There are many other characterizations of "ultrafilter" and "ultra prefilter," which are listed in the article on ultrafilters. Important properties of ultrafilters are also described in that article.
Ultrafilters
(
X
)
=
Filters
(
X
)
∩
UltraPrefilters
(
X
)
⊆
UltraPrefilters
(
X
)
=
UltraFilterSubbases
(
X
)
⊆
Prefilters
(
X
)
{\displaystyle {\begin{alignedat}{8}{\textrm {Ultrafilters}}(X)\;&=\;{\textrm {Filters}}(X)\,\cap \,{\textrm {UltraPrefilters}}(X)\\&\subseteq \;{\textrm {UltraPrefilters}}(X)={\textrm {UltraFilterSubbases}}(X)\\&\subseteq \;{\textrm {Prefilters}}(X)\\\end{alignedat}}}
Any non–degenerate family that has a singleton set as an element is ultra, in which case it will then be an ultra prefilter if and only if it also has the finite intersection property.
The trivial filter
{
X
}
on
X
{\displaystyle \{X\}{\text{ on }}X}
is ultra if and only if
X
{\displaystyle X}
is a singleton set.
The ultrafilter lemma
The following important theorem is due to Alfred Tarski (1930).
A consequence of the ultrafilter lemma is that every filter is equal to the intersection of all ultrafilters containing it.
Assuming the axioms of Zermelo–Fraenkel (ZF), the ultrafilter lemma follows from the Axiom of choice (in particular from Zorn's lemma) but is strictly weaker than it. The ultrafilter lemma implies the Axiom of choice for finite sets. If only dealing with Hausdorff spaces, then most basic results (as encountered in introductory courses) in Topology (such as Tychonoff's theorem for compact Hausdorff spaces and the Alexander subbase theorem) and in functional analysis (such as the Hahn–Banach theorem) can be proven using only the ultrafilter lemma; the full strength of the axiom of choice might not be needed.
= Kernels
=The kernel is useful in classifying properties of prefilters and other families of sets.
If
B
⊆
℘
(
X
)
{\displaystyle {\mathcal {B}}\subseteq \wp (X)}
then for any point
x
,
x
∉
ker
B
if and only if
X
∖
{
x
}
∈
B
↑
X
.
{\displaystyle x,x\not \in \ker {\mathcal {B}}{\text{ if and only if }}X\setminus \{x\}\in {\mathcal {B}}^{\uparrow X}.}
Properties of kernels
If
B
⊆
℘
(
X
)
{\displaystyle {\mathcal {B}}\subseteq \wp (X)}
then
ker
(
B
↑
X
)
=
ker
B
{\displaystyle \ker \left({\mathcal {B}}^{\uparrow X}\right)=\ker {\mathcal {B}}}
and this set is also equal to the kernel of the π–system that is generated by
B
.
{\displaystyle {\mathcal {B}}.}
In particular, if
B
{\displaystyle {\mathcal {B}}}
is a filter subbase then the kernels of all of the following sets are equal:
(1)
B
,
{\displaystyle {\mathcal {B}},}
(2) the π–system generated by
B
,
{\displaystyle {\mathcal {B}},}
and (3) the filter generated by
B
.
{\displaystyle {\mathcal {B}}.}
If
f
{\displaystyle f}
is a map then
f
(
ker
B
)
⊆
ker
f
(
B
)
{\displaystyle f(\ker {\mathcal {B}})\subseteq \ker f({\mathcal {B}})}
and
f
−
1
(
ker
B
)
=
ker
f
−
1
(
B
)
.
{\displaystyle f^{-1}(\ker {\mathcal {B}})=\ker f^{-1}({\mathcal {B}}).}
If
B
≤
C
{\displaystyle {\mathcal {B}}\leq {\mathcal {C}}}
then
ker
C
⊆
ker
B
{\displaystyle \ker {\mathcal {C}}\subseteq \ker {\mathcal {B}}}
while if
B
{\displaystyle {\mathcal {B}}}
and
C
{\displaystyle {\mathcal {C}}}
are equivalent then
ker
B
=
ker
C
.
{\displaystyle \ker {\mathcal {B}}=\ker {\mathcal {C}}.}
Equivalent families have equal kernels. Two principal families are equivalent if and only if their kernels are equal; that is, if
B
{\displaystyle {\mathcal {B}}}
and
C
{\displaystyle {\mathcal {C}}}
are principal then they are equivalent if and only if
ker
B
=
ker
C
.
{\displaystyle \ker {\mathcal {B}}=\ker {\mathcal {C}}.}
Classifying families by their kernels
If
B
{\displaystyle {\mathcal {B}}}
is a principal filter on
X
{\displaystyle X}
then
∅
≠
ker
B
∈
B
{\displaystyle \varnothing \neq \ker {\mathcal {B}}\in {\mathcal {B}}}
and
B
=
{
ker
B
}
↑
X
=
{
S
∪
ker
B
:
S
⊆
X
∖
ker
B
}
=
℘
(
X
∖
ker
B
)
(
∪
)
{
ker
B
}
{\displaystyle {\mathcal {B}}=\{\ker {\mathcal {B}}\}^{\uparrow X}=\{S\cup \ker {\mathcal {B}}:S\subseteq X\setminus \ker {\mathcal {B}}\}=\wp (X\setminus \ker {\mathcal {B}})\,(\cup )\,\{\ker {\mathcal {B}}\}}
where
{
ker
B
}
{\displaystyle \{\ker {\mathcal {B}}\}}
is also the smallest prefilter that generates
B
.
{\displaystyle {\mathcal {B}}.}
Family of examples: For any non–empty
C
⊆
R
,
{\displaystyle C\subseteq \mathbb {R} ,}
the family
B
C
=
{
R
∖
(
r
+
C
)
:
r
∈
R
}
{\displaystyle {\mathcal {B}}_{C}=\{\mathbb {R} \setminus (r+C)~:~r\in \mathbb {R} \}}
is free but it is a filter subbase if and only if no finite union of the form
(
r
1
+
C
)
∪
⋯
∪
(
r
n
+
C
)
{\displaystyle \left(r_{1}+C\right)\cup \cdots \cup \left(r_{n}+C\right)}
covers
R
,
{\displaystyle \mathbb {R} ,}
in which case the filter that it generates will also be free. In particular,
B
C
{\displaystyle {\mathcal {B}}_{C}}
is a filter subbase if
C
{\displaystyle C}
is countable (for example,
C
=
Q
,
Z
,
{\displaystyle C=\mathbb {Q} ,\mathbb {Z} ,}
the primes), a meager set in
R
,
{\displaystyle \mathbb {R} ,}
a set of finite measure, or a bounded subset of
R
.
{\displaystyle \mathbb {R} .}
If
C
{\displaystyle C}
is a singleton set then
B
C
{\displaystyle {\mathcal {B}}_{C}}
is a subbase for the Fréchet filter on
R
.
{\displaystyle \mathbb {R} .}
For every filter
F
on
X
{\displaystyle {\mathcal {F}}{\text{ on }}X}
there exists a unique pair of dual ideals
F
∗
and
F
∙
on
X
{\displaystyle {\mathcal {F}}^{*}{\text{ and }}{\mathcal {F}}^{\bullet }{\text{ on }}X}
such that
F
∗
{\displaystyle {\mathcal {F}}^{*}}
is free,
F
∙
{\displaystyle {\mathcal {F}}^{\bullet }}
is principal, and
F
∗
∧
F
∙
=
F
,
{\displaystyle {\mathcal {F}}^{*}\wedge {\mathcal {F}}^{\bullet }={\mathcal {F}},}
and
F
∗
and
F
∙
{\displaystyle {\mathcal {F}}^{*}{\text{ and }}{\mathcal {F}}^{\bullet }}
do not mesh (that is,
F
∗
∨
F
∙
=
℘
(
X
)
{\displaystyle {\mathcal {F}}^{*}\vee {\mathcal {F}}^{\bullet }=\wp (X)}
). The dual ideal
F
∗
{\displaystyle {\mathcal {F}}^{*}}
is called the free part of
F
{\displaystyle {\mathcal {F}}}
while
F
∙
{\displaystyle {\mathcal {F}}^{\bullet }}
is called the principal part where at least one of these dual ideals is filter. If
F
{\displaystyle {\mathcal {F}}}
is principal then
F
∙
:=
F
and
F
∗
:=
℘
(
X
)
;
{\displaystyle {\mathcal {F}}^{\bullet }:={\mathcal {F}}{\text{ and }}{\mathcal {F}}^{*}:=\wp (X);}
otherwise,
F
∙
:=
{
ker
F
}
↑
X
{\displaystyle {\mathcal {F}}^{\bullet }:=\{\ker {\mathcal {F}}\}^{\uparrow X}}
and
F
∗
:=
F
∨
{
X
∖
(
ker
F
)
}
↑
X
{\displaystyle {\mathcal {F}}^{*}:={\mathcal {F}}\vee \{X\setminus \left(\ker {\mathcal {F}}\right)\}^{\uparrow X}}
is a free (non–degenerate) filter.
Finite prefilters and finite sets
If a filter subbase
B
{\displaystyle {\mathcal {B}}}
is finite then it is fixed (that is, not free);
this is because
ker
B
=
⋂
B
∈
B
B
{\displaystyle \ker {\mathcal {B}}=\bigcap _{B\in {\mathcal {B}}}B}
is a finite intersection and the filter subbase
B
{\displaystyle {\mathcal {B}}}
has the finite intersection property.
A finite prefilter is necessarily principal, although it does not have to be closed under finite intersections.
If
X
{\displaystyle X}
is finite then all of the conclusions above hold for any
B
⊆
℘
(
X
)
.
{\displaystyle {\mathcal {B}}\subseteq \wp (X).}
In particular, on a finite set
X
,
{\displaystyle X,}
there are no free filter subbases (and so no free prefilters), all prefilters are principal, and all filters on
X
{\displaystyle X}
are principal filters generated by their (non–empty) kernels.
The trivial filter
{
X
}
{\displaystyle \{X\}}
is always a finite filter on
X
{\displaystyle X}
and if
X
{\displaystyle X}
is infinite then it is the only finite filter because a non–trivial finite filter on a set
X
{\displaystyle X}
is possible if and only if
X
{\displaystyle X}
is finite.
However, on any infinite set there are non–trivial filter subbases and prefilters that are finite (although they cannot be filters).
If
X
{\displaystyle X}
is a singleton set then the trivial filter
{
X
}
{\displaystyle \{X\}}
is the only proper subset of
℘
(
X
)
{\displaystyle \wp (X)}
and moreover, this set
{
X
}
{\displaystyle \{X\}}
is a principal ultra prefilter and any superset
F
⊇
B
{\displaystyle {\mathcal {F}}\supseteq {\mathcal {B}}}
(where
F
⊆
℘
(
Y
)
and
X
⊆
Y
{\displaystyle {\mathcal {F}}\subseteq \wp (Y){\text{ and }}X\subseteq Y}
) with the finite intersection property will also be a principal ultra prefilter (even if
Y
{\displaystyle Y}
is infinite).
Characterizing fixed ultra prefilters
If a family of sets
B
{\displaystyle {\mathcal {B}}}
is fixed (that is,
ker
B
≠
∅
{\displaystyle \ker {\mathcal {B}}\neq \varnothing }
) then
B
{\displaystyle {\mathcal {B}}}
is ultra if and only if some element of
B
{\displaystyle {\mathcal {B}}}
is a singleton set, in which case
B
{\displaystyle {\mathcal {B}}}
will necessarily be a prefilter. Every principal prefilter is fixed, so a principal prefilter
B
{\displaystyle {\mathcal {B}}}
is ultra if and only if
ker
B
{\displaystyle \ker {\mathcal {B}}}
is a singleton set.
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.
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.
= Finer/coarser, subordination, and meshing
=The preorder
≤
{\displaystyle \,\leq \,}
that is defined below is of fundamental importance for the use of prefilters (and filters) in topology. For instance, this preorder is used to define the prefilter equivalent of "subsequence", where "
F
≥
C
{\displaystyle {\mathcal {F}}\geq {\mathcal {C}}}
" can be interpreted as "
F
{\displaystyle {\mathcal {F}}}
is a subsequence of
C
{\displaystyle {\mathcal {C}}}
" (so "subordinate to" is the prefilter equivalent of "subsequence of"). It is also used to define prefilter convergence in a topological space.
The definition of
B
{\displaystyle {\mathcal {B}}}
meshes with
C
,
{\displaystyle {\mathcal {C}},}
which is closely related to the preorder
≤
,
{\displaystyle \,\leq ,}
is used in Topology to define cluster points.
Two families of sets
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
mesh and are compatible, indicated by writing
B
#
C
,
{\displaystyle {\mathcal {B}}\#{\mathcal {C}},}
if
B
∩
C
≠
∅
for all
B
∈
B
and
C
∈
C
.
{\displaystyle B\cap C\neq \varnothing {\text{ for all }}B\in {\mathcal {B}}{\text{ and }}C\in {\mathcal {C}}.}
If
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
do not mesh then they are dissociated. If
S
⊆
X
and
B
⊆
℘
(
X
)
{\displaystyle S\subseteq X{\text{ and }}{\mathcal {B}}\subseteq \wp (X)}
then
B
and
S
{\displaystyle {\mathcal {B}}{\text{ and }}S}
are said to mesh if
B
and
{
S
}
{\displaystyle {\mathcal {B}}{\text{ and }}\{S\}}
mesh, or equivalently, if the trace of
B
on
S
,
{\displaystyle {\mathcal {B}}{\text{ on }}S,}
which is the family
B
|
S
=
{
B
∩
S
:
B
∈
B
}
,
{\displaystyle {\mathcal {B}}{\big \vert }_{S}=\{B\cap S~:~B\in {\mathcal {B}}\},}
does not contain the empty set, where the trace is also called the restriction of
B
to
S
.
{\displaystyle {\mathcal {B}}{\text{ to }}S.}
Example: If
x
i
∙
=
(
x
i
n
)
n
=
1
∞
{\displaystyle x_{i_{\bullet }}=\left(x_{i_{n}}\right)_{n=1}^{\infty }}
is a subsequence of
x
∙
=
(
x
i
)
i
=
1
∞
{\displaystyle x_{\bullet }=\left(x_{i}\right)_{i=1}^{\infty }}
then
Tails
(
x
i
∙
)
{\displaystyle \operatorname {Tails} \left(x_{i_{\bullet }}\right)}
is subordinate to
Tails
(
x
∙
)
;
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right);}
in symbols:
Tails
(
x
i
∙
)
⊢
Tails
(
x
∙
)
{\displaystyle \operatorname {Tails} \left(x_{i_{\bullet }}\right)\vdash \operatorname {Tails} \left(x_{\bullet }\right)}
and also
Tails
(
x
∙
)
≤
Tails
(
x
i
∙
)
.
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)\leq \operatorname {Tails} \left(x_{i_{\bullet }}\right).}
Stated in plain English, the prefilter of tails of a subsequence is always subordinate to that of the original sequence.
To see this, let
C
:=
x
≥
i
∈
Tails
(
x
∙
)
{\displaystyle C:=x_{\geq i}\in \operatorname {Tails} \left(x_{\bullet }\right)}
be arbitrary (or equivalently, let
i
∈
N
{\displaystyle i\in \mathbb {N} }
be arbitrary) and it remains to show that this set contains some
F
:=
x
i
≥
n
∈
Tails
(
x
i
∙
)
.
{\displaystyle F:=x_{i_{\geq n}}\in \operatorname {Tails} \left(x_{i_{\bullet }}\right).}
For the set
x
≥
i
=
{
x
i
,
x
i
+
1
,
…
}
{\displaystyle x_{\geq i}=\left\{x_{i},x_{i+1},\ldots \right\}}
to contain
x
i
≥
n
=
{
x
i
n
,
x
i
n
+
1
,
…
}
,
{\displaystyle x_{i_{\geq n}}=\left\{x_{i_{n}},x_{i_{n+1}},\ldots \right\},}
it is sufficient to have
i
≤
i
n
.
{\displaystyle i\leq i_{n}.}
Since
i
1
<
i
2
<
⋯
{\displaystyle i_{1}
are strictly increasing integers, there exists
n
∈
N
{\displaystyle n\in \mathbb {N} }
such that
i
n
≥
i
,
{\displaystyle i_{n}\geq i,}
and so
x
≥
i
⊇
x
i
≥
n
{\displaystyle x_{\geq i}\supseteq x_{i_{\geq n}}}
holds, as desired.
Consequently,
TailsFilter
(
x
∙
)
⊆
TailsFilter
(
x
i
∙
)
.
{\displaystyle \operatorname {TailsFilter} \left(x_{\bullet }\right)\subseteq \operatorname {TailsFilter} \left(x_{i_{\bullet }}\right).}
The left hand side will be a strict/proper subset of the right hand side if (for instance) every point of
x
∙
{\displaystyle x_{\bullet }}
is unique (that is, when
x
∙
:
N
→
X
{\displaystyle x_{\bullet }:\mathbb {N} \to X}
is injective) and
x
i
∙
{\displaystyle x_{i_{\bullet }}}
is the even-indexed subsequence
(
x
2
,
x
4
,
x
6
,
…
)
{\displaystyle \left(x_{2},x_{4},x_{6},\ldots \right)}
because under these conditions, every tail
x
i
≥
n
=
{
x
2
n
,
x
2
n
+
2
,
x
2
n
+
4
,
…
}
{\displaystyle x_{i_{\geq n}}=\left\{x_{2n},x_{2n+2},x_{2n+4},\ldots \right\}}
(for every
n
∈
N
{\displaystyle n\in \mathbb {N} }
) of the subsequence will belong to the right hand side filter but not to the left hand side filter.
For another example, if
B
{\displaystyle {\mathcal {B}}}
is any family then
∅
≤
B
≤
B
≤
{
∅
}
{\displaystyle \varnothing \leq {\mathcal {B}}\leq {\mathcal {B}}\leq \{\varnothing \}}
always holds and furthermore,
{
∅
}
≤
B
if and only if
∅
∈
B
.
{\displaystyle \{\varnothing \}\leq {\mathcal {B}}{\text{ if and only if }}\varnothing \in {\mathcal {B}}.}
Assume that
C
and
F
{\displaystyle {\mathcal {C}}{\text{ and }}{\mathcal {F}}}
are families of sets that satisfy
B
≤
F
and
C
≤
F
.
{\displaystyle {\mathcal {B}}\leq {\mathcal {F}}{\text{ and }}{\mathcal {C}}\leq {\mathcal {F}}.}
Then
ker
F
⊆
ker
C
,
{\displaystyle \ker {\mathcal {F}}\subseteq \ker {\mathcal {C}},}
and
C
≠
∅
implies
F
≠
∅
,
{\displaystyle {\mathcal {C}}\neq \varnothing {\text{ implies }}{\mathcal {F}}\neq \varnothing ,}
and also
∅
∈
C
implies
∅
∈
F
.
{\displaystyle \varnothing \in {\mathcal {C}}{\text{ implies }}\varnothing \in {\mathcal {F}}.}
If in addition to
C
≤
F
,
F
{\displaystyle {\mathcal {C}}\leq {\mathcal {F}},{\mathcal {F}}}
is a filter subbase and
C
≠
∅
,
{\displaystyle {\mathcal {C}}\neq \varnothing ,}
then
C
{\displaystyle {\mathcal {C}}}
is a filter subbase and also
C
and
F
{\displaystyle {\mathcal {C}}{\text{ and }}{\mathcal {F}}}
mesh.
More generally, if both
∅
≠
B
≤
F
and
∅
≠
C
≤
F
{\displaystyle \varnothing \neq {\mathcal {B}}\leq {\mathcal {F}}{\text{ and }}\varnothing \neq {\mathcal {C}}\leq {\mathcal {F}}}
and if the intersection of any two elements of
F
{\displaystyle {\mathcal {F}}}
is non–empty, then
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
mesh.
Every filter subbase is coarser than both the π–system that it generates and the filter that it generates.
If
C
and
F
{\displaystyle {\mathcal {C}}{\text{ and }}{\mathcal {F}}}
are families such that
C
≤
F
,
{\displaystyle {\mathcal {C}}\leq {\mathcal {F}},}
the family
C
{\displaystyle {\mathcal {C}}}
is ultra, and
∅
∉
F
,
{\displaystyle \varnothing \not \in {\mathcal {F}},}
then
F
{\displaystyle {\mathcal {F}}}
is necessarily ultra. It follows that any family that is equivalent to an ultra family will necessarily be ultra. In particular, if
C
{\displaystyle {\mathcal {C}}}
is a prefilter then either both
C
{\displaystyle {\mathcal {C}}}
and the filter
C
↑
X
{\displaystyle {\mathcal {C}}^{\uparrow X}}
it generates are ultra or neither one is ultra.
If a filter subbase is ultra then it is necessarily a prefilter, in which case the filter that it generates will also be ultra. A filter subbase
B
{\displaystyle {\mathcal {B}}}
that is not a prefilter cannot be ultra; but it is nevertheless still possible for the prefilter and filter generated by
B
{\displaystyle {\mathcal {B}}}
to be ultra. If
S
⊆
X
and
B
⊆
℘
(
X
)
{\displaystyle S\subseteq X{\text{ and }}{\mathcal {B}}\subseteq \wp (X)}
is upward closed in
X
{\displaystyle X}
then
S
∉
B
if and only if
(
X
∖
S
)
#
B
.
{\displaystyle S\not \in {\mathcal {B}}{\text{ if and only if }}(X\setminus S)\#{\mathcal {B}}.}
Relational properties of subordination
The relation
≤
{\displaystyle \,\leq \,}
is reflexive and transitive, which makes it into a preorder on
℘
(
℘
(
X
)
)
.
{\displaystyle \wp (\wp (X)).}
The relation
≤
on
Filters
(
X
)
{\displaystyle \,\leq \,{\text{ on }}\operatorname {Filters} (X)}
is antisymmetric but if
X
{\displaystyle X}
has more than one point then it is not symmetric.
Symmetry:
For any
B
⊆
℘
(
X
)
,
B
≤
{
X
}
if and only if
{
X
}
=
B
.
{\displaystyle {\mathcal {B}}\subseteq \wp (X),{\mathcal {B}}\leq \{X\}{\text{ if and only if }}\{X\}={\mathcal {B}}.}
So the set
X
{\displaystyle X}
has more than one point if and only if the relation
≤
on
Filters
(
X
)
{\displaystyle \,\leq \,{\text{ on }}\operatorname {Filters} (X)}
is not symmetric.
Antisymmetry:
If
B
⊆
C
then
B
≤
C
{\displaystyle {\mathcal {B}}\subseteq {\mathcal {C}}{\text{ then }}{\mathcal {B}}\leq {\mathcal {C}}}
but while the converse does not hold in general, it does hold if
C
{\displaystyle {\mathcal {C}}}
is upward closed (such as if
C
{\displaystyle {\mathcal {C}}}
is a filter).
Two filters are equivalent if and only if they are equal, which makes the restriction of
≤
{\displaystyle \,\leq \,}
to
Filters
(
X
)
{\displaystyle \operatorname {Filters} (X)}
antisymmetric.
But in general,
≤
{\displaystyle \,\leq \,}
is not antisymmetric on
Prefilters
(
X
)
{\displaystyle \operatorname {Prefilters} (X)}
nor on
℘
(
℘
(
X
)
)
{\displaystyle \wp (\wp (X))}
; that is,
C
≤
B
and
B
≤
C
{\displaystyle {\mathcal {C}}\leq {\mathcal {B}}{\text{ and }}{\mathcal {B}}\leq {\mathcal {C}}}
does not necessarily imply
B
=
C
{\displaystyle {\mathcal {B}}={\mathcal {C}}}
; not even if both
C
and
B
{\displaystyle {\mathcal {C}}{\text{ and }}{\mathcal {B}}}
are prefilters. For instance, if
B
{\displaystyle {\mathcal {B}}}
is a prefilter but not a filter then
B
≤
B
↑
X
and
B
↑
X
≤
B
but
B
≠
B
↑
X
.
{\displaystyle {\mathcal {B}}\leq {\mathcal {B}}^{\uparrow X}{\text{ and }}{\mathcal {B}}^{\uparrow X}\leq {\mathcal {B}}{\text{ but }}{\mathcal {B}}\neq {\mathcal {B}}^{\uparrow X}.}
Equivalent families of sets
The preorder
≤
{\displaystyle \,\leq \,}
induces its canonical equivalence relation on
℘
(
℘
(
X
)
)
,
{\displaystyle \wp (\wp (X)),}
where for all
B
,
C
∈
℘
(
℘
(
X
)
)
,
{\displaystyle {\mathcal {B}},{\mathcal {C}}\in \wp (\wp (X)),}
B
{\displaystyle {\mathcal {B}}}
is equivalent to
C
{\displaystyle {\mathcal {C}}}
if any of the following equivalent conditions hold:
C
≤
B
and
B
≤
C
.
{\displaystyle {\mathcal {C}}\leq {\mathcal {B}}{\text{ and }}{\mathcal {B}}\leq {\mathcal {C}}.}
The upward closures of
C
and
B
{\displaystyle {\mathcal {C}}{\text{ and }}{\mathcal {B}}}
are equal.
Two upward closed (in
X
{\displaystyle X}
) subsets of
℘
(
X
)
{\displaystyle \wp (X)}
are equivalent if and only if they are equal.
If
B
⊆
℘
(
X
)
{\displaystyle {\mathcal {B}}\subseteq \wp (X)}
then necessarily
∅
≤
B
≤
℘
(
X
)
{\displaystyle \varnothing \leq {\mathcal {B}}\leq \wp (X)}
and
B
{\displaystyle {\mathcal {B}}}
is equivalent to
B
↑
X
.
{\displaystyle {\mathcal {B}}^{\uparrow X}.}
Every equivalence class other than
{
∅
}
{\displaystyle \{\varnothing \}}
contains a unique representative (that is, element of the equivalence class) that is upward closed in
X
.
{\displaystyle X.}
Properties preserved between equivalent families
Let
B
,
C
∈
℘
(
℘
(
X
)
)
{\displaystyle {\mathcal {B}},{\mathcal {C}}\in \wp (\wp (X))}
be arbitrary and let
F
{\displaystyle {\mathcal {F}}}
be any family of sets. If
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
are equivalent (which implies that
ker
B
=
ker
C
{\displaystyle \ker {\mathcal {B}}=\ker {\mathcal {C}}}
) then for each of the statements/properties listed below, either it is true of both
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
or else it is false of both
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
:
Not empty
Proper (that is,
∅
{\displaystyle \varnothing }
is not an element)
Moreover, any two degenerate families are necessarily equivalent.
Filter subbase
Prefilter
In which case
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
generate the same filter on
X
{\displaystyle X}
(that is, their upward closures in
X
{\displaystyle X}
are equal).
Free
Principal
Ultra
Is equal to the trivial filter
{
X
}
{\displaystyle \{X\}}
In words, this means that the only subset of
℘
(
X
)
{\displaystyle \wp (X)}
that is equivalent to the trivial filter is the trivial filter. In general, this conclusion of equality does not extend to non−trivial filters (one exception is when both families are filters).
Meshes with
F
{\displaystyle {\mathcal {F}}}
Is finer than
F
{\displaystyle {\mathcal {F}}}
Is coarser than
F
{\displaystyle {\mathcal {F}}}
Is equivalent to
F
{\displaystyle {\mathcal {F}}}
Missing from the above list is the word "filter" because this property is not preserved by equivalence.
However, if
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
are filters on
X
,
{\displaystyle X,}
then they are equivalent if and only if they are equal; this characterization does not extend to prefilters.
Equivalence of prefilters and filter subbases
If
B
{\displaystyle {\mathcal {B}}}
is a prefilter on
X
{\displaystyle X}
then the following families are always equivalent to each other:
B
{\displaystyle {\mathcal {B}}}
;
the π–system generated by
B
{\displaystyle {\mathcal {B}}}
;
the filter on
X
{\displaystyle X}
generated by
B
{\displaystyle {\mathcal {B}}}
;
and moreover, these three families all generate the same filter on
X
{\displaystyle X}
(that is, the upward closures in
X
{\displaystyle X}
of these families are equal).
In particular, every prefilter is equivalent to the filter that it generates.
By transitivity, two prefilters are equivalent if and only if they generate the same filter.
Every prefilter is equivalent to exactly one filter on
X
,
{\displaystyle X,}
which is the filter that it generates (that is, the prefilter's upward closure).
Said differently, every equivalence class of prefilters contains exactly one representative that is a filter.
In this way, filters can be considered as just being distinguished elements of these equivalence classes of prefilters.
A filter subbase that is not also a prefilter cannot be equivalent to the prefilter (or filter) that it generates.
In contrast, every prefilter is equivalent to the filter that it generates.
This is why prefilters can, by and large, be used interchangeably with the filters that they generate while filter subbases cannot.
Every filter is both a π–system and a ring of sets.
Examples of determining equivalence/non–equivalence
Examples: Let
X
=
R
{\displaystyle X=\mathbb {R} }
and let
E
{\displaystyle E}
be the set
Z
{\displaystyle \mathbb {Z} }
of integers (or the set
N
{\displaystyle \mathbb {N} }
). Define the sets
B
=
{
[
e
,
∞
)
:
e
∈
E
}
and
C
open
=
{
(
−
∞
,
e
)
∪
(
1
+
e
,
∞
)
:
e
∈
E
}
and
C
closed
=
{
(
−
∞
,
e
]
∪
[
1
+
e
,
∞
)
:
e
∈
E
}
.
{\displaystyle {\mathcal {B}}=\{[e,\infty )~:~e\in E\}\qquad {\text{ and }}\qquad {\mathcal {C}}_{\operatorname {open} }=\{(-\infty ,e)\cup (1+e,\infty )~:~e\in E\}\qquad {\text{ and }}\qquad {\mathcal {C}}_{\operatorname {closed} }=\{(-\infty ,e]\cup [1+e,\infty )~:~e\in E\}.}
All three sets are filter subbases but none are filters on
X
{\displaystyle X}
and only
B
{\displaystyle {\mathcal {B}}}
is prefilter (in fact,
B
{\displaystyle {\mathcal {B}}}
is even free and closed under finite intersections). The set
C
closed
{\displaystyle {\mathcal {C}}_{\operatorname {closed} }}
is fixed while
C
open
{\displaystyle {\mathcal {C}}_{\operatorname {open} }}
is free (unless
E
=
N
{\displaystyle E=\mathbb {N} }
). They satisfy
C
closed
≤
C
open
≤
B
,
{\displaystyle {\mathcal {C}}_{\operatorname {closed} }\leq {\mathcal {C}}_{\operatorname {open} }\leq {\mathcal {B}},}
but no two of these families are equivalent; moreover, no two of the filters generated by these three filter subbases are equivalent/equal. This conclusion can be reached by showing that the π–systems that they generate are not equivalent. Unlike with
C
open
,
{\displaystyle {\mathcal {C}}_{\operatorname {open} },}
every set in the π–system generated by
C
closed
{\displaystyle {\mathcal {C}}_{\operatorname {closed} }}
contains
Z
{\displaystyle \mathbb {Z} }
as a subset, which is what prevents their generated π–systems (and hence their generated filters) from being equivalent. If
E
{\displaystyle E}
was instead
Q
or
R
{\displaystyle \mathbb {Q} {\text{ or }}\mathbb {R} }
then all three families would be free and although the sets
C
closed
and
C
open
{\displaystyle {\mathcal {C}}_{\operatorname {closed} }{\text{ and }}{\mathcal {C}}_{\operatorname {open} }}
would remain not equivalent to each other, their generated π–systems would be equivalent and consequently, they would generate the same filter on
X
{\displaystyle X}
; however, this common filter would still be strictly coarser than the filter generated by
B
.
{\displaystyle {\mathcal {B}}.}
Set theoretic properties and constructions
= Trace and meshing
=If
B
{\displaystyle {\mathcal {B}}}
is a prefilter (resp. filter) on
X
and
S
⊆
X
{\displaystyle X{\text{ and }}S\subseteq X}
then the trace of
B
on
S
,
{\displaystyle {\mathcal {B}}{\text{ on }}S,}
which is the family
B
|
S
:=
B
(
∩
)
{
S
}
,
{\displaystyle {\mathcal {B}}{\big \vert }_{S}:={\mathcal {B}}(\cap )\{S\},}
is a prefilter (resp. a filter) if and only if
B
and
S
{\displaystyle {\mathcal {B}}{\text{ and }}S}
mesh (that is,
∅
∉
B
(
∩
)
{
S
}
{\displaystyle \varnothing \not \in {\mathcal {B}}(\cap )\{S\}}
), in which case the trace of
B
on
S
{\displaystyle {\mathcal {B}}{\text{ on }}S}
is said to be induced by
S
{\displaystyle S}
.
If
B
{\displaystyle {\mathcal {B}}}
is ultra and if
B
and
S
{\displaystyle {\mathcal {B}}{\text{ and }}S}
mesh then the trace
B
|
S
{\displaystyle {\mathcal {B}}{\big \vert }_{S}}
is ultra.
If
B
{\displaystyle {\mathcal {B}}}
is an ultrafilter on
X
{\displaystyle X}
then the trace of
B
on
S
{\displaystyle {\mathcal {B}}{\text{ on }}S}
is a filter on
S
{\displaystyle S}
if and only if
S
∈
B
.
{\displaystyle S\in {\mathcal {B}}.}
For example, suppose that
B
{\displaystyle {\mathcal {B}}}
is a filter on
X
and
S
⊆
X
{\displaystyle X{\text{ and }}S\subseteq X}
is such that
S
≠
X
and
X
∖
S
∉
B
.
{\displaystyle S\neq X{\text{ and }}X\setminus S\not \in {\mathcal {B}}.}
Then
B
and
S
{\displaystyle {\mathcal {B}}{\text{ and }}S}
mesh and
B
∪
{
S
}
{\displaystyle {\mathcal {B}}\cup \{S\}}
generates a filter on
X
{\displaystyle X}
that is strictly finer than
B
.
{\displaystyle {\mathcal {B}}.}
When prefilters mesh
Given non–empty families
B
and
C
,
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}},}
the family
B
(
∩
)
C
:=
{
B
∩
C
:
B
∈
B
and
C
∈
C
}
{\displaystyle {\mathcal {B}}(\cap ){\mathcal {C}}:=\{B\cap C~:~B\in {\mathcal {B}}{\text{ and }}C\in {\mathcal {C}}\}}
satisfies
C
≤
B
(
∩
)
C
{\displaystyle {\mathcal {C}}\leq {\mathcal {B}}(\cap ){\mathcal {C}}}
and
B
≤
B
(
∩
)
C
.
{\displaystyle {\mathcal {B}}\leq {\mathcal {B}}(\cap ){\mathcal {C}}.}
If
B
(
∩
)
C
{\displaystyle {\mathcal {B}}(\cap ){\mathcal {C}}}
is proper (resp. a prefilter, a filter subbase) then this is also true of both
B
and
C
.
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}.}
In order to make any meaningful deductions about
B
(
∩
)
C
{\displaystyle {\mathcal {B}}(\cap ){\mathcal {C}}}
from
B
and
C
,
B
(
∩
)
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}},{\mathcal {B}}(\cap ){\mathcal {C}}}
needs to be proper (that is,
∅
∉
B
(
∩
)
C
,
{\displaystyle \varnothing \not \in {\mathcal {B}}(\cap ){\mathcal {C}},}
which is the motivation for the definition of "mesh".
In this case,
B
(
∩
)
C
{\displaystyle {\mathcal {B}}(\cap ){\mathcal {C}}}
is a prefilter (resp. filter subbase) if and only if this is true of both
B
and
C
.
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}.}
Said differently, if
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
are prefilters then they mesh if and only if
B
(
∩
)
C
{\displaystyle {\mathcal {B}}(\cap ){\mathcal {C}}}
is a prefilter.
Generalizing gives a well known characterization of "mesh" entirely in terms of subordination (that is,
≤
{\displaystyle \,\leq \,}
):
Two prefilters (resp. filter subbases)
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
mesh if and only if there exists a prefilter (resp. filter subbase)
F
{\displaystyle {\mathcal {F}}}
such that
C
≤
F
{\displaystyle {\mathcal {C}}\leq {\mathcal {F}}}
and
B
≤
F
.
{\displaystyle {\mathcal {B}}\leq {\mathcal {F}}.}
If the least upper bound of two filters
B
and
C
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {C}}}
exists in
Filters
(
X
)
{\displaystyle \operatorname {Filters} (X)}
then this least upper bound is equal to
B
(
∩
)
C
.
{\displaystyle {\mathcal {B}}(\cap ){\mathcal {C}}.}
= Images and preimages under functions
=Throughout,
f
:
X
→
Y
and
g
:
Y
→
Z
{\displaystyle f:X\to Y{\text{ and }}g:Y\to Z}
will be maps between non–empty sets.
Images of prefilters
Let
B
⊆
℘
(
Y
)
.
{\displaystyle {\mathcal {B}}\subseteq \wp (Y).}
Many of the properties that
B
{\displaystyle {\mathcal {B}}}
may have are preserved under images of maps; notable exceptions include being upward closed, being closed under finite intersections, and being a filter, which are not necessarily preserved.
Explicitly, if one of the following properties is true of
B
on
Y
,
{\displaystyle {\mathcal {B}}{\text{ on }}Y,}
then it will necessarily also be true of
g
(
B
)
on
g
(
Y
)
{\displaystyle g({\mathcal {B}}){\text{ on }}g(Y)}
(although possibly not on the codomain
Z
{\displaystyle Z}
unless
g
{\displaystyle g}
is surjective):
Filter properties: ultra, ultrafilter, filter, prefilter, filter subbase, dual ideal, upward closed, proper/non–degenerate.
Ideal properties: ideal, closed under finite unions, downward closed, directed upward.
Moreover, if
B
⊆
℘
(
Y
)
{\displaystyle {\mathcal {B}}\subseteq \wp (Y)}
is a prefilter then so are both
g
(
B
)
and
g
−
1
(
g
(
B
)
)
.
{\displaystyle g({\mathcal {B}}){\text{ and }}g^{-1}(g({\mathcal {B}})).}
The image under a map
f
:
X
→
Y
{\displaystyle f:X\to Y}
of an ultra set
B
⊆
℘
(
X
)
{\displaystyle {\mathcal {B}}\subseteq \wp (X)}
is again ultra and if
B
{\displaystyle {\mathcal {B}}}
is an ultra prefilter then so is
f
(
B
)
.
{\displaystyle f({\mathcal {B}}).}
If
B
{\displaystyle {\mathcal {B}}}
is a filter then
g
(
B
)
{\displaystyle g({\mathcal {B}})}
is a filter on the range
g
(
Y
)
,
{\displaystyle g(Y),}
but it is a filter on the codomain
Z
{\displaystyle Z}
if and only if
g
{\displaystyle g}
is surjective.
Otherwise it is just a prefilter on
Z
{\displaystyle Z}
and its upward closure must be taken in
Z
{\displaystyle Z}
to obtain a filter.
The upward closure of
g
(
B
)
in
Z
{\displaystyle g({\mathcal {B}}){\text{ in }}Z}
is
g
(
B
)
↑
Z
=
{
S
⊆
Z
:
B
⊆
g
−
1
(
S
)
for some
B
∈
B
}
{\displaystyle g({\mathcal {B}})^{\uparrow Z}=\left\{S\subseteq Z~:~B\subseteq g^{-1}(S){\text{ for some }}B\in {\mathcal {B}}\right\}}
where if
B
{\displaystyle {\mathcal {B}}}
is upward closed in
Y
{\displaystyle Y}
(that is, a filter) then this simplifies to:
g
(
B
)
↑
Z
=
{
S
⊆
Z
:
g
−
1
(
S
)
∈
B
}
.
{\displaystyle g({\mathcal {B}})^{\uparrow Z}=\left\{S\subseteq Z~:~g^{-1}(S)\in {\mathcal {B}}\right\}.}
If
X
⊆
Y
{\displaystyle X\subseteq Y}
then taking
g
{\displaystyle g}
to be the inclusion map
X
→
Y
{\displaystyle X\to Y}
shows that any prefilter (resp. ultra prefilter, filter subbase) on
X
{\displaystyle X}
is also a prefilter (resp. ultra prefilter, filter subbase) on
Y
.
{\displaystyle Y.}
Preimages of prefilters
Let
B
⊆
℘
(
Y
)
.
{\displaystyle {\mathcal {B}}\subseteq \wp (Y).}
Under the assumption that
f
:
X
→
Y
{\displaystyle f:X\to Y}
is surjective:
f
−
1
(
B
)
{\displaystyle f^{-1}({\mathcal {B}})}
is a prefilter (resp. filter subbase, π–system, closed under finite unions, proper) if and only if this is true of
B
.
{\displaystyle {\mathcal {B}}.}
However, if
B
{\displaystyle {\mathcal {B}}}
is an ultrafilter on
Y
{\displaystyle Y}
then even if
f
{\displaystyle f}
is surjective (which would make
f
−
1
(
B
)
{\displaystyle f^{-1}({\mathcal {B}})}
a prefilter), it is nevertheless still possible for the prefilter
f
−
1
(
B
)
{\displaystyle f^{-1}({\mathcal {B}})}
to be neither ultra nor a filter on
X
{\displaystyle X}
(see this footnote for an example).
If
f
:
X
→
Y
{\displaystyle f:X\to Y}
is not surjective then denote the trace of
B
on
f
(
X
)
{\displaystyle {\mathcal {B}}{\text{ on }}f(X)}
by
B
|
f
(
X
)
,
{\displaystyle {\mathcal {B}}{\big \vert }_{f(X)},}
where in this case particular case the trace satisfies:
B
|
f
(
X
)
=
f
(
f
−
1
(
B
)
)
{\displaystyle {\mathcal {B}}{\big \vert }_{f(X)}=f\left(f^{-1}({\mathcal {B}})\right)}
and consequently also:
f
−
1
(
B
)
=
f
−
1
(
B
|
f
(
X
)
)
.
{\displaystyle f^{-1}({\mathcal {B}})=f^{-1}\left({\mathcal {B}}{\big \vert }_{f(X)}\right).}
This last equality and the fact that the trace
B
|
f
(
X
)
{\displaystyle {\mathcal {B}}{\big \vert }_{f(X)}}
is a family of sets over
f
(
X
)
{\displaystyle f(X)}
means that to draw conclusions about
f
−
1
(
B
)
,
{\displaystyle f^{-1}({\mathcal {B}}),}
the trace
B
|
f
(
X
)
{\displaystyle {\mathcal {B}}{\big \vert }_{f(X)}}
can be used in place of
B
{\displaystyle {\mathcal {B}}}
and the surjection
f
:
X
→
f
(
X
)
{\displaystyle f:X\to f(X)}
can be used in place of
f
:
X
→
Y
.
{\displaystyle f:X\to Y.}
For example:
f
−
1
(
B
)
{\displaystyle f^{-1}({\mathcal {B}})}
is a prefilter (resp. filter subbase, π–system, proper) if and only if this is true of
B
|
f
(
X
)
.
{\displaystyle {\mathcal {B}}{\big \vert }_{f(X)}.}
In this way, the case where
f
{\displaystyle f}
is not (necessarily) surjective can be reduced down to the case of a surjective function (which is a case that was described at the start of this subsection).
Even if
B
{\displaystyle {\mathcal {B}}}
is an ultrafilter on
Y
,
{\displaystyle Y,}
if
f
{\displaystyle f}
is not surjective then it is nevertheless possible that
∅
∈
B
|
f
(
X
)
,
{\displaystyle \varnothing \in {\mathcal {B}}{\big \vert }_{f(X)},}
which would make
f
−
1
(
B
)
{\displaystyle f^{-1}({\mathcal {B}})}
degenerate as well. The next characterization shows that degeneracy is the only obstacle. If
B
{\displaystyle {\mathcal {B}}}
is a prefilter then the following are equivalent:
f
−
1
(
B
)
{\displaystyle f^{-1}({\mathcal {B}})}
is a prefilter;
B
|
f
(
X
)
{\displaystyle {\mathcal {B}}{\big \vert }_{f(X)}}
is a prefilter;
∅
∉
B
|
f
(
X
)
{\displaystyle \varnothing \not \in {\mathcal {B}}{\big \vert }_{f(X)}}
;
B
{\displaystyle {\mathcal {B}}}
meshes with
f
(
X
)
{\displaystyle f(X)}
and moreover, if
f
−
1
(
B
)
{\displaystyle f^{-1}({\mathcal {B}})}
is a prefilter then so is
f
(
f
−
1
(
B
)
)
.
{\displaystyle f\left(f^{-1}({\mathcal {B}})\right).}
If
S
⊆
Y
{\displaystyle S\subseteq Y}
and if
In
:
S
→
Y
{\displaystyle \operatorname {In} :S\to Y}
denotes the inclusion map then the trace of
B
on
S
{\displaystyle {\mathcal {B}}{\text{ on }}S}
is equal to
In
−
1
(
B
)
.
{\displaystyle \operatorname {In} ^{-1}({\mathcal {B}}).}
This observation allows the results in this subsection to be applied to investigating the trace on a set.
Bijections, injections, and surjections
All properties involving filters are preserved under bijections. This means that if
B
⊆
℘
(
Y
)
and
g
:
Y
→
Z
{\displaystyle {\mathcal {B}}\subseteq \wp (Y){\text{ and }}g:Y\to Z}
is a bijection, then
B
{\displaystyle {\mathcal {B}}}
is a prefilter (resp. ultra, ultra prefilter, filter on
X
,
{\displaystyle X,}
ultrafilter on
X
,
{\displaystyle X,}
filter subbase, π–system, ideal on
X
,
{\displaystyle X,}
etc.) if and only if the same is true of
g
(
B
)
on
Z
.
{\displaystyle g({\mathcal {B}}){\text{ on }}Z.}
A map
g
:
Y
→
Z
{\displaystyle g:Y\to Z}
is injective if and only if for all prefilters
B
on
Y
,
B
{\displaystyle {\mathcal {B}}{\text{ on }}Y,{\mathcal {B}}}
is equivalent to
g
−
1
(
g
(
B
)
)
.
{\displaystyle g^{-1}(g({\mathcal {B}})).}
The image of an ultra family of sets under an injection is again ultra.
The map
f
:
X
→
Y
{\displaystyle f:X\to Y}
is a surjection if and only if whenever
B
{\displaystyle {\mathcal {B}}}
is a prefilter on
Y
{\displaystyle Y}
then the same is true of
f
−
1
(
B
)
on
X
{\displaystyle f^{-1}({\mathcal {B}}){\text{ on }}X}
(this result does not require the ultrafilter lemma).
Subordination is preserved by images and preimages
The relation
≤
{\displaystyle \,\leq \,}
is preserved under both images and preimages of families of sets.
This means that for any families
C
and
F
,
{\displaystyle {\mathcal {C}}{\text{ and }}{\mathcal {F}},}
C
≤
F
implies
g
(
C
)
≤
g
(
F
)
and
f
−
1
(
C
)
≤
f
−
1
(
F
)
.
{\displaystyle {\mathcal {C}}\leq {\mathcal {F}}\quad {\text{ implies }}\quad g({\mathcal {C}})\leq g({\mathcal {F}})\quad {\text{ and }}\quad f^{-1}({\mathcal {C}})\leq f^{-1}({\mathcal {F}}).}
Moreover, the following relations always hold for any family of sets
C
{\displaystyle {\mathcal {C}}}
:
C
≤
f
(
f
−
1
(
C
)
)
{\displaystyle {\mathcal {C}}\leq f\left(f^{-1}({\mathcal {C}})\right)}
where equality will hold if
f
{\displaystyle f}
is surjective.
Furthermore,
f
−
1
(
C
)
=
f
−
1
(
f
(
f
−
1
(
C
)
)
)
and
g
(
C
)
=
g
(
g
−
1
(
g
(
C
)
)
)
.
{\displaystyle f^{-1}({\mathcal {C}})=f^{-1}\left(f\left(f^{-1}({\mathcal {C}})\right)\right)\quad {\text{ and }}\quad g({\mathcal {C}})=g\left(g^{-1}(g({\mathcal {C}}))\right).}
If
B
⊆
℘
(
X
)
and
C
⊆
℘
(
Y
)
{\displaystyle {\mathcal {B}}\subseteq \wp (X){\text{ and }}{\mathcal {C}}\subseteq \wp (Y)}
then
f
(
B
)
≤
C
if and only if
B
≤
f
−
1
(
C
)
{\displaystyle f({\mathcal {B}})\leq {\mathcal {C}}\quad {\text{ if and only if }}\quad {\mathcal {B}}\leq f^{-1}({\mathcal {C}})}
and
g
−
1
(
g
(
C
)
)
≤
C
{\displaystyle g^{-1}(g({\mathcal {C}}))\leq {\mathcal {C}}}
where equality will hold if
g
{\displaystyle g}
is injective.
= Products of prefilters
=Suppose
X
∙
=
(
X
i
)
i
∈
I
{\displaystyle X_{\bullet }=\left(X_{i}\right)_{i\in I}}
is a family of one or more non–empty sets, whose product will be denoted by
∏
X
∙
:=
∏
i
∈
I
X
i
,
{\displaystyle \prod X_{\bullet }:=\prod _{i\in I}X_{i},}
and for every index
i
∈
I
,
{\displaystyle i\in I,}
let
Pr
X
i
:
∏
X
∙
→
X
i
{\displaystyle \Pr {}_{X_{i}}:\prod X_{\bullet }\to X_{i}}
denote the canonical projection.
Let
B
∙
:=
(
B
i
)
i
∈
I
{\displaystyle {\mathcal {B}}_{\bullet }:=\left({\mathcal {B}}_{i}\right)_{i\in I}}
be non−empty families, also indexed by
I
,
{\displaystyle I,}
such that
B
i
⊆
℘
(
X
i
)
{\displaystyle {\mathcal {B}}_{i}\subseteq \wp \left(X_{i}\right)}
for each
i
∈
I
.
{\displaystyle i\in I.}
The product of the families
B
∙
{\displaystyle {\mathcal {B}}_{\bullet }}
is defined identically to how the basic open subsets of the product topology are defined (had all of these
B
i
{\displaystyle {\mathcal {B}}_{i}}
been topologies). That is, both the notations
∏
B
∙
=
∏
i
∈
I
B
i
{\displaystyle \prod _{}{\mathcal {B}}_{\bullet }=\prod _{i\in I}{\mathcal {B}}_{i}}
denote the family of all cylinder subsets
∏
i
∈
I
S
i
⊆
∏
X
∙
{\displaystyle \prod _{i\in I}S_{i}\subseteq \prod _{}X_{\bullet }}
such that
S
i
=
X
i
{\displaystyle S_{i}=X_{i}}
for all but finitely many
i
∈
I
{\displaystyle i\in I}
and where
S
i
∈
B
i
{\displaystyle S_{i}\in {\mathcal {B}}_{i}}
for any one of these finitely many exceptions (that is, for any
i
{\displaystyle i}
such that
S
i
≠
X
i
,
{\displaystyle S_{i}\neq X_{i},}
necessarily
S
i
∈
B
i
{\displaystyle S_{i}\in {\mathcal {B}}_{i}}
).
When every
B
i
{\displaystyle {\mathcal {B}}_{i}}
is a filter subbase then the family
⋃
i
∈
I
Pr
X
i
−
1
(
B
i
)
{\displaystyle \bigcup _{i\in I}\Pr {}_{X_{i}}^{-1}\left({\mathcal {B}}_{i}\right)}
is a filter subbase for the filter on
∏
X
∙
{\displaystyle \prod X_{\bullet }}
generated by
B
∙
.
{\displaystyle {\mathcal {B}}_{\bullet }.}
If
∏
B
∙
{\displaystyle \prod {\mathcal {B}}_{\bullet }}
is a filter subbase then the filter on
∏
X
∙
{\displaystyle \prod X_{\bullet }}
that it generates is called the filter generated by
B
∙
{\displaystyle {\mathcal {B}}_{\bullet }}
.
If every
B
i
{\displaystyle {\mathcal {B}}_{i}}
is a prefilter on
X
i
{\displaystyle X_{i}}
then
∏
B
∙
{\displaystyle \prod {\mathcal {B}}_{\bullet }}
will be a prefilter on
∏
X
∙
{\displaystyle \prod X_{\bullet }}
and moreover, this prefilter is equal to the coarsest prefilter
F
on
∏
X
∙
{\displaystyle {\mathcal {F}}{\text{ on }}\prod X_{\bullet }}
such that
Pr
X
i
(
F
)
=
B
i
{\displaystyle \Pr {}_{X_{i}}({\mathcal {F}})={\mathcal {B}}_{i}}
for every
i
∈
I
.
{\displaystyle i\in I.}
However,
∏
B
∙
{\displaystyle \prod {\mathcal {B}}_{\bullet }}
may fail to be a filter on
∏
X
∙
{\displaystyle \prod X_{\bullet }}
even if every
B
i
{\displaystyle {\mathcal {B}}_{i}}
is a filter on
X
i
.
{\displaystyle X_{i}.}
= Set subtraction and some examples
=Set subtracting away a subset of the kernel
If
B
{\displaystyle {\mathcal {B}}}
is a prefilter on
X
,
S
⊆
ker
B
,
and
S
∉
B
{\displaystyle X,S\subseteq \ker {\mathcal {B}},{\text{ and }}S\not \in {\mathcal {B}}}
then
{
B
∖
S
:
B
∈
B
}
{\displaystyle \{B\setminus S~:~B\in {\mathcal {B}}\}}
is a prefilter, where this latter set is a filter if and only if
B
{\displaystyle {\mathcal {B}}}
is a filter and
S
=
∅
.
{\displaystyle S=\varnothing .}
In particular, if
B
{\displaystyle {\mathcal {B}}}
is a neighborhood basis at a point
x
{\displaystyle x}
in a topological space
X
{\displaystyle X}
having at least 2 points, then
{
B
∖
{
x
}
:
B
∈
B
}
{\displaystyle \{B\setminus \{x\}~:~B\in {\mathcal {B}}\}}
is a prefilter on
X
.
{\displaystyle X.}
This construction is used to define
lim
x
≠
x
0
x
→
x
0
f
(
x
)
→
y
{\displaystyle \lim _{\stackrel {x\to x_{0}}{x\neq x_{0}}}f(x)\to y}
in terms of prefilter convergence.
Using duality between ideals and dual ideals
There is a dual relation
B
⊲
C
{\displaystyle {\mathcal {B}}\vartriangleleft {\mathcal {C}}}
or
C
⊳
B
,
{\displaystyle {\mathcal {C}}\vartriangleright {\mathcal {B}},}
which is defined to mean that every
B
∈
B
{\displaystyle B\in {\mathcal {B}}}
is contained in some
C
∈
C
.
{\displaystyle C\in {\mathcal {C}}.}
Explicitly, this means that for every
B
∈
B
{\displaystyle B\in {\mathcal {B}}}
, there is some
C
∈
C
{\displaystyle C\in {\mathcal {C}}}
such that
B
⊆
C
.
{\displaystyle B\subseteq C.}
This relation is dual to
≤
{\displaystyle \,\leq \,}
in sense that
B
⊲
C
{\displaystyle {\mathcal {B}}\vartriangleleft {\mathcal {C}}}
if and only if
(
X
∖
B
)
≤
(
X
∖
C
)
.
{\displaystyle (X\setminus {\mathcal {B}})\leq (X\setminus {\mathcal {C}}).}
The relation
B
⊲
C
{\displaystyle {\mathcal {B}}\vartriangleleft {\mathcal {C}}}
is closely related to the downward closure of a family in a manner similar to how
≤
{\displaystyle \,\leq \,}
is related to the upward closure family.
For an example that uses this duality, suppose
f
:
X
→
Y
{\displaystyle f:X\to Y}
is a map and
Ξ
⊆
℘
(
Y
)
.
{\displaystyle \Xi \subseteq \wp (Y).}
Define
Ξ
f
:=
{
I
⊆
X
:
f
(
I
)
∈
Ξ
}
{\displaystyle \Xi _{f}:=\{I\subseteq X~:~f(I)\in \Xi \}}
which contains the empty set if and only if
Ξ
{\displaystyle \Xi }
does. It is possible for
Ξ
{\displaystyle \Xi }
to be an ultrafilter and for
Ξ
f
{\displaystyle \Xi _{f}}
to be empty or not closed under finite intersections (see footnote for example). Although
Ξ
f
{\displaystyle \Xi _{f}}
does not preserve properties of filters very well, if
Ξ
{\displaystyle \Xi }
is downward closed (resp. closed under finite unions, an ideal) then this will also be true for
Ξ
f
.
{\displaystyle \Xi _{f}.}
Using the duality between ideals and dual ideals allows for a construction of the following filter.
Suppose
B
{\displaystyle {\mathcal {B}}}
is a filter on
Y
{\displaystyle Y}
and let
Ξ
:=
Y
∖
B
{\displaystyle \Xi :=Y\setminus {\mathcal {B}}}
be its dual in
Y
.
{\displaystyle Y.}
If
X
∉
Ξ
f
{\displaystyle X\not \in \Xi _{f}}
then
Ξ
f
{\displaystyle \Xi _{f}}
's dual
X
∖
Ξ
f
{\displaystyle X\setminus \Xi _{f}}
will be a filter.
Other examples
Example: The set
B
{\displaystyle {\mathcal {B}}}
of all dense open subsets of a topological space is a proper π–system and a prefilter. If the space is a Baire space, then the set of all countable intersections of dense open subsets is a π–system and a prefilter that is finer than
B
.
{\displaystyle {\mathcal {B}}.}
Example: The family
B
Open
{\displaystyle {\mathcal {B}}_{\operatorname {Open} }}
of all dense open sets of
X
=
R
{\displaystyle X=\mathbb {R} }
having finite Lebesgue measure is a proper π–system and a free prefilter. The prefilter
B
Open
{\displaystyle {\mathcal {B}}_{\operatorname {Open} }}
is properly contained in, and not equivalent to, the prefilter consisting of all dense open subsets of
R
.
{\displaystyle \mathbb {R} .}
Since
X
{\displaystyle X}
is a Baire space, every countable intersection of sets in
B
Open
{\displaystyle {\mathcal {B}}_{\operatorname {Open} }}
is dense in
X
{\displaystyle X}
(and also comeagre and non–meager) so the set of all countable intersections of elements of
B
Open
{\displaystyle {\mathcal {B}}_{\operatorname {Open} }}
is a prefilter and π–system; it is also finer than, and not equivalent to,
B
Open
.
{\displaystyle {\mathcal {B}}_{\operatorname {Open} }.}
Filters and nets
This section will describe the relationships between prefilters and nets in great detail because of how important these details are applying filters to topology − particularly in switching from utilizing nets to utilizing filters and vice verse − and because it to make it easier to understand later why subnets (with their most commonly used definitions) are not generally equivalent with "sub–prefilters".
= Nets to prefilters
=A net
x
∙
=
(
x
i
)
i
∈
I
in
X
{\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}{\text{ in }}X}
is canonically associated with its prefilter of tails
Tails
(
x
∙
)
.
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right).}
If
f
:
X
→
Y
{\displaystyle f:X\to Y}
is a map and
x
∙
{\displaystyle x_{\bullet }}
is a net in
X
{\displaystyle X}
then
Tails
(
f
(
x
∙
)
)
=
f
(
Tails
(
x
∙
)
)
.
{\displaystyle \operatorname {Tails} \left(f\left(x_{\bullet }\right)\right)=f\left(\operatorname {Tails} \left(x_{\bullet }\right)\right).}
= Prefilters to nets
=A pointed set is a pair
(
S
,
s
)
{\displaystyle (S,s)}
consisting of a non–empty set
S
{\displaystyle S}
and an element
s
∈
S
.
{\displaystyle s\in S.}
For any family
B
,
{\displaystyle {\mathcal {B}},}
let
PointedSets
(
B
)
:=
{
(
B
,
b
)
:
B
∈
B
and
b
∈
B
}
.
{\displaystyle \operatorname {PointedSets} ({\mathcal {B}}):=\left\{(B,b)~:~B\in {\mathcal {B}}{\text{ and }}b\in B\right\}.}
Define a canonical preorder
≤
{\displaystyle \,\leq \,}
on pointed sets by declaring
(
R
,
r
)
≤
(
S
,
s
)
if and only if
R
⊇
S
.
{\displaystyle (R,r)\leq (S,s)\quad {\text{ if and only if }}\quad R\supseteq S.}
If
s
0
,
s
1
∈
S
then
(
S
,
s
0
)
≤
(
S
,
s
1
)
and
(
S
,
s
1
)
≤
(
S
,
s
0
)
{\displaystyle s_{0},s_{1}\in S{\text{ then }}\left(S,s_{0}\right)\leq \left(S,s_{1}\right){\text{ and }}\left(S,s_{1}\right)\leq \left(S,s_{0}\right)}
even if
s
0
≠
s
1
,
{\displaystyle s_{0}\neq s_{1},}
so this preorder is not antisymmetric and given any family of sets
B
,
{\displaystyle {\mathcal {B}},}
(
PointedSets
(
B
)
,
≤
)
{\displaystyle (\operatorname {PointedSets} ({\mathcal {B}}),\leq )}
is partially ordered if and only if
B
≠
∅
{\displaystyle {\mathcal {B}}\neq \varnothing }
consists entirely of singleton sets.
If
{
x
}
∈
B
then
(
{
x
}
,
x
)
{\displaystyle \{x\}\in {\mathcal {B}}{\text{ then }}(\{x\},x)}
is a maximal element of
PointedSets
(
B
)
{\displaystyle \operatorname {PointedSets} ({\mathcal {B}})}
; moreover, all maximal elements are of this form.
If
(
B
,
b
0
)
∈
PointedSets
(
B
)
then
(
B
,
b
0
)
{\displaystyle \left(B,b_{0}\right)\in \operatorname {PointedSets} ({\mathcal {B}}){\text{ then }}\left(B,b_{0}\right)}
is a greatest element if and only if
B
=
ker
B
,
{\displaystyle B=\ker {\mathcal {B}},}
in which case
{
(
B
,
b
)
:
b
∈
B
}
{\displaystyle \{(B,b)~:~b\in B\}}
is the set of all greatest elements. However, a greatest element
(
B
,
b
)
{\displaystyle (B,b)}
is a maximal element if and only if
B
=
{
b
}
=
ker
B
,
{\displaystyle B=\{b\}=\ker {\mathcal {B}},}
so there is at most one element that is both maximal and greatest.
There is a canonical map
Point
B
:
PointedSets
(
B
)
→
X
{\displaystyle \operatorname {Point} _{\mathcal {B}}~:~\operatorname {PointedSets} ({\mathcal {B}})\to X}
defined by
(
B
,
b
)
↦
b
.
{\displaystyle (B,b)\mapsto b.}
Although
(
PointedSets
(
B
)
,
≤
)
{\displaystyle (\operatorname {PointedSets} ({\mathcal {B}}),\leq )}
is not, in general, a partially ordered set, it is a directed set if (and only if)
B
{\displaystyle {\mathcal {B}}}
is a prefilter.
So the most immediate choice for the definition of "the net in
X
{\displaystyle X}
induced by a prefilter
B
{\displaystyle {\mathcal {B}}}
" is the assignment
(
B
,
b
)
↦
b
{\displaystyle (B,b)\mapsto b}
from
PointedSets
(
B
)
{\displaystyle \operatorname {PointedSets} ({\mathcal {B}})}
into
X
.
{\displaystyle X.}
If
B
{\displaystyle {\mathcal {B}}}
is a prefilter on
X
then
Net
B
{\displaystyle X{\text{ then }}\operatorname {Net} _{\mathcal {B}}}
is a net in
X
{\displaystyle X}
and the prefilter associated with
Net
B
{\displaystyle \operatorname {Net} _{\mathcal {B}}}
is
B
{\displaystyle {\mathcal {B}}}
; that is:
Tails
(
Net
B
)
=
B
.
{\displaystyle \operatorname {Tails} \left(\operatorname {Net} _{\mathcal {B}}\right)={\mathcal {B}}.}
This would not necessarily be true had
Net
B
{\displaystyle \operatorname {Net} _{\mathcal {B}}}
been defined on a proper subset of
PointedSets
(
B
)
.
{\displaystyle \operatorname {PointedSets} ({\mathcal {B}}).}
For example, suppose
X
{\displaystyle X}
has at least two distinct elements,
B
:=
{
X
}
{\displaystyle {\mathcal {B}}:=\{X\}}
is the indiscrete filter, and
x
∈
X
{\displaystyle x\in X}
is arbitrary. Had
Net
B
{\displaystyle \operatorname {Net} _{\mathcal {B}}}
instead been defined on the singleton set
D
:=
{
(
X
,
x
)
}
,
{\displaystyle D:=\{(X,x)\},}
where the restriction of
Net
B
{\displaystyle \operatorname {Net} _{\mathcal {B}}}
to
D
{\displaystyle D}
will temporarily be denote by
Net
D
:
D
→
X
,
{\displaystyle \operatorname {Net} _{D}:D\to X,}
then the prefilter of tails associated with
Net
D
:
D
→
X
{\displaystyle \operatorname {Net} _{D}:D\to X}
would be the principal prefilter
{
{
x
}
}
{\displaystyle \{\,\{x\}\,\}}
rather than the original filter
B
=
{
X
}
{\displaystyle {\mathcal {B}}=\{X\}}
;
this means that the equality
Tails
(
Net
D
)
=
B
{\displaystyle \operatorname {Tails} \left(\operatorname {Net} _{D}\right)={\mathcal {B}}}
is false, so unlike
Net
B
,
{\displaystyle \operatorname {Net} _{\mathcal {B}},}
the prefilter
B
{\displaystyle {\mathcal {B}}}
can not be recovered from
Net
D
.
{\displaystyle \operatorname {Net} _{D}.}
Worse still, while
B
{\displaystyle {\mathcal {B}}}
is the unique minimal filter on
X
,
{\displaystyle X,}
the prefilter
Tails
(
Net
D
)
=
{
{
x
}
}
{\displaystyle \operatorname {Tails} \left(\operatorname {Net} _{D}\right)=\{\{x\}\}}
instead generates a maximal filter (that is, an ultrafilter) on
X
.
{\displaystyle X.}
However, if
x
∙
=
(
x
i
)
i
∈
I
{\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}
is a net in
X
{\displaystyle X}
then it is not in general true that
Net
Tails
(
x
∙
)
{\displaystyle \operatorname {Net} _{\operatorname {Tails} \left(x_{\bullet }\right)}}
is equal to
x
∙
{\displaystyle x_{\bullet }}
because, for example, the domain of
x
∙
{\displaystyle x_{\bullet }}
may be of a completely different cardinality than that of
Net
Tails
(
x
∙
)
{\displaystyle \operatorname {Net} _{\operatorname {Tails} \left(x_{\bullet }\right)}}
(since unlike the domain of
Net
Tails
(
x
∙
)
,
{\displaystyle \operatorname {Net} _{\operatorname {Tails} \left(x_{\bullet }\right)},}
the domain of an arbitrary net in
X
{\displaystyle X}
could have any cardinality).
Ultranets and ultra prefilters
A net
x
∙
in
X
{\displaystyle x_{\bullet }{\text{ in }}X}
is called an ultranet or universal net in
X
{\displaystyle X}
if for every subset
S
⊆
X
,
x
∙
{\displaystyle S\subseteq X,x_{\bullet }}
is eventually in
S
{\displaystyle S}
or it is eventually in
X
∖
S
{\displaystyle X\setminus S}
;
this happens if and only if
Tails
(
x
∙
)
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)}
is an ultra prefilter.
A prefilter
B
on
X
{\displaystyle {\mathcal {B}}{\text{ on }}X}
is an ultra prefilter if and only if
Net
B
{\displaystyle \operatorname {Net} _{\mathcal {B}}}
is an ultranet in
X
.
{\displaystyle X.}
Partially ordered net
The domain of the canonical net
Net
B
{\displaystyle \operatorname {Net} _{\mathcal {B}}}
is in general not partially ordered. However, in 1955 Bruns and Schmidt discovered a construction that allows for the canonical net to have a domain that is both partially ordered and directed; this was independently rediscovered by Albert Wilansky in 1970.
It begins with the construction of a strict partial order (meaning a transitive and irreflexive relation)
<
{\displaystyle \,<\,}
on a subset of
B
×
N
×
X
{\displaystyle {\mathcal {B}}\times \mathbb {N} \times X}
that is similar to the lexicographical order on
B
×
N
{\displaystyle {\mathcal {B}}\times \mathbb {N} }
of the strict partial orders
(
B
,
⊋
)
and
(
N
,
<
)
.
{\displaystyle ({\mathcal {B}},\supsetneq ){\text{ and }}(\mathbb {N} ,<).}
For any
i
=
(
B
,
m
,
b
)
and
j
=
(
C
,
n
,
c
)
{\displaystyle i=(B,m,b){\text{ and }}j=(C,n,c)}
in
B
×
N
×
X
,
{\displaystyle {\mathcal {B}}\times \mathbb {N} \times X,}
declare that
i
<
j
{\displaystyle i
if and only if
B
⊇
C
and either:
(1)
B
≠
C
or else (2)
B
=
C
and
m
<
n
,
{\displaystyle B\supseteq C{\text{ and either: }}{\text{(1) }}B\neq C{\text{ or else (2) }}B=C{\text{ and }}m
or equivalently, if and only if
(1)
B
⊇
C
,
and (2) if
B
=
C
then
m
<
n
.
{\displaystyle {\text{(1) }}B\supseteq C,{\text{ and (2) if }}B=C{\text{ then }}m
The non−strict partial order associated with
<
,
{\displaystyle \,<,}
denoted by
≤
,
{\displaystyle \,\leq ,}
is defined by declaring that
i
≤
j
if and only if
i
<
j
or
i
=
j
.
{\displaystyle i\leq j\,{\text{ if and only if }}i
Unwinding these definitions gives the following characterization:
i
≤
j
{\displaystyle i\leq j}
if and only if
(1)
B
⊇
C
,
and (2) if
B
=
C
then
m
≤
n
,
{\displaystyle {\text{(1) }}B\supseteq C,{\text{ and (2) if }}B=C{\text{ then }}m\leq n,}
and also
(3) if
B
=
C
and
m
=
n
then
b
=
c
,
{\displaystyle {\text{(3) if }}B=C{\text{ and }}m=n{\text{ then }}b=c,}
which shows that
≤
{\displaystyle \,\leq \,}
is just the lexicographical order on
B
×
N
×
X
{\displaystyle {\mathcal {B}}\times \mathbb {N} \times X}
induced by
(
B
,
⊇
)
,
(
N
,
≤
)
,
and
(
X
,
=
)
,
{\displaystyle ({\mathcal {B}},\supseteq ),\,(\mathbb {N} ,\leq ),{\text{ and }}(X,=),}
where
X
{\displaystyle X}
is partially ordered by equality
=
.
{\displaystyle \,=.\,}
Both
<
and
≤
{\displaystyle \,<{\text{ and }}\leq \,}
are serial and neither possesses a greatest element or a maximal element; this remains true if they are each restricted to the subset of
B
×
N
×
X
{\displaystyle {\mathcal {B}}\times \mathbb {N} \times X}
defined by
Poset
B
:=
{
(
B
,
m
,
b
)
∈
B
×
N
×
X
:
b
∈
B
}
,
{\displaystyle {\begin{alignedat}{4}\operatorname {Poset} _{\mathcal {B}}\;&:=\;\{\,(B,m,b)\;\in \;{\mathcal {B}}\times \mathbb {N} \times X~:~b\in B\,\},\\\end{alignedat}}}
where it will henceforth be assumed that they are.
Denote the assignment
i
=
(
B
,
m
,
b
)
↦
b
{\displaystyle i=(B,m,b)\mapsto b}
from this subset by:
PosetNet
B
:
Poset
B
→
X
(
B
,
m
,
b
)
↦
b
{\displaystyle {\begin{alignedat}{4}\operatorname {PosetNet} _{\mathcal {B}}\ :\ &&\ \operatorname {Poset} _{\mathcal {B}}\ &&\,\to \;&X\\[0.5ex]&&\ (B,m,b)\ &&\,\mapsto \;&b\\[0.5ex]\end{alignedat}}}
If
i
0
=
(
B
0
,
m
0
,
b
0
)
∈
Poset
B
{\displaystyle i_{0}=\left(B_{0},m_{0},b_{0}\right)\in \operatorname {Poset} _{\mathcal {B}}}
then just as with
Net
B
{\displaystyle \operatorname {Net} _{\mathcal {B}}}
before, the tail of the
PosetNet
B
{\displaystyle \operatorname {PosetNet} _{\mathcal {B}}}
starting at
i
0
{\displaystyle i_{0}}
is equal to
B
0
.
{\displaystyle B_{0}.}
If
B
{\displaystyle {\mathcal {B}}}
is a prefilter on
X
{\displaystyle X}
then
PosetNet
B
{\displaystyle \operatorname {PosetNet} _{\mathcal {B}}}
is a net in
X
{\displaystyle X}
whose domain
Poset
B
{\displaystyle \operatorname {Poset} _{\mathcal {B}}}
is a partially ordered set and moreover,
Tails
(
PosetNet
B
)
=
B
.
{\displaystyle \operatorname {Tails} \left(\operatorname {PosetNet} _{\mathcal {B}}\right)={\mathcal {B}}.}
Because the tails of
PosetNet
B
and
Net
B
{\displaystyle \operatorname {PosetNet} _{\mathcal {B}}{\text{ and }}\operatorname {Net} _{\mathcal {B}}}
are identical (since both are equal to the prefilter
B
{\displaystyle {\mathcal {B}}}
), there is typically nothing lost by assuming that the domain of the net associated with a prefilter is both directed and partially ordered. If the set
N
{\displaystyle \mathbb {N} }
is replaced with the positive rational numbers then the strict partial order
<
{\displaystyle <}
will also be a dense order.
= Subordinate filters and subnets
=The notion of "
B
{\displaystyle {\mathcal {B}}}
is subordinate to
C
{\displaystyle {\mathcal {C}}}
" (written
B
⊢
C
{\displaystyle {\mathcal {B}}\vdash {\mathcal {C}}}
) is for filters and prefilters what "
x
n
∙
=
(
x
n
i
)
i
=
1
∞
{\displaystyle x_{n_{\bullet }}=\left(x_{n_{i}}\right)_{i=1}^{\infty }}
is a subsequence of
x
∙
=
(
x
i
)
i
=
1
∞
{\displaystyle x_{\bullet }=\left(x_{i}\right)_{i=1}^{\infty }}
" is for sequences.
For example, if
Tails
(
x
∙
)
=
{
x
≥
i
:
i
∈
N
}
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)=\left\{x_{\geq i}:i\in \mathbb {N} \right\}}
denotes the set of tails of
x
∙
{\displaystyle x_{\bullet }}
and if
Tails
(
x
n
∙
)
=
{
x
n
≥
i
:
i
∈
N
}
{\displaystyle \operatorname {Tails} \left(x_{n_{\bullet }}\right)=\left\{x_{n_{\geq i}}:i\in \mathbb {N} \right\}}
denotes the set of tails of the subsequence
x
n
∙
{\displaystyle x_{n_{\bullet }}}
(where
x
n
≥
i
:=
{
x
n
i
:
i
∈
N
}
{\displaystyle x_{n_{\geq i}}:=\left\{x_{n_{i}}~:~i\in \mathbb {N} \right\}}
) then
Tails
(
x
n
∙
)
⊢
Tails
(
x
∙
)
{\displaystyle \operatorname {Tails} \left(x_{n_{\bullet }}\right)~\vdash ~\operatorname {Tails} \left(x_{\bullet }\right)}
(that is,
Tails
(
x
∙
)
≤
Tails
(
x
n
∙
)
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)\leq \operatorname {Tails} \left(x_{n_{\bullet }}\right)}
) is true but
Tails
(
x
∙
)
⊢
Tails
(
x
n
∙
)
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)~\vdash ~\operatorname {Tails} \left(x_{n_{\bullet }}\right)}
is in general false.
Non–equivalence of subnets and subordinate filters
A subset
R
⊆
I
{\displaystyle R\subseteq I}
of a preordered space
(
I
,
≤
)
{\displaystyle (I,\leq )}
is frequent or cofinal in
I
{\displaystyle I}
if for every
i
∈
I
{\displaystyle i\in I}
there exists some
r
∈
R
such that
i
≤
r
.
{\displaystyle r\in R{\text{ such that }}i\leq r.}
If
R
⊆
I
{\displaystyle R\subseteq I}
contains a tail of
I
{\displaystyle I}
then
R
{\displaystyle R}
is said to be eventual or eventually in
I
{\displaystyle I}
; explicitly, this means that there exists some
i
∈
I
such that
I
≥
i
⊆
R
{\displaystyle i\in I{\text{ such that }}I_{\geq i}\subseteq R}
(that is,
j
∈
R
for all
j
∈
I
satisfying
i
≤
j
{\displaystyle j\in R{\text{ for all }}j\in I{\text{ satisfying }}i\leq j}
). An eventual set is necessarily not empty. A subset is eventual if and only if its complement is not frequent (which is termed infrequent).
A map
h
:
A
→
I
{\displaystyle h:A\to I}
between two preordered sets is order–preserving if whenever
a
,
b
∈
A
satisfy
a
≤
b
,
then
h
(
a
)
≤
h
(
b
)
.
{\displaystyle a,b\in A{\text{ satisfy }}a\leq b,{\text{ then }}h(a)\leq h(b).}
Subnets in the sense of Willard and subnets in the sense of Kelley are the most commonly used definitions of "subnet."
The first definition of a subnet was introduced by John L. Kelley in 1955.
Stephen Willard introduced his own variant of Kelley's definition of subnet in 1970.
AA–subnets were introduced independently by Smiley (1957), Aarnes and Andenaes (1972), and Murdeshwar (1983); AA–subnets were studied in great detail by Aarnes and Andenaes but they are not often used.
Kelley did not require the map
h
{\displaystyle h}
to be order preserving while the definition of an AA–subnet does away entirely with any map between the two nets' domains and instead focuses entirely on
X
{\displaystyle X}
− the nets' common codomain.
Every Willard–subnet is a Kelley–subnet and both are AA–subnets.
In particular, if
y
∙
=
(
y
a
)
a
∈
A
{\displaystyle y_{\bullet }=\left(y_{a}\right)_{a\in A}}
is a Willard–subnet or a Kelley–subnet of
x
∙
=
(
x
i
)
i
∈
I
{\displaystyle x_{\bullet }=\left(x_{i}\right)_{i\in I}}
then
Tails
(
x
∙
)
≤
Tails
(
y
∙
)
.
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)\leq \operatorname {Tails} \left(y_{\bullet }\right).}
Example: Let
I
=
N
{\displaystyle I=\mathbb {N} }
and let
x
∙
{\displaystyle x_{\bullet }}
be a constant sequence, say
x
∙
=
(
0
)
i
∈
N
.
{\displaystyle x_{\bullet }=\left(0\right)_{i\in \mathbb {N} }.}
Let
s
1
=
0
{\displaystyle s_{1}=0}
and
A
=
{
1
}
{\displaystyle A=\{1\}}
so that
s
∙
=
(
s
a
)
a
∈
A
=
(
s
1
)
{\displaystyle s_{\bullet }=\left(s_{a}\right)_{a\in A}=\left(s_{1}\right)}
is a net on
A
.
{\displaystyle A.}
Then
s
∙
{\displaystyle s_{\bullet }}
is an AA-subnet of
x
∙
{\displaystyle x_{\bullet }}
because
Tails
(
x
∙
)
=
{
{
0
}
}
=
Tails
(
s
∙
)
.
{\displaystyle \operatorname {Tails} \left(x_{\bullet }\right)=\{\{0\}\}=\operatorname {Tails} \left(s_{\bullet }\right).}
But
s
∙
{\displaystyle s_{\bullet }}
is not a Willard-subnet of
x
∙
{\displaystyle x_{\bullet }}
because there does not exist any map
h
:
A
→
I
{\displaystyle h:A\to I}
whose image is a cofinal subset of
I
=
N
.
{\displaystyle I=\mathbb {N} .}
Nor is
s
∙
{\displaystyle s_{\bullet }}
a Kelley-subnet of
x
∙
{\displaystyle x_{\bullet }}
because if
h
:
A
→
I
{\displaystyle h:A\to I}
is any map then
E
:=
I
∖
{
h
(
1
)
}
{\displaystyle E:=I\setminus \{h(1)\}}
is a cofinal subset of
I
=
N
{\displaystyle I=\mathbb {N} }
but
h
−
1
(
E
)
=
∅
{\displaystyle h^{-1}(E)=\varnothing }
is not eventually in
A
.
{\displaystyle A.}
AA–subnets have a defining characterization that immediately shows that they are fully interchangeable with sub(ordinate)filters.
Explicitly, what is meant is that the following statement is true for AA–subnets:
If
B
and
F
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}}}
are prefilters then
B
≤
F
if and only if
Net
F
{\displaystyle {\mathcal {B}}\leq {\mathcal {F}}{\text{ if and only if }}\operatorname {Net} _{\mathcal {F}}}
is an AA–subnet of
Net
B
.
{\displaystyle \;\operatorname {Net} _{\mathcal {B}}.}
If "AA–subnet" is replaced by "Willard–subnet" or "Kelley–subnet" then the above statement becomes false. In particular, the problem is that the following statement is in general false:
False statement: If
B
and
F
{\displaystyle {\mathcal {B}}{\text{ and }}{\mathcal {F}}}
are prefilters such that
B
≤
F
then
Net
F
{\displaystyle {\mathcal {B}}\leq {\mathcal {F}}{\text{ then }}\operatorname {Net} _{\mathcal {F}}}
is a Kelley–subnet of
Net
B
.
{\displaystyle \;\operatorname {Net} _{\mathcal {B}}.}
Since every Willard–subnet is a Kelley–subnet, this statement remains false if the word "Kelley–subnet" is replaced with "Willard–subnet".
Counter example: For all
n
∈
N
,
{\displaystyle n\in \mathbb {N} ,}
let
B
n
=
{
1
}
∪
N
≥
n
.
{\displaystyle B_{n}=\{1\}\cup \mathbb {N} _{\geq n}.}
Let
B
=
{
B
n
:
n
∈
N
}
,
{\displaystyle {\mathcal {B}}=\{B_{n}~:~n\in \mathbb {N} \},}
which is a proper π–system, and let
F
=
{
{
1
}
}
∪
B
,
{\displaystyle {\mathcal {F}}=\{\{1\}\}\cup {\mathcal {B}},}
where both families are prefilters on the natural numbers
X
:=
N
=
{
1
,
2
,
…
}
.
{\displaystyle X:=\mathbb {N} =\{1,2,\ldots \}.}
Because
B
≤
F
,
F
{\displaystyle {\mathcal {B}}\leq {\mathcal {F}},{\mathcal {F}}}
is to
B
{\displaystyle {\mathcal {B}}}
as a subsequence is to a sequence.
So ideally,
S
=
Net
F
{\displaystyle S=\operatorname {Net} _{\mathcal {F}}}
should be a subnet of
B
=
Net
B
.
{\displaystyle B=\operatorname {Net} _{\mathcal {B}}.}
Let
I
:=
PointedSets
(
B
)
{\displaystyle I:=\operatorname {PointedSets} ({\mathcal {B}})}
be the domain of
Net
B
,
{\displaystyle \operatorname {Net} _{\mathcal {B}},}
so
I
{\displaystyle I}
contains a cofinal subset that is order isomorphic to
N
{\displaystyle \mathbb {N} }
and consequently contains neither a maximal nor greatest element.
Let
A
:=
PointedSets
(
F
)
=
{
M
}
∪
I
,
where
M
:=
(
1
,
{
1
}
)
{\displaystyle A:=\operatorname {PointedSets} ({\mathcal {F}})=\{M\}\cup I,{\text{ where }}M:=(1,\{1\})}
is both a maximal and greatest element of
A
.
{\displaystyle A.}
The directed set
A
{\displaystyle A}
also contains a subset that is order isomorphic to
N
{\displaystyle \mathbb {N} }
(because it contains
I
,
{\displaystyle I,}
which contains such a subset) but no such subset can be cofinal in
A
{\displaystyle A}
because of the maximal element
M
.
{\displaystyle M.}
Consequently, any order–preserving map
h
:
A
→
I
{\displaystyle h:A\to I}
must be eventually constant (with value
h
(
M
)
{\displaystyle h(M)}
) where
h
(
M
)
{\displaystyle h(M)}
is then a greatest element of the range
h
(
A
)
.
{\displaystyle h(A).}
Because of this, there can be no order preserving map
h
:
A
→
I
{\displaystyle h:A\to I}
that satisfies the conditions required for
Net
F
{\displaystyle \operatorname {Net} _{\mathcal {F}}}
to be a Willard–subnet of
Net
B
{\displaystyle \operatorname {Net} _{\mathcal {B}}}
(because the range of such a map
h
{\displaystyle h}
cannot be cofinal in
I
{\displaystyle I}
).
Suppose for the sake of contradiction that there exists a map
h
:
A
→
I
{\displaystyle h:A\to I}
such that
h
−
1
(
I
≥
i
)
{\displaystyle h^{-1}\left(I_{\geq i}\right)}
is eventually in
A
{\displaystyle A}
for all
i
∈
I
.
{\displaystyle i\in I.}
Because
h
(
M
)
∈
I
,
{\displaystyle h(M)\in I,}
there exist
n
,
n
0
∈
N
{\displaystyle n,n_{0}\in \mathbb {N} }
such that
h
(
M
)
=
(
n
0
,
B
n
)
with
n
0
∈
B
n
.
{\displaystyle h(M)=\left(n_{0},B_{n}\right){\text{ with }}n_{0}\in B_{n}.}
For every
i
∈
I
,
{\displaystyle i\in I,}
because
h
−
1
(
I
≥
i
)
{\displaystyle h^{-1}\left(I_{\geq i}\right)}
is eventually in
A
,
{\displaystyle A,}
it is necessary that
h
(
M
)
∈
I
≥
i
.
{\displaystyle h(M)\in I_{\geq i}.}
In particular, if
i
:=
(
n
+
2
,
B
n
+
2
)
{\displaystyle i:=\left(n+2,B_{n+2}\right)}
then
h
(
M
)
≥
i
=
(
n
+
2
,
B
n
+
2
)
,
{\displaystyle h(M)\geq i=\left(n+2,B_{n+2}\right),}
which by definition is equivalent to
B
n
⊆
B
n
+
2
,
{\displaystyle B_{n}\subseteq B_{n+2},}
which is false.
Consequently,
Net
F
{\displaystyle \operatorname {Net} _{\mathcal {F}}}
is not a Kelley–subnet of
Net
B
.
{\displaystyle \operatorname {Net} _{\mathcal {B}}.}
If "subnet" is defined to mean Willard–subnet or Kelley–subnet then nets and filters are not completely interchangeable because there exists a filter–sub(ordinate)filter relationships that cannot be expressed in terms of a net–subnet relationship between the two induced nets. In particular, the problem is that Kelley–subnets and Willard–subnets are not fully interchangeable with subordinate filters. If the notion of "subnet" is not used or if "subnet" is defined to mean AA–subnet, then this ceases to be a problem and so it becomes correct to say that nets and filters are interchangeable. Despite the fact that AA–subnets do not have the problem that Willard and Kelley subnets have, they are not widely used or known about.
See also
Characterizations of the category of topological spaces
Convergence space – Generalization of the notion of convergence that is found in general topology
Filter (mathematics) – In mathematics, a special subset of a partially ordered set
Filter quantifier
Filters in topology – Use of filters to describe and characterize all basic topological notions and results.
Filtration (mathematics) – Indexed set in mathematics
Filtration (probability theory) – Model of information available at a given point of a random process
Filtration (abstract algebra)
Fréchet filter – frechet filterPages displaying wikidata descriptions as a fallback
Generic filter – in set theory, given a collection of dense open subsets of a poset, a filter that meets all sets in that collectionPages displaying wikidata descriptions as a fallback
Ideal (set theory) – Non-empty family of sets that is closed under finite unions and subsets
Stone–Čech compactification#Construction using ultrafilters – Concept in topology
The fundamental theorem of ultraproducts – Mathematical constructionPages displaying short descriptions of redirect targets
Ultrafilter – Maximal proper filter
Ultrafilter (set theory) – Maximal proper filterPages displaying short descriptions of redirect targets
Notes
Proofs
Citations
References
Adams, Colin; Franzosa, Robert (2009). Introduction to Topology: Pure and Applied. New Delhi: Pearson Education. ISBN 978-81-317-2692-1. OCLC 789880519.
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.
Berberian, Sterling K. (1974). Lectures in Functional Analysis and Operator Theory. Graduate Texts in Mathematics. Vol. 15. New York: Springer. ISBN 978-0-387-90081-0. OCLC 878109401.
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.
Bourbaki, Nicolas (1989) [1967]. General Topology 2: Chapters 5–10 [Topologie Générale]. Éléments de mathématique. Vol. 4. Berlin New York: Springer Science & Business Media. ISBN 978-3-540-64563-4. OCLC 246032063.
Bourbaki, Nicolas (1987) [1981]. Topological Vector Spaces: Chapters 1–5. Éléments de mathématique. Translated by Eggleston, H.G.; Madan, S. Berlin New York: Springer-Verlag. ISBN 3-540-13627-4. OCLC 17499190.
Burris, Stanley; Sankappanavar, Hanamantagouda P. (2012). A Course in Universal Algebra (PDF). Springer-Verlag. ISBN 978-0-9880552-0-9. Archived from the original on 1 April 2022.
Cartan, Henri (1937a). "Théorie des filtres". Comptes rendus hebdomadaires des séances de l'Académie des sciences. 205: 595–598.
Cartan, Henri (1937b). "Filtres et ultrafiltres". Comptes rendus hebdomadaires des séances de l'Académie des sciences. 205: 777–779.
Comfort, William Wistar; Negrepontis, Stylianos (1974). The Theory of Ultrafilters. Vol. 211. Berlin Heidelberg New York: Springer-Verlag. ISBN 978-0-387-06604-2. OCLC 1205452.
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.
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.
Dunford, Nelson; Schwartz, Jacob T. (1988). Linear Operators. Pure and applied mathematics. Vol. 1. New York: Wiley-Interscience. ISBN 978-0-471-60848-6. OCLC 18412261.
Edwards, Robert E. (1995). Functional Analysis: Theory and Applications. New York: Dover Publications. ISBN 978-0-486-68143-6. OCLC 30593138.
Howes, Norman R. (23 June 1995). Modern Analysis and Topology. Graduate Texts in Mathematics. New York: Springer-Verlag Science & Business Media. ISBN 978-0-387-97986-1. OCLC 31969970. OL 1272666M.
Jarchow, Hans (1981). Locally convex spaces. Stuttgart: B.G. Teubner. ISBN 978-3-519-02224-4. OCLC 8210342.
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.
Kelley, John L. (1975). General Topology. Graduate Texts in Mathematics. Vol. 27. New York: Springer Science & Business Media. ISBN 978-0-387-90125-1. OCLC 338047.
Köthe, Gottfried (1983) [1969]. Topological Vector Spaces I. Grundlehren der mathematischen Wissenschaften. Vol. 159. Translated by Garling, D.J.H. New York: Springer Science & Business Media. ISBN 978-3-642-64988-2. MR 0248498. OCLC 840293704.
Koutras, Costas D.; Moyzes, Christos; Nomikos, Christos; Tsaprounis, Konstantinos; Zikos, Yorgos (20 October 2021). "On Weak Filters and Ultrafilters: Set Theory From (and for) Knowledge Representation". Logic Journal of the IGPL. 31: 68–95. doi:10.1093/jigpal/jzab030.
MacIver R., David (1 July 2004). "Filters in Analysis and Topology" (PDF). Archived from the original (PDF) on 2007-10-09. (Provides an introductory review of filters in topology and in metric spaces.)
Narici, Lawrence; Beckenstein, Edward (2011). Topological Vector Spaces. Pure and applied mathematics (Second ed.). Boca Raton, FL: CRC Press. ISBN 978-1584888666. OCLC 144216834.
Robertson, Alex P.; Robertson, Wendy J. (1980). Topological Vector Spaces. Cambridge Tracts in Mathematics. Vol. 53. Cambridge England: Cambridge University Press. ISBN 978-0-521-29882-7. OCLC 589250.
Schaefer, Helmut H.; Wolff, Manfred P. (1999). Topological Vector Spaces. GTM. Vol. 8 (Second ed.). New York, NY: Springer New York Imprint Springer. ISBN 978-1-4612-7155-0. OCLC 840278135.
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.
Trèves, François (2006) [1967]. Topological Vector Spaces, Distributions and Kernels. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-45352-1. OCLC 853623322.
Wilansky, Albert (2013). Modern Methods in Topological Vector Spaces. Mineola, New York: Dover Publications, Inc. ISBN 978-0-486-49353-4. OCLC 849801114.
Wilansky, Albert (17 October 2008) [1970]. Topology for Analysis. Mineola, New York: Dover Publications, Inc. ISBN 978-0-486-46903-4. OCLC 227923899.
Willard, Stephen (2004) [1970]. General Topology. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-43479-7. OCLC 115240.
Kata Kunci Pencarian:
- Kolorimeter (kimia)
- Karburator
- Pembingkaian
- Kategori gelanggang
- James Clerk Maxwell
- Martinus Beijerinck
- Filtrasi (matematika)
- Aljabar Boolean (struktur)
- Kekisi (tatanan)
- Dream Theater (album)
- Filter (set theory)
- Filter (mathematics)
- Ultrafilter on a set
- Fréchet filter
- Filter
- Kernel (set theory)
- Ideal (set theory)
- Ideal (order theory)
- Bloom filter
- Filter design
