LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

finite local modules admit minimal free resolutions

Statement

Every finite module $M$ over a nonzero Noetherian local ring $(R, m, k)$ has an augmented resolution $\dots \to F_{1} \to F_{0} \to M \to 0$ by finite-rank free modules, with $d_{i} (F_{i}) \subseteq m F_{i - 1}$ for $i > 0$ . Such a resolution is called minimal; it need not be bounded. This extends the bounded terminology without changing it.

Facts & Assumptions

Given: The objects and hypotheses in the statement. We work with the Axiom of Choice; cited dependent-choice and resolution-existence hypotheses are retained.

[F1]

Minimal Free Resolution Over A Local Ring: A finite free resolution $F_{∙} \to N$ over local $(R, m)$ is minimal when $d_{i} (F_{i}) \subseteq m F_{i - 1}$ for every $i > 0$ .

[F2]

Assuming the Axiom of Choice, minimal generators over a local ring are exactly residue-field bases: Assume the Axiom of Choice. Let $(R, m)$ be a local ring with residue field $k = R / m$ , and let $M$ be a finitely generated left $R$ -module. A finite generating set $x_{1}, \dots, x_{r}$ of $M$ is minimal if and only if the images of $x_{1}, \dots, x_{r}$ in $M / m M$ form a $k$ -basis. In particular every minimal generating set of $M$ has the same cardinality.

[F3]

Assuming the Axiom of Choice, Nakayama's lemma: Assume the Axiom of Choice. Let $R$ be a commutative ring, let $I ⊴ R$ satisfy $I \subseteq J (R)$ , and let $M$ be a finitely generated left $R$ -module. If $I M = M$ , then $M = 0$ .

[F4]

Finite generation, ACC, and maximal-condition characterizations of Noetherian modules: For a left $R$ -module $M$ , the following are equivalent: every submodule is finitely generated; every ascending chain of submodules stabilizes; and every nonempty family of submodules has a maximal member. The implication from ACC to the maximal condition uses dependent choice; the other displayed implications are choice-free. See def-noetherian-module.

Proof

1.1

Choose a basis of $M / m M$ and lift it to $x_{1}, \dots, x_{r} \in M$ . If $N = \sum_{i} R x_{i}$ , then $M = N + m M$ , so the finite module $M / N$ satisfies $m (M / N) = M / N$ . Nakayama gives $M = N$ . Thus the corresponding map $F_{0} = R^{r} \to M$ is onto. A relation among the $x_{i}$ has all coefficients in $m$ , because their residue classes are independent. Hence $K_{0} = \ker (F_{0} \to M) \subseteq m F_{0}$ .

F2F3algebra

2.1

Every kernel is finite by Noetherianity. Repeating the same construction on $K_{0}$ and on each successive kernel produces an exact augmented complex whose differential images lie in the required maximal-ideal multiples. Dependent Choice suffices for the infinite recursive selections; the cited Nakayama results are used with their AC ledger. If a kernel is zero, choose zero modules thereafter; for $M = 0$ choose the zero complex. The bounded case agrees with the prior definition.

F4F3F1step 1.1∎

Depends on

Used by

Dependency tree · two levels

13 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Construction before Proposition 12.27, p.120 (standard reference, not scraped)