fbpx
Wikipedia

Net (mathematics)

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 between topological spaces and :

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

While condition 1 always guarantees condition 2, the converse is not necessarily true if the topological spaces are not both first-countable. In particular, the two conditions are equivalent for metric spaces. The spaces for which the converse holds are the sequential 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 behavior. 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 not be general enough in the context of metric spaces. A related notion, that of the filter, was developed in 1937 by Henri Cartan.

Definitions Edit

Any function whose domain is a directed set is called a net. If this function takes values in some set   then it may also be referred to as a net in   Explicitly, a net in   is a function of the form   where   is some directed set. Elements of a net's domain are called its indices. 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 (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. 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 (that is, 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 Edit

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.

A subnet of a sequence is not necessarily a sequence.[4] For an example, let   and let   for every   so that   is the constant zero sequence. Let   be directed by the usual order   and let   for each   Define   by letting   be the ceiling of   The map   is an order morphism whose image is cofinal in its codomain and   holds for every   This shows that   is a subnet of the sequence   (where this subnet is not a subsequence of   because it is not even a sequence since its domain is an uncountable set).

Limits of nets Edit

A net   is said to be eventually or residually in a set   if there exists some   such that for every   with   the point   And it is said to be frequently or cofinally in   if for every   there exists some   such that   and  [4] A point is called a limit point (respectively, cluster point) of a net if that net is eventually (respectively, cofinally) in every neighborhood of that point.

Explicitly, a point   is said to be an accumulation point or cluster point of a net if for every neighborhood   of   the net is frequently in  [4]

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 converge to/towards   and to have   as a limit.

Intuitively, convergence of a 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.

Notation for limits

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

 
where an equals sign is used in place of the arrow  [5] 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.[5] 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   being false.

Bases and subbases

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  

Convergence in metric spaces

Suppose   is a metric space (or a pseudometric space) and   is endowed with the metric topology. If   is a point and   is a net, then   in   if and only if   in   where   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   is a normed space (or a seminormed space) then   in   if and only if   in   where  

Convergence in topological subspaces

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   depends solely on this topological subspace   consisting of   and the image of (that is, the points of) the net  

Limits in a Cartesian product Edit

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

Explicitly, let   be topological spaces, endow their Cartesian product

 
with the product topology, and that for every index   denote the canonical projection to   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,  

For any given point   the net   converges to   in the product space   if and only if for every index     converges to   in  [6] And whenever the net   clusters at   in   then   clusters at   for every index  [7] However, the converse does not hold in general.[7] For example, suppose   and let   denote the sequence   that alternates between   and   Then   and   are cluster points of both   and   in   but   is not a cluster point of   since the open ball of radius   centered at   does not contain even a single point  

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.

Cluster points of a net Edit

A point   is a cluster point of a given net if and only if it has a subset that converges to  [8] If   is a net in   then the set of all cluster points of   in   is equal to[7]

 
where   for each   If   is a cluster point of some subnet of   then   is also a cluster point of  [8]

Ultranets Edit

A net   in set   is called a universal net or an ultranet if for every subset     is eventually in   or   is eventually in the complement  [4]Ultranets are closely related to ultrafilters.

Every constant net is an ultranet. Every subnet of an ultranet is an ultranet.[7] Every net has some subnet that is an ultranet.[4] If   is an ultranet in   and   is a function then   is an ultranet in  [4]

Given   an ultranet clusters at   if and only it converges to  [4]

Examples of limits of nets Edit

Every limit of a sequence and limit of a function can be interpreted as a limit of a net (as described below).

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.

Interpret the set   of all functions with prototype   as the Cartesian product   (by identifying a function   with the tuple   and conversely) and endow it with the product topology. This (product) topology on   is identical to the topology of pointwise convergence. Let   denote the set of all functions   that are equal to   everywhere except for at most finitely many points (that is, such that the set   is finite). Then the constant   function   belongs to the closure of   in   that is,  [7] This will be proven by constructing a net in   that converges to   However, there does not exist any sequence in   that converges to  [9] which makes this one instance where (non-sequence) nets must be used because sequences alone can not reach the desired conclusion. Compare elements of   pointwise in the usual way by declaring that   if and only if   for all   This pointwise comparison is a partial order that makes   a directed set since given any   their pointwise minimum   belongs to   and satisfies   and   This partial order turns the identity map   (defined by  ) into an  -valued net. This net converges pointwise to   in   which implies that   belongs to the closure of   in  

Examples Edit

Sequence in a topological space Edit

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 Edit

Fix a point   in a metric space   that has at least two point (such as   with the Euclidean metric with   being the origin, for example) and direct the set   reversely according to distance from   by declaring that   if and only if   In other words, the relation is "has at least the same distance to   as", so that "large enough" with respect to this relation means "close enough to  ". Given any function with domain   its restriction to   can be canonically interpreted as a net directed by  [7]

A net   is eventually in a subset   of a topological space   if and only if there exists some   such that for every   satisfying   the point   is in   Such a net   converges in   to a given point   if and only if   in the usual sense (meaning that for every neighborhood   of     is eventually in  ).[7]

The net   is frequently in a subset   of   if and only if for every   there exists some   with   such that   is in   Consequently, 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 Edit

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.

Subnets Edit

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,[10] which is as follows: If   and   are nets then   is called a subnet or Willard-subnet[10] of   if there exists an order-preserving map   such that   is a cofinal subset of   and

 
The map   is called order-preserving and an order homomorphism if whenever   then   The set   being cofinal in   means that for every   there exists some   such that  

Properties Edit

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:

Characterizations of topological properties Edit

Closed sets and closure

A subset   is closed in   if and only if every limit point of every convergent net in   necessarily belongs to   Explicitly, a subset   is closed if and only if whenever   and   is a net valued in   (meaning that   for all  ) such that   in   then necessarily  

More generally, if   is any subset then a point

mathematics, this, article, about, nets, topological, spaces, unfoldings, polyhedra, polyhedron, mathematics, more, specifically, general, topology, related, branches, moore, smith, sequence, generalization, notion, sequence, essence, sequence, function, whose. This article is about nets in topological spaces For unfoldings of polyhedra see Net polyhedron 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 displaystyle f between topological spaces X displaystyle X and Y displaystyle Y The map f displaystyle f is continuous in the topological sense Given any point x displaystyle x in X displaystyle X and any sequence in X displaystyle X converging to x displaystyle x the composition of f displaystyle f with this sequence converges to f x displaystyle f x continuous in the sequential sense While condition 1 always guarantees condition 2 the converse is not necessarily true if the topological spaces are not both first countable In particular the two conditions are equivalent for metric spaces The spaces for which the converse holds are the sequential 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 behavior 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 not be general enough in the context of metric spaces A related notion that of the filter was developed in 1937 by Henri Cartan Contents 1 Definitions 2 Examples of nets 3 Limits of nets 3 1 Limits in a Cartesian product 3 2 Cluster points of a net 3 3 Ultranets 3 4 Examples of limits of nets 4 Examples 4 1 Sequence in a topological space 4 2 Function from a metric space to a topological space 4 3 Function from a well ordered set to a topological space 4 4 Subnets 5 Properties 5 1 Characterizations of topological properties 5 2 Cluster and limit points 5 3 Other properties 6 Cauchy nets 7 Relation to filters 8 Limit superior 9 See also 10 Citations 11 ReferencesDefinitions EditAny function whose domain is a directed set is called a net If this function takes values in some set X displaystyle X nbsp then it may also be referred to as a net in X displaystyle X nbsp Explicitly a net in X displaystyle X nbsp is a function of the form f A X displaystyle f A to X nbsp where A displaystyle A nbsp is some directed set Elements of a net s domain are called its indices A directed set is a non empty set A displaystyle A nbsp together with a preorder typically automatically assumed to be denoted by displaystyle leq nbsp unless indicated otherwise with the property that it is also upward directed which means that for any a b A displaystyle a b in A nbsp there exists some c A displaystyle c in A nbsp such that a c displaystyle a leq c nbsp and b c displaystyle b leq c nbsp In words this property means that given any two elements of A displaystyle A nbsp 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 The natural numbers N displaystyle mathbb N nbsp together with the usual integer comparison displaystyle leq nbsp 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 X displaystyle X nbsp is just a function from N 1 2 displaystyle mathbb N 1 2 ldots nbsp into X displaystyle X nbsp 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 lt displaystyle lt nbsp instead of the original non strict preorder displaystyle leq nbsp in particular if a directed set A displaystyle A leq nbsp has a greatest element a A displaystyle a in A nbsp then there does not exist any b A displaystyle b in A nbsp such that a lt b displaystyle a lt b nbsp in contrast there always exists some b A displaystyle b in A nbsp such that a b displaystyle a leq b nbsp Nets are frequently denoted using notation that is similar to and inspired by that used with sequences A net in X displaystyle X nbsp may be denoted by x a a A displaystyle left x a right a in A nbsp where unless there is reason to think otherwise it should automatically be assumed that the set A displaystyle A nbsp is directed and that its associated preorder is denoted by displaystyle leq nbsp However notation for nets varies with some authors using for instance angled brackets x a a A displaystyle left langle x a right rangle a in A nbsp instead of parentheses A net in X displaystyle X nbsp may also be written as x x a a A displaystyle x bullet left x a right a in A nbsp which expresses the fact that this net x displaystyle x bullet nbsp is a function x A X displaystyle x bullet A to X nbsp whose value at an element a displaystyle a nbsp in its domain is denoted by x a displaystyle x a nbsp instead of the usual parentheses notation x a displaystyle x bullet a nbsp 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 that is elements a A displaystyle a in A nbsp 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 Frechet 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 f displaystyle f nbsp to a directed subset of A displaystyle A nbsp see the linked page for a definition Examples of nets EditEvery 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 x displaystyle x nbsp in a topological space let N x displaystyle N x nbsp denote the set of all neighbourhoods containing x displaystyle x nbsp Then N x displaystyle N x nbsp is a directed set where the direction is given by reverse inclusion so that S T displaystyle S geq T nbsp if and only if S displaystyle S nbsp is contained in T displaystyle T nbsp For S N x displaystyle S in N x nbsp let x S displaystyle x S nbsp be a point in S displaystyle S nbsp Then x S displaystyle left x S right nbsp is a net As S displaystyle S nbsp increases with respect to displaystyle geq nbsp the points x S displaystyle x S nbsp in the net are constrained to lie in decreasing neighbourhoods of x displaystyle x nbsp so intuitively speaking we are led to the idea that x S displaystyle x S nbsp must tend towards x displaystyle x nbsp in some sense We can make this limiting concept precise A subnet of a sequence is not necessarily a sequence 4 For an example let X R n displaystyle X mathbb R n nbsp and let x i 0 displaystyle x i 0 nbsp for every i N displaystyle i in mathbb N nbsp so that x 0 i N N X displaystyle x bullet 0 i in mathbb N mathbb N to X nbsp is the constant zero sequence Let I r R r gt 0 displaystyle I r in mathbb R r gt 0 nbsp be directed by the usual order displaystyle leq nbsp and let s r 0 displaystyle s r 0 nbsp for each r R displaystyle r in R nbsp Define f I N displaystyle varphi I to mathbb N nbsp by letting f r r displaystyle varphi r lceil r rceil nbsp be the ceiling of r displaystyle r nbsp The map f I N displaystyle varphi I to mathbb N nbsp is an order morphism whose image is cofinal in its codomain and x f r x f r 0 s r displaystyle left x bullet circ varphi right r x varphi r 0 s r nbsp holds for every r R displaystyle r in R nbsp This shows that s r r R x f displaystyle left s r right r in R x bullet circ varphi nbsp is a subnet of the sequence x displaystyle x bullet nbsp where this subnet is not a subsequence of x displaystyle x bullet nbsp because it is not even a sequence since its domain is an uncountable set Limits of nets EditA net x x a a A displaystyle x bullet left x a right a in A nbsp is said to be eventually or residually in a set S displaystyle S nbsp if there exists some a A displaystyle a in A nbsp such that for every b A displaystyle b in A nbsp with b a displaystyle b geq a nbsp the point x b S displaystyle x b in S nbsp And it is said to be frequently or cofinally in S displaystyle S nbsp if for every a A displaystyle a in A nbsp there exists some b A displaystyle b in A nbsp such that b a displaystyle b geq a nbsp and x b S displaystyle x b in S nbsp 4 A point is called a limit point respectively cluster point of a net if that net is eventually respectively cofinally in every neighborhood of that point Explicitly a point x X displaystyle x in X nbsp is said to be an accumulation point or cluster point of a net if for every neighborhood U displaystyle U nbsp of x displaystyle x nbsp the net is frequently in U displaystyle U nbsp 4 A point x X displaystyle x in X nbsp is called a limit point or limit of the net x displaystyle x bullet nbsp in X displaystyle X nbsp if and only if for every open neighborhood U displaystyle U nbsp of x displaystyle x nbsp the net x displaystyle x bullet nbsp is eventually in U displaystyle U nbsp in which case this net is then also said to converge to towards x displaystyle x nbsp and to have x displaystyle x nbsp as a limit Intuitively convergence of a net x a a A displaystyle left x a right a in A nbsp means that the values x a displaystyle x a nbsp come and stay as close as we want to x displaystyle x nbsp for large enough a displaystyle a nbsp The example net given above on the neighborhood system of a point x displaystyle x nbsp does indeed converge to x displaystyle x nbsp according to this definition Notation for limitsIf the net x displaystyle x bullet nbsp converges in X displaystyle X nbsp to a point x X displaystyle x in X nbsp then this fact may be expressed by writing any of the following x x in X x a x in X lim x x in X lim a A x a x in X lim a x a x in X displaystyle begin alignedat 4 amp x bullet amp amp to amp amp x amp amp text in X amp x a amp amp to amp amp x amp amp text in X lim amp x bullet amp amp to amp amp x amp amp text in X lim a in A amp x a amp amp to amp amp x amp amp text in X lim a amp x a amp amp to amp amp x amp amp text in X end alignedat nbsp where if the topological space X displaystyle X nbsp is clear from context then the words in X displaystyle X nbsp may be omitted If lim x x displaystyle lim x bullet to x nbsp in X displaystyle X nbsp and if this limit in X displaystyle X nbsp is unique uniqueness in X displaystyle X nbsp means that if y X displaystyle y in X nbsp is such that lim x y displaystyle lim x bullet to y nbsp then necessarily x y displaystyle x y nbsp then this fact may be indicated by writinglim x x or lim x a x or lim a A x a x displaystyle lim x bullet x text or lim x a x text or lim a in A x a x nbsp where an equals sign is used in place of the arrow displaystyle to nbsp 5 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 5 Some authors instead use the notation lim x x displaystyle lim x bullet x nbsp to mean lim x x displaystyle lim x bullet to x nbsp without also requiring that the limit be unique however if this notation is defined in this way then the equals sign displaystyle nbsp is no longer guaranteed to denote a transitive relationship and so no longer denotes equality Specifically without the uniqueness requirement if x y X displaystyle x y in X nbsp are distinct and if each is also a limit of x displaystyle x bullet nbsp in X displaystyle X nbsp then lim x x displaystyle lim x bullet x nbsp and lim x y displaystyle lim x bullet y nbsp could be written using the equals sign displaystyle nbsp despite x y displaystyle x y nbsp being false Bases and subbasesGiven a subbase B displaystyle mathcal B nbsp for the topology on X displaystyle X nbsp where note that every base for a topology is also a subbase and given a point x X displaystyle x in X nbsp a net x displaystyle x bullet nbsp in X displaystyle X nbsp converges to x displaystyle x nbsp if and only if it is eventually in every neighborhood U B displaystyle U in mathcal B nbsp of x displaystyle x nbsp This characterization extends to neighborhood subbases and so also neighborhood bases of the given point x displaystyle x nbsp Convergence in metric spacesSuppose X d displaystyle X d nbsp is a metric space or a pseudometric space and X displaystyle X nbsp is endowed with the metric topology If x X displaystyle x in X nbsp is a point and x x i a A displaystyle x bullet left x i right a in A nbsp is a net then x x displaystyle x bullet to x nbsp in X d displaystyle X d nbsp if and only if d x x 0 displaystyle d left x x bullet right to 0 nbsp in R displaystyle mathbb R nbsp where d x x d x x a a A displaystyle d left x x bullet right left d left x x a right right a in A nbsp 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 X displaystyle X cdot nbsp is a normed space or a seminormed space then x x displaystyle x bullet to x nbsp in X displaystyle X cdot nbsp if and only if x x 0 displaystyle left x x bullet right to 0 nbsp in R displaystyle mathbb R nbsp where x x x x a a A displaystyle left x x bullet right left left x x a right right a in A nbsp Convergence in topological subspacesIf the set S x x a a A displaystyle S x cup left x a a in A right nbsp is endowed with the subspace topology induced on it by X displaystyle X nbsp then lim x x displaystyle lim x bullet to x nbsp in X displaystyle X nbsp if and only if lim x x displaystyle lim x bullet to x nbsp in S displaystyle S nbsp In this way the question of whether or not the net x displaystyle x bullet nbsp converges to the given point x displaystyle x nbsp depends solely on this topological subspace S displaystyle S nbsp consisting of x displaystyle x nbsp and the image of that is the points of the net x displaystyle x bullet nbsp Limits in a Cartesian product Edit A net in the product space has a limit if and only if each projection has a limit Explicitly let X i i I displaystyle left X i right i in I nbsp be topological spaces endow their Cartesian product X i I X i displaystyle textstyle prod X bullet prod i in I X i nbsp with the product topology and that for every index l I displaystyle l in I nbsp denote the canonical projection to X l displaystyle X l nbsp by p l X X l x i i I x l displaystyle begin alignedat 4 pi l amp amp textstyle prod X bullet amp amp to amp X l 0 3ex amp amp left x i right i in I amp amp mapsto amp x l end alignedat nbsp Let f f a a A displaystyle f bullet left f a right a in A nbsp be a net in X displaystyle textstyle prod X bullet nbsp directed by A displaystyle A nbsp and for every index i I displaystyle i in I nbsp letp i f def p i f a a A displaystyle pi i left f bullet right stackrel scriptscriptstyle text def left pi i left f a right right a in A nbsp denote the result of plugging f displaystyle f bullet nbsp into p i displaystyle pi i nbsp which results in the net p i f A X i displaystyle pi i left f bullet right A to X i nbsp It is sometimes useful to think of this definition in terms of function composition the net p i f displaystyle pi i left f bullet right nbsp is equal to the composition of the net f A X displaystyle f bullet A to textstyle prod X bullet nbsp with the projection p i X X i displaystyle pi i textstyle prod X bullet to X i nbsp that is p i f def p i f displaystyle pi i left f bullet right stackrel scriptscriptstyle text def pi i circ f bullet nbsp For any given point L L i i I i I X i displaystyle L left L i right i in I in textstyle prod limits i in I X i nbsp the net f displaystyle f bullet nbsp converges to L displaystyle L nbsp in the product space X displaystyle textstyle prod X bullet nbsp if and only if for every index i I displaystyle i in I nbsp p i f def p i f a a A displaystyle pi i left f bullet right stackrel scriptscriptstyle text def left pi i left f a right right a in A nbsp converges to L i displaystyle L i nbsp in X i displaystyle X i nbsp 6 And whenever the net f displaystyle f bullet nbsp clusters at L displaystyle L nbsp in X displaystyle textstyle prod X bullet nbsp then p i f displaystyle pi i left f bullet right nbsp clusters at L i displaystyle L i nbsp for every index i I displaystyle i in I nbsp 7 However the converse does not hold in general 7 For example suppose X 1 X 2 R displaystyle X 1 X 2 mathbb R nbsp and let f f a a N displaystyle f bullet left f a right a in mathbb N nbsp denote the sequence 1 1 0 0 1 1 0 0 displaystyle 1 1 0 0 1 1 0 0 ldots nbsp that alternates between 1 1 displaystyle 1 1 nbsp and 0 0 displaystyle 0 0 nbsp Then L 1 0 displaystyle L 1 0 nbsp and L 2 1 displaystyle L 2 1 nbsp are cluster points of both p 1 f displaystyle pi 1 left f bullet right nbsp and p 2 f displaystyle pi 2 left f bullet right nbsp in X 1 X 2 R 2 displaystyle X 1 times X 2 mathbb R 2 nbsp but L 1 L 2 0 1 displaystyle left L 1 L 2 right 0 1 nbsp is not a cluster point of f displaystyle f bullet nbsp since the open ball of radius 1 displaystyle 1 nbsp centered at 0 1 displaystyle 0 1 nbsp does not contain even a single point f displaystyle f bullet nbsp Tychonoff s theorem and relation to the axiom of choiceIf no L X displaystyle L in X nbsp is given but for every i I displaystyle i in I nbsp there exists some L i X i displaystyle L i in X i nbsp such that p i f L i displaystyle pi i left f bullet right to L i nbsp in X i displaystyle X i nbsp then the tuple defined by L L i i I displaystyle L left L i right i in I nbsp will be a limit of f displaystyle f bullet nbsp in X displaystyle X nbsp However the axiom of choice might be need to be assumed in order to conclude that this tuple L displaystyle L nbsp exists the axiom of choice is not needed in some situations such as when I displaystyle I nbsp is finite or when every L i X i displaystyle L i in X i nbsp is the unique limit of the net p i f displaystyle pi i left f bullet right nbsp because then there is nothing to choose between which happens for example when every X i displaystyle X i nbsp is a Hausdorff space If I displaystyle I nbsp is infinite and X j I X j displaystyle textstyle prod X bullet textstyle prod limits j in I X j nbsp is not empty then the axiom of choice would in general still be needed to conclude that the projections p i X X i displaystyle pi i textstyle prod X bullet to X i nbsp 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 Cluster points of a net Edit A point x X displaystyle x in X nbsp is a cluster point of a given net if and only if it has a subset that converges to x displaystyle x nbsp 8 If x x a a A displaystyle x bullet left x a right a in A nbsp is a net in X displaystyle X nbsp then the set of all cluster points of x displaystyle x bullet nbsp in X displaystyle X nbsp is equal to 7 a A cl X x a displaystyle bigcap a in A operatorname cl X left x geq a right nbsp where x a x b b a b A displaystyle x geq a left x b b geq a b in A right nbsp for each a A displaystyle a in A nbsp If x X displaystyle x in X nbsp is a cluster point of some subnet of x displaystyle x bullet nbsp then x displaystyle x nbsp is also a cluster point of x displaystyle x bullet nbsp 8 Ultranets Edit A net x displaystyle x bullet nbsp in set X displaystyle X nbsp is called a universal net or an ultranet if for every subset S X displaystyle S subseteq X nbsp x displaystyle x bullet nbsp is eventually in S displaystyle S nbsp or x displaystyle x bullet nbsp is eventually in the complement X S displaystyle X setminus S nbsp 4 Ultranets are closely related to ultrafilters Every constant net is an ultranet Every subnet of an ultranet is an ultranet 7 Every net has some subnet that is an ultranet 4 If x x a a A displaystyle x bullet left x a right a in A nbsp is an ultranet in X displaystyle X nbsp and f X Y displaystyle f X to Y nbsp is a function then f x f x a a A displaystyle f circ x bullet left f left x a right right a in A nbsp is an ultranet in Y displaystyle Y nbsp 4 Given x X displaystyle x in X nbsp an ultranet clusters at x displaystyle x nbsp if and only it converges to x displaystyle x nbsp 4 Examples of limits of nets Edit Every limit of a sequence and limit of a function can be interpreted as a limit of a net as described below 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 Interpret the set R R displaystyle mathbb R mathbb R nbsp of all functions with prototype f R R displaystyle f mathbb R to mathbb R nbsp as the Cartesian product x R R displaystyle textstyle prod limits x in mathbb R mathbb R nbsp by identifying a function f displaystyle f nbsp with the tuple f x x R displaystyle f x x in mathbb R nbsp and conversely and endow it with the product topology This product topology on R R displaystyle mathbb R mathbb R nbsp is identical to the topology of pointwise convergence Let E displaystyle E nbsp denote the set of all functions f R 0 1 displaystyle f mathbb R to 0 1 nbsp that are equal to 1 displaystyle 1 nbsp everywhere except for at most finitely many points that is such that the set x f x 0 displaystyle x f x 0 nbsp is finite Then the constant 0 displaystyle 0 nbsp function 0 R 0 displaystyle mathbf 0 mathbb R to 0 nbsp belongs to the closure of E displaystyle E nbsp in R R displaystyle mathbb R mathbb R nbsp that is 0 cl R R E displaystyle mathbf 0 in operatorname cl mathbb R mathbb R E nbsp 7 This will be proven by constructing a net in E displaystyle E nbsp that converges to 0 displaystyle mathbf 0 nbsp However there does not exist any sequence in E displaystyle E nbsp that converges to 0 displaystyle mathbf 0 nbsp 9 which makes this one instance where non sequence nets must be used because sequences alone can not reach the desired conclusion Compare elements of R R displaystyle mathbb R mathbb R nbsp pointwise in the usual way by declaring that f g displaystyle f geq g nbsp if and only if f x g x displaystyle f x geq g x nbsp for all x displaystyle x nbsp This pointwise comparison is a partial order that makes E displaystyle E geq nbsp a directed set since given any f g E displaystyle f g in E nbsp their pointwise minimum m min f g displaystyle m min f g nbsp belongs to E displaystyle E nbsp and satisfies f m displaystyle f geq m nbsp and g m displaystyle g geq m nbsp This partial order turns the identity map Id E E displaystyle operatorname Id E geq to E nbsp defined by f f displaystyle f mapsto f nbsp into an E displaystyle E nbsp valued net This net converges pointwise to 0 displaystyle mathbf 0 nbsp in R R displaystyle mathbb R mathbb R nbsp which implies that 0 displaystyle mathbf 0 nbsp belongs to the closure of E displaystyle E nbsp in R R displaystyle mathbb R mathbb R nbsp Examples EditSequence in a topological space Edit A sequence a 1 a 2 displaystyle a 1 a 2 ldots nbsp in a topological space X displaystyle X nbsp can be considered a net in X displaystyle X nbsp defined on N displaystyle mathbb N nbsp The net is eventually in a subset S displaystyle S nbsp of X displaystyle X nbsp if there exists an N N displaystyle N in mathbb N nbsp such that for every integer n N displaystyle n geq N nbsp the point a n displaystyle a n nbsp is in S displaystyle S nbsp So lim n a n L displaystyle lim n a n to L nbsp if and only if for every neighborhood V displaystyle V nbsp of L displaystyle L nbsp the net is eventually in V displaystyle V nbsp The net is frequently in a subset S displaystyle S nbsp of X displaystyle X nbsp if and only if for every N N displaystyle N in mathbb N nbsp there exists some integer n N displaystyle n geq N nbsp such that a n S displaystyle a n in S nbsp that is if and only if infinitely many elements of the sequence are in S displaystyle S nbsp Thus a point y X displaystyle y in X nbsp is a cluster point of the net if and only if every neighborhood V displaystyle V nbsp of y displaystyle y nbsp contains infinitely many elements of the sequence Function from a metric space to a topological space Edit Fix a point c M displaystyle c in M nbsp in a metric space M d displaystyle M d nbsp that has at least two point such as M R n displaystyle M mathbb R n nbsp with the Euclidean metric with c 0 displaystyle c 0 nbsp being the origin for example and direct the set I M c displaystyle I M setminus c nbsp reversely according to distance from c displaystyle c nbsp by declaring that i j displaystyle i leq j nbsp if and only if d j c d i c displaystyle d j c leq d i c nbsp In other words the relation is has at least the same distance to c displaystyle c nbsp as so that large enough with respect to this relation means close enough to c displaystyle c nbsp Given any function with domain M displaystyle M nbsp its restriction to I M c displaystyle I M setminus c nbsp can be canonically interpreted as a net directed by I displaystyle I leq nbsp 7 A net f M c X displaystyle f M setminus c to X nbsp is eventually in a subset S displaystyle S nbsp of a topological space X displaystyle X nbsp if and only if there exists some n M c displaystyle n in M setminus c nbsp such that for every m M c displaystyle m in M setminus c nbsp satisfying d m c d n c displaystyle d m c leq d n c nbsp the point f m displaystyle f m nbsp is in S displaystyle S nbsp Such a net f displaystyle f nbsp converges in X displaystyle X nbsp to a given point L X displaystyle L in X nbsp if and only if lim m c f m L displaystyle lim m to c f m to L nbsp in the usual sense meaning that for every neighborhood V displaystyle V nbsp of L displaystyle L nbsp f displaystyle f nbsp is eventually in V displaystyle V nbsp 7 The net f M c X displaystyle f M setminus c to X nbsp is frequently in a subset S displaystyle S nbsp of X displaystyle X nbsp if and only if for every n M c displaystyle n in M setminus c nbsp there exists some m M c displaystyle m in M setminus c nbsp with d m c d n c displaystyle d m c leq d n c nbsp such that f m displaystyle f m nbsp is in S displaystyle S nbsp Consequently a point L X displaystyle L in X nbsp is a cluster point of the net f displaystyle f nbsp if and only if for every neighborhood V displaystyle V nbsp of L displaystyle L nbsp the net is frequently in V displaystyle V nbsp Function from a well ordered set to a topological space Edit Consider a well ordered set 0 c displaystyle 0 c nbsp with limit point t displaystyle t nbsp and a function f displaystyle f nbsp from 0 t displaystyle 0 t nbsp to a topological space X displaystyle X nbsp This function is a net on 0 t displaystyle 0 t nbsp It is eventually in a subset V displaystyle V nbsp of X displaystyle X nbsp if there exists an r 0 t displaystyle r in 0 t nbsp such that for every s r t displaystyle s in r t nbsp the point f s displaystyle f s nbsp is in V displaystyle V nbsp So lim x t f x L displaystyle lim x to t f x to L nbsp if and only if for every neighborhood V displaystyle V nbsp of L displaystyle L nbsp f displaystyle f nbsp is eventually in V displaystyle V nbsp The net f displaystyle f nbsp is frequently in a subset V displaystyle V nbsp of X displaystyle X nbsp if and only if for every r 0 t displaystyle r in 0 t nbsp there exists some s r t displaystyle s in r t nbsp such that f s V displaystyle f s in V nbsp A point y X displaystyle y in X nbsp is a cluster point of the net f displaystyle f nbsp if and only if for every neighborhood V displaystyle V nbsp of y displaystyle y nbsp the net is frequently in V displaystyle V nbsp The first example is a special case of this with c w displaystyle c omega nbsp See also ordinal indexed sequence Subnets Edit Main article Subnet mathematics See also Filters in topology 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 10 which is as follows If x x a a A displaystyle x bullet left x a right a in A nbsp and s s i i I displaystyle s bullet left s i right i in I nbsp are nets then s displaystyle s bullet nbsp is called a subnet or Willard subnet 10 of x displaystyle x bullet nbsp if there exists an order preserving map h I A displaystyle h I to A nbsp such that h I displaystyle h I nbsp is a cofinal subset of A displaystyle A nbsp ands i x h i for all i I displaystyle s i x h i quad text for all i in I nbsp The map h I A displaystyle h I to A nbsp is called order preserving and an order homomorphism if whenever i j displaystyle i leq j nbsp then h i h j displaystyle h i leq h j nbsp The set h I displaystyle h I nbsp being cofinal in A displaystyle A nbsp means that for every a A displaystyle a in A nbsp there exists some b h I displaystyle b in h I nbsp such that b a displaystyle b geq a nbsp Properties EditVirtually 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 Characterizations of topological properties Edit Closed sets and closureA subset S X displaystyle S subseteq X nbsp is closed in X displaystyle X nbsp if and only if every limit point of every convergent net in S displaystyle S nbsp necessarily belongs to S displaystyle S nbsp Explicitly a subset S X displaystyle S subseteq X nbsp is closed if and only if whenever x X displaystyle x in X nbsp and s s a a A displaystyle s bullet left s a right a in A nbsp is a net valued in S displaystyle S nbsp meaning that s a S displaystyle s a in S nbsp for all a A displaystyle a in A nbsp such that lim s x displaystyle lim s bullet to x nbsp in X displaystyle X nbsp then necessarily x S displaystyle x in S nbsp More generally if S X displaystyle S subseteq X nbsp is any subset then a point x X displaystyle x in X span, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.