1 Basic definitions and equivalent characterizations

1.1 Modules and generating sets

Let \(R\) be a ring (not necessarily commutative unless stated). An \(R\)-module \(M\) is a generalization of a vector space where scalars come from \(R\). A subset \(S\subseteq M\) is said to generate \(M\) as an \(R\)-module if every element \(m\in M\) can be written as an \(R\)-linear combination of elements of \(S\). Concretely, if \(S=\{m_1,\dots,m_n\}\), the statement means that for each \(m\in M\) there exist coefficients \(r_1,\dots,r_n\in R\) such that \[ m=r_1 m_1+\cdots+r_n m_n. \] When such a finite generating set exists, \(M\) is called finitely generated. If no finite generating set exists, \(M\) is infinitely generated.

1.2 Equivalent formulations of finite generation

Finite generation can be phrased in several equivalent ways. The equivalence typically rests on the relationship between generating sets, surjections from free modules, and submodules generated by a subset.

1.2.1 Images under module homomorphisms

A standard characterization uses surjections. If \(M\) is finitely generated, there exists a surjective homomorphism from a finite free module \(R^{n}\twoheadrightarrow M\). Conversely, if \(M\) is the image of such a map, then the images of the standard basis elements form a finite generating set for \(M\). More generally, if \(f:N\to M\) is a surjective homomorphism and \(N\) is finitely generated, then \(M\) is finitely generated, because the images of generators of \(N\) generate the image.

1.2.2 Generating sets and span

For any subset \(S\subseteq M\), the submodule it generates is \[ \langle S\rangle=\left\{\sum_{i=1}^k r_i s_i \,:\, k\ge 1,\ r_i\in R,\ s_i\in S\right\}. \] Thus \(M\) is finitely generated exactly when there exists a finite subset \(S\) with \(\langle S\rangle=M\). In practice, one often works with spans of finite sets inside \(M\), because these are automatically finitely generated submodules.

1.3 Minimal number of generators (generator rank)

If \(M\) is finitely generated, one may ask for the smallest integer \(n\) such that \(M\) admits a generating set of size \(n\). This number is often called the generator rank of \(M\) (with some authors using different conventions when \(R\) is not commutative). Equivalently, it is the minimal \(n\) for which there exists a surjection \(R^{n}\twoheadrightarrow M\). The generator rank is an invariant of \(M\) up to isomorphism, though it can be hard to compute in general.

2 Examples and non-examples

2.1 Common examples over standard rings

2.1.1 Cyclic modules

A module \(M\) is cyclic if it is generated by a single element. Then \(M\cong R/I\) for some submodule \(I\) of \(R\) (typically a left ideal if \(R\) is noncommutative). Cyclic modules are therefore finitely generated. In particular, \(R\) itself is cyclic as an \(R\)-module, generated by \(1\).

2.1.2 Free modules of finite rank

For each positive integer \(n\), the free module \(R^{n}\) is generated by the standard basis vectors \(e_1,\dots,e_n\), so it is finitely generated. Its generator rank is exactly \(n\), since no generating set with fewer than \(n\) elements can span \(R^n\) as an \(R\)-module (under mild assumptions; for example, over rings where cancellation holds for free modules, the minimality is straightforward).

2.2 Non-finitely generated modules

2.2.1 Infinite direct sums

Let \(M=\bigoplus_{i\in I} R\) be an infinite direct sum with \(I\) infinite. Elements of \(M\) have only finitely many nonzero components. If \(I\) is infinite, then no finite subset of basis vectors can generate all components, because any finite set involves only finitely many indices. Hence \(M\) is not finitely generated.

2.2.2 Infinitely generated ideals

Even when \(R\) is a familiar ring, some ideals may fail to be finitely generated. If \(I\subseteq R\) is an ideal that cannot be generated by finitely many elements, then \(I\) viewed as an \(R\)-module is infinitely generated. This phenomenon is central in distinguishing Noetherian rings from general rings.

3 Operations on finitely generated modules

3.1 Submodules

If \(M\) is finitely generated, a submodule \(N\subseteq M\) need not be finitely generated over an arbitrary ring. However, under additional conditions on \(R\) (notably Noetherian hypotheses), every submodule of a finitely generated module is again finitely generated. Without those assumptions, submodules can require infinitely many generators.

3.2 Quotient modules

If \(M\) is finitely generated and \(N\subseteq M\) is any submodule, then the quotient \(M/N\) is always finitely generated. One way to see this is: if \(m_1,\dots,m_n\) generate \(M\), then their images \(\overline{m}_1,\dots,\overline{m}_n\) generate \(M/N\), since any element of the quotient is represented by an element of \(M\), which is an \(R\)-linear combination of the generators.

3.3 Direct sums and products

3.3.1 Finite direct sums

If \(M_1\) and \(M_2\) are finitely generated, then their direct sum \(M_1\oplus M_2\) is finitely generated. Generators can be taken as the union of generating sets embedded into the respective components. More generally, a finite direct sum of finitely generated modules is finitely generated.

3.3.2 Infinite direct products (contrast with finite generation)

For infinite families, direct products behave differently from direct sums. Let \(\prod_{i\in I} M_i\) be an infinite product. Even if each \(M_i\) is finitely generated (for example, \(M_i=R\)), the product can fail to be finitely generated. Intuitively, to generate an arbitrary tuple \((m_i)_{i\in I}\), a finite generating set would have to control infinitely many coordinates simultaneously, which is generally impossible unless \(I\) is finite or the modules have special properties.

4 Module homomorphisms and categorical behavior

4.1 Homomorphic images

A homomorphic image of a finitely generated module is finitely generated. Specifically, if \(f:M\to N\) is a surjective homomorphism and \(M\) is generated by \(m_1,\dots,m_n\), then \(N\) is generated by \(f(m_1),\dots,f(m_n)\). This makes finite generation stable under taking quotients by kernels.

4.2 Kernels and preimages

Kernels behave more subtly. If \(f:M\to N\) is surjective and \(M\) is finitely generated, the kernel need not be finitely generated over an arbitrary ring. Under Noetherian assumptions on \(R\), however, kernels of maps between finitely generated modules become finitely generated, because they are submodules of finitely generated modules.

Preimages also reflect this stability. If \(g:L\to M\) is a homomorphism and \(M\) is finitely generated, the module \(g^{-1}(N)\) for a submodule \(N\subseteq M\) can inherit finiteness only when submodule finiteness is controlled (e.g., in Noetherian settings).

4.3 Exact sequences and finite generation

4.3.1 Short exact sequences criteria

Consider a short exact sequence \[ 0\to A\to B\to C\to 0. \] One always has: if \(B\) is finitely generated, then \(C\) is finitely generated, since \(C\) is a quotient of \(B\). Similarly, if \(A\) and \(C\) are finitely generated and the ring is Noetherian (or if finiteness of submodules is otherwise ensured), then \(B\) is finitely generated. The reverse implications also follow patterns depending on which finiteness is assumed and on whether submodule finiteness holds.

4.3.2 Long exact sequences context (module-theoretic viewpoint)

In homological algebra, finite generation interacts with long exact sequences arising from derived functors (such as \(\mathrm{Tor}\) or \(\mathrm{Ext}\)). While the modules occurring there may not be finitely generated automatically, one often uses finite generation criteria to deduce that certain terms in these sequences are finitely generated, given information about adjacent terms and structural properties of \(R\) (notably, Noetherian conditions and coherence assumptions in broader contexts).

5 Relationship to Noetherian rings

5.1 Definition of Noetherian rings via ideals and modules

A ring \(R\) is called Noetherian if every ascending chain of ideals stabilizes, equivalently if every ideal is finitely generated. For modules, a closely related notion is: an \(R\)-module \(M\) is Noetherian if every ascending chain of submodules of \(M\) stabilizes.

When \(R\) is Noetherian, the finiteness properties become highly regular: submodules of finitely generated modules are finitely generated, quotients of finitely generated modules are finitely generated (as always), and exact sequences behave predictably with respect to generator counts.

5.2 Finitely generated modules over Noetherian rings

5.2.1 Ascending chain condition on submodules

If \(R\) is Noetherian and \(M\) is finitely generated, then \(M\) satisfies the ascending chain condition on submodules. This means that any increasing sequence \[ N_1\subseteq N_2\subseteq \cdots \] eventually becomes constant. The consequence is that there is no need for infinitely many distinct steps to describe larger and larger submodules.

5.2.2 Consequences for submodules and quotients

Under these hypotheses, every submodule \(N\subseteq M\) is finitely generated. Moreover, quotients \(M/N\) are finitely generated as well (inheriting generators from \(M\)). Together, these statements ensure that “finite generation” behaves well under standard constructions inside module theory.

6 Localization and extension of scalars

6.1 Behavior under localization

Localization is a method for focusing on certain elements of a ring or certain regions of a spectrum. Given a multiplicative subset \(S\subseteq R\), one forms \(S^{-1}R\) and the localized module \(S^{-1}M\).

6.1.1 Localizing the generating set

If \(M\) is generated by \(m_1,\dots,m_n\), then \(S^{-1}M\) is generated (as an \(S^{-1}R\)-module) by the localized elements \(\frac{m_1}{1},\dots,\frac{m_n}{1}\). Every element of \(S^{-1}M\) has the form \(\frac{m}{s}\), and \(m\) is an \(R\)-linear combination of the \(m_i\). After localization, this yields an \(S^{-1}R\)-linear combination of the localized generators.

6.1.2 Detecting finite generation locally

Finite generation can sometimes be checked after localization. For example, over commutative rings, if a module is such that \(S^{-1}M\) is finitely generated for all localizations at a suitable collection of multiplicative sets, then \(M\) may be finitely generated. Precise criteria depend on how the ring is covered and on additional properties of the modules involved, but the general philosophy is that localization preserves finite generation and can be used to test it in “local pieces.”

6.2 Tensor products and base change

6.2.1 Finitely generated modules under extension

When changing scalars via a ring homomorphism \(R\to R'\), one forms \(R'\otimes_R M\). If \(M\) is finitely generated over \(R\), then \(R'\otimes_R M\) is finitely generated over \(R'\). Indeed, a generating set of \(M\) tensored with \(1\) provides generators for the tensor product.

6.2.2 Compatibility with tensoring (setup-level statements)

Tensoring is right exact, and it interacts well with quotients: \[ R'\otimes_R (M/N)\cong (R'\otimes_R M)/(R'\otimes_R N) \] under standard module-theoretic hypotheses. Such compatibility makes it possible to transport finite generation through base change and to analyze how presentations transform after extension of scalars.

7.1 Projective modules of finite type

A finitely generated projective module is a projective module that is finitely generated. Projective modules are characterized by lifting properties or by the existence of direct-sum decompositions after adding a complement. Finitely generated projectives behave like “finite-dimensional vector spaces” in many algebraic contexts, although projectivity is a stronger condition than finite generation alone.

7.2 Presentation of modules finitely presented

A module is finitely presented if it can be described by finitely many generators and finitely many relations. Formally, \(M\) is finitely presented if there is an exact sequence \[ R^m \to R^n \to M \to 0 \] for some finite \(m,n\). Every finitely presented module is finitely generated, but not conversely. Finitely presented modules are particularly important in controlling how module structure changes under operations like tensoring and in enabling computations via generators and relations.

7.3 Finite length and Artinian context (contrast)

Finite length refers to modules that admit a finite composition series where successive quotients are simple. Over Artinian rings (rings satisfying descending chain conditions on ideals), modules of finite length exhibit strong finiteness behavior that is different in nature from finite generation. A module can be finitely generated without having finite length, and a module can have finite length without being finitely generated if the underlying ring does not satisfy appropriate chain conditions. Thus these concepts measure different aspects of “finiteness.”

8 Practical computation and construction methods

8.1 Finding generators from presentations

In many algebraic settings, modules arrive with a presentation (an explicit map between free modules). From a presentation \(R^m \to R^n \to M \to 0\), the module \(M\) is generated by the images of the standard basis of \(R^n\). Thus, when a presentation is available, generating sets can often be read off immediately.

8.2 Computing generators in quotient modules

When \(M\) is finitely generated and one forms a quotient \(M/N\), generator computation is straightforward: take generators of \(M\) and pass to their cosets modulo \(N\). The only remaining task is to simplify if desired (for instance, removing redundant generators), which may require additional structural information about \(N\).

8.3 Generators via decomposition into simpler modules

If a module decomposes into a direct sum of simpler pieces whose generators are known, then a generating set for the whole module can be assembled from generators of the summands. This approach is common in cases like splitting into cyclic components (when possible) or into modules supported on different factors. Over general rings, decomposition may not always exist or may be complicated, but when it does, finite generation often follows from finite generation of the components.

9 Further structural results

9.1 Stability properties and permanence criteria

Finite generation is stable under homomorphic images and under finite direct sums. It is preserved under localization and under extension of scalars via tensor product. Stability under submodules and kernels typically requires extra hypotheses on the ring, such as Noetherianity, because without it one may encounter submodules that require infinitely many generators even when the ambient module is finitely generated.

9.2 Generator rank in common settings

9.2.1 Behavior under direct sums

In general, generator rank is subadditive: the minimal number of generators of \(M\oplus N\) is at most the sum of those of \(M\) and \(N\), since one can take the union of generating sets. Depending on the ring and the modules, the rank may be strictly smaller than the sum when overlaps in generated substructures occur.

9.2.2 Behavior under quotients (bounds and examples)

For a quotient \(M/N\), the generator rank cannot exceed that of \(M\), because the images of a minimal generating set for \(M\) generate \(M/N\). In special circumstances, one can often do better and compute the exact change in generator rank, but in general only bounds are guaranteed without additional information about \(N\) or the ring.