Let be a nonempty set. A filter on is a collection of subsets of that satisfies the following conditions:
,
If then
If , and , then
A trivial example of a filter on is the collection that consists only of the set itself. This trivial filter on is the smallest filter on ; it is included in every filter on .
Let be a nonempty subset of , and let us consider the collection $$
F = {X \subseteq S\mid A \subseteq X }
a nonempty family of sets is called:
free if , and fixed if
principal if
principal at a point if and is a singleton set, then is said to be principal at.
We see that any principal filter is not free.
Let be infinite, and let . is the filter of all cofinite subsets of . This is special and called a Fréchet filter
A filter is free iff it contains the Fréchet filter
Ideals
Def: Let be a nonempty set. An ideal of is a collection of subsets of that satisfies the following properties:
, and
If , then
if , and , then
The trivial ideal on is . A principal ideal is an ideal of the form $$I = {X \mid X \subseteq A} = \mathcal P(A)$$ where .
A family of sets of , is an ideal iff is hereditary and is a ring
To see how filters and ideals are related, note that if is a filter on , then $$ I = {S\setminus X \mid X \in F}$$is an ideal, and vice versa, if is an ideal, then $$F = {S\setminus X \mid X\in I}$$is a filter. Two objects related by the equations above are called dual to each other.
Filter Base or Prefilters
Def: Given a filter on the set , a nonempty sub collection of is a filter base or prefilter for if it satisfies that for every , there's a , such that .
Prop: Let be a set and be a nonempty family of . Then is filter base on iff , for any , there exists a such that .
If is a nonempty family of subsets of , such that satisfies the condition:
then the filter that contains as a filter base is the collection $$F_B = {F \subseteq X \mid \exists A \in B [A \subseteq F]}$$ The filter is the filter generated by the filter base.
Def: Let and be prefilters on , then we can add a preorder them: we say that refines and write if for the corresponding filters . It is not hard that this holds iff for every there exists such that . If We say that and are equivalent prefilters and write .
Def: A system of sets has the finite intersection property if every nonempty finite subsystem of has nonempty intersection. Sometimes systems with this property are called centred.
Any filter and any filter base have the finite intersection property.
Prop: Let and be a filter on . Then is the image of the filter under , is a prefilter of . Similarlty, if is a filter on , then is a prefilter of .
If we have a nonempty system with the finite intersection property, then , the -system generated by , is a filter base, and we can generate a filter .
Lemma: Let be a nonempty collection of subsets of and let have the finite intersection property. Then there's is a filter on , such that . The proof is the argument above, and it is the smallest filter that contains .
Prop: Let be a family of subsets of , the following are equivalent:
has the finite intersection property
there exists a prefilter , such that
there exists a filter such that
This is why, in the context of filters, sets with the finite intersection property are called filter subbase.
Def: A family of prefilters on a set is compatible if there exists a prefilter , i.e., is a filter subbase. This occurs iff every finite subset and any assignment we have that .
Ultrafilters
Def: A filter on is an ultrafilter if for every , either or .
Def: An ideal on is a prime ideal if for every , either or
Lemma: A filter on is an ultrafilter iff is a maximal filter.
Th: Let be a set. The following are equivalent:
is an ultrafilter on
is a maximal centered family
is a filter base with the property: for all , if for all , then
is a maximal filter
is a centered family with the property: for all , either or
Th: Every filter on , can be extended to an ultrafilter on .
Cor: Every centered family on can be extended to an ultrafilter on
Lemma: If is a subset of filters on and if every either or , then the union of is also a filter on
There is a natural relation between ultrafilters and Measures. Let us call a content on two-valued if it only takes values or ; for every , .
Th:
If is a two-valued content on then is an ultrafilter
If is an ultrafilter on , then the function defined as if , and if , is a two valued content on .
Prop: A nonprincipal ultrafilter is free. Meaning a ultrafilter is nonprincipal iff it is free.
Cor: An ultrafilter is nonprincipal iff doesn't contain a finite subset of .
Th: Let be a set, if is finite there are ultrafilters, if is infinite, there are ultrafilters
Cor: if is infinite, there are nonprincipal ultrafilters
Def: A nonempty family of subsets of is called ultra if and for every , there exists , such that or (or equivalently such that or )
Prop: A nonempty family of subsets of is called ultra if and any of the following equivalent are satisfied:
For every set there exists such that or
For every there exists such that or
For every set, there exists such that or
The last two characterizations we see that don't depend on , so we see that is ultra is independent of the set
We see that a ultrafilter is a filter that is ultra.
Def: An ultra prefilter is a filter base that is ultra.
Prop: A maximal prefilter on is a prefilter on that satisfies any of the following equivalent conditions:
is ultra
is maximal with respect to the preorder of prefilters
if a filter on satisfies that then (using the preorder on the prefilters)