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 definition is not completely straightforward, but is designed to allow as many theorems about subsequences to generalize to nets as possible.

If (x_α) and (y_β) are nets from directed sets A and B respectively, then (y_β) is a subnet of (x_α) if there exists a monotone final function

h : B → A

such that

y_β = x_h(β).

A function h : B → A is monotone if β₁ ≤ β₂ implies h(β₁) ≤ h(β₂) and final if its image is cofinal in A—that is, for every α in A there exists a β in B such that h(β) ≥ α.^[1]

While complicated, the definition does generalize some key theorems about subsequences:

• A net (x_α) converges to x if and only if every subnet of (x_α) converges to x.
• A net (x_α) has a cluster point y if and only if it has a subnet (y_β) 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).

A more natural definition of a subnet would be to require B to be a cofinal subset of A and that h be the identity map. This concept, known as a cofinal subnet, turns out to be inadequate. For example, the second theorem above fails for the Tychonoff plank if we restrict ourselves to cofinal subnets.

Note that while a sequence is a net, a sequence has subnets that are not subsequences. For example the net (1, 1, 2, 3, 4, ...) is a subnet of the net (1, 2, 3, 4, ...). 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. 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]

Notes

1. ↑ Some authors use a slightly more general definition of a subnet. In this definition, the map h is required to satisfy the condition: For every α ∈ A there exists a β₀∈ B such that h(β) ≥ α whenever β ≥ β₀. Such a map is final but not necessarily monotone.
2. ↑ Gähler, Werner (1977). Grundstrukturen der Analysis I. Akademie-Verlag, Berlin. , Satz 2.8.3, p. 81

References

• Engelking, Ryszard (1989). General Topology. Heldermann Verlag, Berlin. ISBN 3885380064.  Unknown parameter |note= ignored (help)
• Kelley, John L. (1991). General Topology. Springer. ISBN 3540901256. 
• Runde, Volker (2005). A Taste of Topology. Springer. ISBN 978-0387-25790-7. 
• Willard, Stephen (2004). General Topology. Dover Publications. ISBN 0486434796.