{
  "id": "finite-set",
  "title": "Finite Set",
  "lang": "en",
  "source_lang": "en",
  "summary": "A finite set is a set whose elements can be counted by a nonnegative integer, including zero for the empty set.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/finite-set/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/finite-set/",
      "json": "https://aiwiki.page/zh/finite-set.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A finite set is a set that contains exactly \\(n\\) elements for some nonnegative integer \\(n\\). Equivalently, its elements can be placed in one-to-one correspondence with the numbers \\(1,\\ldots,n\\), with \\(n=0\\) corresponding to the empty set. The number of elements is its cardinality, written \\(|A|\\). Finite sets provide the foundation for counting and occur throughout mathematics, from elementary arithmetic to algebra, probability, and computation."
    },
    {
      "heading": "Definition and notation",
      "text": "Formally, a set \\(A\\) is finite if there is a bijection\n\n\\[f:A\\longrightarrow \\{1,2,\\ldots,n\\}\\]\n\nfor some nonnegative integer \\(n\\). When \\(n=0\\), the set on the right is understood to be the empty set, denoted \\(\\varnothing\\).\n\nThe integer \\(n\\) is uniquely determined by \\(A\\) and is called its cardinality. Thus,\n\n\\[|\\varnothing|=0,\\qquad |\\{a\\}|=1,\\qquad |\\{2,4,6\\}|=3.\\]\n\nA set with one element is a singleton, and a set with \\(n\\) elements is often called an \\(n\\)-element set.\n\nElements of a set are distinct, and their order of presentation does not matter. Consequently,\n\n\\[\\{a,b,a\\}=\\{a,b\\}=\\{b,a\\}.\\]\n\nIf \\(a\\ne b\\), each of these expressions denotes a set with two elements, not three.\n\nFiniteness concerns the number of elements, not their nature or size. For example, \\(\\{\\mathbb{N},\\mathbb{R}\\}\\) has two elements, even though each element is itself an infinite set. Similarly, \\(\\{\\varnothing\\}\\) has one element and is different from \\(\\varnothing\\)."
    },
    {
      "heading": "Characterizations and basic properties",
      "text": "A set is infinite if it is not finite. Several equivalent characterizations of finiteness are useful in ordinary classical mathematics:\n\n- \\(A\\) is in bijection with an initial segment of the natural numbers.\n- \\(A\\) is empty, or it can be listed as \\(A=\\{a_1,\\ldots,a_n\\}\\) for finitely many distinct elements.\n- There is an injection from \\(A\\) into some finite initial segment of the natural numbers.\n- Every nonempty collection of subsets of \\(A\\) has a member minimal under inclusion.\n\nFor a finite set \\(A\\), the following additional properties hold:\n\n- Every subset of \\(A\\) is finite.\n- If \\(B\\subsetneq A\\), then \\(|B|<|A|\\).\n- Every injective function \\(A\\to A\\) is surjective.\n- Every surjective function \\(A\\to A\\) is injective.\n\nThe last two properties express the fact that, on a finite set, an injective self-map cannot leave any element out, and a surjective self-map cannot identify two distinct elements.\n\nProofs about finite sets frequently use mathematical induction on their cardinality. The empty set supplies the base case; removing one element from a nonempty finite set reduces its cardinality by one."
    },
    {
      "heading": "Counting and set operations",
      "text": "Finite sets remain finite under the standard operations of taking subsets, finite unions, Cartesian products, and power sets.\n\nUnions and differences\n\nFor finite sets \\(A\\) and \\(B\\),\n\n\\[|A\\cup B|=|A|+|B|-|A\\cap B|.\\]\n\nThe intersection term corrects for elements counted in both sets. In particular, if \\(A\\cap B=\\varnothing\\), then\n\n\\[|A\\cup B|=|A|+|B|.\\]\n\nAlso,\n\n\\[|A\\setminus B|=|A|-|A\\cap B|.\\]\n\nA finite union of finite sets is finite. An infinite union of finite sets need not be finite: for example,\n\n\\[\\bigcup_{n\\in\\mathbb{N}}\\{n\\}=\\mathbb{N}.\\]\n\nCartesian products\n\nIf \\(|A|=m\\) and \\(|B|=n\\), their Cartesian product satisfies\n\n\\[|A\\times B|=mn.\\]\n\nEach of the \\(m\\) choices for the first coordinate can be combined with each of the \\(n\\) choices for the second.\n\nMore generally, for finitely many finite sets,\n\n\\[|A_1\\times\\cdots\\times A_k| =\\prod_{i=1}^{k}|A_i|.\\]\n\nSubsets and power sets\n\nThe power set \\(\\mathcal{P}(A)\\), consisting of all subsets of \\(A\\), has cardinality\n\n\\[|\\mathcal{P}(A)|=2^{|A|}.\\]\n\nEach element of \\(A\\) has two independent possibilities: it is included in a chosen subset or it is not.\n\nIf \\(|A|=n\\), the number of subsets containing exactly \\(k\\) elements is the binomial coefficient\n\n\\[\\binom{n}{k}=\\frac{n!}{k!(n-k)!}, \\qquad 0\\le k\\le n.\\]\n\nFunctions and permutations\n\nIf \\(|A|=m\\) and \\(|B|=n\\), the number of functions \\(A\\to B\\) is\n\n\\[n^m.\\]\n\nFor this counting formula, \\(0^0\\) is interpreted as \\(1\\): there is exactly one function from the empty set to itself.\n\nThe number of bijections from an \\(n\\)-element set to itself is\n\n\\[n!,\\]\n\nwhere \\(n!\\) is the factorial of \\(n\\). Such bijections are called permutations."
    },
    {
      "heading": "The pigeonhole principle",
      "text": "The pigeonhole principle states that if more than \\(n\\) objects are assigned to \\(n\\) boxes, at least one box receives more than one object.\n\nIn set-theoretic form, if \\(A\\) and \\(B\\) are finite and\n\n\\[|A|>|B|,\\]\n\nthen no function \\(A\\to B\\) is injective. Equivalently, an injection between finite sets requires\n\n\\[|A|\\le |B|.\\]\n\nThis principle underlies many existence arguments in combinatorics. It also explains why no finite set can be in bijection with one of its proper subsets. Infinite sets can behave differently: the map \\(n\\mapsto 2n\\) gives a bijection from the natural numbers to the even natural numbers."
    },
    {
      "heading": "Finiteness, countability, and foundations",
      "text": "Under the common convention that countable means “finite or countably infinite,” every finite set is a countable set. Some authors instead use “countable” to mean only countably infinite, so the intended convention matters.\n\nFiniteness is stronger than being bounded. For example, the real interval \\([0,1]\\) is bounded but contains infinitely many elements. Conversely, any set with only finitely many real elements is finite regardless of how large those elements are.\n\nDedekind finiteness and choice\n\nA set is Dedekind-finite if it is not in bijection with any proper subset of itself. Every finite set is Dedekind-finite.\n\nIn Zermelo–Fraenkel set theory with the axiom of choice, Dedekind finiteness is equivalent to finiteness. Without a suitable choice principle, the converse is not generally provable: there are models of Zermelo–Fraenkel set theory containing infinite Dedekind-finite sets. Thus, “not equinumerous with a proper subset” must be distinguished from the standard definition of finite when foundational assumptions are important.\n\nNo axiom of choice is needed to choose one element from each member of a finite family of nonempty sets. This differs from choosing elements from an arbitrary infinite family, even when every member of that family is finite."
    },
    {
      "heading": "Roles in mathematics and computation",
      "text": "Probability\n\nA finite sample space allows a probability model to be specified by assigning a nonnegative number \\(p(\\omega)\\) to each outcome, with\n\n\\[\\sum_{\\omega\\in\\Omega}p(\\omega)=1.\\]\n\nFor an event \\(E\\subseteq\\Omega\\),\n\n\\[P(E)=\\sum_{\\omega\\in E}p(\\omega).\\]\n\nIf all outcomes are equally likely and \\(\\Omega\\ne\\varnothing\\), then\n\n\\[P(E)=\\frac{|E|}{|\\Omega|}.\\]\n\nFiniteness alone does not imply that outcomes are equally likely.\n\nAlgebra and geometry\n\nA finite field is a field whose underlying set is finite. More generally, many algebraic structures are studied by considering operations on finite sets.\n\nA finite-dimensional vector space, however, need not be a finite set. For example, \\(\\mathbb{R}^2\\) has dimension two but infinitely many vectors. If a vector space has dimension \\(d\\) over a field with \\(q\\) elements, then it has exactly \\(q^d\\) elements.\n\nIn topology, every finite subset of any topological space is compact. Every finite subset of a Hausdorff space is also closed.\n\nComputation\n\nFinite sets serve as domains for exhaustive search, finite-state models, and many discrete data structures. A search over an explicitly enumerable finite set can terminate after inspecting every candidate, but finiteness does not guarantee practical feasibility. An \\(n\\)-element set has \\(2^n\\) subsets and \\(n!\\) permutations, so even moderately sized finite inputs can generate search spaces too large for exhaustive computation."
    }
  ],
  "links": [
    "set-mathematics",
    "integer",
    "bijective-function",
    "empty-set",
    "cardinality",
    "natural-number",
    "injective-function",
    "subset",
    "surjective-function",
    "mathematical-induction",
    "cartesian-product",
    "power-set",
    "binomial-coefficient",
    "mathematical-function",
    "factorial",
    "permutation",
    "pigeonhole-principle",
    "combinatorics",
    "countable-set",
    "zermelo-fraenkel-set-theory",
    "axiom-of-choice",
    "sample-space",
    "finite-field",
    "vector-space",
    "topology"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}