# Net (mathematics)

Last updated

In mathematics, more specifically in general topology and related branches, a net or MooreSmith sequence is a generalization of the notion of a sequence. In essence, a sequence is a function whose domain is the natural numbers. The codomain of this function is usually some topological space.

## Contents

The motivation for generalizing the notion of a sequence is that, 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 f between topological spaces X and Y:

1. The map f is continuous in the topological sense;
2. Given any point x in X, and any sequence in X converging to x, the composition of f with this sequence converges to f(x) (continuous in the sequential sense).

While it is necessarily true that condition 1 implies condition 2, the reverse implication is not necessarily true if the topological spaces are not both first-countable. In particular, the two conditions are equivalent for metric spaces.

The concept of a net, first introduced by E. H. Moore and Herman L. Smith in 1922, [1] is to generalize the notion of a sequence so that the above conditions (with "sequence" being replaced by "net" in condition 2) are in fact equivalent for all maps of topological spaces. In particular, rather than being defined on a countable linearly ordered set, a net is defined on an arbitrary directed set. This allows for theorems similar to the assertion that the conditions 1 and 2 above are equivalent to hold in the context of 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 behaviour. The term "net" was coined by John L. Kelley. [2] [3]

Nets are one of the many tools used in topology to generalize certain concepts that may only be general enough in the context of metric spaces. A related notion, that of the filter, was developed in 1937 by Henri Cartan.

## Definitions

Any function whose domain is a directed set is called a net where if this function takes values in some set ${\displaystyle X}$ then it may also be referred to as a net in ${\displaystyle X}$. Elements of a net's domain are called its indices. Explicitly, a net in ${\displaystyle X}$ is a function of the form ${\displaystyle f:A\to X}$ where ${\displaystyle A}$ is some directed set. A directed set is a non-empty set ${\displaystyle A}$ together with a preorder, typically automatically assumed to be denoted by ${\displaystyle \,\leq \,}$ (unless indicated otherwise), with the property that it is also (upward) directed, which means that for any ${\displaystyle a,b\in A,}$ there exists some ${\displaystyle c\in A}$ such that ${\displaystyle a\leq c}$ and ${\displaystyle b\leq c.}$ In words, this property means that given any two elements (of ${\displaystyle A}$), there is always some element that is "above" both of them (i.e. 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. The natural numbers ${\displaystyle \mathbb {N} }$ together with the usual integer comparison ${\displaystyle \,\leq \,}$ preorder form the archetypical example of a directed set. Indeed, a net whose domain is the natural numbers is a sequence because by definition, a sequence in ${\displaystyle X}$ is just a function from ${\displaystyle \mathbb {N} =\{1,2,\ldots \}}$ into ${\displaystyle X.}$ It is in this way that nets are generalizations of sequences. Importantly though, unlike the natural numbers, 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 ${\displaystyle \,<\,}$ instead of the original (non-strict) preorder ${\displaystyle \,\leq }$; in particular, if a directed set ${\displaystyle (A,\leq )}$ has a greatest element ${\displaystyle a\in A}$ then there does not exist any ${\displaystyle b\in A}$ such that ${\displaystyle a (in contrast, there always exists some ${\displaystyle b\in A}$ such that ${\displaystyle a\leq b}$).

Nets are frequently denoted using notation that is similar to (and inspired by) that used with sequences. A net in ${\displaystyle X}$ may be denoted by ${\displaystyle \left(x_{a}\right)_{a\in A},}$ where unless there is reason to think otherwise, it should automatically be assumed that the set ${\displaystyle A}$ is directed and that its associated preorder is denoted by ${\displaystyle \,\leq .}$ However, notation for nets varies with some authors using, for instance, angled brackets ${\displaystyle \left\langle x_{a}\right\rangle _{a\in A}}$ instead of parentheses. A net in ${\displaystyle X}$ may also be written as ${\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A},}$ which expresses the fact that this net ${\displaystyle x_{\bullet }}$ is a function ${\displaystyle x_{\bullet }:A\to X}$ whose value at an element ${\displaystyle a}$ in its domain is denoted by ${\displaystyle x_{a}}$ instead of the usual parentheses notation ${\displaystyle x_{\bullet }(a)}$ that is typically used with functions (this subscript notation being taken from sequences). As in the field of algebraic topology, the filled disk or "bullet" denotes the location where arguments to the net (i.e. elements ${\displaystyle a\in A}$ 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.

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 intimately related to filters, which are also often used in topology. Every net may be associated with a filter and every filter may be associated with a net, where the properties of these associated objects are closely tied together (see the article about Filters in topology for more details). Nets directly generalize sequences and they may often be used very similarly to sequences. Consequently, 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.

A subnet is not merely the restriction of a net ${\displaystyle f}$ to a directed subset of ${\displaystyle A;}$ see the linked page for a definition.

## Examples of nets

Every non-empty totally ordered set is directed. Therefore, every function on such a set is a net. In particular, the natural numbers with the usual order form such a set, and a sequence is a function on the natural numbers, so every sequence is a net.

Another important example is as follows. Given a point ${\displaystyle x}$ in a topological space, let ${\displaystyle N_{x}}$ denote the set of all neighbourhoods containing ${\displaystyle x.}$ Then ${\displaystyle N_{x}}$ is a directed set, where the direction is given by reverse inclusion, so that ${\displaystyle S\geq T}$ if and only if ${\displaystyle S}$ is contained in ${\displaystyle T.}$ For ${\displaystyle S\in N_{x},}$ let ${\displaystyle x_{S}}$ be a point in ${\displaystyle S.}$ Then ${\displaystyle \left(x_{S}\right)}$ is a net. As ${\displaystyle S}$ increases with respect to ${\displaystyle \,\geq ,}$ the points ${\displaystyle x_{S}}$ in the net are constrained to lie in decreasing neighbourhoods of ${\displaystyle x,}$ so intuitively speaking, we are led to the idea that ${\displaystyle x_{S}}$ must tend towards ${\displaystyle x}$ in some sense. We can make this limiting concept precise.

## Limits of nets

If ${\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}$ is a net from a directed set ${\displaystyle A}$ into ${\displaystyle X,}$ and if ${\displaystyle S}$ is a subset of ${\displaystyle X,}$ then ${\displaystyle x_{\bullet }}$ is said to be eventually in ${\displaystyle S}$ (or residually in ${\displaystyle S}$) if there exists some ${\displaystyle a\in A}$ such that for every ${\displaystyle b\in A}$ with ${\displaystyle b\geq a,}$ the point ${\displaystyle x_{b}\in S.}$ A point ${\displaystyle x\in X}$ is called a limit point or limit of the net ${\displaystyle x_{\bullet }}$ in ${\displaystyle X}$ if (and only if)

for every open neighborhood ${\displaystyle U}$ of ${\displaystyle x,}$ the net ${\displaystyle x_{\bullet }}$ is eventually in ${\displaystyle U,}$

in which case, this net is then also said to converges to/towards ${\displaystyle x}$ and to have ${\displaystyle x}$ as a limit. If the net ${\displaystyle x_{\bullet }}$ converges in ${\displaystyle X}$ to a point ${\displaystyle x\in X}$ then this fact may be expressed by writing any of the following:

{\displaystyle {\begin{alignedat}{4}&x_{\bullet }&&\to \;&&x&&\;\;{\text{ in }}X\\&x_{a}&&\to \;&&x&&\;\;{\text{ in }}X\\\lim _{}\;&x_{\bullet }&&\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{alignedat}}}

where if the topological space ${\displaystyle X}$ is clear from context then the words "in ${\displaystyle X}$" may be omitted.

If ${\displaystyle \lim _{}x_{\bullet }\to x}$ in ${\displaystyle X}$ and if this limit in ${\displaystyle X}$ is unique (uniqueness in ${\displaystyle X}$ means that if ${\displaystyle y\in X}$ is such that ${\displaystyle \lim _{}x_{\bullet }\to y,}$ then necessarily ${\displaystyle x=y}$) then this fact may be indicated by writing

${\displaystyle \lim _{}x_{\bullet }=x}$       or       ${\displaystyle \lim _{}x_{a}=x}$       or       ${\displaystyle \lim _{a\in A}x_{a}=x}$

where an equals sign is used in place of the arrow ${\displaystyle \to .}$ [4] 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. [4] Some authors instead use the notation "${\displaystyle \lim _{}x_{\bullet }=x}$" to mean ${\displaystyle \lim _{}x_{\bullet }\to x}$ without also requiring that the limit be unique; however, if this notation is defined in this way then the equals sign ${\displaystyle =}$ is no longer guaranteed to denote a transitive relationship and so no longer denotes equality. Specifically, without the uniqueness requirement, if ${\displaystyle x,y\in X}$ are distinct and if each is also a limit of ${\displaystyle x_{\bullet }}$ in ${\displaystyle X}$ then ${\displaystyle \lim _{}x_{\bullet }=x}$ and ${\displaystyle \lim _{}x_{\bullet }=y}$ could be written (using the equals sign ${\displaystyle =}$) despite it not being true that ${\displaystyle x=y.}$

Intuitively, convergence of this net means that the values ${\displaystyle x_{a}}$ come and stay as close as we want to ${\displaystyle x}$ for large enough ${\displaystyle a.}$ The example net given above on the neighborhood system of a point ${\displaystyle x}$ does indeed converge to ${\displaystyle x}$ according to this definition.

Given a subbase ${\displaystyle {\mathcal {B}}}$ for the topology on ${\displaystyle X}$ (where note that every base for a topology is also a subbase) and given a point ${\displaystyle x\in X,}$ a net ${\displaystyle x_{\bullet }}$ in ${\displaystyle X}$ converges to ${\displaystyle x}$ if and only if it is eventually in every neighborhood ${\displaystyle U\in {\mathcal {B}}}$ of ${\displaystyle x.}$ This characterization extends to neighborhood subbases (and so also neighborhood bases) of the given point ${\displaystyle x.}$ If the set ${\displaystyle S:=\{x\}\cup \left\{x_{a}:a\in A\right\}}$ is endowed with the subspace topology induced on it by ${\displaystyle X,}$ then ${\displaystyle \lim _{}x_{\bullet }\to x}$ in ${\displaystyle X}$ if and only if ${\displaystyle \lim _{}x_{\bullet }\to x}$ in ${\displaystyle S.}$ In this way, the question of whether or not the net ${\displaystyle x_{\bullet }}$ converges to the given point ${\displaystyle x}$ is depends solely on this topological subspace ${\displaystyle S}$ consisting of ${\displaystyle x}$ and the image of (i.e. the points of) the net ${\displaystyle x_{\bullet }.}$

### Limits in a Cartesian product

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

Symbolically, suppose that the Cartesian product

${\displaystyle X:=\prod _{i\in I}X_{i}}$

of the spaces ${\displaystyle \left(X_{i}\right)_{i\in I}}$ is endowed with the product topology and that for every index ${\displaystyle i\in I,}$ the canonical projection to ${\displaystyle X_{i}}$ is denoted by

${\displaystyle \pi _{i}:X=\prod _{j\in I}X_{j}\to X_{i}}$     and defined by     ${\displaystyle \left(x_{j}\right)_{j\in I}\mapsto x_{i}.}$

Let ${\displaystyle f_{\bullet }=\left(f_{a}\right)_{a\in A}}$ be a net in ${\displaystyle X=\prod _{i\in I}X_{i}}$ directed by ${\displaystyle A}$ and for every index ${\displaystyle i\in I,}$ let

${\displaystyle \pi _{i}\left(f_{\bullet }\right)~:=~\left(\pi _{i}\left(f_{a}\right)\right)_{a\in A}}$

denote the result of "plugging ${\displaystyle f_{\bullet }}$ into ${\displaystyle \pi _{i}}$", which results in the net ${\displaystyle \pi _{i}\left(f_{\bullet }\right):A\to X_{i}.}$ It is sometimes useful to think of this definition in terms of function composition: the net ${\displaystyle \pi _{i}\left(f_{\bullet }\right)}$ is equal to the composition of the net ${\displaystyle f_{\bullet }:A\to X}$ with the projection ${\displaystyle \pi _{i}:X\to X_{i}}$; that is, ${\displaystyle \pi _{i}\left(f_{\bullet }\right):=\pi _{i}\,\circ \,f_{\bullet }.}$

If given ${\displaystyle L=\left(L_{i}\right)_{i\in I}\in X,}$ then

${\displaystyle f_{\bullet }\to L}$ in ${\displaystyle X=\prod _{i}X_{i}}$  if and only if   for every ${\displaystyle \;i\in I,}$${\displaystyle \;\pi _{i}\left(f_{\bullet }\right):=\left(\pi _{i}\left(f_{a}\right)\right)_{a\in A}\;\to \;\pi _{i}(L)=L_{i}\;}$ in ${\displaystyle \;X_{i}.}$
Tychonoff's theorem and relation to the axiom of choice

If no ${\displaystyle L\in X}$ is given but for every ${\displaystyle i\in I,}$ there exists some ${\displaystyle L_{i}\in X_{i}}$ such that ${\displaystyle \pi _{i}\left(f_{\bullet }\right)\to L_{i}}$ in ${\displaystyle X_{i}}$ then the tuple defined by ${\displaystyle L:=\left(L_{i}\right)_{i\in I}}$ will be a limit of ${\displaystyle f_{\bullet }}$ in ${\displaystyle X.}$ However, the axiom of choice might be need to be assumed in order to conclude that this tuple ${\displaystyle L}$ exists; the axiom of choice is not needed in some situations, such as when ${\displaystyle I}$ is finite or when every ${\displaystyle L_{i}\in X_{i}}$ is the unique limit of the net ${\displaystyle \pi _{i}\left(f_{\bullet }\right)}$ (because then there is nothing to choose between), which happens for example, when every ${\displaystyle X_{i}}$ is a Hausdorff space. If ${\displaystyle I}$ is infinite and ${\displaystyle X=\prod _{j\in I}X_{j}}$ is not empty, then the axiom of choice would (in general) still be needed to conclude that the projections ${\displaystyle \pi _{i}:X\to X_{i}}$ 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.

### Ultranets and cluster points of a net

Let ${\displaystyle f}$ be a net in ${\displaystyle X}$ based on the directed set ${\displaystyle A}$ and let ${\displaystyle S}$ be a subset of ${\displaystyle X,}$ then ${\displaystyle f}$ is said to be frequently in (or cofinally in) ${\displaystyle S}$ if for every ${\displaystyle a\in A}$ there exists some ${\displaystyle b\in A}$ such that ${\displaystyle b\geq a}$ and ${\displaystyle f(b)\in S.}$

A point ${\displaystyle x\in X}$ is said to be an accumulation point or cluster point of a net if (and only if) for every neighborhood ${\displaystyle U}$ of ${\displaystyle x,}$ the net is frequently in ${\displaystyle U.}$

A net ${\displaystyle f}$ in set ${\displaystyle X}$ is called universal or an ultranet if for every subset ${\displaystyle S\subseteq X,}$${\displaystyle f}$ is eventually in ${\displaystyle S}$ or ${\displaystyle f}$ is eventually in ${\displaystyle X\setminus S.}$ Ultranets are closely related to ultrafilters.

## Examples

### Sequence in a topological space

A sequence ${\displaystyle a_{1},a_{2},\ldots }$ in a topological space ${\displaystyle X}$ can be considered a net in ${\displaystyle X}$ defined on ${\displaystyle \mathbb {N} .}$

The net is eventually in a subset ${\displaystyle S}$ of ${\displaystyle X}$ if there exists an ${\displaystyle N\in \mathbb {N} }$ such that for every integer ${\displaystyle n\geq N,}$ the point ${\displaystyle a_{n}}$ is in ${\displaystyle S.}$

So ${\displaystyle \lim {}_{n}a_{n}\to L}$ if and only if for every neighborhood ${\displaystyle V}$ of ${\displaystyle L,}$ the net is eventually in ${\displaystyle V.}$

The net is frequently in a subset ${\displaystyle S}$ of ${\displaystyle X}$ if and only if for every ${\displaystyle N\in \mathbb {N} }$ there exists some integer ${\displaystyle n\geq N}$ such that ${\displaystyle a_{n}\in S,}$ that is, if and only if infinitely many elements of the sequence are in ${\displaystyle S.}$ Thus a point ${\displaystyle y\in X}$ is a cluster point of the net if and only if every neighborhood ${\displaystyle V}$ of ${\displaystyle y}$ contains infinitely many elements of the sequence.

### Function from a metric space to a topological space

Consider a function from a metric space ${\displaystyle M}$ to a topological space ${\displaystyle X,}$ and a point ${\displaystyle c\in M.}$ We direct the set ${\displaystyle M\setminus \{c\}}$reversely according to distance from ${\displaystyle c,}$ that is, the relation is "has at least the same distance to ${\displaystyle c}$ as", so that "large enough" with respect to the relation means "close enough to ${\displaystyle c}$". The function ${\displaystyle f}$ is a net in ${\displaystyle X}$ defined on ${\displaystyle M\setminus \{c\}.}$

The net ${\displaystyle f}$ is eventually in a subset ${\displaystyle S}$ of ${\displaystyle X}$ if there exists some ${\displaystyle y\in M\setminus \{x\}}$ such that for every ${\displaystyle x\in M\setminus \{c\}}$ with ${\displaystyle d(x,c)\leq d(y,c)}$ the point ${\displaystyle f(x)}$ is in ${\displaystyle S.}$

So ${\displaystyle \lim _{x\to c}f(x)\to L}$ if and only if for every neighborhood ${\displaystyle V}$ of ${\displaystyle L,}$${\displaystyle f}$ is eventually in ${\displaystyle V.}$

The net ${\displaystyle f}$ is frequently in a subset ${\displaystyle S}$ of ${\displaystyle X}$ if and only if for every ${\displaystyle y\in M\setminus \{c\}}$ there exists some ${\displaystyle x\in M\setminus \{c\}}$ with ${\displaystyle d(x,c)\leq d(y,c)}$ such that ${\displaystyle f(x)}$ is in ${\displaystyle S.}$

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

### Function from a well-ordered set to a topological space

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

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

So ${\displaystyle \lim _{x\to t}f(x)\to L}$ if and only if for every neighborhood ${\displaystyle V}$ of ${\displaystyle L,}$${\displaystyle f}$ is eventually in ${\displaystyle V.}$

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

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

The first example is a special case of this with ${\displaystyle c=\omega .}$

## 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:

• A subset ${\displaystyle S\subseteq X}$ is open if and only if no net in ${\displaystyle X\setminus S}$ converges to a point of ${\displaystyle S.}$ [5] It is this characterization of open subsets that allows nets to characterize topologies.
• If ${\displaystyle S\subseteq X}$ is any subset then a point ${\displaystyle x\in X}$ is in the closure of ${\displaystyle S}$ if and only if there exists a net ${\displaystyle s_{\bullet }=\left(s_{a}\right)_{a\in A}}$ in ${\displaystyle S}$ with limit ${\displaystyle x\in X}$ and such that ${\displaystyle s_{a}\in S}$ for every index ${\displaystyle a\in A.}$
• A subset ${\displaystyle S\subseteq X}$ is closed if and only if whenever ${\displaystyle s_{\bullet }=\left(s_{a}\right)_{a\in A}}$ is a net with elements in ${\displaystyle S}$ and limit ${\displaystyle x\in X}$ in ${\displaystyle X,}$ then ${\displaystyle x\in S.}$
• A function ${\displaystyle f:X\to Y}$ between topological spaces is continuous at the point ${\displaystyle x}$ if and only if for every net ${\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}$ with
${\displaystyle \lim _{}x_{\bullet }\to x}$
implies
${\displaystyle \lim {}_{a}f\left(x_{a}\right)\to f(x).}$
This theorem is in general not true if "net" is replaced by "sequence". We have to allow for directed sets other than just the natural numbers if X is not first-countable (or not sequential).
• In general, a net in a space ${\displaystyle X}$ can have more than one limit, but if ${\displaystyle X}$ is a Hausdorff space, the limit of a net, if it exists, is unique. Conversely, if ${\displaystyle X}$ is not Hausdorff, then there exists a net on ${\displaystyle X}$ 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.
• The set of cluster points of a net is equal to the set of limits of its convergent subnets.
• 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.
• A space ${\displaystyle X}$ is compact if and only if every net ${\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}$ in ${\displaystyle X}$ has a subnet with a limit in ${\displaystyle X.}$ This can be seen as a generalization of the Bolzano–Weierstrass theorem and Heine–Borel theorem.
• If ${\displaystyle f:X\to Y}$ and ${\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}$ is an ultranet on ${\displaystyle X,}$ then ${\displaystyle \left(f\left(x_{a}\right)\right)_{a\in A}}$ is an ultranet on ${\displaystyle Y.}$

## Cauchy nets

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

A net ${\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}$ is a Cauchy net if for every entourage ${\displaystyle V}$ there exists ${\displaystyle c\in A}$ such that for all ${\displaystyle a,b\geq c,}$${\displaystyle \left(x_{a},x_{b}\right)}$ is a member of ${\displaystyle V.}$ [6] [7] More generally, in a Cauchy space, a net ${\displaystyle x_{\bullet }}$ 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.

## Relation to filters

A filter is another 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. [8] More specifically, for every filter base an associated net can be constructed, and convergence of the filter base implies convergence of the associated net—and the other way around (for every net there is a filter base, and convergence of the net implies convergence of the filter base). [9] For instance, any net ${\displaystyle \left(x_{a}\right)_{a\in A}}$ in ${\displaystyle X}$ induces a filter base of tails ${\displaystyle \{\{x_{a}:a\in A,a_{0}\leq a\}:a_{0}\in A\}}$ where the filter in ${\displaystyle X}$ generated by this filter base is called the net's eventuality filter. This correspondence allows for any theorem that can be proven with one concept to be proven with the other. [9] 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. [9] 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.

## Limit superior

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

For a net ${\displaystyle \left(x_{a}\right)_{a\in A},}$ put

${\displaystyle \limsup x_{a}=\lim _{a\in A}\sup _{b\succeq a}x_{b}=\inf _{a\in A}\sup _{b\succeq a}x_{b}.}$

Limit superior of a net of real numbers has many properties analogous to the case of sequences. For example,

${\displaystyle \limsup(x_{a}+y_{a})\leq \limsup x_{a}+\limsup y_{a},}$

where equality holds whenever one of the nets is convergent.

## Citations

1. Moore, E. H.; Smith, H. L. (1922). "A General Theory of Limits". American Journal of Mathematics. 44 (2): 102–121. doi:10.2307/2370388. JSTOR   2370388.
2. ( Sundström 2010 , p. 16n)
3. Megginson, p. 143
4. Kelley 1975, pp. 65-72.
5. Howes 1995, pp. 83-92.
6. Willard, Stephen (2012), General Topology, Dover Books on Mathematics, Courier Dover Publications, p. 260, ISBN   9780486131788 .
7. Joshi, K. D. (1983), Introduction to General Topology, New Age International, p. 356, ISBN   9780852264447 .
8. R. G. Bartle, Nets and Filters In Topology, American Mathematical Monthly, Vol. 62, No. 8 (1955), pp. 551–557.
9. Aliprantis-Border, p. 32
10. Megginson, p. 217, p. 221, Exercises 2.53–2.55
11. Beer, p. 2
12. Schechter, Sections 7.43–7.47

## Related Research Articles

In mathematics, more specifically in functional analysis, a Banach space is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and is complete in the sense that a Cauchy sequence of vectors always converges to a well defined limit that is within the space.

In mathematics, a continuous function is a function that does not have any abrupt changes in value, known as discontinuities. More precisely, a function is continuous if arbitrarily small changes in its output can be assured by restricting to sufficiently small changes in its input. If not continuous, a function is said to be discontinuous. Up until the 19th century, mathematicians largely relied on intuitive notions of continuity, during which attempts such as the epsilon–delta definition were made to formalize it.

In mathematical analysis, a metric space M is called complete if every Cauchy sequence of points in M has a limit that is also in M.

In mathematics, a filter is a special subset of a partially ordered set. 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 order ideal.

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members. The number of elements is called the length of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an index set that may not be numbers to another set of elements.

In mathematics, the limit inferior and limit superior of a sequence can be thought of as limiting bounds on the sequence. They can be thought of in a similar fashion for a function. For a set, they are the infimum and supremum of the set's limit points, respectively. In general, when there are multiple objects around which a sequence, function, or set accumulates, the inferior and superior limits extract the smallest and largest of them; the type of object and the measure of size is context-dependent, but the notion of extreme limits is invariant. Limit inferior is also called infimum limit, limit infimum, liminf, inferior limit, lower limit, or inner limit; limit superior is also known as supremum limit, limit supremum, limsup, superior limit, upper limit, or outer limit.

In mathematics, a topological vector space is one of the basic structures investigated in functional analysis. A topological vector space is a vector space which is also a topological space, this implies that vector space operations be continuous functions. More specifically, its topological space has a uniform topological structure, allowing a notion of uniform convergence.

In mathematics, a limit point of a set in a topological space is a point that can be "approximated" by points of in the sense that every neighbourhood of with respect to the topology on also contains a point of other than itself. A limit point of a set does not itself have to be an element of There is also a closely related concept for sequences. A cluster point or accumulation point of a sequence in a topological space is a point such that, for every neighbourhood of there are infinitely many natural numbers such that This definition of a cluster or accumulation point of a sequence generalizes to nets and filters. In contrast to sets, for a sequence, net, or filter, the term "limit point" is not synonymous with a "cluster/accumulation point". The similarly named notions of a limit point of a filter, a limit point of a sequence, or a limit point of a net; each of these respectively refers to a point that a filter, sequence, or net converges to.

In mathematics, the limit of a sequence is the value that the terms of a sequence "tend to", and is often denoted using the symbol. If such a limit exists, the sequence is called convergent. A sequence that does not converge is said to be divergent. The limit of a sequence is said to be the fundamental notion on which the whole of mathematical analysis ultimately rests.

In mathematics, pointwise convergence is one of various senses in which a sequence of functions can converge to a particular function. It is weaker than uniform convergence, to which it is often compared.

In functional analysis and related areas of mathematics, a sequence space is a vector space whose elements are infinite sequences of real or complex numbers. Equivalently, it is a function space whose elements are functions from the natural numbers to the field K of real or complex numbers. The set of all such functions is naturally identified with the set of all possible infinite sequences with elements in K, and can be turned into a vector space under the operations of pointwise addition of functions and pointwise scalar multiplication. All sequence spaces are linear subspaces of this space. Sequence spaces are typically equipped with a norm, or at least the structure of a topological vector space.

In topology and related fields of mathematics, a sequential space is a topological space that satisfies a very weak axiom of countability.

In topology and related areas of mathematics, a subnet is a generalization of the concept of subsequence to the case of nets. The definition is not completely straightforward, but is designed to allow as many theorems about subsequences to generalize to nets as possible.

In mathematics, a càdlàg, RCLL, or corlol function is a function defined on the real numbers that is everywhere right-continuous and has left limits everywhere. Càdlàg functions are important in the study of stochastic processes that admit jumps, unlike Brownian motion, which has continuous sample paths. The collection of càdlàg functions on a given domain is known as Skorokhod space.

In topology, a subfield of mathematics, filters are special families of subsets of a set that can be used to study topological spaces and define all basic topological notions such a convergence, continuity, compactness, and more. Filters also provide a common framework for defining various types of limits of functions such as limits from the left/right, to infinity, to a point or a set, and many others. Special types of filters called ultrafilters have many useful technical properties and they may often be used in place of arbitrary filters.

In functional analysis and related areas of mathematics, a complete topological vector space is a topological vector space (TVS) with the property that whenever points get progressively closer to each other, then there exists some point towards which they all get closer to. The notion of "points that get progressively closer" is made rigorous by Cauchy nets or Cauchy filters, which are generalizations of Cauchy sequences, while "point towards which they all get closer to" means that this net or filter converges to Unlike the notion of completeness for metric spaces, which it generalizes, the notion of completeness for TVSs does not depend on any metric and is defined for all TVSs, including those that are not metrizable or Hausdorff.

The strongest locally convex topological vector space (TVS) topology on the tensor product of two locally convex TVSs, making the canonical map continuous is called the projective topology or the π-topology. When is endowed with this topology then it is denoted by and called the projective tensor product of and

In functional analysis and related areas of mathematics, a metrizable topological vector space (TVS) is a TVS whose topology is induced by a metric. An LM-space is an inductive limit of a sequence of locally convex metrizable TVS.

In mathematics, particularly in functional analysis and topology, the closed graph theorem is a fundamental result stating that a linear operator with a closed graph will, under certain conditions, be continuous. The original result has been generalized many times so there are now many theorems referred to as "closed graph theorems."

In mathematics, a convergence space, also called a generalized convergence, is a set together with a relation called a convergence that satisfies certain properties relating elements of X with the family of filters on X. Convergence spaces generalize the notions of convergence that are found in point-set topology, including metric convergence and uniform convergence. Every topological space gives rise to a canonical convergence but there are convergences, known as non-topological convergences, that do not arise from any topological space. Examples of convergences that are in general non-topological include convergence in measure and almost everywhere convergence. Many topological properties have generalizations to convergence spaces.