Movatterモバイル変換


[0]ホーム

URL:


Wikipedia

Net (mathematics)

This article is about nets in topological spaces. For unfoldings of polyhedra, seeNet (polyhedron).

In mathematics, more specifically ingeneral topology and related branches, anet orMoore–Smith sequence is afunction whose domain is adirected set. Thecodomain of this function is usually sometopological space. Nets directly generalize the concept of asequence in ametric space. Nets are primarily used in the fields ofanalysis andtopology, where they are used to characterize many importanttopological properties that (in general), sequences are unable to characterize (this shortcoming of sequences motivated the study ofsequential spaces andFréchet–Urysohn spaces). Nets are in one-to-one correspondence withfilters.

History

edit

The concept of a net was first introduced byE. H. Moore andHerman L. Smith in 1922.[1] The term "net" was coined byJohn L. Kelley.[2][3]

The related concept of afilter was developed in 1937 byHenri Cartan.

Definitions

edit

Adirected set is a non-empty setA{\displaystyle A}  together with apreorder, 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 anya,bA,{\displaystyle a,b\in A,}  there exists somecA{\displaystyle c\in A}  such thatac{\displaystyle a\leq c}  andbc.{\displaystyle b\leq c.}  In words, this property means that given any two elements (ofA{\displaystyle A} ), there is always some element that is "above" both of them (greater than or equal to each); in this way, directed sets generalize the notion of "a direction" in a mathematically rigorous way. Importantly though, directed sets arenot required to betotal orders or evenpartial orders. A directed set may have thegreatest element. In this case, the conditionsac{\displaystyle a\leq c}  andbc{\displaystyle b\leq c}  cannot be replaced by the strict inequalitiesa<c{\displaystyle a<c}  andb<c{\displaystyle b<c} , since the strict inequalities cannot be satisfied ifa orb is the greatest element.

Anet inX{\displaystyle X} , denotedx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}} , is afunction of the formx:AX{\displaystyle x_{\bullet }:A\to X}  whosedomainA{\displaystyle A}  is some directed set, and whose values arex(a)=xa{\displaystyle x_{\bullet }(a)=x_{a}} . Elements of a net's domain are called itsindices. When the setX{\displaystyle X}  is clear from context it is simply called anet, and one assumesA{\displaystyle A}  is a directed set with preorder.{\displaystyle \,\leq .}  Notation for nets varies, for example using angled bracketsxaaA{\displaystyle \left\langle x_{a}\right\rangle _{a\in A}} . As is common inalgebraic topology notation, the filled disk or "bullet" stands in place of the input variable or indexaA{\displaystyle a\in A} .

Limits of nets

edit

A netx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  is said to beeventually orresiduallyin a setS{\displaystyle S}  if there exists someaA{\displaystyle a\in A}  such that for everybA{\displaystyle b\in A}  withba,{\displaystyle b\geq a,}  the pointxbS.{\displaystyle x_{b}\in S.}  A pointxX{\displaystyle x\in X}  is called alimit point orlimit of the netx{\displaystyle x_{\bullet }}  inX{\displaystyle X}  whenever:

for every openneighborhoodU{\displaystyle U}  ofx,{\displaystyle x,}  the netx{\displaystyle x_{\bullet }}  is eventually inU{\displaystyle U} ,

expressed equivalently as: the netconverges to/towardsx{\displaystyle x}  orhasx{\displaystyle x}  as a limit; and variously denoted as:xx in Xxax in Xlimxx in XlimaAxax in Xlimaxax in X.{\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}}} IfX{\displaystyle X}  is clear from context, it may be omitted from the notation.

Iflimxx{\displaystyle \lim x_{\bullet }\to x}  and this limit is unique (i.e.limxy{\displaystyle \lim x_{\bullet }\to y}  only forx=y{\displaystyle x=y} ) then one writes:limx=x   or   limxa=x   or   limaAxa=x{\displaystyle \lim x_{\bullet }=x\;~~{\text{ or }}~~\;\lim x_{a}=x\;~~{\text{ or }}~~\;\lim _{a\in A}x_{a}=x} using the equal sign in place of the arrow.{\displaystyle \to .} [4] In aHausdorff space, every net has at most one limit, and the limit of a convergent net is always unique.[4]Some authors do not distinguish between the notationslimx=x{\displaystyle \lim x_{\bullet }=x}  andlimxx{\displaystyle \lim x_{\bullet }\to x} , but this can lead to ambiguities if the ambient spaceX{\displaystyle X}  is not Hausdorff.

Cluster points of nets

edit

A netx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  is said to befrequently orcofinally inS{\displaystyle S}  if for everyaA{\displaystyle a\in A}  there exists somebA{\displaystyle b\in A}  such thatba{\displaystyle b\geq a}  andxbS.{\displaystyle x_{b}\in S.} [5] A pointxX{\displaystyle x\in X}  is said to be anaccumulation point orcluster point of a net if for every neighborhoodU{\displaystyle U}  ofx,{\displaystyle x,}  the net is frequently/cofinally inU.{\displaystyle U.} [5] In fact,xX{\displaystyle x\in X}  is a cluster point if and only if it has a subnet that converges tox.{\displaystyle x.} [6] The setclX(x){\textstyle \operatorname {cl} _{X}\left(x_{\bullet }\right)}  of all cluster points ofx{\displaystyle x_{\bullet }}  inX{\displaystyle X}  is equal toclX(xa){\textstyle \operatorname {cl} _{X}\left(x_{\geq a}\right)}  for eachaA{\displaystyle a\in A} , wherexa:={xb:ba,bA}{\displaystyle x_{\geq a}:=\left\{x_{b}:b\geq a,b\in A\right\}} .

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,[7] which is as follows: Ifx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  ands=(si)iI{\displaystyle s_{\bullet }=\left(s_{i}\right)_{i\in I}}  are nets thens{\displaystyle s_{\bullet }}  is called asubnet orWillard-subnet[7] ofx{\displaystyle x_{\bullet }}  if there exists an order-preserving maph:IA{\displaystyle h:I\to A}  such thath(I){\displaystyle h(I)}  is acofinal subset ofA{\displaystyle A}  andsi=xh(i) for all iI.{\displaystyle s_{i}=x_{h(i)}\quad {\text{ for all }}i\in I.}  The maph:IA{\displaystyle h:I\to A}  is calledorder-preserving and anorder homomorphism if wheneverij{\displaystyle i\leq j}  thenh(i)h(j).{\displaystyle h(i)\leq h(j).}  The seth(I){\displaystyle h(I)}  beingcofinal inA{\displaystyle A}  means that for everyaA,{\displaystyle a\in A,}  there exists somebh(I){\displaystyle b\in h(I)}  such thatba.{\displaystyle b\geq a.} 

IfxX{\displaystyle x\in X}  is a cluster point of some subnet ofx{\displaystyle x_{\bullet }}  thenx{\displaystyle x}  is also a cluster point ofx.{\displaystyle x_{\bullet }.} [6]

Ultranets

edit

A netx{\displaystyle x_{\bullet }}  in setX{\displaystyle X}  is called auniversal net or anultranet if for every subsetSX,{\displaystyle S\subseteq X,} x{\displaystyle x_{\bullet }}  is eventually inS{\displaystyle S}  orx{\displaystyle x_{\bullet }}  is eventually in the complementXS.{\displaystyle X\setminus S.} [5]

Every constant net is a (trivial) ultranet. Every subnet of an ultranet is an ultranet.[8] Assuming theaxiom of choice, every net has some subnet that is an ultranet, but no nontrivial ultranets have ever been constructed explicitly.[5] Ifx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  is an ultranet inX{\displaystyle X}  andf:XY{\displaystyle f:X\to Y}  is a function thenfx=(f(xa))aA{\displaystyle f\circ x_{\bullet }=\left(f\left(x_{a}\right)\right)_{a\in A}}  is an ultranet inY.{\displaystyle Y.} [5]

GivenxX,{\displaystyle x\in X,}  an ultranet clusters atx{\displaystyle x}  if and only it converges tox.{\displaystyle x.} [5]

Cauchy nets

edit

A Cauchy net generalizes the notion ofCauchy sequence to nets defined onuniform spaces.[9]

A netx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  is aCauchy net if for everyentourageV{\displaystyle V}  there existscA{\displaystyle c\in A}  such that for alla,bc,{\displaystyle a,b\geq c,} (xa,xb){\displaystyle \left(x_{a},x_{b}\right)}  is a member ofV.{\displaystyle V.} [9][10] More generally, in aCauchy space, a netx{\displaystyle x_{\bullet }}  is Cauchy if the filter generated by the net is aCauchy filter.

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

Characterizations of topological properties

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 oflimit of a sequence. The following set of theorems and lemmas help cement that similarity:

Closed sets and closure

edit

A subsetSX{\displaystyle S\subseteq X}  is closed inX{\displaystyle X}  if and only if every limit point inX{\displaystyle X}  of a net inS{\displaystyle S}  necessarily lies inS{\displaystyle S} .Explicitly, this means that ifs=(sa)aA{\displaystyle s_{\bullet }=\left(s_{a}\right)_{a\in A}}  is a net withsaS{\displaystyle s_{a}\in S}  for allaA{\displaystyle a\in A} , andlimsx{\displaystyle \lim {}_{}s_{\bullet }\to x}  inX,{\displaystyle X,}  thenxS.{\displaystyle x\in S.} 

More generally, ifSX{\displaystyle S\subseteq X}  is any subset, theclosure ofS{\displaystyle S}  is the set of pointsxX{\displaystyle x\in X}  withlimaAsx{\displaystyle \lim _{a\in A}s_{\bullet }\to x}  for some net(sa)aA{\displaystyle \left(s_{a}\right)_{a\in A}}  inS{\displaystyle S} .[6]

Open sets and characterizations of topologies

edit

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

Continuity

edit

A functionf:XY{\displaystyle f:X\to Y}  between topological spaces iscontinuous at a pointx{\displaystyle x}  if and only if for every netx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  in the domain,limxx{\displaystyle \lim _{}x_{\bullet }\to x}  inX{\displaystyle X}  implieslimf(x)f(x){\displaystyle \lim {}f\left(x_{\bullet }\right)\to f(x)}  inY.{\displaystyle Y.} [6] Briefly, a functionf:XY{\displaystyle f:X\to Y}  is continuous if and only ifxx{\displaystyle x_{\bullet }\to x}  inX{\displaystyle X}  impliesf(x)f(x){\displaystyle f\left(x_{\bullet }\right)\to f(x)}  inY.{\displaystyle Y.}  In general, this statement would not be true if the word "net" was replaced by "sequence"; that is, it is necessary to allow for directed sets other than just the natural numbers ifX{\displaystyle X}  is not afirst-countable space (or not asequential space).

Proof

({\displaystyle \implies } ) Letf{\displaystyle f}  be continuous at pointx,{\displaystyle x,}  and letx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  be a net such thatlimxx.{\displaystyle \lim _{}x_{\bullet }\to x.} Then for every open neighborhoodU{\displaystyle U}  off(x),{\displaystyle f(x),}  its preimage underf,{\displaystyle f,} V:=f1(U),{\displaystyle V:=f^{-1}(U),}  is a neighborhood ofx{\displaystyle x}  (by the continuity off{\displaystyle f}  atx{\displaystyle x} ).Thus theinterior ofV,{\displaystyle V,}  which is denoted byintV,{\displaystyle \operatorname {int} V,}  is an open neighborhood ofx,{\displaystyle x,}  and consequentlyx{\displaystyle x_{\bullet }}  is eventually inintV.{\displaystyle \operatorname {int} V.}  Therefore(f(xa))aA{\displaystyle \left(f\left(x_{a}\right)\right)_{a\in A}}  is eventually inf(intV){\displaystyle f(\operatorname {int} V)}  and thus also eventually inf(V){\displaystyle f(V)}  which is a subset ofU.{\displaystyle U.}  Thuslim(f(xa))aAf(x),{\displaystyle \lim _{}\left(f\left(x_{a}\right)\right)_{a\in A}\to f(x),}  and this direction is proven.

({\displaystyle \Longleftarrow } ) Letx{\displaystyle x}  be a point such that for every netx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  such thatlimxx,{\displaystyle \lim _{}x_{\bullet }\to x,} lim(f(xa))aAf(x).{\displaystyle \lim _{}\left(f\left(x_{a}\right)\right)_{a\in A}\to f(x).}  Now suppose thatf{\displaystyle f}  is not continuous atx.{\displaystyle x.} Then there is aneighborhoodU{\displaystyle U}  off(x){\displaystyle f(x)}  whose preimage underf,{\displaystyle f,} V,{\displaystyle V,}  is not a neighborhood ofx.{\displaystyle x.}  Becausef(x)U,{\displaystyle f(x)\in U,}  necessarilyxV.{\displaystyle x\in V.}  Now the set of open neighborhoods ofx{\displaystyle x}  with thecontainment preorder is adirected set (since the intersection of every two such neighborhoods is an open neighborhood ofx{\displaystyle x}  as well).

We construct a netx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  such that for every open neighborhood ofx{\displaystyle x}  whose index isa,{\displaystyle a,} xa{\displaystyle x_{a}}  is a point in this neighborhood that is not inV{\displaystyle V} ; that there is always such a point follows from the fact that no open neighborhood ofx{\displaystyle x}  is included inV{\displaystyle V}  (because by assumption,V{\displaystyle V}  is not a neighborhood ofx{\displaystyle x} ).It follows thatf(xa){\displaystyle f\left(x_{a}\right)}  is not inU.{\displaystyle U.} 

Now, for every open neighborhoodW{\displaystyle W}  ofx,{\displaystyle x,}  this neighborhood is a member of the directed set whose index we denotea0.{\displaystyle a_{0}.}  For everyba0,{\displaystyle b\geq a_{0},}  the member of the directed set whose index isb{\displaystyle b}  is contained withinW{\displaystyle W} ; thereforexbW.{\displaystyle x_{b}\in W.}  Thuslimxx.{\displaystyle \lim _{}x_{\bullet }\to x.}  and by our assumptionlim(f(xa))aAf(x).{\displaystyle \lim _{}\left(f\left(x_{a}\right)\right)_{a\in A}\to f(x).} ButintU{\displaystyle \operatorname {int} U}  is an open neighborhood off(x){\displaystyle f(x)}  and thusf(xa){\displaystyle f\left(x_{a}\right)}  is eventually inintU{\displaystyle \operatorname {int} U}  and therefore also inU,{\displaystyle U,}  in contradiction tof(xa){\displaystyle f\left(x_{a}\right)}  not being inU{\displaystyle U}  for everya.{\displaystyle a.} This is a contradiction sof{\displaystyle f}  must be continuous atx.{\displaystyle x.}  This completes the proof.

Compactness

edit

A spaceX{\displaystyle X}  iscompact if and only if every netx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  inX{\displaystyle X}  has a subnet with a limit inX.{\displaystyle X.}  This can be seen as a generalization of theBolzano–Weierstrass theorem andHeine–Borel theorem.

Proof

({\displaystyle \implies } ) First, suppose thatX{\displaystyle X}  is compact. We will need the following observation (seefinite intersection property). LetI{\displaystyle I}  be any non-empty set and{Ci}iI{\displaystyle \left\{C_{i}\right\}_{i\in I}}  be a collection of closed subsets ofX{\displaystyle X}  such thatiJCi{\displaystyle \bigcap _{i\in J}C_{i}\neq \varnothing }  for each finiteJI.{\displaystyle J\subseteq I.}  TheniICi{\displaystyle \bigcap _{i\in I}C_{i}\neq \varnothing }  as well. Otherwise,{Cic}iI{\displaystyle \left\{C_{i}^{c}\right\}_{i\in I}}  would be an open cover forX{\displaystyle X}  with no finite subcover contrary to the compactness ofX.{\displaystyle X.} 

Letx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  be a net inX{\displaystyle X}  directed byA.{\displaystyle A.}  For everyaA{\displaystyle a\in A}  defineEa{xb:ba}.{\displaystyle E_{a}\triangleq \left\{x_{b}:b\geq a\right\}.} The collection{cl(Ea):aA}{\displaystyle \{\operatorname {cl} \left(E_{a}\right):a\in A\}}  has the property that every finite subcollection has non-empty intersection. Thus, by the remark above, we have thataAclEa{\displaystyle \bigcap _{a\in A}\operatorname {cl} E_{a}\neq \varnothing } and this is precisely the set of cluster points ofx.{\displaystyle x_{\bullet }.}  By the proof given in the next section, it is equal to the set of limits of convergent subnets ofx.{\displaystyle x_{\bullet }.}  Thusx{\displaystyle x_{\bullet }}  has a convergent subnet.

({\displaystyle \Longleftarrow } ) Conversely, suppose that every net inX{\displaystyle X}  has a convergent subnet. For the sake of contradiction, let{Ui:iI}{\displaystyle \left\{U_{i}:i\in I\right\}}  be an open cover ofX{\displaystyle X}  with no finite subcover. ConsiderD{JI:|J|<}.{\displaystyle D\triangleq \{J\subset I:|J|<\infty \}.}  Observe thatD{\displaystyle D}  is a directed set under inclusion and for eachCD,{\displaystyle C\in D,}  there exists anxCX{\displaystyle x_{C}\in X}  such thatxCUa{\displaystyle x_{C}\notin U_{a}}  for allaC.{\displaystyle a\in C.}  Consider the net(xC)CD.{\displaystyle \left(x_{C}\right)_{C\in D}.}  This net cannot have a convergent subnet, because for eachxX{\displaystyle x\in X}  there existscI{\displaystyle c\in I}  such thatUc{\displaystyle U_{c}}  is a neighbourhood ofx{\displaystyle x} ; however, for allB{c},{\displaystyle B\supseteq \{c\},}  we have thatxBUc.{\displaystyle x_{B}\notin U_{c}.}  This is a contradiction and completes the proof.

Cluster and limit points

edit

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

Proof

Letx=(xa)aA{\displaystyle x_{\bullet }=\left(x_{a}\right)_{a\in A}}  be a net in a topological spaceX{\displaystyle X}  (where as usualA{\displaystyle A}  automatically assumed to be a directed set) and also letyX.{\displaystyle y\in X.}  Ify{\displaystyle y}  is a limit of a subnet ofx{\displaystyle x_{\bullet }}  theny{\displaystyle y}  is a cluster point ofx.{\displaystyle x_{\bullet }.} 

Conversely, assume thaty{\displaystyle y}  is a cluster point ofx.{\displaystyle x_{\bullet }.} LetB{\displaystyle B}  be the set of pairs(U,a){\displaystyle (U,a)}  whereU{\displaystyle U}  is an open neighborhood ofy{\displaystyle y}  inX{\displaystyle X}  andaA{\displaystyle a\in A}  is such thatxaU.{\displaystyle x_{a}\in U.} The maph:BA{\displaystyle h:B\to A}  mapping(U,a){\displaystyle (U,a)}  toa{\displaystyle a}  is then cofinal.Moreover, givingB{\displaystyle B}  theproduct order (the neighborhoods ofy{\displaystyle y}  are ordered by inclusion) makes it a directed set, and the net(yb)bB{\displaystyle \left(y_{b}\right)_{b\in B}}  defined byyb=xh(b){\displaystyle y_{b}=x_{h(b)}}  converges toy.{\displaystyle y.} 

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

Other properties

edit

In general, a net in a spaceX{\displaystyle X}  can have more than one limit, but ifX{\displaystyle X}  is aHausdorff space, the limit of a net, if it exists, is unique. Conversely, ifX{\displaystyle X}  is not Hausdorff, then there exists a net onX{\displaystyle X}  with two distinct limits. Thus the uniqueness of the limit isequivalent 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 generalpreorder orpartial order may have distinct limit points even in a Hausdorff space.

Relation to filters

edit

Afilter is a related idea in topology that allows for a general definition for convergence in general topological spaces. The two ideas are equivalent in the sense that they give the same concept of convergence.[12] More specifically, everyfilter base induces anassociated net using the filter's pointed sets, and convergence of the filter base implies convergence of the associated net. Similarly, any net(xa)aA{\displaystyle \left(x_{a}\right)_{a\in A}}  inX{\displaystyle X}  induces a filter base of tails{{xa:aA,a0a}:a0A}{\displaystyle \left\{\left\{x_{a}:a\in A,a_{0}\leq a\right\}:a_{0}\in A\right\}}  where the filter inX{\displaystyle X}  generated by this filter base is called the net'seventuality filter. Convergence of the net implies convergence of the eventuality filter.[13] This correspondence allows for any theorem that can be proven with one concept to be proven with the other.[13] 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.[13] 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 inanalysis, while filters are most useful inalgebraic topology. In any case, he shows how the two can be used in combination to prove various theorems ingeneral topology.

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

As generalization of sequences

edit

Every non-emptytotally ordered set is directed. Therefore, every function on such a set is a net. In particular, thenatural numbersN{\displaystyle \mathbb {N} }  together with the usual integer comparison{\displaystyle \,\leq \,}  preorder form thearchetypical example of a directed set. A sequence is a function on the natural numbers, so every sequencea1,a2,{\displaystyle a_{1},a_{2},\ldots }  in a topological spaceX{\displaystyle X}  can be considered a net inX{\displaystyle X}  defined onN.{\displaystyle \mathbb {N} .}  Conversely, any net whose domain is the natural numbers is asequence because by definition, a sequence inX{\displaystyle X}  is just a function fromN={1,2,}{\displaystyle \mathbb {N} =\{1,2,\ldots \}}  intoX.{\displaystyle X.}  It is in this way that nets are generalizations of sequences: rather than being defined on acountablelinearly ordered set (N{\displaystyle \mathbb {N} } ), a net is defined on an arbitrarydirected set. Nets are frequently denoted using notation that is similar to (and inspired by) that used with sequences. For example, the subscript notationxa{\displaystyle x_{a}}  is taken from sequences.

Similarly, everylimit of a sequence andlimit of a function can be interpreted as a limit of a net. Specifically, the net is eventually in a subsetS{\displaystyle S}  ofX{\displaystyle X}  if there exists anNN{\displaystyle N\in \mathbb {N} }  such that for every integernN,{\displaystyle n\geq N,}  the pointan{\displaystyle a_{n}}  is inS.{\displaystyle S.}  SolimnanL{\displaystyle \lim {}_{n}a_{n}\to L}  if and only if for every neighborhoodV{\displaystyle V}  ofL,{\displaystyle L,}  the net is eventually inV.{\displaystyle V.}  The net is frequently in a subsetS{\displaystyle S}  ofX{\displaystyle X}  if and only if for everyNN{\displaystyle N\in \mathbb {N} }  there exists some integernN{\displaystyle n\geq N}  such thatanS,{\displaystyle a_{n}\in S,}  that is, if and only if infinitely many elements of the sequence are inS.{\displaystyle S.}  Thus a pointyX{\displaystyle y\in X}  is a cluster point of the net if and only if every neighborhoodV{\displaystyle V}  ofy{\displaystyle y}  contains infinitely many elements of the sequence.

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

  1. The mapf{\displaystyle f}  iscontinuous in the topological sense;
  2. Given any pointx{\displaystyle x}  inX,{\displaystyle X,}  and any sequence inX{\displaystyle X}  converging tox,{\displaystyle x,}  the composition off{\displaystyle f}  with this sequence converges tof(x){\displaystyle f(x)} (continuous in the sequential sense).

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

  1. Given any pointx{\displaystyle x}  inX,{\displaystyle X,}  and any net inX{\displaystyle X}  converging tox,{\displaystyle x,}  the composition off{\displaystyle f}  with this net converges tof(x){\displaystyle f(x)}  (continuous in the net sense).

With this change, the conditions become equivalent for all maps of topological spaces, including topological spaces that do not necessarily have a countable or linearly orderedneighbourhood 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 likedirected sets in behavior.

For an example where sequences do not suffice, interpret the setRR{\displaystyle \mathbb {R} ^{\mathbb {R} }}  of all functions with prototypef:RR{\displaystyle f:\mathbb {R} \to \mathbb {R} }  as the Cartesian productxRR{\displaystyle {\textstyle \prod \limits _{x\in \mathbb {R} }}\mathbb {R} }  (by identifying a functionf{\displaystyle f}  with the tuple(f(x))xR,{\displaystyle (f(x))_{x\in \mathbb {R} },}  and conversely) and endow it with theproduct topology. This (product) topology onRR{\displaystyle \mathbb {R} ^{\mathbb {R} }}  is identical to thetopology of pointwise convergence. LetE{\displaystyle E}  denote the set of all functionsf:R{0,1}{\displaystyle f:\mathbb {R} \to \{0,1\}}  that are equal to1{\displaystyle 1}  everywhere except for at most finitely many points (that is, such that the set{x:f(x)=0}{\displaystyle \{x:f(x)=0\}}  is finite). Then the constant0{\displaystyle 0}  function0:R{0}{\displaystyle \mathbf {0} :\mathbb {R} \to \{0\}}  belongs to the closure ofE{\displaystyle E}  inRR;{\displaystyle \mathbb {R} ^{\mathbb {R} };}  that is,0clRRE.{\displaystyle \mathbf {0} \in \operatorname {cl} _{\mathbb {R} ^{\mathbb {R} }}E.} [8] This will be proven by constructing a net inE{\displaystyle E}  that converges to0.{\displaystyle \mathbf {0} .}  However, there does not exist anysequence inE{\displaystyle E}  that converges to0,{\displaystyle \mathbf {0} ,} [14] which makes this one instance where (non-sequence) nets must be used because sequences alone can not reach the desired conclusion. Compare elements ofRR{\displaystyle \mathbb {R} ^{\mathbb {R} }}  pointwise in the usual way by declaring thatfg{\displaystyle f\geq g}  if and only iff(x)g(x){\displaystyle f(x)\geq g(x)}  for allx.{\displaystyle x.}  This pointwise comparison is a partial order that makes(E,){\displaystyle (E,\geq )}  a directed set since given anyf,gE,{\displaystyle f,g\in E,}  their pointwise minimumm:=min{f,g}{\displaystyle m:=\min\{f,g\}}  belongs toE{\displaystyle E}  and satisfiesfm{\displaystyle f\geq m}  andgm.{\displaystyle g\geq m.}  This partial order turns theidentity mapId:(E,)E{\displaystyle \operatorname {Id} :(E,\geq )\to E}  (defined byff{\displaystyle f\mapsto f} ) into anE{\displaystyle E} -valued net. This net converges pointwise to0{\displaystyle \mathbf {0} }  inRR,{\displaystyle \mathbb {R} ^{\mathbb {R} },}  which implies that0{\displaystyle \mathbf {0} }  belongs to the closure ofE{\displaystyle E}  inRR.{\displaystyle \mathbb {R} ^{\mathbb {R} }.} 

More generally, a subnet of a sequence isnot necessarily a sequence.[5][a] Moreso, a subnet of a sequence may be a sequence, but not a subsequence.[b] But, in the specific case of a sequential space, every net induces a corresponding sequence, and this relationship maps subnets to subsequences. Specifically, for a first-countable space, the net(xa)aA{\displaystyle \left(x_{a}\right)_{a\in A}}  induces the sequence(xhn)nN{\displaystyle \left(x_{h_{n}}\right)_{n\in \mathbb {N} }}  wherehn{\displaystyle h_{n}}  is defined as thenth{\displaystyle n^{\text{th}}}  smallest value inA{\displaystyle A}  – that is, leth1:=infA{\displaystyle h_{1}:=\inf A}  and lethn:=inf{aA:a>hn1}{\displaystyle h_{n}:=\inf\{a\in A:a>h_{n-1}\}}  for every integern>1{\displaystyle n>1} .

Examples

edit

Subspace topology

edit

If the setS={x}{xa:aA}{\displaystyle S=\{x\}\cup \left\{x_{a}:a\in A\right\}}  is endowed with thesubspace topology induced on it byX,{\displaystyle X,}  thenlimxx{\displaystyle \lim _{}x_{\bullet }\to x}  inX{\displaystyle X}  if and only iflimxx{\displaystyle \lim _{}x_{\bullet }\to x}  inS.{\displaystyle S.}  In this way, the question of whether or not the netx{\displaystyle x_{\bullet }}  converges to the given pointx{\displaystyle x}  dependssolely on this topological subspaceS{\displaystyle S}  consisting ofx{\displaystyle x}  and theimage of (that is, the points of) the netx.{\displaystyle x_{\bullet }.} 

Neighborhood systems

edit
Main article:Neighborhood system

Intuitively, convergence of a net(xa)aA{\displaystyle \left(x_{a}\right)_{a\in A}}  means that the valuesxa{\displaystyle x_{a}}  come and stay as close as we want tox{\displaystyle x}  for large enougha.{\displaystyle a.}  Given a pointx{\displaystyle x}  in a topological space, letNx{\displaystyle N_{x}}  denote the set of allneighbourhoods containingx.{\displaystyle x.}  ThenNx{\displaystyle N_{x}}  is a directed set, where the direction is given by reverse inclusion, so thatST{\displaystyle S\geq T} if and only ifS{\displaystyle S}  is contained inT.{\displaystyle T.}  ForSNx,{\displaystyle S\in N_{x},}  letxS{\displaystyle x_{S}}  be a point inS.{\displaystyle S.}  Then(xS){\displaystyle \left(x_{S}\right)}  is a net. AsS{\displaystyle S}  increases with respect to,{\displaystyle \,\geq ,}  the pointsxS{\displaystyle x_{S}}  in the net are constrained to lie in decreasing neighbourhoods ofx,{\displaystyle x,} . Therefore, in thisneighborhood system of a pointx{\displaystyle x} ,xS{\displaystyle x_{S}}  does indeed converge tox{\displaystyle x}  according to the definition of net convergence.

Given asubbaseB{\displaystyle {\mathcal {B}}}  for the topology onX{\displaystyle X}  (where note that everybase for a topology is also a subbase) and given a pointxX,{\displaystyle x\in X,}  a netx{\displaystyle x_{\bullet }}  inX{\displaystyle X}  converges tox{\displaystyle x}  if and only if it is eventually in every neighborhoodUB{\displaystyle U\in {\mathcal {B}}}  ofx.{\displaystyle x.}  This characterization extends toneighborhood subbases (and so alsoneighborhood bases) of the given pointx.{\displaystyle x.} 

Limits in a Cartesian product

edit

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

Explicitly, let(Xi)iI{\displaystyle \left(X_{i}\right)_{i\in I}}  be topological spaces, endow theirCartesian productX:=iIXi{\displaystyle {\textstyle \prod }X_{\bullet }:=\prod _{i\in I}X_{i}} with theproduct topology, and that for every indexlI,{\displaystyle l\in I,}  denote the canonical projection toXl{\displaystyle X_{l}}  byπl:XXl(xi)iIxl{\displaystyle {\begin{alignedat}{4}\pi _{l}:\;&&{\textstyle \prod }X_{\bullet }&&\;\to \;&X_{l}\\[0.3ex]&&\left(x_{i}\right)_{i\in I}&&\;\mapsto \;&x_{l}\\\end{alignedat}}} 

Letf=(fa)aA{\displaystyle f_{\bullet }=\left(f_{a}\right)_{a\in A}}  be a net inX{\displaystyle {\textstyle \prod }X_{\bullet }}  directed byA{\displaystyle A}  and for every indexiI,{\displaystyle i\in I,}  letπi(f) =def (πi(fa))aA{\displaystyle \pi _{i}\left(f_{\bullet }\right)~{\stackrel {\scriptscriptstyle {\text{def}}}{=}}~\left(\pi _{i}\left(f_{a}\right)\right)_{a\in A}} denote the result of "pluggingf{\displaystyle f_{\bullet }}  intoπi{\displaystyle \pi _{i}} ", which results in the netπi(f):AXi.{\displaystyle \pi _{i}\left(f_{\bullet }\right):A\to X_{i}.}  It is sometimes useful to think of this definition in terms offunction composition: the netπi(f){\displaystyle \pi _{i}\left(f_{\bullet }\right)}  is equal to the composition of the netf:AX{\displaystyle f_{\bullet }:A\to {\textstyle \prod }X_{\bullet }}  with the projectionπi:XXi;{\displaystyle \pi _{i}:{\textstyle \prod }X_{\bullet }\to X_{i};}  that is,πi(f) =def πif.{\displaystyle \pi _{i}\left(f_{\bullet }\right)~{\stackrel {\scriptscriptstyle {\text{def}}}{=}}~\pi _{i}\,\circ \,f_{\bullet }.} 

For any given pointL=(Li)iIiIXi,{\displaystyle L=\left(L_{i}\right)_{i\in I}\in {\textstyle \prod \limits _{i\in I}}X_{i},}  the netf{\displaystyle f_{\bullet }}  converges toL{\displaystyle L}  in the product spaceX{\displaystyle {\textstyle \prod }X_{\bullet }}  if and only if for every indexiI,{\displaystyle i\in I,} πi(f)=def(πi(fa))aA{\displaystyle \pi _{i}\left(f_{\bullet }\right)\;{\stackrel {\scriptscriptstyle {\text{def}}}{=}}\;\left(\pi _{i}\left(f_{a}\right)\right)_{a\in A}}  converges toLi{\displaystyle L_{i}}  inXi.{\displaystyle X_{i}.} [15] And whenever the netf{\displaystyle f_{\bullet }}  clusters atL{\displaystyle L}  inX{\displaystyle {\textstyle \prod }X_{\bullet }}  thenπi(f){\displaystyle \pi _{i}\left(f_{\bullet }\right)}  clusters atLi{\displaystyle L_{i}}  for every indexiI.{\displaystyle i\in I.} [8] However, the converse does not hold in general.[8] For example, supposeX1=X2=R{\displaystyle X_{1}=X_{2}=\mathbb {R} }  and letf=(fa)aN{\displaystyle f_{\bullet }=\left(f_{a}\right)_{a\in \mathbb {N} }}  denote the sequence(1,1),(0,0),(1,1),(0,0),{\displaystyle (1,1),(0,0),(1,1),(0,0),\ldots }  that alternates between(1,1){\displaystyle (1,1)}  and(0,0).{\displaystyle (0,0).}  ThenL1:=0{\displaystyle L_{1}:=0}  andL2:=1{\displaystyle L_{2}:=1}  are cluster points of bothπ1(f){\displaystyle \pi _{1}\left(f_{\bullet }\right)}  andπ2(f){\displaystyle \pi _{2}\left(f_{\bullet }\right)}  inX1×X2=R2{\displaystyle X_{1}\times X_{2}=\mathbb {R} ^{2}}  but(L1,L2)=(0,1){\displaystyle \left(L_{1},L_{2}\right)=(0,1)}  is not a cluster point off{\displaystyle f_{\bullet }}  since the open ball of radius1{\displaystyle 1}  centered at(0,1){\displaystyle (0,1)}  does not contain even a single pointf{\displaystyle f_{\bullet }} 

Tychonoff's theorem and relation to the axiom of choice

edit

If noLX{\displaystyle L\in X}  is given but for everyiI,{\displaystyle i\in I,}  there exists someLiXi{\displaystyle L_{i}\in X_{i}}  such thatπi(f)Li{\displaystyle \pi _{i}\left(f_{\bullet }\right)\to L_{i}}  inXi{\displaystyle X_{i}}  then the tuple defined byL=(Li)iI{\displaystyle L=\left(L_{i}\right)_{i\in I}}  will be a limit off{\displaystyle f_{\bullet }}  inX.{\displaystyle X.}  However, theaxiom of choice might be need to be assumed to conclude that this tupleL{\displaystyle L}  exists; the axiom of choice is not needed in some situations, such as whenI{\displaystyle I}  is finite or when everyLiXi{\displaystyle L_{i}\in X_{i}}  is theunique limit of the netπi(f){\displaystyle \pi _{i}\left(f_{\bullet }\right)}  (because then there is nothing to choose between), which happens for example, when everyXi{\displaystyle X_{i}}  is aHausdorff space. IfI{\displaystyle I}  is infinite andX=jIXj{\displaystyle {\textstyle \prod }X_{\bullet }={\textstyle \prod \limits _{j\in I}}X_{j}}  is not empty, then the axiom of choice would (in general) still be needed to conclude that the projectionsπi:XXi{\displaystyle \pi _{i}:{\textstyle \prod }X_{\bullet }\to X_{i}}  aresurjective maps.

The axiom of choice is equivalent toTychonoff'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 theultrafilter lemma and so strictly weaker than theaxiom 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 convergentsubnet.

Limit superior/inferior

edit

Limit superior andlimit inferior of a net of real numbers can be defined in a similar manner as for sequences.[16][17][18] Some authors work even with more general structures than the real line, like complete lattices.[19]

For a net(xa)aA,{\displaystyle \left(x_{a}\right)_{a\in A},}  putlim supxa=limaAsupbaxb=infaAsupbaxb.{\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,lim sup(xa+ya)lim supxa+lim supya,{\displaystyle \limsup(x_{a}+y_{a})\leq \limsup x_{a}+\limsup y_{a},} where equality holds whenever one of the nets is convergent.

Riemann integral

edit

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

Metric spaces

edit

Suppose(M,d){\displaystyle (M,d)}  is ametric space (or apseudometric space) andM{\displaystyle M}  is endowed with themetric topology. IfmM{\displaystyle m\in M}  is a point andm=(mi)aA{\displaystyle m_{\bullet }=\left(m_{i}\right)_{a\in A}}  is a net, thenmm{\displaystyle m_{\bullet }\to m}  in(M,d){\displaystyle (M,d)}  if and only ifd(m,m)0{\displaystyle d\left(m,m_{\bullet }\right)\to 0}  inR,{\displaystyle \mathbb {R} ,}  whered(m,m):=(d(m,ma))aA{\displaystyle d\left(m,m_{\bullet }\right):=\left(d\left(m,m_{a}\right)\right)_{a\in A}}  is a net ofreal numbers. Inplain 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(M,){\displaystyle (M,\|\cdot \|)}  is anormed space (or aseminormed space) thenmm{\displaystyle m_{\bullet }\to m}  in(M,){\displaystyle (M,\|\cdot \|)}  if and only ifmm0{\displaystyle \left\|m-m_{\bullet }\right\|\to 0}  inR,{\displaystyle \mathbb {R} ,}  wheremm:=(mma)aA.{\displaystyle \left\|m-m_{\bullet }\right\|:=\left(\left\|m-m_{a}\right\|\right)_{a\in A}.} 

If(M,d){\displaystyle (M,d)}  has at least two points, then we can fix a pointcM{\displaystyle c\in M}  (such asM:=Rn{\displaystyle M:=\mathbb {R} ^{n}}  with theEuclidean metric withc:=0{\displaystyle c:=0}  being the origin, for example) and direct the setI:=M{c}{\displaystyle I:=M\setminus \{c\}}  reversely according to distance fromc{\displaystyle c}  by declaring thatij{\displaystyle i\leq j}  if and only ifd(j,c)d(i,c).{\displaystyle d(j,c)\leq d(i,c).}  In other words, the relation is "has at least the same distance toc{\displaystyle c}  as", so that "large enough" with respect to this relation means "close enough toc{\displaystyle c} ". Given any function with domainM,{\displaystyle M,}  its restriction toI:=M{c}{\displaystyle I:=M\setminus \{c\}}  can be canonically interpreted as a net directed by(I,).{\displaystyle (I,\leq ).} [8]

A netf:M{c}X{\displaystyle f:M\setminus \{c\}\to X}  is eventually in a subsetS{\displaystyle S}  of a topological spaceX{\displaystyle X}  if and only if there exists somenM{c}{\displaystyle n\in M\setminus \{c\}}  such that for everymM{c}{\displaystyle m\in M\setminus \{c\}}  satisfyingd(m,c)d(n,c),{\displaystyle d(m,c)\leq d(n,c),}  the pointf(m){\displaystyle f(m)}  is inS.{\displaystyle S.}  Such a netf{\displaystyle f}  converges inX{\displaystyle X}  to a given pointLX{\displaystyle L\in X}  if and only iflimmcf(m)L{\displaystyle \lim _{m\to c}f(m)\to L}  in the usual sense (meaning that for every neighborhoodV{\displaystyle V}  ofL,{\displaystyle L,} f{\displaystyle f}  is eventually inV{\displaystyle V} ).[8]

The netf:M{c}X{\displaystyle f:M\setminus \{c\}\to X}  is frequently in a subsetS{\displaystyle S}  ofX{\displaystyle X}  if and only if for everynM{c}{\displaystyle n\in M\setminus \{c\}}  there exists somemM{c}{\displaystyle m\in M\setminus \{c\}}  withd(m,c)d(n,c){\displaystyle d(m,c)\leq d(n,c)}  such thatf(m){\displaystyle f(m)}  is inS.{\displaystyle S.} Consequently, a pointLX{\displaystyle L\in X}  is a cluster point of the netf{\displaystyle f}  if and only if for every neighborhoodV{\displaystyle V}  ofL,{\displaystyle L,}  the net is frequently inV.{\displaystyle V.} 

Function from a well-ordered set to a topological space

edit

Consider awell-ordered set[0,c]{\displaystyle [0,c]}  with limit pointt{\displaystyle t}  and a functionf{\displaystyle f}  from[0,t){\displaystyle [0,t)}  to a topological spaceX.{\displaystyle X.}  This function is a net on[0,t).{\displaystyle [0,t).} 

It is eventually in a subsetV{\displaystyle V}  ofX{\displaystyle X}  if there exists anr[0,t){\displaystyle r\in [0,t)}  such that for everys[r,t){\displaystyle s\in [r,t)}  the pointf(s){\displaystyle f(s)}  is inV.{\displaystyle V.} 

Solimxtf(x)L{\displaystyle \lim _{x\to t}f(x)\to L}  if and only if for every neighborhoodV{\displaystyle V}  ofL,{\displaystyle L,} f{\displaystyle f}  is eventually inV.{\displaystyle V.} 

The netf{\displaystyle f}  is frequently in a subsetV{\displaystyle V}  ofX{\displaystyle X}  if and only if for everyr[0,t){\displaystyle r\in [0,t)}  there exists somes[r,t){\displaystyle s\in [r,t)}  such thatf(s)V.{\displaystyle f(s)\in V.} 

A pointyX{\displaystyle y\in X}  is a cluster point of the netf{\displaystyle f}  if and only if for every neighborhoodV{\displaystyle V}  ofy,{\displaystyle y,}  the net is frequently inV.{\displaystyle V.} 

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

See alsoordinal-indexed sequence.

See also

edit

Notes

edit
  1. ^For an example, letX=Rn{\displaystyle X=\mathbb {R} ^{n}}  and letxi=0{\displaystyle x_{i}=0}  for everyiN,{\displaystyle i\in \mathbb {N} ,}  so thatx=(0)iN:NX{\displaystyle x_{\bullet }=(0)_{i\in \mathbb {N} }:\mathbb {N} \to X}  is the constant zero sequence. LetI={rR:r>0}{\displaystyle I=\{r\in \mathbb {R} :r>0\}}  be directed by the usual order{\displaystyle \,\leq \,}  and letsr=0{\displaystyle s_{r}=0}  for eachrR.{\displaystyle r\in R.}  Defineφ:IN{\displaystyle \varphi :I\to \mathbb {N} }  by lettingφ(r)=r{\displaystyle \varphi (r)=\lceil r\rceil }  be theceiling ofr.{\displaystyle r.}  The mapφ:IN{\displaystyle \varphi :I\to \mathbb {N} }  is an order morphism whose image is cofinal in its codomain and(xφ)(r)=xφ(r)=0=sr{\displaystyle \left(x_{\bullet }\circ \varphi \right)(r)=x_{\varphi (r)}=0=s_{r}}  holds for everyrR.{\displaystyle r\in R.}  This shows that(sr)rR=xφ{\displaystyle \left(s_{r}\right)_{r\in R}=x_{\bullet }\circ \varphi }  is a subnet of the sequencex{\displaystyle x_{\bullet }}  (where this subnet is not a subsequence ofx{\displaystyle x_{\bullet }}  because it is not even a sequence since its domain is anuncountable set).
  2. ^The sequence(si)iN:=(1,1,2,2,3,3,){\displaystyle \left(s_{i}\right)_{i\in \mathbb {N} }:=(1,1,2,2,3,3,\ldots )}  is not a subsequence of(xi)iN:=(1,2,3,){\displaystyle \left(x_{i}\right)_{i\in \mathbb {N} }:=(1,2,3,\ldots )} , although it is a subnet, because the maph:NN{\displaystyle h:\mathbb {N} \to \mathbb {N} }  defined byh(i):=i+12{\displaystyle h(i):=\left\lfloor {\tfrac {i+1}{2}}\right\rfloor }  is an order-preserving map whose image ish(N)=N{\displaystyle h(\mathbb {N} )=\mathbb {N} }  and satisfiessi=xh(i){\displaystyle s_{i}=x_{h(i)}}  for alliN.{\displaystyle i\in \mathbb {N} .}  Indeed, this is becausexi=i{\displaystyle x_{i}=i}  andsi=h(i){\displaystyle s_{i}=h(i)}  for everyiN;{\displaystyle i\in \mathbb {N} ;}  in other words, when considered as functions onN,{\displaystyle \mathbb {N} ,}  the sequencex{\displaystyle x_{\bullet }}  is just the identity map onN{\displaystyle \mathbb {N} }  whiles=h.{\displaystyle s_{\bullet }=h.} 

Citations

edit
  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. ^abKelley 1975, pp. 65–72.
  5. ^abcdefgWillard 2004, pp. 73–77.
  6. ^abcdWillard 2004, p. 75.
  7. ^abSchechter 1996, pp. 157–168.
  8. ^abcdefWillard 2004, p. 77.
  9. ^abWillard, Stephen (2012),General Topology, Dover Books on Mathematics, Courier Dover Publications, p. 260,ISBN 9780486131788.
  10. ^Joshi, K. D. (1983),Introduction to General Topology, New Age International, p. 356,ISBN 9780852264447.
  11. ^Howes 1995, pp. 83–92.
  12. ^"Archived copy"(PDF). Archived fromthe original(PDF) on 24 April 2015. Retrieved15 January 2013.{{cite web}}: CS1 maint: archived copy as title (link)
  13. ^abcR. G. Bartle, Nets and Filters in Topology, American Mathematical Monthly, Vol. 62, No. 8 (1955), pp. 551–557.
  14. ^Willard 2004, pp. 71–72.
  15. ^Willard 2004, p. 76.
  16. ^Aliprantis-Border, p. 32
  17. ^Megginson, p. 217, p. 221, Exercises 2.53–2.55
  18. ^Beer, p. 2
  19. ^Schechter, Sections 7.43–7.47

References

edit

[8]ページ先頭

©2009-2025 Movatter.jp