ConceptComplete

Nets and Filters

In metric spaces, sequences suffice to characterize the topology: closures, continuity, and compactness can all be described via convergent sequences. In general topological spaces, sequences are inadequate, and two more powerful tools -- nets and filters -- take their place.


Directed Sets and Nets

Definition8.1Directed Set

A directed set (I,βͺ―)(I, \preceq) is a nonempty set II with a preorder βͺ―\preceq (reflexive and transitive) such that for every Ξ±,β∈I\alpha, \beta \in I, there exists γ∈I\gamma \in I with Ξ±βͺ―Ξ³\alpha \preceq \gamma and Ξ²βͺ―Ξ³\beta \preceq \gamma.

Definition8.2Net

A net in a topological space XX is a function x:Iβ†’Xx: I \to X from a directed set II to XX, written (xΞ±)α∈I(x_\alpha)_{\alpha \in I}.

A net (xΞ±)(x_\alpha) converges to x∈Xx \in X, written xΞ±β†’xx_\alpha \to x, if for every open neighborhood UU of xx, there exists Ξ±0∈I\alpha_0 \in I such that xα∈Ux_\alpha \in U for all Ξ±βͺ°Ξ±0\alpha \succeq \alpha_0.

ExampleExamples of Nets
  1. Sequences: A sequence is a net indexed by (N,≀)(\mathbb{N}, \leq).

  2. Neighborhood nets: For x∈Xx \in X, let I=N(x)I = \mathcal{N}(x) (the neighborhood system of xx) directed by reverse inclusion: Uβͺ―VU \preceq V iff UβŠ‡VU \supseteq V. For each U∈IU \in I, choose xU∈Ux_U \in U. Then (xU)(x_U) is a net converging to xx.

  3. Riemann sums: The net of Riemann sums of a function ff on [a,b][a, b], indexed by partitions ordered by refinement, converges to ∫abf\int_a^b f (when the integral exists).


Nets Characterize the Topology

Theorem8.1Nets Characterize Closure and Continuity

Let XX be a topological space.

  1. Closure: x∈Aβ€Ύx \in \overline{A} if and only if there exists a net (xΞ±)(x_\alpha) in AA converging to xx.
  2. Continuity: f:X→Yf: X \to Y is continuous if and only if for every net (xα)(x_\alpha) converging to xx in XX, the net (f(xα))(f(x_\alpha)) converges to f(x)f(x) in YY.
  3. Hausdorff: XX is Hausdorff if and only if every net in XX converges to at most one point.
Proof

(1, ⇐\Leftarrow): If (xΞ±)β†’x(x_\alpha) \to x with xα∈Ax_\alpha \in A, every open Uβˆ‹xU \ni x contains some xα∈Ax_\alpha \in A, so x∈Aβ€Ύx \in \overline{A}.

(1, β‡’\Rightarrow): If x∈Aβ€Ύx \in \overline{A}, let II be the collection of open neighborhoods of xx, directed by reverse inclusion. For each U∈IU \in I, U∩Aβ‰ βˆ…U \cap A \neq \emptyset; choose xU∈U∩Ax_U \in U \cap A. Then (xU)(x_U) is a net in AA converging to xx.

β– 

Filters

Definition8.3Filter

A filter on a set XX is a nonempty collection FβŠ†P(X)\mathcal{F} \subseteq \mathcal{P}(X) satisfying:

  1. βˆ…βˆ‰F\emptyset \notin \mathcal{F}.
  2. If A,B∈FA, B \in \mathcal{F}, then A∩B∈FA \cap B \in \mathcal{F} (closed under finite intersections).
  3. If A∈FA \in \mathcal{F} and AβŠ†BβŠ†XA \subseteq B \subseteq X, then B∈FB \in \mathcal{F} (upward closed).
Definition8.4Filter Convergence

A filter F\mathcal{F} on a topological space XX converges to xx, written Fβ†’x\mathcal{F} \to x, if F\mathcal{F} contains all neighborhoods of xx: N(x)βŠ†F\mathcal{N}(x) \subseteq \mathcal{F}.

A filter F\mathcal{F} clusters at xx (or xx is a cluster point of F\mathcal{F}) if every F∈FF \in \mathcal{F} intersects every neighborhood of xx.

ExampleExamples of Filters
  1. Neighborhood filter: N(x)={NβŠ†X:x∈int⁑(N)}\mathcal{N}(x) = \{N \subseteq X : x \in \operatorname{int}(N)\} is the smallest filter converging to xx.

  2. Principal filter: For nonempty AβŠ†XA \subseteq X, FA={BβŠ†X:AβŠ†B}\mathcal{F}_A = \{B \subseteq X : A \subseteq B\} is a filter (the principal filter generated by AA).

  3. Fr'echet filter: On an infinite set XX, the collection of cofinite subsets {AβŠ†X:Xβˆ–AΒ isΒ finite}\{A \subseteq X : X \setminus A \text{ is finite}\} is a filter.


Filter Base

Definition8.5Filter Base

A filter base (or filter basis) on XX is a nonempty collection BβŠ†P(X)\mathcal{B} \subseteq \mathcal{P}(X) such that:

  1. βˆ…βˆ‰B\emptyset \notin \mathcal{B}.
  2. For B1,B2∈BB_1, B_2 \in \mathcal{B}, there exists B3∈BB_3 \in \mathcal{B} with B3βŠ†B1∩B2B_3 \subseteq B_1 \cap B_2.

A filter base B\mathcal{B} generates a filter: ⟨B⟩={AβŠ†X:βˆƒB∈B,BβŠ†A}.\langle \mathcal{B} \rangle = \{A \subseteq X : \exists B \in \mathcal{B}, B \subseteq A\}.

RemarkNets vs. Filters

Nets and filters provide equivalent descriptions of topology. Every net generates a filter (the eventuality filter: A∈FA \in \mathcal{F} iff xα∈Ax_\alpha \in A eventually). Conversely, every filter generates a net. The choice between nets and filters is largely a matter of taste:

  • Nets are more intuitive (they generalize sequences directly).
  • Filters are more algebraic and have cleaner behavior under products and intersections.
  • Ultrafilters (maximal filters) are the key tool for proving Tychonoff's theorem.