Filter (mathematics)

From Wikipedia, the free encyclopedia

You have new messages (last change).

In mathematics, a filter is a special subset of a partially ordered set. A frequently used special case is the situation that the ordered set under consideration is just the power set of some set, ordered by set inclusion. Filters appear in order and lattice theory, but can also be found in topology from where they originate. The dual notion of a filter is an ideal.

Filters were introduced by Henri Cartan in 1937[1][2] and subsequently used by Bourbaki in their book Topologie Générale as an alternative to the similar notion of a net developed in 1922 by E. H. Moore and H. L. Smith.

Contents

[edit] General definition

A non-empty subset F of a partially ordered set (P,≤) is a filter, if the following conditions hold:

  1. For every x, y in F, there is some element z in F, such that z ≤ x and z ≤ y. (F is a filter base)
  2. For every x in F and y in P, x ≤ y implies that y is in F. (F is an upper set)
  3. A filter is proper if it is not equal to the whole set P. This is often taken as part of the definition of a filter.

While the above definition is the most general way to define a filter for arbitrary posets, it was originally defined for lattices only. In this case, the above definition can be characterized by the following equivalent statement: A non-empty subset F of a lattice (P,≤) is a filter, if and only if it is an upper set that is closed under finite meets (infima), i.e., for all x, y in F, we find that x ∧ y is also in F.

The smallest filter that contains a given element p is a principal filter and p is a principal element in this situation. The principal filter for p is just given by the set {x in P | p ≤ x} and is denoted by prefixing p with an upward arrow.

The dual notion of a filter, i.e. the concept obtained by reversing all ≤ and exchanging ∧ with ∨, is ideal. Because of this duality, the discussion of filters usually boils down to the discussion of ideals. Hence, most additional information on this topic (including the definition of maximal filters and prime filters) is to be found in the article on ideals. There is a separate article on ultrafilters.

[edit] Filter on a set

A special case of a filter is a filter defined on a set. Given a set S, a partial ordering ⊆ can be defined on the powerset P(S) by subset inclusion, turning (P(S),⊆) into a lattice. A filter F on S is then a subset of P(S) with the following properties:

  1. S is in F. (F is non-empty)
  2. The empty set is not in F. (F is proper)
  3. If A and B are in F, then so is their intersection. (F is closed under finite meets)
  4. If A is in F and A is a subset of B, then B is in F, for all subsets B of S. (F is an upper set)

The first three properties imply that a filter has the finite intersection property.

A filter base is a subset B of P(S) with the following properties

  1. The intersection of any two sets of B contains a set of B
  2. B is non-empty and the empty set is not in B

A filter base B can be turned into a filter by including all sets of P(S) which contain a set of B.

Given a subset T of P(S) we can ask whether there exists a smallest filter F containing T. Such a filter exists if and only if the finite intersection of subsets of T is non-empty. We call T a subbase of F and say F is generated by T. F can be constructed by taking all finite intersections of T which is then filter base for F.

[edit] Examples

  • A simple example of a filter is the set of all subsets of S that include a particular subset C of S. Such a filter is called the principal filter generated by C.
  • The Fréchet filter on an infinite set S is the set of all subsets of S that have finite complement.

[edit] Filters in model theory

For any filter F on a set S, the set function defined by

m(A)=\left\{ \begin{matrix} \,1 & \mbox{if }A\in F \\ \,0 & \mbox{if }S\setminus A\in F \\ \,\mbox{undefined} & \mbox{otherwise} \end{matrix} \right.

is finitely additive -- a "measure" if that term is construed rather loosely. Therefore the statement

\left\{\,x\in S: \varphi(x)\,\right\}\in F

can be considered somewhat analogous to the statement that φ holds "almost everywhere". That interpretation of membership in a filter is used (for motivation, although it is not needed for actual proofs) in the theory of ultraproducts in model theory, a branch of mathematical logic.

[edit] Filters in topology

In topology and analysis, filters are used to define convergence in a manner similar to the role of sequences in a metric space.

Given a point x the set of all neighbourhoods of x is a filter, Nx. A (proper) filter which is a superset of Nx is said to converge to x, written F \to x. Note that if F \to x and F \subseteq G then G \to x. A filter is said to cluster at x if every neighbourhood of x meets every member of the filter.

Given a filter F on a set X and a function f : X \to Y, the set \{ f(A) : A \in F \} forms a filter base for a filter which, in a slight abuse of notation, we denote by f(F).

The following useful results hold:

  1. X is a Hausdorff space if and only if every filter on X has at most one limit (i.e., converges to at most one point x).
  2. f is continuous at x if and only if F \to x implies f(F) \to f(x)
  3. X is compact if and only if every filter on X is a subset of a convergent filter.
  4. X is compact if and only if every ultrafilter on X converges.

The neighbourhood system for a non empty set A is a filter called the neighbourhood filter for A.

[edit] Filters in uniform spaces

Given a uniform space X, a filter F on X is called Cauchy filter if for every U in the entourage, there is an A \in F with (x, y) \in U for every x, y \in A. In a metric space this takes the form F is Cauchy if for every \epsilon > 0 \ \ \exists A \in F \ \ \mathrm{diam}(A) < \epsilon. X is said to be complete if every Cauchy filter converges.

Let F \subseteq G , \ \ G \to x, \ F Cauchy. Then F \to x. Thus every compact uniformity is complete. Further, a uniformity is compact if and only if it is complete and totally bounded.

[edit] See also

[edit] References

  1. ^ H. Cartan, "Thèorie des filtres". CR Acad. Paris, 205, (1937) 595–598.
  2. ^ H. Cartan, "Filtres et ultrafiltres" CR Acad. Paris, 205, (1937) 777–779.
  • Stephen Willard, General Topology, (1970) Addison-Wesley Publishing Company, Reading Massachusetts. (Provides an introductory review of filters in topology.)
  • David MacIver, Filters in Analysis and Topology (2004) (Provides an introductory review of filters in topology and in metric spaces.)
  • Burris, Stanley N., and H.P. Sankappanavar, H. P., 1981. A Course in Universal Algebra. Springer-Verlag. ISBN 3-540-90578-2.
Retrieved from "http://en.wikipedia.org../../../f/i/l/Filter_%28mathematics%29.html"