Net (mathematics)

From Wikipedia, the free encyclopedia

In mathematics, more specifically in general topology and related branches, a net or Moore–Smith 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.

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 then it may also be referred to as a net in . Elements of a net's domain are called its indices. Explicitly, a net in is a function of the form where is some directed set. A directed set is a non-empty set together with a preorder, typically automatically assumed to be denoted by (unless indicated otherwise), with the property that it is also (upward) directed, which means that for any there exists some such that and In words, this property means that given any two elements (of ), 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 together with the usual integer comparison 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 is just a function from into 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 instead of the original (non-strict) preorder ; in particular, if a directed set has a greatest element then there does not exist any such that (in contrast, there always exists some such that ).

Nets are frequently denoted using notation that is similar to (and inspired by) that used with sequences. A net in may be denoted by where unless there is reason to think otherwise, it should automatically be assumed that the set is directed and that its associated preorder is denoted by However, notation for nets varies with some authors using, for instance, angled brackets instead of parentheses. A net in may also be written as which expresses the fact that this net is a function whose value at an element in its domain is denoted by instead of the usual parentheses notation 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 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 to a directed subset of 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 in a topological space, let denote the set of all neighbourhoods containing Then is a directed set, where the direction is given by reverse inclusion, so that if and only if is contained in For let be a point in Then is a net. As increases with respect to the points in the net are constrained to lie in decreasing neighbourhoods of so intuitively speaking, we are led to the idea that must tend towards in some sense. We can make this limiting concept precise.

Limits of nets[]

If is a net from a directed set into and if is a subset of then is said to be eventually in (or residually in ) if there exists some such that for every with the point A point is called a limit point or limit of the net in if (and only if)

for every open neighborhood of the net is eventually in

in which case, this net is then also said to converges to/towards and to have as a limit. If the net converges in to a point then this fact may be expressed by writing any of the following:

where if the topological space is clear from context then the words "in " may be omitted.

If in and if this limit in is unique (uniqueness in means that if is such that then necessarily ) then this fact may be indicated by writing

       or               or       

where an equals sign is used in place of the arrow [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 "" to mean without also requiring that the limit be unique; however, if this notation is defined in this way then the equals sign is no longer guaranteed to denote a transitive relationship and so no longer denotes equality. Specifically, without the uniqueness requirement, if are distinct and if each is also a limit of in then and could be written (using the equals sign ) despite it not being true that

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

Given a subbase for the topology on (where note that every base for a topology is also a subbase) and given a point a net in converges to if and only if it is eventually in every neighborhood of This characterization extends to neighborhood subbases (and so also neighborhood bases) of the given point If the set is endowed with the subspace topology induced on it by then in if and only if in In this way, the question of whether or not the net converges to the given point is depends solely on this topological subspace consisting of and the image of (i.e. the points of) the net

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

of the spaces is endowed with the product topology and that for every index the canonical projection to is denoted by

     and defined by     

Let be a net in directed by and for every index let

denote the result of "plugging into ", which results in the net It is sometimes useful to think of this definition in terms of function composition: the net is equal to the composition of the net with the projection ; that is,

If given then

in   if and only if   for every in
Tychonoff's theorem and relation to the axiom of choice

If no is given but for every there exists some such that in then the tuple defined by will be a limit of in However, the axiom of choice might be need to be assumed in order to conclude that this tuple exists; the axiom of choice is not needed in some situations, such as when is finite or when every is the unique limit of the net (because then there is nothing to choose between), which happens for example, when every is a Hausdorff space. If is infinite and is not empty, then the axiom of choice would (in general) still be needed to conclude that the projections 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 be a net in based on the directed set and let be a subset of then is said to be frequently in (or cofinally in) if for every there exists some such that and

A point is said to be an accumulation point or cluster point of a net if (and only if) for every neighborhood of the net is frequently in

A net in set is called universal or an ultranet if for every subset is eventually in or is eventually in Ultranets are closely related to ultrafilters.

Examples of limits of nets[]

Examples[]

Sequence in a topological space[]

A sequence in a topological space can be considered a net in defined on

The net is eventually in a subset of if there exists an such that for every integer the point is in

So if and only if for every neighborhood of the net is eventually in

The net is frequently in a subset of if and only if for every there exists some integer such that that is, if and only if infinitely many elements of the sequence are in Thus a point is a cluster point of the net if and only if every neighborhood of contains infinitely many elements of the sequence.

Function from a metric space to a topological space[]

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

The net is eventually in a subset of if there exists some such that for every with the point is in

So if and only if for every neighborhood of is eventually in

The net is frequently in a subset of if and only if for every there exists some with such that is in

A point is a cluster point of the net if and only if for every neighborhood of the net is frequently in

Function from a well-ordered set to a topological space[]

Consider a well-ordered set with limit point and a function from to a topological space This function is a net on

It is eventually in a subset of if there exists an such that for every the point is in

So if and only if for every neighborhood of is eventually in

The net is frequently in a subset of if and only if for every there exists some such that

A point is a cluster point of the net if and only if for every neighborhood of the net is frequently in

The first example is a special case of this with

See also ordinal-indexed sequence.

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 is open if and only if no net in converges to a point of [5] It is this characterization of open subsets that allows nets to characterize topologies.
  • If is any subset then a point is in the closure of if and only if there exists a net in with limit and such that for every index
  • A subset is closed if and only if whenever is a net with elements in and limit in then
  • A function between topological spaces is continuous at the point if and only if for every net with
implies
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 can have more than one limit, but if is a Hausdorff space, the limit of a net, if it exists, is unique. Conversely, if is not Hausdorff, then there exists a net on 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 is compact if and only if every net in has a subnet with a limit in This can be seen as a generalization of the Bolzano–Weierstrass theorem and Heine–Borel theorem.
  • If and is an ultranet on then is an ultranet on

Cauchy nets[]

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

A net is a Cauchy net if for every entourage there exists such that for all is a member of [6][7] More generally, in a Cauchy space, a net 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 in induces a filter base of tails where the filter in 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 put

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

where equality holds whenever one of the nets is convergent.

See also[]

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. ^ Jump up to: a b Kelley 1975, pp. 65–72.
  5. ^ Howes 1995, pp. 83–92.
  6. ^ Jump up to: a b 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. ^ http://www.math.wichita.edu/~pparker/classes/handout/netfilt.pdf
  9. ^ Jump up to: a b c R. G. Bartle, Nets and Filters In Topology, American Mathematical Monthly, Vol. 62, No. 8 (1955), pp. 551–557.
  10. ^ Aliprantis-Border, p. 32
  11. ^ Megginson, p. 217, p. 221, Exercises 2.53–2.55
  12. ^ Beer, p. 2
  13. ^ Schechter, Sections 7.43–7.47

References[]

Retrieved from ""