{
  "aliases": [
    "jordan-holder-theorem"
  ],
  "backlinks": null,
  "body": "\n## Statement\n\nLet $G$ be a [[group|G5S1M9]] and let $\\{e\\} = G_0 \\trianglelefteq \\cdots \\trianglelefteq G_n = G$ and $\\{e\\} = H_0 \\trianglelefteq \\cdots \\trianglelefteq H_m = G$ be two [[composition series|0XV2A49X6Q]] of $G$.\nThen $n = m$, and there is a permutation $\\sigma$ of $\\{1, \\dots, n\\}$ with $G_i / G_{i-1} \\cong H_{\\sigma(i)} / H_{\\sigma(i) - 1}$ for each $i$.\n\n## Remarks\n\nSo the [[composition factors|0PHTC93M58]] and the composition length of $G$ are well defined.\nFor $G = \\mathbb{Z}/n\\mathbb{Z}$, the theorem gives the uniqueness of the prime factorisation of $n$.\nOne proof uses the Schreier refinement theorem, which says that two subnormal series have equivalent refinements.\n\n## History\n\nThe theorem is named after Camille Jordan and Otto Hölder.\n\n## Explanations\n\n### L1 human\n\nA group can be cut into simple layers in many ways.\nThe theorem says that the layers that you get are always the same, up to order.\nThis is the group version of the uniqueness of prime factorisation.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "aliases": [
      "jordan-holder-theorem"
    ],
    "kind": "statement",
    "msc": [
      "20E15",
      "20D30"
    ],
    "name": "Jordan–Hölder theorem",
    "role": "theorem",
    "sources": [
      {
        "locator": "Uniqueness: Jordan–Hölder theorem",
        "url": "https://en.wikipedia.org/wiki/Composition_series"
      }
    ],
    "tag": "0E088ZP533",
    "uses": [
      "0NB8VPB93V",
      "0RFP7F3SEW"
    ]
  },
  "kind": "statement",
  "link": "https://math2.tamnd.com/node/0E088ZP533/",
  "links": [
    {
      "field": "uses",
      "target": "0NB8VPB93V"
    },
    {
      "field": "uses",
      "target": "0RFP7F3SEW"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/0E088ZP533.md",
  "msc": [
    "20E15",
    "20D30"
  ],
  "name": "Jordan–Hölder theorem",
  "prov": null,
  "role": "theorem",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/0E0/0E088ZP533.md",
  "status": null,
  "tag": "0E088ZP533",
  "uri": "m2://0E088ZP533",
  "url": "https://math2.tamnd.com/wiki/jordan-holder-theorem/",
  "writing": {
    "tag": "0E088ZP533",
    "kind": "statement",
    "level": "W0",
    "next": [
      {
        "what": "an inventory row",
        "note": "the row of the inventory that the node accounts for",
        "have": 0,
        "want": 1
      }
    ]
  }
}