{
  "artifactId": "artifact.library.mathlib.jordan-holder-theorem.v001",
  "candidateOnly": false,
  "category": "Order theory",
  "claimBoundary": "This page indexes Mathlib's abstract order-theoretic Jordan–Hölder declaration. For two CompositionSeries in a JordanHolderLattice, equality of their heads and equality of their lasts imply Equivalent, meaning that a bijection of step positions matches adjacent pairs through the lattice's Iso relation. The conclusion is not equality, an order-preserving identification, or a unique matching. The declaration itself does not mention groups, modules, subgroups, factor groups, bottom-to-top series, or an additional finite-length assumption.",
  "collectionSlug": "landmark-theorems-in-mathlib",
  "exactFormalStatement": "theorem CompositionSeries.jordan_holder {X : Type u} [Lattice X] [JordanHolderLattice X] (s₁ s₂ : CompositionSeries X) (hb : s₁.head = s₂.head) (ht : s₁.last = s₂.last) : CompositionSeries.Equivalent s₁ s₂",
  "family": "Composition series",
  "id": "library.mathlib.jordan-holder-theorem.v001",
  "links": {
    "collection": "/collections/landmark-theorems-in-mathlib/",
    "collectionData": "/data/collections/mathlib-landmarks.json",
    "entry": "/library-theorems/jordan-holder-theorem/",
    "entryData": "/data/library-theorems/jordan-holder-theorem.json",
    "evidence": "/proofs/artifact.library.mathlib.jordan-holder-theorem.v001.html",
    "evidenceData": "/data/proofs/artifact.library.mathlib.jordan-holder-theorem.v001.evidence.json",
    "source": "/sources/upstream/jordan-holder-theorem/"
  },
  "landmark": {
    "completeFormalType": "theorem CompositionSeries.jordan_holder {X : Type u} [Lattice X] [JordanHolderLattice X] (s₁ s₂ : CompositionSeries X) (hb : s₁.head = s₂.head) (ht : s₁.last = s₂.last) : CompositionSeries.Equivalent s₁ s₂",
    "concepts": [
      "Jordan–Hölder lattices",
      "composition series",
      "maximal steps",
      "equivalence by reindexing",
      "lattice induction",
      "isomorphism of adjacent pairs"
    ],
    "plainLanguage": "In any JordanHolderLattice, two composition series with the same head and the same last have equivalent adjacent steps after a bijection reindexes the step positions.",
    "poster": {
      "alt": "An ivory order-theory poster places two rows of five adjacent-step emblems between paired identical head and last stones, then matches the reordered emblems by five crossing one-to-one gold strands.",
      "byteSize": 2884876,
      "caption": "Matching endpoints force equivalence of composition series: a bijection reindexes adjacent steps and pairs them through Iso.",
      "description": "The poster states the abstract JordanHolderLattice theorem above two composition-chain rows whose paired endpoint stones mark the same head and the same last. Five adjacent-step emblems on each row are joined by a crossed one-to-one matching, emphasizing equivalence after reindexing rather than equality in the displayed order. Four source-faithful route lines summarize the induction: remove the second series' last step, replace the first series by an equivalent one through the same penultimate point, match the shortened prefixes, and append the common final interval.",
      "derivatives": [
        {
          "byteSize": 156406,
          "height": 960,
          "mediaType": "image/webp",
          "publicPath": "/assets/library-theorems/jordan-holder-theorem/theorem-poster-v1-640.webp",
          "sha256": "sha256:d7d24c853ddf7d9f16cb514e311662e5276b69be8a70f6ade1ed605860f94b47",
          "width": 640
        },
        {
          "byteSize": 327038,
          "height": 1536,
          "mediaType": "image/webp",
          "publicPath": "/assets/library-theorems/jordan-holder-theorem/theorem-poster-v1-1024.webp",
          "sha256": "sha256:3d241d637d1d47b27cbd577cedf722f62e776c8f1aedcf5320a53cfdc200c4c4",
          "width": 1024
        }
      ],
      "generatedAt": "2026-07-27T10:42:48-04:00",
      "height": 1536,
      "mediaType": "image/png",
      "modelRequested": "gpt-image-2",
      "publicPath": "/assets/library-theorems/jordan-holder-theorem/theorem-poster-v1.png",
      "sha256": "sha256:8b6e143d10a2ca7a089f0324be1abf5746e1f555aebe14bd9817841cd59f06fb",
      "title": "Jordan–Hölder theorem at a glance",
      "width": 1024,
      "kind": "theorem_poster",
      "transcript": "ORDER THEORY · COMPOSITION SERIES\nJORDAN-HÖLDER THEOREM\nsame head · same last\nTHE TWO SERIES ARE EQUIVALENT\nA BIJECTION MATCHES ADJACENT STEPS THROUGH Iso\nHOW THE CHECKED ROUTE MOVES\n1 · Remove the last step from the second series\n2 · Replace the first series by an equivalent one through that point\n3 · Match the shortened prefixes by induction\n4 · Append the common final interval\nEXACT SCOPE\nAbstract JordanHolderLattice. Reindexed equivalence, not literal equality."
    },
    "visual": {
      "alt": "Two dark engraved composition routes split from one ivory head stone and merge at one ivory last stone while five reordered adjacent-step emblems are paired by crossing gold threads.",
      "byteSize": 3383006,
      "caption": "The same endpoints yield equivalent adjacent steps under a bijection of positions, not equality of the displayed chains.",
      "description": "An abstract lattice landscape contains an upper and lower composition route with one common head stone and one common last stone. Five distinct adjacent-step medallions recur once on each route in different orders, and exactly five crossing gold threads pair matching shapes one to one, making the reindexing visible without suggesting that intermediate elements or their order are equal.",
      "derivatives": [
        {
          "byteSize": 56744,
          "height": 427,
          "mediaType": "image/webp",
          "publicPath": "/assets/library-theorems/jordan-holder-theorem/theorem-schematic-v1-640.webp",
          "sha256": "sha256:02ab9ad7d535df7718681630d47c6a8d2e25d2683137c5c1934cb9489cb9cb2c",
          "width": 640
        },
        {
          "byteSize": 219992,
          "height": 800,
          "mediaType": "image/webp",
          "publicPath": "/assets/library-theorems/jordan-holder-theorem/theorem-schematic-v1-1200.webp",
          "sha256": "sha256:b53342b69e0e4b7245e95df64e340fb1d1ad754fe287d5ab99225e19762b0d3d",
          "width": 1200
        }
      ],
      "generatedAt": "2026-07-27T10:42:48-04:00",
      "height": 1024,
      "mediaType": "image/png",
      "modelRequested": "gpt-image-2",
      "publicPath": "/assets/library-theorems/jordan-holder-theorem/theorem-schematic-v1.png",
      "sha256": "sha256:7f4a597883e0061702f80ba31233860c54e0ba44cf7a6a04b93b33cb65d78158",
      "title": "Equivalent composition series between shared endpoints",
      "width": 1536
    },
    "walkthrough": null,
    "whyLandmark": "Jordan–Hölder is the structural uniqueness theorem for composition series, and Mathlib states it at a notably reusable order-theoretic level. The source file documents groups and modules as motivating settings for the abstraction, while this exact declaration cleanly exposes the core conclusion: matching endpoints determine equivalence only after adjacent steps are reindexed and compared through Iso."
  },
  "nonClaims": [
    "Equivalent is not literal equality: it supplies a bijection between step-index types and Iso-related adjacent pairs.",
    "The matching bijection need not preserve the displayed order of the two series and is not asserted to be unique.",
    "The hypotheses identify each series' own head and last; they do not say those endpoints are the bottom and top of the ambient lattice.",
    "The theorem adds no separate finite-length hypothesis; the finite nonempty series structure is already packaged by CompositionSeries.",
    "Groups and modules are motivating contexts documented by the source file, but they are not named in this declaration's binder surface, and this page does not introduce factor groups.",
    "ProofAtlas is indexing an existing Mathlib theorem, and generated explanations and visuals are not proof evidence."
  ],
  "publicExportEligible": true,
  "relationship": "upstream_direct",
  "schemaVersion": "library-theorem-entry-data.v1",
  "statementId": "statement.library.mathlib.jordan-holder-theorem.v001",
  "statusAxes": {
    "acceptedAtlasResult": "Not recorded for the preferred artifact",
    "locallyReproduced": "Exact upstream declaration replayed",
    "reviewedPage": "Current public presentation reviewed",
    "upstreamIndexed": "Pinned source bytes verified locally"
  },
  "summary": "Composition series with matching endpoints are equivalent after reindexing their adjacent steps.",
  "targetId": "target.library.mathlib.jordan-holder-theorem.v001",
  "title": "Jordan–Hölder Theorem",
  "upstreamOrigin": {
    "declarationName": "CompositionSeries.jordan_holder",
    "immutableSourceUrl": "https://github.com/leanprover-community/mathlib4/blob/5e932f97dd25535344f80f9dd8da3aab83df0fe6/Mathlib/Order/JordanHolder.lean#L404",
    "packageName": "mathlib",
    "repositoryUrl": "https://github.com/leanprover-community/mathlib4",
    "sourceArtifactHash": "sha256:ef0023ea3748db1f212b15f4cf2a284066e1ddd484b543b4b1dbb9a0252d9ef8",
    "sourceByteLength": 20593,
    "sourceCommit": "5e932f97dd25535344f80f9dd8da3aab83df0fe6",
    "sourceFile": "Mathlib/Order/JordanHolder.lean",
    "sourceLine": 404,
    "verificationKind": "git_worktree"
  },
  "publicPresentationReview": {
    "status": "reviewed"
  }
}
