Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 2026-09-30
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.

Graded Krull–Schmidt for finite-dimensional graded modules

Statement

Let A be any unital associative Z-graded algebra over a field k. Every finite-dimensional graded left A-module is a finite direct sum of nonzero graded-indecomposable modules (modules not decomposable as a direct sum of two nonzero graded submodules), with the zero module represented by the empty sum. If a module has two such decompositions, their summands have the same finite multiset of isomorphism classes in GrMod⁡0(A), that is, up to degree-zero graded isomorphism (Associative graded algebras, bimodules, and internal shifts). Ungraded isomorphism classes are not substituted.

Facts & Assumptions

Given: A unital associative Z-graded algebra A over a field k and a finite-dimensional graded left A-module M. Decompositions are finite biproducts in GrMod⁡0(A), and indecomposable summands are required to be nonzero. No axiom of choice is used.

Source relation: Webb's ungraded Krull–Schmidt theorem supplies the module-theoretic model; this item proves existence and uniqueness in the degree-zero graded category, including its graded endomorphism-ring step. Kleshchev supplies only the grading conventions.

[F1]

A graded module is the direct sum of its homogeneous pieces, and the action of Ai sends degree d to degree i+d (Associative graded algebras, bimodules, and internal shifts).

[F2]

In GrMod⁡0(A), kernels and images are computed degreewise, and finite biproducts are computed degreewise (Graded modules with degree-zero maps form an abelian category).

[F3]

For a finite-dimensional graded algebra and a nonzero finite-dimensional graded-indecomposable module, the nonunits of its degree-zero endomorphism ring form a proper two-sided ideal (Graded Fitting decomposition for degree-zero endomorphisms).

[F4]

A subspace of a finite-dimensional vector space has dimension at most the ambient dimension, with equality exactly when it is the whole space (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

Proof

technique · direct
1.1F1givenalgebraconstruct

Let X be a nonzero finite-dimensional graded left A-module. Its grading has finite support. Give End⁡k(X) the grading by degree shift: a homogeneous endomorphism of degree r sends Xd into Xd+r. Because the support of X is finite, every k-linear endomorphism is a finite sum of such homogeneous maps, and composition adds degrees. The action map ρ:A→End⁡k(X) sends Ar into degree r; hence its image B=ρ(A)=⨁rρ(Ar) is a graded subalgebra. It is finite-dimensional as a subspace of End⁡k(X), and its identity is 1B=1X. By [F1], X is a graded B-module. Since A↠B, the graded A-submodules and graded B-submodules of X coincide, as do their degree-zero endomorphism rings.

1.2F4giveninductioncasesalgebra

Existence follows by strong induction on d=dim⁡kM. If d=0, the empty sum is the required decomposition. If M is nonzero and graded-indecomposable, it is already a one-term decomposition. Otherwise write M=U⊕V with nonzero graded submodules U,V. Each is a proper subspace of M, so [F4] gives dim⁡kU<d and dim⁡kV<d. Induction decomposes U and V into finite sums of nonzero graded-indecomposables; combining those sums decomposes M.

2.1F3step 1.1given

If X is also graded-indecomposable, it remains graded-indecomposable as a B-module. Apply [F3] to the finite-dimensional graded algebra B and the module X from step 1.1. It follows that the nonunits of End⁡A,0(X)=End⁡B,0(X) form a proper two-sided ideal.

3.1F2step 2.1giveninductionconstruct

Prove uniqueness by strong induction on d=dim⁡kM. When M=0, both decompositions are empty. For nonzero M, assume uniqueness in every smaller dimension and write M=X⊕C=Y1⊕⋯⊕Ys, where all summands are nonzero graded-indecomposables. Let ιX,πX and ιj,πj be the degree-zero inclusions and projections for these finite biproducts. Define ej=πXιjπjιX∈End⁡A,0(X). The identity ∑jιjπj=1M gives ∑jej=1X. By step 2.1 the nonunits form a proper ideal, so at least one ej is invertible.

4.1F2step 3.1algebra

Fix such a j, and put a=πjιX:X→Yj and b=πXιj:Yj→X. Then ba=ej is invertible. The degree-zero map s:=aej−1 satisfies bs=1X, so Yj=s(X)⊕ker⁡b: for each y∈Yj, y=s(b(y))+(y−s(b(y))), and the second term is in ker⁡b, while s(X)∩ker⁡b=0. By [F2], the image and kernel are graded submodules. Since s(X)≠0 and Yj is graded-indecomposable, ker⁡b=0, so s is bijective. Its inverse is A-linear, and it is degree-zero: for homogeneous y∈Yj,d, write s−1(y)=∑exe with xe∈Xe; the direct grading of Yj and injectivity of s force xe=0 for e≠d. Thus s is a degree-zero isomorphism X≅Yj.

5.1F2F4step 4.1algebra

Write M=X⊕C=Yj⊕D, where D is the sum of the other Y-summands. The projection πD∣C:C→D is a degree-zero isomorphism. Its kernel is zero because C∩Yj=0: if c∈C∩Yj, then πX(c)=0 and the isomorphism b=πX∣Yj from step 4.1 forces c=0. For any z∈D, choose the unique y∈Yj with πX(y)=πX(z); then z−y∈C and πD(z−y)=z, proving surjectivity. The inverse is degree-zero by the argument in step 4.1. Since X,Yj are nonzero, C,D are proper subspaces of M, so [F4] gives dim⁡kC,dim⁡kD<d.

6.1step 1.2step 3.1step 4.1step 5.1induction∎

The decompositions of C and D into the remaining indecomposable summands have the same multiset by the induction hypothesis in step 3.1 and the degree-zero isomorphism in step 5.1. Adding X≅Yj from step 4.1 proves uniqueness for M. Step 1.2 proves existence, so every finite-dimensional graded module has a finite decomposition unique up to permutation and degree-zero graded isomorphism.

Depends on

Used by

Dependency tree · two levels

39 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