Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 R be a ring, let M be a finitely generated left R-module (Generated submodule, cyclic and finitely generated modules, module basis and free module) and let S⊆M satisfy ⟨S⟩R=M. Then some finite subset S′⊆S already satisfies ⟨S′⟩R=M.

No hypothesis is placed on S itself, which may be infinite, and none on R beyond being a ring.

Facts & Assumptions

Given: A ring R, a finitely generated left R-module M, and a subset S⊆M generating M.

[L1]

M is finitely generated when M=⟨T⟩R for some finite T, and ⟨T⟩R is the smallest submodule of M containing T (Generated submodule, cyclic and finitely generated modules, module basis and free module).

[L2]

For a ring R, a left R-module M and a subset S⊆M, the submodule ⟨S⟩R is the set of finite sums ∑i=1krisi with k∈N, ri∈R and si∈S, the term with k=0 being 0M (The submodule generated by a subset consists of the finite R-linear combinations of that subset).

Proof

technique · direct
1.1L1given

Fix a finite T⊆M with ⟨T⟩R=M, available because M is finitely generated, and recall the hypothesis ⟨S⟩R=M.

2.1L2step 1.1given

For each t∈T we have t∈M=⟨S⟩R, so t=∑i=1krisi for some k∈N, some r1,…,rk∈R and some s1,…,sk∈S; write St:={s1,…,sk}⊆S, a finite set with t∈⟨St⟩R. One such expression is selected for each of the finitely many elements of T, so this is a finite sequence of selections and no choice axiom is used.

3.1step 2.1algebra

Put S′:=⋃t∈TSt. This is a union of finitely many finite sets, hence finite, and S′⊆S; moreover St⊆S′ gives ⟨St⟩R⊆⟨S′⟩R, so t∈⟨S′⟩R for every t∈T, that is T⊆⟨S′⟩R.

4.1L1step 1.1step 3.1∎

⟨S′⟩R is a submodule of M containing T, so it contains the smallest such submodule, namely ⟨T⟩R=M; and ⟨S′⟩R⊆M always. Hence ⟨S′⟩R=M with S′⊆S finite.

Remarks

  • The finite generating subset depends on the chosen T, and no smallest one is claimed. Different finite generating sets T produce different subsets S′, and the lemma asserts only that some finite subset of S generates. It says nothing about the least possible size of such a subset.

  • The hypothesis that M 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