Filters in topology

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics, a filter on a set is a collection of nonempty subsets which is upward closed and closed under finite intersections (see Filter on a set for a more detailed discussion). An example of filter is the collection of neighborhoods of a point in a topological space. This article is focused on applications of filters to topology.

Filters were introduced by Henri Cartan in 1937[1][2] as an alternative to the related notion of a net developed in 1922 by E. H. Moore and Herman L. Smith. In metric spaces, and more generally in sequential spaces, basic topological notions such as open set, closed set, convergence, continuity, compactness and more can be fully characterized in terms of sequences, as studied in real analysis. But in other classes of spaces, sequences are insufficient. Filters and nets both provide ways to generalize the notion of convergence and characterize all these topological notions in general topological spaces. Filters also provide a common framework for defining various types of limits of functions, including limits from the left or right, to infinity, to a point or a set.

In particular, filters and nets provide equivalent notions of convergence: to each net one can associate a filter, and to each filter a net, so that the net converges to a point if and only if the same is true of the associated filter, and vice versa. So the use of one or the other is often a matter of convenience.

Besides characterizing topological notions, filters and ultrafilters, which are a special type of filter, are used extensively in general topology for constructing topological spaces of interest.

Definitions

Template:Main

Let X be a set and 𝔓(X) the power set of it.

A filter β„± is a subset of 𝔓(X)βˆ’{βˆ…} having the properties:

  1. (upward closed) for a subset TβŠ‚X, if TβŠƒS for some Sβˆˆβ„±, then Tβˆˆβ„±.
  2. (directed downward) for each finite subset β„°βŠ‚β„±, the intersection of β„° contains a set in β„±.[3]

By (1), the intersection of β„° in (2) itself is in β„±. Taking β„° to be the empty set, (2) then implies X is in β„±, by the convention that the intersection of the empty set is the entire set.

A subset of 𝔓(X)βˆ’{βˆ…} is called a filter base if it satisfies condition (2).[4] A family ℬ of subsets of X is a filter base if and only if ℱℬ:=⋃Sβˆˆβ„¬{Tβˆˆπ”“(X)∣TβŠƒS} is a filter (in short, ℱℬ is the upper closure of B).[5] Then, the filter ℱℬ is the smallest filter containing ℬ; ℱℬ is called the filter generated by ℬ and ℬ called a base for ℱℬ.

In topology, these notions are used when X is a topological space. For example, a neighborhood base at a point x is a filter base[6] and the filter it generates is the set of subsets of X containing a neighborhood of x (the neighborhood filter of the point[7]).

A base for the space is generally not a filter base since it may contain disjoint sets, but the subset of a base consisting of all sets containing some given nonempty set is a filter base.

In practice, filter bases are often more convenient than filters, and some authors (e.g., Dugundji) exclusively work with filter bases instead of filters.

Finite intersection property

Template:Main

A subset β„°βŠ‚π”“(X) is said to have the finite intersection property if each finite subset of it has nonempty intersection. Any filter is an example of a family of sets with the finite intersection property. In fact, more generally, each subset of a filter has the finite intersection property.

Conversely, if a family of sets β„° has the finite intersection property, then it is contained in a filter (namely, the filter generated by all intersections of finite subsets of β„°).[8]

Convergence

A filter base ℬ is said to converge to a point p if each neighborhood of p contains a set in ℬ, or, equivalently, if the filter generated by ℬ contains every neighborhood of p.[9] Such a p is then called a limit point of ℬ. A filter base may have no limit point, or one or more limit points.

Convergence of filters generalizes the convergence of sequences. First, a sequence (xn)nβˆˆβ„• gives rise to a filter base: letting Tn={xm∣mβ‰₯n}, then ℬ={Tn∣nβˆˆβ„•} is a filter base. That ℬ converges to a point p means that for each neighborhood U of p, there is some n such that UβŠƒTn.[10] This is the same as saying that the sequence (xn)nβˆˆβ„• converges to p.

Many standard topological properties can be stated using convergence of filter bases. For example:

  • Given a subset EβŠ‚X, a point p is in the closure Eβ€Ύ of E if and only if there is a filter base ℬ on E converging to p.[11]
  • A function f:Xβ†’Y between spaces is continuous at a point a if and only if for each filter base ℬ converging to a, the filter base f(ℬ):={f(S)∣Sβˆˆβ„¬} converges to f(a).[12]
    In fact, it is enough to use a neighborhood base: if f(N(a)) converges to f(a), then f is continuous at a.[13]
  • The space X is a Hausdorff space if and only if each filter base converges to at most one point.[14]

Closely related to convergence is the notion of a cluster point (also called an accumulation point). Given a filter base ℬ, each point in the intersection β‹‚Sβˆˆβ„¬Sβ€Ύ is called a cluster point of ℬ.[15] Equivalently, a point p is a cluster point if ℬβˆͺN(p) has the finite intersection property where N(p) is the neighborhood base at p. Thus,

{cluster points of β„¬}={limit points of β„±βˆ£a filter β„±βŠƒβ„¬}.[16]

(On a first countable space, a cluster point of a sequence is exactly the limit point of some subsequence; thus, passing to larger filters is an analog of passing to subsequences.)

First countable spaces

For first countable spaces (meaning each point has a countable neighborhood base), sequences often suffice, in that filters capture no extra information about the topology.[17]

A filter is called an elementary filter if it has a filter base of the form ℬ={Tn∣nβˆˆβ„•}, where Tn={xm∣mβ‰₯n} for some sequence (xn)nβˆˆβ„•.[18] Template:Math theorem Proof: If β„± has a countable filter base ℬ, enumerate it as ℬ={Bn∣nβˆˆβ„€>0}. Then β„± is also generated by {B1βˆ©β‹―βˆ©Bn∣n}, so one can assume that B1βŠƒB2βŠƒβ‹―. Using the notation of the definition of elementary filter, Bn=βˆͺℬ′Tn, where ℬ′ runs over all filter bases determined by sequences xj∈Bj,jβˆˆβ„•. Then ℱℬ=βˆ©β„¬′ℱℬ′ and the intersection in the claim lies between these two sets. β—»

The proof above implies that to show a filter base of the form B1βŠƒB2βŠƒβ‹― converges to a point, it is necessary and sufficient that every sequence xn∈Bn converges to that point.

Here is a similar result: let ℬ be a filter base of the form B1βŠƒB2βŠƒβ‹― on a first countable space X. Then a point p is a cluster point of ℬ if and only if there is a sequence xn∈Bn converging to p.[19] As a corollary, for a first countable space, a cluster point of a sequence is the same as a limit of some subsequence.

Compact spaces

One important feature of filters is a characterization of compactness that generalizes the standard sequential characterization in real analysis.

By definition, an ultrafilter is a maximal element in the set of all filters on a set X. Equivalently, a family 𝔉 of subsets of X is an ultrafilter if and only if (1) it has the finite intersection property and (2) for some finitely many subsets S1,…,Sn of X, we have

βˆͺ1nSiβˆˆπ”‰β‡’Siβˆˆπ”‰

for some i.[20] (Note the condition (2) is analogous to the definition of a prime ideal.)

Zorn's lemma[21] implies that any filter is contained in some ultrafilter.

Restating the definition of compactness in terms of closed sets, we have a space X is compact if and only if each family of closed subsets with the finite intersection property (FIP) has nonempty intersection.

For example, if β„°={Sβ€Ύβˆ£Sβˆˆβ„³} for an ultrafilter β„³, then βˆ©β„°={limit points of β„³} since pβˆˆβˆ©β„°β‡”β„³βˆͺN(p) has FIPβ‡”β„³βŠƒβ„³βˆͺN(p) by maximality. Conversely, every family β„° of closed sets with FIP is contained in an ultrafilter and the limit points of that ultrafilter lie in βˆ©β„°.

From the above discussion follows the characterization of compactness in terms of filters: Template:Math theorem

Tychonoff's theorem

(Tychonoff's theorem) An arbitrary product of compact spaces is compact.Template:Sfn

This fundamental result of topology follows immediately from the above ultrafilter characterization of compact spaces together with the following general facts[22]:

  1. If ℱ is an ultrafilter and h:X→Y a function, then h(ℱ) is a base for an ultrafilter.[23]
  2. Suppose the topology on X is the initial topology with respect to a family of functions hi:Xβ†’Y,i∈I. Then a filter β„± converges to x if and only if hi(β„±) converges to hi(x) for each i∈I.[24] (This in fact characterizes initial topology; see Template:Section link below.)

Quasi-components

There is also the following characterization of compactness in terms of filter bases.

Template:Math theorem

The above can then be used to prove:

  • if X is a compact Hausdorff space, then each quasi-component in X is connected, where the quasi-component of a point x is the intersection of all clopen sets containing x.[25]

Indeed, first of all, all the clopen sets containing a given point form a filter base ℬ and the set of cluster points of ℬ is exactly the quasi-component Q of the point. Now, if Q=FβˆͺG is a union of disjoint nonempty closed sets, then apply the above proposition to the union of some disjoint neighborhoods of F,G, which exist by normality; a contradiction follows readily.

Compactifications and completions

Stoneβ€“ΔŒech compactification

Template:Main For each Tychonoff space X, there is a compact Hausdorff space Ξ²X called its Stoneβ€“ΔŒech compactification. This space contains a copy of X as a dense subspace, and is universal in that every continuous map from X to a compact space can be extended to a continuous map from Ξ²X to the same compact space.Template:Sfn Stoneβ€“ΔŒech compactifications, especially that of β„• with the discrete topology, are an important topic of research in general topology.[26]

The points of Ξ²β„• are the ultrafilters on β„•, and the sets of the form A′:={β„±βˆˆΞ²β„•βˆ£Aβˆˆβ„±}, where A is any subset of β„•, are a basis for its topology.[27] There is an analogous construction, using filters, of Ξ²X for any Tychonoff space X.Template:Sfn

Cauchy filters and uniform spaces

Template:See also

A Cauchy filter is a filter analog of a Cauchy sequence. On a metric space, by definition, a filter β„± is Cauchy if for each Ο΅>0, there is a set A of diameter <Ο΅ in β„±.[28] For example, on a metric space X,

  • A convergent filter is Cauchy.
  • The filter determined by a sequence is Cauchy if and only if the sequence is Cauchy.[29]
  • Every ultrafilter on X is Cauchy if for each Ο΅>0, X is covered by a finite number of open balls of diameter <Ο΅; i.e., it is totally bounded.

Cauchy filters generalize to uniform spaces, which are sets equipped with the additional structure of a filter of entourages, subsets of XΓ—X satisfying certain properties. A filter β„± on a uniform space X is a Cauchy filter if for each entourage V, there is a set A in β„± such that AΓ—AβŠ‚V.[30] Cauchy filters can be used to construct a completion Xβ€Ύ of any uniform spaceβ€”that is, a uniform space containing it in which every Cauchy filter convergesβ€”called its Hausdorff completion. The underlying set is the set of minimal Cauchy filters.

Uniform convergence

The notions of pointwise convergence and uniform convergence in real analysis also generalize to filters.

Let Y be a metric space (or more generally, a uniform space) and write F(A,Y) for the set of all maps A→Y for a set A.

Note F(A,Y)=∏a∈AY. Then with respect to the product topology, a filter β„± on F(A,Y) converges to a map u if and only if pa(F) converges to pa(u)=u(a) for each projection pa; in such a case, β„± is said to converge pointwise to u.[31]

Now, a filter β„± on F(A,Y) is said to converge uniformly to a map u if for each Ο΅>0, β„± contains

{f:Aβ†’Y∣d(f(x),u(x))<Ο΅,x∈A},

when Y is a metric space (and use an analogous condition in terms of entourages if Y is a general uniform space).[32] Filter bases converge uniformly or pointwise if the filters generated by them do so.

Equivalently, β„± converges uniformly to u if and only if (1) it is a Cauchy filter in the sense like above and (2) it converges pointwise to u.[33]

Uniform convergence can then be used just as in real analysis. For example, we have:

  • Let X be a compactly generated Hausdorff space (e.g., a locally compact space or a first countable Hausdorff space), ℬ a filter base on C(X,Y) and u:Xβ†’Y a map. If pA(ℬ) converges uniformly to pA(ℬ)=u|A for each restriction map pA to a compact set A, then u is continuous.[34]

Nets and filters

Nets provide another way to generalize sequences, and are used more commonly than filters in certain areas of research (especially real analysis).

A sequence (xn)nβˆˆβ„• on a space X is the same as a map from β„• to X, sending each n to xn. The notion of a net is obtained by replacing β„• in this scenario with a more general directed set. Explicitly, a net on a space X is a map Iβ†’X with domain a nonempty set I equipped with binary relation ≲, which is a preorder and under which every finite subset of I has an upper bound.[35] Like a sequence, a net may be written (xΞ±)α∈I, or even just xΞ± where xΞ± is the image of α∈I.

Each net (xΞ±)α∈I determines a filter base and vice-versa; this correspondence gives rise to the equivalence between these two generalizations of sequences. Given a net (xΞ±)α∈I, let TΞ±={xΞ²βˆ£Ξ²β‰³Ξ±}. Then ℬ={Tα∣α∈I} is the filter base determined by the net (xΞ±)α∈I. The convergence of nets is defined in the article on nets, and under this definition, (xΞ±)α∈I converges to a point p if and only if the filter base ℬ determined by it converges to p.[35]

Conversely, given a filter base ℬ, let J={(a,x)∣aβˆˆβ„¬,x∈a}. Define the binary relation ≲ on J by (a,x)≲(b,y)⇔aβŠƒb. Then the projection u:Jβ†’X,(a,x)↦x, as a function from the directed set J to X, is the net determined by ℬ; the filter base ℬ converges to a point p∈X if and only if u converges to p.

For example, if u:Jβ†’X is the net associated to a filter 𝔉, then the filter base determined by it is the original filter 𝔉.[36] In particular, every filter is a filter associated to a net.

Because the respective notions of convergence based on nets and filters are equivalent as described above, characterizations of topological properties using filters can always be restated in terms of nets. For example:

Template:Math theorem

Topologies induced by filters

A topology on a given set can be defined in several ways (in terms of open sets, by specifying a closure operator, etc.) Filters give another way to define a topology.[37] Namely, for a set X and each x in X, let 𝔣x be a set of filters on X. Let Ο„(𝔣) be the set of all subsets UβŠ‚X such that if x∈U, then Uβˆˆβ„± for each β„±βˆˆπ”£x. Then Ο„(𝔣) is a topology.[38] For example, when X is a topological space to begin with and 𝔣x is the set of all filters converging to x, this construction returns the original topology.

If the topology on X is the initial topology Ο„0 for a family of functions fi:Xβ†’Yi,i∈I, then letting 𝔣x={β„± a filter∣fi(β„±)β†’fi(x),i∈I}, it follows that Ο„0=Ο„(𝔣) since 𝔣x coincides with the set of filters converging to x. So the product topology, which is initial with respect to the projection maps, is the topology given by pointwise convergence of filters.

Given a family of filters 𝔣, it is not necessarily true that there is a topology Ο„ such that 𝔣x is exactly the set of filters converging to x: filters in 𝔣x converge to x with respect to Ο„(𝔣), but there may be additional convergent filters. One example occurs in the theory of function spaces (cf. Template:Section link).[39] This led some authors to enlarge the category of topological spaces by replacing a topology (= set of open sets) with a certain family of filters called a convergence structure.[40] Such generalizations of topological spaces are also studied in categorical topology.

Notes

Template:Reflist

References

Further reading

  • Mike Shulman (2008); Ultrafilters, Pseudotopological spaces, and Stone-Čech compactification; [2]
  1. ↑ Template:Cite journal
  2. ↑ Template:Cite journal
  3. ↑ Template:Harvnb
  4. ↑ Template:Harvnb
  5. ↑ Template:Harvnb
  6. ↑ Template:Harvnb
  7. ↑ Template:Harvnb
  8. ↑ Template:Harvnb
  9. ↑ Template:Harvnb
  10. ↑ Template:Harvnb
  11. ↑ Template:Harvnb
  12. ↑ Template:Harvnb
  13. ↑ Template:Harvnb
  14. ↑ Template:Harvnb
  15. ↑ Template:Harvnb
  16. ↑ Template:Harvnb
  17. ↑ Template:Harvnb
  18. ↑ Template:Harvnb
  19. ↑ Template:Harvnb
  20. ↑ Template:Harvnb
  21. ↑ Actually the boolean prime ideal theorem suffices.
  22. ↑ Template:Harvnb
  23. ↑ Template:Harvnb
  24. ↑ Template:Harvnb
  25. ↑ Template:Harvnb
  26. ↑ Template:Harvnb.
  27. ↑ Template:Harvnb.
  28. ↑ Template:Harvnb
  29. ↑ Template:Harvnb
  30. ↑ Template:Harvnb
  31. ↑ Template:Harvnb
  32. ↑ Template:Harvnb
  33. ↑ Template:Harvnb
  34. ↑ Template:Harvnb
  35. ↑ 35.0 35.1 Template:Harvnb
  36. ↑ Namely, {T(a,x)∣(a,x)∈J} where T(a,x)={u(b,y)∣(b,y)β‰₯(a,x)}=a; i.e., which is the original filter.
  37. ↑ Template:Harvnb
  38. ↑
    • If U:=⋃iUi for UiβˆˆΟ„, i∈I, then unless empty, U has a point x and x∈Ui for some i and then U is in each β„±βˆˆπ”£x since it contains a member of β„±; namely, Ui.
    • For U1,…,Un in Ο„, if U:=β‹‚iUi contains a point x, then U is in each β„±βˆˆπ”‰x since {U1,…,Un}βŠ‚β„±.
  39. ↑ Template:Harvnb
  40. ↑ Template:Harvnb