{
  "aliases": null,
  "backlinks": [
    {
      "field": "uses",
      "target": "04WSW8T3SY"
    },
    {
      "field": "uses",
      "target": "0GPFKS96T7"
    },
    {
      "field": "uses",
      "target": "0WC28W9DNM"
    },
    {
      "field": "uses",
      "target": "0WTEMGYV2C"
    }
  ],
  "body": "\n## Definition\n\nLet $A$ be a [[set|0SJ3RX9TXA]].\nThe power set of $A$ is the set\n$$\\mathcal{P}(A) = \\{S \\mid S \\subseteq A\\}$$\nof all [[subsets|0FE8Q5S42Y]] of $A$.\n\n## Remarks\n\nOther notations are $2^A$ and $\\wp(A)$.\nExample: $\\mathcal{P}(\\{1, 2\\}) = \\{\\varnothing, \\{1\\}, \\{2\\}, \\{1, 2\\}\\}$.\nA finite set with $n$ elements has a power set with $2^n$ elements. See [[cardinality of the power set|0GPFKS96T7]].\nBy [[Cantor's theorem|0WTEMGYV2C]], no set is in bijection with its power set.\n\n## Explanations\n\n### L1 human\n\nTo list the power set, choose for each element whether it is in or out of the subset.\nEach choice gives one subset, so a set with $3$ elements has $2^3 = 8$ subsets.\nThe empty set and the set itself are always among them.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "defines": "00E0YZCERH",
    "kind": "definition",
    "msc": [
      "03E20"
    ],
    "name": "Power set",
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Power_set"
      }
    ],
    "tag": "0BC7KX51Z8",
    "uses": [
      "0FE8Q5S42Y"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/0BC7KX51Z8/",
  "links": [
    {
      "field": "defines",
      "target": "00E0YZCERH"
    },
    {
      "field": "uses",
      "target": "0FE8Q5S42Y"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0BC7KX51Z8.md",
  "msc": [
    "03E20"
  ],
  "name": "Power set",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0BC/0BC7KX51Z8.md",
  "status": null,
  "tag": "0BC7KX51Z8",
  "uri": "m2://0BC7KX51Z8",
  "url": "https://math2.tamnd.com/wiki/power-set-definition/",
  "writing": {
    "tag": "0BC7KX51Z8",
    "kind": "definition",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "one example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge not_instance_of in",
        "note": "one non-example that fails one clause",
        "have": 0,
        "want": 1
      }
    ]
  }
}
