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.
Every generating set of a finitely generated module contains a finite generating subset
Statement
Let be a ring, let be a finitely generated left -module (Generated submodule, cyclic and finitely generated modules, module basis and free module) and let satisfy . Then some finite subset already satisfies .
No hypothesis is placed on itself, which may be infinite, and none on beyond being a ring.
Facts & Assumptions
Given: A ring , a finitely generated left -module , and a subset generating .
is finitely generated when for some finite , and is the smallest submodule of containing (Generated submodule, cyclic and finitely generated modules, module basis and free module).
For a ring , a left -module and a subset , the submodule is the set of finite sums with , and , the term with being (The submodule generated by a subset consists of the finite -linear combinations of that subset).
Proof
Fix a finite with , available because is finitely generated, and recall the hypothesis .
For each we have , so for some , some and some ; write , a finite set with . One such expression is selected for each of the finitely many elements of , so this is a finite sequence of selections and no choice axiom is used.
Put . This is a union of finitely many finite sets, hence finite, and ; moreover gives , so for every , that is .
is a submodule of containing , so it contains the smallest such submodule, namely ; and always. Hence with finite.
Remarks
-
The finite generating subset depends on the chosen , and no smallest one is claimed. Different finite generating sets produce different subsets , and the lemma asserts only that some finite subset of generates. It says nothing about the least possible size of such a subset.
-
The hypothesis that is finitely generated cannot be dropped. Without it the conclusion is the assertion that every generating set of every module has a finite generating subset, which would make every module finitely generated, since a module always generates itself.
Depends on
Used by
Dependency tree · two levels
7 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
- J. S. Milne, A Primer of Commutative Algebra, v4.03, §3 (3.15) (standard reference, not scraped)
- A. Altman and S. Kleiman, A Term of Commutative Algebra, 13th ed., Exercise (16.2) (standard reference, not scraped)