Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)
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.

[F2]

Finite direct sums have coordinate inclusions and projections; the endomorphisms of a module form a ring (The direct sum of an indexed family of modules, The endomorphism ring End⁡R(M) under addition and composition).

Proof

technique · direct
1.1F1giveninduction

Prove existence by induction on d=dim⁡kM. If M=0 or M is indecomposable there is nothing to split. Otherwise M=M1⊕M2 with both summands nonzero. By dimension additivity, 0<dim⁡kMi<d for each i, so the induction hypothesis decomposes each Mi into finitely many indecomposables. Their combined list decomposes M.

1.2F1F2givenalgebra

Let X be a nonzero indecomposable finite-dimensional module and f∈End⁡(X). The dimensions of ker⁡fn increase and are bounded by dim⁡kX, so for some n≥1, ker⁡fn=ker⁡f2n. If y=fn(x) lies in ker⁡fn, then x∈ker⁡f2n=ker⁡fn and y=0. Rank-nullity therefore gives X=ker⁡fn⊕im⁡fn. Both are submodules. Indecomposability makes one summand zero: in the first case f is injective and hence invertible in finite dimension; in the second fn=0. Thus every endomorphism of X is invertible or nilpotent.

2.1F2step 1.2algebra

A nilpotent f has inverse 1+f+⋯+fn−1 for 1−f. If nonunits a,b of End⁡(X) had unit sum u=a+b, then u−1a and u−1b would still be nonunits and would sum to 1; the first is nilpotent by step 1.2, so the second 1−u−1a would be a unit, a contradiction. Thus the nonunits are closed under finite sums. This is the only endomorphism-ring property needed below; no commutativity is assumed.

3.1F2step 2.1algebra

For uniqueness induct on dim⁡kM. Suppose M=X⊕A=Y1⊕⋯⊕Ys, with X and all Yj nonzero indecomposable. The identity of X is the sum of composites ej:X↪M↠Yj↪M↠X. By step 2.1 at least one ej is a unit. Write its two factors as a:X→Yj and b:Yj→X, so ba is invertible. Then a(ba)−1 splits the surjection b, giving Yj=a(X)⊕ker⁡b. Indecomposability of Yj forces ker⁡b=0, hence X≅Yj and b is an isomorphism.

4.1F1F2step 3.1inductionalgebra∎

Put B=⨁i≠jYi. Since the projection M→X restricts to the isomorphism b:Yj→X, the projection M→B restricts to an isomorphism A→B: its kernel is A∩Yj=0, and for every z∈B subtract from z the unique y∈Yj with the same X-projection to obtain a preimage in A. Thus A≅B. Both have dimension smaller than M; induction matches their indecomposable decompositions. Adding X≅Yj proves uniqueness up to permutation and isomorphism.

Depends on

Used by

Dependency tree · two levels

32 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