{
  "id": "power-set",
  "title": "Power Set",
  "lang": "en",
  "source_lang": "en",
  "summary": "The power set of a set is the collection of all its subsets, including the empty set and the original set.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Powerset",
    "Set of all subsets"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/power-set/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/power-set/",
      "json": "https://aiwiki.page/zh/power-set.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "In set theory, the power set of a set \\(S\\) is the set whose elements are exactly the subsets of \\(S\\). It includes both the empty set and \\(S\\) itself. Usually written \\(\\mathcal P(S)\\), it converts a collection of objects into a collection of all possible selections from those objects. Power sets provide a basic construction for studying sets, functions, and different sizes of infinity. (plato.stanford.edu)"
    },
    {
      "heading": "Definition and examples",
      "text": "The formal definition is\n\n\\[\\mathcal P(S)=\\{A\\mid A\\subseteq S\\}.\\]\n\nThus \\(A\\in\\mathcal P(S)\\) means exactly that every element of \\(A\\) belongs to \\(S\\). Membership and inclusion must be distinguished: a subset of \\(S\\) is an element of its power set, rather than merely another element of \\(S\\). (web.stanford.edu)\n\nFor example, if \\(S=\\{a,b,c\\}\\), then\n\n\\[\\mathcal P(S)= \\{\\varnothing,\\{a\\},\\{b\\},\\{c\\}, \\{a,b\\},\\{a,c\\},\\{b,c\\},\\{a,b,c\\}\\}.\\]\n\nThere are eight subsets, including those with zero or three elements. In particular,\n\n\\[\\mathcal P(\\varnothing)=\\{\\varnothing\\},\\]\n\nwhich is not empty: it has one element. The original set is always included because \\(S\\subseteq S\\). These examples follow directly from the definition. (web.stanford.edu)"
    },
    {
      "heading": "Finite cardinality",
      "text": "If \\(S\\) has \\(n\\) elements, its power set has cardinality\n\n\\[|\\mathcal P(S)|=2^n.\\]\n\nEach element presents two choices—include it or exclude it—and the choices determine a unique subset. Alternatively, mathematical induction proves the formula: adjoining one new element doubles the number of subsets, since every old subset occurs both without and with that element. The base case is \\(2^0=1\\). (cs.cornell.edu)\n\nSubsets can also be counted by size:\n\n\\[|\\mathcal P(S)|=\\sum_{k=0}^{n}\\binom nk=2^n.\\]\n\nHere \\(\\binom nk\\) counts the subsets containing exactly \\(k\\) elements. The equality is a special case of the binomial theorem, obtained by expanding \\((1+1)^n\\). (cs.pomona.edu)"
    },
    {
      "heading": "Characteristic functions and binary representation",
      "text": "Every subset \\(A\\subseteq S\\) determines an indicator function, also called a characteristic function:\n\n\\[\\chi_A:S\\longrightarrow\\{0,1\\},\\qquad \\chi_A(s)= \\begin{cases} 1,&s\\in A,\\\\ 0,&s\\notin A. \\end{cases}\\]\n\nConversely, any such function determines the subset on which it equals \\(1\\). This gives a bijection between \\(\\mathcal P(S)\\) and the set of functions \\(S\\to\\{0,1\\}\\), explaining the alternative notation \\(2^S\\). This correspondence respects the Boolean operations on subsets and truth-valued functions. (home.uni-leipzig.de)\n\nFor an ordered finite set, these functions can be represented as strings of bits. A \\(1\\) records inclusion and a \\(0\\) exclusion. For \\(S=(a,b,c)\\), the string \\(101\\) represents \\(\\{a,c\\}\\). Reading the strings as binary numbers permits enumeration by counting from \\(0\\) to \\(2^n-1\\). (ics.uci.edu)"
    },
    {
      "heading": "Infinite sets and Cantor’s theorem",
      "text": "Cantor’s theorem states that every set has strictly smaller cardinality than its power set:\n\n\\[|S|<|\\mathcal P(S)|.\\]\n\nAn injection \\(S\\to\\mathcal P(S)\\) is supplied by \\(s\\mapsto\\{s\\}\\). The essential result is that no surjection \\(S\\to\\mathcal P(S)\\) exists. (math.arizona.edu)\n\nThe diagonal argument establishes this by considering any function \\(f:S\\to\\mathcal P(S)\\) and defining\n\n\\[D=\\{s\\in S\\mid s\\notin f(s)\\}.\\]\n\nIf \\(f\\) were surjective, some \\(d\\in S\\) would satisfy \\(f(d)=D\\). But then\n\n\\[d\\in D\\iff d\\notin D,\\]\n\na contradiction. Therefore \\(D\\) is a subset missing from the image of \\(f\\). The argument applies to finite and infinite sets alike. (math.arizona.edu)\n\nConsequently, the power set of the natural numbers is not a countable set. Repeatedly taking power sets produces successively larger infinite cardinalities, so there is no largest size of infinity. (math.arizona.edu)"
    },
    {
      "heading": "Order and algebraic structure",
      "text": "Set inclusion defines a partial order on \\(\\mathcal P(S)\\). Together with union, intersection, and complement relative to \\(S\\), the power set forms a Boolean algebra. The empty set is its least element and \\(S\\) its greatest; union and intersection correspond to disjunction and conjunction, while complementation corresponds to negation. Under characteristic functions, these operations become pointwise Boolean operations. (home.uni-leipzig.de)\n\nFor a finite \\(n\\)-element set, the resulting ordered structure is commonly denoted \\(B_n\\). Its levels group subsets according to their cardinality, with the empty set at the bottom and the whole set at the top. (math.mit.edu)"
    },
    {
      "heading": "Foundations and applications",
      "text": "In Zermelo–Fraenkel set theory, the power set axiom guarantees that all subsets of any given set form a set. Power sets also generate successor stages of the cumulative hierarchy:\n\n\\[V_0=\\varnothing,\\qquad V_{\\alpha+1}=\\mathcal P(V_\\alpha).\\]\n\nAt limit stages, earlier stages are combined by union. (plato.stanford.edu)\n\nIn probability theory, events belong to a sigma-algebra contained in the power set of a sample space. For discrete models, all subsets can be events. Continuous models often use a smaller sigma-algebra, allowing probability to be defined consistently without assigning it to every subset. (math.cmu.edu)\n\nIn computing, an algorithm can enumerate a finite power set through bit patterns. Nevertheless, there are \\(2^n\\) outputs for an \\(n\\)-element input: compactly representing each subset does not remove the exponential number of subsets that full enumeration must produce. (web.eecs.utk.edu)"
    }
  ],
  "links": [
    "set-theory",
    "subset",
    "empty-set",
    "cardinality",
    "mathematical-induction",
    "binomial-theorem",
    "indicator-function",
    "mathematical-function",
    "bijective-function",
    "bit",
    "binary-number",
    "cantors-theorem",
    "injective-function",
    "surjective-function",
    "cantors-diagonal-argument",
    "natural-number",
    "countable-set",
    "partial-order",
    "boolean-algebra",
    "zermelo-fraenkel-set-theory",
    "probability",
    "sigma-algebra",
    "sample-space",
    "algorithm"
  ],
  "sources": [
    {
      "title": "plato.stanford.edu/entries/set-theory/index.html",
      "url": "https://plato.stanford.edu/entries/set-theory/index.html"
    },
    {
      "title": "web.stanford.edu/class/archive/cs/cs103/cs103.1256/guide_to_proofs_on_sets",
      "url": "https://web.stanford.edu/class/archive/cs/cs103/cs103.1256/guide_to_proofs_on_sets"
    },
    {
      "title": "cs.cornell.edu/courses/cs2800/2017sp/lectures/lec10-induction.html",
      "url": "https://www.cs.cornell.edu/courses/cs2800/2017sp/lectures/lec10-induction.html"
    },
    {
      "title": "cs.pomona.edu/~michael/courses/csci054f20/informal/day23/",
      "url": "https://cs.pomona.edu/~michael/courses/csci054f20/informal/day23/"
    },
    {
      "title": "home.uni-leipzig.de/gkobele/courses/2020.SS/Semantics/posts/isosetfunc/",
      "url": "https://home.uni-leipzig.de/gkobele/courses/2020.SS/Semantics/posts/isosetfunc/"
    },
    {
      "title": "ics.uci.edu/~alspaugh/cls/shr/powerset.html",
      "url": "https://ics.uci.edu/~alspaugh/cls/shr/powerset.html"
    },
    {
      "title": "math.arizona.edu/~faris/logicweb/proof.pdf",
      "url": "https://math.arizona.edu/~faris/logicweb/proof.pdf"
    },
    {
      "title": "math.mit.edu/~rstan/transparencies/posets.pdf",
      "url": "https://math.mit.edu/~rstan/transparencies/posets.pdf"
    },
    {
      "title": "math.cmu.edu/~gautam/c/2026-425/notes/probability-spaces.html",
      "url": "https://www.math.cmu.edu/~gautam/c/2026-425/notes/probability-spaces.html"
    },
    {
      "title": "web.eecs.utk.edu/~jplank/plank/classes/cs302/Notes/Enumeration/",
      "url": "https://web.eecs.utk.edu/~jplank/plank/classes/cs302/Notes/Enumeration/"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}