Graded Nakayama and detection of generating degrees #
For a bounded-below internally graded module, the positive-degree part of the algebra cannot
surject onto the whole module unless the module is zero. More generally, homogeneous generators
modulo the positive-degree action generate the module itself. In particular, over a nonnegatively
graded algebra, a bounded-below module is generated in degree d exactly when every homogeneous
piece outside degree d lies in A₊ M.
The last criterion expresses concentration of M / A₊ M in degree d without choosing a
presentation of that quotient. It detects the generating degrees of terms of minimal graded
projective resolutions: maps to modules annihilated by A₊ see precisely this quotient.
Neither projectivity nor semisimplicity is needed for the generation criterion. Boundedness below
is essential; no finite-generation hypothesis is required when a lower bound is supplied.
References #
- C. Năstăsescu and F. Van Oystaeyen, Methods of graded rings, Section 2.3, for graded modules.
- A. Beilinson, V. Ginzburg and W. Soergel, "Koszul duality patterns in representation theory", Section 1.2, for detection of linearity via the generating degrees of minimal resolutions.
A component of A₊ M lies in an A-submodule if all lower-degree pieces do. The positive
scalar lowers the degree of the module component needed to compute that component.
Graded Nakayama for homogeneous generators. In a bounded-below graded module, if each
homogeneous piece lies in the sum of a homogeneous A-submodule and the positive-degree action
on the module, then that submodule is the whole module. This is generation modulo A₊.
Graded Nakayama. A bounded-below graded module satisfying A₊ M = M is zero.
A bounded-below module over a nonnegatively graded algebra is generated in degree d
exactly when its homogeneous pieces outside degree d lie in A₊ M. Equivalently, its quotient
by the positive-degree action is concentrated in degree d.
The generating-degree criterion for a module finite over the grading's scalar semiring. Its internal grading has finite support, which supplies the lower bound automatically.