A module is meant to be the linear algebra of a ring, but the first surprise is that a module can be too large to describe by any finite list of vectors. A [vector space](/page/Vector%20Space) over a field is manageable when it has a finite basis: every vector is controlled by finitely many coordinates, and linear maps out of the space are determined by finitely many images. For a module over a general ring, bases may not exist, coordinates may not be unique, and spanning may be the only finite control available.

The question behind finitely generated modules is therefore practical and structural at the same time: when can an $R$-module be built from finitely many elements using the scalars of $R$? This condition is weaker than being free of finite rank, but strong enough to support quotients, exact sequences, presentations, Nakayama-type arguments, and the basic finiteness language of commutative algebra.

[example: The First Infinite Failure] Let $R$ be a nonzero ring, and consider the [direct sum](/page/Direct%20Sum) \begin{align*} M = \bigoplus_{i=1}^{\infty} R e_i. \end{align*} By definition of the direct sum, each element $m \in M$ has a unique expression \begin{align*} m = r_1e_1 + \cdots + r_de_d \end{align*} with only finitely many nonzero coefficients among the $r_i \in R$. We show that no finite list generates $M$. Let $m_1,\ldots,m_k \in M$. For each $j$, write \begin{align*} m_j = \sum_{i \in S_j} r_{ij} e_i \end{align*} where $S_j \subset \mathbb{N}$ is finite and $r_{ij} \in R$. The union \begin{align*} S = S_1 \cup \cdots \cup S_k \end{align*} is finite, so choose $N \notin S$. If $a_1,\ldots,a_k \in R$, then \begin{align*} a_1m_1 + \cdots + a_km_k = \sum_{j=1}^{k} \sum_{i \in S_j} a_j r_{ij} e_i. \end{align*} Every index appearing on the right lies in $S$, and $N \notin S$, so the $e_N$-component of this linear combination is $0$. But $e_N$ has $e_N$-component $1$, and $1 \ne 0$ because $R$ is nonzero. Hence $e_N$ is not in the submodule generated by $m_1,\ldots,m_k$. Thus every single element of $M$ has finite support, but no one finite stock of elements can generate all of $M$. [/example]

This example isolates the main issue. Finiteness is not about each individual expression being finite; module operations already require finite sums. It is about whether one fixed finite stock of elements suffices for every expression in the module.

## Definition

A [module](/page/Module) gives the ambient linear structure: addition inside $M$ and scalar multiplication by elements of $R$. The new condition answers a more economical question: can the entire module be reached from a fixed finite list, without asking for independence or unique coordinates?

[definition: Finitely Generated Module] Let $R$ be a ring, and let $M$ be a left $R$-module. The module $M$ is finitely generated if there exist an integer $k \ge 0$ and elements $m_1, \ldots, m_k \in M$ such that \begin{align*} M = Rm_1 + \cdots + Rm_k = \{r_1m_1 + \cdots + r_km_k : r_1, \ldots, r_k \in R\}. \end{align*} The elements $m_1, \ldots, m_k$ are called a finite generating set for $M$. [/definition]

When $k=0$, the displayed set is the empty sum construction, so the resulting module is the zero module. The definition does not require the list to be minimal. It also does not require the coefficients to be unique. To connect this spanning condition with maps and exact sequences, we need a formulation that replaces a list of generators by one canonical surjection from a finite free module.

[quotetheorem:9966]

This characterization is the bridge from spanning language to homological language. A finitely generated module is exactly a quotient of a finite free module. That viewpoint becomes important whenever a ring extension or algebra is being studied through its underlying module structure, because algebra generation and module generation answer different questions.

Sometimes the object being studied is a ring $S$ equipped with a map from $R$, but the intended finiteness is still module-theoretic. The following definition prevents ambiguity by saying that multiplication in $S$ is not allowed as a generating operation; only $R$-linear combinations are allowed.

[definition: Module-Finite Ring Extension] Let $\varphi: R \to S$ be a ring homomorphism. Give $S$ the left $R$-module structure defined by \begin{align*} r \cdot s = \varphi(r)s \end{align*} for $r \in R$ and $s \in S$. The ring $S$ is module-finite over $R$, or finitely generated over $R$ as an $R$-module, if this left $R$-module is finitely generated. [/definition]

In the usual commutative unital algebra setting, module-finite is stronger than being finitely generated as an $R$-algebra. For instance, $R[x]$ is generated as an $R$-algebra by $x$, but it is usually not finitely generated as an $R$-module, because the powers $1,x,x^2,\ldots$ cannot be captured by finitely many $R$-linear generators.

[example: Polynomial Rings Separate Two Finiteness Notions] Let $R$ be a nonzero commutative ring. As an $R$-algebra, $R[x]$ is generated by $x$: if \begin{align*} f(x)=a_0+a_1x+\cdots+a_nx^n \end{align*} with $a_i \in R$, then each term $a_ix^i$ is obtained from the scalar $a_i \in R$ and the generator $x$ by multiplication, and the polynomial is obtained by adding these finitely many terms. We show that the same ring is not finitely generated as an $R$-module. Suppose, toward a contradiction, that $f_1,\ldots,f_k \in R[x]$ generate $R[x]$ as an $R$-module. For each $j$, write \begin{align*} f_j=a_{j0}+a_{j1}x+\cdots+a_{jd_j}x^{d_j} \end{align*} with $a_{ji}\in R$ and $d_j \ge 0$, allowing $f_j=0$ by taking all displayed coefficients equal to $0$. Let $d=\max(d_1,\ldots,d_k)$. If $r_1,\ldots,r_k \in R$, then \begin{align*} r_1f_1+\cdots+r_kf_k=\sum_{j=1}^{k}r_j(a_{j0}+a_{j1}x+\cdots+a_{jd}x^d) \end{align*} where $a_{ji}=0$ for $i>d_j$. Expanding by distributivity, \begin{align*} r_1f_1+\cdots+r_kf_k=(\sum_{j=1}^{k}r_ja_{j0})+(\sum_{j=1}^{k}r_ja_{j1})x+\cdots+(\sum_{j=1}^{k}r_ja_{jd})x^d. \end{align*} Thus every $R$-linear combination of $f_1,\ldots,f_k$ has zero coefficient of $x^{d+1}$. But the polynomial $x^{d+1}$ has coefficient $1$ on $x^{d+1}$, and $1\ne 0$ because $R$ is nonzero. Hence $x^{d+1}$ is not in the $R$-span of $f_1,\ldots,f_k$, contradicting the assumption that they generate $R[x]$. So $R[x]$ is generated by one element as an $R$-algebra, but as an $R$-module it needs the infinite family $1,x,x^2,\ldots$ rather than any finite list. [/example]

The definition is deliberately modest. It asks for finite spanning data, and much of algebra is about understanding how far that data can be pushed.

## Generators and Relations

Finite generation tells us that the module is a quotient of $R^k$, but the quotient may identify many different coordinate vectors. The next problem is to distinguish the generators from the relations among them. This is where module theory starts to depart from finite-dimensional vector spaces.

### Generated Submodules

Before relations can be named, we need a construction that starts with an arbitrary subset and returns the smallest submodule forced to contain it. This answers the local question behind finite generation: what exactly is produced by a chosen stock of elements?

[definition: Submodule Generated by a Set] Let $R$ be a ring, let $M$ be a left $R$-module, and let $S \subset M$. The submodule generated by $S$ is \begin{align*} RS = \left\{\sum_{i=1}^{n} r_i s_i : n \ge 0,\ r_i \in R,\ s_i \in S\right\}, \end{align*} where the case $n=0$ is the empty sum $0$. For a finite set $S = \{m_1, \ldots, m_k\}$, this submodule is denoted $Rm_1 + \cdots + Rm_k$. [/definition]