Modules over affine algebras having subexponential growth (Q923698): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Growth and uniqueness of rank / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3677877 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4001518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3688509 / rank | |||
Normal rank |
Latest revision as of 11:04, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modules over affine algebras having subexponential growth |
scientific article |
Statements
Modules over affine algebras having subexponential growth (English)
0 references
1990
0 references
Let R be a finitely generated algebra over a field F; so that there is a finite dimensional F-subspace V of R with \(R=\cup V^ n\). The algebra R has subexponential growth if \(\limsup(\log (\dim V^ n)/n)=0\). In this case the author extends the definition of rank, given by \textit{E. Aljadeff} and \textit{S. Rosset} [Isr. J. Math. 64, 251-256 (1988; Zbl 0673.16014)] for free modules, to arbitrary finitely generated modules. The definition, for a finitely generated module M with finite dimensional generating subspace \(M_ 0\), is that \[ rank_{M_ 0}(M)=\limsup(\dim (M_ 0V^ n)/\dim V^ n) \] and then rank(M) is the infimum over all possible \(M_ 0\). Obviously, the rank of M is at most equal to the size of a minimal generating set for M, and also it is shown that the rank of a free module on t generators is t. In the presence of the technical condition of strictly defined growth this rank is a Sylvester module rank function.
0 references
finitely generated algebra
0 references
subexponential growth
0 references
rank
0 references
free modules
0 references
finitely generated modules
0 references
minimal generating set
0 references
strictly defined growth
0 references
Sylvester module rank function
0 references