{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Proof\n\nWe pair the even and the odd permutations by a bijection. Let $n \\geq 2$.\n\n1. By the [[definition of the alternating group|0T13HM377F]], $A_n$ is the set of [[even permutations|0771AJP4BX]], that is, of $\\sigma \\in S_n$ with $\\operatorname{sgn}(\\sigma) = 1$. Let $O$ be the set of odd permutations, with sign $-1$.\n2. Each permutation has sign $1$ or $-1$, so $S_n$ is the disjoint union of $A_n$ and $O$. Hence $|S_n| = |A_n| + |O|$.\n3. The [[sign is a homomorphism|0JEJJCB0EX]], and $A_n$ is its kernel. So $A_n$ is a [[subgroup|0C9ZKYSPYR]] of $S_n$.\n4. Let $t = (1\\ 2)$. It is a [[transposition|02DTRYKGE8]], so $\\operatorname{sgn}(t) = -1$ by the [[definition of the sign|0SK90238BH]].\n5. Define $L \\colon S_n \\to S_n$ by $L(\\sigma) = t\\sigma$. Since the sign is a homomorphism, $\\operatorname{sgn}(L(\\sigma)) = -\\operatorname{sgn}(\\sigma)$.\n6. By step 5, $L$ maps $A_n$ into $O$ and maps $O$ into $A_n$.\n7. Since $t t = e$, we get $L(L(\\sigma)) = \\sigma$ for all $\\sigma$. So the restriction $A_n \\to O$ of $L$ has the inverse $O \\to A_n$, also given by $L$.\n8. Thus $L$ gives a bijection from $A_n$ to $O$, and $|A_n| = |O|$.\n9. By the [[order of the symmetric group|0PCKBBMEXC]], $|S_n| = n!$. With steps 2 and 8, $n! = 2|A_n|$, so $|A_n| = n!/2$.\n10. Since $A_n$ is a subgroup of the finite group $S_n$, we have [[$|S_n| = [S_n : A_n] \\cdot |A_n|$|04DC0SRN2K]]. So $[S_n : A_n] = n! / (n!/2) = 2$.\n\n## Idea\n\nMultiplying by one fixed transposition flips the sign of every permutation. It is its own inverse, so it matches the even permutations one to one with the odd ones. Hence exactly half of the $n!$ permutations are even.\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "kind": "proof",
    "msc": [
      "20B30"
    ],
    "name": "Proof of the order of the alternating group",
    "proves": "0SZ1KMNWVE",
    "sources": [
      {
        "locator": "Properties",
        "url": "https://en.wikipedia.org/wiki/Parity_of_a_permutation"
      }
    ],
    "tag": "9T2QXHAPNR",
    "uses": [
      "0T13HM377F",
      "0771AJP4BX",
      "0JEJJCB0EX",
      "0C9ZKYSPYR",
      "0PCKBBMEXC",
      "04DC0SRN2K",
      "02DTRYKGE8",
      "0SK90238BH"
    ]
  },
  "kind": "proof",
  "link": "https://math2.tamnd.com/node/9T2QXHAPNR/",
  "links": [
    {
      "field": "proves",
      "target": "0SZ1KMNWVE"
    },
    {
      "field": "uses",
      "target": "0T13HM377F"
    },
    {
      "field": "uses",
      "target": "0771AJP4BX"
    },
    {
      "field": "uses",
      "target": "0JEJJCB0EX"
    },
    {
      "field": "uses",
      "target": "0C9ZKYSPYR"
    },
    {
      "field": "uses",
      "target": "0PCKBBMEXC"
    },
    {
      "field": "uses",
      "target": "04DC0SRN2K"
    },
    {
      "field": "uses",
      "target": "02DTRYKGE8"
    },
    {
      "field": "uses",
      "target": "0SK90238BH"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/9T2QXHAPNR.md",
  "msc": [
    "20B30"
  ],
  "name": "Proof of the order of the alternating group",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/9T2/9T2QXHAPNR.md",
  "status": null,
  "tag": "9T2QXHAPNR",
  "uri": "m2://9T2QXHAPNR",
  "url": "https://math2.tamnd.com/wiki/proof-of-the-order-of-the-alternating-group/",
  "writing": {
    "tag": "9T2QXHAPNR",
    "kind": "proof",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}