Length of a module


In abstract algebra, the length of a module is a measure of the module's "size". It is defined to be the length of the longest chain of submodules and is a generalization of the concept of dimension for vector spaces. Modules with finite length share many important properties with finite-dimensional vector spaces.


Other concepts used to 'count' in ring and module theory are depth and height; these are both somewhat more subtle to define. There are also various ideas of dimension that are useful. Finite length commutative rings play an essential role in functorial treatments of formal algebraic geometry.




Contents





  • 1 Definition


  • 2 Examples


  • 3 Facts


  • 4 See also


  • 5 References




Definition


Let M be a (left or right) module over some ring R. Given a chain of submodules of M of the form


N0⊊N1⊊⋯⊊Nndisplaystyle N_0subsetneq N_1subsetneq cdots subsetneq N_nN_0subsetneq N_1subsetneq cdots subsetneq N_n

we say that n is the length of the chain. The length of M is defined to be the largest length of any of its chains. If no such largest length exists, we say that M has infinite length.


A ring R is said to have finite length as a ring if it has finite length as left R module.



Examples


The zero module is the only one with length 0. Modules with length 1 are precisely the simple modules.


For every finite-dimensional vector space (viewed as a module over the base field), the length and the dimension coincide.


The length of the cyclic group Z/nZ (viewed as a module over the integers Z)
is equal to the number of prime factors of n, with multiple prime factors counted multiple times.



Facts


A module M has finite length if and only if it is both Artinian and Noetherian. (cf. Hopkins' theorem)


If M has finite length and N is a submodule of M, then N has finite length as well, and we have length(N) ≤ length(M). Furthermore, if N is a proper submodule of M (i.e. if it is unequal to M), then length(N) < length(M).


If the modules M1 and M2 have finite length, then so does their direct sum, and the length of the direct sum equals the sum of the lengths of M1 and M2.


Suppose


0→L→M→N→0displaystyle 0rightarrow Lrightarrow Mrightarrow Nrightarrow 00rightarrow Lrightarrow Mrightarrow Nrightarrow 0

is a short exact sequence of R-modules. Then M has finite length if and only if L and N have finite length, and we have


length(M) = length(L) + length(N).

(This statement implies the two previous ones.)


A composition series of the module M is a chain of the form


0=N0⊊N1⊊⋯⊊Nn=Mdisplaystyle 0=N_0subsetneq N_1subsetneq cdots subsetneq N_n=M0=N_0subsetneq N_1subsetneq cdots subsetneq N_n=M

such that


Ni+1/Ni is simple for i=0,…,n−1displaystyle N_i+1/N_imbox is simple for i=0,dots ,n-1N_i+1/N_imbox is simple for i=0,dots ,n-1

A module M has finite length if and only if it has a (finite) composition series, and the length of every such composition series is equal to the length of M.



See also


  • Hilbert–Poincaré series


References


  • Steven H. Weintraub, Representation Theory of Finite Groups AMS (2003) .mw-parser-output cite.citationfont-style:inherit.mw-parser-output qquotes:"""""""'""'".mw-parser-output code.cs1-codecolor:inherit;background:inherit;border:inherit;padding:inherit.mw-parser-output .cs1-lock-free abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-lock-subscription abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registrationcolor:#555.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration spanborder-bottom:1px dotted;cursor:help.mw-parser-output .cs1-hidden-errordisplay:none;font-size:100%.mw-parser-output .cs1-visible-errorfont-size:100%.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-formatfont-size:95%.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-leftpadding-left:0.2em.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-rightpadding-right:0.2em
    ISBN 0-8218-3222-0,
    ISBN 978-0-8218-3222-6

這個網誌中的熱門文章

Barbados

How to read a connectionString WITH PROVIDER in .NET Core?

Node.js Script on GitHub Pages or Amazon S3