{
  "aliases": [
    "cancellation-law"
  ],
  "backlinks": [
    {
      "field": "uses",
      "target": "08FKQD7NJ3"
    },
    {
      "field": "proves",
      "target": "ZXES6QGX62"
    }
  ],
  "body": "\n## Statement\n\nLet $G$ be a [[group|G5S1M9]] and let $a, b, c \\in G$.\nIf $ab = ac$, then $b = c$.\nIf $ba = ca$, then $b = c$.\n\n## Remarks\n\nThe first law is left cancellation and the second law is right cancellation.\nTo prove the first law, multiply $ab = ac$ on the left by $a^{-1}$.\nA consequence is that in the [[Cayley table|0YB2NRP0T5]] of a finite group, no element occurs two times in one row or in one column.\nThe laws can fail in a [[monoid|0N6R902FG1]]: in $(\\mathbb{Z}, \\cdot)$, $0 \\cdot 1 = 0 \\cdot 2$ but $1 \\neq 2$.\n\n## Explanations\n\n### L1 human\n\nIn a group, you can remove the same element from both sides of an equation, if it is on the same side of each product.\nThis works because each element has an inverse that undoes it.\nTake care with the side: $ab = ca$ does not give $b = c$ in general.\n\n### L2 agent\n\nThe cancellation laws let us remove a common factor from both sides of an equation. The factor must be on the same side in both products.\n\nThe proof of left cancellation has three steps:\n\n1. Suppose that $ab = ac$.\n2. Multiply both sides on the left by $a^{-1}$.\n3. Associativity and $a^{-1}a = e$ give $b = c$.\n\nA worked example in $S_3$, with composition from right to left:\n\n1. Let $a = (1\\,2)$. Suppose that $ax = (1\\,2\\,3)$ and $ay = (1\\,2\\,3)$.\n2. Then $ax = ay$, so $x = y$ by left cancellation.\n3. Thus $x = a^{-1}(1\\,2\\,3) = (1\\,2)(1\\,2\\,3) = (2\\,3)$ is the only solution.\n\nThis shows a useful consequence. For fixed $a$ and $c$, the equation $ax = c$ has exactly one solution, $x = a^{-1}c$. Thus each row of the Cayley table of a finite group contains each element exactly one time. The same is true for each column.\n\nA common error is to cancel across sides. From $ab = ca$ we cannot conclude $b = c$. In $S_3$, let $a = (1\\,2)$, $b = (1\\,3)$ and $c = (2\\,3)$. Then $ab = (1\\,3\\,2)$ and $ca = (1\\,3\\,2)$, but $b \\ne c$.\n\nThe laws need inverses. In the monoid $(\\mathbb{Z}, \\cdot)$, $0 \\cdot 1 = 0 \\cdot 2$, but $1 \\ne 2$, because $0$ has no inverse.\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "about": [
      "G5S1M9"
    ],
    "aliases": [
      "cancellation-law"
    ],
    "kind": "statement",
    "msc": [
      "20A05"
    ],
    "name": "Cancellation laws",
    "role": "proposition",
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Cancellation_property"
      }
    ],
    "tag": "0VSNX4P2Q0",
    "uses": [
      "G5S1M9"
    ]
  },
  "kind": "statement",
  "link": "https://tamnd.github.io/math2/node/0VSNX4P2Q0/",
  "links": [
    {
      "field": "about",
      "target": "G5S1M9"
    },
    {
      "field": "uses",
      "target": "G5S1M9"
    }
  ],
  "markdown": "https://tamnd.github.io/math2/node/0VSNX4P2Q0.md",
  "msc": [
    "20A05"
  ],
  "name": "Cancellation laws",
  "prov": null,
  "role": "proposition",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0VS/0VSNX4P2Q0.md",
  "status": null,
  "tag": "0VSNX4P2Q0",
  "uri": "m2://0VSNX4P2Q0",
  "url": "https://tamnd.github.io/math2/wiki/cancellation-laws/",
  "writing": {
    "tag": "0VSNX4P2Q0",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}