Net (mathematics)

Short description: A generalization of a sequence of points

In mathematics, more specifically in general topology and related branches, a net or Moore–Smith sequence is a function whose domain is a directed set. The codomain of this function is usually some topological space. Nets directly generalize the concept of a sequence in a metric space. Nets are primarily used in the fields of Analysis and Topology, where they are used to characterize many important topological properties that (in general), sequences are unable to characterize (this shortcoming of sequences motivated the study of sequential spaces and Fréchet–Urysohn spaces). Nets are in one-to-one correspondence with filters.

History

The concept of a net was first introduced by E. H. Moore and Herman L. Smith in 1922. The term "net" was coined by John L. Kelley.

The related concept of a filter was developed in 1937 by Henri Cartan.

Definitions

A directed set is a non-empty set [math]\displaystyle{ A }[/math] together with a preorder, typically automatically assumed to be denoted by [math]\displaystyle{ \,\leq\, }[/math] (unless indicated otherwise), with the property that it is also (upward) directed, which means that for any [math]\displaystyle{ a, b \in A, }[/math] there exists some [math]\displaystyle{ c \in A }[/math] such that [math]\displaystyle{ a \leq c }[/math] and [math]\displaystyle{ b \leq c. }[/math] In words, this property means that given any two elements (of [math]\displaystyle{ A }[/math]), there is always some element that is "above" both of them (that is, that is greater than or equal to each of them); in this way, directed sets generalize the notion of "a direction" in a mathematically rigorous way. Importantly though, directed sets are not required to be total orders or even partial orders. Moreover, directed sets are allowed to have greatest elements and/or maximal elements, which is the reason why when using nets, caution is advised when using the induced strict preorder [math]\displaystyle{ \,\lt \, }[/math] instead of the original (non-strict) preorder [math]\displaystyle{ \,\leq }[/math]; in particular, if a directed set [math]\displaystyle{ (A, \leq) }[/math] has a greatest element [math]\displaystyle{ a \in A }[/math] then there does not exist any [math]\displaystyle{ b \in A }[/math] such that [math]\displaystyle{ a \lt b }[/math] (in contrast, there always exists some [math]\displaystyle{ b \in A }[/math] such that [math]\displaystyle{ a \leq b }[/math]).

A net in [math]\displaystyle{ X }[/math] [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] is a function of the form [math]\displaystyle{ x_\bull : A \to X }[/math] whose domain [math]\displaystyle{ A }[/math] is some directed set. Elements of a net's domain are called its indices. When the set [math]\displaystyle{ X }[/math] is clear from context it is simply called a net. Unless there is reason to think otherwise, it should automatically be assumed that the set [math]\displaystyle{ A }[/math] is directed and that its associated preorder is denoted by [math]\displaystyle{ \,\leq. }[/math] Notation for nets varies, with some authors using, for instance, angled brackets [math]\displaystyle{ \left\langle x_a \right\rangle_{a \in A} }[/math] instead of parentheses. The function's value at an element [math]\displaystyle{ a }[/math] in its domain is denoted by [math]\displaystyle{ x_a }[/math] instead of the usual parentheses notation [math]\displaystyle{ x_\bull(a) }[/math] that is typically used with functions. As in the field of algebraic topology, the filled disk or "bullet" denotes the location where arguments to the net (that is, elements [math]\displaystyle{ a \in A }[/math] of the net's domain) are placed; it helps emphasize that the net is a function and also reduces the number of indices and other symbols that must be written when referring to it later.

A net [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] is said to be eventually or residually in a set [math]\displaystyle{ S }[/math] if there exists some [math]\displaystyle{ a \in A }[/math] such that for every [math]\displaystyle{ b \in A }[/math] with [math]\displaystyle{ b \geq a, }[/math] the point [math]\displaystyle{ x_b \in S. }[/math] A point [math]\displaystyle{ x \in X }[/math] is called a limit point or limit of the net [math]\displaystyle{ x_\bull }[/math] in [math]\displaystyle{ X }[/math] if (and only if)

for every open neighborhood [math]\displaystyle{ U }[/math] of [math]\displaystyle{ x, }[/math] the net [math]\displaystyle{ x_\bull }[/math] is eventually in [math]\displaystyle{ U, }[/math]

in which case, this net is then also said to converge to/towards [math]\displaystyle{ x }[/math] and to have [math]\displaystyle{ x }[/math] as a limit. If the net [math]\displaystyle{ x_\bull }[/math] converges in [math]\displaystyle{ X }[/math] to a point [math]\displaystyle{ x \in X }[/math] then this fact may be expressed by writing any of the following: [math]\displaystyle{ \begin{alignat}{4} & x_\bull && \to\; && x && \;\;\text{ in } X \\ & x_a && \to\; && x && \;\;\text{ in } X \\ \lim_{} \; & x_\bull && \to\; && x && \;\;\text{ in } X \\ \lim_{a \in A} \; & x_a && \to\; && x && \;\;\text{ in } X \\ \lim_{} {}_a \; & x_a && \to\; && x && \;\;\text{ in } X \\ \end{alignat} }[/math] where if the topological space [math]\displaystyle{ X }[/math] is clear from context then the words "in [math]\displaystyle{ X }[/math]" may be omitted.

If [math]\displaystyle{ \lim_{} x_\bull \to x }[/math] in [math]\displaystyle{ X }[/math] and if this limit in [math]\displaystyle{ X }[/math] is unique (uniqueness in [math]\displaystyle{ X }[/math] means that if [math]\displaystyle{ y \in X }[/math] is such that [math]\displaystyle{ \lim_{} x_\bull \to y, }[/math] then necessarily [math]\displaystyle{ x = y }[/math]) then this fact may be indicated by writing [math]\displaystyle{ \lim_{} x_\bull = x \;~~ \text{ or } ~~\; \lim_{} x_a = x \;~~ \text{ or } ~~\; \lim_{a \in A} x_a = x }[/math] where an equals sign is used in place of the arrow [math]\displaystyle{ \to. }[/math] In a Hausdorff space, every net has at most one limit so the limit of a convergent net in a Hausdorff space is always unique. Some authors instead use the notation "[math]\displaystyle{ \lim_{} x_\bull = x }[/math]" to mean [math]\displaystyle{ \lim_{} x_\bull \to x }[/math] without also requiring that the limit be unique; however, if this notation is defined in this way then the equals sign [math]\displaystyle{ = }[/math] is no longer guaranteed to denote a transitive relationship and so no longer denotes equality. Specifically, without the uniqueness requirement, if [math]\displaystyle{ x, y \in X }[/math] are distinct and if each is also a limit of [math]\displaystyle{ x_\bull }[/math] in [math]\displaystyle{ X }[/math] then [math]\displaystyle{ \lim_{} x_\bull = x }[/math] and [math]\displaystyle{ \lim_{} x_\bull = y }[/math] could be written (using the equals sign [math]\displaystyle{ = }[/math]) despite [math]\displaystyle{ x = y }[/math] being false.

A net [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] is said to be frequently or cofinally in [math]\displaystyle{ S }[/math] if for every [math]\displaystyle{ a \in A }[/math] there exists some [math]\displaystyle{ b \in A }[/math] such that [math]\displaystyle{ b \geq a }[/math] and [math]\displaystyle{ x_b \in S. }[/math] A point [math]\displaystyle{ x \in X }[/math] is said to be an accumulation point or cluster point of a net if for every neighborhood [math]\displaystyle{ U }[/math] of [math]\displaystyle{ x, }[/math] the net is frequently/cofinally in [math]\displaystyle{ U. }[/math] A point [math]\displaystyle{ x \in X }[/math] is a cluster point of a given net if and only if it has a subset that converges to [math]\displaystyle{ x. }[/math] If [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] is a net in [math]\displaystyle{ X }[/math] then the set of all cluster points of [math]\displaystyle{ x_\bull }[/math] in [math]\displaystyle{ X }[/math] is equal to [math]\displaystyle{ \bigcap_{a \in A} \operatorname{cl}_X \left(x_{\geq a}\right) }[/math] where [math]\displaystyle{ x_{\geq a} := \left\{x_b : b \geq a, b \in A\right\} }[/math] for each [math]\displaystyle{ a \in A. }[/math]

Subnets

The analogue of "subsequence" for nets is the notion of a "subnet". There are several different non-equivalent definitions of "subnet" and this article will use the definition introduced in 1970 by Stephen Willard, which is as follows: If [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] and [math]\displaystyle{ s_\bull = \left(s_i\right)_{i \in I} }[/math] are nets then [math]\displaystyle{ s_\bull }[/math] is called a subnet or Willard-subnet of [math]\displaystyle{ x_\bull }[/math] if there exists an order-preserving map [math]\displaystyle{ h : I \to A }[/math] such that [math]\displaystyle{ h(I) }[/math] is a cofinal subset of [math]\displaystyle{ A }[/math] and [math]\displaystyle{ s_i = x_{h(i)} \quad \text{ for all } i \in I. }[/math] The map [math]\displaystyle{ h : I \to A }[/math] is called order-preserving and an order homomorphism if whenever [math]\displaystyle{ i \leq j }[/math] then [math]\displaystyle{ h(i) \leq h(j). }[/math] The set [math]\displaystyle{ h(I) }[/math] being cofinal in [math]\displaystyle{ A }[/math] means that for every [math]\displaystyle{ a \in A, }[/math] there exists some [math]\displaystyle{ b \in h(I) }[/math] such that [math]\displaystyle{ b \geq a. }[/math]

Under Willard's definition, a subnet of a sequence is not necessarily a sequence. However, if [math]\displaystyle{ x \in X }[/math] is a cluster point of some subnet of [math]\displaystyle{ x_\bull }[/math] then [math]\displaystyle{ x }[/math] is also a cluster point of [math]\displaystyle{ x_\bull. }[/math]

Ultranets

A net [math]\displaystyle{ x_\bull }[/math] in set [math]\displaystyle{ X }[/math] is called a universal net or an ultranet if for every subset [math]\displaystyle{ S \subseteq X, }[/math] [math]\displaystyle{ x_\bull }[/math] is eventually in [math]\displaystyle{ S }[/math] or [math]\displaystyle{ x_\bull }[/math] is eventually in the complement [math]\displaystyle{ X \setminus S. }[/math]

Every constant net is an ultranet. Every subnet of an ultranet is an ultranet. Every net has some subnet that is an ultranet. If [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] is an ultranet in [math]\displaystyle{ X }[/math] and [math]\displaystyle{ f : X \to Y }[/math] is a function then [math]\displaystyle{ f \circ x_\bull = \left(f\left(x_a\right)\right)_{a \in A} }[/math] is an ultranet in [math]\displaystyle{ Y. }[/math]

Given [math]\displaystyle{ x \in X, }[/math] an ultranet clusters at [math]\displaystyle{ x }[/math] if and only it converges to [math]\displaystyle{ x. }[/math]

Cauchy nets

A Cauchy net generalizes the notion of Cauchy sequence to nets defined on uniform spaces.

A net [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] is a Cauchy net if for every entourage [math]\displaystyle{ V }[/math] there exists [math]\displaystyle{ c \in A }[/math] such that for all [math]\displaystyle{ a, b \geq c, }[/math] [math]\displaystyle{ \left(x_a, x_b\right) }[/math] is a member of [math]\displaystyle{ V. }[/math] More generally, in a Cauchy space, a net [math]\displaystyle{ x_\bull }[/math] is Cauchy if the filter generated by the net is a Cauchy filter.

A topological vector space (TVS) is called complete if every Cauchy net converges to some point. A normed space, which is a special type of topological vector space, is a complete TVS (equivalently, a Banach space) if and only if every Cauchy sequence converges to some point (a property that is called sequential completeness). Although Cauchy nets are not needed to describe completeness of normed spaces, they are needed to describe completeness of more general (possibly non-normable) topological vector spaces.

Characterizations of topological properties

Virtually all concepts of topology can be rephrased in the language of nets and limits. This may be useful to guide the intuition since the notion of limit of a net is very similar to that of limit of a sequence. The following set of theorems and lemmas help cement that similarity:

Closed sets and closure

A subset [math]\displaystyle{ S \subseteq X }[/math] is closed in [math]\displaystyle{ X }[/math] if and only if every limit point of every convergent net in [math]\displaystyle{ S }[/math] necessarily belongs to [math]\displaystyle{ S. }[/math] Explicitly, a subset [math]\displaystyle{ S \subseteq X }[/math] is closed if and only if whenever [math]\displaystyle{ x \in X }[/math] and [math]\displaystyle{ s_\bull = \left(s_a\right)_{a \in A} }[/math] is a net valued in [math]\displaystyle{ S }[/math] (meaning that [math]\displaystyle{ s_a \in S }[/math] for all [math]\displaystyle{ a \in A }[/math]) such that [math]\displaystyle{ \lim{}_{} s_\bull \to x }[/math] in [math]\displaystyle{ X, }[/math] then necessarily [math]\displaystyle{ x \in S. }[/math]

More generally, if [math]\displaystyle{ S \subseteq X }[/math] is any subset then a point [math]\displaystyle{ x \in X }[/math] is in the closure of [math]\displaystyle{ S }[/math] if and only if there exists a net [math]\displaystyle{ \left(s_a\right)_{a \in A} }[/math] in [math]\displaystyle{ S }[/math] with limit [math]\displaystyle{ x \in X }[/math] and such that [math]\displaystyle{ s_a \in S }[/math] for every index [math]\displaystyle{ a \in A. }[/math]

Open sets and characterizations of topologies

A subset [math]\displaystyle{ S \subseteq X }[/math] is open if and only if no net in [math]\displaystyle{ X \setminus S }[/math] converges to a point of [math]\displaystyle{ S. }[/math] Also, subset [math]\displaystyle{ S \subseteq X }[/math] is open if and only if every net converging to an element of [math]\displaystyle{ S }[/math] is eventually contained in [math]\displaystyle{ S. }[/math] It is these characterizations of "open subset" that allow nets to characterize topologies. Topologies can also be characterized by closed subsets since a set is open if and only if its complement is closed. So the characterizations of "closed set" in terms of nets can also be used to characterize topologies.

Continuity

A function [math]\displaystyle{ f : X \to Y }[/math] between topological spaces is continuous at a given point [math]\displaystyle{ x }[/math] if and only if for every net [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] in its domain, if [math]\displaystyle{ \lim_{} x_\bull \to x }[/math] in [math]\displaystyle{ X }[/math] then [math]\displaystyle{ \lim{} f\left(x_\bull\right) \to f(x) }[/math] in [math]\displaystyle{ Y. }[/math] Said more succinctly, a function [math]\displaystyle{ f : X \to Y }[/math] is continuous if and only if whenever [math]\displaystyle{ x_\bull \to x }[/math] in [math]\displaystyle{ X }[/math] then [math]\displaystyle{ f\left(x_\bull\right) \to f(x) }[/math] in [math]\displaystyle{ Y. }[/math] In general, this statement would not be true if the word "net" was replaced by "sequence"; that is, it is necessary to allow for directed sets other than just the natural numbers if [math]\displaystyle{ X }[/math] is not a first-countable space (or not a sequential space).

Proof

([math]\displaystyle{ \implies }[/math]) Let [math]\displaystyle{ f }[/math] be continuous at point [math]\displaystyle{ x, }[/math] and let [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] be a net such that [math]\displaystyle{ \lim_{} x_\bull \to x. }[/math] Then for every open neighborhood [math]\displaystyle{ U }[/math] of [math]\displaystyle{ f(x), }[/math] its preimage under [math]\displaystyle{ f, }[/math] [math]\displaystyle{ V := f^{-1}(U), }[/math] is a neighborhood of [math]\displaystyle{ x }[/math] (by the continuity of [math]\displaystyle{ f }[/math] at [math]\displaystyle{ x }[/math]). Thus the interior of [math]\displaystyle{ V, }[/math] which is denoted by [math]\displaystyle{ \operatorname{int} V, }[/math] is an open neighborhood of [math]\displaystyle{ x, }[/math] and consequently [math]\displaystyle{ x_\bull }[/math] is eventually in [math]\displaystyle{ \operatorname{int} V. }[/math] Therefore [math]\displaystyle{ \left(f\left(x_a\right)\right)_{a \in A} }[/math] is eventually in [math]\displaystyle{ f(\operatorname{int} V) }[/math] and thus also eventually in [math]\displaystyle{ f(V) }[/math] which is a subset of [math]\displaystyle{ U. }[/math] Thus [math]\displaystyle{ \lim_{} \left(f\left(x_a\right)\right)_{a \in A} \to f(x), }[/math] and this direction is proven. ([math]\displaystyle{ \Longleftarrow }[/math]) Let [math]\displaystyle{ x }[/math] be a point such that for every net [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] such that [math]\displaystyle{ \lim_{} x_\bull \to x, }[/math] [math]\displaystyle{ \lim_{} \left(f\left(x_a\right)\right)_{a \in A} \to f(x). }[/math] Now suppose that [math]\displaystyle{ f }[/math] is not continuous at [math]\displaystyle{ x. }[/math] Then there is a neighborhood [math]\displaystyle{ U }[/math] of [math]\displaystyle{ f(x) }[/math] whose preimage under [math]\displaystyle{ f, }[/math] [math]\displaystyle{ V, }[/math] is not a neighborhood of [math]\displaystyle{ x. }[/math] Because [math]\displaystyle{ f(x) \in U, }[/math] necessarily [math]\displaystyle{ x \in V. }[/math] Now the set of open neighborhoods of [math]\displaystyle{ x }[/math] with the containment preorder is a directed set (since the intersection of every two such neighborhoods is an open neighborhood of [math]\displaystyle{ x }[/math] as well). We construct a net [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] such that for every open neighborhood of [math]\displaystyle{ x }[/math] whose index is [math]\displaystyle{ a, }[/math] [math]\displaystyle{ x_a }[/math] is a point in this neighborhood that is not in [math]\displaystyle{ V }[/math]; that there is always such a point follows from the fact that no open neighborhood of [math]\displaystyle{ x }[/math] is included in [math]\displaystyle{ V }[/math] (because by assumption, [math]\displaystyle{ V }[/math] is not a neighborhood of [math]\displaystyle{ x }[/math]). It follows that [math]\displaystyle{ f\left(x_a\right) }[/math] is not in [math]\displaystyle{ U. }[/math] Now, for every open neighborhood [math]\displaystyle{ W }[/math] of [math]\displaystyle{ x, }[/math] this neighborhood is a member of the directed set whose index we denote [math]\displaystyle{ a_0. }[/math] For every [math]\displaystyle{ b \geq a_0, }[/math] the member of the directed set whose index is [math]\displaystyle{ b }[/math] is contained within [math]\displaystyle{ W }[/math]; therefore [math]\displaystyle{ x_b \in W. }[/math] Thus [math]\displaystyle{ \lim_{} x_\bull \to x. }[/math] and by our assumption [math]\displaystyle{ \lim_{} \left(f\left(x_a\right)\right)_{a \in A} \to f(x). }[/math] But [math]\displaystyle{ \operatorname{int} U }[/math] is an open neighborhood of [math]\displaystyle{ f(x) }[/math] and thus [math]\displaystyle{ f\left(x_a\right) }[/math] is eventually in [math]\displaystyle{ \operatorname{int} U }[/math] and therefore also in [math]\displaystyle{ U, }[/math] in contradiction to [math]\displaystyle{ f\left(x_a\right) }[/math] not being in [math]\displaystyle{ U }[/math] for every [math]\displaystyle{ a. }[/math] This is a contradiction so [math]\displaystyle{ f }[/math] must be continuous at [math]\displaystyle{ x. }[/math] This completes the proof.

Compactness

A space [math]\displaystyle{ X }[/math] is compact if and only if every net [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] in [math]\displaystyle{ X }[/math] has a subnet with a limit in [math]\displaystyle{ X. }[/math] This can be seen as a generalization of the Bolzano–Weierstrass theorem and Heine–Borel theorem.

Proof

([math]\displaystyle{ \implies }[/math]) First, suppose that [math]\displaystyle{ X }[/math] is compact. We will need the following observation (see finite intersection property). Let [math]\displaystyle{ I }[/math] be any non-empty set and [math]\displaystyle{ \left\{C_i\right\}_{i \in I} }[/math] be a collection of closed subsets of [math]\displaystyle{ X }[/math] such that [math]\displaystyle{ \bigcap_{i \in J} C_i \neq \varnothing }[/math] for each finite [math]\displaystyle{ J \subseteq I. }[/math] Then [math]\displaystyle{ \bigcap_{i \in I} C_i \neq \varnothing }[/math] as well. Otherwise, [math]\displaystyle{ \left\{C_i^c\right\}_{i \in I} }[/math] would be an open cover for [math]\displaystyle{ X }[/math] with no finite subcover contrary to the compactness of [math]\displaystyle{ X. }[/math] Let [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] be a net in [math]\displaystyle{ X }[/math] directed by [math]\displaystyle{ A. }[/math] For every [math]\displaystyle{ a \in A }[/math] define [math]\displaystyle{ E_a \triangleq \left\{x_b : b \geq a\right\}. }[/math] The collection [math]\displaystyle{ \{\operatorname{cl}\left(E_a\right) : a \in A\} }[/math] has the property that every finite subcollection has non-empty intersection. Thus, by the remark above, we have that [math]\displaystyle{ \bigcap_{a \in A} \operatorname{cl} E_a \neq \varnothing }[/math] and this is precisely the set of cluster points of [math]\displaystyle{ x_\bull. }[/math] By the proof given in the next section, it is equal to the set of limits of convergent subnets of [math]\displaystyle{ x_\bull. }[/math] Thus [math]\displaystyle{ x_\bull }[/math] has a convergent subnet. ([math]\displaystyle{ \Longleftarrow }[/math]) Conversely, suppose that every net in [math]\displaystyle{ X }[/math] has a convergent subnet. For the sake of contradiction, let [math]\displaystyle{ \left\{U_i : i \in I\right\} }[/math] be an open cover of [math]\displaystyle{ X }[/math] with no finite subcover. Consider [math]\displaystyle{ D \triangleq \{J \subset I : |J| \lt \infty\}. }[/math] Observe that [math]\displaystyle{ D }[/math] is a directed set under inclusion and for each [math]\displaystyle{ C\in D, }[/math] there exists an [math]\displaystyle{ x_C \in X }[/math] such that [math]\displaystyle{ x_C \notin U_a }[/math] for all [math]\displaystyle{ a \in C. }[/math] Consider the net [math]\displaystyle{ \left(x_C\right)_{C \in D}. }[/math] This net cannot have a convergent subnet, because for each [math]\displaystyle{ x \in X }[/math] there exists [math]\displaystyle{ c \in I }[/math] such that [math]\displaystyle{ U_c }[/math] is a neighbourhood of [math]\displaystyle{ x }[/math]; however, for all [math]\displaystyle{ B \supseteq \{c\}, }[/math] we have that [math]\displaystyle{ x_B \notin U_c. }[/math] This is a contradiction and completes the proof.

Cluster and limit points

The set of cluster points of a net is equal to the set of limits of its convergent subnets.

Proof

Let [math]\displaystyle{ x_\bull = \left(x_a\right)_{a \in A} }[/math] be a net in a topological space [math]\displaystyle{ X }[/math] (where as usual [math]\displaystyle{ A }[/math] automatically assumed to be a directed set) and also let [math]\displaystyle{ y \in X. }[/math] If [math]\displaystyle{ y }[/math] is a limit of a subnet of [math]\displaystyle{ x_\bull }[/math] then [math]\displaystyle{ y }[/math] is a cluster point of [math]\displaystyle{ x_\bull. }[/math] Conversely, assume that [math]\displaystyle{ y }[/math] is a cluster point of [math]\displaystyle{ x_\bull. }[/math] Let [math]\displaystyle{ B }[/math] be the set of pairs [math]\displaystyle{ (U, a) }[/math] where [math]\displaystyle{ U }[/math] is an open neighborhood of [math]\displaystyle{ y }[/math] in [math]\displaystyle{ X }[/math] and [math]\displaystyle{ a \in A }[/math] is such that [math]\displaystyle{ x_a \in U. }[/math] The map [math]\displaystyle{ h : B \to A }[/math] mapping [math]\displaystyle{ (U, a) }[/math] to [math]\displaystyle{ a }[/math] is then cofinal. Moreover, giving [math]\displaystyle{ B }[/math] the product order (the neighborhoods of [math]\displaystyle{ y }[/math] are ordered by inclusion) makes it a directed set, and the net [math]\displaystyle{ \left(y_b\right)_{b \in B} }[/math] defined by [math]\displaystyle{ y_b = x_{h(b)} }[/math] converges to [math]\displaystyle{ y. }[/math]

A net has a limit if and only if all of its subnets have limits. In that case, every limit of the net is also a limit of every subnet.

Other properties

In general, a net in a space [math]\displaystyle{ X }[/math] can have more than one limit, but if [math]\displaystyle{ X }[/math] is a Hausdorff space, the limit of a net, if it exists, is unique. Conversely, if [math]\displaystyle{ X }[/math] is not Hausdorff, then there exists a net on [math]\displaystyle{ X }[/math] with two distinct limits. Thus the uniqueness of the limit is equivalent to the Hausdorff condition on the space, and indeed this may be taken as the definition. This result depends on the directedness condition; a set indexed by a general preorder or partial order may have distinct limit points even in a Hausdorff space.

Relation to filters

A filter is a related idea in topology that allows for a general definition for convergence in general topological spaces. The two ideas are equivalent in the sense that they give the same concept of convergence. More specifically, every filter base induces an associated net using the filter's pointed sets, and convergence of the filter base implies convergence of the associated net. Similarly, any net [math]\displaystyle{ \left(x_a\right)_{a \in A} }[/math] in [math]\displaystyle{ X }[/math] induces a filter base of tails [math]\displaystyle{ \left\{\left\{x_a : a \in A, a_0 \leq a\right\} : a_0 \in A\right\} }[/math] where the filter in [math]\displaystyle{ X }[/math] generated by this filter base is called the net's eventuality filter. Convergence of the net implies convergence of the eventuality filter. This correspondence allows for any theorem that can be proven with one concept to be proven with the other. For instance, continuity of a function from one topological space to the other can be characterized either by the convergence of a net in the domain implying the convergence of the corresponding net in the codomain, or by the same statement with filter bases.

Robert G. Bartle argues that despite their equivalence, it is useful to have both concepts. He argues that nets are enough like sequences to make natural proofs and definitions in analogy to sequences, especially ones using sequential elements, such as is common in analysis, while filters are most useful in algebraic topology. In any case, he shows how the two can be used in combination to prove various theorems in general topology.

The learning curve for using nets is typically much less steep than that for filters, which is why many mathematicians, especially analysts, prefer them over filters. However, filters, and especially ultrafilters, have some important technical advantages over nets that ultimately result in nets being encountered much less often than filters outside of the fields of analysis and topology.

As generalization of sequences

Every non-empty totally ordered set is directed. Therefore, every function on such a set is a net. In particular, the natural numbers [math]\displaystyle{ \N }[/math] together with the usual integer comparison [math]\displaystyle{ \,\leq\, }[/math] preorder form the archetypical example of a directed set. A sequence is a function on the natural numbers, so every sequence [math]\displaystyle{ a_1, a_2, \ldots }[/math] in a topological space [math]\displaystyle{ X }[/math] can be considered a net in [math]\displaystyle{ X }[/math] defined on [math]\displaystyle{ \N. }[/math] Conversely, any net whose domain is the natural numbers is a sequence because by definition, a sequence in [math]\displaystyle{ X }[/math] is just a function from [math]\displaystyle{ \N = \{1, 2, \ldots\} }[/math] into [math]\displaystyle{ X. }[/math] It is in this way that nets are generalizations of sequences: rather than being defined on a countable linearly ordered set ([math]\displaystyle{ \N }[/math]), a net is defined on an arbitrary directed set. Nets are frequently denoted using notation that is similar to (and inspired by) that used with sequences. For example, the subscript notation [math]\displaystyle{ x_a }[/math] is taken from sequences.

Similarly, every limit of a sequence and limit of a function can be interpreted as a limit of a net. Specifically, the net is eventually in a subset [math]\displaystyle{ S }[/math] of [math]\displaystyle{ X }[/math] if there exists an [math]\displaystyle{ N \in \N }[/math] such that for every integer [math]\displaystyle{ n \geq N, }[/math] the point [math]\displaystyle{ a_n }[/math] is in [math]\displaystyle{ S. }[/math] So [math]\displaystyle{ \lim {}_n a_n \to L }[/math] if and only if for every neighborhood [math]\displaystyle{ V }[/math] of [math]\displaystyle{ L, }[/math] the net is eventually in [math]\displaystyle{ V. }[/math] The net is frequently in a subset [math]\displaystyle{ S }[/math] of [math]\displaystyle{ X }[/math] if and only if for every [math]\displaystyle{ N \in \N }[/math] there exists some integer [math]\displaystyle{ n \geq N }[/math] such that [math]\displaystyle{ a_n \in S, }[/math] that is, if and only if infinitely many elements of the sequence are in [math]\displaystyle{ S. }[/math] Thus a point [math]\displaystyle{ y \in X }[/math] is a cluster point of the net if and only if every neighborhood [math]\displaystyle{ V }[/math] of [math]\displaystyle{ y }[/math] contains infinitely many elements of the sequence.

In the context of topology, sequences do not fully encode all information about functions between topological spaces. In particular, the following two conditions are, in general, not equivalent for a map [math]\displaystyle{ f }[/math] between topological spaces [math]\displaystyle{ X }[/math] and [math]\displaystyle{ Y }[/math]:

1. The map [math]\displaystyle{ f }[/math] is continuous in the topological sense;
2. Given any point [math]\displaystyle{ x }[/math] in [math]\displaystyle{ X, }[/math] and any sequence in [math]\displaystyle{ X }[/math] converging to [math]\displaystyle{ x, }[/math] the composition of [math]\displaystyle{ f }[/math] with this sequence converges to [math]\displaystyle{ f(x) }[/math] (continuous in the sequential sense).

While condition 1 always guarantees condition 2, the converse is not necessarily true. The spaces for which the two conditions are equivalent are called sequential spaces. All first-countable spaces, including metric spaces, are sequential spaces, but not all topological spaces are sequential. Nets generalize the notion of a sequence so that condition 2 reads as follows:

2. Given any point [math]\displaystyle{ x }[/math] in [math]\displaystyle{ X, }[/math] and any net in [math]\displaystyle{ X }[/math] converging to [math]\displaystyle{ x, }[/math] the composition of [math]\displaystyle{ f }[/math] with this net converges to [math]\displaystyle{ f(x) }[/math] (continuous in the net sense).

With this change, the conditions become equivalent for all maps of topological spaces, including topological spaces that do not necessarily have a countable or linearly ordered neighbourhood basis around a point. Therefore, while sequences do not encode sufficient information about functions between topological spaces, nets do, because collections of open sets in topological spaces are much like directed sets in behavior.

For an example where sequences do not suffice, interpret the set [math]\displaystyle{ \Reals^\Reals }[/math] of all functions with prototype [math]\displaystyle{ f : \Reals \to \Reals }[/math] as the Cartesian product [math]\displaystyle{ {\textstyle\prod\limits_{x \in \Reals}} \Reals }[/math] (by identifying a function [math]\displaystyle{ f }[/math] with the tuple [math]\displaystyle{ (f(x))_{x \in \Reals}, }[/math] and conversely) and endow it with the product topology. This (product) topology on [math]\displaystyle{ \Reals^\Reals }[/math] is identical to the topology of pointwise convergence. Let [math]\displaystyle{ E }[/math] denote the set of all functions [math]\displaystyle{ f : \Reals \to \{0, 1\} }[/math] that are equal to [math]\displaystyle{ 1 }[/math] everywhere except for at most finitely many points (that is, such that the set [math]\displaystyle{ \{x : f(x) = 0\} }[/math] is finite). Then the constant [math]\displaystyle{ 0 }[/math] function [math]\displaystyle{ \mathbf{0} : \Reals \to \{0\} }[/math] belongs to the closure of [math]\displaystyle{ E }[/math] in [math]\displaystyle{ \Reals^\Reals; }[/math] that is, [math]\displaystyle{ \mathbf{0} \in \operatorname{cl}_{\Reals^\Reals} E. }[/math] This will be proven by constructing a net in [math]\displaystyle{ E }[/math] that converges to [math]\displaystyle{ \mathbf{0}. }[/math] However, there does not exist any sequence in [math]\displaystyle{ E }[/math] that converges to [math]\displaystyle{ \mathbf{0}, }[/math] which makes this one instance where (non-sequence) nets must be used because sequences alone can not reach the desired conclusion. Compare elements of [math]\displaystyle{ \Reals^\Reals }[/math] pointwise in the usual way by declaring that [math]\displaystyle{ f \geq g }[/math] if and only if [math]\displaystyle{ f(x) \geq g(x) }[/math] for all [math]\displaystyle{ x. }[/math] This pointwise comparison is a partial order that makes [math]\displaystyle{ (E, \geq) }[/math] a directed set since given any [math]\displaystyle{ f, g \in E, }[/math] their pointwise minimum [math]\displaystyle{ m := \min \{f, g\} }[/math] belongs to [math]\displaystyle{ E }[/math] and satisfies [math]\displaystyle{ f \geq m }[/math] and [math]\displaystyle{ g \geq m. }[/math] This partial order turns the identity map [math]\displaystyle{ \operatorname{Id} : (E, \geq) \to E }[/math] (defined by [math]\displaystyle{ f \mapsto f }[/math]) into an [math]\displaystyle{ E }[/math]-valued net. This net converges pointwise to [math]\displaystyle{ \mathbf{0} }[/math] in [math]\displaystyle{ \Reals^\Reals, }[/math] which implies that [math]\displaystyle{ \mathbf{0} }[/math] belongs to the closure of [math]\displaystyle{ E }[/math] in [math]\displaystyle{ \Reals^\Reals. }[/math]

Examples

Subspace topology

If the set [math]\displaystyle{ S = \{x\} \cup \left\{x_a : a \in A\right\} }[/math] is endowed with the subspace topology induced on it by [math]\displaystyle{ X, }[/math] then [math]\displaystyle{ \lim_{} x_\bull \to x }[/math] in [math]\displaystyle{ X }[/math] if and only if [math]\displaystyle{ \lim_{} x_\bull \to x }[/math] in [math]\displaystyle{ S. }[/math] In this way, the question of whether or not the net [math]\displaystyle{ x_\bull }[/math] converges to the given point [math]\displaystyle{ x }[/math] depends solely on this topological subspace [math]\displaystyle{ S }[/math] consisting of [math]\displaystyle{ x }[/math] and the image of (that is, the points of) the net [math]\displaystyle{ x_\bull. }[/math]

Neighborhood systems

Intuitively, convergence of a net [math]\displaystyle{ \left(x_a\right)_{a \in A} }[/math] means that the values [math]\displaystyle{ x_a }[/math] come and stay as close as we want to [math]\displaystyle{ x }[/math] for large enough [math]\displaystyle{ a. }[/math] Given a point [math]\displaystyle{ x }[/math] in a topological space, let [math]\displaystyle{ N_x }[/math] denote the set of all neighbourhoods containing [math]\displaystyle{ x. }[/math] Then [math]\displaystyle{ N_x }[/math] is a directed set, where the direction is given by reverse inclusion, so that [math]\displaystyle{ S \geq T }[/math] if and only if [math]\displaystyle{ S }[/math] is contained in [math]\displaystyle{ T. }[/math] For [math]\displaystyle{ S \in N_x, }[/math] let [math]\displaystyle{ x_S }[/math] be a point in [math]\displaystyle{ S. }[/math] Then [math]\displaystyle{ \left(x_S\right) }[/math] is a net. As [math]\displaystyle{ S }[/math] increases with respect to [math]\displaystyle{ \,\geq, }[/math] the points [math]\displaystyle{ x_S }[/math] in the net are constrained to lie in decreasing neighbourhoods of [math]\displaystyle{ x, }[/math]. Therefore, in this neighborhood system of a point [math]\displaystyle{ x }[/math], [math]\displaystyle{ x_S }[/math] does indeed converge to [math]\displaystyle{ x }[/math] according to the definition of net convergence.

Given a subbase [math]\displaystyle{ \mathcal{B} }[/math] for the topology on [math]\displaystyle{ X }[/math] (where note that every base for a topology is also a subbase) and given a point [math]\displaystyle{ x \in X, }[/math] a net [math]\displaystyle{ x_\bull }[/math] in [math]\displaystyle{ X }[/math] converges to [math]\displaystyle{ x }[/math] if and only if it is eventually in every neighborhood [math]\displaystyle{ U \in \mathcal{B} }[/math] of [math]\displaystyle{ x. }[/math] This characterization extends to neighborhood subbases (and so also neighborhood bases) of the given point [math]\displaystyle{ x. }[/math]

Limits in a Cartesian product

A net in the product space has a limit if and only if each projection has a limit.

Explicitly, let [math]\displaystyle{ \left(X_i\right)_{i \in I} }[/math] be topological spaces, endow their Cartesian product [math]\displaystyle{ {\textstyle\prod} X_\bull := \prod_{i \in I} X_i }[/math] with the product topology, and that for every index [math]\displaystyle{ l \in I, }[/math] denote the canonical projection to [math]\displaystyle{ X_l }[/math] by [math]\displaystyle{ \begin{alignat}{4} \pi_l :\;&& {\textstyle\prod} X_\bull &&\;\to\;& X_l \\[0.3ex] && \left(x_i\right)_{i \in I} &&\;\mapsto\;& x_l \\ \end{alignat} }[/math]

Let [math]\displaystyle{ f_\bull = \left(f_a\right)_{a \in A} }[/math] be a net in [math]\displaystyle{ {\textstyle\prod} X_\bull }[/math] directed by [math]\displaystyle{ A }[/math] and for every index [math]\displaystyle{ i \in I, }[/math] let [math]\displaystyle{ \pi_i\left(f_\bull\right) ~\stackrel{\scriptscriptstyle\text{def}}{=}~ \left(\pi_i\left(f_a\right)\right)_{a \in A} }[/math] denote the result of "plugging [math]\displaystyle{ f_\bull }[/math] into [math]\displaystyle{ \pi_i }[/math]", which results in the net [math]\displaystyle{ \pi_i\left(f_\bull\right) : A \to X_i. }[/math] It is sometimes useful to think of this definition in terms of function composition: the net [math]\displaystyle{ \pi_i\left(f_\bull\right) }[/math] is equal to the composition of the net [math]\displaystyle{ f_\bull : A \to {\textstyle\prod} X_\bull }[/math] with the projection [math]\displaystyle{ \pi_i : {\textstyle\prod} X_\bull \to X_i; }[/math] that is, [math]\displaystyle{ \pi_i\left(f_\bull\right) ~\stackrel{\scriptscriptstyle\text{def}}{=}~ \pi_i \,\circ\, f_\bull. }[/math]

For any given point [math]\displaystyle{ L = \left(L_i\right)_{i \in I} \in {\textstyle\prod\limits_{i \in I}} X_i, }[/math] the net [math]\displaystyle{ f_\bull }[/math] converges to [math]\displaystyle{ L }[/math] in the product space [math]\displaystyle{ {\textstyle\prod} X_\bull }[/math] if and only if for every index [math]\displaystyle{ i \in I, }[/math] [math]\displaystyle{ \pi_i\left(f_\bull\right) \;\stackrel{\scriptscriptstyle\text{def}}{=}\; \left(\pi_i\left(f_a\right)\right)_{a \in A} }[/math] converges to [math]\displaystyle{ L_i }[/math] in [math]\displaystyle{ X_i. }[/math] And whenever the net [math]\displaystyle{ f_\bull }[/math] clusters at [math]\displaystyle{ L }[/math] in [math]\displaystyle{ {\textstyle\prod} X_\bull }[/math] then [math]\displaystyle{ \pi_i\left(f_\bull\right) }[/math] clusters at [math]\displaystyle{ L_i }[/math] for every index [math]\displaystyle{ i \in I. }[/math] However, the converse does not hold in general. For example, suppose [math]\displaystyle{ X_1 = X_2 = \Reals }[/math] and let [math]\displaystyle{ f_\bull = \left(f_a\right)_{a \in \N} }[/math] denote the sequence [math]\displaystyle{ (1, 1), (0, 0), (1, 1), (0, 0), \ldots }[/math] that alternates between [math]\displaystyle{ (1, 1) }[/math] and [math]\displaystyle{ (0, 0). }[/math] Then [math]\displaystyle{ L_1 := 0 }[/math] and [math]\displaystyle{ L_2 := 1 }[/math] are cluster points of both [math]\displaystyle{ \pi_1\left(f_\bull\right) }[/math] and [math]\displaystyle{ \pi_2\left(f_\bull\right) }[/math] in [math]\displaystyle{ X_1 \times X_2 = \Reals^2 }[/math] but [math]\displaystyle{ \left(L_1, L_2\right) = (0, 1) }[/math] is not a cluster point of [math]\displaystyle{ f_\bull }[/math] since the open ball of radius [math]\displaystyle{ 1 }[/math] centered at [math]\displaystyle{ (0, 1) }[/math] does not contain even a single point [math]\displaystyle{ f_\bull }[/math]

Tychonoff's theorem and relation to the axiom of choice

If no [math]\displaystyle{ L \in X }[/math] is given but for every [math]\displaystyle{ i \in I, }[/math] there exists some [math]\displaystyle{ L_i \in X_i }[/math] such that [math]\displaystyle{ \pi_i\left(f_\bull\right) \to L_i }[/math] in [math]\displaystyle{ X_i }[/math] then the tuple defined by [math]\displaystyle{ L = \left(L_i\right)_{i \in I} }[/math] will be a limit of [math]\displaystyle{ f_\bull }[/math] in [math]\displaystyle{ X. }[/math] However, the axiom of choice might be need to be assumed in order to conclude that this tuple [math]\displaystyle{ L }[/math] exists; the axiom of choice is not needed in some situations, such as when [math]\displaystyle{ I }[/math] is finite or when every [math]\displaystyle{ L_i \in X_i }[/math] is the unique limit of the net [math]\displaystyle{ \pi_i\left(f_\bull\right) }[/math] (because then there is nothing to choose between), which happens for example, when every [math]\displaystyle{ X_i }[/math] is a Hausdorff space. If [math]\displaystyle{ I }[/math] is infinite and [math]\displaystyle{ {\textstyle\prod} X_\bull = {\textstyle\prod\limits_{j \in I}} X_j }[/math] is not empty, then the axiom of choice would (in general) still be needed to conclude that the projections [math]\displaystyle{ \pi_i : {\textstyle\prod} X_\bull \to X_i }[/math] are surjective maps.

The axiom of choice is equivalent to Tychonoff's theorem, which states that the product of any collection of compact topological spaces is compact. But if every compact space is also Hausdorff, then the so called "Tychonoff's theorem for compact Hausdorff spaces" can be used instead, which is equivalent to the ultrafilter lemma and so strictly weaker than the axiom of choice. Nets can be used to give short proofs of both version of Tychonoff's theorem by using the characterization of net convergence given above together with the fact that a space is compact if and only if every net has a convergent subnet.

Limit superior/inferior

Limit superior and limit inferior of a net of real numbers can be defined in a similar manner as for sequences. Some authors work even with more general structures than the real line, like complete lattices.

For a net [math]\displaystyle{ \left(x_a\right)_{a \in A}, }[/math] put [math]\displaystyle{ \limsup x_a = \lim_{a \in A} \sup_{b \succeq a} x_b = \inf_{a \in A} \sup_{b \succeq a} x_b. }[/math]

Limit superior of a net of real numbers has many properties analogous to the case of sequences. For example, [math]\displaystyle{ \limsup (x_a + y_a) \leq \limsup x_a + \limsup y_a, }[/math] where equality holds whenever one of the nets is convergent.

Riemann integral

The definition of the value of a Riemann integral can be interpreted as a limit of a net of Riemann sums where the net's directed set is the set of all partitions of the interval of integration, partially ordered by inclusion.

Metric spaces

Suppose [math]\displaystyle{ (M, d) }[/math] is a metric space (or a pseudometric space) and [math]\displaystyle{ M }[/math] is endowed with the metric topology. If [math]\displaystyle{ m \in M }[/math] is a point and [math]\displaystyle{ m_\bull = \left(m_i\right)_{a \in A} }[/math] is a net, then [math]\displaystyle{ m_\bull \to m }[/math] in [math]\displaystyle{ (M, d) }[/math] if and only if [math]\displaystyle{ d\left(m, m_\bull\right) \to 0 }[/math] in [math]\displaystyle{ \R, }[/math] where [math]\displaystyle{ d\left(m, m_\bull\right) := \left(d\left(m, m_a\right)\right)_{a \in A} }[/math] is a net of real numbers. In plain English, this characterization says that a net converges to a point in a metric space if and only if the distance between the net and the point converges to zero. If [math]\displaystyle{ (M, \|\cdot\|) }[/math] is a normed space (or a seminormed space) then [math]\displaystyle{ m_\bull \to m }[/math] in [math]\displaystyle{ (M, \|\cdot\|) }[/math] if and only if [math]\displaystyle{ \left\|m - m_\bull\right\| \to 0 }[/math] in [math]\displaystyle{ \Reals, }[/math] where [math]\displaystyle{ \left\|m - m_\bull\right\| := \left(\left\|m - m_a\right\|\right)_{a \in A}. }[/math]

If [math]\displaystyle{ (M, d) }[/math] has at least two points, then we can fix a point [math]\displaystyle{ c \in M }[/math] (such as [math]\displaystyle{ M := \R^n }[/math] with the Euclidean metric with [math]\displaystyle{ c := 0 }[/math] being the origin, for example) and direct the set [math]\displaystyle{ I := M \setminus \{c\} }[/math] reversely according to distance from [math]\displaystyle{ c }[/math] by declaring that [math]\displaystyle{ i \leq j }[/math] if and only if [math]\displaystyle{ d(j, c) \leq d(i, c). }[/math] In other words, the relation is "has at least the same distance to [math]\displaystyle{ c }[/math] as", so that "large enough" with respect to this relation means "close enough to [math]\displaystyle{ c }[/math]". Given any function with domain [math]\displaystyle{ M, }[/math] its restriction to [math]\displaystyle{ I := M \setminus \{c\} }[/math] can be canonically interpreted as a net directed by [math]\displaystyle{ (I, \leq). }[/math]

A net [math]\displaystyle{ f : M \setminus \{c\} \to X }[/math] is eventually in a subset [math]\displaystyle{ S }[/math] of a topological space [math]\displaystyle{ X }[/math] if and only if there exists some [math]\displaystyle{ n \in M \setminus \{c\} }[/math] such that for every [math]\displaystyle{ m \in M \setminus \{c\} }[/math] satisfying [math]\displaystyle{ d(m, c) \leq d(n, c), }[/math] the point [math]\displaystyle{ f(m) }[/math] is in [math]\displaystyle{ S. }[/math] Such a net [math]\displaystyle{ f }[/math] converges in [math]\displaystyle{ X }[/math] to a given point [math]\displaystyle{ L \in X }[/math] if and only if [math]\displaystyle{ \lim_{m \to c} f(m) \to L }[/math] in the usual sense (meaning that for every neighborhood [math]\displaystyle{ V }[/math] of [math]\displaystyle{ L, }[/math] [math]\displaystyle{ f }[/math] is eventually in [math]\displaystyle{ V }[/math]).

The net [math]\displaystyle{ f : M \setminus \{c\} \to X }[/math] is frequently in a subset [math]\displaystyle{ S }[/math] of [math]\displaystyle{ X }[/math] if and only if for every [math]\displaystyle{ n \in M \setminus \{c\} }[/math] there exists some [math]\displaystyle{ m \in M \setminus \{c\} }[/math] with [math]\displaystyle{ d(m, c) \leq d(n, c) }[/math] such that [math]\displaystyle{ f(m) }[/math] is in [math]\displaystyle{ S. }[/math] Consequently, a point [math]\displaystyle{ L \in X }[/math] is a cluster point of the net [math]\displaystyle{ f }[/math] if and only if for every neighborhood [math]\displaystyle{ V }[/math] of [math]\displaystyle{ L, }[/math] the net is frequently in [math]\displaystyle{ V. }[/math]

Function from a well-ordered set to a topological space

Consider a well-ordered set [math]\displaystyle{ [0, c] }[/math] with limit point [math]\displaystyle{ t }[/math] and a function [math]\displaystyle{ f }[/math] from [math]\displaystyle{ [0, t) }[/math] to a topological space [math]\displaystyle{ X. }[/math] This function is a net on [math]\displaystyle{ [0, t). }[/math]

It is eventually in a subset [math]\displaystyle{ V }[/math] of [math]\displaystyle{ X }[/math] if there exists an [math]\displaystyle{ r \in [0, t) }[/math] such that for every [math]\displaystyle{ s \in [r, t) }[/math] the point [math]\displaystyle{ f(s) }[/math] is in [math]\displaystyle{ V. }[/math]

So [math]\displaystyle{ \lim_{x \to t} f(x) \to L }[/math] if and only if for every neighborhood [math]\displaystyle{ V }[/math] of [math]\displaystyle{ L, }[/math] [math]\displaystyle{ f }[/math] is eventually in [math]\displaystyle{ V. }[/math]

The net [math]\displaystyle{ f }[/math] is frequently in a subset [math]\displaystyle{ V }[/math] of [math]\displaystyle{ X }[/math] if and only if for every [math]\displaystyle{ r \in [0, t) }[/math] there exists some [math]\displaystyle{ s \in [r, t) }[/math] such that [math]\displaystyle{ f(s) \in V. }[/math]

A point [math]\displaystyle{ y \in X }[/math] is a cluster point of the net [math]\displaystyle{ f }[/math] if and only if for every neighborhood [math]\displaystyle{ V }[/math] of [math]\displaystyle{ y, }[/math] the net is frequently in [math]\displaystyle{ V. }[/math]

The first example is a special case of this with [math]\displaystyle{ c = \omega. }[/math]

See also ordinal-indexed sequence.

See also

• Characterizations of the category of topological spaces
• Filter (set theory) – Family of sets representing "large" sets
• Filters in topology – Use of filters to describe and characterize all basic topological notions and results.
• Preorder – Reflexive and transitive binary relation
• Sequential space – Topological space characterized by sequences
• Ultrafilter (set theory) – Maximal proper filter

References

• Sundström, Manya Raman (2010). "A pedagogical history of compactness". arXiv:1006.4131v1 [math.HO].
• Aliprantis, Charalambos D.; Border, Kim C. (2006). Infinite dimensional analysis: A hitchhiker's guide (3rd ed.). Berlin: Springer. pp. xxii,703. ISBN 978-3-540-32696-0. 
• Beer, Gerald (1993). Topologies on closed and closed convex sets. Mathematics and its Applications 268. Dordrecht: Kluwer Academic Publishers Group. pp. xii,340. ISBN 0-7923-2531-1. 
• Template:Howes Modern Analysis and Topology 1995
• Template:Kelley General Topology
• Kelley, John L. (1991). General Topology. Springer. ISBN 3-540-90125-6. 
• Megginson, Robert E. (1998). An Introduction to Banach Space Theory. Graduate Texts in Mathematics. 193. New York: Springer. ISBN 0-387-98431-3. 
• Schechter, Eric (1997). Handbook of Analysis and Its Foundations. San Diego: Academic Press. ISBN 9780080532998. http://store.elsevier.com/product.jsp?isbn=9780080532998&pagename=search. Retrieved 22 June 2013. 
• Schechter, Eric (1996). Handbook of Analysis and Its Foundations. San Diego, CA: Academic Press. ISBN 978-0-12-622760-4. OCLC 175294365. 
• Willard, Stephen (2004). General Topology. Dover Books on Mathematics (First ed.). Mineola, N.Y.: Dover Publications. ISBN 978-0-486-43479-7. OCLC 115240.