Skip to content

Length of a module

In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules.

Version
v1 · 2026-09-28 · History
Domain-specific #
10367
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomains
Commutative Algebra, Module Theory → Mathematics

Core Idea

Length of a module is treated here as the recurring mathematics, logic, and statistics identity summarized by this source-grounded definition: In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules.

In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules. For vector spaces (modules over a field), the length equals the dimension. If R is an algebra over a field k , the length of a module is at most its dimension as a k -vector space.

In commutative algebra and algebraic geometry, a module over a Noetherian commutative ring R can have finite length only when the module has Krull dimension zero. Modules of finite length are finitely generated modules, but most finitely generated modules have infinite length. Modules of finite length are Artinian modules and are fundamental to the theory of Artinian rings.

For Length of a module, the abstraction is narrower than the article's general subject matter: a positive case must preserve In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in mathematics, logic, and statistics, which is why this identity is domain-specific rather than prime.

Structural Signature

Sig role-phrases:

  • Defining carrier — The length of a ring R is the length of the longest chain of ideals; that is, the length of R considered as a module over itself by left multiplication.
  • Constitutive relation — It is maximal because given any chain, V_0 \subset \cdots \subset V_m the dimension of each inclusion will increase by at least 1.
  • Operating condition — Given an algebraic variety X and a subvariety V of codimension 1 the order of vanishing for a polynomial f \in R(X) is defined as \operatorname{ord}V(f) = \text{length}{V,X}}\left( \frac{\mathcal{O}_X at the generic point of V page 22.}}{(f)} \right) where \mathcal{O}_{V,X} is the local ring defined by the stalk of \mathcal{O}_X along the subvariety V pages 426-227 , or, equivalently, the stalk of \mathcal{O
  • Recognition evidence — If X is an affine variety, and V is defined the by vanishing locus V(f) , then there is the isomorphism \mathcal{O}{V,X} \cong R(X)_V(g) which is similar to defining the order of zeros and poles in complex analysis.} This idea can then be extended to rational functions F = f/g on the variety X where the order is defined as \operatorname{ord}_V(F) := \operatorname{ord}_V(f) - \operatorname{ord
  • Admissible variation — Let M be a (left or right) module over some ring R.
  • Characteristic consequence — The length of M is the largest length of any of its chains.
  • Failure boundary — If no such largest length exists, we say that M has infinite length.

What It Is Not

  • Not the whole field of mathematics, logic, and statistics. The node requires the specific identity stated by In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules.
  • Not an over-broad reading. Let M be a (left or right) module over some ring R.
  • Not an over-broad reading. The length of M is the largest length of any of its chains.
  • Not an over-broad reading. If no such largest length exists, we say that M has infinite length.
  • Not automatically Module (Algebra). Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application

Length of a module applies literally inside mathematics, logic, and statistics wherever the source-defined carrier and relation can be established. Its documented habitats include:

  • Order of vanishing of zeros and poles. A special case of this general definition of a multiplicity is the order of vanishing of a non-zero algebraic function f \in R(X)^* on an algebraic variety.
  • Zero and poles of an analytic function. The order of vanishing is a generalization of the order of zeros and poles for meromorphic functions in complex analysis.
  • Zero and poles of an analytic function. For example, the function \frac{(z-1)^3(z-2)}{(z-1)(z-4i)} has zeros of order 2 and 1 at 1, 2 \in \mathbb{C} and a pole of order 1 at 4i \in \mathbb{C}.
  • Zero and poles of an analytic function. More generally, using the Weierstrass factorization theorem a meromorphic function factors as F = \frac{f}{g} which is a (possibly infinite) product of linear polynomials in both the numerator and denominator.
  • Serre's multiplicity conjectures. Hilbert scheme - can be used to study modules on a scheme with a fixed length.
  • Use in multiplicity theory. The first application was a complete definition of the intersection multiplicity, and, in particular, a statement of Bézout's theorem that asserts that the sum of the multiplicities of the intersection points of algebraic hypersurfaces in a -dimensional projective space is either infinite or is exactly the product of the degrees of the hypersurfaces.

Outside mathematics, logic, and statistics, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Pattern or should be marked as analogy.

Clarity

A clear use of Length of a module names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules. The strongest recognition evidence in the frozen account is: If X is an affine variety, and V is defined the by vanishing locus V(f) , then there is the isomorphism \mathcal{O}{V,X} \cong R(X)_V(g) which is similar to defining the order of zeros and poles in complex analysis. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification Let M be a (left or right) module over some ring R. so that a reader can reproduce the classification rather than infer it from topical resemblance.} This idea can then be extended to rational functions F = f/g on the variety X where the order is defined as \operatorname{ord}_V(F) := \operatorname{ord}_V(f) - \operatorname{ord

Manages Complexity

Length of a module compresses multiple mathematics, logic, and statistics details into a stable diagnostic relation. The source shows both the central mechanism—it is maximal because given any chain, V_0 \subset \cdots \subset V_m the dimension of each inclusion will increase by at least 1 .—and the practical consequence—the length of M is the largest length of any of its chains. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning

  1. Type the carrier. Identify the mathematics, logic, and statistics entities to which the claim applies.
  2. State the relation. Use the source-grounded identity: In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules.
  3. Check operation and conditions. Given an algebraic variety X and a subvariety V of codimension 1 the order of vanishing for a polynomial f \in R(X) is defined as \operatorname{ord}V(f) = \text{length}{V,X}}\left( \frac{\mathcal{O}_X at the generic point of V page 22.}}{(f)} \right) where \mathcal{O}_{V,X} is the local ring defined by the stalk of \mathcal{O}_X along the subvariety V pages 426-227 , or, equivalently, the stalk of \mathcal{O
  4. Demand recognition evidence. If X is an affine variety, and V is defined the by vanishing locus V(f) , then there is the isomorphism \mathcal{O}{V,X} \cong R(X)_V(g) which is similar to defining the order of zeros and poles in complex analysis.} This idea can then be extended to rational functions F = f/g on the variety X where the order is defined as \operatorname{ord}_V(F) := \operatorname{ord}_V(f) - \operatorname{ord
  5. Test variation. Change an implementation or setting while preserving let M be a (left or right) module over some ring R.
  6. Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
  7. Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Pattern.

Knowledge Transfer

Within the home domain. Knowledge about Length of a module transfers literally when a new case preserves the same carrier type, relation, and recognition test. A special case of this general definition of a multiplicity is the order of vanishing of a non-zero algebraic function f \in R(X)^* on an algebraic variety. The order of vanishing is a generalization of the order of zeros and poles for meromorphic functions in complex analysis.

Beyond the home domain. No canonical parent is asserted for Length of a module. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples

Canonical

This definition of multiplicity is quite general, and contains as special cases most of previous notions of algebraic multiplicity. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules; recognition evidence → If X is an affine variety, and V is defined the by vanishing locus V(f) , then there is the isomorphism \mathcal{O}{V,X} \cong R(X)_V(g) which is similar to defining the order of zeros and poles in complex analysis} This idea can then be extended to rational functions F = f/g on the variety X where the order is defined as \operatorname{ord}_V(F) := \operatorname{ord}_V(f) - \operatorname{ord

Applied / In Practice

A special case of this general definition of a multiplicity is the order of vanishing of a non-zero algebraic function f \in R(X)^* on an algebraic variety. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Order of vanishing of zeros and poles; invariant → In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules; boundary → the case exits the class when let M be a (left or right) module over some ring R

Structural Tensions

T1 — Stable identity versus admissible variation. Let M be a (left or right) module over some ring R. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. The length of M is the largest length of any of its chains. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. If no such largest length exists, we say that M has infinite length. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. Clearly, if the length of a chain equals the length of the module, one has M_0=0 and M_n=M. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. The length of a ring R is the length of the longest chain of ideals; that is, the length of R considered as a module over itself by left multiplication. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Length of a module literally, co-instantiate Pattern, or only resemble it?

T6 — Autonomy versus reduction. It is maximal because given any chain, V_0 \subset \cdots \subset V_m the dimension of each inclusion will increase by at least 1. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Length of a module distinguish that the broader parent Pattern leaves together?

Structural–Framed Character

Length of a module is structural-leaning. Its structural side is the repeatable organization summarized by In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules. Its framed side is the mathematics, logic, and statistics vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: Given an algebraic variety X and a subvariety V of codimension 1 the order of vanishing for a polynomial f \in R(X) is defined as \operatorname{ord}V(f) = \text{length}{V,X}}\left( \frac{\mathcal{O}_X at the generic point of V page 22. }}{(f)} \right) where \mathcal{O}_{V,X} is the local ring defined by the stalk of \mathcal{O}_X along the subvariety V pages 426-227 , or, equivalently, the stalk of \mathcal{OImport versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Pattern. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent

What is skeletal. In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: The length of a ring R is the length of the longest chain of ideals; that is, the length of R considered as a module over itself by left multiplication. It is maximal because given any chain, V0 \subset \cdots \subset Vm the dimension of each inclusion will increase by at least 1. It further constrains recognition and variation through: Given an algebraic variety X and a subvariety V of codimension 1 the order of vanishing for a polynomial f \in R(X) is defined as \operatorname{ord}V(f) = \text{length}{\mathcal{O}{V,X}}\left( \frac{\mathcal{O}{V,X}}{(f)} \right) where \mathcal{O}{V,X} is the local ring defined by the stalk of \mathcal{O}X along the subvariety V pages 426-227 , or, equivalently, the stalk of \mathcal{O}X at the generic point of V page 22. If X is an affine variety, and V is defined the by vanishing locus V(f) , then there is the isomorphism \mathcal{O}{V,X} \cong R(X){(f)} This idea can then be extended to rational functions F = f/g on the variety X where the order is defined as \operatorname{ord}V(F) := \operatorname{ord}V(f) - \operatorname{ord}V(g) which is similar to defining the order of zeros and poles in complex analysis.

What is domain-bound. mathematics, logic, and statistics supplies the operative entities, technical vocabulary, warrants, and exceptions that make Length of a module literal. Its documented scope includes the condition that A special case of this general definition of a multiplicity is the order of vanishing of a non-zero algebraic function f \in R(X)^ on an algebraic variety. Another bounded application condition is that The order of vanishing is a generalization of the order of zeros and poles for meromorphic functions in complex analysis. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—Let M be a (left or right) module over some ring R.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry presupposes Module (Algebra).

  • Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Length of a module. The reviewed identity is: In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
  • Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions

Local relationship map for Length of a moduleParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Length of a moduleDOMAINDomain-specific abstraction: Module (Algebra) — presupposesModule (Algebra)DOMAIN

Current abstraction Length of a module Domain-specific

Parents (1) — more general patterns this builds on

  • Length of a module presupposes Module (Algebra) Domain-specific

    Module length is defined from chains of submodules and therefore presupposes a module carrier.

Hierarchy paths (5) — routes to 5 parentless roots

Neighborhood in Abstraction Space

Length of a module sits in a moderately populated region (42nd percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Ring & Module Structure Theory (14 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With

  • Pattern. The parent omits the specialist differentia. Tell: Can the case establish In algebra, the length of a module over a ring R is a generalization of the dimension of a vector space which measures its size. page 153 It is defined to be the length of the longest chain of submodules?
  • Module (Algebra). An additive abelian group equipped with a compatible left or right action by a ring, generalizing vector spaces from field scalars to ring scalars. Tell: Which entry's carrier, operation, and failure condition are satisfied?
  • Depth (ring theory). A homological invariant measuring the length of a maximal regular sequence acting on a module, equivalently the first degree of nonvanishing Ext under standard local Noetherian hypotheses. Tell: Which entry's carrier, operation, and failure condition are satisfied?
  • Algebra over a Ring. An R-module equipped with an R-bilinear internal multiplication, with associativity, unity, and commutativity imposed only at the explicitly declared convention tier. Tell: Which entry's carrier, operation, and failure condition are satisfied?
  • A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Length of a module remain present if the detector or downstream effect changed?
  • A metaphorical analogue. A similar shape outside mathematics, logic, and statistics lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Pattern?

References

  • Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Length_of_a_module (revision 1301105333).
  • Preserved source candidate: http://www.centerofmathematics.com/wwcomstore/index.php/commalg.html
  • Preserved source candidate: https://web.archive.org/web/20130302125321/http://www.centerofmathematics.com/wwcomstore/index.php/commalg.html
  • Preserved source candidate: https://www.mi.fu-berlin.de/en/math/groups/arithmetic_geometry/teaching/exercises/Altman_-Kleiman—A-term-of-commutative-algebra-2017.pdf
  • Preserved source candidate: https://stacks.math.columbia.edu/tag/02LZ
  • Preserved source candidate: https://stacks.math.columbia.edu/tag/0BE0
  • Preserved source candidate: http://link.springer.com/10.1007/978-1-4757-3849-0
  • Preserved source candidate: https://stacks.math.columbia.edu/tag/02MB
  • Preserved source candidate: https://stacks.math.columbia.edu/tag/00IU

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.