{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Statement\n\nLet $U$ be a finite set and let $A \\subseteq U$.\nLet $A^c = U \\setminus A$ be the complement of $A$ in $U$.\nThen $|A^c| = |U| - |A|$.\n\n## Remarks\n\nThe rule follows from the [[rule of sum|0EE2V3CHFK]], because $U$ is the disjoint union of $A$ and $A^c$.\nIt is useful when the complement is easier to count. For example, the number of words of length $n$ over $\\{0, 1\\}$ that contain at least one $1$ is $2^n - 1$.\n\n## Explanations\n\n### L1 human\n\nSometimes it is easier to count what you do not want.\nTo count the outcomes with at least one six in two dice rolls, count the outcomes with no six: $5 \\cdot 5 = 25$. Then $36 - 25 = 11$ outcomes have at least one six.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "kind": "statement",
    "msc": [
      "05A05"
    ],
    "name": "Complement principle",
    "role": "proposition",
    "sources": [
      {
        "locator": "Properties",
        "url": "https://en.wikipedia.org/wiki/Complement_(set_theory)"
      }
    ],
    "tag": "03QC59M99B",
    "uses": [
      "05099E1NMJ",
      "0EE2V3CHFK"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/03QC59M99B/",
  "links": [
    {
      "field": "uses",
      "target": "05099E1NMJ"
    },
    {
      "field": "uses",
      "target": "0EE2V3CHFK"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/03QC59M99B.md",
  "msc": [
    "05A05"
  ],
  "name": "Complement principle",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/03Q/03QC59M99B.md",
  "status": null,
  "tag": "03QC59M99B",
  "uri": "m2://03QC59M99B",
  "url": "https://math2.tamnd.com/wiki/complement-principle/",
  "writing": {
    "tag": "03QC59M99B",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}
