Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite-dimensional kG-modules decompose as finite direct sums of indecomposables uniquely up to order and isomorphism

Statement

Every finite-dimensional module over a finite-dimensional algebra is a finite direct sum of indecomposable modules, and the multiset of indecomposable summands is unique up to isomorphism and permutation.

Facts & Assumptions

Given: A finite-dimensional left module M over a finite-dimensional algebra.

[F1]

A composition series is a finite chain of simple factors (Composition series and length of a module).

Proof

technique · direct
1.1

We prove existence by induction on the composition length from [F1]. If M=0 or M is indecomposable, there is nothing to do. Otherwise M=M1M2 with both summands nonzero and of strictly smaller length than M. Applying the induction hypothesis to M1 and M2 yields a finite decomposition of M into indecomposable summands.

F1L1giveninduction
2.1

Let X be an indecomposable finite-length module and fEnd(X). Since X has finite length, the ascending chain of kernels and descending chain of images of the powers of f stabilize. For large n one has X=ker(fn)im(fn). Because X is indecomposable, either ker(fn)=0 and f is invertible, or im(fn)=0 and f is nilpotent. In the second case 1Xf is invertible by the finite geometric series. So the endomorphism ring of an indecomposable finite-length module is local.

L1step 1.1givenalgebra
3.1

Suppose MX1XrY1Ys with all Xi and Yj indecomposable. Restrict the identity of M to X1 and write it as the sum of the composites X1YjX1. Because End(X1) is local by step 2.1, one of these composites is invertible; therefore the corresponding map X1Yj is an isomorphism. Cancel that isomorphic summand from both decompositions and apply induction on the composition length of the complement. This proves r=s and uniqueness up to permutation and isomorphism.

F1step 1.1step 2.1inductionalgebra

Depends on

Used by

Dependency tree · two levels

8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources