{
  "id": "aleph-null",
  "title": "Aleph-null",
  "lang": "en",
  "source_lang": "en",
  "summary": "Aleph-null, written ℵ₀, is the smallest infinite cardinal number and measures the size of the set of natural numbers.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Aleph-zero",
    "Aleph-nought",
    "Countable infinity"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/aleph-null/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/aleph-null/",
      "json": "https://aiwiki.page/zh/aleph-null.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Aleph-null, written \\(\\aleph_0\\), is the smallest infinite cardinal number. It is the cardinality of the set of natural numbers: a set has cardinality \\(\\aleph_0\\) precisely when its elements can be placed in one-to-one correspondence with the natural numbers. Such a set is called countably infinite. Aleph-null provides a precise mathematical meaning for one size of infinity, distinct from larger infinite cardinalities such as that of the real numbers."
    },
    {
      "heading": "Definition and notation",
      "text": "Taking \\(\\mathbb N=\\{0,1,2,\\ldots\\}\\), the defining equation is\n\n\\[\\aleph_0=|\\mathbb N|.\\]\n\nHere \\(|A|\\) denotes the cardinality of a set \\(A\\). A set \\(A\\) has cardinality \\(\\aleph_0\\) if there exists a bijection\n\n\\[f:\\mathbb N\\longrightarrow A.\\]\n\nA bijection pairs every natural number with exactly one element of \\(A\\), using every element of \\(A\\) exactly once. Equivalently, the elements of \\(A\\) can be listed as\n\n\\[a_0,a_1,a_2,\\ldots\\]\n\nwith neither omissions nor repetitions. Such a listing need not follow a set’s usual numerical or geometric order.\n\nThe symbol \\(\\aleph\\) is the Hebrew letter aleph. Its subscript \\(0\\) identifies the first member of the aleph sequence, which enumerates the infinite cardinal numbers associated with well-orderable sets.\n\nA countable set is commonly defined to mean either a finite set or a countably infinite set. Under that convention, “countable” does not by itself imply cardinality \\(\\aleph_0\\); “countably infinite” does."
    },
    {
      "heading": "Basic examples",
      "text": "Many sets that contain the natural numbers as a proper subset nevertheless have the same cardinality.\n\nEven numbers and integers\n\nThe nonnegative even numbers have cardinality \\(\\aleph_0\\), because\n\n\\[n\\longmapsto 2n\\]\n\nis a bijection from \\(\\mathbb N\\) to \\(\\{0,2,4,\\ldots\\}\\).\n\nThe set of integers also has cardinality \\(\\aleph_0\\). One enumeration is\n\n\\[0,1,-1,2,-2,3,-3,\\ldots.\\]\n\nThese examples illustrate a characteristic property of infinite sets: a set can have the same cardinality as a proper subset. For finite sets, this is impossible.\n\nRational numbers\n\nThe rational numbers are countably infinite, even though between any two distinct rational numbers there is another rational number.\n\nEvery rational number has a representation \\(p/q\\), where \\(p\\in\\mathbb Z\\) and \\(q\\) is a positive integer. The pairs \\((p,q)\\) can be listed in increasing order of \\(|p|+q\\). Reading their fractions and skipping repeated values yields an enumeration of all rational numbers. Consequently,\n\n\\[|\\mathbb N|=|\\mathbb Z|=|\\mathbb Q|=\\aleph_0.\\]\n\nThis shows that cardinality is different from density: being densely distributed along a line does not make a set uncountable.\n\nPairs and finite sequences\n\nThe Cartesian product \\(\\mathbb N\\times\\mathbb N\\) is countably infinite. Its pairs can be listed by successive diagonals:\n\n\\[(0,0),\\ (0,1),(1,0),\\ (0,2),(1,1),(2,0),\\ldots.\\]\n\nOne explicit bijection is the pairing function\n\n\\[\\pi(m,n)=\\frac{(m+n)(m+n+1)}{2}+n.\\]\n\nMore generally, the set of finite sequences of natural numbers is countably infinite. Thus the set of finite strings over a finite or countably infinite alphabet is at most countable. If the alphabet is nonempty and strings of arbitrary finite length are allowed, that set is countably infinite."
    },
    {
      "heading": "Arithmetic of aleph-null",
      "text": "Cardinal arithmetic describes the sizes of sets constructed by disjoint union, Cartesian product, and function formation. It is not the same as ordinary arithmetic with a very large finite number.\n\nAddition and multiplication\n\nFor every positive finite integer \\(n\\),\n\n\\[\\aleph_0+n=\\aleph_0, \\qquad n\\aleph_0=\\aleph_0.\\]\n\nAlso,\n\n\\[\\aleph_0+\\aleph_0=\\aleph_0, \\qquad \\aleph_0\\cdot\\aleph_0=\\aleph_0.\\]\n\nThe addition identity follows by interleaving two countably infinite lists. The multiplication identity follows from enumerating pairs of natural numbers.\n\nFor every positive finite \\(n\\),\n\n\\[\\aleph_0^n=\\aleph_0.\\]\n\nAccordingly, any fixed finite number of natural-number coordinates still gives only countably many possible tuples.\n\nThese identities do not support unrestricted cancellation. For example,\n\n\\[\\aleph_0+1=\\aleph_0+2\\]\n\ndoes not imply \\(1=2\\).\n\nInfinite exponentiation\n\nAllowing infinitely many coordinates changes the result. The set of infinite binary sequences has cardinality\n\n\\[2^{\\aleph_0},\\]\n\nwhich is strictly greater than \\(\\aleph_0\\). A binary sequence corresponds to a subset of \\(\\mathbb N\\): its \\(n\\)-th entry records whether \\(n\\) belongs to that subset. Thus\n\n\\[2^{\\aleph_0}=|\\mathcal P(\\mathbb N)|,\\]\n\nwhere \\(\\mathcal P(\\mathbb N)\\) is the power set of \\(\\mathbb N\\).\n\nThe set of all infinite sequences of natural numbers has the same cardinality:\n\n\\[\\aleph_0^{\\aleph_0}=2^{\\aleph_0}.\\]\n\nThere are therefore only countably many finite sequences of natural numbers, but uncountably many infinite ones."
    },
    {
      "heading": "Larger infinities and the continuum",
      "text": "Cantor’s theorem states that every set has strictly smaller cardinality than its power set. Applied to \\(\\mathbb N\\), it gives\n\n\\[\\aleph_0<2^{\\aleph_0}.\\]\n\nThe real numbers have cardinality\n\n\\[|\\mathbb R|=2^{\\aleph_0},\\]\n\nalso called the cardinality of the continuum. They cannot be put into a complete list indexed by the natural numbers. Cantor’s diagonal argument establishes this by constructing, from any proposed list of infinite binary sequences, a sequence that differs from the \\(n\\)-th listed sequence at its \\(n\\)-th position.\n\nThe next aleph after \\(\\aleph_0\\) is \\(\\aleph_1\\), the smallest uncountable cardinal. The continuum hypothesis asserts that\n\n\\[2^{\\aleph_0}=\\aleph_1.\\]\n\nIt is independent of the usual axioms of Zermelo–Fraenkel set theory with the axiom of choice, provided those axioms are consistent. Consequently, the strict inequality between countable infinity and the continuum does not, by itself, establish that the continuum is the next infinite cardinal."
    },
    {
      "heading": "Cardinality versus order type",
      "text": "Aleph-null measures size, not order. This distinguishes it from an ordinal number, which describes the order type of a well-ordered set.\n\nThe first infinite ordinal is \\(\\omega\\), the order type of the natural numbers in their usual order. In the standard set-theoretic construction, cardinals are identified with initial ordinals, so \\(\\aleph_0\\) and \\(\\omega\\) are represented by the same underlying set. Their notation nevertheless indicates different roles.\n\nFor example, ordinal addition gives\n\n\\[\\omega+1>\\omega,\\]\n\nbecause appending a final element produces a different, larger order type. Cardinal addition instead gives\n\n\\[\\aleph_0+1=\\aleph_0,\\]\n\nbecause that extra element does not change the set’s cardinality. Likewise, \\(\\omega\\), \\(\\omega+1\\), and \\(\\omega+\\omega\\) are distinct ordinals but all have cardinality \\(\\aleph_0\\)."
    },
    {
      "heading": "Foundational qualifications",
      "text": "Aleph-null exists in Zermelo–Fraenkel set theory without assuming the axiom of choice. The natural numbers can be explicitly well ordered, and every infinite well-orderable set has cardinality at least \\(\\aleph_0\\).\n\nIn the usual framework with choice, every infinite set contains a countably infinite subset, so \\(\\aleph_0\\) is the least infinite cardinality among all sets.\n\nWithout choice, the situation requires care. It is possible for an infinite set to contain no countably infinite subset. Such a set is not finite, but it need not have cardinality comparable with \\(\\aleph_0\\). Also, the general assertion that a countable union of countable sets is countable is not provable in Zermelo–Fraenkel set theory alone. Explicitly supplied enumerations of the constituent sets are sufficient to construct an enumeration of their union."
    },
    {
      "heading": "History and mathematical significance",
      "text": "The theory of infinite cardinalities was developed by Georg Cantor in the late nineteenth century. His work distinguished the countability of the rational numbers from the uncountability of the real numbers and introduced systematic notation for transfinite cardinal numbers.\n\nAleph-null is fundamental to several areas of mathematics:\n\n- In computer science, finite programs can be encoded as finite strings, so there are only countably many programs. Since there are uncountably many functions from \\(\\mathbb N\\) to \\(\\{0,1\\}\\), not every such function can be computed by an algorithm.\n- In topology, a separable space has a countable dense subset. The real line is an example: its rational points are countable and dense, although the full space is uncountable.\n- In measure theory, every countable subset of the real line has Lebesgue measure zero. The converse fails: an uncountable set, such as the usual Cantor set, can also have measure zero.\n\nAleph-null is an exact cardinal number, not a real number or an ordinary numerical limit. A sequence increasing without bound does not converge to \\(\\aleph_0\\) in real analysis, and the symbol \\(\\infty\\) used in limits does not generally denote \\(\\aleph_0\\). Cardinality, order, measure, and limiting behavior describe different mathematical properties."
    }
  ],
  "links": [
    "cardinality",
    "natural-number",
    "bijective-function",
    "countable-set",
    "subset",
    "integer",
    "rational-number",
    "cartesian-product",
    "power-set",
    "cantors-theorem",
    "real-number",
    "cantors-diagonal-argument",
    "continuum-hypothesis",
    "zermelo-fraenkel-set-theory",
    "ordinal-number",
    "axiom-of-choice",
    "georg-cantor",
    "computer-science",
    "algorithm",
    "topology",
    "separable-space",
    "measure-theory",
    "lebesgue-measure",
    "cantor-set"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}