Subnet (mathematics)

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

There are three non-equivalent definitions of "subnet". The first definition of a subnet was introduced by John L. Kelley in 1955^[1] and later, Stephen Willard introduced his own (non-equivalent) variant of Kelley's definition in 1970.^[1] Subnets in the sense of Willard and subnets in the sense of Kelley are the most commonly used definitions of "subnet"^[1] but they are each not equivalent to the concept of "subordinate filter", which is the analog of "subsequence" for filters (they are not equivalent in the sense that there exist subordinate filters on $X=\mathbb {N}$ whose filter/subordinate–filter relationship cannot be described in terms of the corresponding net/subnet relationship). A third definition of "subnet" (not equivalent to those given by Kelley or Willard) that is equivalent to the concept of "subordinate filter" was introduced independently by Smiley (1957), Aarnes and Andenaes (1972), Murdeshwar (1983), and possibly others, although it is not often used.^[1]

This article discusses the definition due to Willard (the other definitions are described in the article Filters in topology#Non–equivalence of subnets and subordinate filters).

Definitions

There are several different non-equivalent definitions of "subnet" and this article will use the definition introduced in 1970 by Stephen Willard,^[1] which is as follows: If $x_{\bullet }=\left(x_{a}\right)_{a\in A}$ and $s_{\bullet }=\left(s_{i}\right)_{i\in I}$ are nets in a set $X$ from directed sets $A$ and $I,$ respectively, then $s_{\bullet }$ is said to be a subnet of $x_{\bullet }$ (in the sense of Willard or a Willard–subnet^[1]) if there exists a monotone final function $h:I\to A$ such that $s_{i}=x_{h(i)}\quad {\text{ for all }}i\in I.$ A function $h:I\to A$ is monotone, order-preserving, and an order homomorphism if whenever $i\leq j$ then $h(i)\leq h(j)$ and it is called final if its image $h(I)$ is cofinal in $A.$ The set $h(I)$ being cofinal in $A$ means that for every $a\in A,$ there exists some $b\in h(I)$ such that $b\geq a;$ that is, for every $a\in A$ there exists an $i\in I$ such that $h(i)\geq a.$ ^{[note 1]}

Since the net $x_{\bullet }$ is the function $x_{\bullet }:A\to X$ and the net $s_{\bullet }$ is the function $s_{\bullet }:I\to X,$ the defining condition $\left(s_{i}\right)_{i\in I}=\left(x_{h(i)}\right)_{i\in I},$ may be written more succinctly and cleanly as either $s_{\bullet }=x_{h(\bullet )}$ or $s_{\bullet }=x_{\bullet }\circ h,$ where $\,\circ \,$ denotes function composition and $x_{h(\bullet )}:=\left(x_{h(i)}\right)_{i\in I}$ is just notation for the function $x_{\bullet }\circ h:I\to X.$

Subnets versus subsequences

Importantly, a subnet is not merely the restriction of a net $\left(x_{a}\right)_{a\in A}$ to a directed subset of its domain $A.$ In contrast, by definition, a subsequence of a given sequence $x_{1},x_{2},x_{3},\ldots$ is a sequence formed from the given sequence by deleting some of the elements without disturbing the relative positions of the remaining elements. Explicitly, a sequence $\left(s_{n}\right)_{n\in \mathbb {N} }$ is said to be a subsequence of $\left(x_{i}\right)_{i\in \mathbb {N} }$ if there exists a strictly increasing sequence of positive integers $h_{1}<h_{2}<h_{3}<\cdots$ such that $s_{n}=x_{h_{n}}$ for every $n\in \mathbb {N}$ (that is to say, such that $\left(s_{1},s_{2},\ldots \right)=\left(x_{h_{1}},x_{h_{2}},\ldots \right)$ ). The sequence $\left(h_{n}\right)_{n\in \mathbb {N} }=\left(h_{1},h_{2},\ldots \right)$ can be canonically identified with the function $h_{\bullet }:\mathbb {N} \to \mathbb {N}$ defined by $n\mapsto h_{n}.$ Thus a sequence $s_{\bullet }=\left(s_{n}\right)_{n\in \mathbb {N} }$ is a subsequence of $x_{\bullet }=\left(x_{i}\right)_{i\in \mathbb {N} }$ if and only if there exists a strictly increasing function $h:\mathbb {N} \to \mathbb {N}$ such that $s_{\bullet }=x_{\bullet }\circ h.$

Subsequences are subnets

Every subsequence is a subnet because if $\left(x_{h_{n}}\right)_{n\in \mathbb {N} }$ is a subsequence of $\left(x_{i}\right)_{i\in \mathbb {N} }$ then the map $h:\mathbb {N} \to \mathbb {N}$ defined by $n\mapsto h_{n}$ is an order-preserving map whose image is cofinal in its codomain and satisfies $x_{h_{n}}=x_{h(n)}$ for all $n\in \mathbb {N} .$

Sequence and subnet but not a subsequence

The sequence $\left(s_{i}\right)_{i\in \mathbb {N} }:=(1,1,2,2,3,3,\ldots )$ is not a subsequence of $\left(x_{i}\right)_{i\in \mathbb {N} }:=(1,2,3,\ldots )$ although it is a subnet because the map $h:\mathbb {N} \to \mathbb {N}$ defined by $h(i):=\left\lfloor {\tfrac {i+1}{2}}\right\rfloor$ is an order-preserving map whose image is $h(\mathbb {N} )=\mathbb {N}$ and satisfies $s_{i}=x_{h(i)}$ for all $i\in \mathbb {N} .$ ^{[note 2]}

While a sequence is a net, a sequence has subnets that are not subsequences. The key difference is that subnets can use the same point in the net multiple times and the indexing set of the subnet can have much larger cardinality. Using the more general definition where we do not require monotonicity, a sequence is a subnet of a given sequence, if and only if it can be obtained from some subsequence by repeating its terms and reordering them.^[2]

Subnet of a sequence that is not a sequence

A subnet of a sequence is not necessarily a sequence.^[3] For an example, let $I=\{r\in \mathbb {R} :r>0\}$ be directed by the usual order $\,\leq \,$ and define $h:I\to \mathbb {N}$ by letting $h(r)=\lceil r\rceil$ be the ceiling of $r.$ Then $h:(I,\leq )\to (\mathbb {N} ,\leq )$ is an order-preserving map (because it is a non-decreasing function) whose image $h(I)=\mathbb {N}$ is a cofinal subset of its codomain. Let $x_{\bullet }=\left(x_{i}\right)_{i\in \mathbb {N} }:\mathbb {N} \to X$ be any sequence (such as a constant sequence, for instance) and let $s_{r}:=x_{h(r)}$ for every $r\in I$ (in other words, let $s_{\bullet }:=x_{\bullet }\circ h$ ). This net $\left(s_{r}\right)_{r\in I}$ is not a sequence since its domain $I$ is an uncountable set. However, $\left(s_{r}\right)_{r\in I}$ is a subnet of the sequence $x_{\bullet }$ since (by definition) $s_{r}=x_{h(r)}$ holds for every $r\in I.$ Thus $s_{\bullet }$ is a subnet of $x_{\bullet }$ that is not a sequence.

Furthermore, the sequence $x_{\bullet }$ is also a subnet of $\left(s_{r}\right)_{r\in I}$ since the inclusion map $\iota :\mathbb {N} \to I$ (that sends $n\mapsto n$ ) is an order-preserving map whose image $\iota (\mathbb {N} )=\mathbb {N}$ is a cofinal subset of its codomain and $x_{n}=s_{\iota (n)}$ holds for all $n\in \mathbb {N} .$ Thus $x_{\bullet }$ and $\left(s_{r}\right)_{r\in I}$ are (simultaneously) subnets of each another.

Subnets induced by subsets

Suppose $I\subseteq \mathbb {N}$ is an infinite set and $\left(x_{i}\right)_{i\in \mathbb {N} }$ is a sequence. Then $\left(x_{i}\right)_{i\in I}$ is a net on $(I,\leq )$ that is also a subnet of $\left(x_{i}\right)_{i\in \mathbb {N} }$ (take $h:I\to \mathbb {N}$ to be the inclusion map $i\mapsto i$ ). This subnet $\left(x_{i}\right)_{i\in I}$ in turn induces a subsequence $\left(x_{h_{n}}\right)_{n\in \mathbb {N} }$ by defining $h_{n}$ as the $n^{\text{th}}$ smallest value in $I$ (that is, let $h_{1}:=\inf I$ and let $h_{n}:=\inf\{i\in I:i>h_{n-1}\}$ for every integer $n>1$ ). In this way, every infinite subset of $I\subseteq \mathbb {N}$ induces a canonical subnet that may be written as a subsequence. However, as demonstrated below, not every subnet of a sequence is a subsequence.

Applications

The definition generalizes some key theorems about subsequences:

A net $x_{\bullet }$ converges to $x$ if and only if every subnet of $x_{\bullet }$ converges to $x.$
A net $x_{\bullet }$ has a cluster point $y$ if and only if it has a subnet $y_{\bullet }$ that converges to $y$
A topological space $X$ is compact if and only if every net in $X$ has a convergent subnet (see net for a proof).

Taking $h$ be the identity map in the definition of "subnet" and requiring $B$ to be a cofinal subset of $A$ leads to the concept of a cofinal subnet, which turns out to be inadequate since, for example, the second theorem above fails for the Tychonoff plank if we restrict ourselves to cofinal subnets.

Clustering and closure

If $s_{\bullet }$ is a net in a subset $S\subseteq X$ and if $x\in X$ is a cluster point of $s_{\bullet }$ then $x\in \operatorname {cl} _{X}S.$ In other words, every cluster point of a net in a subset belongs to the closure of that set.

If $x_{\bullet }=\left(x_{a}\right)_{a\in A}$ is a net in $X$ then the set of all cluster points of $x_{\bullet }$ in $X$ is equal to^[3] $\bigcap _{a\in A}\operatorname {cl} _{X}\left(x_{\geq a}\right)$ where $x_{\geq a}:=\left\{x_{b}:b\geq a,b\in A\right\}$ for each $a\in A.$

Convergence versus clustering

If a net converges to a point $x$ then $x$ is necessarily a cluster point of that net.^[3] The converse is not guaranteed in general. That is, it is possible for $x\in X$ to be a cluster point of a net $x_{\bullet }$ but for $x_{\bullet }$ to not converge to $x.$ However, if $x_{\bullet }=\left(x_{a}\right)_{a\in A}$ clusters at $x\in X$ then there exists a subnet of $x_{\bullet }$ that converges to $x.$ This subnet can be explicitly constructed from $(A,\leq )$ and the neighborhood filter ${\mathcal {N}}_{x}$ at $x$ as follows: make $I:=\left\{(a,U)\in A\times {\mathcal {N}}_{x}:x_{a}\in U\right\}$ into a directed set by declaring that $(a,U)\leq (b,V)\quad {\text{ if and only if }}\quad a\leq b\;{\text{ and }}\;U\supseteq V;$ then $\left(x_{a}\right)_{(a,U)\in I}\to x{\text{ in }}X$ and $\left(x_{a}\right)_{(a,U)\in I}$ is a subnet of $x_{\bullet }=\left(x_{a}\right)_{a\in A}$ since the map ${\begin{alignedat}{4}\alpha :\;&&I&&\;\to \;&A\\[0.3ex]&&(a,U)&&\;\mapsto \;&a\\\end{alignedat}}$ is a monotone function whose image $\alpha (I)=A$ is a cofinal subset of $A,$ and $x_{\alpha (\bullet )}:=\left(x_{\alpha (i)}\right)_{i\in I}=\left(x_{\alpha (a,U)}\right)_{(a,U)\in I}=\left(x_{a}\right)_{(a,U)\in I}.$

Thus, a point $x\in X$ is a cluster point of a given net if and only if it has a subnet that converges to $x.$ ^[3]

Notes

^ Some authors use a more general definition of a subnet. In this definition, the map $h$ is required to satisfy the condition: For every $a\in A$ there exists a $b_{0}\in B$ such that $h(b)\geq a$ whenever $b\geq b_{0}.$ Such a map is final but not necessarily monotone.
^ Indeed, this is because $x_{i}=i$ and $s_{i}=h(i)$ for every $i\in \mathbb {N} ;$ in other words, when considered as functions on $\mathbb {N} ,$ the sequence $x_{\bullet }$ is just the identity map on $\mathbb {N}$ while $s_{\bullet }=h.$

Citations

^ ^a ^b ^c ^d ^e ^f Schechter 1996, pp. 157–168.
^ Gähler, Werner (1977). Grundstrukturen der Analysis I. Akademie-Verlag, Berlin., Satz 2.8.3, p. 81
^ ^a ^b ^c ^d Willard 2004, pp. 73–77.

References

Engelking, Ryszard (1989). General Topology. Heldermann Verlag, Berlin. ISBN 3885380064.
Kelley, John L. (1991). General Topology. Springer. ISBN 3540901256.
Runde, Volker (2005). A Taste of Topology. Springer. ISBN 978-0387-25790-7.
Schechter, Eric (1996). Handbook of Analysis and Its Foundations. San Diego, CA: Academic Press. ISBN 978-0-12-622760-4. OCLC 175294365.
Willard, Stephen (2004) [1970]. General Topology. Mineola, N.Y.: Dover Publications. ISBN 978-0-486-43479-7. OCLC 115240.

[2] Some authors use a more general definition of a subnet. In this definition, the map $h$ is required to satisfy the condition: For every $a\in A$ there exists a $b_{0}\in B$ such that $h(b)\geq a$ whenever $b\geq b_{0}.$ Such a map is final but not necessarily monotone.

[3] Indeed, this is because $x_{i}=i$ and $s_{i}=h(i)$ for every $i\in \mathbb {N} ;$ in other words, when considered as functions on $\mathbb {N} ,$ the sequence $x_{\bullet }$ is just the identity map on $\mathbb {N}$ while $s_{\bullet }=h.$

[FOOTNOTESchechter1996157–168-1] ^ ^a ^b ^c ^d ^e ^f Schechter 1996, pp. 157–168.

[4] Gähler, Werner (1977). Grundstrukturen der Analysis I. Akademie-Verlag, Berlin., Satz 2.8.3, p. 81

[FOOTNOTEWillard200473–77-5] Willard 2004, pp. 73–77.

[1]

[note 1]

[note 2]

[2]

[3]

v t e Order theory
Topics Glossary Category
Key concepts	Binary relation Boolean algebra Cyclic order Lattice Partial order Preorder Total order Weak ordering
Results	Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle Knaster–Tarski theorem Kruskal's tree theorem Laver's theorem Mirsky's theorem Szpilrajn extension theorem Zorn's lemma
Properties & Types (list)	Antisymmetric Asymmetric Boolean algebra topics Completeness Connected Covering Dense Directed (Partial) Equivalence Foundational Heyting algebra Homogeneous Idempotent Lattice Bounded Complemented Complete Distributive Join and meet Reflexive Partial order Chain-complete Graded Eulerian Strict Prefix order Preorder Total Semilattice Semiorder Symmetric Total Tolerance Transitive Well-founded Well-quasi-ordering (Better) (Pre) Well-order
Constructions	Composition Converse/Transpose Lexicographic order Linear extension Product order Reflexive closure Series-parallel partial order Star product Symmetric closure Transitive closure
Topology & Orders	Alexandrov topology & Specialization preorder Ordered topological vector space Normal cone Order topology Order topology Topological vector lattice Banach Fréchet Locally convex Normed
Related	Antichain Cofinal Cofinality Comparability Graph Duality Filter Hasse diagram Ideal Net Subnet Order morphism Embedding Isomorphism Order type Ordered field Positive cone of an ordered field Ordered vector space Partially ordered Positive cone of an ordered vector space Riesz space Partially ordered group Positive cone of a partially ordered group Upper set Young's lattice