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 over a finite-dimensional algebra.
A composition series is a finite chain of simple factors (Composition series and length of a module).
Finite-dimensional modules have finite length (A module has a composition series if and only if it is Noetherian and Artinian, the converse using dependent choice).
Proof
We prove existence by induction on the composition length from [F1]. If or is indecomposable, there is nothing to do. Otherwise with both summands nonzero and of strictly smaller length than . Applying the induction hypothesis to and yields a finite decomposition of into indecomposable summands.
Let be an indecomposable finite-length module and . Since has finite length, the ascending chain of kernels and descending chain of images of the powers of stabilize. For large one has . Because is indecomposable, either and is invertible, or and is nilpotent. In the second case is invertible by the finite geometric series. So the endomorphism ring of an indecomposable finite-length module is local.
Suppose with all and indecomposable. Restrict the identity of to and write it as the sum of the composites . Because is local by step 2.1, one of these composites is invertible; therefore the corresponding map is an isomorphism. Cancel that isomorphic summand from both decompositions and apply induction on the composition length of the complement. This proves and uniqueness up to permutation and isomorphism.
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
- Peter Webb, A Course in Finite Group Representation Theory (23 Feb 2016 draft) (standard reference, not scraped)