{
  "id": "net-mathematics",
  "title": "Net (mathematics)",
  "lang": "en",
  "source_lang": "en",
  "summary": "A net is a family indexed by a directed set that generalizes sequences and characterizes convergence in arbitrary topological spaces.",
  "category": "mathematics",
  "subcategory": "geometry",
  "type": "concept",
  "aliases": [
    "Moore–Smith sequence",
    "generalized sequence"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/net-mathematics/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/net-mathematics/",
      "json": "https://aiwiki.page/zh/net-mathematics.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A net is a function from a directed set into a set, usually a topological space. It generalizes a sequence by replacing the natural-number index set with an index set that need not be countable or linearly ordered. Nets allow convergence to describe closure, continuity, and compactness in arbitrary spaces, where sequences alone may be insufficient. (math.wvu.edu)"
    },
    {
      "heading": "Definition and indexing",
      "text": "A directed set is a nonempty set \\(D\\) equipped with a reflexive, transitive relation \\(\\leq\\) such that any two indices have a common upper bound:\n\n\\[\\forall d,e\\in D\\;\\exists f\\in D: \\qquad d\\leq f,\\quad e\\leq f.\\]\n\nAntisymmetry is sometimes required, making the relation a partial order; allowing a preorder also gives the usual theory of nets. A net in \\(X\\) is a map\n\n\\[x:D\\longrightarrow X,\\qquad d\\longmapsto x_d,\\]\n\nwritten \\((x_d)_{d\\in D}\\). An ordinary sequence is the case \\(D=\\mathbb N\\) with its usual order. (math.wvu.edu)\n\nThe order indicates what it means to proceed sufficiently far through the indices. Different indices need not be comparable, but directedness ensures that finitely many requirements on how far to proceed can be satisfied simultaneously. The net is the indexed function, not merely its range: its indexing determines its eventual behavior. (math.wvu.edu)\n\nTypical directed sets include the finite subsets of a set ordered by inclusion, and the neighborhoods of a point ordered by reverse inclusion. For neighborhoods, smaller sets count as later indices; intersections provide common upper bounds. (arxiv.org)"
    },
    {
      "heading": "Convergence and cluster points",
      "text": "In a topological space \\(X\\), a net \\((x_d)\\) converges to \\(x\\), written \\(x_d\\to x\\), if for every neighborhood \\(U\\) of \\(x\\), there is an index \\(d_0\\) such that\n\n\\[d\\geq d_0\\quad\\Longrightarrow\\quad x_d\\in U.\\]\n\nThus the net eventually remains in every neighborhood of its limit. This requires neither a distance function nor countable indexing. (math.uchicago.edu)\n\nA net is eventually in a set \\(A\\) if all its terms beyond some index belong to \\(A\\). It is frequently in \\(A\\) if\n\n\\[\\forall d_0\\in D\\;\\exists d\\geq d_0:\\quad x_d\\in A.\\]\n\nA point \\(x\\) is a cluster point of the net if the net is frequently in every neighborhood of \\(x\\). Being a cluster point is weaker than being a limit: arbitrarily late visits do not require eventual residence. (math.wvu.edu)\n\nLimits need not be unique. A space is a Hausdorff space if and only if every net has at most one limit. In a Hausdorff space, disjoint neighborhoods of two proposed distinct limits would eventually have to contain the same terms, which is impossible. (lerman.web.illinois.edu)"
    },
    {
      "heading": "Why sequences are insufficient",
      "text": "In a first-countable space, every point has a countable neighborhood base, and membership in the closure of a set can be witnessed by a convergent sequence from that set. This includes every metric space. Arbitrary topological spaces need not have this property. (arxiv.org)\n\nFor example, let \\(\\omega_1\\) be the first uncountable ordinal, and give \\([0,\\omega_1]\\) its order topology. The point \\(\\omega_1\\) belongs to the closure of \\([0,\\omega_1)\\), but no sequence of countable ordinals converges to it: the countably many terms have an upper bound strictly below \\(\\omega_1\\). The ordinal-indexed net\n\n\\[x_\\alpha=\\alpha,\\qquad \\alpha<\\omega_1,\\]\n\ndoes converge to \\(\\omega_1\\). It eventually exceeds every prescribed countable ordinal. This is a concrete instance of the uncountable-ordinal phenomenon underlying standard examples such as the extended long line. (math.uchicago.edu)\n\nThe distinction is not simply between countable and uncountable lists. Nets also permit partially ordered indexing, which accommodates several independent approximation requirements. (arxiv.org)"
    },
    {
      "heading": "Subnets",
      "text": "A subnet generalizes a subsequence, but its index set may differ substantially from that of the original net. Under a common convention, a subnet of \\((x_d)_{d\\in D}\\) is a net\n\n\\[y_e=x_{\\phi(e)},\\qquad e\\in E,\\]\n\nwhere \\(E\\) is directed and \\(\\phi:E\\to D\\) is order-preserving and cofinal. Cofinality means that for every \\(d\\in D\\), some \\(\\phi(e)\\) satisfies \\(\\phi(e)\\geq d\\). Together, these requirements ensure that the subnet eventually passes beyond every original index. (legacy-www.math.harvard.edu)\n\nOther conventions replace order preservation and cofinality with the direct requirement\n\n\\[\\forall d\\in D\\;\\exists e_0\\in E\\;\\forall e\\geq e_0: \\quad \\phi(e)\\geq d.\\]\n\nAuthors must specify which convention they use. A subnet need not merely restrict the original net to a subset of its indices, and a subnet of a sequence need not be a subsequence. (math.wvu.edu)\n\nEvery subnet of a convergent net converges to the same limit. A point is a cluster point of a net if and only if some subnet converges to it. (math.hu-berlin.de)"
    },
    {
      "heading": "Characterizations of topological properties",
      "text": "Nets provide several general characterizations:\n\n- Closure: \\(x\\) belongs to the closure of \\(A\\subseteq X\\) if and only if a net with all its terms in \\(A\\) converges to \\(x\\).\n- Closed sets: \\(A\\) is closed if and only if it contains every limit, in \\(X\\), of every net in \\(A\\).\n- Continuity: A map \\(f:X\\to Y\\) is a continuous function if and only if \\(x_d\\to x\\) always implies \\(f(x_d)\\to f(x)\\).\n- Products: A net in a space with the product topology converges if and only if it converges in each coordinate. (math.wvu.edu)\n\nFor closure, one can construct a witnessing net explicitly. If \\(x\\in\\overline A\\), each neighborhood \\(U\\) of \\(x\\) meets \\(A\\). Choose \\(a_U\\in A\\cap U\\), and index these points by neighborhoods ordered by reverse inclusion. Then \\(a_U\\to x\\). This explains how nets follow the full neighborhood structure rather than a potentially inadequate countable selection. (arxiv.org)\n\nA space is compact if and only if every net in it has a convergent subnet; equivalently, every net has a cluster point. This is the net counterpart of sequential compactness, but the two notions are not equivalent in arbitrary spaces. They coincide in metric spaces. (math.hu-berlin.de)"
    },
    {
      "heading": "Relationship with filters",
      "text": "A filter describes eventual behavior through subsets rather than indices. For a net \\((x_d)\\), define its tail sets by\n\n\\[T_{d_0}=\\{x_d:d\\geq d_0\\}.\\]\n\nThese generate the filter\n\n\\[\\mathcal F_x= \\{A\\subseteq X:T_{d_0}\\subseteq A \\text{ for some }d_0\\}.\\]\n\nThus \\(\\mathcal F_x\\) consists precisely of the sets in which the net is eventually located. The net converges to \\(x\\) exactly when every neighborhood of \\(x\\) belongs to \\(\\mathcal F_x\\). (math.wvu.edu)\n\nConversely, every proper filter can be represented by a net with the same eventual-set filter. One construction uses pairs \\((A,a)\\), where \\(A\\) belongs to the filter and \\(a\\in A\\), orders the pairs by reverse inclusion of their set components, and assigns the value \\(a\\). Nets and filters therefore express equivalent convergence information, but they are not in a literal one-to-one correspondence: different nets can generate the same filter. (math.wvu.edu)"
    },
    {
      "heading": "Historical development",
      "text": "The general theory of directed-index convergence was developed by E. H. Moore and H. L. Smith in “A General Theory of Limits,” published in the American Journal of Mathematics in April 1922. The alternative name Moore–Smith sequence reflects this origin. Their framework unified limit processes whose indexing was more general than the positive integers. (jstor.org)"
    }
  ],
  "links": [
    "mathematical-function",
    "topological-space",
    "sequence-mathematics",
    "limit",
    "partial-order",
    "neighborhood-topology",
    "hausdorff-space",
    "first-countable-space",
    "metric-space",
    "ordinal-number",
    "closure-topology",
    "closed-set",
    "continuous-function",
    "product-topology",
    "compact-space"
  ],
  "sources": [
    {
      "title": "A General Theory of Limits",
      "url": "https://www.jstor.org/stable/2370388"
    },
    {
      "title": "Math 535 lecture notes and videos, Fall 2021",
      "url": "https://lerman.web.illinois.edu/535/f21/535f21hw.html"
    },
    {
      "title": "Topology I—III, HU Berlin",
      "url": "https://www.math.hu-berlin.de/~wendl/Sommer2025/Topologie3/lecturenotes.pdf"
    },
    {
      "title": "Topology Course Notes — Harvard University",
      "url": "https://legacy-www.math.harvard.edu/~ctm/papers/home/text/class/harvard/131/course/course.pdf"
    },
    {
      "title": "Topology - I",
      "url": "https://www.math.uchicago.edu/~womp/2004/shulman04.pdf"
    },
    {
      "title": "Sequences and nets in topology",
      "url": "https://arxiv.org/html/1006.4472"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}