[go: nahoru, domu]

nLab filter (Rev #5, changes)

Showing changes from revision #4 to #5: Added | Removed | Changed

A filter is dual to an ideal.

Definitions

A subset FF of a poset LL is called a filter if it is upward-closed and downward-directed; that is: 1. If ABA \leq B in LL and AFA \in F, then BFB \in F; 1. for some AA in LL, AFA \in F; 1. if AFA \in F and BFB \in F, then for some CFC \in F, CAC \leq A and CBC \leq B.

Somtimes Sometimes the term ‘filter’ is used for anupper set, that is any set satisfying axiom (1). (Ultimately this connects with the use of ‘ideal’ in monoid theory.)

In a lattice, one can use these alternative axioms: 1. If AFA \in F and BB in LL, then ABFA \vee B \in F; 1. F\top \in F; 1. if AFA \in F and BFB \in F, then ABFA \wedge B \in F.

Here, (1) is equivalent to the previous version; the others, which here say that the lattice is closed under finite meets, are equivalent given (1). (These axioms look more like the axioms for an ideal of a ring.)

You can also interpret these axioms to say that, if you interpret FF as a function from LL to the set TVTV of truth values, that FF is a homomorphism of meet-semilattices.

A filter of subsets of a given set SS is a filter in the power set of SS. One also sees filters of open subsets, filters of compact subsets, etc.

Kinds of filters

A filter FF is proper if there exists an element AA of LL such that AFA \notin F. A filter in a lattice is proper iff F\bot \notin F; in particular, a filter of subsets of SS is proper iff F\empty \notin F. In constructive mathematics, however, one usually wants a stronger (but classically equivalent) notion: a filter FF of subsets of SS is proper if every element of FF is inhabited.

Filters are often assumed to be proper by default in analysis and topology, where proper filters correspond to nets. However, we will try to remember to include the adjective ‘proper’.

If the complement of a filter is an ideal, then we say that the filter is prime (and equivalently that the ideal is prime). A prime filter is necessarily proper; a proper filter in a lattice is prime iff, whenever ABFA \cup B \in F, either AFA \in F or BFB \in F. In other words, F:LTVF: L \to TV must be a homomorphism of lattices.

In nonstandard analysis and model theory, a particularly important class of filters are the ultrafilter s. A filter is anultrafilter, or maximal filter, if it is maximal among the proper filters. A filter FF in a Boolen lattice is an ultrafilter iff, given any subset AA of SS, either AA or its complement belongs to FF but not both. In constructive mathematics, an ultrafilter is a filter of sets satisfying the axiom

AF(BF),(xAB). A \in F \;\Leftrightarrow\; \forall (B \in F),\; \exists (x \in A \cap B) .

This is equivalent to the previous definition, using excluded middle.

In a distributive lattice, every ultrafilter is prime; the converse holds in a Boolean lattice. In this case, we can say that F:LTVF: L \to TV is a homomorphism of Boolean lattices.

Given an element xx of SS, the principal ultrafilter (of subsets of SS) at xx consists of every subset of SS to which xx belongs. It is possible, if one denies the axiom of choice, that every ultrafilter of subsets is principal. In contrast, the Boolean prime ideal theorem? states that any proper filter (in a Boolean lattice) may be extended to a maximal filter.

Filterbases

A subset FF of a lattice LL is a filterbase if it becomes a filter when closed under axiom (1). Equivalently, a filterbase is any downward-directed subset. Any subset of a meet-semilattice may be used as a filter subbase; form a filterbase by closing under finite meets.

A filterbase FF of sets is proper (that is, it generates a proper filter of sets) iff each set in FF is inhabited. A filter subbase of sets is proper iff it satisfies the finite intersection property (well known in topology from a criterion for compact spaces): every finite collection from the subfilter has inhabited intersection.

Application to analysis and topology

Every net ν:IS\nu: I \to S defines an eventuality filter E νE_\nu: let AA belong to E νE_\nu if, for some index kk, for every lkl \geq k, ν lA\nu_l \in A. (That is, ν\nu is eventually in AA.) Note that E νE_\nu is proper; conversely, any proper filter FF has a net whose eventuality filter is FF (as described at net). Everything below can be done for nets as well as filters, but filters often lead to a cleaner theory.

Convergent filters

A convergence space is a set SS together with a relation \to from S\mathcal{F}S to SS, where S\mathcal{F}S is the set of filters on SS, satisfying some axioms. (If FxF \to x, we say that FF converges to xx.) The axioms are these: 1. If FGF \subseteq G and FxF \to x, then GxG \to x; 1. The principal ultrafilter at xx converges to xx; 1. If FxF \to x and GxG \to x, then FGxF \cap G \to x; 1. If FxF \to x and AFA \in F, then xAx \in A.

In other words, the set of filters that converge to xx is a filter of subsets of the set of subfilters of the principal ultrafilter at xx. (But that is sort of a tongue twister.)

The morphisms of convergence spaces are the continuous functions; a function ff between convergence spaces is continuous if FxF \to x implies that f(F)f(x)f(F) \to f(x), where f(F)f(F) is the filter generated by the filterbase {F(A)|AF}\{F(A) \;|\; A \in F\}. In this way, convergence spaces form a category ConvConv.

Any topological space is a convergence space: FxF \to x if every neighbourhood of xx belongs to FF. A convergence space is topological if it comes from a topology on SS. The full subcategory of ConvConv consisting of the topological convergence spaces is equivalent to the category Top of topological spaces. In this way, the definitions in this section all become theorems about topological spaces. However, not every convergence in analysis is topological; convergence in measure is a good counterexample.

Note that the improper filter (the power set of SS) converges to every point. Conversely, a convergence space SS is Hausdorff if every proper filter converges to at most one point; then we have a partial function lim\lim from S\mathcal{F}S to SS.

A convergence space SS is compact if every proper filter is contained in a convergent filter. Equivalently (assuming the Boolean prime ideal theorem), SS is compact iff every ultrafilter converges.

Cauchy filters

A Cauchy space is a set SS together with a collection of filters declared to be Cauchy filters. These must satisfy axioms: 1. If FGF \subseteq G, FF is Cauchy, and GG is proper, then GG is Cauchy; 1. Every principal ultrafilter is Cauchy; 1. If FF and GG are Cauchy and FGF \cap G is proper, then FGF \cap G is Cauchy; 1. Every Cauchy filter is proper.

In other words, the set of Cauchy filters is a filter of subsets of the set of proper filters (another tongue twister).

The morphisms of Cauchy spaces are the Cauchy functions; a function ff between Cauchy spaces is Cauchy if f(F)f(F) is Cauchy whenever FF is. In this way, Cauchy spaces form a category CauchyCauchy.

Any metric space is a Cauchy space: FF is Cauchy if it has elements of arbitrarily small diameter. (In particular, a sequence is a Cauchy sequence iff its eventuality filter is Cauchy.) In this way, the category of metric spaces becomes a subcategory (but not a full one) of CauchyCauchy. (This can be generalised to uniform spaces; the inclusion is still not full.)

Every Cauchy space is a convergence space; FxF \to x if the intersection of FF with the principal ultrafilter at xx is Cauchy. Note that any convergent proper filter must be Cauchy. Conversely, if every Cauchy filter is convergent, then the Cauchy space is called complete.

A Cauchy space SS is totally bounded (or precompact) if every proper filter is contained in a Cauchy filter. Equivalently (assuming the Boolean prime ideal theorem), SS is totally bounded iff every ultrafilter is Cauchy.

A Cauchy space is compact (as a convergence space) if and only if it is both complete and totally bounded.

References

  • Wikipedia.
  • Johnstone, Peter T. (1982). Stone Spaces. Cambridge University Press. ISBN 0-521-23893-5.
  • Eva Lowen-Colebunders (1989). Function Classes of Cauchy Continuous Maps. Dekker, New York, 1989.

Revision on March 20, 2009 at 19:20:27 by Zoran Škoda See the history of this page for a list of all contributions to it.