Filters and Ideals

Subjects: Set Theory
Links: Pi-System, Convergence of Filters

Let S be a nonempty set. A filter on S is a collection F of subsets of S that satisfies the following conditions:

A trivial example of a filter on S is the collection F={S} that consists only of the set S itself. This trivial filter on S is the smallest filter on S; it is included in every filter on S.

Let A be a nonempty subset of S, and let us consider the collection $$
F = {X \subseteq S\mid A \subseteq X }

Thecollection$F$iscalledtheprincipalfilteron$S$generatedby$A$.Ifweset$A={a}$,where$aS$,theprincipalfilter$$F={XSaX}$$ismaximal:thereisnofilter$F$on$S$suchthat$FF$.Wegetthatif$A$hasatleast$2$elements,thentheprincipalfilterof$A$isnotmaximalDef:Let$P$beanonemptyfamilyofsubsetsof$S$,thenthekernelof$P$istheintersectionofallsetsin$P$:$$kerP:=P=BPB

a nonempty family of sets P is called:

We see that any principal filter is not free.

Let S be infinite, and let F={XS|SX|<0}. F is the filter of all cofinite subsets of S. This is special and called a Fréchet filter

A filter is free iff it contains the Fréchet filter

Ideals

Def: Let S be a nonempty set. An ideal of S is a collection I of subsets of S that satisfies the following properties:

The trivial ideal on S is {}. A principal ideal is an ideal of the form $$I = {X \mid X \subseteq A} = \mathcal P(A)$$ where AS.

A family of sets I of X, is an ideal iff I is hereditary and I is a ring

To see how filters and ideals are related, note that if F is a filter on S, then $$ I = {S\setminus X \mid X \in F}$$is an ideal, and vice versa, if I 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 F on the set X, a nonempty sub collection B of F is a filter base or prefilter for F if it satisfies that for every AF, there's a CB, such that CA.

Prop: Let X be a set and B be a nonempty family of X. Then B is filter base on X iff B, for any A1,A2B, there exists a A3B such that A3A1A2.

If B is a nonempty family of subsets of X, such that satisfies the condition:

()BA1,A2BA3B[A3A1A2]

then the filter that contains B as a filter base is the collection $$F_B = {F \subseteq X \mid \exists A \in B [A \subseteq F]}$$ The filter FB is the filter generated by the filter base B.

Def: Let F1 and F2 be prefilters on X, then we can add a preorder them: we say that F2 refines F1 and write F1F2 if for the corresponding filters F1F2. It is not hard that this holds iff for every A1F1 there exists A2F2 such that A2A1. If F1F2F1 We say that F1 and F2 are equivalent prefilters and write F1F2.

Def: A system of sets S has the finite intersection property if every nonempty finite subsystem of S has nonempty intersection. Sometimes systems with this property are called centred.

Any filter and any filter base have the finite intersection property.

Prop: Let f:XY and F be a filter on X. Then f[F] is the image of the filter F under f, is a prefilter of Y. Similarlty, if G is a filter on Y, then f1[G] is a prefilter of X.

If we have a nonempty system S with the finite intersection property, then π(S), the π-system generated by S, is a filter base, and we can generate a filter Fπ(S).

Lemma: Let G be a nonempty collection of subsets of S and let G have the finite intersection property. Then there's is a filter F on S, such that GF. The proof is the argument above, and it is the smallest filter that contains G.

Prop: Let I be a family of subsets of X, the following are equivalent:

This is why, in the context of filters, sets with the finite intersection property are called filter subbase.

Def: A family of prefilters {Fi}iI on a set X is compatible if there exists a prefilter FiIFi, i.e., iIFi is a filter subbase. This occurs iff every finite subset JI and any assignment jAjFj we have that jJAj.

Ultrafilters

Def: A filter U on S is an ultrafilter if for every XS, either XU or SXU.

Def: An ideal I on S is a prime ideal if for every XS, either XI or SXI

Lemma: A filter F on S is an ultrafilter iff F is a maximal filter.

Th: Let X be a set. The following are equivalent:

Th: Every filter F on S, can be extended to an ultrafilter on S.

Cor: Every centered family on S can be extended to an ultrafilter on S

Lemma: If C is a subset of filters on S and if every F1,F2C either F1F2 or F2F1, then the union of C is also a filter on S

There is a natural relation between ultrafilters and Measures. Let us call a content m on S two-valued if it only takes values 0 or 1; for every AS, m(A){0,1}.

Th:

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 X.

Th: Let X be a set, if X is finite there are |X| ultrafilters, if X is infinite, there are 22|X| ultrafilters

Cor: if X is infinite, there are 22|X| nonprincipal ultrafilters

Def: A nonempty family U of subsets of X is called ultra if U and for every SX, there exists BU, such that BS or BXS (or equivalently such that BS=B or BS=)

Prop: A nonempty family U of subsets of X is called ultra if U and any of the following equivalent are satisfied:

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 X is a prefilter U on X that satisfies any of the following equivalent conditions: